Salesforce
196 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 3193. Count the Number of Inversions | Hard | 56.9% | TopicsArrayDynamic Programming |
| 740. Delete and Earn | Medium | 56.9% | TopicsArrayHash TableDynamic Programming |
| 761. Special Binary String | Hard | 56.9% | TopicsStringDivide and ConquerSorting |
| 1309. Decrypt String from Alphabet to Integer Mapping | Easy | 56.9% | TopicsString |
| 2068. Check Whether Two Strings are Almost Equivalent | Easy | 54.5% | TopicsHash TableStringCounting |
| 647. Palindromic Substrings | Medium | 54.5% | TopicsTwo PointersStringDynamic Programming |
| Asteroid Collision | Medium | 54.5% | TopicsArrayStackSimulation |
| 2866. Beautiful Towers II | Medium | 54.5% | TopicsArrayStackMonotonic Stack |
| 2865. Beautiful Towers I | Medium | 54.5% | TopicsArrayStackMonotonic Stack |
| 1150. Check If a Number Is Majority Element in a Sorted Array | Easy | 54.5% | TopicsArrayBinary Search |
| 1051. Height Checker | Easy | 54.5% | TopicsArraySortingCounting SortBubble Sort |
| 2946. Matrix Similarity After Cyclic Shifts | Easy | 54.5% | TopicsArrayMathMatrixSimulation |
| Number of Self-Divisible Permutations | Medium | 54.5% | TopicsArrayMathDynamic ProgrammingBacktrackingBit ManipulationNumber TheoryBitmask |
| Maximum Number That Makes Result of Bitwise AND Zero | Medium | 54.5% | TopicsStringGreedySorting |
| 3171. Find Subarray With Bitwise OR Closest to K | Hard | 54.5% | TopicsArrayBinary SearchBit ManipulationSegment Tree |
| Equalize Strings by Adding or Removing Characters at Ends | Medium | 54.5% | TopicsStringBinary SearchDynamic ProgrammingSliding WindowHash Function |
| 3197. Find the Minimum Area to Cover All Ones II | Hard | 54.5% | TopicsArrayMatrixEnumeration |
| 3195. Find the Minimum Area to Cover All Ones I | Medium | 54.5% | TopicsArrayMatrix |
| 3200. Maximum Height of a Triangle | Easy | 54.5% | TopicsArrayEnumeration |
| 1659. Maximize Grid Happiness | Hard | 54.5% | TopicsDynamic ProgrammingBit ManipulationMemoizationBitmask |
| 1701. Average Waiting Time | Medium | 54.5% | TopicsArraySimulation |
| Find the Last Marked Nodes in Tree | Hard | 54.5% | TopicsTreeDepth-First Search |
| 1143. Longest Common Subsequence | Medium | 54.5% | TopicsStringDynamic ProgrammingLongest Common Subsequence |
| 3634. Minimum Removals to Balance Array | Medium | 54.5% | TopicsArrayBinary SearchSliding WindowSorting |
| 855. Exam Room | Medium | 54.5% | TopicsDesignHeap (Priority Queue)Ordered Set |
