Tip 1 : Prepare HLD and LLD comprehensively
Tip 2 : Prepare good questions to ask from the Interviewer at the end.
Tip 1 : Keep it 1 page long
Tip 2 : Keep it to the point



For the binary trees in the image below.

The left tree in the image is not a complete binary tree that’s why it is invalid and the right tree in the image is a valid complete binary tree which contains total 6 nodes.
Used Binary search to calculate the total number of nodes.



It can be shown that Mean and Median is in the form of P/Q, where P and Q are coprime integers and Q != 0. You need to return P and Q.
For Mode, if the highest frequency of more than one element is the same, return the smallest element.
For Example, for the given array {1, 1, 2, 2, 3, 3, 4}, the mode will be 1 as it is the smallest of all the possible modes i.e 1, 2 and 3.
Just used proper abstraction and mapper factory pattern to solve the problem.
Tip 1 : Be confident
Tip 2 : Be descriptive
Tip 3 : Open to listening to opinions

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?