- This phase focused on assessing problem-solving skills and algorithmic proficiency.
- Challenges ranged from medium to hard difficulty levels, with problems like implementing Dijkstra’s algorithm for finding the shortest path in a weighted graph.
- I tackled tasks involving binary trees, including checking if a tree is a binary search tree and finding the kth smallest element.
- A notable problem entailed designing a data structure to efficiently track the median of a continuous stream of numbers.
- The interviewer encouraged discussion on various strategies before coding, emphasizing efficiency and readability.
Flipkart Interview Experience For Software Developer Internship