Infosys vs Meta Interview Questions

Infosys lists 105 LeetCode interview questions while Meta lists 217. They share 56 problems — 53% of Infosys's bank and 26% of Meta's. Focus on the overlap first, then drill into 49 Infosys-only and 161 Meta-only questions.

Read the full Infosys vs Meta preparation guide →

Overview

Infosys

105 questions

Easy 32Medium 57Hard 16
Meta

217 questions

Easy 52Medium 132Hard 33

Preparation Strategy

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

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 Meta-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
Meta
52
Medium
Infosys
57
Meta
132
Hard
Infosys
16
Meta
33

Top Shared Topics

56 Shared Questions

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

ProblemDifficulty
Two SumEasy
Longest Substring Without Repeating CharactersMedium
Best Time to Buy and Sell StockEasy
Valid ParenthesesEasy
Merge Sorted ArrayEasy
Next PermutationMedium
Palindrome NumberEasy
Remove Duplicates from Sorted ArrayEasy
Maximum SubarrayMedium
Rotate ImageMedium
Trapping Rain WaterHard
Product of Array Except SelfMedium
Longest Common PrefixEasy
Merge IntervalsMedium
Generate ParenthesesMedium
Spiral MatrixMedium
Rotate ArrayMedium
Reverse IntegerMedium
3SumMedium
Group AnagramsMedium
Set Matrix ZeroesMedium
Move ZeroesEasy
Reverse Words in a StringMedium
Two Sum II - Input Array Is SortedMedium
Add Two NumbersMedium
Kth Largest Element in an ArrayMedium
Longest Palindromic SubstringMedium
Climbing StairsEasy
House RobberMedium
Palindrome PartitioningMedium

Showing top 30 of 56 shared problems.

Unique to Infosys (49)

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

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 Meta (161)

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

ProblemDifficulty
Minimum Remove to Make Valid ParenthesesMedium
Valid Word AbbreviationEasy
Binary Tree Vertical Order TraversalMedium
Valid Palindrome IIEasy
Lowest Common Ancestor of a Binary Tree IIIMedium
Binary Tree Right Side ViewMedium
Simplify PathMedium
Basic Calculator IIMedium
Lowest Common Ancestor of a Binary TreeMedium
Find Peak ElementMedium
Nested List Weight SumMedium
Random Pick with WeightMedium

Frequently Asked Questions

How many LeetCode questions do Infosys and Meta share?

Infosys and Meta share 56 LeetCode interview questions. 49 problems appear only in Infosys's list and 161 appear only in Meta's list.

What topics overlap most between Infosys and Meta?

The most common shared topics between Infosys and Meta are Array (19 shared questions), Two Pointers (10 shared questions), String (8 shared questions), Dynamic Programming (8 shared questions), Math (6 shared questions). Mastering these areas prepares you for both companies.

Which company asks harder LeetCode questions: Infosys or Meta?

Infosys has 32 Easy, 57 Medium, and 16 Hard questions. Meta has 52 Easy, 132 Medium, and 33 Hard questions. Infosys has a higher proportion of Hard problems in its interview set.

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

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

Explore More