Tip 1 : Prepare easy/medium level data structures questions in leetcode. Solve atleast 50 questions of multiple types like strings, arrays, tree, linked list, graph
Tip 2 : Go through Android basic questions like lifecycle, live data, MVC/mvp/ mvvm pattern, retrofit, data binding
Tip 3 : Atleast solve 5 design questions like how to build Instagram, analytics library, crashlytics
Tip 1 : be concise
Tip 2 : write only those keywords which you have in depth knowledge
Timing was around 11 am
Environment was great, it intrigued me to join Blinkit.
Each pair should be sorted i.e the first value should be less than or equals to the second value.
Return the list of pairs sorted in non-decreasing order of their first value. In case if two pairs have the same first value, the pair with a smaller second value should come first.
First approach : Loop inside Loop to figure out the sum of two numbers are equal to a constant number. But the complexity is N2
Second approach : i used Map to store numbers. Before storing we just check rhta constant number - current number exist in map or not.
Second solution is approved
Timing 11 am
Interviewer had good knowledge
Activity lifecycle
Tip 1 : Remember important methods and what is the used of every method
Fragment lifecycle
Tip 1 : Remember important methods and what is the used of every method
Explain MVVM pattern
Tip 1 : must have knowledge about MVC, mvp,mvi,mvvm patterns.
This round is cultural fit round
1. Why Blinkit?
2. Salary discussion
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you write a single-line comment in C++?
Hi