Infosys Software Engineer Onsite Coding Questions
37+ questions from real Infosys Software Engineer Onsite Coding rounds, reported by candidates who interviewed there.
What does the Infosys Onsite Coding round test?
The Infosys onsite coding round is the core technical evaluation. Software Engineer candidates typically see 2-3 algorithm and data structure problems. Problems range from medium to hard difficulty, and interviewers evaluate both correctness and code quality.
Top Topics in This Round
Infosys Software Engineer Onsite Coding Questions
#3 Longest Substring Without Repeating Characters
LeetCode #3: Longest Substring Without Repeating Characters. Difficulty: Medium. Topics: Hash Table, String, Sliding Window. Asked at Infosys in the last 6 months.
#1 Two Sum
LeetCode #1: Two Sum. Difficulty: Easy. Topics: Array, Hash Table. Asked at Infosys in the last 6 months.
#560 Subarray Sum Equals K
LeetCode #560: Subarray Sum Equals K. Difficulty: Medium. Topics: Array, Hash Table, Prefix Sum. Asked at Infosys in the last 6 months.
LeetCode #2259: Remove Digit From Number to Maximize Result. Difficulty: Easy. Topics: String, Greedy, Enumeration. Asked at Infosys in the last 6 months.
#134 Gas Station
LeetCode #134: Gas Station. Difficulty: Medium. Topics: Array, Greedy. Asked at Infosys in the last 6 months.
LeetCode #176: Second Highest Salary. Difficulty: Medium. Topics: Database. Asked at Infosys in the last 6 months.
#53 Maximum Subarray
LeetCode #53: Maximum Subarray. Difficulty: Medium. Topics: Array, Divide and Conquer, Dynamic Programming. Asked at Infosys in the last 6 months.
#5 Longest Palindromic Substring
LeetCode #5: Longest Palindromic Substring. Difficulty: Medium. Topics: Two Pointers, String, Dynamic Programming. Asked at Infosys in the last 6 months.
#20 Valid Parentheses
LeetCode #20: Valid Parentheses. Difficulty: Easy. Topics: String, Stack. Asked at Infosys in the last 6 months.
#300 Longest Increasing Subsequence
LeetCode #300: Longest Increasing Subsequence. Difficulty: Medium. Topics: Array, Binary Search, Dynamic Programming. Asked at Infosys in the last 6 months.
#121 Best Time to Buy and Sell Stock
LeetCode #121: Best Time to Buy and Sell Stock. Difficulty: Easy. Topics: Array, Dynamic Programming. Asked at Infosys in the last 6 months.
#322 Coin Change
LeetCode #322: Coin Change. Difficulty: Medium. Topics: Array, Dynamic Programming, Breadth-First Search. Asked at Infosys in the last 6 months.
#198 House Robber
LeetCode #198: House Robber. Difficulty: Medium. Topics: Array, Dynamic Programming. Asked at Infosys in the last 6 months.
#49 Group Anagrams
LeetCode #49: Group Anagrams. Difficulty: Medium. Topics: Array, Hash Table, String, Sorting. Asked at Infosys in the last 6 months.
#14 Longest Common Prefix
LeetCode #14: Longest Common Prefix. Difficulty: Easy. Topics: Array, String, Trie. Asked at Infosys in the last 6 months.
LeetCode #347: Top K Frequent Elements. Difficulty: Medium. Topics: Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect. Asked at Infosys in the last 6 months.
#9 Palindrome Number
LeetCode #9: Palindrome Number. Difficulty: Easy. Topics: Math. Asked at Infosys in the last 6 months.
#516 Longest Palindromic Subsequence
LeetCode #516: Longest Palindromic Subsequence. Difficulty: Medium. Topics: String, Dynamic Programming. Asked at Infosys in the last 6 months.
#2872 Maximum Number of K-Divisible Components
LeetCode #2872: Maximum Number of K-Divisible Components. Difficulty: Hard. Topics: Tree, Depth-First Search. Asked at Infosys in the last 6 months.
#509 Fibonacci Number
LeetCode #509: Fibonacci Number. Difficulty: Easy. Topics: Math, Dynamic Programming, Recursion, Memoization. Asked at Infosys in the last 6 months.
See All 37 Questions from This Round
Full question text, answer context, and frequency data for subscribers.
Get Access