Mr Max Count Sum Mr Max , Mr Sum and Mr Count are three neighbours. They have a common enemy, an old man living in th... |
Exists or Not Exists You will be given some numbers. Then there will contain some queries. In every query there will be g... |
Naughty Subsequence - V2.0 Mahib loves ‘Naughty Subsequence’-s. He will give you an array of characters ara[0,1,...,n-1] that c... |
Hamming Distance Hamming distance between two binary strings of equal length is the number of mismatches between ever... |
Taju Kage Bunshin No Jutsu Naruto Uzumaki is one of the strongest ninja of RUET (Rasengan University of Ebisu and Tobi), posses... |
Set Union Given two sets of integers, print the set containing the union of the two input sets. For example, g... |
Neat Brackets Given a sequence of opening and closing parentheses ("(" and ")") you will have to determine if it i... |
Matching Brackets You will be given a sequence of opening and closing brackets of different types ((, ), [, ], {, and ... |
Laser Light A 2D grid consists of a lot of special lights bulbs, which turns on upon the incidence of a laser li... |
Powerful Array You are given an array A of N integers . Now you have to process Q queries in this array. Each query... |
Nearest Light We, iuian develop a virtual vertical line with infinite length are numbered starting from zero from ... |
StackLang StackLang is a stack-based programming language. Here, each program contains a series of commands th... |