My software development journey
Given a binary tree, how do we print the right view of it?For example, consider the simple binary tree below 1 / 2 3 The right view of this is 1, 3. Similarly consider one more example 1 / 2 5 / 3 4 Right view for this tree contains…
Given two linked lists, we have to merge them into a single list by alternatively taking one node from each list.We should do this by re-arranging the links and should not create duplicate nodes while merging. For example consider the two lists 1 -> 2 -> NULL3 -> 4 -> NULL The result should look…
Given a binary tree, how do we print the left view of it?For example, consider the simple binary tree below 1 / 2 3 The left view of this is 1, 2. Similarly consider one more example 1 / 2 3 / 4 5Left view for this tree contains 1, 2,…
Given a parenthesis expression, We have to find the maximum nesting depth. For example: the expression ()((()))(()) has a maximum nesting depth of 3. The expression ((()())) has a maximum nesting depth of 3. Let us output -1 for an unbalanced expressions such as (())) or ()( This is a simple problem that can be…
Given a binary tree, how do we find the longest distance between any two nodes in it? Some times this is referred to as the diameter of the tree.For example consider the below binary tree The longest path in this tree is 1 – 2 – 3 – 5 – 8 – 6 – 7.…
Given an array in which the elements are increasing up to a point and then decreases (this is also called a bitonic array), how do we efficiently find the maximum element?For example, the input arrays can look like {1, 3, 5, 4, 2} , {11, 17, 25, 36, 24, 6}. Basically we need to find…
Given a number, how do we find the next greater number with the same digits? For example if the given number is 123, the next greater number with the same digits is 132. Similarly for 23876, the output is 26378. If all the digits of the number are in decreasing order (Eg. 54321), there…
Given two strings, how to check one is a rotation of the other? For example consider the strings “abcd”, “cdab”. If we rotate any string twice, you will get the other string. A simple way of solving this problem is to rotate one string, and see if it matches the other string. But we don’t know…
Given an array numbers, we have to join them in such a way that it forms the biggest number. For example consider the simple three element array [10,3,2], they can be joined in following ways 1032, 1023, 2103, 2310, 3102, 3210. Among these numbers 3210 is the biggest number. To solve this problem we definitely…
Given two numbers N and K, how do we print all the K-combinations of numbers from the set {1,2,…N}. For example consider N = 4, K = 3, the possible combinations are [ [1, 2, 3] [1, 2, 4] [2, 3, 4] [1, 3, 4] ] Let us look how to solve this combination problem.…