Salesforce
196 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 815. Bus Routes | Hard | 27.6% | TopicsArrayHash TableBreadth-First Search |
| House Robber III | Medium | 27.6% | TopicsDynamic ProgrammingTreeDepth-First SearchBinary TreeDP on Trees |
| Finding the Number of Visible Mountains | Medium | 27.6% | TopicsArrayStackSortingMonotonic Stack |
| 1319. Number of Operations to Make Network Connected | Medium | 27.6% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| Find Duplicate Subtrees | Medium | 27.6% | TopicsHash TableTreeDepth-First SearchBinary Tree |
| Course Schedule III | Hard | 27.6% | TopicsArrayGreedySortingHeap (Priority Queue) |
| 213. House Robber II | Medium | 27.6% | TopicsArrayDynamic Programming |
| 416. Partition Equal Subset Sum | Medium | 27.6% | TopicsArrayDynamic ProgrammingKnapsack Problem0-1 Knapsack |
| 3170. Lexicographically Minimum String After Removing Stars | Medium | 27.6% | TopicsHash TableStringStackGreedyHeap (Priority Queue) |
| 934. Shortest Bridge | Medium | 27.6% | TopicsArrayDepth-First SearchBreadth-First SearchMatrix |
| 54. Spiral Matrix | Medium | 27.6% | TopicsArrayMatrixSimulation |
| 1839. Longest Substring Of All Vowels in Order | Medium | 27.6% | TopicsStringSliding Window |
| 287. Find the Duplicate Number | Medium | 27.6% | TopicsArrayTwo PointersBinary SearchBit ManipulationPigeonhole PrincipleFloyd's Cycle Finding Algorithm |
| 3366. Minimum Array Sum | Medium | 27.6% | TopicsArrayDynamic Programming |
| 105. Construct Binary Tree from Preorder and Inorder Traversal | Medium | 27.6% | TopicsArrayHash TableDivide and ConquerTreeBinary Tree |
| 312. Burst Balloons | Hard | 27.6% | TopicsArrayDynamic Programming |
| Time Taken to Cross the Door | Hard | 27.6% | TopicsArrayQueueSimulation |
| Find K Closest Elements | Medium | 27.6% | TopicsArrayTwo PointersBinary SearchSliding WindowSortingHeap (Priority Queue) |
| Coin Change II | Medium | 27.6% | TopicsArrayDynamic ProgrammingKnapsack ProblemComplete Knapsack |
| 451. Sort Characters By Frequency | Medium | 27.6% | TopicsHash TableStringSortingHeap (Priority Queue)Bucket SortCounting |
| Minimum Window Subsequence | Hard | 27.6% | TopicsStringDynamic ProgrammingSliding Window |
| Range Sum Query 2D - Immutable | Medium | 27.6% | TopicsArrayDesignMatrixPrefix Sum |
| 2035. Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 27.6% | TopicsArrayTwo PointersBinary SearchDynamic ProgrammingBit ManipulationMeet in the MiddleSortingOrdered SetBitmask |
| 560. Subarray Sum Equals K | Medium | 27.6% | TopicsArrayHash TablePrefix Sum |
| 84. Largest Rectangle in Histogram | Hard | 27.6% | TopicsArrayStackMonotonic StackRange Minimum/Maximum Query |
