Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed before Sep 2023. There were 3 interview rounds.
SQL questions are asked and English scenario based questions where you should have a bit of banking knowledge.
Top trending discussions
I applied via Approached by Company and was interviewed before Jul 2021. There was 1 interview round.
To write a REST API from scratch, I would follow these steps:
Define the resources and endpoints
Choose a programming language and framework
Implement CRUD operations for each resource
Use HTTP methods and status codes correctly
Add authentication and authorization
Test the API using tools like Postman
Document the API using tools like Swagger
I applied via Naukri.com and was interviewed in Apr 2021. There were 3 interview rounds.
I applied via Recruitment Consultant and was interviewed before Jan 2020. There were 4 interview rounds.
I appeared for an interview before Jun 2016.
A bond is a debt security that represents a loan made by an investor to a borrower.
Bonds are issued by governments, municipalities, and corporations.
They are used to raise capital and finance projects.
Different types of bonds include government bonds, corporate bonds, municipal bonds, and convertible bonds.
Government bonds are issued by national governments and are considered low-risk.
Corporate bonds are issued by comp...
My specialisation subjects in BBA include marketing, finance, human resource management, and operations management.
Marketing involves understanding consumer behavior and creating strategies to promote products or services.
Finance focuses on managing funds, investments, and financial planning.
Human resource management deals with recruiting, training, and managing employees.
Operations management involves overseeing produ...
My favorite subject is history because I enjoy learning about past events and how they have shaped the world we live in today.
I find studying different time periods and cultures fascinating
I enjoy analyzing historical documents and artifacts
I like understanding how historical events have influenced current societies and politics
Yes, I am comfortable with night shifts as I have prior experience working in night shifts.
I have previous experience working night shifts in my previous job.
I am able to adjust my sleep schedule to accommodate night shifts.
I understand the importance of being alert and focused during night shifts.
I am willing to work night shifts if required for the role.
My hobbies include hiking, painting, and playing the guitar.
Hiking: I enjoy exploring nature trails and challenging myself physically.
Painting: I find relaxation and creativity in expressing myself through art.
Playing the guitar: I love learning new songs and improving my musical skills.
My parents work in education and my siblings work in finance and healthcare.
Parents work in education
Siblings work in finance and healthcare
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
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Senior Associate
162
salaries
| ₹4.9 L/yr - ₹18.8 L/yr |
Associate
134
salaries
| ₹4 L/yr - ₹11.2 L/yr |
Delivery Lead
115
salaries
| ₹6.8 L/yr - ₹20.3 L/yr |
Assistant Director
70
salaries
| ₹18 L/yr - ₹46 L/yr |
Delivery Manager
59
salaries
| ₹11 L/yr - ₹28 L/yr |
S&P Global
Fitch Ratings
Dun & Bradstreet
Morningstar