Tip 1: Practice at least 250 Questions
Tip 2: Do at least 2 projects
Tip 1: Include some projects on your resume.
Tip 2: Do not include false information on your resume.
Merge Sort Algorithm -
Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.
The above illustrates shows how merge sort works.
It is compulsory to use the ‘Merge Sort’ algorithm.
Let the array = [ 4, 2, 1, 5, 3 ]
Let pivot to be the rightmost number.
There are 10 stacks of 10 identical-looking coins. All coins in one of these stacks are counterfeit, and all the coins in the other stacks are genuine. Every genuine coin weighs 10 grams, and every fake weighs 11 grams. You have an analytical scale that can determine the exact weight of any number of coins. What is the minimum number of weighings needed to identify the stack with the fake coins?
Solve aptitude Puzzles from the internet, they might sound easy but are always tricky while answering in the Interviews.
Can you work under pressure?
Are you willing to relocate or travel?
What are your goals?
What motivates you to do a good job?
What makes you angry?
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?