Salesforce
196 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 127. Word Ladder | Hard | 35.3% | TopicsHash TableStringBreadth-First SearchBidirectional Search |
| 1. Two Sum | Easy | 35.3% | TopicsArrayHash Table |
| 924. Minimize Malware Spread | Hard | 35.3% | TopicsArrayHash TableDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| Number of Divisible Triplet Sums | Medium | 35.3% | TopicsArrayHash Table |
| 79. Word Search | Medium | 35.3% | TopicsArrayStringBacktrackingDepth-First SearchMatrix |
| 53. Maximum Subarray | Medium | 35.3% | TopicsArrayDivide and ConquerDynamic Programming |
| 692. Top K Frequent Words | Medium | 35.3% | TopicsArrayHash TableStringTrieSortingHeap (Priority Queue)Bucket SortCounting |
| Verify Preorder Sequence in Binary Search Tree | Medium | 35.3% | TopicsArrayStackTreeBinary Search TreeRecursionMonotonic StackBinary Tree |
| 329. Longest Increasing Path in a Matrix | Hard | 35.3% | TopicsArrayDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph TheoryTopological SortMemoizationMatrixDirected Acyclic Graph |
| 973. K Closest Points to Origin | Medium | 35.3% | TopicsArrayMathDivide and ConquerGeometrySortingHeap (Priority Queue)QuickselectK-D Tree |
| 767. Reorganize String | Medium | 35.3% | TopicsHash TableStringGreedySortingHeap (Priority Queue)Counting |
| 1944. Number of Visible People in a Queue | Hard | 35.3% | TopicsArrayStackMonotonic Stack |
| 1046. Last Stone Weight | Easy | 35.3% | TopicsArrayHeap (Priority Queue) |
| 1335. Minimum Difficulty of a Job Schedule | Hard | 35.3% | TopicsArrayDynamic Programming |
| 21. Merge Two Sorted Lists | Easy | 35.3% | TopicsLinked ListRecursion |
| 894. All Possible Full Binary Trees | Medium | 35.3% | TopicsDynamic ProgrammingTreeRecursionMemoizationBinary Tree |
| Maximal Rectangle | Hard | 35.3% | TopicsArrayDynamic ProgrammingStackMatrixMonotonic Stack |
| Boundary of Binary Tree | Medium | 35.3% | TopicsTreeDepth-First SearchBinary Tree |
| 332. Reconstruct Itinerary | Hard | 35.3% | TopicsArrayStringDepth-First SearchGraph TheorySortingHeap (Priority Queue)Eulerian CircuitEulerian PathSemi-Eulerian Graph |
| Diameter of N-Ary Tree | Medium | 35.3% | TopicsTreeDepth-First SearchDP on Trees |
| 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 35.3% | TopicsArrayQueueSliding WindowHeap (Priority Queue)Ordered SetMonotonic Queue |
| 1245. Tree Diameter | Medium | 35.3% | TopicsTreeDepth-First SearchBreadth-First SearchGraph TheoryTopological SortDP on Trees |
| 2434. Using a Robot to Print the Lexicographically Smallest String | Medium | 35.3% | TopicsHash TableStringStackGreedy |
| 987. Vertical Order Traversal of a Binary Tree | Hard | 35.3% | TopicsHash TableTreeDepth-First SearchBreadth-First SearchSortingBinary Tree |
| 1962. Remove Stones to Minimize the Total | Medium | 35.3% | TopicsArrayGreedyHeap (Priority Queue) |
