Filter interviews by
Be the first one to contribute and help others!
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.
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
To find the frequency of each word in a sentence.
Split the sentence into words
Create a dictionary to store word frequency
Iterate through the words and update the dictionary
Return the dictionary
I applied via Campus Placement and was interviewed before Sep 2020. There were 5 interview rounds.
I applied via Naukri.com and was interviewed in Oct 2020. There were 5 interview rounds.
posted on 23 Jul 2023
I applied via Referral and was interviewed in Sep 2022. There were 5 interview rounds.
I applied via Naukri.com and was interviewed before Sep 2022. There were 3 interview rounds.
How would you approach performance issues in an application module
Use programming language to read and process data from Excel file efficiently.
Use a programming language like Python, Java, or C# to read the Excel file.
Utilize libraries like pandas in Python or Apache POI in Java for efficient data processing.
Implement batch processing or parallel processing to handle millions of records efficiently.
Optimize code for memory management and performance to avoid crashes or slowdowns.
Con...
Senior Advisor
50
salaries
| ₹3.3 L/yr - ₹8 L/yr |
Senior Analyst
37
salaries
| ₹7 L/yr - ₹18 L/yr |
Analyst
33
salaries
| ₹4.8 L/yr - ₹16.3 L/yr |
Assistant Manager
14
salaries
| ₹6.8 L/yr - ₹21 L/yr |
Team Lead
13
salaries
| ₹10 L/yr - ₹30 L/yr |
Wells Fargo
JPMorgan Chase & Co.
Citicorp
American Express