AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Blinkit Software Developer Intern Interview Questions, Process, and Tips
Top Blinkit Software Developer Intern Interview Questions and Answers
- Q1. Maximum Possible Time Problem Statement Given an array ARR consisting of exactly four integer digits, your task is to form the maximum possible valid time in a 24-hour f ...read more
- Q2. Vertical Order Traversal Problem Statement Given a binary tree, return the vertical order traversal of the values of the nodes in the tree. In a vertical order traversal ...read more
- Q3. Top View of Binary Tree Given a binary tree of integers, the task is to return the top view of the given binary tree. The top view of the binary tree is the set of nodes ...read more
Blinkit Software Developer Intern Interview Experiences
2 interviews found
I was interviewed in Feb 2021.
Round duration - 24 hours
Round difficulty - Medium
(2 Questions)
Round duration - 120 Minutes
Round difficulty - Medium
It was a Data Structures and Algorithm Round and Discussion on My assignment round to check my Problem Solving Skills.
And the Interviewer was very friendly to me. I first introduced myself to the interviewer and what did I have done in past as a Software Engineer and Why I want to work in Grofers.
- Q1.
Top View of Binary Tree
Given a binary tree of integers, the task is to return the top view of the given binary tree. The top view of the binary tree is the set of nodes visible when viewed from the top.
... - Ans. Using Pre-Order Traversal
As we know that all three traversals, i.e. pre-order, in-order and post-order, visit the tree node at once. We can use any of them. Here we are going to use pre-order traversal for the explanation. So while traversing in the pre-order traversal, we will keep track of horizontal distance of the node which is going to be visited from the root node, and we also keep track of the vertical level of ...
- Q2.
Maximum Possible Time Problem Statement
Given an array
ARRconsisting of exactly four integer digits, your task is to form the maximum possible valid time in a 24-hour format using those digits.Explanat...
- Ans. Maximum Possible Time
Approach:
- The basic idea is that we will iterate over all the permutations of the 4 digits and check whether we are able to form a valid 24 Hr format time. If so we will then also find the maximum possible time.
- Here we will use the ‘NEXT_PERMUTATION’ method to find all the permutations.
Algorithm:
- There are two conditions for valid 24 Hr format time:
- The first two digits i.e the hour should be le...
Interview Preparation Tips
Tip 1 : Practise Data Structures and Algorithms as much as you can on daily basis. Don't Fix numbers in your head, but practise as much as you can from all topics on daily basis.
Tip 2 : Give Programming Contests on a Daily basis. As it helps you to think of any particular problem in the fixed time frame.
Tip 3 : For Mastering DP, Learn From Aditya Verma Youtube Playlist and apply around 100 questions for solving any DP problem.
Tip 4 : Also Learn Computer Science theory subject once a week so that you will have a deep understanding of the particular subject since many interviews grind on CS theory subjects like OS, DBMS and Networks
Tip 5 : Make at least 2-3 Projects in any technology you like maybe Web Development or Android Development. It shows that you have some experience in Development and the company don't need to waste time on you for teaching frameworks.
Tip 6 : If you have time learn some System Design and learn how to design any system from end to end. Especially learn about designing a database of any application. In many interviews, the interviewer asks to design an application from end to end. So if you have some practice, then you can easily clear this type of rounds.
Tip 1 : Always attached your Project links in your resume. As it seems your project is genuine and you are confident in showing your projects
Tip 2 : Don't add unnecessary things in your resume which are not related to the job, like your 10th class winning tournament certificate or managing a college society. These things didn't create any impact on your profile and takes an unnecessary space in your resume.
Tip 3 : Always make a 1-page resume. If you are making more than 1 page then it means you have added a lot of unnecessary information which are not related to the job profile.
Tip 4 : Always show your Project and Past experience on top, just after your basic info and education. Since these are the things which should be on top to showcast the skills.
Skills evaluated in this interview
I was interviewed in Nov 2020.
(2 Questions)
Round duration - 90 mintues
Round difficulty - Easy
Nice environment everything went good.
- Q1.
Sum of LCM Problem Statement
Given an integer 'N', calculate and print the sum of the least common multiples (LCM) for each integer from 1 to N with N.
The sum is represented as:
LCM(1, N) + LCM(2, N) + .... - 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...
- Q2.
Vertical Order Traversal Problem Statement
Given a binary tree, return the vertical order traversal of the values of the nodes in the tree.
In a vertical order traversal, for each node at position (X, Y)...
- 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...
(1 Question)
Round duration - 90 minutes
Round difficulty - Hard
It was a tough round focus on the key concepts
- Q1.
Stack with getMin Operation
Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...
- 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...
Interview Preparation Tips
Tip 1 : Prepare Data structure and algorithm
Tip 2 : RDBMS and OS are also important
Tip 3 : Focus on CAO
Tip 1 : Have some projects on resume.
Tip 2 : Always write things which you can explain there
Skills evaluated in this interview
Interview questions from similar companies
I applied via Campus Placement and was interviewed in Jan 2024. There were 4 interview rounds.
Easy to medium level of leet code
(1 Question)
- Q1. 1. Fibonacci series with recursion and without recursion 2. String Palindrome 3. Count all repeated numbers from the array
- Ans.
Answering questions related to Fibonacci series, string palindrome, and counting repeated numbers in an array.
For Fibonacci series with recursion, write a function that calls itself to calculate the next number in the series.
For Fibonacci series without recursion, use a loop to calculate the series.
For string palindrome, compare characters from start and end of the string.
To count all repeated numbers from the array, u
(1 Question)
- Q1. 1.Given an array(0-based indexing), you have to find the max sum of i*A[i] where A[i] is the element at index i in the array. The only operation allowed is to rotate(clock-wise or counter clock-wise) the ...
- Ans.
Rotate array to find max sum of i*A[i]
Rotate array to bring maximum element to front
Calculate sum of i*A[i] for each rotation
Keep track of maximum sum found
(1 Question)
- Q1. 1.Oops concepts 2.Oops code 2.About Java Spring 3. Array stack questions 4.Project discussion
Interview Preparation Tips
Skills evaluated in this interview
Selected
I was interviewed before Aug 2023.
3 question of basic and 3 mcq
Strings,Sort 0 1 2,invert binary tree
(2 Questions)
- Q1. Project Basics and Technical skills
- Q2. Your Daily routine
- Ans.
My daily routine involves coding, debugging, attending meetings, and learning new technologies.
Start the day by checking emails and prioritizing tasks
Code and debug new features or fix existing issues
Attend team meetings to discuss progress and roadblocks
Spend time learning new technologies or improving coding skills
Collaborate with team members on projects
(1 Question)
- Q1. It was based on dynamic programming
Interview Preparation Tips
I was interviewed in May 2021.
(3 Questions)
Round duration - 90 Minutes
Round difficulty - Hard
Test Description/Instruction as Mentioned on the portal and mail :
1) The test will consist of 3 algorithmic problems.
2) The test time is 1.5 hours in which you will need to solve the 3 problems. The test link will be active from 10:00 AM onwards.
3) Please do not change the tabs since all the actions will be recorded and logged.
- Q1.
Flood Fill Algorithm Task
Assist Ninja in altering the color of a specific region in his photo. Given the image as a 2D array where each pixel is a positive integer, update the color of a specified pixel ...
- Ans.
The Flood Fill Algorithm is used to change the color of a particular region in an image and all its adjacent same-colored pixels.
The image is represented as a 2D array of positive integers
The starting pixel and new color are given
Adjacent pixels are connected in up, down, left, or right directions
Diagonal pixels are not considered adjacent
Implement the Flood Fill Algorithm to replace the color of the given pixel and it...
- Q2.
Kruskal’s Minimum Spanning Tree Algorithm Problem Statement
You are given a connected undirected weighted graph. Your task is to determine the weight of the minimum spanning tree of this graph.
A minimum...
- Ans.
The task is to find the weight of the minimum spanning tree of a given connected undirected weighted graph.
Implement Kruskal's algorithm to find the minimum spanning tree
Use a disjoint set data structure to keep track of connected components
Sort the edges in non-decreasing order of their weights
Iterate through the sorted edges and add them to the minimum spanning tree if they don't create a cycle
Return the sum of weigh
- Q3.
Merge Sort Problem Statement
You are given a sequence of numbers,
ARR. Your task is to return a sorted sequence ofARRin non-descending order using the Merge Sort algorithm.Explanation:
The Merge Sort...
- Ans.
The task is to implement the merge sort algorithm to sort a given sequence of numbers in non-descending order.
Merge sort is a divide and conquer algorithm that recursively divides the input array into two halves until the size becomes 1.
Then it merges the two sorted halves to produce a single sorted array.
The time complexity of merge sort is O(n log n), where n is the size of the input array.
The algorithm is efficient ...
Interview Preparation Tips
Tip 1 : Practice Atleast 300 Questions on leetcode (150 easy, 100 medium and 50 hard )
Tip 2 : Make atleast one big project which includes (DB, backend and frontend). Because in Hiring Manager round we have to discuss our resume for about 45mins to 1 Hr so having 1 or 2 big projects on the resume is always good to have otherwise HM will go towards core subjects Like OOP/OS/Networks which are often tricky.
Tip 3 : Think out of the box while solving a Question think of all the variants in which this questions can be asked. Let's take an example of simple question like two sum here we have to find a pair in an array whose sum is equal to given value. Now what if Interviewer asked to find three numbers instead of 2 or maybe find k numbers whose sum is equal to a given number. So it is always good to think out of the box and generalise the solution.
Tip 4 : Always try to solve each question in different ways. You should know both the bruteforce solution and the optimal one.
Tip 5 : When you solve a Question try to learn as much possible from a single Question for eg if you try to solve a Tree question then it is good to know both the iterative and recursive solution as sometimes Interviewer may introduce some constraints that due to huge test case recursive solution is not possible.
Tip 6 : 3-4 days before the interview start preparing using interviewbit as it contains all the important questions topic wise. I usually solve Interviewbit before the interview. No doubt Leetcode is good in terms of UI, Test cases and Easy to use but Interviewbit is more organised. I myself have done all the Interviewbit Questions multiple times.
Tip 1 : Try to add Experience at the top with detailed explanation of work done by you
Tip 2 : If No Experience: try to add more and more personal projects with the skills required in JD
Tip 3 : If No projects and Experience: Try to add Coding profiles, Achievements (Hackathons and Coding Competitions )
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Shiprocket Private Limited
Anonymous
posted on 9 Oct 2024
I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.
(2 Questions)
- Q1. Tree question dsa
- Q2. Fibonacci sequence question
Interview Preparation Tips
Round 2 - Technical: The second round focused more on system design and APIs. I was asked to explain the difference between PUT and POST in REST APIs, design the database schema of one of my projects, and discuss inheritance and access modifiers (public, private, protected). Git commands were also covered. A scenario-based question was presented: "How would you send an email to a million users, ensuring that if an email fails, the system retries sending it three times? If the retries fail, the system should move on to the next email. Additionally, if the system crashes after sending 1000-2000 emails, how would you ensure that upon restart, it resumes from where it left off without resending emails?"
The HR was friendly, clearly explained the next steps, and provided constructive feedback. Overall, it was a positive interview experience.
The exam duration is one and a half hours.
The total exam time is one and a half hours.
It encompasses all topics related to full stack development.
(2 Questions)
- Q1. Asks questions on SQL
- Q2. Asks question in typical topics
(1 Question)
- Q1. Where do you see yourself in two years?
- Ans.
In two years, I see myself as a senior software developer leading a team on innovative projects.
Advancing to a senior software developer role
Leading a team on new and innovative projects
Continuing to enhance my technical skills through ongoing learning and training
Chirag Varshney
(4 Questions)
- Q1. Explain Deadlock?
- Q2. Explain Red Black Tree?
- Q3. Find local minima in a 1-D array?
- Q4. Find local minima in 2-D array?
Jatin
I applied via Naukri.com and was interviewed in Oct 2024. There were 4 interview rounds.
Easy level to Medium level
2 Easy questions of DSA
(2 Questions)
- Q1. One DSA question
- Q2. Normal discussion about tech stack
(2 Questions)
- Q1. Tell about yourself
- Q2. Why do you want to join digit?
Interview Preparation Tips
Tell us how to improve this page.
Blinkit Interviews By Designations
- Blinkit Store Manager Interview Questions
- Blinkit Senior Executive Interview Questions
- Blinkit Assistant Store Manager Interview Questions
- Blinkit Assistant Manager Interview Questions
- Blinkit Cluster Manager Interview Questions
- Blinkit Senior Assistant Interview Questions
- Blinkit Senior Executive Operations Interview Questions
- Blinkit Software Developer Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Trainee Interview Questions
- Software Developer Interview Questions
- Software Development Engineer Interview Questions
- Junior Software Developer Interview Questions
- Show more
Software Developer Intern Interview Questions from Similar Companies
Fast track your campus placements
Blinkit Software Developer Intern Reviews and Ratings
based on 1 review
Rating in categories
|
Store Manager
821
salaries
|  ₹3 L/yr - ₹7.6 L/yr |
|
Senior Executive
538
salaries
| ₹2 L/yr - ₹8 L/yr |
|
Assistant Manager
431
salaries
| ₹3 L/yr - ₹10.9 L/yr |
|
Team Lead
411
salaries
| ₹1.4 L/yr - ₹4.5 L/yr |
|
Assistant Store Manager
323
salaries
| ₹1.9 L/yr - ₹4.8 L/yr |
Zepto
BigBasket
Flipkart
Amazon
- Home >
- Interviews >
- Blinkit Interview Questions >
- Blinkit Software Developer Intern Interview Questions
