i
Furlenco
Filter interviews by
To delete the nth node from the end in a linked list, we can use a two-pointer approach.
Use two pointers, one to traverse the list and another to keep track of the nth node from the end.
Move the second pointer n steps ahead of the first pointer.
When the second pointer reaches the end of the list, the first pointer will be at the nth node from the end.
Adjust the pointers to delete the nth node.
I applied via Company Website and was interviewed in Apr 2021. There were 3 interview rounds.
I appeared for an interview before Mar 2024, where I was asked the following questions.
Leecode medium level question
Leetcode Hard level Question
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 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.
I applied via Company Website and was interviewed before Oct 2023. There was 1 interview round.
Increasing triple subsequence, rest is easy hashmap
I applied via LinkedIn and was interviewed before Mar 2023. There were 3 interview rounds.
DSA medium leetcode questions - easy to solve
DSA medium 2 questions and core questions 1.5 hrs
I prioritize tasks, communicate with stakeholders, and adjust resources as needed to meet deadlines.
Prioritize tasks based on importance and urgency
Regularly communicate with stakeholders to provide updates and address any issues that may impact deadlines
Adjust resources or seek help from team members if necessary to meet deadlines
based on 1 interview
Interview experience
based on 4 reviews
Rating in categories
Assistant Manager
49
salaries
| ₹4.2 L/yr - ₹9.5 L/yr |
Senior Executive
45
salaries
| ₹3 L/yr - ₹5.5 L/yr |
Software Engineer
22
salaries
| ₹9 L/yr - ₹25 L/yr |
Senior Software Engineer
20
salaries
| ₹18 L/yr - ₹30 L/yr |
Warehouse Executive
20
salaries
| ₹3.1 L/yr - ₹4.7 L/yr |
MagicPin
Awign Enterprises
Nestaway
Ketto