Airtel Payments Bank Software Developer Interview Questions and Answers

Q1. About yourself and background only
Add your answer

2 coding questions .array or string helpful

Round duration - 90 minutes
Round difficulty - Medium

Q1. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
The task is to determine if a given singly linked list forms a cycle or not.
• A cycle occurs when a node's next points back to a previous node in the list.

• To solve this problem, we can use the Floyd's Cycle-Finding Algorithm.

• The algorithm uses two pointers, one moving at a normal pace and the other moving twice as fast.

• If there is a cycle, the fast pointer will eventually catch up to the slow pointer.

• If the fast pointer ...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Q1. 
Minimum Depth of a Binary Tree
Determine the minimum depth of an integer-based binary tree. The minimum depth is defined as the number of nodes present along the shortest path from the root node down to t...read more
Ans. 
The minimum depth of a binary tree is the number of nodes along the shortest path from the root node down to the nearest leaf node.
• The minimum depth can be found by performing a breadth-first search (BFS) traversal of the binary tree

• During the BFS traversal, keep track of the current level and increment the depth by 1 for each level

• Stop the BFS traversal when a leaf node is encountered and return the depth as the minim
Answered by AI
Add your answer
Q2. 
Intersection of Two Arrays Problem Statement
Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...read more
Ans. 
The problem is to find the intersection of two sorted arrays.
• Use two pointers to iterate through the arrays.

• Compare the elements at the current pointers and move the pointers accordingly.

• If the elements are equal, add it to the intersection array and move both pointers.

• If the element in the first array is smaller, move the first pointer.

• If the element in the second array is smaller, move the second pointer.

• Repeat until...read more
Answered by AI
Add your answer
Q3. What is the difference between a mutex and a semaphore?
Ans. 
A mutex is a binary semaphore used for mutual exclusion, while a semaphore is a generalized synchronization primitive.
• Mutex is used to protect a critical section of code, allowing only one thread to access it at a time.

• Semaphore is used to control access to a shared resource, allowing multiple threads to access it simultaneously.

• Mutex has ownership, meaning the thread that locks it must unlock it.

• Semaphore does not hav...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Round duration - 25 minutes
Round difficulty - Easy

Duration: 1Hour 30 Minutes, 2 Coding Questions of Total 175 Marks. 1st Question has 75 marks and 2nd Question has 100 marks.

Q1. 1. Find the smallestMissingNumber in given array using Bitwise OR operation alone 2. Based on Array data Manipulation.
Ans. 
Using Bitwise OR operation to find the smallest missing number in an array.
• Iterate through the array and perform Bitwise OR operation with each element to set corresponding bit in a bitmask

• Iterate through the bitmask to find the first unset bit, which represents the smallest missing number

• Example: Array [0, 1, 3, 4, 6] would have a bitmask of 10101, smallest missing number is 2
Answered by AI
Add your answer
Q2. Q2: Customized Data Extraction From Given Dynamic Array & Perform Some Math Operations On the Extracted Data
Add your answer

Q1. Write a Pseudo code for given scenario?
Ans. 
Pseudo code for a scenario
• Define variables and data structures needed

• Write the main logic using conditional statements and loops

• Handle edge cases and error conditions

• Test the pseudo code with sample inputs
Answered by AI
Add your answer

Q1. System Design & Design Pattern based questions
Add your answer

Q1. Not Applicable (Yet to be scheduled)
Add your answer

Q1. C programming and its basic question like memory segments, compilation stages, structure and semaphore. Single linked list implementation.
Add your answer

Q1. There were two managers in this interview. Asked about my roles and responsibilities in current project and gave some scenario in C programming to solve. Questions on embedded systems like process, thread...read more
Add your answer

Q1. Salary discussion
Add your answer

4 Coding Questions Leetcode Level Medium to Hard. Had to solve it within 1.5 hours.

Was able to solve 2 questions - One hard and one Medium. Hadn't enough time to solve all.

Q1. DSA based round. Was asked to write 3 APIs based on the the given n-ary tree.
Add your answer
Q2. Questions based on Path, end node, best path, etc.
Add your answer

Q1. System Design round : Was asked to design RDBMS for the given problem.
Add your answer

Q1. HM Round : Mostly behavioral based around Twilio Magic Values
Add your answer

Q1. Bar Raiser Round : Taken by a director. Was asked behavioral questions again.
Add your answer

Q1. Word formation Algorithm question
Add your answer
Q2. Architecture of project.
Ans. 
The architecture of the project is based on microservices with a containerized approach using Docker and Kubernetes.
• Utilizes microservices architecture for scalability and flexibility

• Containerized approach using Docker for easy deployment and management

• Orchestrated with Kubernetes for automated scaling and monitoring
Answered by AI
Add your answer