Infosys
254 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 3471. Find the Largest Almost Missing Integer | Easy | 29.8% | TopicsArrayHash Table |
| 118. Pascal's Triangle | Easy | 29.8% | TopicsArrayDynamic Programming |
| Russian Doll Envelopes | Hard | 29.8% | TopicsArrayBinary SearchDynamic ProgrammingSortingLongest Increasing Subsequence |
| Rotate Function | Medium | 29.8% | TopicsArrayMathDynamic Programming |
| 2370. Longest Ideal Subsequence | Medium | 29.8% | TopicsHash TableStringDynamic Programming |
| 1335. Minimum Difficulty of a Job Schedule | Hard | 29.8% | TopicsArrayDynamic Programming |
| Maximum Sum of 3 Non-Overlapping Subarrays | Hard | 29.8% | TopicsArrayDynamic ProgrammingSliding WindowPrefix Sum |
| 713. Subarray Product Less Than K | Medium | 29.8% | TopicsArrayBinary SearchSliding WindowPrefix Sum |
| 416. Partition Equal Subset Sum | Medium | 29.8% | TopicsArrayDynamic ProgrammingKnapsack Problem0-1 Knapsack |
| 1388. Pizza With 3n Slices | Hard | 29.8% | TopicsArrayDynamic ProgrammingGreedyHeap (Priority Queue) |
| Department Top Three Salaries | Hard | 29.8% | TopicsDatabase |
| 1703. Minimum Adjacent Swaps for K Consecutive Ones | Hard | 29.8% | TopicsArrayGreedySliding WindowPrefix Sum |
| 1827. Minimum Operations to Make the Array Increasing | Easy | 29.8% | TopicsArrayGreedy |
| 1526. Minimum Number of Increments on Subarrays to Form a Target Array | Hard | 29.8% | TopicsArrayDynamic ProgrammingStackGreedyMonotonic Stack |
| 2265. Count Nodes Equal to Average of Subtree | Medium | 29.8% | TopicsTreeDepth-First SearchBinary Tree |
| 309. Best Time to Buy and Sell Stock with Cooldown | Medium | 29.8% | TopicsArrayDynamic Programming |
| 45. Jump Game II | Medium | 29.8% | TopicsArrayDynamic ProgrammingGreedy |
| 621. Task Scheduler | Medium | 29.8% | TopicsArrayHash TableGreedySortingHeap (Priority Queue)Counting |
| 1547. Minimum Cost to Cut a Stick | Hard | 29.8% | TopicsArrayDynamic ProgrammingSorting |
| 1824. Minimum Sideway Jumps | Medium | 29.8% | TopicsArrayDynamic ProgrammingGreedy |
| 1658. Minimum Operations to Reduce X to Zero | Medium | 29.8% | TopicsArrayHash TableBinary SearchSliding WindowPrefix Sum |
| 98. Validate Binary Search Tree | Medium | 29.8% | TopicsTreeDepth-First SearchBinary Search TreeBinary Tree |
| Employees Earning More Than Their Managers | Easy | 29.8% | TopicsDatabase |
| 1027. Longest Arithmetic Subsequence | Medium | 29.8% | TopicsArrayHash TableBinary SearchDynamic Programming |
| Majority Element II | Medium | 29.8% | TopicsArrayHash TableSortingCountingBoyer–Moore Majority Vote Algorithm |
