Filter interviews by
I was interviewed in Dec 2016.
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 campus placement at National Institute of Technology,(NIT), Delhi 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
I applied via Company Website and was interviewed in Oct 2024. There were 2 interview rounds.
1 hour duration. Sliding window problem. On hacker rank platform. Expected to write a working code and solve it optimally/scalable solution.
posted on 27 May 2022
I applied via Company Website and was interviewed in Apr 2022. There were 6 interview rounds.
Naaptol
Naaptol
Naaptol
Study ing information
I applied via campus placement at Indian Institute of Technology (IIT), Roorkee and was interviewed before Sep 2020. There was 1 interview round.
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 Approached by Company and was interviewed in Jul 2024. There was 1 interview round.
It was a 1 hour Technical screening round, coding question in java (you cna choose your own language). They asked a difficult version of regex matching question (Leetcode medium-hard).
I applied via Internshala and was interviewed in Dec 2023. There were 2 interview rounds.
Easy to medium, can solve with leetcode medium
Count the number of islands in a grid of '1's and '0's
Iterate through the grid and for each '1' encountered, perform a depth-first search to mark all connected '1's as visited
Increment the island count for each new island found
Ensure to handle boundary cases and check for visited nodes
Find the first and last index of a specific element in an array of strings.
Iterate through the array and keep track of the index of the first and last occurrence of the element.
Return the first and last index once the iteration is complete.
Example: Array ['apple', 'banana', 'apple', 'orange'], element 'apple' - First index: 0, Last index: 2.
Territory Sales Manager
171
salaries
| ₹3.8 L/yr - ₹9 L/yr |
Area Operation Manager
55
salaries
| ₹4.1 L/yr - ₹9.7 L/yr |
Territory Sales Leader
25
salaries
| ₹6.1 L/yr - ₹12.7 L/yr |
Assistant Manager
19
salaries
| ₹4.5 L/yr - ₹8.8 L/yr |
Senior Executive
19
salaries
| ₹2.8 L/yr - ₹6 L/yr |
Oyo Rooms
FabHotels
Goibibo
MakeMyTrip