fynd sde-1 interview experience
- Posted
- 8 Jan 2026
Summary
This is a brief interview experience for an SDE-1 role at Fynd, where I was asked to solve the Balanced Binary Tree problem.
How it went
Questions asked (1)
- 01
Balanced Binary Tree
Data Structures & Algorithms · Easy
Open the problemGiven a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differs by more than one.