i
Ixigo.com
Filter interviews by
Clear (1)
I applied via LinkedIn and was interviewed before Mar 2023. There were 3 interview rounds.
To find the kth minimum element from a Binary Search Tree (BST)
Perform an in-order traversal of the BST to get elements in sorted order
Return the kth element from the sorted list
Time complexity: O(n) where n is the number of nodes in the BST
To find swapped numbers in a BST, perform inorder traversal and keep track of previous node.
Perform inorder traversal of the BST
Keep track of the previous node while traversing
If at any point, the current node's value is less than the previous node's value, those are the swapped numbers
Top trending discussions
I applied via Job Portal and was interviewed in Jul 2024. There was 1 interview round.
There is a question based on Rest API and another question on Java
I applied via Referral and was interviewed before Mar 2023. There were 2 interview rounds.
It was 1 hour long and was asked to pass all the test cases.
I applied via Campus Placement and was interviewed before Dec 2021. There were 3 interview rounds.
Coding Rond consisted of 3 questions
I applied via Campus Placement and was interviewed in Sep 2022. There were 2 interview rounds.
3 data structure problem with medium to hard level leetcode type.
I applied via Campus Placement and was interviewed before Oct 2023. There was 1 interview round.
Dsa -> questions on trees, linked list, stack, dynamic programming
I applied via Campus Placement and was interviewed before Nov 2023. There were 2 interview rounds.
Leetcode medium to hard
I was interviewed in Oct 2024.
Polyfills,html,css basics,js intermediate level
I applied via Referral and was interviewed before Sep 2022. There were 3 interview rounds.
Programs on Sorting and Search Algorithms and Core Java
I applied via LinkedIn and was interviewed in Mar 2021. There were 3 interview rounds.
Print the rightmost nodes of a binary tree.
Traverse the tree in a depth-first manner, starting from the right child of each node.
Use a queue to keep track of the nodes to be visited.
Add the rightmost node of each level to the result array.
Garbage Collector in C# manages memory allocation and deallocation automatically.
Garbage Collector is responsible for freeing up memory that is no longer in use.
It runs in the background and periodically checks for unused objects.
GC.SuppressFinalize() method can be used to prevent the finalizer from running.
GC.Collect() method can be used to force garbage collection.
GC.GetTotalMemory() method can be used to get the tot
based on 1 interview
Interview experience
based on 4 reviews
Rating in categories
Software Engineer
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
MakeMyTrip
Yatra
Cleartrip
Goibibo