Filter interviews by
Clear (1)
I applied via LinkedIn and was interviewed in Sep 2024. There were 3 interview rounds.
It was not that hard actually.
It was not that hard actually
I applied via Campus Placement and was interviewed in Jul 2023. There were 2 interview rounds.
Aptitude and 2 coding questions
I applied via Referral and was interviewed before Mar 2023. There were 3 interview rounds.
All about simple coding, mcqs and a bit og apti
General discussion on people process tech an dproduct
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.
I applied via Naukri.com and was interviewed in Jul 2024. There was 1 interview round.
Arrow functions are more concise and have a lexical 'this' binding compared to normal functions.
Arrow functions do not have their own 'this' keyword, they inherit it from the parent scope.
Arrow functions do not have their own 'arguments' object.
Arrow functions cannot be used as constructors with 'new'.
Arrow functions are more concise and have implicit return when no curly braces are used.
forEach is used to iterate over an array and perform a function on each element, while map creates a new array by applying a function to each element.
forEach does not return a new array, while map does
forEach does not modify the original array, while map creates a new array
forEach is used for side effects, while map is used for transformation
Example: forEach - array.forEach(item => console.log(item)), map - const newAr
Data Structures and Algorithms
Data Structures and Algorithms
I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.
Easy 10 -12 coding based mcq type questions. 1 question had to write code
based on 3 interviews
Interview experience
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