Suppose we have an array of integers A. We have to find the number of triples of indices (i, j, k) such that −0 <= i < size of A0 <= j < size of A0 <= k < size of AA[i] AND A[j] AND A[k] is 0, where AND ... Read More

Suppose we have two strings, these are S and T, each of which represents a positive rational number, We have to check whether they represent the same number or now. The strings may use parentheses to denote the repeating part of the rational number.As we know that rational numbers can ... Read More

Suppose we have a positive integer x, we will write an expression of the form x (op1) x (op2) x (op3) x ... where op1, op2, etc. are the operators. And these operators can be either addition, subtraction, multiplication, or division. For example, with x = 3, we might write ... Read More

Suppose we have an array A of N strings. Each string is consists of lowercase letters, all are of same length. Now, we can choose any set of deletion indices, and for each string, we will delete all the characters in those indices.Now consider we have taken a set of ... Read More

Suppose we are installing a billboard and we want it to have the largest height. The billboard will have two steel supports on both sides. Each support must be of equal height. We also have a collection of rods which can be welded together. So, if we have rods of ... Read More

Suppose we have an array A of unique positive integers, now consider the following graph −There are length of A number of nodes, these are labelled A[0] to A[size of A - 1]; There is an edge between A[i] and A[j] when A[i] and A[j] share a common factor greater ... Read More

Suppose we have an array A of strings, we have to find any smallest string that contains each string in A as a substring. We can also assume that no string in A is substring of another string in A.So, if the input is like ["dbsh", "dsbbhs", "hdsb", "ssdb", "bshdbsd"], ... Read More

Suppose we have a string S, we have to count the number of distinct subsequences of S. The result can be large, so we will return the answer modulo 10^9 + 7.So, if the input is like "bab", then the output will be 6, as there are 6 different sequences, ... Read More

Suppose we have one array A of 0s and 1s, we have to divide the array into 3 non-empty parts such that all of these parts represent the same binary value. If that is possible, return any [i, j] with i+1 < j, such that −A[0], A[1], ..., A[i] is ... Read More

Suppose we have a music player, that contains N different songs and we want to listen to L songs during our trip. So we have to make a playlist so that it meets these conditions −Every song is played at least onceA song can only be played again only if ... Read More