23 questions · from 10 interviews

Blinkit interview questions

Every question candidates reported from their Blinkit interviews, most frequently asked first. Each links to the write-up it came from, so you can see the round and how it went.

Blinkit coding and DSA questions

  1. 01

    Search in Rotated Sorted Array

    Given a rotated sorted array and a target value, find the index of the target. The solution should use a modified binary search that determines which half of the array is sorted at each step and narrows the search accordingly. Edge cases such as empty array…

    Medium · From Blinkit SDE-1 Backend | Off-Campus Interview Experience

  2. 02

    Design LRU Cache

    Design a Least Recently Used (LRU) cache that supports get(key) and put(key, value) operations in O(1) time. get should return the value if the key exists, otherwise -1. put should insert or update the value and ensure that when the cache reaches its…

    Medium · From Blinkit SDE-1 Backend | Off-Campus Interview Experience

  3. 03

    Find Peak Element

    Given an array, find an index i such that arr[i] is greater than or equal to its neighbors. The element at the boundaries has only one neighbor. Return any peak element's index. The expected solution uses a binary search approach with O(log n) time complexity.

    Easy · From Blinkit SDE-1 Backend Interview Experience | Off-Campus

  4. 04

    Design LFU Cache

    Design a Least Frequently Used (LFU) cache that supports get(key) and put(key, value) operations. Both operations should have O(1) time complexity. The cache should evict the least frequently used item when capacity is reached, and in case of ties, the least…

    Medium · From Blinkit SDE-1 Backend Interview Experience | Off-Campus

  5. 05

    Insert Delete GetRandom in O(1)

    Design a data structure that supports the following operations in average O(1) time: - insert(val): Inserts an integer val into the set if not already present. - remove(val): Removes the integer val from the set if it exists. - getRandom(): Returns a random…

    From Title: Blinkit | SDE 2 | June 2026 | Reject

  6. 06

    Search in Spirally Sorted 2D Array

    Given a 2D array that is sorted in a spiral order, search for a target element and return its position (or indicate if it is not present).

    From Blinkit | SDE 2 | Compensation

  7. 07

    House Robber

    Given an array of non‑negative integers representing the amount of money of each house, determine the maximum amount of money you can rob without robbing two adjacent houses.

    Medium · From Interview Experience | Blinkit (Eternal) | SDE-1 | Gurgaon | June 2026 [Offer]

  8. 08

    House Robber II

    Similar to House Robber, but the houses are arranged in a circle. Determine the maximum amount you can rob without robbing two adjacent houses, considering the first and last houses are also adjacent.

    Medium · From Interview Experience | Blinkit (Eternal) | SDE-1 | Gurgaon | June 2026 [Offer]

  9. 09

    Unique Supersequence Existence

    Given two arrays with unique numbers, arr1 and arr2, determine whether there exists an array arr3 that contains both arr1 and arr2 as subsequences and where all numbers in arr3 are unique. Return true or false. Example: Sample 1: arr1 = [2, 3, 5, 1] arr2 =…

    From Interview Experience | Blinkit (Eternal) | SDE-1 | Gurgaon | June 2026 [Offer]

  10. 10

    Minimum Distance in Modified Graph

    You are given a weighted directed graph, a source, and a destination. You also have a set of edges, out of which you can add at most one edge to the graph. Find the minimum possible distance from the source to the destination.

    From Blinkit SDE-2 | Reject

  11. 11

    Kth Largest Element in a Stream

    The problem involved finding the Kth Largest Element in a Stream.

    Medium · From Blinkit | SDE-3 | Bad Experience

  12. 12

    DSA: House Robber II + Combination Sum Blend

    A story-based problem that was a blend of House Robber II + Combination Sum.

    From 🟡 How I Cracked Blinkit's SDE-1 Interview! 🟡

Blinkit system design questions

  1. 01

    Food Delivery Order Tracking System Design

    Design a system for tracking food delivery orders. The design should cover API endpoints, database schema, entity relationships, order lifecycle management, event-driven communication versus synchronous calls, handling high traffic, idempotency, failure…

    From Blinkit SDE-1 Backend | Off-Campus Interview Experience

  2. 02

    Design a Notification System

    Create a notification system that can send real‑time alerts to users. Discuss components such as API endpoints, message queues (e.g., Kafka), database schema, indexing strategy, scalability, and fault tolerance. Produce high‑level UML diagrams and justify…

    From Blinkit SDE-1 Backend Interview Experience | Off-Campus

  3. 03

    Design an Event Scheduler

    Design a high‑level system that can schedule events, handling creation, updates, deletions, and notifications while ensuring scalability and reliability.

    From Blinkit | SDE 2 | Compensation

  4. 04

    Design a Ticket Booking System (BookMyShow)

    Design a high‑traffic ticket booking system similar to BookMyShow. Discuss key components, data models, handling of concurrent seat selection, UX improvements for popular events, and strategies such as pessimistic/optimistic locking and use of Redis.

    From Interview Experience | Blinkit (Eternal) | SDE-1 | Gurgaon | June 2026 [Offer]

  5. 05

    Oncall System Design

    Design an oncall system that handles scheduling and rotation of oncall engineers. The system should support adding engineers, assigning oncall shifts, and rotating through the list based on predefined rules. It should also handle edge cases like overlapping…

    Hard · From Blinkit Interview Expreince

  6. 06

    Caching Limitations with Infinite Cost

    Assume we have infinite cost. Why can't we just replace a database with a cache?

    From Blinkit SDE-2 | Reject

  7. 07

    System Design: Data Scraping and Analytics for Financial Apps

    Design a system that can collect credentials from multiple financial apps, scrape data, process it, and generate analytics for both users and admins. During the discussion, admin-level analysis was dynamically added to the requirements, requiring on-the-fly…

    From 🟡 How I Cracked Blinkit's SDE-1 Interview! 🟡

Blinkit other questions

  1. 01

    ViewModel lifecycle with multiple Activity instances

    If I create Activity A and a corresponding ViewModelA to hold its data, and I instantiate the ViewModel using ViewModelProviders in onCreate, then start a new instance of Activity A on top of the existing Activity A, will the ViewModel be created again for…

    From Blinkit Interview Experience for SDE — Android Role 2024

  2. 02

    Intent resolution for specific type

    When we send an intent with a specific type, like sharing an image, how does the Android system or other apps know which app should handle the specific intent?

    From Blinkit Interview Experience for SDE — Android Role 2024

  3. 03

    Preserving data during configuration changes

    During a configuration change such as screen orientation, will a Bundle passed to an Activity or Fragment preserve the data? What alternative mechanisms can be used to retain data across configuration changes?

    From Blinkit Interview Experience for SDE — Android Role 2024

  4. 04

    Technical Discussion: Kafka Optimization and Async Order Processing

    Deep-dive discussion into real-world async problems Blinkit is facing while processing orders. Topics included: Async order processing challenges, Kafka optimization strategies, Frontend checks + backend resilience, and Scenarios I handled in production.

    From 🟡 How I Cracked Blinkit's SDE-1 Interview! 🟡

Blinkit interview questions FAQ

What questions are asked in Blinkit interviews?

Candidates reported 23 distinct questions across 10 Blinkit interviews. 12 coding and DSA questions, 7 system design questions, 4 other questions.

How difficult are Blinkit interview questions?

Of the questions candidates rated, 13% were easy, 75% medium and 13% hard.