Filter interviews by
I applied via Newspaper Ad and was interviewed before Mar 2023. There was 1 interview round.
Online coding round was conducted .
I applied via Campus Placement and was interviewed before Apr 2022. There were 4 interview rounds.
Knapsack Algorithm problem
Designing a scalable system involves considering factors like load balancing, horizontal scaling, and fault tolerance.
Utilize load balancing to distribute traffic evenly across servers.
Implement horizontal scaling by adding more servers to handle increased load.
Ensure fault tolerance by designing for redundancy and failover mechanisms.
Use caching and database sharding to improve performance and scalability.
Consider mic...
Debugging and optimizing code involves identifying and fixing errors and improving performance.
Use debugging tools like breakpoints, print statements, and logging to identify issues
Analyze code for inefficiencies and refactor where necessary
Optimize algorithms and data structures for better performance
Profile code to identify bottlenecks and optimize critical sections
Test changes to ensure they improve performance with
I applied via Recruitment Consultant and was interviewed in Nov 2018. 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 Walk-in
based on 1 interview
Interview experience
Hvac Technician
8
salaries
| ₹4.5 L/yr - ₹6.4 L/yr |
Hvac Design Engineer
5
salaries
| ₹4.8 L/yr - ₹8.4 L/yr |
Electrical Engineer
4
salaries
| ₹3.4 L/yr - ₹10 L/yr |
Hvac Engineer
4
salaries
| ₹5 L/yr - ₹12 L/yr |
Hvac Supervisor
4
salaries
| ₹1 L/yr - ₹9 L/yr |
HSBC Group
Cholamandalam Investment & Finance
Citicorp
BNY