Tip 1 : Do it consistently. Don’t do practice in breaks.
Tip 2 : Try to solve the problem by yourself don’t jump on the solution directly.
Tip 3 : Do some Frontend or Backend projects to show some work that you have done.
Tip 1 : keep it short, up to the point
Tip 2 : put some projects there and mention things in bold that you want to show to the interviewer
Late Night
1. No two vehicles can have the same registration number.
2. Two registration numbers are said to be different if they have at least a different character or a digit at the same location. For eg. DL 05 AC 1234 and DL 05 AC 1235 are different, DL 05 AC 1234 and DL 05 AB 1234 are different registration numbers.
3. All the cars will have the same first two characters as they have to be registered in the same state.
4. The numbering of the districts in the state starts from ‘1’ (which will obviously be written as 01 in registration number).
1. This method is also dependent on Floyd’s Cycle detection algorithm.
2. Detect Loop using Floyd’s Cycle detection algorithm and get the pointer to a loop node.
3. Count the number of nodes in the loop. Let the count be k.
4. Fix one pointer to the head and another to a kth node from the head.
5. Move both pointers at the same pace, they will meet at the loop starting node.
6. Get a pointer to the last node of the loop and make the next of it NULL.
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?