Distinct DishtingYou are given an array of N integers. Then there will be Q commands of the following type: 1) Change...

Taju Kage Bunshin No JutsuNaruto Uzumaki is one of the strongest ninja of RUET (Rasengan University of Ebisu and Tobi), posses...

Count the ChaosImagine, you have an array of integers of size N. At each index of this array is a unique integer fr...

Find the Good SequenceLet's say two numbers are called "good" if their difference is at least 2. Similarly, a ...

Set UnionGiven two sets of integers, print the set containing the union of the two input sets. For example, g...

Dengue Affected AreasDengue, the talk of the town of Dhaka this year. So many people suffered from dengue fever and a num...

CrayonsFive friends A, B, C, D and E has come to a shop to buy crayons for their art project. They need cra...

Neat BracketsGiven a sequence of opening and closing parentheses ("(" and ")") you will have to d...

City of BurgerlandHave you ever heard of The Burgerland City? The city is full of burger shops. You will surely find s...

Ajob Commute IIOnce again we return to Ajobshohor, the capital city and the heart of Ajobdesh. Ajobshohor’s road sy...

Phi Numbers in Range!In number theory, Euler’s phi function, denoted as ϕ(n), is an arithmetic function which counts the ...

Rivalry FriendsRyo and his girlfriend love to think about challenges. One day his girlfriend gave him a challenge t...

Productive EmployeesCongratulations on becoming the new boss of "Horizontal Company, branch: Sylhet"! But now yo...

MSIS!Do you know what MSIS is? MSIS is the abbreviation for Maximum Sum Increasing Subsequence. It is a s...

ModuloLet's get straight into the problem. In ths problem, here will be multiple test cases. In each t...

StraightforwardNo gossip. In this problem I will just say what to do. Initially, you will be given a bracket sequen...

Palindrome Query IYou are given a string of length L. You have Q queries. In each query, you will be asked to either u...

Naughty Subsequence  V2.0Mahib loves ‘Naughty Subsequence’s. He will give you an array of characters ara[0,1,...,n1] that c...

Hamming DistanceHamming distance between two binary strings of equal length is the number of mismatches between ever...

Poltu and GraphPoltu has got a graph with N nodes and M edges. Every edge has a weight. There can be multiple edges...
