RBL Bank Software Developer Interview Questions and Answers

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

Q1. Java Stream coding questions
Add your answer
Q2. Java Collections
Add your answer
Q3. Spring Boot Annotations
Add your answer
Q4. Sql Queries highest 3 salary employee name
Ans. 
Use SQL query to retrieve the names of the top 3 employees with the highest salary.
• Use the ORDER BY clause to sort the salaries in descending order.

• Use the LIMIT clause to limit the results to the top 3.

• Join the employee table with the salary table to retrieve employee names.
Answered by AI
Add your answer

Q1. Technical questions related to security
Add your answer

Behavioural and culture fit

Q1. Sql, reporting tool, control m , unix, power bi
Add your answer
Q2. Sql, unix, testing tool
Add your answer

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

Joins, Jobs, stored procedures,cursors.

Q1. What is my package
Add your answer