Meta
1396 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Find Bottom Left Tree Value | Medium | 8.5% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 2024. Maximize the Confusion of an Exam | Medium | 8.5% | TopicsStringBinary SearchSliding WindowPrefix Sum |
| 3634. Minimum Removals to Balance Array | Medium | 8.5% | TopicsArrayBinary SearchSliding WindowSorting |
| 557. Reverse Words in a String III | Easy | 8.5% | TopicsTwo PointersString |
| 1032. Stream of Characters | Hard | 8.5% | TopicsArrayStringDesignTrieData StreamAho–Corasick Algorithm |
| 1758. Minimum Changes To Make Alternating Binary String | Easy | 8.5% | TopicsString |
| Binary Tree Longest Consecutive Sequence II | Medium | 8.5% | TopicsTreeDepth-First SearchBinary TreeDP on Trees |
| Course Schedule III | Hard | 8.5% | TopicsArrayGreedySortingHeap (Priority Queue) |
| 1914. Cyclically Rotating a Grid | Medium | 8.5% | TopicsArrayMatrixSimulation |
| 1674. Minimum Moves to Make Array Complementary | Medium | 8.5% | TopicsArrayHash TablePrefix Sum |
| 1534. Count Good Triplets | Easy | 8.5% | TopicsArrayEnumeration |
| 1871. Jump Game VII | Medium | 8.5% | TopicsStringDynamic ProgrammingSliding WindowPrefix Sum |
| 3300. Minimum Element After Replacement With Digit Sum | Easy | 8.5% | TopicsArrayMath |
| Construct Quad Tree | Medium | 8.5% | TopicsArrayDivide and ConquerTreeMatrix |
| 2574. Left and Right Sum Differences | Easy | 8.5% | TopicsArrayPrefix Sum |
| 2196. Create Binary Tree From Descriptions | Medium | 8.5% | TopicsArrayHash TableTreeBinary Tree |
| 3689. Maximum Total Subarray Value I | Medium | 8.5% | TopicsArrayGreedy |
| 3558. Number of Ways to Assign Edge Weights I | Medium | 8.5% | TopicsMathTreeDepth-First Search |
| 2089. Find Target Indices After Sorting Array | Easy | 8.5% | TopicsArrayBinary SearchSorting |
| 3737. Count Subarrays With Majority Element I | Medium | 8.5% | TopicsArrayHash TableDivide and ConquerSegment TreeMerge SortCountingPrefix Sum |
| 3699. Number of ZigZag Arrays I | Hard | 8.5% | TopicsDynamic ProgrammingPrefix Sum |
| 3020. Find the Maximum Number of Elements in Subset | Medium | 8.5% | TopicsArrayHash TableEnumeration |
| 1217. Minimum Cost to Move Chips to The Same Position | Easy | 8.5% | TopicsArrayMathGreedy |
| 3532. Path Existence Queries in a Graph I | Medium | 8.5% | TopicsArrayHash TableBinary SearchUnion-FindGraph Theory |
| Count Numbers with Unique Digits | Medium | 8.5% | TopicsMathDynamic ProgrammingBacktracking |
