Software Development Engineer 2
Binary Tree Zigzag Level Order Traversal
Given the root of a binary tree, return the zigzag level order traversal of its nodes' values (i.e., from left to right, then right to left for the next level and alternate between). (LeetCode 103)
This question was asked in
Flipkart Software Development Engineer 2 Interview Experience
The Flipkart interview process comprised five rigorous rounds spanning an Online Assessment, on-site Machine Coding, Low-Level Design review, Data Structures & Algorithms, and a System Design combined with a Hiring Manager round. Across these rounds, the evaluation covered algorithmic problem solving including Trie and Graph topics, an end-to-end in-memory Buy Now Pay Later design, deep dive into microservices patterns, and behavioral competencies. The overall difficulty was medium to hard, reflecting a thorough assessment of practical coding, design architecture, and problem-solving skills.