i
BNY
Filter interviews by
Karat interview process
I applied via Campus Placement and was interviewed in Mar 2021. There was 1 interview round.
I applied via Naukri.com and was interviewed in Feb 2021. There were 3 interview rounds.
String builder is faster but not thread-safe, while string buffer is slower but thread-safe.
String builder is mutable and can be modified without creating a new object
String buffer is synchronized and can be used in multi-threaded environments
String builder is preferred for single-threaded environments where performance is critical
String buffer is preferred for multi-threaded environments where thread safety is importa
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 appeared for an interview before Sep 2020.
Round duration - 40 minutes
Round difficulty - Easy
Timing: 12PM
Due to covid, the interviews happened over a video call on Zoom. They also shared an IDE link where we could write our code and the interview could see it.
The interviewer was very polite and helpful. She dropped hints in between to help me reach the final solution when I was stuck or needed some clarity. She wanted to check how analytically I could solve the problem. She focused more on my approaches towards the problem.
There was also a brief discussion on my resume and projects.
Given an N-ary tree where each node has at most 'N' child nodes, the task is to serialize the tree into a sequence of bits and then deserialize it back t...
Serialization and deserialization of an N-ary tree involves converting the tree into a sequence of bits and reconstructing the original tree from this format.
Serialize the N-ary tree by traversing it in level order and representing each node and its children using a space-separated sequence of integers.
Deserialize the serialized tree by parsing the input sequence and reconstructing the tree structure based on the provi...
Round duration - 40 minutes
Round difficulty - Medium
Timing: Mid-afternoon
Due to covid, the interviews happened over a video call on Zoom. They also shared an IDE link where we could write our code and the interview could see it.
The interviewer was very polite and helpful. He dropped hints in between to help me reach the final solution when I was stuck or needed some clarity. He wanted to check how analytically I could solve the problem. He focused more on my approaches towards the problem.
There was also a brief discussion on my resume and projects.
Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:
1. INSERT(key, value): Add or update t...
Design a constant time data structure for key-value mappings with operations like INSERT, DELETE, SEARCH, GET, GET_SIZE, and IS_EMPTY.
Use a hash table to achieve constant time complexity for operations.
Implement INSERT, DELETE, SEARCH, GET, GET_SIZE, and IS_EMPTY functions.
Ensure key is a string and value is a positive integer.
Return appropriate results based on the operation type.
Handle edge cases like key not found o
Round duration - 30 Minutes
Round difficulty - Medium
Timing: Evening
Due to covid, the interviews happened over a video call on Zoom. They also shared an IDE link where we could write our code and the interview could see it.
There was a panel of three people as interviewers in this round.
I was also asked one behaviour questions in this round.
You are provided with a directory path in Unix-style notation, and your task is to simplify it according to given rules.
In a Unix-style file system:
Given a Unix-style directory path, simplify it by following certain rules and return the simplified path.
Use a stack to keep track of directories while iterating through the input path.
Handle cases for '.', '..', and multiple slashes appropriately.
Return the simplified path by joining the directories in the stack with '/' separator.
Tip 1 : Focus on Data Structures and Algorithms. Practising questions based on them every day is the key to succeeding. You can enroll into a Data Structures and Algorithms course by Coding Ninjas. This course helped me build a strong foundation in these topics. I also recommend platforms like LeetCode and InterviewBit for further practice.
Tip 2 : During your interview THINK OUT LOUD!!! It is very important that you voice your approach towards the problem otherwise interviewer will have no clue what you are thinking.
Tip 3 : Do give mock interviews to some college senior or mentor. They help you understand how to express your thought process better (Think out loud) and also reduce the interview stress and anxiety.
Tip 1 : In order to make a strong resume you must include at least 2-3 Projects and an intern/work experience. Mention all your skills which you are confident of in your resume.
Tip 2 : Try to make it of one page only. You can use overleaf to make your resume.
I applied via Recruitment Consultant and was interviewed in Oct 2020. There were 4 interview rounds.
posted on 23 Oct 2024
I applied via Campus Placement and was interviewed before Oct 2023. There was 1 interview round.
Aptitude was quantitative and it was bit tough and it is online exam
based on 2 interviews
Interview experience
based on 1 review
Rating in categories
Analyst
1.9k
salaries
| ₹2 L/yr - ₹10 L/yr |
Senior Analyst
1.8k
salaries
| ₹4 L/yr - ₹15 L/yr |
Senior Associate
1.3k
salaries
| ₹11.8 L/yr - ₹25 L/yr |
Intermediate Representative
1.1k
salaries
| ₹2.9 L/yr - ₹7.5 L/yr |
Vice President
1k
salaries
| ₹15.9 L/yr - ₹52 L/yr |
State Street Corporation
Northern Trust
HSBC Group
JPMorgan Chase & Co.