Infosys
254 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Longest Consecutive Sequence | Medium | 45% | TopicsArrayHash TableUnion-Find |
| 238. Product of Array Except Self | Medium | 45% | TopicsArrayPrefix Sum |
| Implement Queue using Stacks | Easy | 45% | TopicsStackDesignQueue |
| 704. Binary Search | Easy | 45% | TopicsArrayBinary Search |
| 992. Subarrays with K Different Integers | Hard | 45% | TopicsArrayHash TableSliding WindowCounting |
| 1094. Car Pooling | Medium | 45% | TopicsArraySortingHeap (Priority Queue)SimulationPrefix Sum |
| 10. Regular Expression Matching | Hard | 45% | TopicsStringDynamic ProgrammingRecursion |
| Longest Palindromic Subsequence | Medium | 45% | TopicsStringDynamic Programming |
| Reverse Linked List II | Medium | 45% | TopicsLinked List |
| Bulb Switcher | Medium | 45% | TopicsMathBrainteaser |
| Wildcard Matching | Hard | 45% | TopicsStringDynamic ProgrammingGreedyRecursion |
| 6. Zigzag Conversion | Medium | 45% | TopicsString |
| 213. House Robber II | Medium | 45% | TopicsArrayDynamic Programming |
| 155. Min Stack | Medium | 45% | TopicsStackDesign |
| 918. Maximum Sum Circular Subarray | Medium | 45% | TopicsArrayDivide and ConquerDynamic ProgrammingQueueMonotonic Queue |
| 852. Peak Index in a Mountain Array | Medium | 45% | TopicsArrayBinary SearchTernary Search |
| 329. Longest Increasing Path in a Matrix | Hard | 45% | TopicsArrayDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph TheoryTopological SortMemoizationMatrixDirected Acyclic Graph |
| 2279. Maximum Bags With Full Capacity of Rocks | Medium | 45% | TopicsArrayGreedySorting |
| Asteroid Collision | Medium | 45% | TopicsArrayStackSimulation |
| 1029. Two City Scheduling | Medium | 45% | TopicsArrayGreedySortingHungarian AlgorithmSuccessive Shortest Path Algorithm |
| 91. Decode Ways | Medium | 45% | TopicsStringDynamic Programming |
| Coin Change II | Medium | 45% | TopicsArrayDynamic ProgrammingKnapsack ProblemComplete Knapsack |
| 1710. Maximum Units on a Truck | Easy | 45% | TopicsArrayGreedySorting |
| 983. Minimum Cost For Tickets | Medium | 45% | TopicsArrayDynamic Programming |
| 4. Median of Two Sorted Arrays | Hard | 45% | TopicsArrayBinary SearchDivide and Conquer |
