Suppose we have a singly linked list and another value k. We have to arrange the nodes so that all nodes whose values are less than k come first, and all nodes whose values are equal to k next, and finally other nodes at last. The constraint is that the relative ordering of the nodes should remain the same.So, if the input is like L = [4, 3, 6, 6, 6, 10, 8] k = 6, then the output will be [4, 3, 6, 6, 6, 10, 8, ]To solve this, we will follow these steps −less_head := create a ... Read More

Suppose we have two sorted linked lists L1 and L2, we have to make a new sorted linked list which contains the intersection of these two lists.So, if the input is like L1 = [2, 4, 8] L2 = [3, 4, 8, 10], then the output will be [4, 8, ]To solve this, we will follow these steps −head := a new node with value 0cur := headwhile l1 and l2 are not empty, doif value of l1 < value of l2, thenl1 := next of l1otherwise when value of l2 < value of l1, thenl2 := next of l2otherwise, ... Read More

Suppose we have a linked list. We have to take the first half of the linked list and fold over the second half then merge the intersecting nodes by taking their sum. Finally, we have to return the resulting head of the linked list.So, if the input is like [5, 8, 1, 2, 4, 7, 5], then the output will be [2, 5, 15, 10, ]To solve this, we will follow these steps −temp := 0ptr := nodewhile ptr is not null, dotemp := temp + 1ptr := next of ptrt := quotient of temp / 2m := nodestk := ... Read More

Suppose we have a singly linked list, and another value called target, we have to remove the last occurrence of target in the given list.So, if the input is like [5, 4, 2, 6, 5, 2, 3, 2, 4, 5, 4, 7], target = 5, then the output will be [5, 4, 2, 6, 5, 2, 3, 2, 4, 4, 7, ]To solve this, we will follow these steps −head := nodek := null, prev := nullfound := Falsewhile node is not null, doif value of node is same as target, thenfound := Trueprev := kk := nodenode := next ... Read More

Suppose we have a list coordinates in a Cartesian plane, we have to check whether the coordinates form a straight line segment or not.So, if the input is like coordinates = [(5, 5), (8, 8), (9, 9)], then the output will be True, as these points are forming a line segment with a slope 1.To solve this, we will follow these steps −(x0, y0) := coordinates[0](x1, y1) := coordinates[1]for i in range 2 to size of coordinates list - 1, do(x, y) := coordinates[i]if (x0 - x1) * (y1 - y) is not same as (x1 - x) * (y0 ... Read More

Suppose we have a string s that is a palindrome. We have to change one character such that s is no longer a palindrome and it is lexicographically smallest.So, if the input is like s = "level", then the output will be "aevel", as we can change the first "l" to "a" to get the lexicographically smallest string that is not palindrome.To solve this, we will follow these steps −for i in range 0 to integer part of(size of s / 2), doif s[i] is not same as "a", thens := a new list from all characters in ss[i] := ... Read More

Suppose we have two strings s and t of the same size, we have to check whether there is some permutation of s, say s1, and permutation of t, say t1, such that: s1[i] ≤ t1[i] for all 0 ≤ i < n or t1[i] ≤ s1[i] for all 0 ≤ i < n.So, if the input is like s = "vyx" t = "wzx", then the output will be True, as we can have s1 = "vxy" and t1 = "wxz".To solve this, we will follow these steps −if s and t are empty, thenreturn Trues := sort the ... Read More

Suppose we have a list of tower heights, and a positive value k. We want to select k towers and make them all the same height by adding more bricks, but using as few bricks as possible. We have to find the minimum number of bricks are needed to pick k towers and make them the same height.So, if the input is like heights = [4, 7, 31, 14, 40] k = 3, then the output will be 17, as we can select 5, 8, and 15 which requires 17 bricks to make the same height.To solve this, we will ... Read More

Suppose we have a list of numbers called nums that is representing a circular list. We have to find the largest sum of non-adjacent numbers.So, if the input is like nums = [10, 3, 4, 8], then the output will be 14, as we can take 10 and 4. We cannot take 10 and 8 as they are adjacent.To solve this, we will follow these steps −n := size of numsnums1 := nums[from index 0 to n - 2]nums2 := nums[from index 1 to end]Define a function f() . This will take iif i >= size of nums1 , thenreturn ... Read More

Suppose we have a list of numbers called nums, and another value k, which represents a large list of nums concatenated k times. We have to find the sum of the contiguous sublist with the largest sum.So, if the input is like nums = [1, 3, 4, -5], k = 1, then the output will be 11, as we can take the sublist like [2, 4, 5]To solve this, we will follow these steps −s := ans := lo := 0for all value in range 0 to minimum of k and 2, dofor each x in nums, dos := s ... Read More