Preparing Infosys coding questions helps candidates improve their programming, logical thinking, and problem-solving skills for the Infosys recruitment process. These questions are commonly asked in online coding assessments and technical interviews.
- Covers the most frequently asked Infosys coding questions across Easy, Medium, and Hard difficulty levels.
- Helps candidates prepare for Infosys online coding assessments and technical interview rounds with structured practice.
Easy Coding Questions
- Check if an Array Is Sorted
- Count Digits in a Number
- Reverse a String
- Print First N Fibonacci Numbers
- Remove Duplicates from Sorted Array
- Best Time to Buy and Sell Stock (at most one transaction allowed)
- Pair with given Sum (Two Sum)
- Remove duplicates from Sorted Array
- Sentence Palindrome (Palindrome after removing spaces and dots)
- Sort String of Characters
- Program for Addition of Two Matrices
- Binary Search
- Program for Armstrong Numbers
- Area of Rectangle, Right Angled Triangle and Circle
- Program to check if two given matrices are identical
- Convert from Any Base to Decimal
- Celsius to Fahrenheit Conversion
- Print 1 to N Without Using Loops
- Middle of Three
- Binary Representation
- Greatest of Three Numbers
- Number Of Open Doors
- Maximum Possible Sum of Products
- Check if given four points form a square
- Overlapping rectangles
- Sum of all prime numbers between 1 and N
- Check if a number is power of another number
- Common Divisors
- Perfect Number
- Sum Palindrome
- Remove common characters and concatenate
- Check if string is rotated by two places
- Check if Date Is Valid
- The Lazy Caterer's Problem
- Program to Print Sum Triangle for a Given Array
- Party of Couples
- Form largest number from digits
- Print the Left Element
- Tidy Number
- Mean
Medium Coding Questions
- Subarray with Given Sum
- Count Frequencies in an Array
- Merge Two Sorted Arrays (Without Extra Space)
- Longest Palindromic Substring
- Kadane’s Algorithm (Maximum Subarray Sum)
- Allocate minimum number of pages
- Longest Increasing Subsequence
- Next Permutation
- Minimum number of jumps
- Minimize the Heights II
- Find the smallest positive integer value that cannot be represented as sum of any subset of a given array
- Rotate Array
- Minimum Platforms
- House Robber
- Max length chain
- Find the element that appears once in a sorted array
- Job Sequencing Problem
- Minimum Cost Path
- Number of subarrays having sum exactly equal to k
- Generate Parentheses
- Majority Element
- Largest Number formed from an Array
Hard Coding Questions
- 0 - 1 Knapsack Problem
- Longest Common Subsequence
- Edit Distance
- Partition Equal Subset Sum
- Wildcard Pattern Matching
- Form a palindrome
- Matrix Chain Multiplication
- Count Smaller elements
- Minimum number of deletions
- Probability of Knight
- Longest Common Substring
- Max rectangle
- Find all distinct subset (or subsequence) sums
- Detect Cycle in a Linked List