Divide and Conquer Problems

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

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

shovonshovo DP, DigitDP 144/194/927

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

Labib666 Bitmask, DP 13/25/73

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

Mesbah Combinatorics, DP 191/282/645

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

ridowan007 Combinatorics, Counting, DP 110/138/231

Akib is a very good student but his reading table is very messy. One Friday afternoon, Akib is sitti...

TarikHassan DP 58/97/266

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 264/310/506

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 79/129/459

You are given an array A of n integers and an integer k. You need to find if there is any non-empty ...

YouKnowWho Greedy 107/126/234

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

dhruba_1603088 DP 39/42/97

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 20/27/155

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

jackal_1586 Bitmask, DP 28/40/162

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

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

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

himuhasib DP 44/190/499

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

Labib666 DP 36/59/223

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 105/159/687

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

tahmedge DP 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 6/6/30

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

IamHot DP 46/85/409

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

maruf_0011 DP 5/9/98

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

spider004 Constructive, DP, TwoPointer 4/5/10

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 127/162/536

Once when I was little, my father took me to a tobacco shop! It is surprising, but true. He asked th...

DP, Greedy, Implementation 58/81/512

You all know about the story of Pathetic Interview-I. Today, I am sharing a story of my close friend...

spider004 DP 15/23/111