Infosys vs Turing Interview Questions

Infosys lists 105 LeetCode interview questions while Turing lists 37. They share 16 problems — 15% of Infosys's bank and 43% of Turing's. Focus on the overlap first, then drill into 89 Infosys-only and 21 Turing-only questions.

Overview

Infosys

105 questions

Easy 32Medium 57Hard 16
Turing

37 questions

Easy 10Medium 23Hard 4

Preparation Strategy

Step 1 — Shared core: Solve the 16 overlapping problems first. These are the highest-yield questions for candidates interviewing at both Infosys and Turing.

Step 2 — Company-specific depth: Add Infosys-specific problems like Maximum Good Subtree Score, Find Building Where Alice and Bob Can Meet, Minimum Reverse Operations and Turing-specific problems from the exclusive lists below.

Step 3 — Difficulty tuning: Infosys skews harder in our data. Budget extra time for Hard problems if you are targeting that company.

Difficulty Comparison

Easy
Infosys
32
Turing
10
Medium
Infosys
57
Turing
23
Hard
Infosys
16
Turing
4

Top Shared Topics

16 Shared Questions

High-priority problems to practice for both Infosys and Turing.

ProblemDifficulty
Two SumEasy
Longest Substring Without Repeating CharactersMedium
Best Time to Buy and Sell StockEasy
Valid ParenthesesEasy
Maximum SubarrayMedium
Product of Array Except SelfMedium
Longest Common PrefixEasy
Merge IntervalsMedium
3SumMedium
Group AnagramsMedium
Kth Largest Element in an ArrayMedium
Longest Palindromic SubstringMedium
Number of IslandsMedium
Median of Two Sorted ArraysHard
Koko Eating BananasMedium
Jump GameMedium

Unique to Infosys (89)

Problems in Infosys's list that do not appear at Turing.

ProblemDifficulty
Maximum Good Subtree ScoreHard
Find Building Where Alice and Bob Can MeetHard
Minimum Reverse OperationsHard
Count the Number of Ideal ArraysHard
Transform Array by ParityEasy
Eat Pizzas!Medium
Maximum Sum of Subsequence With Non-adjacent ElementsHard
Maximize the Minimum Game ScoreHard
Find the Number of Subsequences With Equal GCDHard
Determine the Minimum Sum of a k-avoiding ArrayMedium
Largest Number After Mutating SubstringMedium
Minimum Total Distance TraveledHard

Unique to Turing (21)

Problems in Turing's list that do not appear at Infosys.

ProblemDifficulty
Validate IP AddressMedium
Minimum Cost For TicketsMedium
Baseball GameEasy
Minimum Length of Anagram ConcatenationMedium
Longest Arithmetic SubsequenceMedium
Minimum Adjacent Swaps for K Consecutive OnesHard
Apply Operations to Make Sum of Array Greater Than or Equal to kMedium
Minimum Number of Operations to Satisfy ConditionsMedium
Non-decreasing ArrayMedium
Ugly Number IIMedium
Find the Town JudgeEasy
Maximum Repeating SubstringEasy

Frequently Asked Questions

How many LeetCode questions do Infosys and Turing share?

Infosys and Turing share 16 LeetCode interview questions. 89 problems appear only in Infosys's list and 21 appear only in Turing's list.

What topics overlap most between Infosys and Turing?

The most common shared topics between Infosys and Turing are Array (12 shared questions), String (5 shared questions), Dynamic Programming (4 shared questions), Sorting (4 shared questions), Hash Table (3 shared questions). Mastering these areas prepares you for both companies.

Which company asks harder LeetCode questions: Infosys or Turing?

Infosys has 32 Easy, 57 Medium, and 16 Hard questions. Turing has 10 Easy, 23 Medium, and 4 Hard questions. Infosys has a higher proportion of Hard problems in its interview set.

How should I prepare if interviewing at both Infosys and Turing?

Start with the 16 shared problems since they cover what both companies ask most often. Then add 20 Infosys-specific and 20 Turing-specific questions to round out your prep.

Explore More