Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 1 : Keep your resume short and clear. Mention your projects and internships with a brief description and year of completion. Mention coding languages are known to you, or other technical skills that you are good at. Do not mention anything that you are not good at. Highlight the topics that you are really good at.
Tip 2 : Be very honest and figure out only those things in your resume that you really know. Anything extra or unknown may have a negative impact upon your interview if asked by the interviewer.
You are given the arrival and departure times of N trains at a railway station in a day. You need to find the minimum of platforms required for the railway station such that no train waits i.e No train should wait for the platform to be clear or free.
An archer is hitting the target(a circle). He fires the first shot and then the second shot. Given that his
shot was better than the second. Find the probability that the third shot that he fires is best among
the three. The three shots are independent of each other.
This was a probability-based question and I am weak in that. I thought of various approaches like Bayes, intersection, etc but could not find the answer to this question.
A leaf is a node with no children.
For the given binary tree
Output: 2
The shortest path is from root node 1 to leaf node 2 which contains 2 nodes in the path. Hence, the minimum depth is 2.
You have been given a Binary Tree of integers, find the minimum depth of this Binary Tree. The minimum depth of a Binary Tree is the number of nodes along the shortest path from the root node down to the nearest leaf node.
You must sell the stock before you buy it again.
This was the standard question and I solved it using local minima and local maxima concept and wrote code for the interviewer and he was satisfied with my code as well as approach.
What are your goals?
What motivates you to do good job?
What makes you angry?
Give me an example of your creativity.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL keyword removes duplicate records from a result set?