🛒 Flipkart Interview Questions – Real Experiences from 2025

Implement a complete billing solution handling discounts, loyalty points, and billing logic. The interview format involved 1.5 hours for understanding and coding on Day 1, followed by a 30-minute evaluation on Day 2 focusing on design choices like modularity and class responsibilities.

Given a list of integers, determine the smallest non-negative integer that is not present in the list. The discussion focused on finding the optimal solution, with implementation being optional.

Identify the rightmost leaf node situated at the lowest level within a complete binary tree. The problem also involved discussing how to generalize this approach for arbitrary tree structures.

Given a list of words, return a map where each key is a word from the list that can be formed by concatenating other words from the same list. For example, if 'sunrise' is in the list, its value might be ['su','n','rise'] or ['sun','rise'].

Merge two given linked lists into a single sorted list.

Using backtracking or Depth-First Search (DFS), print a path from the top-left corner to the bottom-right corner of a given grid, where movement is allowed in all four directions (up, down, left, right).

Given a matrix, find the path from the top-left cell to the bottom-right cell that yields the minimum sum of values along the path. Movement is restricted to only 'down' or 'right' directions. This is a classic dynamic programming problem.

Merge k given sorted linked lists into a single sorted linked list. The task emphasizes using an efficient divide-and-conquer approach, such as pairwise merging.

Given a continuous stream of characters, after each new character is inserted, output the first non-repeating character encountered in the stream so far. If no non-repeating character exists at any point, append '#' to the result string. This problem is typically solved using a combination of a queue and a hash map.

Implement a WordDictionary class that supports two primary operations: addWord(word) to add a word to the dictionary, and search(word) to search for a word. The search method should handle wildcard characters, where '.' can match any single letter. The challenge lies in efficiently handling these wildcard searches.

Find the subtree within a given binary tree whose nodes sum up to the maximum possible value, and return this maximum sum. This problem typically requires a post-order traversal and careful tracking of subtree sums.