Happiness

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

LIDS

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

Alice in Candyland

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

Counting Murgis

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

Third Dimension

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

Messy Table

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

Easy Sequence 1

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)...

Help Chokro

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

Subset AND

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

Happy Sub-Sequence

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

T5 Racing

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

Gaaner Koli

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

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 Seco...

OCD Returns!

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

The Perfect Collection

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

Subarray Sum

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

Maximum Sum

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

Sticking Pins

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

Very Dirty String

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

Smart Feature Phone 2

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

Orchid Division

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

Paying Bills

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

Easy Sequence 2

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)=...

Dominoes Forever

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

Pathetic Interview II

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

Toph uses cookies. By continuing you agree to our Cookie Policy.