Dynamic Programming
You must have heard about it when preparing for technical interviews, fought through it in a data structures course, or learned how to code on your own; someone must have...
Floyd Warshall Algorithm
This article will discuss the Floyd warshall algorithm, the working of the Floyd warshall algorithm, implementation of the Floyd warshall algorithm in C++, time complexity analysis of the Floyd warshall...
TOYS
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...
FOOLISH ITEMS
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...
BST COUNT
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....
LONGEST COMMON SUBSEQUENCE
CONCEPTS USED: Dynamic programming DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): PrepBuddy is too good with string observations but now the Dark Lord thought to defeat PrepBuddy. So he gave him two...
COIN DIVISION
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...
DROP EGG
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...
CHEATING CLASS
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...
FORM STRING
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...
RAHUL AND PUZZLE WORLD
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...
CHOCOLATE DILEMMA
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...
MONOPOLY AGAIN
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...
MONOPOLY ONCE AGAIN
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...