Flipkart

Flipkart

Indian e-commerce giant tackling massive supply chain and scale problems.

4 Rounds ~18 Days Hard
Start Mock Interview

The Interview Loop

Recruiter Screen (30 min)

Standard fit check, behavioral questions, and resume overview.

Technical Loop (3-4 Rounds)

Deep dive into domain knowledge, coding, and system design.

Interview Question Bank

Software Engineer • Coding • medium

Implement an LRU (Least Recently Used) Cache. It should support get and put operations in O(1) time complexity.

#Hash Map #Doubly Linked List
Practice
Software Engineer • Coding • medium

Given a grid where each cell can have a 0 (empty), 1 (fresh orange), or 2 (rotten orange), find the minimum time required to rot all oranges. A rotten orange rots adjacent fresh ones every minute.

#Graph #Breadth-First Search
Practice
Software Engineer • Coding • hard

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

#Two Pointers #Dynamic Programming #Array
Practice
Software Engineer • Coding • hard

Given two strings s and t, return the minimum window in s which will contain all the characters in t. If there is no such window, return an empty string.

#Sliding Window #Hash Table #String
Practice
Software Engineer • Coding • hard

Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord.

#Graph #Breadth-First Search #String
Practice
Software Engineer • Coding • hard

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.

#Linked List #Heap #Divide and Conquer
Practice
Software Engineer • Coding • medium

There are a total of numCourses courses you have to take. Some courses have prerequisites. Determine if it is possible for you to finish all courses.

#Graph #Topological Sort #DFS
Practice
Software Engineer • Coding • medium

Given an integer array nums, return the length of the longest strictly increasing subsequence.

#Dynamic Programming #Binary Search
Practice
Software Engineer • Coding • hard

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

#Binary Search #Array #Divide and Conquer
Practice
Software Engineer • Coding • hard

Given a sorted dictionary of an alien language having N words and k starting alphabets of standard dictionary. Find the order of characters in the alien language.

#Graph #Topological Sort #String
Practice

Difficulty Radar

Based on recent AI-sourced data.

Meet Your Interviewers

The "Standard" Interviewer

Senior Engineer

Focuses on core competencies, system constraints, and clear communication.

Simulate

Unwritten Rules

Think Out Loud

Always explain your thought process before writing code or drawing architecture.

Practice Now