Flipkart Interview Questions — 100 DSA Problems

99 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Flipkart LeetCode questions for software engineering interviews.

• Smallest Range Covering Elements from K Lists (HARD) — Array, Hash Table, Greedy, Sliding Window, Sorting, Heap (Priority Queue)
• Shortest Bridge (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Matrix
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• Maximum Points You Can Obtain from Cards (MEDIUM) — Array, Sliding Window, Prefix Sum
• Design Movie Rental System (HARD) — Array, Hash Table, Design, Heap (Priority Queue), Ordered Set
• Minimum Number of Coins to be Added (MEDIUM) — Array, Greedy, Sorting
• Capacity To Ship Packages Within D Days (MEDIUM) — Array, Binary Search
• Minimum Cost to Reach City With Discounts (MEDIUM) — Graph, Heap (Priority Queue), Shortest Path
• Minimum Limit of Balls in a Bag (MEDIUM) — Array, Binary Search
• The Score of Students Solving Math Expression (HARD) — Array, Math, String, Dynamic Programming, Stack, Memoization
• Numbers With Same Consecutive Differences (MEDIUM) — Backtracking, Breadth-First Search
• Triples with Bitwise AND Equal To Zero (HARD) — Array, Hash Table, Bit Manipulation
• Minimum Total Cost to Make Arrays Unequal (HARD) — Array, Hash Table, Greedy, Counting
• Container With Most Water (MEDIUM) — Array, Two Pointers, Greedy
• Binary Tree Maximum Path Sum (HARD) — Dynamic Programming, Tree, Depth-First Search, Binary Tree
• Koko Eating Bananas (MEDIUM) — Array, Binary Search
• Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
• Asteroid Collision (MEDIUM) — Array, Stack, Simulation
• Cherry Pickup II (HARD) — Array, Dynamic Programming, Matrix
• Minimum Adjacent Swaps for K Consecutive Ones (HARD) — Array, Greedy, Sliding Window, Prefix Sum
• Two Sum (EASY) — Array, Hash Table
• Strong Password Checker (HARD) — String, Greedy, Heap (Priority Queue)
• Create Maximum Number (HARD) — Array, Two Pointers, Stack, Greedy, Monotonic Stack
• Product of Array Except Self (MEDIUM) — Array, Prefix Sum
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Rotting Oranges (MEDIUM) — Array, Breadth-First Search, Matrix
• Gas Station (MEDIUM) — Array, Greedy
• Course Schedule (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Maximum Profit in Job Scheduling (HARD) — Array, Binary Search, Dynamic Programming, Sorting
• Largest Rectangle in Histogram (HARD) — Array, Stack, Monotonic Stack
• Dungeon Game (HARD) — Array, Dynamic Programming, Matrix
• Subarray Sum Equals K (MEDIUM) — Array, Hash Table, Prefix Sum
• Sort Colors (MEDIUM) — Array, Two Pointers, Sorting
• Edit Distance (MEDIUM) — String, Dynamic Programming
• Merge Two Sorted Lists (EASY) — Linked List, Recursion
• Partition Equal Subset Sum (MEDIUM) — Array, Dynamic Programming
• Median of Two Sorted Arrays (HARD) — Array, Binary Search, Divide and Conquer
• Burst Balloons (HARD) — Array, Dynamic Programming
• Maximum Width of Binary Tree (MEDIUM) — Tree, Depth-First Search, Breadth-First Search, Binary Tree
• Find K-th Smallest Pair Distance (HARD) — Array, Two Pointers, Binary Search, Sorting
• Decode Ways (MEDIUM) — String, Dynamic Programming
• Binary Tree Zigzag Level Order Traversal (MEDIUM) — Tree, Breadth-First Search, Binary Tree
• First Missing Positive (HARD) — Array, Hash Table
• Candy (HARD) — Array, Greedy
• Merge Intervals (MEDIUM) — Array, Sorting
• Open the Lock (MEDIUM) — Array, Hash Table, String, Breadth-First Search
• Cherry Pickup (HARD) — Array, Dynamic Programming, Matrix
• Maximum Performance of a Team (HARD) — Array, Greedy, Sorting, Heap (Priority Queue)
• Number of Students Unable to Eat Lunch (EASY) — Array, Stack, Queue, Simulation
• Next Greater Element I (EASY) — Array, Hash Table, Stack, Monotonic Stack