Filter interviews by
Top trending discussions
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
Computer Fundamentals
Flatten a binary tree by converting it into a linked list in-place.
Use a recursive approach to flatten the binary tree.
Traverse the tree in a pre-order manner and keep track of the previous node.
Set the left child of each node to null and the right child to the next node in the linked list.
Example: Input: 1 -> 2 -> 5 -> 3 -> 4 -> null, Output: 1 -> null -> 2 -> null -> 3 -> null -> 4 -> null -> 5 -> null
I applied via LinkedIn and was interviewed before Feb 2023. There were 2 interview rounds.
- simple basic ios questions
I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.
Kadance algorithm and find the middle of the linklist
More on java and Python based coding questions
Leecode medium level question
Leetcode Hard level Question
I applied via Internshala and was interviewed in Dec 2023. There were 2 interview rounds.
Easy to medium, can solve with leetcode medium
I appeared for an interview before Sep 2023.
I applied via Company Website and was interviewed in Apr 2021. There were 3 interview rounds.
based on 1 interview experience
HUB Supervisor
44
salaries
| ₹1.8 L/yr - ₹4.2 L/yr |
Business Analyst
14
salaries
| ₹7 L/yr - ₹12 L/yr |
Sales Executive
13
salaries
| ₹3.2 L/yr - ₹4.1 L/yr |
HUB Manager
12
salaries
| ₹3.6 L/yr - ₹6 L/yr |
Operations Executive
12
salaries
| ₹2.7 L/yr - ₹4 L/yr |
Zoomcar
MagicPin
Awign Enterprises
Nestaway