Filter interviews by
Test has three questions
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development
Strong problem-solving skills
Team player with excellent communication skills
I have a strong technical background, a passion for software development, and a proven track record of delivering high-quality projects.
Strong technical skills in programming languages such as Java, Python, and C++
Experience with software development projects, including creating web applications and mobile apps
Proven ability to work well in a team and communicate effectively with stakeholders
Passion for learning and st...
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 Company Website and was interviewed in Feb 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before Jul 2020. There were 4 interview rounds.
I applied via Referral and was interviewed in Sep 2023. There was 1 interview round.
posted on 28 Aug 2024
75 min test with 18 Java theory questions
The synchronized keyword in Java is used to control access to shared resources in a multithreaded environment.
Synchronized keyword can be used to synchronize access to critical sections of code to prevent race conditions.
It can be applied to methods or code blocks to ensure only one thread can access them at a time.
Example: synchronized void myMethod() { // code }
Example: synchronized(this) { // code }
based on 1 interview
Interview experience
Senior Associate
477
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate
467
salaries
| ₹0 L/yr - ₹0 L/yr |
Vice President
224
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
216
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
64
salaries
| ₹0 L/yr - ₹0 L/yr |
S&P Global
Moody's
Thomson Reuters
Bloomberg