Filter interviews by
I applied via Company Website
Thread life cycle includes new, runnable, running, blocked, and terminated states.
Thread is created in 'new' state
It becomes 'runnable' when start() method is called
Thread enters 'running' state when CPU starts executing its run() method
It can go to 'blocked' state if it's waiting for a resource
Finally, thread reaches 'terminated' state when run() method completes or stop() method is called
Hash map is a data structure that stores key-value pairs and uses a hash function to map keys to their corresponding values.
Hash map consists of an array of buckets, each containing a linked list of key-value pairs.
When inserting a key-value pair, the hash function is used to determine the index of the bucket where the pair should be stored.
To retrieve a value, the hash function is used to find the corresponding bucket...
Seeking new challenges, growth opportunities, and a better work-life balance.
Looking for new challenges and opportunities to learn and grow
Seeking a better work-life balance
Interested in working with new technologies or in a different industry
Wanting to advance career progression
Top trending discussions
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
posted on 10 Dec 2020
I applied via Campus Placement and was interviewed before Sep 2020. There were 5 interview rounds.
I appeared for an interview before Mar 2024, where I was asked the following questions.
I applied via Campus Placement and was interviewed in Aug 2022. There were 5 interview rounds.
Apt and coding. Stack based dsa question
Same as r1. Dsa and core subs and projects
posted on 23 Oct 2024
I applied via Campus Placement and was interviewed before Oct 2023. There was 1 interview round.
based on 1 interview
Interview experience
Analyst
38
salaries
| ₹8.7 L/yr - ₹24.7 L/yr |
Associate
34
salaries
| ₹17.8 L/yr - ₹42 L/yr |
Senior Analyst
19
salaries
| ₹5.5 L/yr - ₹18.8 L/yr |
Assistant Manager
11
salaries
| ₹9 L/yr - ₹17.5 L/yr |
Financial Analyst
11
salaries
| ₹3.5 L/yr - ₹6 L/yr |
Wells Fargo
JPMorgan Chase & Co.
Citicorp
American Express