Blinkit Interview Questions, Process, and Tips

Q1. What are your salary expectations?
Add your answer
Q2. Share details of your previous job.
Add your answer
Q3. Why should we hire you?
Add your answer
Q4. Tell me about yourself.
Add your answer

Objective type

Round duration - 90 mintues
Round difficulty - Easy

Nice environment everything went good.

Q1. Sum of LCM
You are given an integer ‘N’ , calculate and print the sum of :
LCM(1,N) + LCM(2,N) + .. + LCM(N,N) 
where LCM(i,n) denotes the Least Common Multiple of the integers ‘i’ and ‘N’.
Input Form...read more
Ans. Brute force approach
 
Using the mathematical formula, A*B = LCM(A,B) * GCD(A,B) where ‘A’ and ‘B’ are the two integers, and GCD(A,B) denotes the Greatest common divisor of ‘A’ and ‘B’.
For example, suppose 
 
A = 20 and B = 30
Factors of A = {1,2,4,5,10,20}
Factors of B = {1,2,3,5,6,10,15,30}
 
The greatest common factor is 10, hence GCD(20,30) = 10.
 
So LCM(A,B) = A*B / GCD(A,B)
 
All we need to fin...read more
Answered Anonymously
Add your answer
Q2. Vertical Order Traversal
Given a binary tree, return the vertical order traversal of the values of the nodes of the given tree.
For each node at position (X, Y), (X-1, Y-1) will be its left child positio...read more
Ans. Iterative Approach
Our very basic intuition is that while traversing the given binary tree, we need to keep a track of the horizontal distance of all the nodes of the given binary tree with respect to the root node.
 
We initially pass the horizontal distance as 0 for root. For the left subtree, we pass the ‘HD’ as the Horizontal distance of root minus 1. For the right subtree, we pass the ‘HD’ as Horizontal Distance...read more
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

It was a tough round focus on the key concepts

Q1. Design a stack that supports getMin() in O(1) time and O(1) extra space
Implement a SpecialStack Data Structure that supports getMin() in O(1) time and O(1) extra space along with push(), pop(), top(), isE...read more
Ans. Optimal Solution
• You need to make two separate stacks for solving the problem.
• The first stack would have the actual number and the second stack would contain the minimum number present in the current stack.
• Now, when we need to push a number in the stack, we first need to check if the stack is empty or not. If the stack is empty, we simply push the integer in both the stacks. Otherwise, we push the integer in the first s...read more
Answered Anonymously
Add your answer

Q1. Tell me about yourself.
Add your answer
Q2. What are your salary expectations?
Add your answer
Q3. Share details of your previous job.
Add your answer