Upload Button Icon Add office photos

Blinkit

Compare button icon Compare button icon Compare

Filter interviews by

Blinkit Sde1 Interview Questions and Answers

Updated 14 Jan 2025

Blinkit Sde1 Interview Experiences

1 interview found

Sde1 Interview Questions & Answers

user image Anonymous

posted on 14 Jan 2025

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Referral and was interviewed in Jul 2024. There was 1 interview round.

Round 1 - Coding Test 

Hackerrank - 3 questions 2 hrs

Interview questions from similar companies

Sde1 Interview Questions & Answers

Amazon user image Anonymous

posted on 12 Aug 2017

I was interviewed in Aug 2017.

Interview Questionnaire 

16 Questions

  • Q1. -----/ But here the main thing is that handling of corner cases like when there are duplicate tickets and when there is no proper path possible with given tickets
  • Q2. N queen problem with problem statement and dry running of code with 4 queens and then writing the code
  • Ans. 

    N queen problem is to place N queens on an NxN chessboard without any two queens threatening each other.

    • The problem can be solved using backtracking algorithm

    • Start with placing a queen in the first row and move to the next row

    • If no safe position is found, backtrack to the previous row and try a different position

    • Repeat until all queens are placed or no safe position is found

    • Code can be written in any programming langua...

  • Answered by AI
  • Q3. Sub set problem(Check if there exists any sub array with given sum in the array ) . But the thing here is that we have to do it with space complexity of only O( 1 K ) . K is the sum given .
  • Ans. 

    Check if there exists any sub array with given sum in the array with O(1K) space complexity.

    • Use two pointers to traverse the array and maintain a current sum.

    • If the current sum is greater than the given sum, move the left pointer.

    • If the current sum is less than the given sum, move the right pointer.

    • If the current sum is equal to the given sum, return true.

  • Answered by AI
  • Q4. What is NP hardness .
  • Ans. 

    NP hardness refers to the difficulty of solving a problem in non-deterministic polynomial time.

    • NP-hard problems are some of the most difficult problems in computer science.

    • They cannot be solved in polynomial time by any known algorithm.

    • Examples include the traveling salesman problem and the knapsack problem.

  • Answered by AI
  • Q5. What is the difference between references and pointers
  • Ans. 

    References and pointers are both used to access memory locations, but references cannot be null and cannot be reassigned.

    • Pointers can be null and can be reassigned to point to different memory locations.

    • References are automatically dereferenced, while pointers need to be explicitly dereferenced.

    • Pointers can perform arithmetic operations, while references cannot.

    • Example: int x = 5; int *ptr = &x; int &ref = x;

    • Example: i

  • Answered by AI
  • Q6. What is difference between reference variable and actual reference
  • Ans. 

    A reference variable is a variable that holds the memory address of an object, while an actual reference is the object itself.

    • A reference variable is declared with a specific type and can only refer to objects of that type.

    • An actual reference is the object itself, which can be accessed and manipulated using the reference variable.

    • Changing the value of a reference variable does not affect the original object, but changi...

  • Answered by AI
  • Q7. In this round he asked me about previous round questions and their time complexities also . and with every DS and Algo related questions they asked the time complexities
  • Q8. Segmentation , virtual memory , paging
  • Q9. 0-1 Knapsack problem
  • Q10. What happens when we type an URL
  • Ans. 

    When we type an URL, the browser sends a request to the server hosting the website and retrieves the corresponding webpage.

    • The browser parses the URL to extract the protocol, domain, and path.

    • It resolves the domain name to an IP address using DNS.

    • The browser establishes a TCP connection with the server.

    • It sends an HTTP request to the server.

    • The server processes the request and sends back an HTTP response.

    • The browser re

  • Answered by AI
  • Q11. Implementation of LRU (WIth Production level code)
  • Ans. 

    Implementation of LRU cache using a doubly linked list and a hash map.

    • LRU (Least Recently Used) cache is a data structure that stores a fixed number of items and evicts the least recently used item when the cache is full.

    • To implement LRU cache, we can use a doubly linked list to maintain the order of items based on their usage frequency.

    • We can also use a hash map to store the key-value pairs for quick access and retrie...

  • Answered by AI
  • Q12. Given page access sequence and we have to tell final output using different page replacement algorithms like FIFO , LRU etc
  • Q13. What is indexing in DBMS How do we maintain it
  • Ans. 

    Indexing in DBMS is a technique to improve query performance by creating a data structure that allows faster data retrieval.

    • Indexing is used to speed up data retrieval operations in a database.

    • It involves creating a separate data structure that maps the values of a specific column to their corresponding records.

    • This data structure is called an index.

    • Indexes are typically created on columns that are frequently used in s...

  • Answered by AI
  • Q14. B trees , B+ trees with examples
  • Ans. 

    B trees and B+ trees are data structures used for efficient storage and retrieval of data in databases.

    • B trees are balanced trees with a variable number of child nodes per parent node. They are commonly used in databases to store large amounts of data.

    • B+ trees are a variant of B trees where all data is stored in the leaf nodes, and the internal nodes only contain keys. They are commonly used in databases for indexing.

    • B...

  • Answered by AI
  • Q15. AVL trees with examples and their balancing
  • Ans. 

    AVL trees are self-balancing binary search trees. They maintain a balance factor to ensure height balance.

    • AVL trees are named after their inventors, Adelson-Velsky and Landis.

    • They are height-balanced, meaning the difference in height between left and right subtrees is at most 1.

    • Insertion and deletion operations may cause imbalance, which is corrected by rotations.

    • AVL trees have a worst-case time complexity of O(log n) ...

  • Answered by AI
  • Q16. Pid ={3,5,0,1} ppid ={5,4,2,2} process id(pid) ppid=parent process id let us say the process that we killed is 2 now we have to print 2,0,1 as 0,1 are child of 2 and suppose that if we have children f...
  • Ans. 

    Given a list of process IDs and their corresponding parent process IDs, print the IDs of all processes that are children of a specific process ID, and recursively kill all their children.

    • Iterate through the list of process IDs and parent process IDs

    • Check if the current process ID is the one to be killed

    • If yes, recursively find and print all its children

    • If a child has further children, recursively kill them as well

  • Answered by AI

Interview Preparation Tips

Round: WRITTEN
Experience: It is a written round .

We are given with 2 coding questions of 10 marks each .There is no negative marking for coding questions

1)Given a string you have to partition the string in such a manner that each part of the partitioned string is a palindrome in itself and you have to count the number of such partition

For eg: given string NITIN
N ITI N
N I T I N
NITIN
So output will be 3.

2)You are given with a large paragraph and N words.
You have to find a min length subparagraph of the paragraph which contain all those N words in any order. Here length of a paragraph is the count of words in the paragraph.

There are 20 MCQ's all are technical questions only majorly from DSA
Tips: Coding it comes from practice . And for aptitude be good at fundamentals like time complexities etc .

Round: Technical Interview
Experience: Some times luck in interview is also important .I was unable to solve the second question initially ,but later with the help of my interviewer I was able to solve it .
Tips: Even if you are not able to solve the question initially don't be panic it will definitely go well

Round: Technical Interview
Experience: There are so many other questions . But sorry to say that I don't remember all of them ,if I remember them at some other time I will again update it here .

This round interviewer was very nice person And he is very helpful in fact .
Tips: Have solid basics at all data structures and algorithms ,Operating Systems


Round: Technical Interview
Experience: This round is entirely about other CS subjects like OS , DBMS,Networking .

Here asked me do you know other CS subjects like compiler design etc .
But as I am from Electronics I told them that I don't know all those subjects
Tips: Be good at other Cs subjects also

Round: Technical Interview
Experience: I solved above question Using DFS .I constructed a Graph using given information . and I did DFS starting from Given process .In the graph I took each process as 1 Node and the corresponding parent child relationship between the process as edges .
Tips: They will give sufficient time for thinking of the solution . So don't worry immediately after seeing the question . First think well you will definitely get it

Skills: Algorithms And DataStructures, Algorithm Analysis, Operating Systems, Basic Knowledge Of DBMS, Networking Basics, Object Oriented Programming (OOP) Basics
College Name: MNIT

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Jan 2024. There were 3 interview rounds.

Round 1 - Coding Test 

1 HR of coding round, 2 problems asked. One on stack, one on DP.

Round 2 - Coding Test 

Machine coding round where LLD implementation of a cab booking system was asked.

Round 3 - Behavioral 

(2 Questions)

  • Q1. Past projects were discussed at length
  • Q2. Behavioural questions were asked

Sde1 Interview Questions & Answers

Swiggy user image Anonymous

posted on 16 Jul 2024

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Jul 2023. There were 3 interview rounds.

Round 1 - Coding Test 

Design splitwise. Low Level question. More like Machine Coding

Round 2 - Coding Test 

Question on Strings and DP

Round 3 - HM Round 

(2 Questions)

  • Q1. DynamoDB Working
  • Q2. General Discussion regarding projects in previous firm

Sde1 Interview Questions & Answers

Swiggy user image Anonymous

posted on 6 Feb 2023

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
No response

I applied via Referral and was interviewed before Feb 2022. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Double-check your resume for any spelling mistakes. The recruiter may consider spelling mistakes as careless behavior or poor communication skills.
View all tips
Round 2 - HR 

(2 Questions)

  • Q1. Asked Likes and dislikes
  • Q2. Question related to company

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn and grow, and work hard and work hard , Make

Sde1 Interview Questions & Answers

Flipkart user image Anonymous

posted on 24 Jun 2024

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Company Website and was interviewed in May 2024. There were 2 interview rounds.

Round 1 - Coding Test 

3 DSA questions were there in the coding round

Round 2 - Technical 

(2 Questions)

  • Q1. DSA based question
  • Q2. DSA question medium level

Sde1 Interview Questions & Answers

Amazon user image Anonymous

posted on 21 Feb 2022

I applied via Company Website and was interviewed in Jan 2022. There were 2 interview rounds.

Round 1 - Coding Test 

Asked 2 questions
1. Find the strings with maximum pattern match in given array of strings
2. Find the shortest distance between two target elements in given array

Round 2 - Technical 

(1 Question)

  • Q1. 1. Find the contiguous sub array with max sum 2. Find the median of an array sorting is involved

Interview Preparation Tips

Topics to prepare for Amazon Sde1 interview:
  • Data St
  • Algorithms
Interview preparation tips for other job seekers - Completly asked questions related to DSA and practice medium and high level problems in geeksforgeeks and leetcode

Skills evaluated in this interview

Sde1 Interview Questions & Answers

Amazon user image Anonymous

posted on 30 Mar 2023

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Double-check your resume for any spelling mistakes. The recruiter may consider spelling mistakes as careless behavior or poor communication skills.
View all tips
Round 2 - Coding Test 

45 minutes
2 medium level questions

Round 3 - One-on-one 

(2 Questions)

  • Q1. Rotten oranges srgiluskbfakbv agr vua bgG I;E OWE FKEJBiluwefbLEFskdbfhadbfil brsebkfb ;so gao;ig o b galkgrbalgb
  • Q2. 8 queen an lfabi abbglkabahblba bilub lilba l vvblab WLEKFJB AEFBIWEF KJDBAKDBVLYA Ffawejawl iubaw ;h'FO IF ;IFBA Jfkfblif ai;ur h

Interview Preparation Tips

Interview preparation tips for other job seekers - ab ia bfie;oweinfgakrjbgliE BIUWB GIEWB AD SBKB ABB bdlvkdbiagiia bladblakdjblakbl bh ldf bvlbgli

Sde1 Interview Questions & Answers

Amazon user image Anonymous

posted on 30 Dec 2022

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed in Jun 2022. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(2 Questions)

  • Q1. Tell me about yourself
  • Q2. Coding based questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Jsjsvhs svamsvamd bssmxvsn sbdnvvsksbs xhxksbshsksn

Sde1 Interview Questions & Answers

Amazon user image Anonymous

posted on 9 Mar 2024

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.

Round 1 - Coding Test 

DSA round - algorithm to insert in sorted and non overlapping intervel

Blinkit Interview FAQs

How many rounds are there in Blinkit Sde1 interview?
Blinkit interview process usually has 1 rounds. The most common rounds in the Blinkit interview process are Coding Test.

Tell us how to improve this page.

Blinkit Sde1 Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Sde1 Interview Questions from Similar Companies

Amazon Sde1 Interview Questions
4.1
 • 30 Interviews
Flipkart Sde1 Interview Questions
4.0
 • 2 Interviews
Swiggy Sde1 Interview Questions
3.8
 • 2 Interviews
Meesho Sde1 Interview Questions
3.7
 • 1 Interview
Licious Sde1 Interview Questions
3.7
 • 1 Interview
View all
Blinkit Sde1 Salary
based on 6 salaries
₹15 L/yr - ₹24 L/yr
At par with the average Sde1 Salary in India
View more details
Store Manager
822 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Executive
555 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
428 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Team Lead
422 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Station Manager
325 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Blinkit with

Zepto

3.5
Compare

BigBasket

3.9
Compare

Flipkart

4.0
Compare

Amazon

4.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview