Filter interviews by
Leaves of a tree are the nodes with no children in a tree data structure.
Traverse the tree and identify nodes with no children.
Use depth-first search or breadth-first search algorithms to find leaves.
Examples: In a binary tree, leaves are nodes with no left or right child.
In a general tree, leaves are nodes with no children in their child list.
I completed internships at ABC Company and XYZ Company during my undergraduate studies.
Interned at ABC Company working on web development projects
Interned at XYZ Company assisting with software testing and quality assurance
Gained hands-on experience in coding, debugging, and problem-solving
I applied via Referral and was interviewed in May 2024. There was 1 interview round.
DSA has 2-3 rounds depending on the team that is hiring. coding and algorithms 1 and coding and algorithms 2 and concurrency.
Topics for coding and algorithms are into Tress, Graphs
Concurrency round is all about implementing base modules
I applied via Referral and was interviewed before Oct 2022. There were 4 interview rounds.
1 hour simple questions based on DSA
Solution to performing operations on a large array of bits.
Use bitwise operators to perform operations on individual bits
Use a loop to iterate through the array and perform the operations
Ensure that the array is large enough to accommodate all the bits
Consider using a data structure like a bitset for efficient bit manipulation
Top trending discussions
I appeared for an interview in Oct 2016.
based on 3 interview experiences
Difficulty level
Duration
based on 4 reviews
Rating in categories
Software Engineer
100
salaries
| ₹16.8 L/yr - ₹70 L/yr |
Senior Software Engineer
96
salaries
| ₹41.2 L/yr - ₹67.3 L/yr |
Trust and Safety Specialist
75
salaries
| ₹5.5 L/yr - ₹10.1 L/yr |
Software Developer
67
salaries
| ₹19.7 L/yr - ₹33 L/yr |
Account Director
30
salaries
| ₹15 L/yr - ₹39 L/yr |
Amazon
Flipkart
Udaan
BigBasket