B

Blinkit

SDE-1

Interview Date

September 2025

Result

Rejected

Difficulty

Hard

Rounds

02

Drive Type

Off-Campus

Topics asked

DSASystem DesignCS Fundamentals

Detailed experience

๏ฟฝ๐—”๐—ฝ๐—ฝ๐—น๐—ถ๐—ฐ๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐—ฃ๐—ฟ๐—ผ๐—ฐ๐—ฒ๐˜€๐˜€ Applied through a referral. Cleared the resume screening round, which led me to further stages. ๏ฟฝ ๐—ฃ๐—ต๐—ผ๐—ป๐—ฒ ๐—ฆ๐—ฐ๐—ฟ๐—ฒ๐—ฒ๐—ป๐—ถ๐—ป๐—ด (๐—ฅ๐—ผ๐˜‚๐—ป๐—ฑ ๐Ÿญ) This round focused more on my background and overall fit: Questions on education, CGPA, and past work experience. A few situational questions on team management and strategic planning. ๏ฟฝ ๐—ง๐—ฒ๐—ฐ๐—ต๐—ป๐—ถ๐—ฐ๐—ฎ๐—น ๐—ฅ๐—ผ๐˜‚๐—ป๐—ฑ ๐Ÿญ (๐——๐—ฆ๐—” + ๐—–๐—ฆ ๐—–๐—ผ๐—ฟ๐—ฒ) I was asked questions about my projects, current tech stack, and then a DSA problem on Binary Trees with multiple variations. ๏ฟฝ Problem: Find a path in a binary tree such that the sum of nodes = K. Categories of the problem: ๐Ÿญ.Root-to-Leaf Path: Given the root node find if there exists a path from root โ†’ leaf such that the path sum = K. ๐Ÿฎ.With Negative Node Values: Optimize the above solution when node values can be negative. ๐Ÿฏ.Leaf Constraint Without Root: Find a path ending at a leaf node that sums to K (but you may start from anywhere, not necessarily the root). ๐Ÿฐ.General Path (No Root, No Leaf Restriction): Find any path (not restricted to root or leaf) whose sum = K. ๏ฟฝ My Approach: I solved these using DFS with backtracking and prefix sum optimization where needed. Apart from DSA, I was also asked some OOPs, OS and DBMS concepts. ๏ฟฝ ๐—ง๐—ฒ๐—ฐ๐—ต๐—ป๐—ถ๐—ฐ๐—ฎ๐—น ๐—ฅ๐—ผ๐˜‚๐—ป๐—ฑ ๐Ÿฎ (๐—ฆ๐˜†๐˜€๐˜๐—ฒ๐—บ ๐——๐—ฒ๐˜€๐—ถ๐—ด๐—ป / ๐—›๐—Ÿ๐——) This was the most challenging and interesting round.This was more practical and design-focused: Started with my introduction, projects, and experiences. Executed a SQL query successfully. Answered questions on backend technologies like Grafana, Node.js, and revisited OOPs pillars. ๏ฟฝ ๐—ฆ๐˜†๐˜€๐˜๐—ฒ๐—บ ๐——๐—ฒ๐˜€๐—ถ๐—ด๐—ป ๐—˜๐˜…๐—ฒ๐—ฟ๐—ฐ๐—ถ๐˜€๐—ฒ: Task: Design a live delivery tracking system for Blinkit. Approach: Proposed a design involving real-time updates using RabbitMQ for messaging and scalability. Challenge: Couldnโ€™t fully justify โ€œ๐˜„๐—ต๐˜† ๐—ฅ๐—ฎ๐—ฏ๐—ฏ๐—ถ๐˜๐— ๐—คโ€ during the discussion, which is something Iโ€™ve noted to improve on. Feedback from the interviewer was positive and I was able to demonstrate my thought process clearly. ๏ฟฝ ๐—™๐—ถ๐—ป๐—ฎ๐—น ๐—ข๐˜‚๐˜๐—ฐ๐—ผ๐—บ๐—ฒ After this round, HR informed me that I wasnโ€™t shortlisted for the final managerial round.

Posted on - 2 Apr 2026
Blinkit Interview Experience - SDE-1 | OAHelper