Blinkit Placement Papers 2024

Overview

This page collects Blinkit placement papers from 2024 with previous-year questions, solutions, and the 2024 exam pattern. It is useful when you want real drive history: what the OA looked like, which question types repeated, and how solutions were approached. Work through the papers below to build speed and accuracy, then compare against newer 2025 material so your prep matches both established Blinkit patterns and the latest shifts.

2024 Pattern

The 2024 Blinkit placement process emphasized DSA mastery and quick commerce system design. Online assessment included 2-3 DSA problems.

Blinkit Online Assessment 2024 pattern

Section	Questions	Time	Difficulty
Coding Problems	2-3	90 min	Medium-Hard

Blinkit Placement Papers 2024 - actual questions & solutions

This section contains practice questions styled on Blinkit placement papers 2024 (previous-year pattern), with worked solutions. Use them as timed sectional drills - from student reports drives vary by college and role, so treat this as a high-signal practice bank, not an official paper dump.

Question 1: detect cycle in linked list

Show solution

Problem Statement: Return true if the linked list has a cycle.

Example:

Input: 3→2→0→-4→(back to 2)
Output: true

Solution (Java):

public boolean hasCycle(ListNode head) {
    ListNode slow = head, fast = head;
    while (fast != null && fast.next != null) {
        slow = slow.next;
        fast = fast.next.next;
        if (slow == fast) return true;
    }
    return false;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 2: merge two sorted lists

Show solution

Problem Statement: Merge two sorted linked lists and return a new sorted list.

Example:

Input: 1→2→4 , 1→3→4
Output: 1→1→2→3→4→4

Solution (Java):

public ListNode mergeTwoLists(ListNode a, ListNode b) {
    ListNode dummy = new ListNode(0), cur = dummy;
    while (a != null && b != null) {
        if (a.val <= b.val) { cur.next = a; a = a.next; }
        else { cur.next = b; b = b.next; }
        cur = cur.next;
    }
    cur.next = (a != null) ? a : b;
    return dummy.next;
}

Time Complexity: O(n + m)
Space Complexity: O(1)

Question 3: check palindrome

Show solution

Problem Statement: Return true if the string reads the same forward and backward (ignore case).

Example:

Input: "Level"
Output: true

Solution (Java):

public boolean isPalindrome(String s) {
    s = s.toLowerCase();
    int i = 0, j = s.length() - 1;
    while (i < j) {
        if (s.charAt(i++) != s.charAt(j--)) return false;
    }
    return true;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 4: maximum subarray sum

Show solution

Problem Statement: Find the contiguous subarray with the largest sum.

Example:

Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4]
Output: 6  // [4, -1, 2, 1]

Solution (Java):

public int maxSubArray(int[] nums) {
    int best = nums[0], cur = nums[0];
    for (int i = 1; i < nums.length; i++) {
        cur = Math.max(nums[i], cur + nums[i]);
        best = Math.max(best, cur);
    }
    return best;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 5: two sum

Show solution

Problem Statement: Given an array of integers and a target, return indices of two numbers that add up to target.

Example:

Input: nums = [2, 7, 11, 15], target = 9
Output: [0, 1]

Solution (Java):

public int[] twoSum(int[] nums, int target) {
    Map<Integer, Integer> map = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
        int need = target - nums[i];
        if (map.containsKey(need)) return new int[]{map.get(need), i};
        map.put(nums[i], i);
    }
    return new int[]{};
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 6: binary tree level order

Show solution

Problem Statement: Return the level-order traversal of a binary tree.

Example:

Input: [3,9,20,null,null,15,7]
Output: [[3],[9,20],[15,7]]

Solution (Java):

public List<List<Integer>> levelOrder(TreeNode root) {
    List<List<Integer>> res = new ArrayList<>();
    if (root == null) return res;
    Queue<TreeNode> q = new ArrayDeque<>();
    q.add(root);
    while (!q.isEmpty()) {
        int sz = q.size();
        List<Integer> level = new ArrayList<>();
        for (int i = 0; i < sz; i++) {
            TreeNode n = q.poll();
            level.add(n.val);
            if (n.left != null) q.add(n.left);
            if (n.right != null) q.add(n.right);
        }
        res.add(level);
    }
    return res;
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 7: first non-repeating character

Show solution

Problem Statement: Return the first non-repeating character in a string, or ‘_’ if none.

Example:

Input: "swiss"
Output: 'w'

Solution (Java):

public char firstUnique(String s) {
    int[] freq = new int[256];
    for (char c : s.toCharArray()) freq[c]++;
    for (char c : s.toCharArray()) if (freq[c] == 1) return c;
    return '_';
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 8

Q8: Virtual memory is typically implemented using?

Solution:

OS uses demand paging (and sometimes segmentation) to implement virtual memory.

Answer: Demand paging

Question 9

Q9: Which data structure uses FIFO order?

Solution:

FIFO = First In First Out → Queue. Stack is LIFO.

Answer: Queue

Question 10

Q10: Time complexity of binary search on a sorted array of n elements is?

Solution:

Each step halves the search space → O(log n).

Answer: O(log n)

Question 11

Q11: Which normal form removes transitive dependency?

Solution:

1NF: atomic values. 2NF: no partial dependency. 3NF: no transitive dependency.

Answer: 3NF

Key insights from 2024 Blinkit Online Assessment

1. Coding Section is Critical: Must solve 2-3 coding problems correctly to advance
2. Quick Commerce Focus: Strong emphasis on quick commerce systems, delivery time optimization, logistics
3. Time Management: 2-3 problems in 90 minutes requires excellent speed and accuracy
4. Success Rate: Only 10-15% cleared OA and advanced to interviews
5. Platform: Blinkit assessment platform or HackerRank
6. Focus Areas: Arrays, trees, graphs, dynamic programming, quick commerce systems, delivery optimization

Blinkit 2024 interview experiences

Based on candidate experiences from 2024 Blinkit interviews:

2024 Interview Process:

1. Online Assessment (90 minutes): 2-3 coding problems
2. Technical Phone Screen (45-60 minutes): Coding problems, algorithm discussions, quick commerce concepts
3. Onsite Interviews (4-5 rounds, 45-60 minutes each):

• Coding rounds (2-3): Algorithms, data structures, problem-solving
• System Design rounds: Quick commerce platforms, delivery time optimization, logistics systems, real-time tracking
• Behavioral rounds: Problem-solving approach, quick commerce passion, impact

Common 2024 Interview Topics:

• Coding: Arrays, strings, trees, graphs, dynamic programming, delivery optimization algorithms
• System Design: Quick commerce platforms, delivery time optimization, logistics systems, real-time tracking
• Behavioral: Problem-solving, quick commerce passion, teamwork, impact
• Blinkit Technologies: Quick commerce platforms, delivery time optimization, logistics systems, real-time tracking

Success Tips:

• Strong coding performance is essential - solve problems optimally
• Understand quick commerce concepts and delivery optimization systems
• Practice system design for quick commerce platforms and logistics systems
• Prepare examples demonstrating problem-solving and quick commerce passion
• Learn Blinkit’s products and quick commerce technologies
• Practice explaining your thought process clearly

For detailed interview experiences, visit Blinkit Interview Experience page.

Preparation tips for Blinkit 2024 pattern

1. Master Coding Fundamentals: Focus on solving 2-3 coding problems correctly - arrays, trees, graphs, DP
2. Quick Commerce Knowledge: Strong understanding of quick commerce systems, delivery time optimization, logistics
3. Practice Previous Year Papers: Solve Blinkit OA papers from 2020-2024 to understand patterns
4. Time Management: Practice completing 2-3 coding problems in 90 minutes
5. LeetCode Practice: Solve 200+ LeetCode problems focusing on arrays, strings, trees, graphs (medium-hard difficulty)
6. Quick Commerce Focus: Practice problems related to quick commerce systems and delivery optimization
7. System Design Mastery: Learn quick commerce platform design, delivery time optimization, logistics systems
8. Blinkit Technologies: Learn quick commerce platforms, delivery time optimization, logistics systems, real-time tracking
9. Behavioral Preparation: Prepare examples using STAR format - problem-solving, quick commerce passion, impact
10. Mock Tests: Take timed practice tests to improve speed and accuracy

Related resources

Blinkit 2025 papers→

Latest Blinkit placement papers with current year questions

Blinkit coding questions→

Complete collection of Blinkit coding problems with solutions

Blinkit interview experience→

Real interview experiences from successful candidates

Blinkit preparation guide→

Comprehensive preparation strategy for Blinkit placement

Blinkit main page→

Complete Blinkit placement guide with eligibility, process, and salary

Similar companies

Zomato · Swiggy · Flipkart · Paytm · Phonepe · Razorpay

---

Practice 2024 papers to understand Blinkit OA pattern and prepare effectively!