Infosys
254 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Maximum Average Subarray I | Easy | 29.8% | TopicsArraySliding Window |
| 3987. Minimum Total Cost to Process All Elements | Medium | 29.8% | TopicsArrayMathSimulation |
| 2251. Number of Flowers in Full Bloom | Hard | 29.8% | TopicsArrayHash TableBinary SearchSortingPrefix SumOrdered Set |
| 907. Sum of Subarray Minimums | Medium | 29.8% | TopicsArrayDynamic ProgrammingStackMonotonic Stack |
| 1081. Smallest Subsequence of Distinct Characters | Medium | 29.8% | TopicsStringStackGreedyMonotonic Stack |
| 1856. Maximum Subarray Min-Product | Medium | 29.8% | TopicsArrayStackMonotonic StackPrefix SumCartesian Tree |
| Perfect Squares | Medium | 29.8% | TopicsMathDynamic ProgrammingBreadth-First SearchKnapsack ProblemComplete Knapsack |
| 27. Remove Element | Easy | 29.8% | TopicsArrayTwo Pointers |
| Movie Rating | Medium | 29.8% | TopicsDatabase |
| 2653. Sliding Subarray Beauty | Medium | 29.8% | TopicsArrayHash TableSliding Window |
| 1963. Minimum Number of Swaps to Make the String Balanced | Medium | 29.8% | TopicsTwo PointersStringStackGreedyBracket Sequences |
| 1049. Last Stone Weight II | Medium | 29.8% | TopicsArrayDynamic ProgrammingKnapsack Problem0-1 Knapsack |
| 1749. Maximum Absolute Sum of Any Subarray | Medium | 29.8% | TopicsArrayDynamic Programming |
| 871. Minimum Number of Refueling Stops | Hard | 29.8% | TopicsArrayDynamic ProgrammingGreedyHeap (Priority Queue) |
| 188. Best Time to Buy and Sell Stock IV | Hard | 29.8% | TopicsArrayDynamic Programming |
| 1221. Split a String in Balanced Strings | Easy | 29.8% | TopicsStringGreedyCounting |
| 1005. Maximize Sum Of Array After K Negations | Easy | 29.8% | TopicsArrayGreedySorting |
| 1510. Stone Game IV | Hard | 29.8% | TopicsMathDynamic ProgrammingMinimaxGame TheoryNim GameSprague–Grundy TheoremZero-Sum Game |
| 327. Count of Range Sum | Hard | 29.8% | TopicsArrayBinary SearchDivide and ConquerBinary Indexed TreeSegment TreeMerge SortOrdered SetTreap |
| 3Sum Closest | Medium | 29.8% | TopicsArrayTwo PointersSorting |
| 523. Continuous Subarray Sum | Medium | 29.8% | TopicsArrayHash TableMathPrefix SumPigeonhole Principle |
| 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 29.8% | TopicsArrayQueueSliding WindowHeap (Priority Queue)Ordered SetMonotonic Queue |
| 453. Minimum Moves to Equal Array Elements | Medium | 29.8% | TopicsArrayMath |
| 1217. Minimum Cost to Move Chips to The Same Position | Easy | 29.8% | TopicsArrayMathGreedy |
| 3702. Longest Subsequence With Non-Zero Bitwise XOR | Medium | 29.8% | TopicsArrayBit Manipulation |
