Flipkart Software Developer Interview Questions and Answers

Depth-First Search (DFS) is a graph traversal algorithm that explores as far as possible along each branch before backtracking.

• DFS uses a stack data structure, either explicitly or via recursion.

• It starts from a source node and explores as far as possible along each branch.

• Example: In a graph with nodes A, B, C, and edges (A-B, A-C), starting DFS from A visits B then C.

• DFS can be used to find connected components ...read more

Find the Kth largest element in a Binary Search Tree.

• Perform reverse inorder traversal to visit nodes in descending order.

• Keep track of the count of visited nodes to find the Kth largest element.

• Stop traversal once the Kth largest element is found.

Topological sort orders nodes in a directed acyclic graph (DAG) based on dependencies.

• Topological sort is used for scheduling tasks based on dependencies.

• It can be implemented using Depth-First Search (DFS) or Kahn's algorithm.

• Example: For tasks A -> B -> C, the order can be A, B, C.

• A graph must be a Directed Acyclic Graph (DAG) for topological sorting to be possible.

• The result is not unique; multiple valid ...read more

To reverse a doubly linked list, swap the next and previous pointers of each node.

• Start from the head of the list

• Swap the next and previous pointers of each node

• Update the head and tail pointers accordingly

next_permutation function generates the next greater lexicographic permutation of a sequence

• The function modifies the sequence to its next permutation if possible

• If the sequence is already the largest permutation, it rearranges it to the smallest permutation

• The function returns true if a next permutation exists, else false

• The sequence must be sorted in non-descending order before calling the function

Implement LRU cache with put, get, and remove operations.

• LRU stands for Least Recently Used.

• The cache should have a maximum capacity.

• When the cache is full, the least recently used item should be removed.

• When an item is accessed, it should be moved to the front of the cache.

• Use a doubly linked list and a hash map to implement the cache efficiently.