Filter interviews by
I applied via Referral and was interviewed before Dec 2021. There were 5 interview rounds.
Mcq test java, xpath, selenium, sql by hackers rank.. Later saw it is happened to everyone.. My case it was happened.. 2020 nov
Top trending discussions
I applied via LinkedIn and was interviewed in Feb 2021. There was 1 interview round.
I applied via Recruitment Consultant and was interviewed in Oct 2020. There were 4 interview rounds.
I applied via Recruitment Consulltant and was interviewed before Mar 2021. There was 1 interview round.
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 Naukri.com and was interviewed before Apr 2020. There were 3 interview rounds.
SCD Type 2 is a technique used to track historical changes in data over time in a data warehouse.
SCD Type 2 maintains a separate row for each change in data, with a start and end date.
It requires a surrogate key to uniquely identify each row.
Informatica provides a built-in SCD Type 2 transformation to implement this technique.
Example: tracking changes in customer addresses over time.
I applied via LinkedIn and was interviewed before Aug 2020. There were 3 interview rounds.
based on 3 reviews
Rating in categories
Senior Software Engineer
491
salaries
| ₹9.7 L/yr - ₹31 L/yr |
Software Engineer
288
salaries
| ₹7 L/yr - ₹22.4 L/yr |
Lead Software Engineer
106
salaries
| ₹18 L/yr - ₹39 L/yr |
Senior Associate Software Engineer
105
salaries
| ₹11 L/yr - ₹25 L/yr |
Senior Test Analyst
84
salaries
| ₹8.7 L/yr - ₹26.6 L/yr |
Wells Fargo
JPMorgan Chase & Co.
Citicorp
American Express