Filter interviews by
Clear (1)
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
I applied via Referral and was interviewed before May 2023. There were 3 interview rounds.
2 Codes on Hackerrank
I applied via Campus Placement and was interviewed in Jun 2022. There were 5 interview rounds.
50 mcq were asked in 12 mins. Most of the candidates qualified this round.
3 coding questions of basic DSA were asked. Also few mcqs from Operating System, Networking and DBMS.
I applied via Naukri.com and was interviewed before Oct 2022. There were 4 interview rounds.
15 minutes test.
50 questions
easy questions
Management , Leadership , Character Type questions
2 coding questions
resume grilling
easy medium questions
I applied via Referral and was interviewed before Feb 2023. There were 2 interview rounds.
45 mins, Basic aptitude , comprehension and decision making questions
posted on 10 Jan 2025
MVVM was asked and swift questions
I applied via LinkedIn and was interviewed in Nov 2019. There was 1 interview round.
posted on 20 Oct 2021
I applied via Referral and was interviewed before Oct 2020. There was 1 interview round.
I applied via Referral and was interviewed in Mar 2021. There were 3 interview rounds.
based on 1 interview
Interview experience
Software Engineer
30
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Scientist
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer experience Officer
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Product Manager
15
salaries
| ₹0 L/yr - ₹0 L/yr |
LazyPay
ZestMoney
EarlySalary Services
MoneyTap