Category: Dynamic programming

You must have heard about it while preparing for technical interviews, struggled through it in a data structures course, or learned how to code on your own; somewhere along the...

The Floyd Warshall algorithm in C is a dynamic programming approach used to find the shortest path between all pairs of vertices in a weighted graph. It is applicable to...

Concepts Used DYNAMIC PROGRAMMING Difficulty Level Easy. Problem Statement : Once upon a time, Arya visited a toy store. As Arya is a small kid he is attracted to every...

CONCEPTS USED: Dynamic programming. DIFFICULTY LEVEL: Easy. PROBLEM STATEMENT(SIMPLIFIED): Arnab is now handed N rupees, he is asked by his mom to buy at least two ingredients which when used...

CONCEPTS USED: Recursion,Dynamic programming. DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): Arnab is now given N nodes. Now he asked how many binary search trees can be formed using those N nodes....

LCS, which stands for "Longest Common Subsequence" is a fundamental problem in computer science and bioinformatics. It involves finding the longest subsequence that is common to two or more sequences....

CONCEPTS USED: Dynamic programming. DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Arnab is now given N numbers, which are actually stacks of coins containing a[i] amount of coins each. Now he is...

CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Himanshu visited a building with N floors and he carried with him k eggs, he found out that the eggs are...

Concepts Used Dynamic programming. Difficulty Level Medium. Problem Statement : Let's suppose when a person i cheats from a person j, then we draw a line segment between them. We...

CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT (SIMPLIFIED): Arnab is now given a String S. He is given N different typed of pieces of sticks with strings written...

CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): For each query , give the size of maximum square with all pictures i.e. all ones from the given matrix of...

CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Arnab can take one candy from each row of candies but with the restrictions imposed: There are 3 sections in each...

CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): After having lost to you the last time, your friend challenges you to another round of Monopoly. This time, he changes...

CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): After having lost to you again, your friend challenges you yet again for another round of Monopoly. This time, he changes...