Filter interviews by
I applied via Referral and was interviewed before May 2023. There were 3 interview rounds.
Prototyping in JavaScript allows for quick and easy creation of new objects and functions.
Prototyping allows for inheritance and sharing of properties and methods.
New objects can be created using the 'new' keyword and the prototype of an existing object.
Functions can also be prototyped to add new methods or properties.
Example: function Person(name) { this.name = name; } Person.prototype.greet = function() { console.log...
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 have a strong background in software engineering and a passion for innovation, making me a valuable asset to HSBC.
I have a proven track record of successfully delivering high-quality software solutions in previous roles.
I am highly skilled in various programming languages and technologies, including Java, Python, and SQL.
I have experience working in agile development environments, allowing me to adapt quickly to chan...
I applied via Campus Placement and was interviewed before Nov 2021. There were 3 interview rounds.
Moderate level aptitude with basics
Moderate level data structure questions
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.
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 in Nov 2023. There were 3 interview rounds.
It had 3 questions, the level was medium hardish
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Engineer
5
salaries
| ₹0.9 L/yr - ₹1.8 L/yr |
Web Designer
5
salaries
| ₹2.8 L/yr - ₹3 L/yr |
Software Developer
4
salaries
| ₹2 L/yr - ₹4.5 L/yr |
PHP Developer
4
salaries
| ₹1.1 L/yr - ₹1.5 L/yr |
Network Engineer
4
salaries
| ₹3.6 L/yr - ₹6 L/yr |
HSBC Group
Cholamandalam Investment & Finance
Citicorp
BNY