# Dynamic Programming Problems

 Easy Sequence 1Let’s define an easy sequence F. Where: F(1)=1 F(2X)=F(X)2+1 F(2X+1)=F(X)×F(X+1)+2 Here X is a posit... Very Easy 321/375/623 Make It Big!You are given a number N (10 ≤ N ≤ 2×109). You have to perform exactly two swap operation. You can c... Very Easy 183/442/1k The Perfect CollectionGiven an array A of N integers, if we choose any K of these integers and calculate their bitwise XOR... Moderate 46/70/257 Maximize SumYou are given two integer arrays A and B of length n and m respectively. You can do the following op... Moderate 25/31/125 LIDSWe all know about LIS (Longest Increasing Sub sequence). The task to find the length of the longest ... KnapsackYou have a backpack that can carry a maximum weight of C. You will also be given a set of items, the... Very Easy 73/91/225 Video GameShefin is playing a game. In this game there are N buildings numbered from 1 to N. Each building has... Moderate 84/98/228 Do You Know Tree ?"Stay at least one metre distance from others.” Corona has affected the World as well as Bangladesh.... Moderate 25/31/94 Help ChokroPias and Chokro are good friends. Pias's birthday is coming soon. So, Chokro wants to gift Pias an a... Holy TreeWhat is a tree? A tree is a bidirectional connected graph with no cycle. In a tree, we can create ... Moderate 24/41/140 Hasinur's Mission!Let me tell you something about Hasinur: He is a religious person. He prays 5 times a day. He loves... Moderate 35/36/74 No GCDYou are given N integers. Each integer is square free (i.e. it has no divisor which is a square numb... Moderate 22/46/204 Harry Potter and the Vault of Gringotts"There was a break-in of Gringotts Wizarding Bank on 1 May, 1998, during the height of the Second Wi... Moderate 10/25/42 Gaaner KoliThe protagonists of this problem are two great programmers of a certain institution Omanush and Ordi... Alice in CandylandAlice came up with a new game. In this game called "Candy Quest", there is a NxN size 2D grid. In ea... Moderate 20/33/92 OCD Returns!This problem author has OCD (obsessive–compulsive disorder). One day his teacher gave him an array o... Moderate 52/204/521 Subarray SumYou are given an array having N integers. You have to select at most K positions in the array and re... Moderate 134/190/840 Maximum SumLittle Jimmy loves to play with numbers. One day he was playing with a number sequence. In his game,... Moderate 90/168/597 Sticking PinsYou are sticking pins on a 2D board at N given coordinates. However, since you are not very good at ... Very Dirty StringStrings are difficult, most of the contest programmers say this and try to avoid string algorithms. ... Moderate 54/95/440 Third DimensionMr. J wants to learn about combinatorics. He started reading a book on combinatorics and came across... Moderate 120/151/248 Orchid DivisionQuido has a square orchard full of various fruit and nut trees. The trees are planted in regular row... Smart Feature Phone 2Alice worked in CIA. Right now he need to send an encrypted message to the headquarter(HQ) of CIA. ... Moderate 7/12/43 Counting MurgisEver since that wicked thief took away some of her murgis (hens, that is), Meena was ever anxious th... Very Easy 223/322/729 HappinessIf you have a Tk 100 in your wallet, what would you do? You might have couple of ways to spend that ...