SDE - Intern

I decided to use min heap for this. I sorted the array based on start time. For each meeting I checked whether any old meeting in the heap was over before the current meeting start time. If yes then I pop that old meeting and push this need meeting into the min heap other wise I incremented the total counter and pushed the meeting to the heap. Finally I returned the total counter.

Step 1: Traverse the two linked lists from left to right
Step 2: perform addition, store result in a new node and keep track of carry over
Step 3: Return the result

Tip 1: Think of how traffic will be flowing to the server and how it will affect the performance
Tip 2: For performance improvement, think of both vertical and horizontal scaling
Tip 3: Think about how to improve system throughput

Tip 1: A lot of the puzzles can be solved using the techniques that are taught in algorithms like the egg problems is a simple binary search
Tip 2: It is generally advisable to solve a few aptitude questions so that you can quickly thing on your feet
Tip 3: It is ok to take some time and give the correct answer instead of hastily giving the wrong answer

Tip 1 : Should have firm grasp on SQL
Tip 2 : Practice SQL questions
Tip 3 : Rank and window functions are asked pretty much in every interview on DBMS