Suppose we have an undirected graph G with n nodes. Now consider the cost of a simple undirected graph is the sum of the costs of its nodes. And The cost of a node is D^k, where D is its degree. Now we have n and k values. We have ... Read More

Suppose we have a set A where all elements from 1 to n are present. And P(A) represents all permutations of elements present in A. We have to find number of elements in P(A) which satisfies the given conditionsFor all i in range [1, n], A[i] is not same as ... Read More

Suppose we have a string with n number of A's and 2n number of B's. We have to find number of arrangements possible such that in each prefix and each suffix have number of B's greater than or equal to the number of A'sSo, if the input is like n ... Read More

Suppose there is a stair case with N steps. One can either go step by step, or at each step, one can take a jump of at most N steps. We have to find the number of ways in which we can go to the top floor. The N value ... Read More

Suppose we are at at (0, 0) position in the Cartesian plane. We want to go to the point (x, y) using only horizontal(H) and vertical(V) moves of single unit. There are more than one possible ways to reach destination. Each way comprises of few H moves and few V ... Read More

Suppose we have m number of letters and another value n. We have to count number of strings of length n created with letters by taking from these m letters, and string has no palindromic substring of length greater than 1. If answer is too large then mod the result ... Read More

Suppose we have an array nums and a value k. We have to find number of consecutive subsequences whose sum is divisible by k.So, if the input is like k = 3 nums = [1, 2, 3, 4, 1], then the output will be 4 because the subsequences are [3], ... Read More

Suppose we have an array nums. We have to find number of pairs (i, j) are there such that nums[i] = nums[j] but i is not same as j.So, if the input is like nums = [1, 3, 1, 3, 5], then the output will be 4, because the pairs ... Read More

Suppose we have n balls which are numbered by an array nums, whose size is n and nums[i] represents the number of ball i. Now we have another value k. In each turn we pick k balls from n different balls and find the difference of maximum and minimum values ... Read More

Suppose we have two lists nums1 and nums2. Now the constraint is when we merge the order of elements in each list does not change, for example, if the elements are [1, 2, 3] and [4, 5, 6], then some valid merged lists are [1, 4, 2, 3, 5, 6] ... Read More