Problem of the day
Tip 1 : Be very very clear with your basics.
Tip 2 : Think well before giving an answer
Tip 3 : Practice, practice, practice DS Algo questions
Tip 1 : Limit it to 1 page ONLY.
Tip 2 : Be ready to face all kinds of questions on topics you have mentioned in the resume.
We could attempt at any time out of the 3 given days.
The round was very time constrained and we could NOT go back to the question that we already attempted.
1. Compare the head of both linked lists.
2. Find the smaller node among the two head nodes. The current element will be the smaller node among two head nodes.
3. The rest elements of both lists will appear after that.
4. Now run a recursive function with parameters, the next node of the smaller element and the other head.
5. The recursive function will return the next smaller eleme...
The problem statement involved the use of amazon trucks which had to deliver system requirements across an AWS region which contains N office buildings. The various location of buildings are given in a vector of (x,y) coordinates along with an adjacency matrix deniying tge connectivity. The head branch is located at (0,0). The truck starts at the head branch and after visiting other branc...
1. It's basically a problem of visiting each node of a graph exactly once in a cycle. So its a Hamiltonian cycle which can be found out using backtracking
2. Create an empty path array and add vertex 0 to it.
3. Add other vertices, starting from the vertex 1. Before adding a vertex, check for whether it is adjacent to the previously added vertex and not already added.
4. If we find suc...
Evening at 5:00 pm. It was held on Amazon Chime app
Face cam was to be kept on COMPULSARILY. You could however not see the interviewer.
Codepen type environment was also used for typing my code which could be edited by the interviewer also.
(Shared document kind of)
Interviewer was very professional and was trying to push me towards getting the most optimal solution. Each and every answer was asked a counter question as to why I made that choice
1. Find the LCA or least common ancestor.
2. Apply binary seatch from LCA to find the greater out of A and B while keeping track of the largest node.
1. Use a hashmap m to keep track of number of times a character has occured. Use a vector v to store the order of occurence
2. When you encouter a char, see if its present in m
If yes, the increase the count in m.
Else, make entry of char in m with count 1 and enter char in the vector
3. Print all the elements in the vector with the corresponding frequency by looking up the hashmap ...
What is deadlock? How to recover from them? How to prevent them?
Difference between thread and process?
Tip 1 : Be very precise and to the point.
Tip 2 : Be extremely clear with the concept.
Tip 3 : Don't use fancy terms which you yourself don't know about.
What is ACID, explain with examples. Questions on join queries.
Tip 1: While giving examples, give short and relevant ones
Tip 2: Practice queries thoroughly
Tip 3: No need to learn very hifi concepts. STICK TO YOUR BASICS