Suppose we have an array called arr, this contains unique elements and we also have another value k. Now consider a game where we take first two elements of the array. In each turn, we compare arr[0] with arr[1], and the larger value wins and remains at position 0 and ... Read More

Suppose we have a string s with opening and closing parenthesis '(' and ')'. We can say a parentheses string is balanced when −Any left parenthesis '(' have a corresponding two consecutive right parenthesis '))'.A Left parenthesis '(' must go before the corresponding two consecutive right parenthesis '))'.So for example, ... Read More

Suppose, we are provided two expression trees. We have to write a program that checks the two expression trees and determines if the expression trees generate similar values. The two expression trees are provided to us in an in-order manner and we return a True value if they match, or ... Read More

Suppose we have n bulbs in a room, these bulbs are numbered from 0 to n-1. We have to arrange them in a row from left to right. Initially, all the bulbs are turned off (0-state). We have to get the configuration represented by given target array 't' where t[i] ... Read More

Suppose we have a binary tree. and another value distance d. A pair of two different leaf nodes are said to be good, when the shortest path between these two nodes is smaller or same as distance d.So, if the input is likeAnd distance d = 4, then the output ... Read More

Suppose we have a n x n binary matrix. We can perform an operation on it like, at one step we select two adjacent rows and swap them. We have to count number of minimum swaps required, so that all nodes above the major diagonal of the matrix is 0. ... Read More

Suppose we have two strings s and t, we have to check whether s can be converted to t in k moves or less. In ith move you can do these operations.Select any index j (starting from 1) in s, such that 1

Suppose we have two positive values n and k, now we can make a binary string S_n by using following rules −S_1 = 0S_i = S_i-1 concatenate "1" concatenate reverse(invert(S_i-1)) for i > 1Here reverse(x) returns the reversed string x, and invert(x) flips all the bits in x.These are the ... Read More

Suppose we have an array nums and another value called target. Now we have to find the maximum number of non-empty non-overlapping subarrays such that the sum of values in each different subarray is same as target.So, if the input is like nums = [3, 2, 4, 5, 2, 1, ... Read More

Suppose we have a value n, consider an array nums with n elements, where arr[i] = (2*i)+1 for all i. Now in one operation, we can choose two indices x and y where 0 =0, doans:= ans + (n-j)q := q - 1j := j + 2return ansLet us see ... Read More