Company sheets › Flipkart
Flipkart interview preparation
India’s leading e-commerce company; known for its machine coding round. SDE-1 and intern roles through campus and online hiring.
Flipkart hiring process
- Online assessment — Two to three DSA problems of Medium–Hard level.
- Machine coding round — Build a small working system (e.g. a parking lot or cab booking) in about 90 minutes with clean, extensible code.
- DSA / problem-solving interview — Trees, graphs, DP and heaps with a focus on optimisation.
- Hiring manager round — Projects, design choices and behavioural questions.
The process changes from year to year — check the official notice for the exact pattern.
Interview topics
Tips
- Practise machine coding: design classes and interfaces first, keep the code modular and runnable, then add features.
- Know heaps, tries and graph algorithms well — they appear often in the DSA round.
Flipkart DSA problems (43)
- Best Time to Buy and Sell Stock — Easy
- Two Sum — Medium
- Maximum Subarray Sum — Medium
- Sort 0s, 1s and 2s — Medium
- Merge Intervals — Medium
- Best Time to Buy and Sell Stock II — Medium
- Count Subarrays with XOR K — Medium
- Count Inversions — Hard
- Distinct Elements in Every Window — Medium
- Longest Substring Without Repeating Characters — Medium
- Sliding Window Maximum — Hard
- First and Last Occurrence — Easy
- Capacity to Ship Packages — Medium
- Aggressive Cows — Hard
- Kth Element of Two Sorted Arrays — Hard
- Add Two Numbers as Lists — Medium
- Intersection of Two Linked Lists — Medium
- Previous Smaller Element — Easy
- Valid Parentheses — Medium
- Next Greater Element — Medium
- Next Greater Element II — Medium
- The Celebrity Problem — Medium
- LRU Cache — Hard
- Kth Largest Element in an Array — Easy
- Sort a K-Sorted Array — Medium
- Preorder Traversal — Easy
- Left View of a Binary Tree — Medium
- Zigzag Level Order Traversal — Medium
- Bottom View of a Binary Tree — Medium
- Boundary Traversal — Medium
- Time to Burn a Binary Tree — Hard
- Detect Cycle in an Undirected Graph — Medium
- Dijkstra's Shortest Paths — Medium
- Topological Sort — Medium
- House Robber — Medium
- 0/1 Knapsack — Medium
- Count Subsets with Sum K — Medium
- Longest Common Substring — Medium
- Matrix Chain Multiplication — Hard
- N Meetings in One Room — Medium
- Minimum Platforms — Medium
- Fractional Knapsack — Medium
- Job Sequencing — Medium