AU Small Finance Bank Technical Analyst 2 Interview Questions and Answers

Q1. About technical Valuation Questions
Add your answer
Q2. Rules and regulations
Add your answer

Q1. ITRS related questions?
Add your answer

Java,react,ansible,springboot

Q1. Java,react,springboot,microservices
Add your answer
Q2. React question they assked me
Add your answer

Q1. Self Introduction
Add your answer
Q2. Programming language & DBMS theory
Add your answer
Q3. A coding questions
Add your answer
Q4. Any other offers in hand?
Add your answer
Q5. Why do you want to join this company?
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

MySql query questions
2 coding questions 
oops questions 
Networking questions

Q1. Sum of Two Elements Equals the Third.
You are given an array Arr consisting of n integers, you need to find a valid triplet as explained below.
An array is said to have a valid triplet {arr[i], arr[j], ...read more
Ans. Brute Force
• The most trivial approach would be to find any triplet in the array such that two of it’s elements sums up to the third element.
• We can find the answer using three nested loops for three different indexes and check if the values at those indexes can yield the required triplet.
• If for distinct indices we find the required triplet, return the answer list containing the three elements in it.
• If after iterating all...read more
Answered by CodingNinjas
Add your answer
Q2. First Missing Positive
You are given an array 'ARR' of integers of length N. Your task is to find the first missing positive integer in linear time and constant space. In other words, find the lowe...read more
Ans. Searching
1. Since we are given an integer ‘N’, there could be a maximum of ‘N’ positive integers in the array.
2. The minimum positive number is 1, hence we can search from 1 to N in the array.
3. Run a loop from 1 to N, and search for each element in the array.
4. If the element is present in the array then search for the next element.
5. If it is not present then, the element is the answer.
6. Otherwise, if all the elements between 1 to N ...read more
Answered by CodingNinjas
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Starting with tell me about yourself
Struggling with many SQL queries
And OOPS questions
And project based questions

Q1. Technical Questions
What is Semaphore
How to get queries
Add your answer
Q2. Reverse String Word Wise
Reverse the given string word-wise. The last word in the given string should come at 1st place, the last-second word at 2nd place, and so on. Individual words should remain as it i...read more
Ans. Two Pointers approach
• We first split the input string on the basis of spaces and store it in another array of words.
• We then initialize two pointers i and j with initial values 0 and length of words - 1.
• Now we proceed like palindrome reversal.
  • We iterate while i < j
  • swap words[i] and words[j].
  • increment i and decrement j.
• Finally, we concatenate this array of words using spaces again and return the output.
Space Complexity...read more
Answered by CodingNinjas
Add your answer