Finding Minimum Cost for Climbing the stairs using Dynamic Programming

In this article, we will cover a famous dynamic programming question, "Finding Minimum Cost for climbing the stairs".

Read More →

Algorithm for Target Sum Problem using Dynamic Programming

In this article, we will cover a famous dynamic programming question, 'Target Sum'. We are given some number say a,b,c,d.......n, also we are given a target that we need to make. This value i.e. target needs to be made using all the given numbers
This means we can either choose from a + or a - for every number so that we can make a total sum = Target

Read More →

C Program to find Repeated Element in an array

Often we have a requirement to find elements that are repeating in an array. So let's see a very simple program to find repeated elements in an array.

Read More →

GRUB2 bootloader Huge BootHole flaw leaves millions of Windows and Linux systems at risk from hackers

A serious vulnerability named BootHole has been discovered in the GRUB2 bootloader. Millions of systems are at risk of being exposed to hackers -- primarily those running Linux, but Windows is also affected.

Read More →

EU antitrust complaint filed against Apple's App Store by Telegram

Telegram, famous messaging app, complaint to EU competition chief Margrethe Vestager, said Apple must 'allow users to have the opportunity of downloading software outside of the App Store.'

Read More →

iOS users can backup their devices to Google for free soon

Google added an additional perk to Google's One subscription service, offering automatic phone backup for paying Android users – and recently, the company has announced that that feature is being made free of charge, while also being extended to iPhone and iPad owners.

Read More →

The Unique Paths with Obstacles problem using Dynamic Programming

In this article, we will cover a famous dynamic programming question, "Unique paths with Obstacles". We will also see its implementation in Python

Read More →

Algorithm for Unique Paths problem using Dynamic Programming

In this article, we will cover a famous dynamic programming question, "Unique paths". Consider a robot/person that has to reach from a starting point to a final location in a 2D grid with m rows and n columns. The person to start with is on the top-left position (0,0) and it has to reach the last cell, the bottom right corner (m-1, n-1)

Read More →
Contact Us
Need any Technical Help Online
Message Us
Search

Play 2048 Game Online