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.
The Lowest Common Ancestor (LCA) of a tree is the shared ancestor of two nodes farthest from the root.
Start from the root and traverse the tree to find the paths from the root to the two nodes.
Compare the paths to find the last common node between them, which is the LCA.
If one of the nodes is an ancestor of the other, then the ancestor node is the LCA.
I have worked on projects involving web development, mobile app development, and data analysis.
Developed a web application using React and Node.js for a client in the e-commerce industry
Created a mobile app using Flutter for a startup in the healthcare sector
Performed data analysis on customer behavior using Python and SQL for a marketing company
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
LinkedIn interview questions for designations
I applied via Company Website and was interviewed in Aug 2021. There were 2 interview rounds.
E-commerce
I applied via Job Portal and was interviewed in Jun 2021. There were 3 interview rounds.
Sorts an array of strings in ascending order.
Use a sorting algorithm like bubble sort, selection sort, or merge sort.
Compare adjacent elements and swap them if they are in the wrong order.
Repeat the process until the array is sorted.
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
based on 3 interviews
Interview experience
based on 4 reviews
Rating in categories
Software Engineer
75
salaries
| ₹15 L/yr - ₹63.2 L/yr |
Trust and Safety Specialist
73
salaries
| ₹5.5 L/yr - ₹9 L/yr |
Senior Software Engineer
63
salaries
| ₹29.6 L/yr - ₹91.8 L/yr |
Software Developer
48
salaries
| ₹17.5 L/yr - ₹43 L/yr |
Content Reviewer
37
salaries
| ₹3.6 L/yr - ₹9.9 L/yr |
Amazon
Flipkart
Udaan
BigBasket