Airtel Payments Bank Software Engineer Level 1 Interview Questions and Answers

Q1. Basic to intermediate.net, EF, SQL, C#, OOP
Add your answer
Q2. Basics of .Net Core
Add your answer

Q1. Deep into.net and sql
Add your answer

Q1. Top 50 java interview questions on internet, oops, solid, collections, arraylist, LL, hashmap, strings
Add your answer
Q2. Deadlocks, multithreading, design pattern, spring boot, hibernate, miscroservice communications, bean scopes, unit testings
Add your answer
Q3. Observable vs promise, angular directives, angular versions features
Add your answer
Q4. Dsa questions on array like {1,2,3,3,4,2,1}, create possible array with unique numbers ans: [1,2,3,4], [1,2,3],[2,3] etc.
Add your answer

Q1. Javascript features
Add your answer
Q2. Virtual dom
Add your answer

Q1. About yourself and background only
Add your answer

There were 3 question from DSA: 1st and 2nd was from recession and Dp and last one was from graph.

Some questions about specific puthon types etc...

Q1. Why i want to move on
Add your answer
Q2. What i like at my future job
Add your answer

I was given a problem statement and was asked to give a LLD and solution implementation and share it on Git.

Q1. Explain the LLD submitted.
Ans. 
The LLD submitted is a detailed design document outlining the architecture and implementation details of the software solution.
• LLD stands for Low Level Design and includes detailed design diagrams, data structures, algorithms, and component interactions.

• The LLD submitted should provide a clear roadmap for developers to implement the software solution based on the high-level design.

• It should cover all aspects of the sof...read more
Answered by AI
Add your answer
Q2. How to add more features in the solution
Ans. 
To add more features in the solution, consider user feedback, market trends, and technical feasibility.
• Gather user feedback to understand what features are desired

• Research market trends to identify popular features

• Assess technical feasibility to determine if new features can be implemented

• Prioritize features based on impact and resources available
Answered by AI
Add your answer
Q3. SOLID principles, Degin patterns
Add your answer

Q1. This was a manegerial round.
Add your answer

Q1. Salary discussion
Add your answer

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