Media.net
39 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 3291. Minimum Number of Valid Strings to Form Target I | Medium | 56.9% | TopicsArrayStringBinary SearchDynamic ProgrammingGreedyTrieSegment TreeRolling HashString MatchingHash Function |
| 70. Climbing Stairs | Easy | 56.9% | TopicsMathDynamic ProgrammingMemoization |
| 3. Longest Substring Without Repeating Characters | Medium | 56.9% | TopicsHash TableStringSliding Window |
| 1376. Time Needed to Inform All Employees | Medium | 47.8% | TopicsTreeDepth-First SearchBreadth-First Search |
| Queue Reconstruction by Height | Medium | 47.8% | TopicsArrayBinary Indexed TreeSegment TreeSorting |
| 1994. The Number of Good Subsets | Hard | 47.8% | TopicsArrayHash TableMathDynamic ProgrammingBit ManipulationCountingNumber TheoryBitmaskSieve Theory |
| 827. Making A Large Island | Hard | 47.8% | TopicsArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix |
| Recover Binary Search Tree | Medium | 47.8% | TopicsTreeDepth-First SearchBinary Search TreeBinary Tree |
| 53. Maximum Subarray | Medium | 47.8% | TopicsArrayDivide and ConquerDynamic Programming |
| 121. Best Time to Buy and Sell Stock | Easy | 47.8% | TopicsArrayDynamic Programming |
| 2. Add Two Numbers | Medium | 47.8% | TopicsLinked ListMathRecursion |
| 105. Construct Binary Tree from Preorder and Inorder Traversal | Medium | 47.8% | TopicsArrayHash TableDivide and ConquerTreeBinary Tree |
| 567. Permutation in String | Medium | 47.8% | TopicsHash TableTwo PointersStringSliding Window |
| 1021. Remove Outermost Parentheses | Easy | 47.8% | TopicsStringStackBracket Sequences |
