Filter interviews by
I applied via LinkedIn and was interviewed before Mar 2023. There were 2 interview rounds.
LRU Cache and Basic String question.
Top trending discussions
I applied via Company Website and was interviewed in Aug 2023. There were 3 interview rounds.
General reasoning and Mathmatics Aptitude
I applied via Recruitment Consulltant and was interviewed in May 2022. There were 2 interview rounds.
Types of data include numerical, categorical, ordinal, and binary.
Numerical data includes continuous and discrete values, such as height and age.
Categorical data includes non-numeric values, such as colors and types of fruit.
Ordinal data includes values with a specific order, such as rankings and ratings.
Binary data includes only two possible values, such as true/false and yes/no.
I applied via Approached by Company and was interviewed in Mar 2022. There were 3 interview rounds.
The assessment will include fundamental quantitative mathematics, a few output-based questions, query questions, and two coding questions.
You can print the output by adding 1 to the given input number and displaying the result.
Create a variable to store the input number.
Add 1 to the input number.
Print the result of the addition.
I applied via Referral
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
I applied via Other and was interviewed in Sep 2018. There were 3 interview rounds.
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
Questions on graph, arrays, strings.
based on 1 interview
Interview experience
Software Engineer
31
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Product Manager
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Engineering Manager
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Strategic Account Manager
6
salaries
| ₹0 L/yr - ₹0 L/yr |
MakeMyTrip
Yatra
Cleartrip
Oyo Rooms