Suppose we have two binary tree. We have to check whether leaf traversal of these two trees are same or not. As we know the leaf traversal is sequence of leaves traversed from left to right.So, if the input is likethen the output will be True as the left traversal ... Read More

Suppose we have an array called nums and another value k, we have to check whether LCM of nums is divisible by k or not.So, if the input is like nums = [12, 15, 10, 75] k = 10, then the output will be True as the LCM of the ... Read More

Suppose we have some weights like a^0, a^1, a^2, …, a^100, here 'a' is an integer, and we also have a weighing scale where weights can be put on both the sides of that scale. We have to check whether a particular item of weight W can be measured using ... Read More

Suppose we have an array of numbers called nums, and also have another value K. We have to check whether we can partition the array nums into K contiguous subarrays such that the elements sum of each subarrays is equal.So, if the input is like nums = [2, 5, 3, ... Read More

Suppose we have two strings s and t, t is in uppercase. We have to check whether we can convert s to t by performing following operations.Convert some lowercase letters uppercase.Remove all of the lowercase letters.So, if the input is like s = "fanToM", t = "TOM", then the output ... Read More

Suppose there is an island. There is only one store in that location, this store remains open always except Sunday. We have following values as input −N (Maximum number of food someone can buy each day).S (Number of days someone is required to survive).M (Number of food required each day ... Read More

Suppose we have a list of numbers called nums, we have to check whether we can sort nums or not by using rotation. By rotation we can shift some contiguous elements from the end of nums and place it in the front of the array.So, if the input is like ... Read More

Suppose we have an unordered array of numbers called nums and all elements are in range 0 to n-1. We can swap adjacent elements in nums as many times as required but only when the absolute difference between these element is 1. We have to check whether we can sort ... Read More

Suppose we have an array called notes represents different rupee notes holding by customers in a queue. They are all waiting to buy tickets worth Rs 50. Here possible notes are [50, 100 and 200]. We have to check whether we can sell tickets to the people in order or ... Read More

Suppose we are at position (0, 0) We have a string represents consecutive directions using four letters. We have to check whether we can return at (0, 0) position after considering all of the given directions. The symbols areE for eastW for westN for northS for south.So, if the input ... Read More