flipkart logo
Flipkart· SDE 2

Flipkart SDE 2 | PSDS round

Posted
5 Jun 2025
363 reads

Summary

I interviewed for the SDE 2 role at Flipkart and was rejected. During the interview, I was asked two coding questions, including finding the lexicographically smallest path in a tree and the LeetCode Zigzag Conversion problem.

How it went

Question based on tree in which we have to return the lexicographically smallest path from leaf to root node

another question- https://leetcode.com/problems/zigzag-conversion/description/

Able to solve both the problem, but in first question i took lots of hint to solve it in optimal ways.

verdict-rejected.

Questions asked (2)

  1. 01

    Lexicographically Smallest Path from Leaf to Root in Tree

    Data Structures & Algorithms

    Given a tree, return the lexicographically smallest path from a leaf node to the root node.

  2. 02

    Zigzag Conversion

    Data Structures & Algorithms

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Flipkart recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!