Yes Bank DOT NET Developer Interview Questions and Answers

Joins, Jobs, stored procedures,cursors.

Q1. What is my package
Add your answer

Simple algorithm question about sorting

Q1. Algorith question about quick sort
Add your answer
Q2. Nlonn run time of the sort
Ans. 
The time complexity of the quicksort algorithm is O(n log n).
• Quicksort has an average time complexity of O(n log n).

• The best case time complexity of quicksort is O(n log n) when the pivot element divides the array into two equal halves.

• The worst case time complexity of quicksort is O(n^2) when the pivot element is the smallest or largest element in the array.
Answered by AI
Add your answer

Basic data structure related coding questions like creating a linked list and adding items to it median.
Max heap implementation.
Concurrency related questions.

Q1. Senior developer was taking the round, covering all design and architecture related questions. I was able to give a satisfactory solution.
Add your answer

Q1. Just some behavioural question along with a lil bit technical questions. Asked me about my current projects and problems faced, how i gave a proper solution and how i help my team to grow.
Add your answer

It had more than 30 aptitude questions and 2 coding questions

Q1. It was totally a tech round all questions were from Data structure, dbms, java, computer networking
Add your answer

1)Buy and sell stock
2)2 sum
3) system design
4) Elastic search
5) deployment

Ms office,Core Java , Tally , C,

In my Opinion,view , If you ask me, As far as I can see/I am Concerned , It seems to me that , I think /feel/reckon/ belive , If you want my option , What we have to decide

Topic wt is ms office

Eassys dscover the basic structure of all essaysand see what a goo d essay introduction and conclusion look like

Q1. Ppt presentations and techical skillsare the abilities and knowledge needed to performtastks
Add your answer

Q1. Oops, basic ,SQL ,ado
Add your answer

Curd operation with SQL connectivity

Q1. LRU cache design
Ans. 
LRU cache design involves maintaining a cache with limited capacity and removing the least recently used item when the cache is full.
• Use a doubly linked list to maintain the order of items based on their usage.

• Implement a hash map for fast access to items in the cache.

• When a new item is accessed, move it to the front of the linked list to mark it as the most recently used.

• When the cache is full, remove the item at the ...read more
Answered by AI
Add your answer
Q2. Current project
Add your answer