Infosys Interview Questions — 100 DSA Problems 99 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Infosys LeetCode questions for software engineering interviews.
Two Sum (EASY) — Array, Hash Table Find Building Where Alice and Bob Can Meet (HARD) — Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Monotonic Stack Minimum Reverse Operations (HARD) — Array, Breadth-First Search, Ordered Set Count the Number of Ideal Arrays (HARD) — Math, Dynamic Programming, Combinatorics, Number Theory Transform Array by Parity (EASY) — Array, Sorting, Counting Maximum Sum of Subsequence With Non-adjacent Elements (HARD) — Array, Divide and Conquer, Dynamic Programming, Segment Tree Eat Pizzas! (MEDIUM) — Array, Greedy, Sorting Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window Determine the Minimum Sum of a k-avoiding Array (MEDIUM) — Math, Greedy Sort the People (EASY) — Array, Hash Table, String, Sorting Number of Beautiful Integers in the Range (HARD) — Math, Dynamic Programming Longest Well-Performing Interval (MEDIUM) — Array, Hash Table, Stack, Monotonic Stack, Prefix Sum Maximum Product After K Increments (MEDIUM) — Array, Greedy, Heap (Priority Queue) Maximum Segment Sum After Removals (HARD) — Array, Union Find, Prefix Sum, Ordered Set Minimum Total Distance Traveled (HARD) — Array, Dynamic Programming, Sorting Minimum Addition to Make Integer Beautiful (MEDIUM) — Math, Greedy Number of Nodes With Value One (MEDIUM) — Tree, Depth-First Search, Breadth-First Search, Binary Tree Can Convert String in K Moves (MEDIUM) — Hash Table, String The Number of Beautiful Subsets (MEDIUM) — Array, Hash Table, Math, Dynamic Programming, Backtracking, Sorting, Combinatorics Stone Game VIII (HARD) — Array, Math, Dynamic Programming, Prefix Sum, Game Theory Maximum Number of Consecutive Values You Can Make (MEDIUM) — Array, Greedy, Sorting Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming Find the Minimum Possible Sum of a Beautiful Array (MEDIUM) — Math, Greedy Valid Parentheses (EASY) — String, Stack Maximize the Minimum Game Score (HARD) — Array, Binary Search, Greedy Largest Number After Mutating Substring (MEDIUM) — Array, String, Greedy Find the Number of Subsequences With Equal GCD (HARD) — Array, Math, Dynamic Programming, Number Theory Merge Sorted Array (EASY) — Array, Two Pointers, Sorting Next Permutation (MEDIUM) — Array, Two Pointers Palindrome Number (EASY) — Math Remove Duplicates from Sorted Array (EASY) — Array, Two Pointers Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming Reverse String (EASY) — Two Pointers, String Longest Common Prefix (EASY) — String, Trie Rotate Image (MEDIUM) — Array, Math, Matrix Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack Second Highest Salary (MEDIUM) — Database Valid Anagram (EASY) — Hash Table, String, Sorting Product of Array Except Self (MEDIUM) — Array, Prefix Sum Fibonacci Number (EASY) — Math, Dynamic Programming, Recursion, Memoization Reverse Integer (MEDIUM) — Math Coin Change (MEDIUM) — Array, Dynamic Programming, Breadth-First Search 3Sum (MEDIUM) — Array, Two Pointers, Sorting Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting Generate Parentheses (MEDIUM) — String, Dynamic Programming, Backtracking Rotate Array (MEDIUM) — Array, Math, Two Pointers Spiral Matrix (MEDIUM) — Array, Matrix, Simulation Merge Intervals (MEDIUM) — Array, Sorting Longest Consecutive Sequence (MEDIUM) — Array, Hash Table, Union Find Reverse Words in a String (MEDIUM) — Two Pointers, String I
Infosys 100 questions tracked 99 with solutions
📊 All Time 100 📅 Last 6 Months 17 🔥 Last 3 Months 3 ⚡ Last 30 Days 2
Sorted highest → lowest frequency ✓ Our Solution = we have a detailed walkthrough
Showing 100 of 100 questions
2 Array Binary Search Stack Binary Indexed Tree +3
3 Array Breadth-First Search Ordered Set
4 Math Dynamic Programming Combinatorics Number Theory
6 Hard Maximum Sum of Subsequence With Non-adjacent Elements ✓ Our Solution Array Divide and Conquer Dynamic Programming Segment Tree
8 Hash Table String Sliding Window
10 Array Hash Table String Sorting
12 Array Hash Table Stack Monotonic Stack +1
13 Array Greedy Heap (Priority Queue)
14 Array Union Find Prefix Sum Ordered Set
15 Array Dynamic Programming Sorting
17 Medium Number of Nodes With Value One
Tree Depth-First Search Breadth-First Search Binary Tree
19 Array Hash Table Math Dynamic Programming +3
20 Array Math Dynamic Programming Prefix Sum +1
23 Medium Find the Minimum Possible Sum of a Beautiful Array ✓ Our Solution Math Greedy
27 Array Math Dynamic Programming Number Theory
32 Array Divide and Conquer Dynamic Programming
36 Array Two Pointers Dynamic Programming Stack +1
40 Math Dynamic Programming Recursion Memoization
42 Array Dynamic Programming Breadth-First Search
44 Array Hash Table String Sorting
45 String Dynamic Programming Backtracking
49 Array Hash Table Union Find
51 Array Divide and Conquer Sorting Heap (Priority Queue) +1
52 Array Divide and Conquer Sorting Heap (Priority Queue) +4
53 Array Two Pointers Binary Search
55 Two Pointers String String Matching
56 Array Two Pointers Simulation
57 Two Pointers String Dynamic Programming
58 Array Depth-First Search Breadth-First Search Union Find +1
59 String Dynamic Programming Backtracking
63 Math Dynamic Programming Memoization
66 Array Hash Table Math Binary Search +2
72 Hash Table String Sliding Window
75 Array Dynamic Programming Greedy
76 Array Backtracking Bit Manipulation
84 Array Hash Table Prefix Sum
86 Tree Depth-First Search Breadth-First Search Binary Tree
88 Array Dynamic Programming Greedy
89 Array Stack Sorting Monotonic Stack
90 Array Binary Search Divide and Conquer
91 String Dynamic Programming
94 Array Two Pointers Binary Search Bit Manipulation
95 Array String Dynamic Programming Backtracking +2
