Flipkart SDE 2 | PSDS round

flipkart logo
flipkart
SDE 2
June 5, 20255 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.

Full Experience

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.

Interview Questions (2)

Q1
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.

Q2
Zigzag Conversion
Data Structures & Algorithms
Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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