AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Blinkit SDE Interview Questions and Answers
Blinkit SDE Interview Experiences
1 interview found
Anonymous
(1 Question)
- Q1. Predict the winner leetcode problem
- Ans.
The winner leetcode problem involves finding the candidate with the most votes in an election scenario.
Iterate through the list of candidates and keep track of their votes
Return the candidate with the highest number of votes
Example: Input - ['Alice', 'Bob', 'Alice', 'Charlie', 'Bob'], Output - 'Alice'
Interview Preparation Tips
Skills evaluated in this interview
Interview questions from similar companies
Shashirith Sonu
I applied via Campus Placement and was interviewed before Oct 2022. There were 2 interview rounds.
(3 Questions)
- Q1. DESIGN CALENDER
- Q2. DESIGN FACEBOOK
- Ans.
Design a social networking platform with features like user profiles, news feed, messaging, and photo sharing.
Create user profiles with customizable information and privacy settings
Implement a news feed algorithm to display relevant content to users
Include messaging functionality for private communication between users
Allow users to share photos and videos on their profiles and in posts
- Q3. LLD ROUND ON BOTH THIS QUESTIONS
(2 Questions)
- Q1. WHY DO YOU WANT TO JOIN
- Q2. ARE YOU FREE FOR THIS ROLE
Skills evaluated in this interview
Vaibhav Garg
DSA - 3 Coding Questions
(1 Question)
- Q1. Machine coding - low level design
(1 Question)
- Q1. Write system design for cab booking system
There was only two coding questions in 50 minutes interview
(3 Questions)
- Q1. One coding question
- Q2. Only one coding question
- Q3. Medium level coding question
Interview Preparation Tips
Selected
I applied via Naukri.com and was interviewed in Oct 2023. There were 2 interview rounds.
Leetcode medium question
(3 Questions)
- Q1. Technical coding
- Q2. Java basics questions were asked
- Q3. Basics of Unix and shell scripting
Coding round has two questions ranging in medium -hard level leetcode questions
(3 Questions)
- Q1. Doubly Linked List
- Q2. Graph - topological sort
- Q3. Operating system, database management system
(2 Questions)
- Q1. Longest Common Subsequence
- Ans.
Longest Common Subsequence is the longest sequence of characters that appear in the same order in both strings.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of longest common subsequences.
Iterate through the strings to fill the array and find the longest common subsequence.
- Q2. Largest area in histogram
- Ans.
The largest area in a histogram refers to the rectangle with the maximum area that can be formed within the histogram bars.
Identify the largest rectangle that can be formed by considering each bar as a potential height and calculating the area based on the width of the rectangle.
Use a stack data structure to efficiently find the largest area in a histogram by keeping track of the indices of the bars in non-decreasing o...
Interview Preparation Tips
Skills evaluated in this interview
It had 9 uqestions , one problem solving , one SQL , one API and 6 mcq
Easy assignment , if you hav eOOps knowledge you can do it
Interview Questionnaire
10 Questions
- Q1. What do you do when your schedule is interrupted? How you handle it?
- Q2. PreOrder traversal without recursion?
- Ans.
PreOrder traversal without recursion is done using a stack to simulate the function call stack.
Create an empty stack and push the root node onto it.
While the stack is not empty, pop a node from the stack and process it.
Push the right child of the popped node onto the stack if it exists.
Push the left child of the popped node onto the stack if it exists.
- Q3. Build a bst out of the unsorted array by looping over the array and inserting each element to the tree?
- Ans.
Yes
Create an empty binary search tree (BST)
Loop over the unsorted array
For each element, insert it into the BST using the appropriate insertion logic
Repeat until all elements are inserted
The resulting BST will be built from the unsorted array
- Q4. Find 2 elements in array whose sum is equal to given number?
- Ans.
The question asks to find two elements in an array whose sum is equal to a given number.
Iterate through the array and for each element, check if the difference between the given number and the current element exists in the array.
Use a hash set to store the elements as you iterate through the array for efficient lookup.
Return the pair of elements if found, otherwise return a message indicating no such pair exists.
- Q5. How many types of trigger?
- Ans.
There are two types of triggers: DML triggers and DDL triggers.
DML triggers are fired in response to DML (Data Manipulation Language) statements like INSERT, UPDATE, DELETE.
DDL triggers are fired in response to DDL (Data Definition Language) statements like CREATE, ALTER, DROP.
Examples: A DML trigger can be used to log changes made to a table, while a DDL trigger can be used to enforce certain rules when a table is alt
- Q6. Can trigger be used with select statement?
- Ans.
Yes, triggers can be used with select statements in SQL.
Triggers are database objects that are automatically executed in response to certain events, such as insert, update, or delete operations.
While triggers are commonly used with insert, update, and delete statements, they can also be used with select statements.
Using triggers with select statements allows you to perform additional actions or validations before or af...
- Q7. Indexing in mysql? How many types of indexing in mysql?
- Ans.
Indexing in MySQL improves query performance. There are several types of indexing in MySQL.
Indexes are used to quickly locate data without scanning the entire table.
Types of indexing in MySQL include B-tree, hash, full-text, and spatial indexes.
B-tree indexes are the most common and suitable for most use cases.
Hash indexes are used for exact match lookups.
Full-text indexes are used for searching text-based data efficie...
- Q8. Engines in mysql?
- Ans.
Engines in MySQL are the underlying software components that handle storage, indexing, and querying of data.
MySQL supports multiple storage engines, each with its own strengths and features.
Some commonly used engines in MySQL are InnoDB, MyISAM, and Memory.
InnoDB is the default engine in MySQL and provides support for transactions and foreign keys.
MyISAM is known for its simplicity and speed but lacks transaction suppo...
- Q9. Singlton pattern?
- Q10. Can a constructor be private?
- Ans.
Yes, a constructor can be private.
A private constructor can only be accessed within the class itself.
It is often used in singleton design pattern to restrict object creation.
Private constructors are also useful for utility classes that only contain static methods.
Interview Preparation Tips
College Name: na
Skills evaluated in this interview
I appeared for an interview before Dec 2020.
(2 Questions)
Round duration - 120 minutes
Round difficulty - Medium
The Entire Test is held in HackerRank Platform. It has:
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
It took me 30 min for each coding questions. I did not know that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic C and C++ concepts
- Q1.
Binary Tree to Doubly Linked List
Transform a given Binary Tree into a Doubly Linked List.
Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.
Input:
The fi... - Ans.
Convert a Binary Tree into a Doubly Linked List following Inorder Traversal.
Perform Inorder Traversal of the Binary Tree to get the nodes in order.
Create a Doubly Linked List by linking the nodes in the order obtained from Inorder Traversal.
Return the head of the Doubly Linked List as the output.
- Q2.
Unique Element in Array
Given an arbitrary array
arrconsisting ofNnon-negative integers where every element appears thrice except for one. Your task is to find the element in the array that appears onl... - Ans.
Find the unique element in an array where every other element appears thrice.
Use XOR operation to find the unique element.
Iterate through the array and XOR each element to find the unique one.
Return the unique element as the answer.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it.
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.
- Q1.
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
- Ans.
Implement a function to compute In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Parse the input level-order tree elements to construct the binary tree.
Implement recursive functions for In-Order, Pre-Order, and Post-Order traversals.
Return the traversals as lists of lists for each test case.
- Q2.
Delete N Nodes After M Nodes in a Linked List
Given a singly linked list and two integers 'N' and 'M', traverse the linked list to retain 'M' nodes and then delete the next 'N' nodes. Continue this proces...
- Ans.
Traverse a linked list to retain 'M' nodes and then delete the next 'N' nodes, repeating until the end of the list.
Create a function that takes the head of the linked list, 'N', and 'M' as input parameters.
Traverse the linked list, retaining 'M' nodes and deleting the next 'N' nodes in each iteration.
Update the pointers accordingly to skip 'N' nodes after retaining 'M' nodes.
Repeat this process until the end of the lin...
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked to put everything on the blackboard and write down the code of each and everything.
Question : Explain all the search algorithm you know with space and Time complexities.
Answer : Linear search : It is a sequential search algorithm where the entire array is traversed till the desired element is not found. Time complexity is O(N) and auxiliary space is O(1).
Binary search : In this algorithm, a sorted array is searched by repeatedly dividing the search interval in half.
Steps :
1. Initially the interval covers the whole array.
2. If the value to be searched is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise, narrow it to the upper half.
3. The process is repeated until the value is found or the interval is empty.
Time complexity is O(log n) and auxiliary space is O(1) in case of iterative implementation.
- Q1.
Maximum Frequency Number Problem Statement
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...
- Ans.
Program to find the number with maximum frequency in an array of integers.
Create a dictionary to store the frequency of each number in the array.
Iterate through the array and update the frequency count in the dictionary.
Find the number with the maximum frequency in the dictionary and return it.
If multiple elements have the same maximum frequency, return the one with the lowest index.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Blinkit Interview FAQs
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 Software Developer Interview Questions
- Blinkit Station Manager Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Hostel Warden Interview Questions
- Product Control Analyst Interview Questions
- Decision Analytics Consultant Interview Questions
- Cloud Engineer 2 Interview Questions
- Piping Engineer Interview Questions
- Marketing Specialist Interview Questions
- Unit Head Interview Questions
- Senior SQA Engineer Interview Questions
- Show more
Blinkit SDE Interview Process
based on 1 interview
Interview experience
SDE Interview Questions from Similar Companies
Fast track your campus placements
|
Store Manager
848
salaries
|  ₹3 L/yr - ₹7.6 L/yr |
|
Senior Executive
572
salaries
| ₹1.9 L/yr - ₹8 L/yr |
|
Assistant Manager
428
salaries
| ₹2.5 L/yr - ₹11 L/yr |
|
Team Lead
413
salaries
| ₹1.4 L/yr - ₹4.5 L/yr |
|
Assistant Store Manager
333
salaries
| ₹2.3 L/yr - ₹5 L/yr |
Zepto
BigBasket
Udaan
Swiggy
- Home >
- Interviews >
- Blinkit Interview Questions >
- Blinkit SDE Interview Questions
