Filter interviews by
Clear (1)
I applied via Campus Placement
Questions were asked which were difficult and asked on graphs
To insert a node in a linked list, update pointers of previous and new nodes.
Create a new node with the data to be inserted
Update the next pointer of the new node to point to the next node of the current node
Update the next pointer of the current node to point to the new node
Rate your
company
🤫 100% anonymous
How was your last interview experience?
Top trending discussions
Find an odd occurring number among even occurring numbers.
Use XOR operation to cancel out even occurring numbers and get the odd occurring number.
Iterate through the array and XOR each element with the result variable.
The final result will be the odd occurring number.
Print the spiral order of a binary tree and matrix.
For binary tree, use level order traversal and alternate direction for each level.
For matrix, use four pointers to traverse in spiral order.
Example for binary tree: 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9
Example for matrix: 1 2 3 4 -> 8 7 6 5 -> 9 10 11 12 -> 16 15 14 13
Finding pairs in an array with a given sum.
Iterate through the array and for each element, check if the difference between the given sum and the element exists in the array.
Use a hash table to store the elements of the array and their indices for faster lookup.
If there are multiple pairs with the same sum, return any one of them.
If no pair is found, return null or an empty array.
Find total number of k element with given avg in an array in minimum time complexity.
Use sliding window technique to traverse the array in O(n) time complexity.
Maintain a sum variable to keep track of the sum of elements in the window.
If the sum of elements in the window is equal to k times the given avg, increment the count.
Move the window by subtracting the first element and adding the next element in the array.
Printing non-boundary elements of a binary tree
Traverse the tree in any order (preorder, inorder, postorder)
Check if the current node is not a boundary node (not the first or last node in its level)
If it is not a boundary node, print its value
Recursively traverse its left and right subtrees
I applied via Referral and was interviewed in Sep 2023. There was 1 interview round.
Data Structures and Algorithms
Data Structures and Algorithms
I applied via Campus Placement and was interviewed in Nov 2023. There were 3 interview rounds.
It had 3 questions, the level was medium hardish
Prototyping in JavaScript allows for quick and easy creation of new objects and functions.
Prototyping allows for inheritance and sharing of properties and methods.
New objects can be created using the 'new' keyword and the prototype of an existing object.
Functions can also be prototyped to add new methods or properties.
Example: function Person(name) { this.name = name; } Person.prototype.greet = function() { console.log...
based on 1 interview
Interview experience
Anonymously discuss salaries, work culture, and many more
Get Ambitionbox App
Software Developer
156
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
53
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
50
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Analyst
46
salaries
| ₹0 L/yr - ₹0 L/yr |
Production Analyst
26
salaries
| ₹0 L/yr - ₹0 L/yr |
Thomson Reuters
Bloomberg
FactSet
Morningstar