Suppose we have an array A of 0s and 1s, consider N[i] is the i-th subarray from index A[0] to A[i] interpreted as a binary number. We have to find a list of boolean answers, where answer[i] is true if and only if N[i] is divisible by 5.So, if the input is like [0, 1, 1, 1, 1, 1], then the output will be [true, false, false, false, true, false]To solve this, we will follow these steps −length := size of Aans:= make an array of size length, and fill with falsenumber:= a binary value by concatenating each element from ... Read More

Suppose we have two positive integers x and y, we can say an integer is powerful if it is equal to x^i + y^j for some integers i >= 0 and j >= 0. We have to find a list of all-powerful integers that have value less than or equal to bound.So, if the input is like x = 2 and y = 3 and the bound is 10, then the output will be [2, 3, 4, 5, 7, 9, 10], as 2 = 2^0 + 3^0 3 = 2^1 + 3^0 4 = 2^0 + 3^1 5 = 2^1 ... Read More

Suppose we have an array of 4 digits, we have to find the largest 24-hour time that can be made. We know that the smallest 24-hour time is 00:00, and the largest time is 23:59. Starting from 00:00, a time is larger if more time has elapsed since midnight. We have to return the answer as a string of length 5. If there is no valid time to be returned, then return an empty string.So, if the input is like [1, 2, 3, 4], then the output will be "23:41"To solve this, we will follow these steps −Define a function ... Read More

Suppose we have an array of N lowercase letter strings, the array name is A, all strings are of same length. Now, we can choose any set of deletion indices, and for each string, we delete all the characters in those indices.As an example, if we have an array A like ["abcdef", "uvwxyz"] and deletion indices are {0, 2, 3}, then the final array after deletions will be ["bef", "vyz"], and the remaining columns of A are ["b", "v"], ["e", "y"], and ["f", "z"].Suppose we chose a set of deletion indices D like after deletions, each remaining column in A ... Read More

Suppose we have a string S that only contains "I" (to denote increase) or "D" (to denote decrease), let N = size of S. We have to return any permutation A of [0, 1, ..., N] such that for all i in range 0, ..., N-1 −If S[i] is "I", then A[i] < A[i+1]Otherwise when S[i] is "D", then A[i] > A[i+1]So, if the input is like "IDID", then the output will be [0, 4, 1, 3, 2]To solve this, we will follow these steps −A := a list from 0 to N where N is the size of S.res ... Read More

Suppose we have an array A of integers; we have to check whether it is a valid mountain array or not. We know that A is a mountain array if and only if it satisfies the following situations − size of A >= 3There exists some index i in A such that −A[0] < A[1] < ... A[i-1] < A[i]A[i] > A[i+1] > ... > A[A.length - 1]So, if the input is like [0, 3, 2, 1], then the output will be True.To solve this, we will follow these steps −if size of A < 3, thenreturn Falsei := 1while ... Read More

Suppose we have an array of logs. In that array each entry is a space delimited string of words. The first word in each log is an alphanumeric identifier. Then, there are different types of strings like below −Each word after the id will consist only of lowercase letters;Each word after the id will consist only of digits.We will call these two types of logs as letter-logs and digit-logs respectively. And ti is guaranteed that each log has at least one word after its id.We have to reorder the logs so that all of the letter-logs stays before any digit-log. ... Read More

Suppose we want to write a class called RecentCounter to count recent requests. This class has only one method: ping(t), where t is representing some time in milliseconds. This will return the number of pings that have been made from 3000 milliseconds ago until now. Any ping with time in [t - 3000, t] will count, including the current ping. And it is guaranteed that every call to ping uses a strictly larger value of t than before.So, if the input is like Call ping four times ping(1), ping(100), ping(3001), ping(3002), then the output will be 1, 2, 3, 3 ... Read More

Suppose we have a deck of cards, each card has an integer written on it. We have to check whether we can choose X >= 2 such that it is possible to split the entire deck into 1 or more groups of cards, where the following condition satisfies: Each group has exactly X number of cards. All of the cards in each group have the same number.So, if the input is like deck = [1, 2, 3, 4, 4, 3, 2, 1], then the output will be True, as possible partitions are [1, 1], [2, 2], [3, 3], [4, 4].To ... Read More

Suppose we have an array A of integers, now for each integer A[i] we can choose any x with range [-K to K] then add x to A[i]. Now after this process, we have some array B. We have to find the smallest possible difference between the maximum value of B and the minimum value of B.So, if the input is like A = [0,10], K = 2, then the output will be 6, as B = [2,8]To solve this, we will follow these steps −MAX := (maximum of A) - KMIN := (minimum of A) + Kdifference := MAX - MINif difference