Suppose we have an array A with n elements. In a university for each course there is the special group whose name equals the year of university entrance of corresponding course of students at the university. Each of students joins the group of his course and joins all groups for ... Read More

Suppose we have a list of strings S with n numeric strings. Amal has n friends in a city. Amal knows phone numbers of all his friends: they are stored in S. All strings in S are of same length. Once Amal needed to figure out the city phone code. ... Read More

Suppose we have a 2D matrix of characters of size n x m. Where '*' and '.' two types of characters are present. Only three '*'s are there, representing there are 3 robberies, and all other places are marked as '.'. A detective got an information that the fourth robbery ... Read More

Suppose we have a string S where a decimal real number is given. There is a king called Amal, and his son Bimal is in a kingdom. There are other citizens also. They lived happily until great trouble came into the Kingdom. The monsters settled there. Most damage those strange ... Read More

Suppose we have an array A with n elements. There are n episodes of a TV series. They are numbered from 1 to n. We have watched episodes written in array A, but missed one. We have to find which episode we have missed.Problem CategoryVarious problems in programming can be ... Read More

Suppose we have an array A with n elements and two values a and b. Amal and Bimal are two brothers. Their parents left them home alone and commissioned them to do n chores. Each chore has its complexity. The complexity of the i-th chore equals A[i]. Amal is older, ... Read More

Suppose we have a string S. S is a password. If a password is complex, if it meets all of the following conditions −Password length is at least 5 characters;Password contains at least one uppercase letter;Password contains at least one lowercase letter;Password contains at least one digit.We have to check ... Read More

Suppose we have an array A with n elements. A[i] determines the ith id. A[i] is the number of SKP call session. If A[i] is 0, it indicates the person is not using SKP calling system. We have to analyze these data and find out the number of pairs of ... Read More

Suppose we have a nested list with n sub-lists L. There are several stops on a tram track. Among them only n stops we have seen. L[i] contains another list and the size of L[i] list determines the number of tram lines on that stop. The values of L[i] list ... Read More

Suppose, there is a jackpot lottery going on where there are 100 tickets, each ticket numbered within a number from 1 to 100. Now, the lottery company has decided only the player with ticket number 20 will win the jackpot prize, and ticket holders of number 11 to 21 will ... Read More