Skip to content

Airtel 2026 Pattern Details

Overview

This page collects Airtel placement papers from 2026 with practice questions, worked solutions, and the exam pattern students reported that cycle. Use it when you want drive history: what the first round looked like, which topics repeated, and how to approach solutions. Work the sets below under a timer, then compare with newer material so your prep matches both established Airtel patterns and recent shifts.

Airtel Aptitude Mock Quiz

Timed placement-style MCQs with score and explanations after you submit. Use it to check speed and accuracy before the real test.

Questions15
Time10 min

Airtel exam pattern 2026

Section What shows up Prep focus
Technical / domain Syllabus aligned to the notification Topic checklist
Aptitude Quant + reasoning Speed with accuracy
Interview Subject depth + projects Clear fundamentals

First round: Airtel Online Assessment
Skills emphasized: Aptitude, coding, networking basics
Languages: Java, Python, C++

Sample Airtel questions with solutions

These are practice-style questions aligned to patterns students report for Airtel drives around 2026. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.

Quantitative aptitude (2026)

Q1: Permutation basic

Problem: In how many ways can 5 different books be arranged on a shelf?

Solution: Arrangements of 5 distinct items = 5! = 120.

Answer: 120

Q2: Consecutive integers

Problem: If the sum of three consecutive integers is 72, what is the smallest of these integers?

Solution: Let the integers be x, x+1, and x+2.

x + (x+1) + (x+2) = 72 3x + 3 = 72 3x = 69 x = 23

So the integers are 23, 24, and 25.

Answer: 23

Q3: Train and pole

Problem: A train 150 meters long passes a pole in 15 seconds. What is its speed in km/h?

Solution: Distance = 150 m = 0.15 km. Time = 15 s = 15/3600 h = 1/240 h. Speed = 0.15 ÷ (1/240) = 0.15 × 240 = 36 km/h.

Faster check: 150/15 = 10 m/s → 10 × 18/5 = 36 km/h.

Answer: 36 km/h

Q4: Profit on a pen

Problem: If the cost price of a pen is ₹40 and it is sold at a 25% profit, what is the selling price?

Solution: Profit = 25% of 40 = ₹10. Selling price = 40 + 10 = ₹50.

Or SP = CP × 1.25 = 40 × 1.25 = ₹50.

Answer: ₹50

Q5: A and B together

Problem: A can finish a job in 10 days and B in 20 days. How long will they take working together?

Solution: A’s one-day work = 1/10. B’s one-day work = 1/20. Together = 1/10 + 1/20 = 3/20 per day. Time = 20/3 ≈ 6.67 days (6 days 16 hours).

Answer: 20/3 days

Q6: Sum of naturals

Problem: What is the sum of the first 50 natural numbers?

Solution: Sum of first n naturals = n(n+1)/2. For n = 50: 50 × 51 / 2 = 1275.

Answer: 1275

Q7: Average speed

Problem: A person covers a distance at 60 km/h and returns at 40 km/h. What is the average speed for the whole trip?

Solution: For equal distances, average speed = 2ab/(a+b). = 2×60×40 / (60+40) = 4800/100 = 48 km/h.

Do not take the arithmetic mean (50); that would be wrong here.

Answer: 48 km/h

Q8: Marked price discount

Problem: A shopkeeper marks goods 20% above cost and then gives a 10% discount. What is the profit percentage?

Solution: Let CP = ₹100. Marked price = ₹120. Discount = 10% of 120 = ₹12. SP = 120 − 12 = ₹108. Profit % = 8%.

Answer: 8%

Logical reasoning (2026)

Q1: Series multiply

Problem: Find the next number: 3, 9, 27, 81, ?

Solution: Each term is multiplied by 3. Next = 81 × 3 = 243.

Answer: 243

Q2: Seating hint

Problem: Five friends sit in a row. A is to the left of B but right of C. D is to the right of B and left of E. Who is in the middle?

Solution: Order from left to right: C, A, B, D, E. The middle seat is B.

Answer: B

Q3: Analogy

Problem: Book is to Reading as Fork is to ?

Solution: A book is used for reading; a fork is used for eating.

Answer: Eating

Q4: Odd one out

Problem: Find the odd one out: 3, 5, 7, 9, 11

Solution: 3, 5, 7, and 11 are prime. 9 = 3×3 is composite, so it is the odd one out.

Answer: 9

Coding practice (2026)

Coding Q1: Maximum subarray sum (Kadane)

Problem: Given an integer array, find the contiguous subarray with the largest sum and return that sum. Example: [-2,1,-3,4,-1,2,1,-5,4] → 6 (from [4,-1,2,1]).

Approach: Keep a running sum. If the running sum drops below 0, reset it to 0 before taking the next element (or track the best ending-here value). Track the global maximum as you scan once from left to right.

Complexity: O(n) time, O(1) extra space

Airtel tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q2: Reverse a string in place

Problem: Given a mutable character array representing a string, reverse it in place without allocating another array of the same size.

Approach: Use two pointers at the start and end. Swap characters, then move inward until the pointers meet. Watch empty and single-character inputs.

Complexity: O(n) time, O(1) extra space

Airtel tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q3: Check prime

Problem: Write a function that returns true if n is prime and false otherwise. Handle n < 2 correctly.

Approach: Return false for n < 2. Trial-divide from 2 to floor(sqrt(n)). If any divisor divides n evenly, it is composite; otherwise prime.

Complexity: O(√n) time

Airtel tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q4: Valid parentheses

Problem: Given a string containing only ‘()[]’, decide whether the brackets are balanced and correctly nested.

Approach: Scan left to right with a stack. Push opening brackets. On a closing bracket, the stack top must be the matching opener. At the end the stack must be empty.

Complexity: O(n) time, O(n) space

Airtel tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q5: Two Sum

Problem: Given an array of integers and a target, return indices of two numbers that add up to the target. Assume exactly one solution and you may not use the same element twice.

Approach: Walk the array once. For each value x, check whether target − x was seen earlier in a hash map of value → index. If yes, return both indices; else store x.

Complexity: O(n) time, O(n) space

Airtel tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q6: Longest substring without repeating characters

Problem: Given a string s, find the length of the longest substring without repeating characters. Example: ‘abcabcbb’ → 3 (‘abc’).

Approach: Sliding window with a map (or last-seen index) of characters. Expand the right pointer; when a duplicate appears inside the window, move the left pointer past the previous occurrence.

Complexity: O(n) time

Airtel tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q7: Merge overlapping intervals

Problem: Given a list of intervals [start, end], merge all overlapping intervals and return the non-overlapping set that covers the same ranges.

Approach: Sort by start time. Walk once, merging into the last interval in the result when the next start is ≤ current end; otherwise append a new interval.

Complexity: O(n log n) time from the sort

Airtel tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Coding Q8: Top K frequent elements

Problem: Given an integer array and an integer k, return the k most frequent elements. Order among equals can be arbitrary unless the problem says otherwise.

Approach: Count frequencies with a hash map, then use a heap of size k (or bucket sort by frequency) to extract the top k keys.

Complexity: O(n log k) with a heap

Airtel tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.

Deep prep notes for Airtel

How the Airtel Online Assessment usually feels

Students usually say the first round is time-tight - easy marks vanish if you sit too long on one hard question. For Airtel, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Java, Python, C++.

Topic weight hints

Area Why it matters at Airtel
Aptitude What usually helps you clear the first round
Core CS (OOPs / DBMS / OS) Technical interview depth
Telecom awareness Helps in managerial / HR conversations
Communication Explain your approach clearly; keep a few real examples ready for HR

14-Day sprint

  1. Days 1-3: Learn the 2026 pattern and take two sectional mocks
  2. Days 4-7: Closed practice on weak topics from your error log
  3. Days 8-10: Full mocks every other day; review the same day
  4. Days 11-14: Practice explaining projects out loud, light revision, sleep and IDs ready

Comments & Suggestions

Similar companies

Jio · Cisco · IBM · Reliance