Google Interview Questions, Process, and Tips for Freshers

The key observation here is that the best way to remove an element from the array is to remove the maximum or minimum element from the array. There are two possible ways of removal, either we remove the minimum element or the maximum element.

Now, the idea is to use recursion to reduce the big problem into several small subproblems. 

Here is the algorithm :

1. We sort the array in ascending order.
2. We will ...read more

In any rooted tree, the distance between two nodes 'U' and 'V' can be found by finding the lowest common ancestor (LCA), ‘x’ of two nodes. The lowest common ancestor (LCA) between nodes 'U' and 'V' is defined as the lowest node in the tree that has both 'U' and 'V' as descendants, where we define each node to be a descendant of itself (so if 'U' has a direct connection from 'V', 'V' is the lowest common a...read more

The idea is to count the number of times each element occurs and if any element occurs more than N/3 times, then include it in our answer.

The steps are as follows:

1. Iterate through the array and pivot each element one by one.
2. Initialize a variable ‘COUNT’ to 0 and iterate through the array once again.
3. If you find an element whose value is equal to the pivoted element, then increment ‘COUNT’ by 1.
4. After iter...read more

1. Get the minimum and maximum element of the array.
2. Check if (max-min+1) is equal to N or not, if it is not equal then return false.
3. For every element between the minimum and maximum number, check whether it is present in the array or not by using linear search.
4. If it is present, then continue, otherwise return false.
5. Finally, If we have reached the maximum element that means all elements between the minimum eleme...read more