Flipkart coding interviews evaluate a candidate's problem-solving skills, Data Structures & Algorithms (DSA), and coding efficiency through real-world programming challenges. This sheet provides a topic-wise collection of the most frequently asked Flipkart coding interview questions.
- Covers Flipkart coding questions organized by topics such as Arrays, Strings, Linked Lists, Trees, Graphs, Dynamic Programming, and more.
- Includes optimized solutions with detailed explanations to strengthen coding skills and interview preparation.
Arrays
- Chocolate Distribution Problem
- Count Inversions in an Array (Using Merge Sort)
- K-th Element of Two Sorted Arrays
- Search an element in a sorted and rotated array
- Stock Buy Sell to Maximize Profit
- Largest Sum Contiguous Subarray
- Sliding Window Maximum
- Product of Array Except Self
- Subarray with Given Sum
- Merge Overlapping Intervals
- Find the Smallest Positive Missing Number
- Maximum Product Subarray
- Find Peak Element
- Move All Zeroes to End
- Pair with Given Product
Strings
- Find the first non-repeating character from a stream
- Multiply Large Numbers represented as Strings
- Print all possible words from phone digits
- Longest Substring Without Repeating Characters
- Longest Palindromic Substring
- Smallest Window Containing All Characters
- Group Anagrams
- Implement String to Integer (atoi)
- Valid Parentheses
- Word Break
- Reverse Words in a String
- Wildcard Pattern Matching
- Check if a String Can Be Obtained by Rotating Another String
Linked List
- Find the Middle of a Linked List
- Add two numbers represented by linked lists | Set 1
- Delete middle of linked list
- Merge two sorted linked lists
- Union and Intersection of two Linked Lists
- Flattening a Linked List
- Clone a Linked List with Random Pointer
- Detect and Remove Loop in a Linked List
- Merge K Sorted Linked Lists
- Reverse Linked List
- Reverse Linked List in Groups
- Intersection of Two Linked Lists
- Nth Node from End of Linked List
Stack & Queue
- Design a stack that supports getMin() in O(1)
- Implement Queue using Stacks
- The Celebrity Problem
- LRU Cache
- Largest Rectangle in Histogram
- Sliding Window Maximum
- Evaluate Reverse Polish Notation
Binary Trees
- Level Order Traversal
- Reverse Level Order Traversal
- Spiral Level Order Traversal
- Maximum Width of Binary Tree
- Print Left View of Binary Tree
- Bottom View of Binary Tree
- Vertical Order Traversal
- Serialize and Deserialize Binary Tree
- Connect Nodes at Same Level
- Evaluation of Expression Tree
Binary Search Tree (BST)
- Print BST Keys in the Given Range
- Check if Binary Tree is BST
- Delete Node in BST
- Inorder Successor
- Kth Smallest Element in BST
- Lowest Common Ancestor in BST
- Merge Two BSTs
- Sorted Array to BST
Graphs
- Breadth First Search (BFS)
- Sum of dependencies in a graph
- Detect cycle in an undirected graph
- Detect Cycle in a Directed Graph
- Topological Sorting
- Snake and Ladder Problem
- Breadth First Traversal or BFS for a Graph
- Depth First Search (DFS)
- Number of Islands
- Flood Fill Algorithm
- Dijkstra's Shortest Path Algorithm
- Prim's Minimum Spanning Tree (MST)
- Kruskal's Minimum Spanning Tree (MST)
- Clone Graph
Dynamic Programming
- Gold Mine Problem
- Count Binary Strings Without Consecutive 1's
- Maximum Number of 'A's Using Four Keys
- 0-1 Knapsack Problem
- Longest Increasing Subsequence (LIS)
- Longest Common Subsequence (LCS)
- Edit Distance
- Matrix Chain Multiplication
- Coin Change (Count Ways to Make Sum)
- Palindrome Partitioning
Greedy Algorithms
- Activity Selection Problem
- Huffman Coding
- Job Sequencing with Deadlines
- Fractional Knapsack Problem
- Minimum Number of Platforms
- Connect N Ropes with Minimum Cost
- Candy Distribution Problem
- Assign Cookies
- Gas Station (Circular Tour / Petrol Pump Problem)
Backtracking
- Rat in a Maze
- Sudoku
- N-Queens Problem
- Permutations of a String / Array
- Combination Sum
- Palindrome Partitioning
- Letter Combinations of a Phone Number
- Combinations (n Choose k)
- M-Coloring Problem