| 289 | Game of Life | ArrayMatrixSimulation | Medium |
| 290 | Word Pattern | Hash TableString | Easy |
| 292 | Nim Game | MathBrainteaserGame Theory | Easy |
| 295 | Find Median from Data Stream | Two PointersDesignSorting+2 | Hard |
| 297 | Serialize and Deserialize Binary Tree | StringTreeDepth-First Search+3 | Hard |
| 299 | Bulls and Cows | Hash TableStringCounting | Medium |
| 300 | Longest Increasing Subsequence | ArrayBinary SearchDynamic Programming | Medium |
| 301 | Remove Invalid Parentheses | StringBacktrackingBreadth-First Search | Hard |
| 303 | Range Sum Query - Immutable | ArrayDesignPrefix Sum | Easy |
| 304 | Range Sum Query 2D - Immutable | ArrayDesignMatrix+1 | Medium |
| 306 | Additive Number | StringBacktracking | Medium |
| 307 | Range Sum Query - Mutable | ArrayDesignBinary Indexed Tree+1 | Medium |
| 309 | Best Time to Buy and Sell Stock with Cooldown | ArrayDynamic Programming | Medium |
| 310 | Minimum Height Trees | Depth-First SearchBreadth-First SearchGraph+1 | Medium |
| 312 | Burst Balloons | ArrayDynamic Programming | Hard |
| 313 | Super Ugly Number | ArrayMathDynamic Programming | Medium |
| 315 | Count of Smaller Numbers After Self | ArrayBinary SearchDivide and Conquer+4 | Hard |
| 316 | Remove Duplicate Letters | StringStackGreedy+1 | Medium |
| 318 | Maximum Product of Word Lengths | ArrayStringBit Manipulation | Medium |
| 319 | Bulb Switcher | MathBrainteaser | Medium |
| 321 | Create Maximum Number | ArrayTwo PointersStack+2 | Hard |
| 322 | Coin Change | ArrayDynamic ProgrammingBreadth-First Search | Medium |
| 324 | Wiggle Sort II | ArrayDivide and ConquerGreedy+2 | Medium |
| 326 | Power of Three | MathRecursion | Easy |
| 327 | Count of Range Sum | ArrayBinary SearchDivide and Conquer+4 | Hard |
| 328 | Odd Even Linked List | Linked List | Medium |
| 329 | Longest Increasing Path in a Matrix | ArrayDynamic ProgrammingDepth-First Search+5 | Hard |
| 330 | Patching Array | ArrayGreedy | Hard |
| 331 | Verify Preorder Serialization of a Binary Tree | StringStackTree+1 | Medium |
| 332 | Reconstruct Itinerary | Depth-First SearchGraphEulerian Circuit | Hard |
| 334 | Increasing Triplet Subsequence | ArrayGreedy | Medium |
| 335 | Self Crossing | ArrayMathGeometry | Hard |
| 336 | Palindrome Pairs | ArrayHash TableString+1 | Hard |
| 337 | House Robber III | Dynamic ProgrammingTreeDepth-First Search+1 | Medium |
| 338 | Counting Bits | Dynamic ProgrammingBit Manipulation | Easy |
| 341 | Flatten Nested List Iterator | StackTreeDepth-First Search+3 | Medium |
| 342 | Power of Four | MathBit ManipulationRecursion | Easy |
| 343 | Integer Break | MathDynamic Programming | Medium |
| 344 | Reverse String | Two PointersString | Easy |
| 345 | Reverse Vowels of a String | Two PointersString | Easy |
| 347 | Top K Frequent Elements | ArrayHash TableDivide and Conquer+5 | Medium |
| 349 | Intersection of Two Arrays | ArrayHash TableTwo Pointers+2 | Easy |
| 350 | Intersection of Two Arrays II | ArrayHash TableTwo Pointers+2 | Easy |
| 352 | Data Stream as Disjoint Intervals | Binary SearchDesignOrdered Set | Hard |
| 354 | Russian Doll Envelopes | ArrayBinary SearchDynamic Programming+1 | Hard |
| 355 | Design Twitter | Hash TableLinked ListDesign+1 | Medium |
| 357 | Count Numbers with Unique Digits | MathDynamic ProgrammingBacktracking | Medium |
| 363 | Max Sum of Rectangle No Larger Than K | ArrayBinary SearchMatrix+2 | Hard |
| 365 | Water and Jug Problem | MathDepth-First SearchBreadth-First Search | Medium |
| 367 | Valid Perfect Square | MathBinary Search | Easy |