Tip 1 : Practise standard questions a lot
Tip 2 : Focus on Low Level Design
Tip 3 : Revise at least 1 project of yours which was challenging
Tip 1 : Keep your resume short, not more than one page
Tip 2 : Describe your tech stack with your projects
This was first round consisting of 2 DSA questions. I was asked to solve the questions on Google Sheets.



‘N’ = 3, ‘coins’ = {1, 2, 3}, ‘freq’ = {1, 1, 3}, ‘V’ = 6
For the given example, we can make six by using the following coins:
{1, 2, 3}
{3. 3}
Hence, the answer is 2.
This is a standard DP question. I had solved it multiple times earlier. I was able to come up with optimised solution. Interviewer looked satisfied with the Bottom Up solution.



You are given the array ‘ARR’ = [1, 1, 1, 1, 1], ‘TARGET’ = 3. The number of ways this target can be achieved is:
1. -1 + 1 + 1 + 1 + 1 = 3
2. +1 - 1 + 1 + 1 + 1 = 3
3. +1 + 1 - 1 + 1 + 1 = 3
4. +1 + 1 + 1 - 1 + 1 = 3
5. +1 + 1 + 1 + 1 - 1 = 3
These are the 5 ways to make. Hence the answer is 5.
I had not solved this question earlier. It took me some time to identify this is a modified version of 0/1 Knapsack problem.
Once I identified this, I was able to give approach & write code within 10 minutes.
Again interviewer looked happy
This was a design round. Interviewer was a Senior Engineer. He was very friendly & he tried to make the environment light by introducing himself & cracking jokes.
You are asked to design a Database. You can choose any database you want, be it SQL, NoSQL. It's upto you. You have to define all the DB APIs, where will you store the data and go into details of every DB API.
Tip 1 : Try to fully understand the problem & list all the requirements. Usually problem statement is left vague in design rounds, it is responsibility of candidate and candidate only to ask clarifying questions.
Tip 2 : No solution or approach is correct or incorrect. Just make sure you've considered all the trade offs correctly before choosing any approach or using any particular technology
Tip 3 : Try to keep the interview interactive, and also try to drive the interview on your own instead of assuming that interviewer will drive the round. This actually shows your ability to solve the problem in teams.
This was the final & hiring manager round. This round revolved mostly around projects, a small DS question & computer science fundamentals
Which is better SQL vs NoSQL?
What are Acid Properties?
There is no correct answer for this. Basically this depends upon use-case to use-case. You have to tell which one is better in which scenario



Conditions for valid parentheses:
1. All open brackets must be closed by the closing brackets.
2. Open brackets must be closed in the correct order.
()()()() is a valid parentheses.
)()()( is not a valid parentheses.
This was again a very standard question. You should know these type of problems by heart. I had solved this problem many times & gave approach using stack.
A general discussion over my previous projects and if I get a chance now to do the same projects, how would I do things differently?
Also was asked to explain how the entire deployment process is working in details
Tip 1 : Prepare at least 2-3 projects thoroughly & remember every small detail you did.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?