Infosys interview questions¶
The most frequent LeetCode problems tagged to Infosys. This is a data-only page. For process and behavioral prep, use the coding guide and behavioral guide.
Based on 92 distinct problems tagged to Infosys in the last 6 months (34 in the last 30 days, 67 in the last 3 months, 221 all-time) across two open datasets of LeetCode company tags. Tags are user-reported, so treat frequency as a signal, not a promise.
Difficulty mix (last 6 months): Medium 63%, Easy 22%, Hard 15%
Most tagged topics (share of problems): Array 67%, Dynamic Programming 33%, String 24%, Greedy 21%, Math 14%, Sorting 14%, Hash Table 13%, Two Pointers 13%, Binary Search 13%, Prefix Sum 11%
Most frequent problems¶
Ranked by frequency, weighted toward the last 30 days. Classics like Two Sum sit near the top of almost every company's list because users tag them everywhere. Solve those fast. The signature list below is more specific to this company.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Two Sum | Easy | 30 days | Array, Hash Table |
| 2 | Lemonade Change | Easy | 30 days | Array, Greedy |
| 3 | Maximum Subarray | Medium | 30 days | Array, Divide and Conquer, Dynamic Programming |
| 4 | Frog Jump | Hard | 30 days | Array, Dynamic Programming |
| 5 | Best Time to Buy and Sell Stock | Easy | 30 days | Array, Dynamic Programming |
| 6 | Rotting Oranges | Medium | 30 days | Array, Breadth-First Search, Matrix |
| 7 | Climbing Stairs | Easy | 30 days | Math, Dynamic Programming, Memoization |
| 8 | Palindrome Partitioning II | Hard | 30 days | String, Dynamic Programming |
| 9 | Best Time to Buy and Sell Stock II | Medium | 30 days | Array, Dynamic Programming, Greedy |
| 10 | Merge Intervals | Medium | 30 days | Array, Sorting, Quicksort |
| 11 | House Robber | Medium | 30 days | Array, Dynamic Programming |
| 12 | Decode Ways | Medium | 30 days | String, Dynamic Programming |
| 13 | Container With Most Water | Medium | 30 days | Array, Two Pointers, Greedy |
| 14 | Longest Increasing Path in a Matrix | Hard | 30 days | Array, Dynamic Programming, Depth-First Search, Breadth-First Search |
| 15 | Maximum Bags With Full Capacity of Rocks | Medium | 30 days | Array, Greedy, Sorting |
| 16 | Trapping Rain Water | Hard | 30 days | Array, Two Pointers, Dynamic Programming, Stack |
| 17 | Maximum Product Subarray | Medium | 30 days | Array, Dynamic Programming |
| 18 | Best Time to Buy and Sell Stock III | Hard | 30 days | Array, Dynamic Programming |
| 19 | Find Peak Element | Medium | 30 days | Array, Binary Search |
| 20 | Frequency of the Most Frequent Element | Medium | 30 days | Array, Binary Search, Greedy, Sliding Window |
| 21 | Candy | Hard | 30 days | Array, Greedy |
| 22 | Minimum Number of Swaps to Make the String Balanced | Medium | 30 days | Two Pointers, String, Stack, Greedy |
| 23 | Best Time to Buy and Sell Stock IV | Hard | 30 days | Array, Dynamic Programming |
| 24 | Best Time to Buy and Sell Stock with Transaction Fee | Medium | 30 days | Array, Dynamic Programming, Greedy |
| 25 | Count of Range Sum | Hard | 30 days | Array, Binary Search, Divide and Conquer, Binary Indexed Tree |
| 26 | Last Stone Weight II | Medium | 30 days | Array, Dynamic Programming, Knapsack Problem, 0-1 Knapsack |
| 27 | Letter Combinations of a Phone Number | Medium | 30 days | Hash Table, String, Backtracking |
| 28 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 30 days | Array, Queue, Sliding Window, Heap (Priority Queue) |
| 29 | Minimum Cost to Move Chips to The Same Position | Easy | 30 days | Array, Math, Greedy |
| 30 | Minimum Moves to Equal Array Elements | Medium | 30 days | Array, Math |
| 31 | Minimum Number of Refueling Stops | Hard | 30 days | Array, Dynamic Programming, Greedy, Heap (Priority Queue) |
| 32 | Sliding Subarray Beauty | Medium | 30 days | Array, Hash Table, Sliding Window |
| 33 | Split a String in Balanced Strings | Easy | 30 days | String, Greedy, Counting |
| 34 | Stone Game IV | Hard | 30 days | Math, Dynamic Programming, Minimax, Game Theory |
| 35 | Longest Substring Without Repeating Characters | Medium | 3 months | Hash Table, String, Sliding Window |
| 36 | Find the Number of Subsequences With Equal GCD | Hard | 3 months | Array, Math, Dynamic Programming, Number Theory |
| 37 | Number of Islands | Medium | 3 months | Array, Depth-First Search, Breadth-First Search, Union-Find |
| 38 | Koko Eating Bananas | Medium | 3 months | Array, Binary Search |
| 39 | Move Zeroes | Easy | 3 months | Array, Two Pointers |
| 40 | Edit Distance | Medium | 3 months | String, Dynamic Programming |
Signature problems¶
Problems where Infosys accounts for a large share of all recent tags across companies. These are the most Infosys-specific questions in the data.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Lemonade Change | Easy | 30 days | Array, Greedy |
| 2 | Frog Jump | Hard | 30 days | Array, Dynamic Programming |
| 3 | Palindrome Partitioning II | Hard | 30 days | String, Dynamic Programming |
| 4 | Decode Ways | Medium | 30 days | String, Dynamic Programming |
| 5 | Longest Increasing Path in a Matrix | Hard | 30 days | Array, Dynamic Programming, Depth-First Search, Breadth-First Search |
| 6 | Maximum Bags With Full Capacity of Rocks | Medium | 30 days | Array, Greedy, Sorting |
| 7 | Find the Number of Subsequences With Equal GCD | Hard | 3 months | Array, Math, Dynamic Programming, Number Theory |
| 8 | Frequency of the Most Frequent Element | Medium | 30 days | Array, Binary Search, Greedy, Sliding Window |
| 9 | Best Time to Buy and Sell Stock III | Hard | 30 days | Array, Dynamic Programming |
| 10 | Minimum Number of Swaps to Make the String Balanced | Medium | 30 days | Two Pointers, String, Stack, Greedy |
| 11 | Best Time to Buy and Sell Stock IV | Hard | 30 days | Array, Dynamic Programming |
| 12 | Best Time to Buy and Sell Stock with Transaction Fee | Medium | 30 days | Array, Dynamic Programming, Greedy |
| 13 | Count of Range Sum | Hard | 30 days | Array, Binary Search, Divide and Conquer, Binary Indexed Tree |
| 14 | Last Stone Weight II | Medium | 30 days | Array, Dynamic Programming, Knapsack Problem, 0-1 Knapsack |
| 15 | Minimum Cost to Move Chips to The Same Position | Easy | 30 days | Array, Math, Greedy |
| 16 | Minimum Moves to Equal Array Elements | Medium | 30 days | Array, Math |
| 17 | Sliding Subarray Beauty | Medium | 30 days | Array, Hash Table, Sliding Window |
| 18 | Split a String in Balanced Strings | Easy | 30 days | String, Greedy, Counting |
| 19 | Stone Game IV | Hard | 30 days | Math, Dynamic Programming, Minimax, Game Theory |
| 20 | Delete Operation for Two Strings | Medium | 3 months | String, Dynamic Programming, Longest Common Subsequence |
Sources¶
- liquidslr/leetcode-company-wise-problems and snehasishroy/leetcode-companywise-interview-questions, merged by scripts/build_question_data.py.
Next: More companies