Leetcode-Premium

KO | EN

gitlite — search

#javascript #hacktoberfest #ai #typescript #llm #android #rust #linux #docker #macos #nodejs #awesome #awesome-list #ios

Leetcode-Premium

(★ 177)

No description available.

File Explorer

Download Latest Version (.zip)

- 1141. 查询最近30天用户活跃数.md
- 1142. 过去30天的用户活跃数II.md
- 1148.文章浏览I.md
- 1149.文章浏览II.md
- 1214.查找两棵二叉搜索树之和.md
- 156. Binary-Tree-Upside-Down.md
- 157. Read-N-Characters-Given-Read4.md
- 158. Read-N-Characters-Given-Read4-II---Call-multiple-times.md
- 159. Longest-Substring-with-At-Most-Two-Distinct-Characters.md
- 161. One-Edit-Distance.md
- 163. Missing-Ranges.md
- 170. Two-Sum-III---Data-structure-design.md
- 186. Reverse-Words-in-a-String-II.md
- 243. Shortest-Word-Distance.md
- 244. Shortest-Word-Distance-II.md
- 245. Shortest-Word-Distance-III.md
- 246. Strobogrammatic-Number.md
- 247. Strobogrammatic-Number-II.md
- 248. Strobogrammatic-Number-III.md
- 249. Group-Shifted-Strings.md
- 250. Count-Univalue-Subtrees.md
- 251. Flatten-2D-Vector.md
- 252. Meeting-Rooms.md
- 253. Meeting-Rooms-II.md
- 254. Factor-Combinations.md
- 255. Verify-Preorder-Sequence-in-Binary-Search-Tree.md
- 256. Paint-House.md
- 259. 3Sum-Smaller.md
- 261. Graph-Valid-Tree.md
- 265. Paint-House-II.md
- 266. Palindrome-Permutation.md
- 267. Palindrome-Permutation-II.md
- 269. Alien-Dictionary.md
- 270. Closest-Binary-Search-Tree-Value.md
- 271. Encode-and-Decode-Strings.md
- 272. Closest-Binary-Search-Tree-Value-II.md
- 276. Paint-Fence.md
- 277. Find-the-Celebrity.md
- 280. Wiggle-Sort.md
- 281. Zigzag-Iterator.md
- 285. Inorder-Successor-in-BST.md
- 286. Walls-and-Gates.md
- 288. Unique-Word-Abbreviation.md
- 291. Word-Pattern-II.md
- 293. Flip-Game.md
- 294. Flip-Game-II.md
- 296. Best-Meeting-Point.md
- 298. Binary-Tree-Longest-Consecutive-Sequence.md
- 302. Smallest-Rectangle-Enclosing-Black-Pixels.md
- 305. Number-of-Islands-II.md
- 308. Range-Sum-Query-2D---Mutable.md
- 311. Sparse-Matrix-Multiplication.md
- 314. Binary-Tree-Vertical-Order-Traversal.md
- 317. Shortest-Distance-from-All-Buildings.md
- 320. Generalized-Abbreviation.md
- 323. Number-of-Connected-Components-in-an-Undirected-Graph.md
- 325. Maximum-Size-Subarray-Sum-Equals-k.md
- 333. Largest-BST-Subtree.md
- 339. Nested-List-Weight-Sum.md
- 340. Longest-Substring-with-At-Most-K-Distinct-Characters.md
- 346. Moving-Average-from-Data-Stream.md
- 348. Design-Tic-Tac-Toe.md
- 351. Android-Unlock-Patterns.md
- 353. Design-Snake-Game.md
- 356. Line-Reflection.md
- 358. Rearrange-String-k-Distance-Apart.md
- 359. Logger-Rate-Limiter.md
- 360. Sort-Transformed-Array.md
- 361. Bomb-Enemy.md
- 362. Design-Hit-Counter.md
- 364. Nested-List-Weight-Sum-II.md
- 366. Find-Leaves-of-Binary-Tree.md
- 369. Plus-One-Linked-List.md
- 370. Range-Addition.md
- 379. Design-Phone-Directory.md
- 408. Valid-Word-Abbreviation.md
- 411. Minimum-Unique-Word-Abbreviation.md
- 418. Sentence-Screen-Fitting.md
- 422. Valid-Word-Square.md
- 425. Word-Squares.md
- 439. Ternary-Expression-Parser.md
- 444. Sequence-Reconstruction.md
- 465. Optimal-Account-Balancing.md
- 469. Convex-Polygon.md
- 471. Encode-String-with-Shortest-Length.md
- 484. Find-Permutation.md
- 487. Max-Consecutive-Ones-II.md
- 490. The-Maze.md
- 499. The-Maze-III.md
- 505. The-Maze-II.md
- 527. Word-Abbreviation.md
- 531. Lonely-Pixel-I.md
- 533. Lonely-Pixel-II.md
- 536. Construct-Binary-Tree-from-String.md
- 544. Output-Contest-Matches.md
- 545. Boundary-of-Binary-Tree.md
- 548. Split-Array-with-Equal-Sum.md
- 549. Binary-Tree-Longest-Consecutive-Sequence-II.md
- 555. Split-Concatenated-Strings.md
- 562. Longest-Line-of-Consecutive-One-in-Matrix.md
- 568. Maximum-Vacation-Days.md
- 569. Median-Employee-Salary.md
- 570. Managers-with-at-Least-5-Direct-Reports.md
- 571. Find-Median-Given-Frequency-of-Numbers.md
- 573. Squirrel-Simulation.md
- 574. Winning-Candidate.md
- 577. Employee-Bonus.md
- 578. Get-Highest-Answer-Rate-Question.md
- 579. Find-Cumulative-Salary-of-an-Employee.md
- 580. Count-Student-Number-in-Departments.md
- 582. Kill-Process.md
- 584. Find-Customer-Referee.md
- 585. Investments-in-2016.md
- 586. Customer-Placing-the-Largest-Number-of-Orders.md
- 588. Design-In-Memory-File-System.md
- 597. Friend-Requests-I:-Overall-Acceptance-Rate.md
- 602. Friend-Requests-II:-Who-Has-the-Most-Friends.md
- 603. Consecutive-Available-Seats.md
- 604. Design-Compressed-String-Iterator.md
- 607. Sales-Person.md
- 608. Tree-Node.md
- 610. Triangle-Judgement.md
- 612. Shortest-Distance-in-a-Plane.md
- 613. Shortest-Distance-in-a-Line.md
- 614. Second-Degree-Follower.md
- 615. Average-Salary:-Departments-VS-Company.md
- 616. Add-Bold-Tag-in-String.md
- 618. Students-Report-By-Geography.md
- 619. Biggest-Single-Number.md
- 624. Maximum-Distance-in-Arrays.md
- 625. Minimum-Factorization.md
- 631. Design-Excel-Sum-Formula.md
- 634. Find-the-Derangement-of-An-Array.md
- 635. Design-Log-Storage-System.md
- 642. Design-Search-Autocomplete-System.md
- 644. Maximum-Average-Subarray-II.md
- 651. 4-Keys-Keyboard.md
- 656. Coin-Path.md
- 660. Remove-9.md
- 663. Equal-Tree-Partition.md
- 666. Path-Sum-IV.md
- 681. Next-Closest-Time.md
- 683. K-Empty-Slots.md
- 694. Number-of-Distinct-Islands.md
- 711. Number-of-Distinct-Islands-II.md
- 716. Max-Stack.md
- 723. Candy-Crush.md
- 727. Minimum-Window-Subsequence.md
- 734. Sentence-Similarity.md
- 737. Sentence-Similarity-II.md
- 743. Closest-Leaf-in-a-Binary-Tree.md
- 751. Number-Of-Corner-Rectangles.md
- 752. IP-to-CIDR.md
- 756. Pour-Water.md
- 758. Convert-Binary-Search-Tree-to-Sorted-Doubly-Linked-List.md
- 760. Bold-Words-in-String.md
- 761. Employee-Free-Time.md
- 762. Find-Anagram-Mappings.md
- 765. Serialize-and-Deserialize-N-ary-Tree.md
- 771. Encode-N-ary-Tree-to-Binary-Tree.md
- 785. Basic-Calculator-III.md
- 786. Search-in-a-Sorted-Array-of-Unknown-Size.md
- 788. Minimize-Max-Distance-to-Gas-Station.md
- 791. Split-BST.md
- 818. Similar-RGB-Color.md
- 850. Insert-into-a-Cyclic-Sorted-List.md
- 865. Robot-Room-Cleaner.md
.gitignore
README.md

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Leetcode-Premium

| **id** | **title** | **Difficulty** | **Python** |
| ------ | --------- | -------------- | ---------- |
|  1 | [156. Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/156.%20Binary-Tree-Upside-Down.md) |
|  2 | [157. Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/157.%20Read-N-Characters-Given-Read4.md) |
|  3 | [158. Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/158.%20Read-N-Characters-Given-Read4-II---Call-multiple-times.md) |
|  4 | [159. Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/159.%20Longest-Substring-with-At-Most-Two-Distinct-Characters.md) |
|  5 | [161. One Edit Distance](https://leetcode.com/problems/one-edit-distance/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/161.%20One-Edit-Distance.md) |
|  6 | [163. Missing Ranges](https://leetcode.com/problems/missing-ranges/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/163.%20Missing-Ranges.md) |
|  7 | [170. Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/170.%20Two-Sum-III---Data-structure-design.md) |
|  8 | [186. Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/186.%20Reverse-Words-in-a-String-II.md) |
|  9 | [243. Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/243.%20Shortest-Word-Distance.md) |
|  10 | [244. Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/244.%20Shortest-Word-Distance-II.md) |
|  11 | [245. Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/245.%20Shortest-Word-Distance-III.md) |
|  12 | [246. Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/246.%20Strobogrammatic-Number.md) |
|  13 | [247. Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/247.%20Strobogrammatic-Number-II.md) |
|  14 | [248. Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/248.%20Strobogrammatic-Number-III.md) |
|  15 | [249. Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/249.%20Group-Shifted-Strings.md) |
|  16 | [250. Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/250.%20Count-Univalue-Subtrees.md) |
|  17 | [251. Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/251.%20Flatten-2D-Vector.md) |
|  18 | [252. Meeting Rooms](https://leetcode.com/problems/meeting-rooms/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/252.%20Meeting-Rooms.md) |
|  19 | [253. Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/253.%20Meeting-Rooms-II.md) |
|  20 | [254. Factor Combinations](https://leetcode.com/problems/factor-combinations/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/254.%20Factor-Combinations.md) |
|  21 | [255. Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/255.%20Verify-Preorder-Sequence-in-Binary-Search-Tree.md) |
|  22 | [256. Paint House](https://leetcode.com/problems/paint-house/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/256.%20Paint-House.md) |
|  23 | [259. 3Sum Smaller](https://leetcode.com/problems/3sum-smaller/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/259.%203Sum-Smaller.md) |
|  24 | [261. Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/261.%20Graph-Valid-Tree.md) |
|  25 | [265. Paint House II](https://leetcode.com/problems/paint-house-ii/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/265.%20Paint-House-II.md) |
|  26 | [266. Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/266.%20Palindrome-Permutation.md) |
|  27 | [267. Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/267.%20Palindrome-Permutation-II.md) |
|  28 | [269. Alien Dictionary](https://leetcode.com/problems/alien-dictionary/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/269.%20Alien-Dictionary.md) |
|  29 | [270. Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/270.%20Closest-Binary-Search-Tree-Value.md) |
|  30 | [271. Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/271.%20Encode-and-Decode-Strings.md) |
|  31 | [272. Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/272.%20Closest-Binary-Search-Tree-Value-II.md) |
|  32 | [276. Paint Fence](https://leetcode.com/problems/paint-fence/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/276.%20Paint-Fence.md) |
|  33 | [277. Find the Celebrity](https://leetcode.com/problems/find-the-celebrity/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/277.%20Find-the-Celebrity.md) |
|  34 | [280. Wiggle Sort](https://leetcode.com/problems/wiggle-sort/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/280.%20Wiggle-Sort.md) |
|  35 | [281. Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/281.%20Zigzag-Iterator.md) |
|  36 | [285. Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/285.%20Inorder-Successor-in-BST.md) |
|  37 | [286. Walls and Gates](https://leetcode.com/problems/walls-and-gates/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/286.%20Walls-and-Gates.md) |
|  38 | [288. Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/288.%20Unique-Word-Abbreviation.md) |
|  39 | [291. Word Pattern II](https://leetcode.com/problems/word-pattern-ii/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/291.%20Word-Pattern-II.md) |
|  40 | [293. Flip Game](https://leetcode.com/problems/flip-game/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/293.%20Flip-Game.md) |
|  41 | [294. Flip Game II](https://leetcode.com/problems/flip-game-ii/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/294.%20Flip-Game-II.md) |
|  42 | [296. Best Meeting Point](https://leetcode.com/problems/best-meeting-point/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/296.%20Best-Meeting-Point.md) |
|  43 | [298. Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/298.%20Binary-Tree-Longest-Consecutive-Sequence.md) |
|  44 | [302. Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/302.%20Smallest-Rectangle-Enclosing-Black-Pixels.md) |
|  45 | [305. Number of Islands II](https://leetcode.com/problems/number-of-islands-ii/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/305.%20Number-of-Islands-II.md) |
|  46 | [308. Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/308.%20Range-Sum-Query-2D---Mutable.md) |
|  47 | [311. Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/311.%20Sparse-Matrix-Multiplication.md) |
|  48 | [314. Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/314.%20Binary-Tree-Vertical-Order-Traversal.md) |
|  49 | [317. Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/317.%20Shortest-Distance-from-All-Buildings.md) |
|  50 | [320. Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/320.%20Generalized-Abbreviation.md) |
|  51 | [323. Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/323.%20Number-of-Connected-Components-in-an-Undirected-Graph.md) |
|  52 | [325. Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/325.%20Maximum-Size-Subarray-Sum-Equals-k.md) |
|  53 | [333. Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/333.%20Largest-BST-Subtree.md) |
|  54 | [339. Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/339.%20Nested-List-Weight-Sum.md) |
|  55 | [340. Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/340.%20Longest-Substring-with-At-Most-K-Distinct-Characters.md) |
|  56 | [346. Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/346.%20Moving-Average-from-Data-Stream.md) |
|  57 | [348. Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/348.%20Design-Tic-Tac-Toe.md) |
|  58 | [351. Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/351.%20Android-Unlock-Patterns.md) |
|  59 | [353. Design Snake Game](https://leetcode.com/problems/design-snake-game/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/353.%20Design-Snake-Game.md) |
|  60 | [356. Line Reflection](https://leetcode.com/problems/line-reflection/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/356.%20Line-Reflection.md) |
|  61 | [358. Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/358.%20Rearrange-String-k-Distance-Apart.md) |
|  62 | [359. Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/359.%20Logger-Rate-Limiter.md) |
|  63 | [360. Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/360.%20Sort-Transformed-Array.md) |
|  64 | [361. Bomb Enemy](https://leetcode.com/problems/bomb-enemy/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/361.%20Bomb-Enemy.md) |
|  65 | [362. Design Hit Counter](https://leetcode.com/problems/design-hit-counter/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/362.%20Design-Hit-Counter.md) |
|  66 | [364. Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/364.%20Nested-List-Weight-Sum-II.md) |
|  67 | [366. Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/366.%20Find-Leaves-of-Binary-Tree.md) |
|  68 | [369. Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/369.%20Plus-One-Linked-List.md) |
|  69 | [370. Range Addition](https://leetcode.com/problems/range-addition/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/370.%20Range-Addition.md) |
|  70 | [379. Design Phone Directory](https://leetcode.com/problems/design-phone-directory/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/379.%20Design-Phone-Directory.md) |
|  71 | [408. Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/408.%20Valid-Word-Abbreviation.md) |
|  72 | [411. Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/411.%20Minimum-Unique-Word-Abbreviation.md) |
|  73 | [418. Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/418.%20Sentence-Screen-Fitting.md) |
|  74 | [422. Valid Word Square](https://leetcode.com/problems/valid-word-square/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/422.%20Valid-Word-Square.md) |
|  75 | [425. Word Squares](https://leetcode.com/problems/word-squares/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/425.%20Word-Squares.md) |
|  76 | [439. Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/439.%20Ternary-Expression-Parser.md) |
|  77 | [444. Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/444.%20Sequence-Reconstruction.md) |
|  78 | [465. Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/465.%20Optimal-Account-Balancing.md) |
|  79 | [469. Convex Polygon](https://leetcode.com/problems/convex-polygon/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/469.%20Convex-Polygon.md) |
|  80 | [471. Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/471.%20Encode-String-with-Shortest-Length.md) |
|  81 | [484. Find Permutation](https://leetcode.com/problems/find-permutation/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/484.%20Find-Permutation.md) |
|  82 | [487. Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/487.%20Max-Consecutive-Ones-II.md) |
|  83 | [490. The Maze](https://leetcode.com/problems/the-maze/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/490.%20The-Maze.md) |
|  84 | [499. The Maze III](https://leetcode.com/problems/the-maze-iii/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/499.%20The-Maze-III.md) |
|  85 | [505. The Maze II](https://leetcode.com/problems/the-maze-ii/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/505.%20The-Maze-II.md) |
|  86 | [527. Word Abbreviation](https://leetcode.com/problems/word-abbreviation/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/527.%20Word-Abbreviation.md) |
|  87 | [531. Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/531.%20Lonely-Pixel-I.md) |
|  88 | [533. Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/533.%20Lonely-Pixel-II.md) |
|  89 | [536. Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/536.%20Construct-Binary-Tree-from-String.md) |
|  90 | [544. Output Contest Matches](https://leetcode.com/problems/output-contest-matches/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/544.%20Output-Contest-Matches.md) |
|  91 | [545. Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/545.%20Boundary-of-Binary-Tree.md) |
|  92 | [548. Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/548.%20Split-Array-with-Equal-Sum.md) |
|  93 | [549. Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/549.%20Binary-Tree-Longest-Consecutive-Sequence-II.md) |
|  94 | [555. Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/555.%20Split-Concatenated-Strings.md) |
|  95 | [562. Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/562.%20Longest-Line-of-Consecutive-One-in-Matrix.md) |
|  96 | [568. Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/568.%20Maximum-Vacation-Days.md) |
|  97 | [569. Median Employee Salary](https://leetcode.com/problems/median-employee-salary/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/569.%20Median-Employee-Salary.md) |
|  98 | [570. Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/570.%20Managers-with-at-Least-5-Direct-Reports.md) |
|  99 | [571. Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/571.%20Find-Median-Given-Frequency-of-Numbers.md) |
|  100 | [573. Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/573.%20Squirrel-Simulation.md) |
|  101 | [574. Winning Candidate](https://leetcode.com/problems/winning-candidate/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/574.%20Winning-Candidate.md) |
|  102 | [577. Employee Bonus](https://leetcode.com/problems/employee-bonus/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/577.%20Employee-Bonus.md) |
|  103 | [578. Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/578.%20Get-Highest-Answer-Rate-Question.md) |
|  104 | [579. Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/579.%20Find-Cumulative-Salary-of-an-Employee.md) |
|  105 | [580. Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/580.%20Count-Student-Number-in-Departments.md) |
|  106 | [582. Kill Process](https://leetcode.com/problems/kill-process/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/582.%20Kill-Process.md) |
|  107 | [584. Find Customer Referee](https://leetcode.com/problems/find-customer-referee/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/584.%20Find-Customer-Referee.md) |
|  108 | [585. Investments in 2016](https://leetcode.com/problems/investments-in-2016/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/585.%20Investments-in-2016.md) |
|  109 | [586. Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/586.%20Customer-Placing-the-Largest-Number-of-Orders.md) |
|  110 | [588. Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/588.%20Design-In-Memory-File-System.md) |
|  111 | [597. Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/597.%20Friend-Requests-I:-Overall-Acceptance-Rate.md) |
|  112 | [602. Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/602.%20Friend-Requests-II:-Who-Has-the-Most-Friends.md) |
|  113 | [603. Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/603.%20Consecutive-Available-Seats.md) |
|  114 | [604. Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/604.%20Design-Compressed-String-Iterator.md) |
|  115 | [607. Sales Person](https://leetcode.com/problems/sales-person/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/607.%20Sales-Person.md) |
|  116 | [608. Tree Node](https://leetcode.com/problems/tree-node/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/608.%20Tree-Node.md) |
|  117 | [610. Triangle Judgement](https://leetcode.com/problems/triangle-judgement/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/610.%20Triangle-Judgement.md) |
|  118 | [612. Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/612.%20Shortest-Distance-in-a-Plane.md) |
|  119 | [613. Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/613.%20Shortest-Distance-in-a-Line.md) |
|  120 | [614. Second Degree Follower](https://leetcode.com/problems/second-degree-follower/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/614.%20Second-Degree-Follower.md) |
|  121 | [615. Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/615.%20Average-Salary:-Departments-VS-Company.md) |
|  122 | [616. Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/616.%20Add-Bold-Tag-in-String.md) |
|  123 | [618. Students Report By Geography](https://leetcode.com/problems/students-report-by-geography/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/618.%20Students-Report-By-Geography.md) |
|  124 | [619. Biggest Single Number](https://leetcode.com/problems/biggest-single-number/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/619.%20Biggest-Single-Number.md) |
|  125 | [624. Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/624.%20Maximum-Distance-in-Arrays.md) |
|  126 | [625. Minimum Factorization](https://leetcode.com/problems/minimum-factorization/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/625.%20Minimum-Factorization.md) |
|  127 | [631. Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/631.%20Design-Excel-Sum-Formula.md) |
|  128 | [634. Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/634.%20Find-the-Derangement-of-An-Array.md) |
|  129 | [635. Design Log Storage System](https://leetcode.com/problems/design-log-storage-system/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/635.%20Design-Log-Storage-System.md) |
|  130 | [642. Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/642.%20Design-Search-Autocomplete-System.md) |
|  131 | [644. Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/644.%20Maximum-Average-Subarray-II.md) |
|  132 | [651. 4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/651.%204-Keys-Keyboard.md) |
|  133 | [656. Coin Path](https://leetcode.com/problems/coin-path/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/656.%20Coin-Path.md) |
|  134 | [660. Remove 9](https://leetcode.com/problems/remove-9/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/660.%20Remove-9.md) |
|  135 | [663. Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/663.%20Equal-Tree-Partition.md) |
|  136 | [666. Path Sum IV](https://leetcode.com/problems/path-sum-iv/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/666.%20Path-Sum-IV.md) |
|  137 | [681. Next Closest Time](https://leetcode.com/problems/next-closest-time/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/681.%20Next-Closest-Time.md) |
|  138 | [683. K Empty Slots](https://leetcode.com/problems/k-empty-slots/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/683.%20K-Empty-Slots.md) |
|  139 | [694. Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/694.%20Number-of-Distinct-Islands.md) |
|  140 | [711. Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/711.%20Number-of-Distinct-Islands-II.md) |
|  141 | [716. Max Stack](https://leetcode.com/problems/max-stack/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/716.%20Max-Stack.md) |
|  142 | [723. Candy Crush](https://leetcode.com/problems/candy-crush/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/723.%20Candy-Crush.md) |
|  143 | [727. Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/727.%20Minimum-Window-Subsequence.md) |
|  144 | [734. Sentence Similarity](https://leetcode.com/problems/sentence-similarity/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/734.%20Sentence-Similarity.md) |
|  145 | [737. Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/737.%20Sentence-Similarity-II.md) |
|  146 | [743. Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/743.%20Closest-Leaf-in-a-Binary-Tree.md) |
|  147 | [751. Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/751.%20Number-Of-Corner-Rectangles.md) |
|  148 | [752. IP to CIDR](https://leetcode.com/problems/ip-to-cidr/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/752.%20IP-to-CIDR.md) |
|  149 | [756. Pour Water](https://leetcode.com/problems/pour-water/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/756.%20Pour-Water.md) |
|  150 | [758. Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/758.%20Convert-Binary-Search-Tree-to-Sorted-Doubly-Linked-List.md) |
|  151 | [760. Bold Words in String](https://leetcode.com/problems/bold-words-in-string/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/760.%20Bold-Words-in-String.md) |
|  152 | [761. Employee Free Time](https://leetcode.com/problems/employee-free-time/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/761.%20Employee-Free-Time.md) |
|  153 | [762. Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/762.%20Find-Anagram-Mappings.md) |
|  154 | [765. Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/765.%20Serialize-and-Deserialize-N-ary-Tree.md) |
|  155 | [771. Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/771.%20Encode-N-ary-Tree-to-Binary-Tree.md) |
|  156 | [785. Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/785.%20Basic-Calculator-III.md) |
|  157 | [786. Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/786.%20Search-in-a-Sorted-Array-of-Unknown-Size.md) |
|  158 | [788. Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/788.%20Minimize-Max-Distance-to-Gas-Station.md) |
|  159 | [791. Split BST](https://leetcode.com/problems/split-bst/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/791.%20Split-BST.md) |
|  160 | [818. Similar RGB Color](https://leetcode.com/problems/similar-rgb-color/description/) |  Easy | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/818.%20Similar-RGB-Color.md) |
|  161 | [850. Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list/description/) |  Middle | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/850.%20Insert-into-a-Cyclic-Sorted-List.md) |
|  162 | [865. Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner/description/) |  Difficult | [Solution](https://github.com/kongpingfan/Leetcode-Premium/blob/master/note/865.%20Robot-Room-Cleaner.md) |

Leetcode-Premium

File Explorer

Today's picks

Was this content helpful?

Recent Feedback

Leetcode-Premium

File Explorer

Today's picks

Was this content helpful?

Recent Feedback

Download README