DP Problems

Pias and Chokro are good friends. Pias's birthday is coming soon. So, Chokro wants to gift Pias an a...

RUDRA_DAS BinarySearch, DP, NumberTheory, Sorting, TernarySearch Moderate 80/130/467

You are given an array having N integers. You have to select at most K positions in the array and re...

bertho_coder DP, DataStructure Moderate 106/160/692

There are nnn bamboos in a row. Khan the bamboo cutter is going to cut them all one by one. He can d...

shihan04 DP Easy 47/93/235

Recall that the sequence b is a subsequence of the sequence a, if b can be derived from a by removin...

jisan047 DP Moderate 25/42/154

Recently Alex has participated in a programming contest. He became 1st runner up. He couldn't solve ...

dhruba_1603088 DP Very Hard 40/43/98

It is high time for the annual T5 racing and your team is planning to win the race. In T5 racing the...

olee12 DFS, DP, Graph Moderate 21/29/158

Thanos has now figured out how to visit all the houses in the flood-affected area. However, now he h...

mihassan DP, NumberTheory Moderate 67/100/270

Bob has an initial array D of length n . Alice is a good friend of Bob. So Bob challenges Alice to f...

DP, NumberTheory Moderate 13/17/35

Alice came up with a new game. In this game called "Candy Quest", there is a NxN size 2D g...

Labib666 Bitmask, DP Moderate 13/25/73

Given an array A of N integers, if we choose any K of these integers and calculate their bitwise XOR...

Labib666 DP Moderate 36/59/223

We all know about LIS (Longest Increasing Sub sequence). The task to find the length of the longest ...

shovonshovo DP, DigitDP 144/194/927

"There was a break-in of Gringotts Wizarding Bank on 1 May, 1998, during the height of the Seco...

Sherlock221b Bitmask, Combinatorics, Counting, DP Moderate 8/20/36

The protagonists of this problem are two great programmers of a certain institution Omanush and Ordi...

jackal_1586 Bitmask, DP Moderate 28/40/162

Strings are difficult, most of the contest programmers say this and try to avoid string algorithms. ...

IamHot DP Moderate 46/85/409

This problem author has OCD (obsessive–compulsive disorder). One day his teacher gave him an array o...

himuhasib DP Moderate 44/190/499

Little Jimmy loves to play with numbers. One day he was playing with a number sequence. In his game,...

tahmedge DP Moderate 72/145/484

You are sticking pins on a 2D board at N given coordinates. However, since you are not very good at ...

zobayer ConvexHull, DP Moderate 6/6/30

Mr. J wants to learn about combinatorics. He started reading a book on combinatorics and came across...

ridowan007 Combinatorics, Counting, DP Moderate 110/138/231

Quido has a square orchard full of various fruit and nut trees. The trees are planted in regular row...

spider004 Constructive, DP, TwoPointer Moderate 4/5/10

Let’s define an easy sequence F. Where F(1)=1 F(1) = 1 F(1)=1 F(2X)=F(X)2+1 F(2X) = F(X)^2 + 1 F(2X)...

ridowan007 BinarySearch, DP Very Easy 264/310/506

Alice worked in CIA. Right now he need to send an encrypted message to the headquarter(HQ) of CIA. ...

maruf_0011 DP Moderate 5/9/98

Ever since that wicked thief took away some of her murgis (hens, that is), Meena was ever anxious th...

Mesbah Combinatorics, DP Easy 191/282/645

If you have a Tk 100 in your wallet, what would you do? You might have couple of ways to spend that ...

ahmed.shamim DP 204/312/795

Mued is finally home for summer vacation after surviving yet another semester of the mighty CS Under...

imranbinazad Bitmask, DP 48/57/180

Let’s define a easy sequence F. Where F(1)=1 F(1) = 1 F(1)=1 F(2X)=F(X)2+1 F(2X) = F(X)^2 + 1 F(2X)=...

ridowan007 DP Moderate 127/162/536