Filter interviews by
The lowest common ancestor can be used to find the parent.
The lowest common ancestor is the node that is the closest common ancestor of two nodes in a tree.
To find the parent, you can traverse the tree from the lowest common ancestor to the root node.
This is useful in scenarios where you need to find the parent of a node in a tree data structure.
1 hr duration with 2 medium level leet code question
Top trending discussions
posted on 7 Aug 2024
I applied via Referral and was interviewed in Feb 2024. There was 1 interview round.
I applied via Referral and was interviewed before Oct 2022. There were 3 interview rounds.
50 questions in 12mins
Interview experience
Software Engineer
30
salaries
| ₹13 L/yr - ₹28 L/yr |
Senior Software Engineer
27
salaries
| ₹18 L/yr - ₹46.2 L/yr |
Data Scientist
16
salaries
| ₹10 L/yr - ₹27 L/yr |
Product Manager
15
salaries
| ₹31 L/yr - ₹47 L/yr |
Senior Product Manager
15
salaries
| ₹39 L/yr - ₹62.7 L/yr |
LazyPay
ZestMoney
EarlySalary Services
MoneyTap