Flipkart Coding Interview Questions
25 Flipkart coding interview problems with full optimal solutions — 11 easy, 11 medium, 3 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Flipkart interviewer values, and a FAQ section.
Showing 11 problems of 25
- #1easyfoundational
1. Two Sum
Find two indices in an array whose values sum to a target — Flipkart uses this to gauge whether candidates default to brute force or reach for hash maps.
- #2easyfoundational
2. Valid Parentheses
Validate that opening and closing brackets are balanced — Flipkart uses this to test stack intuition before scaling to nested order-state machines.
- #3easyfoundational
3. Merge Two Sorted Lists
Merge two sorted linked lists into one sorted list — Flipkart asks this to test pointer manipulation before scaling to merging sorted shipment manifests.
- #4easyfoundational
4. Remove Duplicates from Sorted Array
Strip duplicates in-place from a sorted array — Flipkart uses this to test two-pointer fluency before scaling to deduping customer review streams.
- #5easyfoundational
5. Same Tree
Check whether two binary trees are structurally identical with equal node values — Flipkart uses it to test recursion fluency before diving into category-tree problems.
- #6easyfoundational
6. Symmetric Tree
Decide whether a binary tree is a mirror of itself — Flipkart uses it as a quick recursion warm-up before moving to inventory-tree questions.
- #7easyfoundational
7. Maximum Depth of Binary Tree
Compute the height of a binary tree — Flipkart uses this as a recursion sanity check before harder catalog-tree traversals.
- #8easyfoundational
8. Best Time to Buy and Sell Stock
Find the max single-transaction profit from a price stream — Flipkart maps this to spotting the best discount window during a Big Billion Days sale event.
- #9easyfoundational
9. Single Number
Find the only element appearing once in an array where every other element appears twice — Flipkart uses this as a bit-manipulation gateway before harder dedup problems.
- #10easyfoundational
10. Min Stack
Design a stack with O(1) push, pop, top and getMin — Flipkart uses it to test whether candidates pick auxiliary structures over recomputation on every call.
- #11easyfoundational
11. Reverse Linked List
Reverse a singly linked list iteratively and recursively — Flipkart uses it to confirm pointer hygiene before moving on to LRU-cache style problems.