Suppose we have a lit of numbers called nums, and have another value k. If we remove k elements from nums, then find the minimum of (maximum of nums - minimum of nums).So, if the input is like nums = [4, 10, 3, 2, 8, 9] k = 3, then ... Read More

Suppose we have a list of numbers called nums and a value k. First we shall remove a sublist of size k, then find the minimum of (maximum of nums - minimum of nums).So, if the input is like nums = [2, 3, 10, 9, 8, 4] k = 3, ... Read More

Suppose we have a number n, we have to find the maximum number we can get by inserting 5 anywhere in the number.So, if the input is like n = 834, then the output will be 8534.To solve this, we will follow these steps −if n > 0, thens := ... Read More

Suppose we have a list of numbers called nums, we have to find the largest product of two unique elements.So, if the input is like nums = [8, -3, 1, -5], then the output will be 15, (-3)*(-5) = 15 which is maximum here.To solve this, we will follow these ... Read More

Suppose we have a list of numbers called nums, we have to find the largest product of three unique elements.So, if the input is like nums = [6, 1, 2, 4, -3, -4], then the output will be 72, as we can multiply (- 3) * (-4) * 6 = ... Read More

Suppose we have two lists called nums and multipliers. Now consider an operation where we can remove any number from nums and remove any number from multipliers then multiply them together. We must repeat this operation until one of the lists is empty, we have to find the maximum sum ... Read More

Suppose we have a list with only 0s and 1s called seats. Where seats[i] represents a seat. When it is 1, then it is occupied, otherwise free. There is at least one free seat and at least one occupied seat, we have to find the maximum distance from a free ... Read More

Suppose we have n different nodes. All are distinct. We have to find how many number of ways we can arrange them to form Binary search tree. As we know for binary search trees, the left subtree always hold smaller values and right subtrees hold the greater values.To solve this, ... Read More

Suppose we have outer points of a polygon in clockwise order. We have to check these points are forming a convex polygon or not. A polygon is said to be concave if any one of its interior angle is greater than 180°.From this diagram it is clear that for each ... Read More

Suppose we have a list of numbers called nums. We also have another number x. We have to find all numbers from nums which are less than x by filtering. In we use python there is one filter() method that takes function as argument and filter using this function.So, if ... Read More