Bharti Airtel Software Developer Interview Questions, Process, and Tips

Q1. How to optimise fetching 1 lakh entries from db
Ans. 
Use pagination, indexing, caching, and query optimization to fetch 1 lakh entries efficiently from the database.
• Implement pagination to fetch data in smaller chunks

• Create indexes on columns frequently used in queries

• Use caching to store frequently accessed data

• Optimize queries by avoiding unnecessary joins and using appropriate indexes

• Consider using database-specific optimizations like query hints or stored procedures
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

The round started with the Introduction followed by the discussion of projects done mentioned in my resume(all related to Machine Learning and Deep Learning). Then the recruiter asked me about my previous company experience and the work which I was doing there. After the discussion, interviewer started asking basic questions of SQL and PLSQL.

Round duration - 70 Minutes
Round difficulty - Hard

Interviewer directly started asking questions in SQL,PLSQL AND SHELL SCRIPTING

Q1. Write an SQL query to find the second highest salary.
Ans. 
SQL query to find the second highest salary
• Use the ORDER BY clause to sort the salaries in descending order

• Use the LIMIT clause to limit the result to the second row

• Use a subquery to exclude the highest salary from the result
Answered by AI
Add your answer

Coding round with 3 DSA questions and a few MCQs on aptitude.

Q1. Interviewer asked questions on DSA.
Add your answer

Q1. The interviewer asked general questions on DSA.
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Online Technical Interview ( Coding Round) with 2 medium-hard problem

Q1. 
Trapping Rain Water Problem Statement
You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...read more
Ans. 
Calculate the total amount of rainwater that can be trapped between given elevations in an elevation map.
• Iterate through the array to find the maximum height on the left and right of each bar.

• Calculate the amount of water that can be trapped above each bar by taking the minimum of the maximum heights on the left and right.

• Sum up the trapped water above each bar to get the total trapped water for the elevation map.
Answered by AI
Add your answer
Q2. 
Longest Consecutive Sequence Problem Statement
You are provided with an unsorted array/list ARR of N integers. Your task is to determine the length of the longest consecutive sequence present in the array...read more
Ans. 
Find the length of the longest consecutive sequence in an unsorted array of integers.
• Iterate through the array and store each element in a set for constant time lookup.

• For each element, check if it is the start of a sequence by looking for its previous number in the set.

• Update the length of the current consecutive sequence and track the longest sequence found so far.

• Return the length of the longest consecutive sequence...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Online Technical Coding Interview

Q1. 
Stack using Two Queues Problem Statement
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
Explanation:
...read more
Ans. 
Implement a stack using two queues to store integer values with specified functions.
• Create a stack using two queues internally

• Implement functions for push, pop, top, size, and isEmpty

• Handle edge cases such as empty stack or invalid data

• Ensure the stack functions work correctly and efficiently

• Test the implementation with sample inputs and outputs
Answered by AI
Add your answer
Q2. 
Left View of a Binary Tree
Given a binary tree, your task is to print the left view of the tree. The left view of a binary tree contains the nodes visible when the tree is viewed from the left side.
Inpu...read more
Ans. 
Print the left view of a binary tree, containing nodes visible from the left side.
• Traverse the tree in a level order manner and print the first node at each level.

• Use a queue to keep track of nodes at each level.

• Handle null nodes represented by -1 in the input.
Answered by AI
Add your answer