Infosys
254 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Best Time to Buy and Sell Stock with Transaction Fee | Medium | 38.6% | TopicsArrayDynamic ProgrammingGreedy |
| Best Time to Buy and Sell Stock III | Hard | 38.6% | TopicsArrayDynamic Programming |
| Integer Break | Medium | 38.6% | TopicsMathDynamic Programming |
| 17. Letter Combinations of a Phone Number | Medium | 38.6% | TopicsHash TableStringBacktracking |
| 312. Burst Balloons | Hard | 38.6% | TopicsArrayDynamic Programming |
| 1043. Partition Array for Maximum Sum | Medium | 38.6% | TopicsArrayDynamic Programming |
| 1775. Equal Sum Arrays With Minimum Number of Operations | Medium | 38.6% | TopicsArrayHash TableGreedyCounting |
| 146. LRU Cache | Medium | 38.6% | TopicsHash TableLinked ListDesignDoubly-Linked List |
| 1048. Longest String Chain | Medium | 38.6% | TopicsArrayHash TableTwo PointersStringDynamic ProgrammingSorting |
| 1423. Maximum Points You Can Obtain from Cards | Medium | 38.6% | TopicsArraySliding WindowPrefix Sum |
| Two Sum II - Input Array Is Sorted | Medium | 29.8% | TopicsArrayTwo PointersBinary Search |
| 912. Sort an Array | Medium | 29.8% | TopicsArrayDivide and ConquerSortingHeap (Priority Queue)Merge SortBucket SortRadix SortCounting Sort |
| 28. Find the Index of the First Occurrence in a String | Easy | 29.8% | TopicsTwo PointersStringString MatchingZ AlgorithmKnuth–Morris–Pratt AlgorithmBoyer–Moore String-Search Algorithm |
| 13. Roman to Integer | Easy | 29.8% | TopicsHash TableMathString |
| 3184. Count Pairs That Form a Complete Day I | Easy | 29.8% | TopicsArrayHash TableCounting |
| 234. Palindrome Linked List | Easy | 29.8% | TopicsLinked ListTwo PointersStackRecursion |
| Reverse String II | Easy | 29.8% | TopicsTwo PointersString |
| 1922. Count Good Numbers | Medium | 29.8% | TopicsMathRecursion |
| 1910. Remove All Occurrences of a Substring | Medium | 29.8% | TopicsStringStackSimulation |
| Pow(x, n) | Medium | 29.8% | TopicsMathRecursion |
| 3539. Find Sum of Array Product of Magical Sequences | Hard | 29.8% | TopicsArrayMathDynamic ProgrammingBit ManipulationCombinatoricsBitmask |
| 2872. Maximum Number of K-Divisible Components | Hard | 29.8% | TopicsTreeDepth-First Search |
| 258. Add Digits | Easy | 29.8% | TopicsMathSimulationNumber Theory |
| 1235. Maximum Profit in Job Scheduling | Hard | 29.8% | TopicsArrayBinary SearchDynamic ProgrammingSorting |
| 840. Magic Squares In Grid | Medium | 29.8% | TopicsArrayHash TableMathMatrix |
