Coursera
9 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1137. N-th Tribonacci Number | Easy | 100% | TopicsMathDynamic ProgrammingMemoization |
| 945. Minimum Increment to Make Array Unique | Medium | 100% | TopicsArrayGreedySortingCounting |
| 780. Reaching Points | Hard | 97.3% | TopicsMathEuclidean AlgorithmGreatest Common Divisor |
| 920. Number of Music Playlists | Hard | 97.3% | TopicsMathDynamic ProgrammingCombinatorics |
| Highest Grade For Each Student | Medium | 97.3% | TopicsDatabase |
| 453. Minimum Moves to Equal Array Elements | Medium | 97.3% | TopicsArrayMath |
| 761. Special Binary String | Hard | 97.3% | TopicsStringDivide and ConquerSorting |
| 1366. Rank Teams by Votes | Medium | 74.7% | TopicsArrayHash TableStringSortingCounting |
| Text Justification | Hard | 65.3% | TopicsArrayStringSimulation |
