Application Engineer

Step 1: In the first step, we discussed the basic approach using a loop. We will first apply for loop and for each i, we will go from j = 2 to j = i - 1 and check if any i is divisible by any j. If yes then it is not prime and if no then prime.
Step 2: Interviewer told me to optimize the solution.
Step 3: Then I gave Sieves of Eratosthenes solution and the interview was happy.

Tip 1:Read ACID properties in OS thoroughly.
 

Tip 1:Read Normalization in detail.

Step 1:This problem was common so I told him the kadane's algorithm directly.
Step 2: The idea of Kadane’s algorithm is to maintain a variable max_ending_here that stores the maximum sum of contiguous subarray ending at the current index and a variable max_so_far stores the maximum sum of contiguous subarray found so far, every time there is a positive-sum value in max_ending_here compare it with max_so_far and update max_so_far if it is greater than max_so_far.
Step 3: The interviewer was happy with the solution.

Step 1: We first find the LCA of two nodes. 
Step 2: Then we find the distance from LCA to two nodes.
Step 3: The time complexity was O(n) so the interviewer was impressed with the solution.

Tip 1:Whenever the interviewer asked the problem I first tried to gather the requirements of all the features we wanted in that system.
Tip 2: Keep these rounds as kind of two-way discussions.
Tip 3: In HLD, my interviewer focussed on the Concurrency part.

Tip 1: Try to keep system design rounds two-way.
Tip 2: Always gather requirements first then look for ways to solve them.