Infosys LeetCode Interview Questions

Practice 221 coding problems currently tagged to Infosys. Use the frequency and topic signals to build a focused software engineering interview practice plan.

Last updated: September 28, 2026

53 Easy

117 Medium

51 Hard

Top Topics at Infosys

Array Dynamic Programming String Math Hash Table

Ace your Infosys interview with AI

Get real-time AI assistance during your actual interview. Invisible to screensharing.

Start Free Trial

Problem	DifficultyDiff	Frequency	Topics	Action
Two Sum 100%	EasyE	100%	Array Hash Table	Solve→
Longest Substring Without Repeating Characters 92.8%	MediumM	92.8%	Hash Table String+1	Solve→
Best Time to Buy and Sell Stock 82.3%	EasyE	82.3%	Array Dynamic Programming	Solve→
Maximum Subarray 81.1%	MediumM	81.1%	Array Divide and Conquer+1	Solve→
Second Highest Salary 78.4%	MediumM	78.4%	Database	Solve→
Palindrome Number 76.9%	EasyE	76.9%	Math	Solve→
Find the Number of Subsequences With Equal GCD 76.9%	HardH	76.9%	Array Math+4	Solve→
Subarray Sum Equals K 76.9%	MediumM	76.9%	Array Hash Table+1	Solve→
Gas Station 73.6%	MediumM	73.6%	Array Greedy	Solve→
House Robber 71.8%	MediumM	71.8%	Array Dynamic Programming	Solve→
Longest Palindromic Substring 69.8%	MediumM	69.8%	Two Pointers String+2	Solve→
Valid Parentheses 69.8%	EasyE	69.8%	String Stack+1	Solve→
Find Building Where Alice and Bob Can Meet 69.8%	HardH	69.8%	Array Binary Search+5	Solve→
Valid Anagram 69.8%	EasyE	69.8%	Hash Table String+1	Solve→
Eat Pizzas! 69.8%	MediumM	69.8%	Array Greedy+1	Solve→
Transform Array by Parity 69.8%	EasyE	69.8%	Array Sorting+1	Solve→
Maximum Good Subtree Score 69.8%	HardH	69.8%	Array Dynamic Programming+4	Solve→
Container With Most Water 67.6%	MediumM	67.6%	Array Two Pointers+1	Solve→
Longest Common Prefix 67.6%	EasyE	67.6%	Array String+1	Solve→
Group Anagrams 67.6%	MediumM	67.6%	Array Hash Table+2	Solve→
Climbing Stairs 67.6%	EasyE	67.6%	Math Dynamic Programming+1	Solve→
Count the Number of Ideal Arrays 67.6%	HardH	67.6%	Math Dynamic Programming+4	Solve→
Maximize the Minimum Game Score 67.6%	HardH	67.6%	Array Binary Search+1	Solve→
Move Zeroes 67.6%	EasyE	67.6%	Array Two Pointers	Solve→
Good Subsequence Queries 67.6%	HardH	67.6%	Array Math+2	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Next Permutation 65.2%	MediumM	65.2%	Array Two Pointers	Solve→
Minimum Reverse Operations 65.2%	HardH	65.2%	Array Hash Table+3	Solve→
Stone Game VIII 65.2%	HardH	65.2%	Array Math+5	Solve→
Merge Intervals 65.2%	MediumM	65.2%	Array Sorting+1	Solve→
Trionic Array II 65.2%	HardH	65.2%	Array Dynamic Programming	Solve→
Maximum Walls Destroyed by Robots 65.2%	HardH	65.2%	Array Binary Search+2	Solve→
Maximum Total Value 65.2%	HardH	65.2%	Array Math+2	Solve→
3Sum 62.5%	MediumM	62.5%	Array Two Pointers+1	Solve→
Largest Number After Mutating Substring 62.5%	MediumM	62.5%	Array String+1	Solve→
Trapping Rain Water 62.5%	HardH	62.5%	Array Two Pointers+3	Solve→
Longest Well-Performing Interval 62.5%	MediumM	62.5%	Array Hash Table+3	Solve→
Maximum Product After K Increments 62.5%	MediumM	62.5%	Array Greedy+1	Solve→
Maximum Sum of Subsequence With Non-adjacent Elements 62.5%	HardH	62.5%	Array Divide and Conquer+2	Solve→
Maximum Segment Sum After Removals 62.5%	HardH	62.5%	Array Union-Find+2	Solve→
Sort the People 62.5%	EasyE	62.5%	Array Hash Table+2	Solve→
Minimum Addition to Make Integer Beautiful 62.5%	MediumM	62.5%	Math Greedy	Solve→
Minimum Total Distance Traveled 62.5%	HardH	62.5%	Array Dynamic Programming+1	Solve→
Number of Nodes With Value One 62.5%	MediumM	62.5%	Array Tree+3	Solve→
Can Convert String in K Moves 62.5%	MediumM	62.5%	Hash Table String	Solve→
The Number of Beautiful Subsets 62.5%	MediumM	62.5%	Array Hash Table+5	Solve→
Determine the Minimum Sum of a k-avoiding Array 62.5%	MediumM	62.5%	Math Greedy	Solve→
Maximum Number of Consecutive Values You Can Make 62.5%	MediumM	62.5%	Array Greedy+1	Solve→
Number of Beautiful Integers in the Range 62.5%	HardH	62.5%	Math Dynamic Programming	Solve→
Find the Minimum Possible Sum of a Beautiful Array 62.5%	MediumM	62.5%	Math Greedy	Solve→
Coin Change 62.5%	MediumM	62.5%	Array Dynamic Programming+3	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Trionic Array I 62.5%	EasyE	62.5%	Array	Solve→
Rotting Oranges 62.5%	MediumM	62.5%	Array Breadth-First Search+1	Solve→
XOR After Range Multiplication Queries I 62.5%	MediumM	62.5%	Array Divide and Conquer+2	Solve→
XOR After Range Multiplication Queries II 62.5%	HardH	62.5%	Array Divide and Conquer+1	Solve→
Sum of Beautiful Subsequences 62.5%	HardH	62.5%	Array Math+2	Solve→
Count Non Adjacent Subsets in a Rooted Tree 62.5%	HardH	62.5%	Array Dynamic Programming+2	Solve→
Remove Duplicates from Sorted Array 59.4%	EasyE	59.4%	Array Two Pointers	Solve→
Number of Islands 59.4%	MediumM	59.4%	Array Depth-First Search+3	Solve→
Fibonacci Number 59.4%	EasyE	59.4%	Math Dynamic Programming+2	Solve→
Generate Parentheses 59.4%	MediumM	59.4%	String Dynamic Programming+2	Solve→
Remove Digit From Number to Maximize Result 59.4%	EasyE	59.4%	String Greedy+1	Solve→
Rotate Image 55.9%	MediumM	55.9%	Array Math+1	Solve→
Spiral Matrix 55.9%	MediumM	55.9%	Array Matrix+1	Solve→
Best Time to Buy and Sell Stock II 55.9%	MediumM	55.9%	Array Dynamic Programming+1	Solve→
Koko Eating Bananas 55.9%	MediumM	55.9%	Array Binary Search	Solve→
Lemonade Change 55.9%	EasyE	55.9%	Array Greedy	Solve→
Merge Two Sorted Lists 51.8%	EasyE	51.8%	Linked List Recursion	Solve→
Edit Distance 51.8%	MediumM	51.8%	String Dynamic Programming	Solve→
Rotate Array 51.8%	MediumM	51.8%	Array Math+1	Solve→
Kth Largest Element in an Array 51.8%	MediumM	51.8%	Array Divide and Conquer+3	Solve→
Product of Array Except Self 51.8%	MediumM	51.8%	Array Prefix Sum	Solve→
Reverse Words in a String 51.8%	MediumM	51.8%	Two Pointers String	Solve→
4Sum 51.8%	MediumM	51.8%	Array Two Pointers+1	Solve→
Minimum Window Substring 51.8%	HardH	51.8%	Hash Table String+1	Solve→
Linked List Cycle 51.8%	EasyE	51.8%	Hash Table Linked List+2	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Range Sum Query - Immutable 51.8%	EasyE	51.8%	Array Design+1	Solve→
Find Peak Element 51.8%	MediumM	51.8%	Array Binary Search	Solve→
Top K Frequent Elements 51.8%	MediumM	51.8%	Array Hash Table+6	Solve→
Split Array Largest Sum 51.8%	HardH	51.8%	Array Binary Search+3	Solve→
Longest Increasing Subsequence 51.8%	MediumM	51.8%	Array Binary Search+2	Solve→
Frequency of the Most Frequent Element 51.8%	MediumM	51.8%	Array Binary Search+4	Solve→
Frog Jump 51.8%	HardH	51.8%	Array Dynamic Programming	Solve→
Add Two Numbers 46.7%	MediumM	46.7%	Linked List Math+1	Solve→
Reverse Integer 46.7%	MediumM	46.7%	Math	Solve→
Merge Sorted Array 46.7%	EasyE	46.7%	Array Two Pointers+1	Solve→
Valid Palindrome 46.7%	EasyE	46.7%	Two Pointers String	Solve→
Sort an Array 46.7%	MediumM	46.7%	Array Divide and Conquer+6	Solve→
Longest Consecutive Sequence 46.7%	MediumM	46.7%	Array Hash Table+1	Solve→
Implement Queue using Stacks 46.7%	EasyE	46.7%	Stack Design+1	Solve→
Search in Rotated Sorted Array 46.7%	MediumM	46.7%	Array Binary Search	Solve→
Binary Search 46.7%	EasyE	46.7%	Array Binary Search	Solve→
Delete Operation for Two Strings 46.7%	MediumM	46.7%	String Dynamic Programming+1	Solve→
Regular Expression Matching 46.7%	HardH	46.7%	String Dynamic Programming+1	Solve→
Concatenation of Array 46.7%	EasyE	46.7%	Array Simulation	Solve→
Reverse Linked List II 46.7%	MediumM	46.7%	Linked List	Solve→
Bulb Switcher 46.7%	MediumM	46.7%	Math Brainteaser	Solve→
Zigzag Conversion 46.7%	MediumM	46.7%	String	Solve→
Candy 46.7%	HardH	46.7%	Array Greedy	Solve→
Permutations 46.7%	MediumM	46.7%	Array Backtracking	Solve→
Max Consecutive Ones III 46.7%	MediumM	46.7%	Array Binary Search+2	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Min Stack 46.7%	MediumM	46.7%	Stack Design	Solve→
Longest Repeating Character Replacement 46.7%	MediumM	46.7%	Hash Table String+1	Solve→
Palindrome Partitioning 46.7%	MediumM	46.7%	String Dynamic Programming+1	Solve→
Peak Index in a Mountain Array 46.7%	MediumM	46.7%	Array Binary Search+1	Solve→
Longest Increasing Path in a Matrix 46.7%	HardH	46.7%	Array Dynamic Programming+7	Solve→
Palindrome Partitioning II 46.7%	HardH	46.7%	String Dynamic Programming	Solve→
Maximum Product Subarray 46.7%	MediumM	46.7%	Array Dynamic Programming	Solve→
Maximum Bags With Full Capacity of Rocks 46.7%	MediumM	46.7%	Array Greedy+1	Solve→
Decode Ways 46.7%	MediumM	46.7%	String Dynamic Programming	Solve→
Integer to Roman 40.2%	MediumM	40.2%	Hash Table Math+1	Solve→
Reverse Nodes in k-Group 40.2%	HardH	40.2%	Linked List Recursion	Solve→
Reverse String 40.2%	EasyE	40.2%	Two Pointers String	Solve→
Maximum Depth of Binary Tree 40.2%	EasyE	40.2%	Tree Depth-First Search+2	Solve→
Subsets 40.2%	MediumM	40.2%	Array Backtracking+1	Solve→
Roman to Integer 40.2%	EasyE	40.2%	Hash Table Math+1	Solve→
Set Matrix Zeroes 40.2%	MediumM	40.2%	Array Hash Table+1	Solve→
Find First and Last Position of Element in Sorted Array 40.2%	MediumM	40.2%	Array Binary Search	Solve→
Linked List Cycle II 40.2%	MediumM	40.2%	Hash Table Linked List+2	Solve→
Find Minimum in Rotated Sorted Array 40.2%	MediumM	40.2%	Array Binary Search	Solve→
Subarrays with K Different Integers 40.2%	HardH	40.2%	Array Hash Table+2	Solve→
Count Pairs That Form a Complete Day I 40.2%	EasyE	40.2%	Array Hash Table+1	Solve→
Minimum Difference in Sums After Removal of Elements 40.2%	HardH	40.2%	Array Dynamic Programming+1	Solve→
Combinations 40.2%	MediumM	40.2%	Backtracking	Solve→
Car Pooling 40.2%	MediumM	40.2%	Array Sorting+3	Solve→
Longest Palindromic Subsequence 40.2%	MediumM	40.2%	String Dynamic Programming	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Wildcard Matching 40.2%	HardH	40.2%	String Dynamic Programming+2	Solve→
Contiguous Array 40.2%	MediumM	40.2%	Array Hash Table+1	Solve→
House Robber II 40.2%	MediumM	40.2%	Array Dynamic Programming	Solve→
N-Queens 40.2%	HardH	40.2%	Array Backtracking+1	Solve→
Contains Duplicate 40.2%	EasyE	40.2%	Array Hash Table+1	Solve→
Jump Game 40.2%	MediumM	40.2%	Array Dynamic Programming+1	Solve→
Largest Number 40.2%	MediumM	40.2%	Array String+2	Solve→
Minimum Path Sum 40.2%	MediumM	40.2%	Array Dynamic Programming+1	Solve→
Maximum Sum Circular Subarray 40.2%	MediumM	40.2%	Array Divide and Conquer+3	Solve→
Missing Number 40.2%	EasyE	40.2%	Array Hash Table+4	Solve→
Minimum Number of Swaps to Make the String Balanced 40.2%	MediumM	40.2%	Two Pointers String+3	Solve→
Best Time to Buy and Sell Stock III 40.2%	HardH	40.2%	Array Dynamic Programming	Solve→
Sqrt(x) 31.3%	EasyE	31.3%	Math Binary Search+1	Solve→
Two Sum II - Input Array Is Sorted 31.3%	MediumM	31.3%	Array Two Pointers+1	Solve→
Rearrange Array Elements by Sign 31.3%	MediumM	31.3%	Array Two Pointers+1	Solve→
Replace Employee ID With The Unique Identifier 31.3%	EasyE	31.3%	Database	Solve→
Find the Index of the First Occurrence in a String 31.3%	EasyE	31.3%	Two Pointers String+4	Solve→
Delete Duplicate Emails 31.3%	EasyE	31.3%	Database	Solve→
Palindrome Linked List 31.3%	EasyE	31.3%	Linked List Two Pointers+2	Solve→
Is Subsequence 31.3%	EasyE	31.3%	Two Pointers String+1	Solve→
Reverse String II 31.3%	EasyE	31.3%	Two Pointers String	Solve→
Count Good Numbers 31.3%	MediumM	31.3%	Math Recursion	Solve→
Delete Node in a BST 31.3%	MediumM	31.3%	Tree Binary Search Tree+1	Solve→
Remove All Occurrences of a Substring 31.3%	MediumM	31.3%	String Stack+1	Solve→
Pow(x, n) 31.3%	MediumM	31.3%	Math Recursion	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Find Sum of Array Product of Magical Sequences 31.3%	HardH	31.3%	Array Math+4	Solve→
Maximum Number of K-Divisible Components 31.3%	HardH	31.3%	Tree Depth-First Search	Solve→
Add Digits 31.3%	EasyE	31.3%	Math Simulation+1	Solve→
Maximum Profit in Job Scheduling 31.3%	HardH	31.3%	Array Binary Search+2	Solve→
Magic Squares In Grid 31.3%	MediumM	31.3%	Array Hash Table+2	Solve→
Triangle 31.3%	MediumM	31.3%	Array Dynamic Programming	Solve→
Substring with Concatenation of All Words 31.3%	HardH	31.3%	Hash Table String+1	Solve→
Reorder List 31.3%	MediumM	31.3%	Linked List Two Pointers+2	Solve→
Number of Different Subsequences GCDs 31.3%	HardH	31.3%	Array Math+4	Solve→
Evaluate Reverse Polish Notation 31.3%	MediumM	31.3%	Array Math+1	Solve→
Largest Rectangle in Histogram 31.3%	HardH	31.3%	Array Stack+2	Solve→
Squares of a Sorted Array 31.3%	EasyE	31.3%	Array Two Pointers+1	Solve→
Add Binary 31.3%	EasyE	31.3%	Math String+2	Solve→
Minimum Operations to Equalize Binary String 31.3%	HardH	31.3%	Math String+3	Solve→
Daily Temperatures 31.3%	MediumM	31.3%	Array Stack+1	Solve→
Longest Valid Parentheses 31.3%	HardH	31.3%	String Dynamic Programming+2	Solve→
Number of Subsequences That Satisfy the Given Sum Condition 31.3%	MediumM	31.3%	Array Two Pointers+2	Solve→
First Missing Positive 31.3%	HardH	31.3%	Array Hash Table	Solve→
Odd Even Linked List 31.3%	MediumM	31.3%	Linked List	Solve→
Sort Colors 31.3%	MediumM	31.3%	Array Two Pointers+3	Solve→
Time Needed to Inform All Employees 31.3%	MediumM	31.3%	Tree Depth-First Search+1	Solve→
Combine Two Tables 31.3%	EasyE	31.3%	Database	Solve→
Majority Element 31.3%	EasyE	31.3%	Array Hash Table+4	Solve→
Merge Strings Alternately 31.3%	EasyE	31.3%	Two Pointers String	Solve→
Maximum OR 31.3%	MediumM	31.3%	Array Greedy+2	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Check if Array Is Sorted and Rotated 31.3%	EasyE	31.3%	Array	Solve→
Minimum Size Subarray Sum 31.3%	MediumM	31.3%	Array Binary Search+2	Solve→
Binary Tree Maximum Path Sum 31.3%	HardH	31.3%	Dynamic Programming Tree+3	Solve→
Search Insert Position 31.3%	EasyE	31.3%	Array Binary Search	Solve→
Partition Labels 31.3%	MediumM	31.3%	Hash Table Two Pointers+2	Solve→
Course Schedule 31.3%	MediumM	31.3%	Depth-First Search Breadth-First Search+3	Solve→
Basic Calculator 31.3%	HardH	31.3%	Math String+2	Solve→
K-diff Pairs in an Array 31.3%	MediumM	31.3%	Array Hash Table+3	Solve→
Reverse Linked List 31.3%	EasyE	31.3%	Linked List Recursion	Solve→
Count of Smaller Numbers After Self 31.3%	HardH	31.3%	Array Binary Search+6	Solve→
Delete and Earn 31.3%	MediumM	31.3%	Array Hash Table+1	Solve→
Maximum Average Subarray I 31.3%	EasyE	31.3%	Array Sliding Window	Solve→
Minimum Total Cost to Process All Elements 31.3%	MediumM	31.3%		Solve→
Symmetric Tree 31.3%	EasyE	31.3%	Tree Depth-First Search+2	Solve→
Number of Flowers in Full Bloom 31.3%	HardH	31.3%	Array Hash Table+4	Solve→
Rising Temperature 31.3%	EasyE	31.3%	Database	Solve→
Sum of Subarray Minimums 31.3%	MediumM	31.3%	Array Dynamic Programming+2	Solve→
Smallest Subsequence of Distinct Characters 31.3%	MediumM	31.3%	String Stack+2	Solve→
Maximum Subarray Min-Product 31.3%	MediumM	31.3%	Array Stack+3	Solve→
Perfect Squares 31.3%	MediumM	31.3%	Math Dynamic Programming+3	Solve→
Remove Element 31.3%	EasyE	31.3%	Array Two Pointers	Solve→
Movie Rating 31.3%	MediumM	31.3%	Database	Solve→
Median of Two Sorted Arrays 31.3%	HardH	31.3%	Array Binary Search+1	Solve→
Asteroid Collision 31.3%	MediumM	31.3%	Array Stack+1	Solve→
Sliding Subarray Beauty 31.3%	MediumM	31.3%	Array Hash Table+1	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Best Time to Buy and Sell Stock with Transaction Fee 31.3%	MediumM	31.3%	Array Dynamic Programming+1	Solve→
Last Stone Weight II 31.3%	MediumM	31.3%	Array Dynamic Programming+2	Solve→
Two City Scheduling 31.3%	MediumM	31.3%	Array Greedy+3	Solve→
Maximum Absolute Sum of Any Subarray 31.3%	MediumM	31.3%	Array Dynamic Programming	Solve→
Minimum Number of Refueling Stops 31.3%	HardH	31.3%	Array Dynamic Programming+2	Solve→
Best Time to Buy and Sell Stock IV 31.3%	HardH	31.3%	Array Dynamic Programming	Solve→
Coin Change II 31.3%	MediumM	31.3%	Array Dynamic Programming+2	Solve→
Split a String in Balanced Strings 31.3%	EasyE	31.3%	String Greedy+1	Solve→
Maximize Sum Of Array After K Negations 31.3%	EasyE	31.3%	Array Greedy+1	Solve→
Stone Game IV 31.3%	HardH	31.3%	Math Dynamic Programming+5	Solve→
Count of Range Sum 31.3%	HardH	31.3%	Array Binary Search+6	Solve→
Integer Break 31.3%	MediumM	31.3%	Math Dynamic Programming	Solve→
3Sum Closest 31.3%	MediumM	31.3%	Array Two Pointers+1	Solve→
Letter Combinations of a Phone Number 31.3%	MediumM	31.3%	Hash Table String+1	Solve→
Continuous Subarray Sum 31.3%	MediumM	31.3%	Array Hash Table+3	Solve→
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit 31.3%	MediumM	31.3%	Array Queue+4	Solve→
Minimum Moves to Equal Array Elements 31.3%	MediumM	31.3%	Array Math	Solve→
Burst Balloons 31.3%	HardH	31.3%	Array Dynamic Programming	Solve→
Minimum Cost to Move Chips to The Same Position 31.3%	EasyE	31.3%	Array Math+1	Solve→
Longest Subsequence With Non-Zero Bitwise XOR 31.3%	MediumM	31.3%	Array Bit Manipulation	Solve→
Maximum Units on a Truck 31.3%	EasyE	31.3%	Array Greedy+1	Solve→

Explore company practice sets with a similar number of tagged coding questions.

Frequently Asked Questions

What LeetCode problems are tagged to Infosys?

Our current Infosys practice dataset contains 221 tagged coding problems, including Two Sum, Longest Substring Without Repeating Characters, Best Time to Buy and Sell Stock. The difficulty breakdown is 53 Easy, 117 Medium, and 51 Hard problems.

How should I prepare for a Infosys coding interview?

Focus on the most frequently asked problems first, especially those with high frequency scores. Infosys interviews typically emphasize Array and Dynamic Programming. Practice explaining your thought process while coding.

What is the difficulty level of Infosys coding interviews?

Based on our data, Infosys interviews include 53 Easy (24%), 117 Medium (53%), and 51 Hard (23%) problems.

Ready to ace your Infosys interview?

Join thousands of engineers who landed offers at top tech companies.

Get Started Free

No credit card required

Top Topics at Infosys