BNY Sdet Engineer Interview Questions and Answers

Q1. OOPS Concepts,Java Coding,Testing
Add your answer

Q1. Selenium, APIs, Automation
Add your answer

2 medium dsa que - one is of binary search, one is from graph

Q1. Define oops principle
Ans. 
OOPs principles are the fundamental concepts of object-oriented programming that help in designing and implementing software solutions.
• Encapsulation: Bundling data and methods that operate on the data into a single unit (class).

• Inheritance: Allowing a class to inherit properties and behavior from another class.

• Polymorphism: The ability of different classes to be treated as instances of a common superclass.

• Abstraction: ...read more
Answered by AI
Add your answer
Q2. Define os concepts
Ans. 
OS concepts refer to fundamental principles and components of operating systems.
• Process management - handling processes, scheduling, and resource allocation

• Memory management - managing memory allocation, virtual memory, and paging

• File system - organizing and accessing files on storage devices

• Device management - controlling and communicating with hardware devices

• Security and protection - ensuring system and data securit...read more
Answered by AI
Add your answer

70mins on java code,and MCQ

On Java programming 40 minutes

Q1. Did not clear 2nd round
Add your answer

Quant and verbal ability

Questions from DSA and webdevelopement

Q1. About my goals with the company and how will I contribute to it.
Add your answer

2 coding question, 1 section of business aptitude and 1 section english.

Q1. Design a chess game.
Ans. 
A classic chess game with standard rules and pieces.
• Create a board with 8x8 squares

• Place 16 pieces on each side: 1 king, 1 queen, 2 rooks, 2 knights, 2 bishops, and 8 pawns

• Define the movement rules for each piece

• Implement special moves like castling and en passant

• Check for checkmate and stalemate conditions

• Allow for player vs player or player vs computer gameplay
Answered by AI
Add your answer
Q2. N queens problem. Minimum steps by knight.
Ans. 
The N Queens problem is to place N chess queens on an NxN board so that no two queens threaten each other. Minimum steps by knight is a variation of this problem.
• The N Queens problem is a classic problem in computer science and can be solved using backtracking.

• The minimum steps by knight variation involves placing N knights on an NxN board so that no two knights threaten each other.

• This problem can also be solved using...read more
Answered by AI
Add your answer

Q1. Hr questions were asked. And location preference.
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

It was a L1 technical round where questions from DS algo were asked, along with my work exp and projects. It was a face to face video round with 2 panel members

Q1. 
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...read more
Add your answer
Q2. How can you prevent the breaking of the singleton pattern using reflections?
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was a System design round and the interviewer was very friendly, he gave ample hints and it was a productive interaction.

Q1. Design an LRU (Least Recently Used) cache.
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

It was a standard manager where I was asked many questions related to my work exp and behavioural questions