IDFC FIRST Bank Senior Developer Interview Questions and Answers

Q1. Code related quest
Add your answer
Q2. 1 program is given to write
Add your answer

Q1. Scenario based question
Add your answer

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

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

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

Was given a bar raiser round where been asked problems on dp, create a crud shopping cart type webapp in react, and one css problem to align all boxes across diagonal

Mostly around resume and performance optimisation

Q1. Verbally design infinte scroll in react
Ans. 
Implementing infinite scroll in React involves dynamically loading content as the user scrolls down the page.
• Use a scroll event listener to detect when the user reaches the bottom of the page

• Fetch more data from the server and append it to the existing content

• Update the state to reflect the new content and trigger a re-render of the component
Answered by AI
Add your answer
Q2. Flatten array deeply nested
Ans. 
Flatten deeply nested array of strings
• Use recursion to iterate through each element in the array

• Check if each element is an array, if so, recursively call the function

• Concatenate the strings from each nested array into a single flat array
Answered by AI
Add your answer

Joins, Jobs, stored procedures,cursors.

Q1. What is my package
Add your answer