Infosys vs J P Morgan Interview Questions

Infosys lists 105 LeetCode interview questions while J P Morgan lists 79. They share 26 problems — 25% of Infosys's bank and 33% of J P Morgan's. Focus on the overlap first, then drill into 79 Infosys-only and 53 J P Morgan-only questions.

Overview

Infosys

105 questions

Easy 32Medium 57Hard 16
J P Morgan

79 questions

Easy 27Medium 47Hard 5

Preparation Strategy

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

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 J P Morgan-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
J P Morgan
27
Medium
Infosys
57
J P Morgan
47
Hard
Infosys
16
J P Morgan
5

Top Shared Topics

26 Shared Questions

High-priority problems to practice for both Infosys and J P Morgan.

ProblemDifficulty
Two SumEasy
Longest Substring Without Repeating CharactersMedium
Best Time to Buy and Sell StockEasy
Valid ParenthesesEasy
Next PermutationMedium
Palindrome NumberEasy
Maximum SubarrayMedium
Rotate ImageMedium
Merge IntervalsMedium
Generate ParenthesesMedium
Spiral MatrixMedium
Coin ChangeMedium
Fibonacci NumberEasy
Group AnagramsMedium
Set Matrix ZeroesMedium
Two Sum II - Input Array Is SortedMedium
Kth Largest Element in an ArrayMedium
Longest Palindromic SubstringMedium
Climbing StairsEasy
Subarray Sum Equals KMedium
Combination SumMedium
Find the Duplicate NumberMedium
Integer to RomanMedium
Average Time of Process per MachineEasy
Best Time to Buy and Sell Stock IIMedium
Container With Most WaterMedium

Unique to Infosys (79)

Problems in Infosys's list that do not appear at J P Morgan.

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 J P Morgan (53)

Problems in J P Morgan's list that do not appear at Infosys.

Frequently Asked Questions

How many LeetCode questions do Infosys and J P Morgan share?

Infosys and J P Morgan share 26 LeetCode interview questions. 79 problems appear only in Infosys's list and 53 appear only in J P Morgan's list.

What topics overlap most between Infosys and J P Morgan?

The most common shared topics between Infosys and J P Morgan are Array (17 shared questions), Dynamic Programming (8 shared questions), Hash Table (6 shared questions), String (6 shared questions), Two Pointers (5 shared questions). Mastering these areas prepares you for both companies.

Which company asks harder LeetCode questions: Infosys or J P Morgan?

Infosys has 32 Easy, 57 Medium, and 16 Hard questions. J P Morgan has 27 Easy, 47 Medium, and 5 Hard questions. Infosys has a higher proportion of Hard problems in its interview set.

How should I prepare if interviewing at both Infosys and J P Morgan?

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

Explore More