Top 50 Infosys Coding Questions 2021–2026 | SE, DSE & SP Roles | PYQ Easy Medium Hard

TCS NQT Python Coding Questions 2026

n = int(input())
arr = [int(input()) for _ in range(n)]
pos = 0
for x in arr:
    if x != 0:
        arr[pos] = x
        pos += 1
while pos < n:
    arr[pos] = 0
    pos += 1
print(*arr)

day = input().strip().lower()
n = int(input())
days = {"mon":0,"tue":1,"wed":2,"thu":3,"fri":4,"sat":5,"sun":6}
d = days[day]
to_sun = (6 - d) % 7
if to_sun >= n:
    print(0)
else:
    print(1 + (n - to_sun - 1) // 7)

n = int(input())
prices = [int(input()) for _ in range(n)]
min_price = float('inf')
max_profit = 0
for p in prices:
    min_price = min(min_price, p)
    max_profit = max(max_profit, p - min_price)
print(max_profit)

t = int(input())
for _ in range(t):
    n = int(input())
    print(n * (n - 1) // 2)

s = input().strip()
L = int(input())
best = 0
for i in range(0, len(s), L):
    best = max(best, s[i:i+L].count('a'))
print(best)

n = int(input())
r = int(input())
if r == 0:
    print(0)
else:
    for _ in range(r):
        n = sum(int(d) for d in str(n))
        if n < 10:
            break
    print(n)

n = int(input())
arr = [int(input()) for _ in range(n)]
result = 0
for x in arr:
    result ^= x
print(result)

n = int(input())
arr = [int(input()) for _ in range(n)]
low = mid = 0
high = n - 1
while mid <= high:
    if arr[mid] == 0:
        arr[low], arr[mid] = arr[mid], arr[low]
        low += 1; mid += 1
    elif arr[mid] == 2:
        arr[mid], arr[high] = arr[high], arr[mid]
        high -= 1
    else:
        mid += 1
print(*arr)

import math
n = int(input())
print(2 * math.factorial(n - 2))

n = int(input())
mask = (1 << n.bit_length()) - 1
print(n ^ mask)

n = int(input())
sets = [set(input().strip()) for _ in range(n)]
common = sets[0]
for s in sets[1:]:
    common &= s
print(len(common))

n = int(input())
arr = [int(input()) for _ in range(n)]
count = 1
mx = arr[0]
for x in arr[1:]:
    if x > mx:
        count += 1
        mx = x
print(count)

fname = input().strip()
valid_ext = {"exe","pdf","txt","py","java"}
if " " in fname or fname.count(".") != 1:
    print("Invalid")
else:
    name, ext = fname.split(".")
    if name and name[0].isalnum() and ext in valid_ext:
        print("Valid")
    else:
        print("Invalid")

import math
n = int(input())
print(math.factorial(n))

n = int(input())
days_list = list(map(int, input().split()))
total = 0
for d in days_list:
    if d <= 0:
        continue
    elif d <= 5:
        total += 5 * d
    elif d <= 10:
        total += 25 + 10 * (d - 5)
    else:
        total += 25 + 50 + 20 * (d - 10)
print(total)

n = int(input())
arr = [int(input()) for _ in range(n)]
unique = sorted(set(arr), reverse=True)
print(unique[1] if len(unique) >= 2 else -1)

n = int(input())
arr = [int(input()) for _ in range(n)]
print(*arr[::-1])

n = int(input())
arr = [int(input()) for _ in range(n)]
seen = set()
result = []
for x in arr:
    if x not in seen:
        seen.add(x)
        result.append(x)
print(*result)

n = int(input())
arr = [int(input()) for _ in range(n)]
k = int(input())
seen = set()
pairs = set()
for x in arr:
    comp = k - x
    if comp in seen:
        pair = (min(x,comp), max(x,comp))
        if pair not in pairs:
            print(pair)
            pairs.add(pair)
    seen.add(x)

from collections import OrderedDict
n = int(input())
arr = [int(input()) for _ in range(n)]
freq = OrderedDict()
for x in arr:
    freq[x] = freq.get(x, 0) + 1
for k, v in freq.items():
    print(f"{k}:{v}")

n = int(input())
arr = [int(input()) for _ in range(n)]
cur = max_s = arr[0]
for x in arr[1:]:
    cur = max(x, cur + x)
    max_s = max(max_s, cur)
print(max_s)

n = int(input())
arr = [int(input()) for _ in range(n)]
k = int(input()) % n
if k:
    arr = arr[-k:] + arr[:-k]
print(*arr)

n = int(input())
arr = [int(input()) for _ in range(n-1)]
print(n*(n+1)//2 - sum(arr))

n = int(input())
nums = [int(input()) for _ in range(n)]
slow = fast = nums[0]
while True:
    slow = nums[slow]
    fast = nums[nums[fast]]
    if slow == fast:
        break
slow = nums[0]
while slow != fast:
    slow = nums[slow]
    fast = nums[fast]
print(slow)

n = int(input())
arr = [int(input()) for _ in range(n)]
num_set = set(arr)
best = 0
for x in num_set:
    if x - 1 not in num_set:
        cur, streak = x, 1
        while cur + 1 in num_set:
            cur += 1
            streak += 1
        best = max(best, streak)
print(best)

s = input().strip().lower()
print("Yes" if s == s[::-1] else "No")

from collections import Counter
s1 = input().strip().lower()
s2 = input().strip().lower()
print("Yes" if Counter(s1) == Counter(s2) else "No")

s = input().strip().lower()
v = sum(1 for c in s if c in 'aeiou')
con = sum(1 for c in s if c.isalpha() and c not in 'aeiou')
print(f"V:{v} C:{con}")

from collections import Counter
s = input().strip()
freq = Counter(s)
for c in s:
    if freq[c] == 1:
        print(c)
        break
else:
    print(-1)

s = input()
print(' '.join(s.split()[::-1]))

s = input().strip()
seen = set()
left = max_len = 0
for right, c in enumerate(s):
    while c in seen:
        seen.remove(s[left])
        left += 1
    seen.add(c)
    max_len = max(max_len, right - left + 1)
print(max_len)

text = input().strip()
pat = input().strip()
count = sum(1 for i in range(len(text)-len(pat)+1)
            if text[i:i+len(pat)] == pat)
print(count)

s = input().strip()
if not s:
    print(s)
else:
    res = []
    count = 1
    for i in range(1, len(s)):
        if s[i] == s[i-1]:
            count += 1
        else:
            res.append(s[i-1] + (str(count) if count > 1 else ""))
            count = 1
    res.append(s[-1] + (str(count) if count > 1 else ""))
    compressed = "".join(res)
    print(compressed if len(compressed) < len(s) else s)

s1 = input().strip()
s2 = input().strip()
print("Yes" if len(s1)==len(s2) and s2 in s1+s1 else "No")

n = int(input())
strs = [input().strip() for _ in range(n)]
strs.sort()
prefix = []
for a, b in zip(strs[0], strs[-1]):
    if a == b:
        prefix.append(a)
    else:
        break
print(''.join(prefix) if prefix else "")

n = int(input())
def is_prime(n):
    if n < 2: return False
    for i in range(2, int(n**0.5)+1):
        if n % i == 0: return False
    return True
print("Prime" if is_prime(n) else "Not Prime")

from math import gcd
a, b = int(input()), int(input())
g = gcd(a, b)
print(f"GCD:{g} LCM:{(a*b)//g}")

n = int(input())
digits = str(n)
k = len(digits)
print("Yes" if n == sum(int(d)**k for d in digits) else "No")

n = int(input())
a, b = 0, 1
fib = []
for _ in range(n):
    fib.append(a)
    a, b = b, a + b
print(*fib)

n = int(input())
result = 1
for i in range(2, n+1):
    result *= i
print(result)

n = int(input())
total = sum(i for i in range(1, n) if n % i == 0)
print("Yes" if total == n else "No")

n = int(input())
print(bin(n)[2:], oct(n)[2:], hex(n)[2:])

n = int(input())
factors = []
d = 2
while d * d <= n:
    while n % d == 0:
        factors.append(d)
        n //= d
    d += 1
if n > 1:
    factors.append(n)
print(*factors)

b, e = int(input()), int(input())
result = 1
base = b
while e > 0:
    if e % 2 == 1:
        result *= base
    base *= base
    e //= 2
print(result)

n = int(input())
print(0 if n == 0 else 1 + (n - 1) % 9)

n = int(input())
arr = [int(input()) for _ in range(n)]
for i in range(n):
    for j in range(0, n-i-1):
        if arr[j] > arr[j+1]:
            arr[j], arr[j+1] = arr[j+1], arr[j]
print(*arr)

n = int(input())
arr = [int(input()) for _ in range(n)]
t = int(input())
low, high, result = 0, n-1, -1
while low <= high:
    mid = (low + high) // 2
    if arr[mid] == t:
        result = mid; break
    elif arr[mid] < t:
        low = mid + 1
    else:
        high = mid - 1
print(result)

n = int(input())
arr = [int(input()) for _ in range(n)]
k = int(input())
arr.sort(reverse=True)
print(arr[k-1])

m = int(input())
a = [int(input()) for _ in range(m)]
n = int(input())
b = [int(input()) for _ in range(n)]
i = j = 0
res = []
while i < m and j < n:
    if a[i] <= b[j]:
        res.append(a[i]); i += 1
    else:
        res.append(b[j]); j += 1
res.extend(a[i:])
res.extend(b[j:])
print(*res)

n = int(input())
arr = [int(input()) for _ in range(n)]
passes = 0
for i in range(n):
    swapped = False
    for j in range(0, n-i-1):
        if arr[j] > arr[j+1]:
            arr[j], arr[j+1] = arr[j+1], arr[j]
            swapped = True
    if swapped:
        passes += 1
    else:
        break
print(passes)

n = int(input())
for i in range(1, n+1):
    print("*" * i)

n = int(input())
for i in range(1, n+1):
    print(*range(1, i+1))

n = int(input())
for i in range(n, 0, -1):
    print("*" * i)

n = int(input())
for i in range(1, n+1, 2):
    print(" " * ((n-i)//2) + "*" * i)
for i in range(n-2, 0, -2):
    print(" " * ((n-i)//2) + "*" * i)

def hanoi(n, src, dest, aux):
    if n == 1:
        print(f"{src}->{dest}")
        return
    hanoi(n-1, src, aux, dest)
    print(f"{src}->{dest}")
    hanoi(n-1, aux, dest, src)

n = int(input())
hanoi(n, "A", "C", "B")

s1 = input().strip()
s2 = input().strip()
m, n = len(s1), len(s2)
dp = [[0]*(n+1) for _ in range(m+1)]
for i in range(1, m+1):
    for j in range(1, n+1):
        if s1[i-1] == s2[j-1]:
            dp[i][j] = dp[i-1][j-1] + 1
        else:
            dp[i][j] = max(dp[i-1][j], dp[i][j-1])
print(dp[m][n])

n, c = int(input()), int(input())
w = list(map(int, input().split()))
v = list(map(int, input().split()))
dp = [[0]*(c+1) for _ in range(n+1)]
for i in range(1, n+1):
    for cap in range(c+1):
        dp[i][cap] = dp[i-1][cap]
        if w[i-1] <= cap:
            dp[i][cap] = max(dp[i][cap],
                             dp[i-1][cap-w[i-1]] + v[i-1])
print(dp[n][c])

def count_subsets(arr, n, s):
    if s == 0: return 1
    if n == 0: return 0
    if arr[n-1] > s:
        return count_subsets(arr, n-1, s)
    return (count_subsets(arr, n-1, s) +
            count_subsets(arr, n-1, s - arr[n-1]))

n = int(input())
arr = list(map(int, input().split()))
s = int(input())
print(count_subsets(arr, n, s))

text = input()
k = int(input()) % 26
result = []
for c in text:
    if c.isalpha():
        base = ord('A') if c.isupper() else ord('a')
        result.append(chr((ord(c) - base + k) % 26 + base))
    else:
        result.append(c)
print(''.join(result))

y = int(input())
if (y % 4 == 0 and y % 100 != 0) or (y % 400 == 0):
    print("Leap Year")
else:
    print("Not Leap Year")

Top 100 Questions Asked in Cognizant Online Assessment

TCS Interview Questions 2026 – Real HR, Technical & Managerial Round Questions

Part 1: Number System Questions for Placement Exams 2025 (Complete PYQ Set with Answers)

When preparing for placement exams, one of the most scoring yet tricky topics is the Number System. It is a foundation of quantitative aptitude and regularly appears in exams conducted by Infosys, TCS, Wipro, Accenture, Cognizant, LTI Mindtree, Capgemini, and even government exams.

To help you master this area, we have compiled a complete PYQ (Previous Year Questions) set from the Number System – Day 01 and Day 02 series. These 50+ questions cover every important concept tested in real exams.

Why Focus on Number System?

• Weightage in exams: Almost every company includes 2–3 direct number system questions.

• Conceptual base: Topics like factors, divisibility, factorial zeros, and remainders build the logic for tougher aptitude.

• High-scoring: With proper practice, these questions can be solved in less than a minute.

Number System Day 01 – PYQ Set

Q1. If 3/4 of the difference of 2 1/4 and 1 2/3 is subtracted from 2/3 of 3 1/4, the result is
a) -48/83
b) 48/83
c) -83/48
d) 83/48
Answer: d) 83/48

Q2. P is the product of all prime numbers from 1 to 100. Then the number of zeros at the end of the product is
a) 0
b) 1
c) 24
d) None of these
Answer: b) 1

Q3. What is the highest power of 2 in 1! + 2! + 3! + … + 100!?
a) 24
b) 3
c) 0
d) 97
Answer: c) 0

Q4. If n = 1 + x, where x is the product of four consecutive positive integers, then which of the following is true?

1. n is odd

2. n is prime

3. n is a perfect square
   a) 1 only
   b) 2 only
   c) 3 only
   d) 1 & 3 only
   Answer: d) 1 & 3 only

Q5. What is the maximum value of m if
N = 35 × 45 × 55 × 60 × 124 × 75
is divisible by 5^m ?
a) 4
b) 5
c) 6
d) 7
Answer: c) 6

Q6. The product of two consecutive even numbers is 9408. Which of the following is the greater number?
a) 96
b) 94
c) 92
d) 90
e) None of these
Answer: e) None of these (correct number is 98)

Q7. The sum of the digits of a two-digit number is 15 and the difference between the digits is 3. What is the number?
a) 69
b) 78
c) 96
d) Cannot be determined
e) None of these
Answer: d) Cannot be determined (both 69 and 96 satisfy conditions)

Q8. Find the maximum number of trees which can be planted 10m apart on two sides of a straight road 1860m long.
Answer: 373

Q9. A man engaged a servant for Rs. 90 + a turban for one year. He served 9 months and received Rs. 65 + turban. Find the price of the turban.
Answer: Rs. 20

Q10. In a division sum, the divisor is 10 times the quotient and 5 times the remainder. If remainder = 48, find the dividend.
a) 5808
b) 5809
c) 5484
d) 3472
Answer: a) 5808

Q11. If x and y are positive integers, is y odd?

1. x is odd.

2. xy is odd.
   Answer: Statement 2 alone is sufficient.

Q12. Is b^ab + b^(b+1) even? (a, b positive integers)

1. b is even

2. a is even
   Answer: Statement 1 alone is sufficient.

Q13. How many keystrokes are needed to type numbers from 1 to 1000?
a) 2704
b) 2890
c) 2893
d) 3001
Answer: c) 2893

Day 02: Number System PYQ

Q1. How many divisors of 1020?
a) 12
b) 20
c) 24
d) 36
Answer: c) 24

How many divisors of 1200?
a) 12
b) 30
c) 24
d) 36
Answer: b) 30

Q2. For N = 420, find:

• Total number of factors

• Number of even factors

• Number of odd factors
  Answer: 24 total, 16 even, 8 odd

Q3. Find total number of factors of 888888.
Answer: 120

Q4. Find number of divisors of 50.
Answer: 6

Q5. Find trailing zeros in 25!.
Answer: 6

Q6. Division sum (same as Day01 Q13).
Answer: 5808

Q7. Least value of * in 451*603 divisible by 9?
Answer: 7

Q8. If 5432*7 divisible by 9, * = ?
Answer: 6

Q9. When 335 is added to 5A7, the result is 8B2 (divisible by 3). Find largest & smallest A.
Answer: Largest A = 9, Smallest A = 0

Q10. Find k in 9314k8025 divisible by 11.
Answer: 7

Q11. If 259876P05 divisible by 11, find (P^2 + 5).
Answer: 56

Q12. Which is divisible by 15?
Options: 2365, 1375, 4365, 2275
Answer: 1375

Q13. Which is NOT divisible by 18?
Options: 54036, 50436, 34056, 65043
Answer: 65043

Q14. Which is divisible by 24?
Options: 35718, 63810, 537804, 3125736
Answer: 3125736

Q15. Least 5-digit number divisible by 52, 56, 78, 91?
Answer: 10920

Q16. Greatest 6-digit number leaving remainder 10 when divided by 36, 48, 54, 60, 90?
Answer: 997910

Q17. Largest 4-digit number divisible by 88?
Answer: 9944

Q18. If 5432y1749x divisible by 72, find (5x – 4y).
Answer: 18

Q19. N = 897324P64Q divisible by 8 and 9. Value of P + Q?
Answer: 9

Q20. How many pairs (A,B) possible in 89765A4B if divisible by 9 and last digit even?
Answer: 3

Q21. (271 + 272 + 273 + 274) divisible by?
a) 9
b) 10
c) 11
d) 13
Answer: b) 10

Preparation Tips for Number System

1. Revise divisibility rules (for 2, 3, 5, 7, 9, 11, 13, 24, etc.).

2. Practice factorial zeros & factors daily.

3. Do 10–15 PYQs under time constraints.

4. Focus on logic-based questions — they repeat across exams.

Final Words

This Number System PYQ Super Set combines questions from multiple real exams. By practicing all these, you will gain the accuracy and speed required to clear the aptitude rounds of TCS, Infosys, Wipro, Accenture, Capgemini, and LTI Mindtree.

Verbal Ability Questions for Placement Exams (PYQ Super 30 with Answers)

Verbal ability is one of the most important sections in placement exams of companies like Infosys, Wipro, TCS, LTI Mindtree, Cognizant, Accenture and more. Many students prepare for aptitude and coding but underestimate verbal ability — which often has a separate cutoff.

In this blog, we bring you the Verbal Assorted Super 30 Previous Year Questions (PYQ). Practicing these questions will give you a strong edge in clearing the verbal section in upcoming 2025 placement drives.

Verbal Assorted Super 30: Questions with Answers

Question 1

The waiter hasn’t brought the chocolate shake ___ I’ve been here an hour already.
a) up
b) yet
c) still
d) till
Answer: b) yet

Question 2

Everyone in this world is accountable to God ___ his actions.
a) for
b) about
c) to
d) at
Answer: a) for

Question 3

She is married ___ a doctor.
a) with
b) to
c) of
d) about
Answer: b) to

Question 4

We stayed at a small guest house, but the ___ was good.
a) food
b) accommodation
c) lodging
d) boarding
Answer: b) accommodation

Question 5

My train is due to arrive ___ 5 o’clock.
a) in
b) at
c) on
d) for
Answer: b) at

Question 6

I am tired ___ waiting.
a) with
b) of
c) for
d) about
Answer: b) of

Question 7

Our school is very famous ___ its sports achievements.
a) for
b) with
c) about
d) of
Answer: a) for

Question 8

The company deals ___ electrical goods.
a) with
b) in
c) about
d) on
Answer: b) in

Question 9

He is angry ___ me.
a) on
b) of
c) with
d) about
Answer: c) with

Question 10

He is good ___ Mathematics.
a) at
b) in
c) with
d) for
Answer: a) at

Question 11

The news of his resignation was not ___ on the radio.
a) broadcasted
b) broadcast
c) telecasted
d) None
Answer: b) broadcast

Question 12

She was annoyed ___ his behavior.
a) about
b) with
c) on
d) for
Answer: b) with

Question 13

I am confident ___ my success.
a) about
b) on
c) of
d) for
Answer: c) of

Question 14

He has a passion ___ reading.
a) with
b) on
c) about
d) for
Answer: d) for

Question 15

We should not boast ___ our wealth.
a) at
b) for
c) of
d) about
Answer: c) of

Question 16

He is addicted ___ gambling.
a) for
b) to
c) with
d) in
Answer: b) to

Question 17

He is very fond ___ playing cricket.
a) with
b) of
c) at
d) in
Answer: b) of

Question 18

Do not brood ___ your past failures.
a) over
b) on
c) at
d) for
Answer: a) over

Question 19

We are looking forward ___ our holidays.
a) at
b) in
c) for
d) to
Answer: d) to

Question 20

The children were playing ___ the ground.
a) in
b) at
c) on
d) with
Answer: c) on

Question 21

The principal was pleased ___ my work.
a) at
b) with
c) on
d) about
Answer: b) with

Question 22

She prevented me ___ going there.
a) against
b) from
c) with
d) at
Answer: b) from

Question 23

The students are longing ___ vacations.
a) about
b) at
c) for
d) with
Answer: c) for

Question 24

She congratulated me ___ my success.
a) for
b) on
c) about
d) of
Answer: b) on

Question 25

All my advice fell ___ and he continued in his old ways.
a) down
b) off
c) apart
d) flat
Answer: d) flat

Question 26

The judge listened to the arguments ___ the lawyer.
a) of
b) at
c) by
d) from
Answer: a) of

Question 27

The two brothers quarreled ___ the property.
a) at
b) for
c) with
d) over
Answer: d) over

Question 28

The new manager is anxious ___ quick results.
a) for
b) at
c) with
d) of
Answer: a) for

Question 29

Please do not interfere ___ my business.
a) in
b) with
c) on
d) for
Answer: a) in

Question 30

He is suffering ___ fever.
a) with
b) from
c) in
d) for
Answer: b) from

How to Prepare for Verbal Ability

1. Read Daily: Newspapers, online articles, and novels help improve vocabulary and comprehension.

2. Maintain a Vocabulary Journal: Note down new words, their meanings, and example sentences.

3. Practice PYQ Regularly: As seen above, many questions repeat in placement exams with slight variations.

4. Grammar Revision: Brush up on tenses, subject-verb agreement, articles, prepositions, and sentence structure.

5. Mock Tests: Practice under time limits to improve speed and accuracy.

Key Takeaways from Verbal PYQ

• Placement exams test basic but tricky English usage.

• Questions often look simple but are designed to trap students with common grammar/vocabulary errors.

• Consistent practice of PYQ sets like the Verbal Assorted Super 30 can significantly improve your chances of clearing the verbal section.

Infosys & LTI Exam Pattern 2025–26: Complete Guide with Section-Wise Syllabus and Sample Questions

Getting placed in companies like Infosys and LTI Mindtree is a dream for many freshers. But if you look closely at why students fail, it’s usually not because the exam is impossible — it’s because they never studied the pattern properly.

We’ll break down the Infosys System Engineer exam pattern (2025–26) and the LTI Mindtree hiring test structure, straight from the latest official material. Along the way, you’ll also see sample questions, topics to focus on, and preparation tips.

Infosys System Engineer Exam Pattern 2025–26

Infosys has a sectional cutoff system. Even if your overall score is strong, failing one section can eliminate you.

Section I: Mathematical / Technical Ability

• 10 questions, 35 minutes

• Core areas: Number System, HCF & LCM, Percentages, Profit & Loss, SI & CI, Time-Speed-Distance, Time & Work, Pipes & Cisterns, Probability, Permutations & Combinations.

• Also includes arrangement puzzles (tabular, circular, linear, square).

Sample Questions

1. How many code words can be formed with two distinct alphabets followed by two distinct digits?

2. Two containers have milk-water mixtures in ratios 5:4 and 7:9. In what ratio should they be mixed to form a 1:1 mixture?

3. Pipe A fills a tank in 10 hrs, Pipe B empties it in 15 hrs. How long to fill a half-empty tank?

Section II: Analytical Thinking

• 15 questions, 25 minutes

• Topics: Syllogisms, data sufficiency, logical statements, graph-based DI, puzzles.

Sample Questions

• “All green are blue. All blue are white.” → Which conclusions follow?

• Find the wrong number in the series: 15972, 15629, 15840, 15720, 15784, 15757.

• A round-robin tournament had 21 matches. How many teams participated?

Section III: Puzzle Solving

• 4 questions, 10 minutes

• Matrix-based and pattern-based questions.

Example
A 3×3 matrix follows a rule. Find the missing number in the middle row. Options: 169, 181, 197, 205.

Language & Pseudo Code

Although not highlighted in the PPT, Infosys SE exams also include:

• English grammar (error correction, sentence completion).

• Writing (short essays).

• Pseudo code (C/C++ style, testing algorithmic flow).

Watch: Infosys & LTI Exam Pattern Explained

If you prefer a visual breakdown of the hiring process, here’s a detailed video that explains both the Infosys and LTI exam patterns step by step:

Watch the video here

This video is a great companion to the blog, as it helps you understand timing, structure, and key strategies in a live format.

LTI Mindtree Exam Pattern 2025–26

The LTI test is slightly different from Infosys. It’s more balanced between aptitude, coding, and computer science fundamentals.

Structure of Online Test:

1. English Comprehension – 15 Q, 15 min

2. Quantitative Ability – 15 Q, 15 min

3. Logical Reasoning – 15 Q, 15 min

4. Computer Science – 20 Q, 20 min

5. Coding – 2 Q, 35 min

6. Communication Assessment – 20 Q, 20 min

Syllabus Breakdown

Quantitative Ability

• Number System, Fractions & Decimals, HCF & LCM

• Percentages, Ratios, Averages

• Profit & Loss, SI/CI, Time & Work, Time-Speed-Distance

• Data Interpretation (tables, graphs, pie charts)

• Probability, Permutations & Combinations

• Mensuration (2D, 3D areas, volumes)

English Comprehension

• Vocabulary: Synonyms, Antonyms, Idioms, Cloze test

• Grammar: Error identification, subject-verb agreement, tenses

• Reading comprehension (fact-based & inference-based)

• Sentence completion & correction

Logical Reasoning

• Syllogisms, statements & assumptions, conclusions

• Puzzles (linear, circular, blood relations)

• Data sufficiency

• Number/letter/figure series

Computer Science

• Programming (C, C++, Java, OOPS concepts)

• Data Structures & Algorithms

• DBMS (SQL, Normalization, Transactions)

• OS (Scheduling, Memory, Deadlocks)

• Networks (OSI/TCP, IP addressing, Routing)

• Software Engineering, Compiler Design, TOC basics

• Web Technologies, Cloud basics

Coding

• Languages allowed: C, C++, Java, Python

• Focus: Problem-solving, DS & Algo (arrays, strings, hashing), time/space complexity, test case handling

Communication Assessment

• Grammar, reading comprehension, sentence correction, vocabulary in context

• Sometimes includes speaking/listening (fluency, pronunciation)

Preparation Strategy

• For Infosys: Prioritize aptitude speed and reasoning depth. Focus on puzzles, arrangement-based questions, and probability.

• For LTI: Cover breadth — aptitude basics + computer science theory + strong coding practice.

• Mock Tests: Both companies use adaptive or cutoff-based systems. Practicing under real exam conditions is key.

Conclusion

Infosys and LTI remain two of the biggest opportunities for fresh graduates in 2025–26. While Infosys leans more on aptitude + reasoning + cutoff clearing, LTI tests a broader mix of aptitude + computer science + coding.

LTI AI Interview 2025: Complete Guide, Questions, and Preparation Strategy

Recruitment at top IT companies is evolving. Gone are the days when every candidate sat across a human panel. Today, companies like LTI Mindtree are introducing AI-based interviews to streamline hiring. These interviews test not just your technical knowledge but also your communication skills, problem-solving approach, and ability to think under pressure.

If you are preparing for the LTI AI Interview 2025, this blog will walk you through the structure, common questions, and smart preparation strategies.

What is an AI-Based Interview?

An AI interview is a virtual assessment where you interact with a system rather than a human recruiter. The system records your responses, analyzes speech clarity, grammar, and content, and evaluates your coding and technical answers.

The goal is to ensure fairness, reduce interviewer bias, and assess a large number of candidates efficiently.

Flow of the LTI AI Interview

Step 1: Resume Upload & Introduction

• Upload your resume to the platform.

• Start with a self-introduction: your background, education, and career aspirations.

• AI may pick keywords from your resume and frame questions.

Possible Prompts:

• Tell me about yourself.

• Walk me through your projects.

• What role did you play in your project team?

• What challenges did you face, and how did you overcome them?

Step 2: Resume-Based Questions

These questions check how well you know your own work. They often cover:

• Project details: technology stack, your contribution.

• Teamwork: resolving conflicts, handling disagreements.

• Client-facing skills: how you deal with dissatisfaction.

• Learning from academics: how your degree motivated you.

Example Questions:

• How did your degree help you in building real-world skills?

• What technologies have you used so far?

• Can you describe a conflict in your team and how you resolved it?

Step 3: Technical Questions

This section tests your conceptual knowledge and applied problem-solving.

Topics to Prepare:

• Core AI/ML concepts: CNNs, GNNs, normalization, hyperparameters.

• CS fundamentals: recursion, call stack, acyclic graphs, debugging.

• Time complexity: definition, examples, calculations.

• Adaptability: Describe a technology you implemented without prior experience.

Sample Prompt:

• Explain the concept of hyperparameters in machine learning.

• What is debugging, and how do you approach it?

• How does recursion work with a call stack?

Step 4: Coding Questions

The coding part is lighter compared to a full coding round. It usually contains:

• Simple coding questions (arrays, strings, logic building).

• Role-specific problems depending on your applied position.

• You may be asked to explain your approach verbally while coding.

Tips:

• Focus on writing clean, readable code.

• Mention time complexity when explaining your solution.

• Use standard languages like C, C++, Java, or Python.

Step 5: Concluding Questions

At the end, the AI may ask:

• Do you have any questions about the position?

• What are your final thoughts about this interview?

• How was your overall experience?

This is a chance to show curiosity and professionalism. Always prepare a thoughtful question about the role or growth opportunities.

How to Prepare for LTI AI Interviews

1. Know Your Resume: AI tools scan for keywords. Be prepared for detailed project-based questions.

2. Revise CS Fundamentals: Recursion, complexity analysis, debugging, and graph concepts are common.

3. Brush Up on AI Basics: CNNs, GNNs, normalization, and hyperparameters should be in your fingertips.

4. Practice Coding Aloud: Since you may need to explain your solution, practice thinking and speaking at the same time.

5. Communication Skills: The system judges grammar, tone, and fluency. Record yourself and review to improve clarity.