Suppose we have a string s. We have to find all possible combinations of letters of s. If there are two strings with same set of characters, then show the lexicographically smallest of them. And one constraint is each character in s are unique.So, if the input is like s ... Read More

Suppose we have limited coins of denominations (₹1, ₹2, ₹5 and ₹10). We have to find in how many ways can you sum them up to a total of ₹n? We have an array count of size 4, where count[0] indicates coins of ₹1, count[1] indicates coins of ₹2 and ... Read More

Suppose we have to calculate nCr values many times. We can solve this very efficient way. If we store the lower values of nCr we can easily find higher values. So if we have n, we have to find list of nC0 to nCn. If answer is too large then ... Read More

Suppose we want to find the total area covered by two rectilinear rectangles in a 2D plane. Here each rectangle is defined by its bottom left corner and top right corner as shown in the figure.To solve this, we will follow these steps −width_1 := |C-A|, height_1 := |D-B|width_2 := ... Read More

Suppose we have a sequence nums of size n. We have to find the maximum size of subsequence of nums in which every pair (p, q) is a nice pair? A pait is said to be nice pair if and only if it holds at least one of these conditions: ... Read More

Suppose we have a number A. We have to generate a large number X by concatenating A, n times in a row and find the value of X modulo m.So, if the input is like A = 15 n = 3 m = 8, then the output will be 3, ... Read More

Suppose there is a strange language called Ajob language. It has infinite number of letters. We know n words in this language. The first word is one character long, second one is two character long and so on. And all letters in a word are unique. If we select any ... Read More

Suppose we have a number n, and another number k. We have to check whether n can be represented as a sum of k prime numbers or not.So, if the input is like n = 30 k = 3, then the output will be True because 30 can be represented ... Read More

Suppose there is a function f(x), that counts number of (p, q) pairs, such that1 < p

Suppose we have a number n. If we have numbers like [1, 2, ..., n] we have to count number ofpossible BSTs can be formed using these n values. If the answer is too large, then mod the result by 10^9+7.So, if the input is like n = 3, then ... Read More