README.md

# Keep thinking, keep alive
Until 2023-05-14 23:45:33, I have solved **46** / **2688** problems. 

Completion statistic: 
1. JavaScript: 28 
2. Python: 17

Note: :lock: means you need to buy a book from LeetCode

----------------
## LeetCode Solution Table
| ID | Title | Difficulty | JavaScript | Python |
|:---:|:---:|:---:|:---:|:---:|
|1|[Two Sum](https://leetcode.com/problems/two-sum/description/) |Easy|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/1.%20Two%20Sum/twoSum.js)|To Do|
|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/description/) |Medium|To Do|[python](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/2.%20Add%20Two%20Numbers/addTwoNumbers.py)|
|3|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/description/) |Medium|To Do|[python](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/3.%20Longest%20Substring%20Without%20Repeating%20Characters/lengthOfLongestSubstring.py)|
|4|[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/description/) |Hard|To Do|To Do|
|5|[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/description/) |Medium|To Do|To Do|
|6|[Zigzag Conversion](https://leetcode.com/problems/zigzag-conversion/description/) |Medium|To Do|To Do|
|7|[Reverse Integer](https://leetcode.com/problems/reverse-integer/description/) |Medium|To Do|To Do|
|8|[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/description/) |Medium|To Do|To Do|
|9|[Palindrome Number](https://leetcode.com/problems/palindrome-number/description/) |Easy|To Do|To Do|
|10|[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/description/) |Hard|To Do|To Do|
|11|[Container With Most Water](https://leetcode.com/problems/container-with-most-water/description/) |Medium|To Do|To Do|
|12|[Integer to Roman](https://leetcode.com/problems/integer-to-roman/description/) |Medium|To Do|To Do|
|13|[Roman to Integer](https://leetcode.com/problems/roman-to-integer/description/) |Easy|To Do|To Do|
|14|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/description/) |Easy|To Do|To Do|
|15|[3Sum](https://leetcode.com/problems/3sum/description/) |Medium|To Do|[python](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/15.%203Sum/3Sum.py)|
|16|[3Sum Closest](https://leetcode.com/problems/3sum-closest/description/) |Medium|To Do|To Do|
|17|[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/description/) |Medium|To Do|To Do|
|18|[4Sum](https://leetcode.com/problems/4sum/description/) |Medium|To Do|To Do|
|19|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/) |Medium|To Do|To Do|
|20|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/description/) |Easy|To Do|To Do|
|21|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/description/) |Easy|To Do|To Do|
|22|[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/description/) |Medium|To Do|To Do|
|23|[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/description/) |Hard|To Do|To Do|
|24|[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/description/) |Medium|To Do|To Do|
|25|[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/description/) |Hard|To Do|To Do|
|26|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/) |Easy|To Do|To Do|
|27|[Remove Element](https://leetcode.com/problems/remove-element/description/) |Easy|To Do|To Do|
|28|[Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/description/) |Easy|To Do|To Do|
|29|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/description/) |Medium|To Do|To Do|
|30|[Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/description/) |Hard|To Do|To Do|
|31|[Next Permutation](https://leetcode.com/problems/next-permutation/description/) |Medium|To Do|To Do|
|32|[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/description/) |Hard|To Do|To Do|
|33|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/description/) |Medium|To Do|To Do|
|34|[Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/description/) |Medium|To Do|To Do|
|35|[Search Insert Position](https://leetcode.com/problems/search-insert-position/description/) |Easy|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/35.%20Search%20Insert%20Position/SearchInsertPosition.js)|To Do|
|36|[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/description/) |Medium|To Do|To Do|
|37|[Sudoku Solver](https://leetcode.com/problems/sudoku-solver/description/) |Hard|To Do|To Do|
|38|[Count and Say](https://leetcode.com/problems/count-and-say/description/) |Medium|To Do|To Do|
|39|[Combination Sum](https://leetcode.com/problems/combination-sum/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/39.%20Combination%20Sum/CombinationSum.js)|To Do|
|40|[Combination Sum II](https://leetcode.com/problems/combination-sum-ii/description/) |Medium|To Do|To Do|
|41|[First Missing Positive](https://leetcode.com/problems/first-missing-positive/description/) |Hard|To Do|To Do|
|42|[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/description/) |Hard|To Do|To Do|
|43|[Multiply Strings](https://leetcode.com/problems/multiply-strings/description/) |Medium|To Do|To Do|
|44|[Wildcard Matching](https://leetcode.com/problems/wildcard-matching/description/) |Hard|To Do|To Do|
|45|[Jump Game II](https://leetcode.com/problems/jump-game-ii/description/) |Medium|To Do|To Do|
|46|[Permutations](https://leetcode.com/problems/permutations/description/) |Medium|To Do|To Do|
|47|[Permutations II](https://leetcode.com/problems/permutations-ii/description/) |Medium|To Do|To Do|
|48|[Rotate Image](https://leetcode.com/problems/rotate-image/description/) |Medium|To Do|To Do|
|49|[Group Anagrams](https://leetcode.com/problems/group-anagrams/description/) |Medium|To Do|To Do|
|50|[Pow(x, n)](https://leetcode.com/problems/powx-n/description/) |Medium|To Do|To Do|
|51|[N-Queens](https://leetcode.com/problems/n-queens/description/) |Hard|To Do|To Do|
|52|[N-Queens II](https://leetcode.com/problems/n-queens-ii/description/) |Hard|To Do|To Do|
|53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/description/) |Medium|To Do|To Do|
|54|[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/description/) |Medium|To Do|To Do|
|55|[Jump Game](https://leetcode.com/problems/jump-game/description/) |Medium|To Do|To Do|
|56|[Merge Intervals](https://leetcode.com/problems/merge-intervals/description/) |Medium|To Do|To Do|
|57|[Insert Interval](https://leetcode.com/problems/insert-interval/description/) |Medium|To Do|To Do|
|58|[Length of Last Word](https://leetcode.com/problems/length-of-last-word/description/) |Easy|To Do|To Do|
|59|[Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/description/) |Medium|To Do|To Do|
|60|[Permutation Sequence](https://leetcode.com/problems/permutation-sequence/description/) |Hard|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/60.%20Permutation%20Sequence/PermutationSequence.js)|To Do|
|61|[Rotate List](https://leetcode.com/problems/rotate-list/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/61.%20Rotate%20List/RotateList.js)|To Do|
|62|[Unique Paths](https://leetcode.com/problems/unique-paths/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/62.%20Unique%20Paths/UniquePaths.js)|[python](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/62.%20Unique%20Paths/UniquePaths.py)|
|63|[Unique Paths II](https://leetcode.com/problems/unique-paths-ii/description/) |Medium|To Do|To Do|
|64|[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/description/) |Medium|To Do|To Do|
|65|[Valid Number](https://leetcode.com/problems/valid-number/description/) |Hard|To Do|To Do|
|66|[Plus One](https://leetcode.com/problems/plus-one/description/) |Easy|To Do|To Do|
|67|[Add Binary](https://leetcode.com/problems/add-binary/description/) |Easy|To Do|To Do|
|68|[Text Justification](https://leetcode.com/problems/text-justification/description/) |Hard|To Do|To Do|
|69|[Sqrt(x)](https://leetcode.com/problems/sqrtx/description/) |Easy|To Do|To Do|
|70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/description/) |Easy|To Do|To Do|
|71|[Simplify Path](https://leetcode.com/problems/simplify-path/description/) |Medium|To Do|To Do|
|72|[Edit Distance](https://leetcode.com/problems/edit-distance/description/) |Hard|To Do|To Do|
|73|[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/description/) |Medium|To Do|To Do|
|74|[Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/description/) |Medium|To Do|To Do|
|75|[Sort Colors](https://leetcode.com/problems/sort-colors/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/75.%20Sort%20Colors/SortColor.js)|To Do|
|76|[Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/description/) |Hard|To Do|To Do|
|77|[Combinations](https://leetcode.com/problems/combinations/description/) |Medium|To Do|To Do|
|78|[Subsets](https://leetcode.com/problems/subsets/description/) |Medium|To Do|To Do|
|79|[Word Search](https://leetcode.com/problems/word-search/description/) |Medium|To Do|To Do|
|80|[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/description/) |Medium|To Do|To Do|
|81|[Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/description/) |Medium|To Do|To Do|
|82|[Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/description/) |Medium|To Do|To Do|
|83|[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/description/) |Easy|To Do|To Do|
|84|[Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/description/) |Hard|To Do|To Do|
|85|[Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/description/) |Hard|To Do|To Do|
|86|[Partition List](https://leetcode.com/problems/partition-list/description/) |Medium|To Do|To Do|
|87|[Scramble String](https://leetcode.com/problems/scramble-string/description/) |Hard|To Do|To Do|
|88|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/description/) |Easy|To Do|To Do|
|89|[Gray Code](https://leetcode.com/problems/gray-code/description/) |Medium|To Do|To Do|
|90|[Subsets II](https://leetcode.com/problems/subsets-ii/description/) |Medium|To Do|To Do|
|91|[Decode Ways](https://leetcode.com/problems/decode-ways/description/) |Medium|To Do|To Do|
|92|[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/description/) |Medium|To Do|To Do|
|93|[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/description/) |Medium|To Do|To Do|
|94|[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/description/) |Easy|To Do|To Do|
|95|[Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/description/) |Medium|To Do|To Do|
|96|[Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/description/) |Medium|To Do|[python](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/96.%20Unique%20Binary%20Search%20Trees/UniqueBinarySearchTrees.py)|
|97|[Interleaving String](https://leetcode.com/problems/interleaving-string/description/) |Medium|To Do|To Do|
|98|[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/description/) |Medium|To Do|To Do|
|99|[Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/description/) |Medium|To Do|To Do|
|100|[Same Tree](https://leetcode.com/problems/same-tree/description/) |Easy|To Do|To Do|
|101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/description/) |Easy|To Do|To Do|
|102|[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/description/) |Medium|To Do|To Do|
|103|[Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/description/) |Medium|To Do|To Do|
|104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/description/) |Easy|To Do|To Do|
|105|[Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/) |Medium|To Do|To Do|
|106|[Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/description/) |Medium|To Do|[python](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/106.%20Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/ConstructBinaryTreeFromInorderAndPostorderTraversal.py)|
|107|[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/description/) |Medium|To Do|To Do|
|108|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/description/) |Easy|To Do|To Do|
|109|[Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/description/) |Medium|To Do|To Do|
|110|[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/description/) |Easy|To Do|To Do|
|111|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/description/) |Easy|To Do|To Do|
|112|[Path Sum](https://leetcode.com/problems/path-sum/description/) |Easy|To Do|To Do|
|113|[Path Sum II](https://leetcode.com/problems/path-sum-ii/description/) |Medium|To Do|To Do|
|114|[Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/description/) |Medium|To Do|To Do|
|115|[Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/description/) |Hard|To Do|To Do|
|116|[Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/description/) |Medium|To Do|To Do|
|117|[Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/description/) |Medium|To Do|To Do|
|118|[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/description/) |Easy|To Do|To Do|
|119|[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/description/) |Easy|To Do|To Do|
|120|[Triangle](https://leetcode.com/problems/triangle/description/) |Medium|To Do|To Do|
|121|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/) |Easy|To Do|To Do|
|122|[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/) |Medium|To Do|To Do|
|123|[Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/description/) |Hard|To Do|To Do|
|124|[Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/description/) |Hard|To Do|To Do|
|125|[Valid Palindrome](https://leetcode.com/problems/valid-palindrome/description/) |Easy|To Do|To Do|
|126|[Word Ladder II](https://leetcode.com/problems/word-ladder-ii/description/) |Hard|To Do|To Do|
|127|[Word Ladder](https://leetcode.com/problems/word-ladder/description/) |Hard|To Do|To Do|
|128|[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/description/) |Medium|To Do|To Do|
|129|[Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/description/) |Medium|To Do|[python](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/129.%20Sum%20Root%20to%20Leaf%20Numbers/SumRootToLeafNumbers.py)|
|130|[Surrounded Regions](https://leetcode.com/problems/surrounded-regions/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/130.%20Surrounded%20Regions/SurroundedRegions.js)|To Do|
|131|[Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/description/) |Medium|To Do|To Do|
|132|[Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii/description/) |Hard|To Do|To Do|
|133|[Clone Graph](https://leetcode.com/problems/clone-graph/description/) |Medium|To Do|To Do|
|134|[Gas Station](https://leetcode.com/problems/gas-station/description/) |Medium|To Do|To Do|
|135|[Candy](https://leetcode.com/problems/candy/description/) |Hard|To Do|To Do|
|136|[Single Number](https://leetcode.com/problems/single-number/description/) |Easy|To Do|To Do|
|137|[Single Number II](https://leetcode.com/problems/single-number-ii/description/) |Medium|To Do|[python](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/137.%20Single%20Number%20II/SingleNumberII.py)|
|138|[Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/description/) |Medium|To Do|To Do|
|139|[Word Break](https://leetcode.com/problems/word-break/description/) |Medium|To Do|To Do|
|140|[Word Break II](https://leetcode.com/problems/word-break-ii/description/) |Hard|To Do|To Do|
|141|[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/description/) |Easy|To Do|To Do|
|142|[Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/description/) |Medium|To Do|To Do|
|143|[Reorder List](https://leetcode.com/problems/reorder-list/description/) |Medium|To Do|To Do|
|144|[Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/description/) |Easy|To Do|To Do|
|145|[Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/description/) |Easy|To Do|[python](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/145.%20Binary%20Tree%20Postorder%20Traversal/binaryTreePostorderTraversal.py)|
|146|[LRU Cache](https://leetcode.com/problems/lru-cache/description/) |Medium|To Do|To Do|
|147|[Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/description/) |Medium|To Do|To Do|
|148|[Sort List](https://leetcode.com/problems/sort-list/description/) |Medium|To Do|To Do|
|149|[Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/description/) |Hard|To Do|To Do|
|150|[Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/description/) |Medium|To Do|To Do|
|151|[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/description/) |Medium|To Do|[python](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/151.%20Reverse%20Words%20in%20a%20String/ReverseWordsInAString.py)|
|152|[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/description/) |Medium|To Do|To Do|
|153|[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/) |Medium|To Do|To Do|
|154|[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/description/) |Hard|To Do|To Do|
|155|[Min Stack](https://leetcode.com/problems/min-stack/description/) |Medium|To Do|To Do|
|156|[Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down/description/) :lock:|Medium|To Do|To Do|
|157|[Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/description/) :lock:|Easy|To Do|To Do|
|158|[Read N Characters Given read4 II - Call Multiple Times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/description/) :lock:|Hard|To Do|To Do|
|159|[Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/description/) :lock:|Medium|To Do|To Do|
|160|[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/description/) |Easy|To Do|To Do|
|161|[One Edit Distance](https://leetcode.com/problems/one-edit-distance/description/) :lock:|Medium|To Do|To Do|
|162|[Find Peak Element](https://leetcode.com/problems/find-peak-element/description/) |Medium|To Do|To Do|
|163|[Missing Ranges](https://leetcode.com/problems/missing-ranges/description/) :lock:|Easy|To Do|To Do|
|164|[Maximum Gap](https://leetcode.com/problems/maximum-gap/description/) |Hard|To Do|To Do|
|165|[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/description/) |Medium|To Do|To Do|
|166|[Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal/description/) |Medium|To Do|To Do|
|167|[Two Sum II - Input Array Is Sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/) |Medium|To Do|To Do|
|168|[Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/description/) |Easy|To Do|To Do|
|169|[Majority Element](https://leetcode.com/problems/majority-element/description/) |Easy|To Do|To Do|
|170|[Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design/description/) :lock:|Easy|To Do|To Do|
|171|[Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/description/) |Easy|To Do|To Do|
|172|[Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/description/) |Medium|To Do|To Do|
|173|[Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/description/) |Medium|To Do|To Do|
|174|[Dungeon Game](https://leetcode.com/problems/dungeon-game/description/) |Hard|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/174.%20Dungeon%20Game/DungeonGame.js)|To Do|
|175|[Combine Two Tables](https://leetcode.com/problems/combine-two-tables/description/) |Easy|To Do|To Do|
|176|[Second Highest Salary](https://leetcode.com/problems/second-highest-salary/description/) |Medium|To Do|To Do|
|177|[Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary/description/) |Medium|To Do|To Do|
|178|[Rank Scores](https://leetcode.com/problems/rank-scores/description/) |Medium|To Do|To Do|
|179|[Largest Number](https://leetcode.com/problems/largest-number/description/) |Medium|To Do|To Do|
|180|[Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers/description/) |Medium|To Do|To Do|
|181|[Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers/description/) |Easy|To Do|To Do|
|182|[Duplicate Emails](https://leetcode.com/problems/duplicate-emails/description/) |Easy|To Do|To Do|
|183|[Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order/description/) |Easy|To Do|To Do|
|184|[Department Highest Salary](https://leetcode.com/problems/department-highest-salary/description/) |Medium|To Do|To Do|
|185|[Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries/description/) |Hard|To Do|To Do|
|186|[Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii/description/) :lock:|Medium|To Do|To Do|
|187|[Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/description/) |Medium|To Do|To Do|
|188|[Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/description/) |Hard|To Do|To Do|
|189|[Rotate Array](https://leetcode.com/problems/rotate-array/description/) |Medium|To Do|To Do|
|190|[Reverse Bits](https://leetcode.com/problems/reverse-bits/description/) |Easy|To Do|To Do|
|191|[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/description/) |Easy|To Do|To Do|
|192|[Word Frequency](https://leetcode.com/problems/word-frequency/description/) |Medium|To Do|To Do|
|193|[Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers/description/) |Easy|To Do|To Do|
|194|[Transpose File](https://leetcode.com/problems/transpose-file/description/) |Medium|To Do|To Do|
|195|[Tenth Line](https://leetcode.com/problems/tenth-line/description/) |Easy|To Do|To Do|
|196|[Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails/description/) |Easy|To Do|To Do|
|197|[Rising Temperature](https://leetcode.com/problems/rising-temperature/description/) |Easy|To Do|To Do|
|198|[House Robber](https://leetcode.com/problems/house-robber/description/) |Medium|To Do|To Do|
|199|[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/description/) |Medium|To Do|To Do|
|200|[Number of Islands](https://leetcode.com/problems/number-of-islands/description/) |Medium|To Do|To Do|
|201|[Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/description/) |Medium|To Do|To Do|
|202|[Happy Number](https://leetcode.com/problems/happy-number/description/) |Easy|To Do|To Do|
|203|[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/description/) |Easy|To Do|To Do|
|204|[Count Primes](https://leetcode.com/problems/count-primes/description/) |Medium|To Do|To Do|
|205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/description/) |Easy|To Do|To Do|
|206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/description/) |Easy|To Do|To Do|
|207|[Course Schedule](https://leetcode.com/problems/course-schedule/description/) |Medium|To Do|To Do|
|208|[Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/208.%20Implement%20Trie%20(Prefix%20Tree)/ImplementTrie(PrefixTree).js)|To Do|
|209|[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/description/) |Medium|To Do|To Do|
|210|[Course Schedule II](https://leetcode.com/problems/course-schedule-ii/description/) |Medium|To Do|To Do|
|211|[Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/description/) |Medium|To Do|To Do|
|212|[Word Search II](https://leetcode.com/problems/word-search-ii/description/) |Hard|To Do|To Do|
|213|[House Robber II](https://leetcode.com/problems/house-robber-ii/description/) |Medium|To Do|To Do|
|214|[Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome/description/) |Hard|To Do|To Do|
|215|[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/description/) |Medium|To Do|To Do|
|216|[Combination Sum III](https://leetcode.com/problems/combination-sum-iii/description/) |Medium|To Do|To Do|
|217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/description/) |Easy|To Do|To Do|
|218|[The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/description/) |Hard|To Do|To Do|
|219|[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/description/) |Easy|To Do|To Do|
|220|[Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/description/) |Hard|To Do|To Do|
|221|[Maximal Square](https://leetcode.com/problems/maximal-square/description/) |Medium|To Do|To Do|
|222|[Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/description/) |Medium|To Do|To Do|
|223|[Rectangle Area](https://leetcode.com/problems/rectangle-area/description/) |Medium|To Do|To Do|
|224|[Basic Calculator](https://leetcode.com/problems/basic-calculator/description/) |Hard|To Do|To Do|
|225|[Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/description/) |Easy|To Do|To Do|
|226|[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/description/) |Easy|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/226.%20Invert%20Binary%20Tree/InvertBinaryTree.js)|To Do|
|227|[Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/description/) |Medium|To Do|To Do|
|228|[Summary Ranges](https://leetcode.com/problems/summary-ranges/description/) |Easy|To Do|To Do|
|229|[Majority Element II](https://leetcode.com/problems/majority-element-ii/description/) |Medium|To Do|To Do|
|230|[Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/description/) |Medium|To Do|To Do|
|231|[Power of Two](https://leetcode.com/problems/power-of-two/description/) |Easy|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/231.%20Power%20of%20Two/PowerOfTwo.js)|To Do|
|232|[Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/description/) |Easy|To Do|[python](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/232.%20Implement%20Queue%20using%20Stacks/implementQueueUsingStacks.py)|
|233|[Number of Digit One](https://leetcode.com/problems/number-of-digit-one/description/) |Hard|To Do|To Do|
|234|[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/description/) |Easy|To Do|To Do|
|235|[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/description/) |Medium|To Do|To Do|
|236|[Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/description/) |Medium|To Do|[python](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/236.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/LowestCommonAncestorOfABinaryTree.py)|
|237|[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/237.%20Delete%20Node%20in%20a%20Linked%20List/DeleteNodeInALinkedList.js)|To Do|
|238|[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/description/) |Medium|To Do|To Do|
|239|[Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/description/) |Hard|To Do|To Do|
|240|[Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/description/) |Medium|To Do|To Do|
|241|[Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/description/) |Medium|To Do|To Do|
|242|[Valid Anagram](https://leetcode.com/problems/valid-anagram/description/) |Easy|To Do|To Do|
|243|[Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance/description/) :lock:|Easy|To Do|To Do|
|244|[Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii/description/) :lock:|Medium|To Do|To Do|
|245|[Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii/description/) :lock:|Medium|To Do|To Do|
|246|[Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number/description/) :lock:|Easy|To Do|To Do|
|247|[Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii/description/) :lock:|Medium|To Do|To Do|
|248|[Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii/description/) :lock:|Hard|To Do|To Do|
|249|[Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings/description/) :lock:|Medium|To Do|To Do|
|250|[Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees/description/) :lock:|Medium|To Do|To Do|
|251|[Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector/description/) :lock:|Medium|To Do|To Do|
|252|[Meeting Rooms](https://leetcode.com/problems/meeting-rooms/description/) :lock:|Easy|To Do|To Do|
|253|[Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/description/) :lock:|Medium|To Do|To Do|
|254|[Factor Combinations](https://leetcode.com/problems/factor-combinations/description/) :lock:|Medium|To Do|To Do|
|255|[Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/description/) :lock:|Medium|To Do|To Do|
|256|[Paint House](https://leetcode.com/problems/paint-house/description/) :lock:|Medium|To Do|To Do|
|257|[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/description/) |Easy|To Do|To Do|
|258|[Add Digits](https://leetcode.com/problems/add-digits/description/) |Easy|To Do|To Do|
|259|[3Sum Smaller](https://leetcode.com/problems/3sum-smaller/description/) :lock:|Medium|To Do|To Do|
|260|[Single Number III](https://leetcode.com/problems/single-number-iii/description/) |Medium|To Do|To Do|
|261|[Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/description/) :lock:|Medium|To Do|To Do|
|262|[Trips and Users](https://leetcode.com/problems/trips-and-users/description/) |Hard|To Do|To Do|
|263|[Ugly Number](https://leetcode.com/problems/ugly-number/description/) |Easy|To Do|[python](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/263.%20Ugly%20Number/UglyNumber.py)|
|264|[Ugly Number II](https://leetcode.com/problems/ugly-number-ii/description/) |Medium|To Do|To Do|
|265|[Paint House II](https://leetcode.com/problems/paint-house-ii/description/) :lock:|Hard|To Do|To Do|
|266|[Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation/description/) :lock:|Easy|To Do|To Do|
|267|[Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii/description/) :lock:|Medium|To Do|To Do|
|268|[Missing Number](https://leetcode.com/problems/missing-number/description/) |Easy|To Do|To Do|
|269|[Alien Dictionary](https://leetcode.com/problems/alien-dictionary/description/) :lock:|Hard|To Do|To Do|
|270|[Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value/description/) :lock:|Easy|To Do|To Do|
|271|[Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings/description/) :lock:|Medium|To Do|To Do|
|272|[Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii/description/) :lock:|Hard|To Do|To Do|
|273|[Integer to English Words](https://leetcode.com/problems/integer-to-english-words/description/) |Hard|To Do|To Do|
|274|[H-Index](https://leetcode.com/problems/h-index/description/) |Medium|To Do|To Do|
|275|[H-Index II](https://leetcode.com/problems/h-index-ii/description/) |Medium|To Do|To Do|
|276|[Paint Fence](https://leetcode.com/problems/paint-fence/description/) :lock:|Medium|To Do|To Do|
|277|[Find the Celebrity](https://leetcode.com/problems/find-the-celebrity/description/) :lock:|Medium|To Do|To Do|
|278|[First Bad Version](https://leetcode.com/problems/first-bad-version/description/) |Easy|To Do|To Do|
|279|[Perfect Squares](https://leetcode.com/problems/perfect-squares/description/) |Medium|To Do|To Do|
|280|[Wiggle Sort](https://leetcode.com/problems/wiggle-sort/description/) :lock:|Medium|To Do|To Do|
|281|[Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator/description/) :lock:|Medium|To Do|To Do|
|282|[Expression Add Operators](https://leetcode.com/problems/expression-add-operators/description/) |Hard|To Do|To Do|
|283|[Move Zeroes](https://leetcode.com/problems/move-zeroes/description/) |Easy|To Do|[python](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/283.%20Move%20Zeroes/moveZeroes.py)|
|284|[Peeking Iterator](https://leetcode.com/problems/peeking-iterator/description/) |Medium|To Do|To Do|
|285|[Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst/description/) :lock:|Medium|To Do|To Do|
|286|[Walls and Gates](https://leetcode.com/problems/walls-and-gates/description/) :lock:|Medium|To Do|To Do|
|287|[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/description/) |Medium|To Do|To Do|
|288|[Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation/description/) :lock:|Medium|To Do|To Do|
|289|[Game of Life](https://leetcode.com/problems/game-of-life/description/) |Medium|To Do|To Do|
|290|[Word Pattern](https://leetcode.com/problems/word-pattern/description/) |Easy|To Do|To Do|
|291|[Word Pattern II](https://leetcode.com/problems/word-pattern-ii/description/) :lock:|Medium|To Do|To Do|
|292|[Nim Game](https://leetcode.com/problems/nim-game/description/) |Easy|To Do|To Do|
|293|[Flip Game](https://leetcode.com/problems/flip-game/description/) :lock:|Easy|To Do|To Do|
|294|[Flip Game II](https://leetcode.com/problems/flip-game-ii/description/) :lock:|Medium|To Do|To Do|
|295|[Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/description/) |Hard|To Do|To Do|
|296|[Best Meeting Point](https://leetcode.com/problems/best-meeting-point/description/) :lock:|Hard|To Do|To Do|
|297|[Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/description/) |Hard|To Do|To Do|
|298|[Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/description/) :lock:|Medium|To Do|To Do|
|299|[Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/description/) |Medium|To Do|To Do|
|300|[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/300.%20Longest%20Increasing%20Subsequence/LongestIncreasingSubsequence.js)|To Do|
|301|[Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses/description/) |Hard|To Do|To Do|
|302|[Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/description/) :lock:|Hard|To Do|To Do|
|303|[Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/description/) |Easy|To Do|To Do|
|304|[Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/description/) |Medium|To Do|To Do|
|305|[Number of Islands II](https://leetcode.com/problems/number-of-islands-ii/description/) :lock:|Hard|To Do|To Do|
|306|[Additive Number](https://leetcode.com/problems/additive-number/description/) |Medium|To Do|To Do|
|307|[Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/description/) |Medium|To Do|To Do|
|308|[Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable/description/) :lock:|Hard|To Do|To Do|
|309|[Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/description/) |Medium|To Do|To Do|
|310|[Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/description/) |Medium|To Do|To Do|
|311|[Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication/description/) :lock:|Medium|To Do|To Do|
|312|[Burst Balloons](https://leetcode.com/problems/burst-balloons/description/) |Hard|To Do|To Do|
|313|[Super Ugly Number](https://leetcode.com/problems/super-ugly-number/description/) |Medium|To Do|To Do|
|314|[Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/description/) :lock:|Medium|To Do|To Do|
|315|[Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/description/) |Hard|To Do|To Do|
|316|[Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters/description/) |Medium|To Do|To Do|
|317|[Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings/description/) :lock:|Hard|To Do|To Do|
|318|[Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/description/) |Medium|To Do|To Do|
|319|[Bulb Switcher](https://leetcode.com/problems/bulb-switcher/description/) |Medium|To Do|To Do|
|320|[Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation/description/) :lock:|Medium|To Do|To Do|
|321|[Create Maximum Number](https://leetcode.com/problems/create-maximum-number/description/) |Hard|To Do|To Do|
|322|[Coin Change](https://leetcode.com/problems/coin-change/description/) |Medium|To Do|To Do|
|323|[Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/description/) :lock:|Medium|To Do|To Do|
|324|[Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii/description/) |Medium|To Do|To Do|
|325|[Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/description/) :lock:|Medium|To Do|To Do|
|326|[Power of Three](https://leetcode.com/problems/power-of-three/description/) |Easy|To Do|To Do|
|327|[Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/description/) |Hard|To Do|To Do|
|328|[Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/description/) |Medium|To Do|To Do|
|329|[Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/description/) |Hard|To Do|To Do|
|330|[Patching Array](https://leetcode.com/problems/patching-array/description/) |Hard|To Do|To Do|
|331|[Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/description/) |Medium|To Do|To Do|
|332|[Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/description/) |Hard|To Do|To Do|
|333|[Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree/description/) :lock:|Medium|To Do|To Do|
|334|[Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/description/) |Medium|To Do|To Do|
|335|[Self Crossing](https://leetcode.com/problems/self-crossing/description/) |Hard|To Do|To Do|
|336|[Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/description/) |Hard|To Do|To Do|
|337|[House Robber III](https://leetcode.com/problems/house-robber-iii/description/) |Medium|To Do|To Do|
|338|[Counting Bits](https://leetcode.com/problems/counting-bits/description/) |Easy|To Do|To Do|
|339|[Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/description/) :lock:|Medium|To Do|To Do|
|340|[Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/description/) :lock:|Medium|To Do|To Do|
|341|[Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/description/) |Medium|To Do|To Do|
|342|[Power of Four](https://leetcode.com/problems/power-of-four/description/) |Easy|To Do|To Do|
|343|[Integer Break](https://leetcode.com/problems/integer-break/description/) |Medium|To Do|To Do|
|344|[Reverse String](https://leetcode.com/problems/reverse-string/description/) |Easy|To Do|To Do|
|345|[Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/description/) |Easy|To Do|[python](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/345.%20Reverse%20Vowels%20of%20a%20String/reverseVowelsOfAString.py)|
|346|[Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/description/) :lock:|Easy|To Do|To Do|
|347|[Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/description/) |Medium|To Do|To Do|
|348|[Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe/description/) :lock:|Medium|To Do|To Do|
|349|[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/description/) |Easy|To Do|To Do|
|350|[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/description/) |Easy|To Do|To Do|
|351|[Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns/description/) :lock:|Medium|To Do|To Do|
|352|[Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals/description/) |Hard|To Do|To Do|
|353|[Design Snake Game](https://leetcode.com/problems/design-snake-game/description/) :lock:|Medium|To Do|To Do|
|354|[Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes/description/) |Hard|To Do|To Do|
|355|[Design Twitter](https://leetcode.com/problems/design-twitter/description/) |Medium|To Do|To Do|
|356|[Line Reflection](https://leetcode.com/problems/line-reflection/description/) :lock:|Medium|To Do|To Do|
|357|[Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits/description/) |Medium|To Do|To Do|
|358|[Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart/description/) :lock:|Hard|To Do|To Do|
|359|[Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter/description/) :lock:|Easy|To Do|To Do|
|360|[Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array/description/) :lock:|Medium|To Do|To Do|
|361|[Bomb Enemy](https://leetcode.com/problems/bomb-enemy/description/) :lock:|Medium|To Do|To Do|
|362|[Design Hit Counter](https://leetcode.com/problems/design-hit-counter/description/) :lock:|Medium|To Do|To Do|
|363|[Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/description/) |Hard|To Do|To Do|
|364|[Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii/description/) :lock:|Medium|To Do|To Do|
|365|[Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem/description/) |Medium|To Do|To Do|
|366|[Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree/description/) :lock:|Medium|To Do|To Do|
|367|[Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/description/) |Easy|To Do|To Do|
|368|[Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/description/) |Medium|To Do|To Do|
|369|[Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list/description/) :lock:|Medium|To Do|To Do|
|370|[Range Addition](https://leetcode.com/problems/range-addition/description/) :lock:|Medium|To Do|To Do|
|371|[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/description/) |Medium|To Do|To Do|
|372|[Super Pow](https://leetcode.com/problems/super-pow/description/) |Medium|To Do|To Do|
|373|[Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/description/) |Medium|To Do|To Do|
|374|[Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/description/) |Easy|To Do|To Do|
|375|[Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii/description/) |Medium|To Do|To Do|
|376|[Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/description/) |Medium|To Do|To Do|
|377|[Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/description/) |Medium|To Do|To Do|
|378|[Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/description/) |Medium|To Do|To Do|
|379|[Design Phone Directory](https://leetcode.com/problems/design-phone-directory/description/) :lock:|Medium|To Do|To Do|
|380|[Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/380.%20Insert%20Delete%20GetRandom%20O(1)/InsertDeleteGetRandomO(1)Solution.js)|To Do|
|381|[Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/description/) |Hard|To Do|To Do|
|382|[Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/description/) |Medium|To Do|To Do|
|383|[Ransom Note](https://leetcode.com/problems/ransom-note/description/) |Easy|To Do|To Do|
|384|[Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/description/) |Medium|To Do|To Do|
|385|[Mini Parser](https://leetcode.com/problems/mini-parser/description/) |Medium|To Do|To Do|
|386|[Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/description/) |Medium|To Do|To Do|
|387|[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/description/) |Easy|To Do|To Do|
|388|[Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path/description/) |Medium|To Do|To Do|
|389|[Find the Difference](https://leetcode.com/problems/find-the-difference/description/) |Easy|To Do|To Do|
|390|[Elimination Game](https://leetcode.com/problems/elimination-game/description/) |Medium|To Do|To Do|
|391|[Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle/description/) |Hard|To Do|To Do|
|392|[Is Subsequence](https://leetcode.com/problems/is-subsequence/description/) |Easy|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/392.%20Is%20Subsequence/IsSubsequence.js)|To Do|
|393|[UTF-8 Validation](https://leetcode.com/problems/utf-8-validation/description/) |Medium|To Do|To Do|
|394|[Decode String](https://leetcode.com/problems/decode-string/description/) |Medium|To Do|To Do|
|395|[Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/description/) |Medium|To Do|To Do|
|396|[Rotate Function](https://leetcode.com/problems/rotate-function/description/) |Medium|To Do|To Do|
|397|[Integer Replacement](https://leetcode.com/problems/integer-replacement/description/) |Medium|To Do|To Do|
|398|[Random Pick Index](https://leetcode.com/problems/random-pick-index/description/) |Medium|To Do|To Do|
|399|[Evaluate Division](https://leetcode.com/problems/evaluate-division/description/) |Medium|To Do|To Do|
|400|[Nth Digit](https://leetcode.com/problems/nth-digit/description/) |Medium|To Do|To Do|
|401|[Binary Watch](https://leetcode.com/problems/binary-watch/description/) |Easy|To Do|To Do|
|402|[Remove K Digits](https://leetcode.com/problems/remove-k-digits/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/402.%20Remove%20K%20Digits/RemoveKDigits.js)|To Do|
|403|[Frog Jump](https://leetcode.com/problems/frog-jump/description/) |Hard|To Do|To Do|
|404|[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/description/) |Easy|To Do|To Do|
|405|[Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal/description/) |Easy|To Do|To Do|
|406|[Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/406.%20Queue%20Reconstruction%20by%20Height/QueueReconstructionByHeight.js)|To Do|
|407|[Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii/description/) |Hard|To Do|To Do|
|408|[Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation/description/) :lock:|Easy|To Do|To Do|
|409|[Longest Palindrome](https://leetcode.com/problems/longest-palindrome/description/) |Easy|To Do|To Do|
|410|[Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/description/) |Hard|To Do|To Do|
|411|[Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation/description/) :lock:|Hard|To Do|To Do|
|412|[Fizz Buzz](https://leetcode.com/problems/fizz-buzz/description/) |Easy|To Do|To Do|
|413|[Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/description/) |Medium|To Do|To Do|
|414|[Third Maximum Number](https://leetcode.com/problems/third-maximum-number/description/) |Easy|To Do|To Do|
|415|[Add Strings](https://leetcode.com/problems/add-strings/description/) |Easy|To Do|To Do|
|416|[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/description/) |Medium|To Do|To Do|
|417|[Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/description/) |Medium|To Do|To Do|
|418|[Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting/description/) :lock:|Medium|To Do|To Do|
|419|[Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/description/) |Medium|To Do|To Do|
|420|[Strong Password Checker](https://leetcode.com/problems/strong-password-checker/description/) |Hard|To Do|To Do|
|421|[Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/description/) |Medium|To Do|To Do|
|422|[Valid Word Square](https://leetcode.com/problems/valid-word-square/description/) :lock:|Easy|To Do|To Do|
|423|[Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english/description/) |Medium|To Do|To Do|
|424|[Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/description/) |Medium|To Do|To Do|
|425|[Word Squares](https://leetcode.com/problems/word-squares/description/) :lock:|Hard|To Do|To Do|
|432|[All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure/description/) |Hard|To Do|To Do|
|433|[Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation/description/) |Medium|To Do|To Do|
|434|[Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/description/) |Easy|To Do|To Do|
|435|[Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/description/) |Medium|To Do|To Do|
|436|[Find Right Interval](https://leetcode.com/problems/find-right-interval/description/) |Medium|To Do|To Do|
|437|[Path Sum III](https://leetcode.com/problems/path-sum-iii/description/) |Medium|To Do|To Do|
|438|[Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/description/) |Medium|To Do|To Do|
|439|[Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser/description/) :lock:|Medium|To Do|To Do|
|440|[K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/description/) |Hard|To Do|To Do|
|441|[Arranging Coins](https://leetcode.com/problems/arranging-coins/description/) |Easy|To Do|To Do|
|442|[Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/description/) |Medium|To Do|To Do|
|443|[String Compression](https://leetcode.com/problems/string-compression/description/) |Medium|To Do|To Do|
|444|[Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction/description/) :lock:|Medium|To Do|To Do|
|445|[Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/description/) |Medium|To Do|To Do|
|446|[Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence/description/) |Hard|To Do|To Do|
|447|[Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs/description/) |Medium|To Do|To Do|
|448|[Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/description/) |Easy|To Do|To Do|
|449|[Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst/description/) |Medium|To Do|To Do|
|450|[Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/description/) |Medium|To Do|To Do|
|451|[Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/description/) |Medium|To Do|To Do|
|452|[Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/description/) |Medium|To Do|To Do|
|453|[Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/description/) |Medium|To Do|To Do|
|454|[4Sum II](https://leetcode.com/problems/4sum-ii/description/) |Medium|To Do|To Do|
|455|[Assign Cookies](https://leetcode.com/problems/assign-cookies/description/) |Easy|To Do|To Do|
|456|[132 Pattern](https://leetcode.com/problems/132-pattern/description/) |Medium|To Do|To Do|
|457|[Circular Array Loop](https://leetcode.com/problems/circular-array-loop/description/) |Medium|To Do|To Do|
|458|[Poor Pigs](https://leetcode.com/problems/poor-pigs/description/) |Hard|To Do|To Do|
|459|[Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/description/) |Easy|To Do|To Do|
|460|[LFU Cache](https://leetcode.com/problems/lfu-cache/description/) |Hard|To Do|To Do|
|461|[Hamming Distance](https://leetcode.com/problems/hamming-distance/description/) |Easy|To Do|To Do|
|462|[Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/description/) |Medium|To Do|To Do|
|463|[Island Perimeter](https://leetcode.com/problems/island-perimeter/description/) |Easy|To Do|To Do|
|464|[Can I Win](https://leetcode.com/problems/can-i-win/description/) |Medium|To Do|To Do|
|465|[Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing/description/) :lock:|Hard|To Do|To Do|
|466|[Count The Repetitions](https://leetcode.com/problems/count-the-repetitions/description/) |Hard|To Do|To Do|
|467|[Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string/description/) |Medium|To Do|To Do|
|468|[Validate IP Address](https://leetcode.com/problems/validate-ip-address/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/468.%20Validate%20IP%20Address/ValidateIPAddress.js)|To Do|
|469|[Convex Polygon](https://leetcode.com/problems/convex-polygon/description/) :lock:|Medium|To Do|To Do|
|471|[Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length/description/) :lock:|Hard|To Do|To Do|
|472|[Concatenated Words](https://leetcode.com/problems/concatenated-words/description/) |Hard|To Do|To Do|
|473|[Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square/description/) |Medium|To Do|To Do|
|474|[Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes/description/) |Medium|To Do|To Do|
|475|[Heaters](https://leetcode.com/problems/heaters/description/) |Medium|To Do|To Do|
|476|[Number Complement](https://leetcode.com/problems/number-complement/description/) |Easy|To Do|To Do|
|477|[Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/description/) |Medium|To Do|To Do|
|479|[Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product/description/) |Hard|To Do|To Do|
|480|[Sliding Window Median](https://leetcode.com/problems/sliding-window-median/description/) |Hard|To Do|To Do|
|481|[Magical String](https://leetcode.com/problems/magical-string/description/) |Medium|To Do|To Do|
|482|[License Key Formatting](https://leetcode.com/problems/license-key-formatting/description/) |Easy|To Do|To Do|
|483|[Smallest Good Base](https://leetcode.com/problems/smallest-good-base/description/) |Hard|To Do|To Do|
|484|[Find Permutation](https://leetcode.com/problems/find-permutation/description/) :lock:|Medium|To Do|To Do|
|485|[Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/description/) |Easy|To Do|To Do|
|486|[Predict the Winner](https://leetcode.com/problems/predict-the-winner/description/) |Medium|To Do|To Do|
|487|[Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii/description/) :lock:|Medium|To Do|To Do|
|488|[Zuma Game](https://leetcode.com/problems/zuma-game/description/) |Hard|To Do|To Do|
|1643|[Kth Smallest Instructions](https://leetcode.com/problems/kth-smallest-instructions/description/) |Hard|To Do|To Do|
|490|[The Maze](https://leetcode.com/problems/the-maze/description/) :lock:|Medium|To Do|To Do|
|491|[Non-decreasing Subsequences](https://leetcode.com/problems/non-decreasing-subsequences/description/) |Medium|To Do|To Do|
|492|[Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle/description/) |Easy|To Do|To Do|
|493|[Reverse Pairs](https://leetcode.com/problems/reverse-pairs/description/) |Hard|To Do|To Do|
|494|[Target Sum](https://leetcode.com/problems/target-sum/description/) |Medium|To Do|To Do|
|495|[Teemo Attacking](https://leetcode.com/problems/teemo-attacking/description/) |Easy|To Do|To Do|
|496|[Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/description/) |Easy|To Do|To Do|
|498|[Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse/description/) |Medium|To Do|To Do|
|499|[The Maze III](https://leetcode.com/problems/the-maze-iii/description/) :lock:|Hard|To Do|To Do|
|500|[Keyboard Row](https://leetcode.com/problems/keyboard-row/description/) |Easy|To Do|To Do|
|501|[Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree/description/) |Easy|To Do|To Do|
|502|[IPO](https://leetcode.com/problems/ipo/description/) |Hard|To Do|To Do|
|503|[Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii/description/) |Medium|To Do|To Do|
|504|[Base 7](https://leetcode.com/problems/base-7/description/) |Easy|To Do|To Do|
|505|[The Maze II](https://leetcode.com/problems/the-maze-ii/description/) :lock:|Medium|To Do|To Do|
|506|[Relative Ranks](https://leetcode.com/problems/relative-ranks/description/) |Easy|To Do|To Do|
|507|[Perfect Number](https://leetcode.com/problems/perfect-number/description/) |Easy|To Do|To Do|
|508|[Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum/description/) |Medium|To Do|To Do|
|510|[Inorder Successor in BST II](https://leetcode.com/problems/inorder-successor-in-bst-ii/description/) :lock:|Medium|To Do|To Do|
|2031|[Count Subarrays With More Ones Than Zeros](https://leetcode.com/problems/count-subarrays-with-more-ones-than-zeros/description/) :lock:|Medium|To Do|To Do|
|1059|[All Paths from Source Lead to Destination](https://leetcode.com/problems/all-paths-from-source-lead-to-destination/description/) :lock:|Medium|To Do|To Do|
|2036|[Maximum Alternating Subarray Sum](https://leetcode.com/problems/maximum-alternating-subarray-sum/description/) :lock:|Medium|To Do|To Do|
|513|[Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/description/) |Medium|To Do|To Do|
|514|[Freedom Trail](https://leetcode.com/problems/freedom-trail/description/) |Hard|To Do|To Do|
|515|[Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/description/) |Medium|To Do|To Do|
|516|[Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/description/) |Medium|To Do|To Do|
|517|[Super Washing Machines](https://leetcode.com/problems/super-washing-machines/description/) |Hard|To Do|To Do|
|518|[Coin Change II](https://leetcode.com/problems/coin-change-ii/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/518.%20Coin%20Change%202/CoinChange2.js)|To Do|
|1983|[Widest Pair of Indices With Equal Range Sum](https://leetcode.com/problems/widest-pair-of-indices-with-equal-range-sum/description/) :lock:|Medium|To Do|To Do|
|520|[Detect Capital](https://leetcode.com/problems/detect-capital/description/) |Easy|To Do|To Do|
|521|[Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i/description/) |Easy|To Do|To Do|
|522|[Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii/description/) |Medium|To Do|To Do|
|523|[Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/description/) |Medium|To Do|To Do|
|524|[Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/description/) |Medium|To Do|To Do|
|525|[Contiguous Array](https://leetcode.com/problems/contiguous-array/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/525.%20Contiguous%20Array/ContiguousArray.js)|To Do|
|526|[Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement/description/) |Medium|To Do|To Do|
|527|[Word Abbreviation](https://leetcode.com/problems/word-abbreviation/description/) :lock:|Hard|To Do|To Do|
|1721|[Swapping Nodes in a Linked List](https://leetcode.com/problems/swapping-nodes-in-a-linked-list/description/) |Medium|To Do|To Do|
|529|[Minesweeper](https://leetcode.com/problems/minesweeper/description/) |Medium|To Do|To Do|
|530|[Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/description/) |Easy|To Do|To Do|
|531|[Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i/description/) :lock:|Medium|To Do|To Do|
|532|[K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/description/) |Medium|To Do|To Do|
|533|[Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii/description/) :lock:|Medium|To Do|To Do|
|535|[Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl/description/) |Medium|To Do|To Do|
|536|[Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string/description/) :lock:|Medium|To Do|To Do|
|537|[Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication/description/) |Medium|To Do|To Do|
|538|[Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/description/) |Medium|To Do|To Do|
|539|[Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference/description/) |Medium|To Do|To Do|
|540|[Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/description/) |Medium|To Do|To Do|
|541|[Reverse String II](https://leetcode.com/problems/reverse-string-ii/description/) |Easy|To Do|To Do|
|542|[01 Matrix](https://leetcode.com/problems/01-matrix/description/) |Medium|To Do|To Do|
|543|[Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/description/) |Easy|To Do|To Do|
|544|[Output Contest Matches](https://leetcode.com/problems/output-contest-matches/description/) :lock:|Medium|To Do|To Do|
|545|[Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree/description/) :lock:|Medium|To Do|To Do|
|546|[Remove Boxes](https://leetcode.com/problems/remove-boxes/description/) |Hard|To Do|To Do|
|547|[Number of Provinces](https://leetcode.com/problems/number-of-provinces/description/) |Medium|To Do|To Do|
|548|[Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum/description/) :lock:|Hard|To Do|To Do|
|549|[Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii/description/) :lock:|Medium|To Do|To Do|
|1730|[Shortest Path to Get Food](https://leetcode.com/problems/shortest-path-to-get-food/description/) :lock:|Medium|To Do|To Do|
|551|[Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i/description/) |Easy|To Do|To Do|
|552|[Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii/description/) |Hard|To Do|To Do|
|553|[Optimal Division](https://leetcode.com/problems/optimal-division/description/) |Medium|To Do|To Do|
|554|[Brick Wall](https://leetcode.com/problems/brick-wall/description/) |Medium|To Do|To Do|
|555|[Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings/description/) :lock:|Medium|To Do|To Do|
|556|[Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii/description/) |Medium|To Do|To Do|
|557|[Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/description/) |Easy|To Do|To Do|
|560|[Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/description/) |Medium|To Do|To Do|
|561|[Array Partition](https://leetcode.com/problems/array-partition/description/) |Easy|To Do|To Do|
|562|[Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix/description/) :lock:|Medium|To Do|To Do|
|563|[Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/description/) |Easy|To Do|To Do|
|564|[Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome/description/) |Hard|To Do|To Do|
|565|[Array Nesting](https://leetcode.com/problems/array-nesting/description/) |Medium|To Do|To Do|
|566|[Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix/description/) |Easy|To Do|To Do|
|567|[Permutation in String](https://leetcode.com/problems/permutation-in-string/description/) |Medium|To Do|To Do|
|568|[Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days/description/) :lock:|Hard|To Do|To Do|
|569|[Median Employee Salary](https://leetcode.com/problems/median-employee-salary/description/) :lock:|Hard|To Do|To Do|
|570|[Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports/description/) |Medium|To Do|To Do|
|571|[Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers/description/) :lock:|Hard|To Do|To Do|
|572|[Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/description/) |Easy|To Do|To Do|
|573|[Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation/description/) :lock:|Medium|To Do|To Do|
|574|[Winning Candidate](https://leetcode.com/problems/winning-candidate/description/) :lock:|Medium|To Do|To Do|
|575|[Distribute Candies](https://leetcode.com/problems/distribute-candies/description/) |Easy|To Do|To Do|
|576|[Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths/description/) |Medium|To Do|To Do|
|577|[Employee Bonus](https://leetcode.com/problems/employee-bonus/description/) |Easy|To Do|To Do|
|578|[Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question/description/) :lock:|Medium|To Do|To Do|
|579|[Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee/description/) :lock:|Hard|To Do|To Do|
|580|[Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments/description/) :lock:|Medium|To Do|To Do|
|581|[Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/description/) |Medium|To Do|To Do|
|582|[Kill Process](https://leetcode.com/problems/kill-process/description/) :lock:|Medium|To Do|To Do|
|583|[Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings/description/) |Medium|To Do|To Do|
|584|[Find Customer Referee](https://leetcode.com/problems/find-customer-referee/description/) |Easy|To Do|To Do|
|585|[Investments in 2016](https://leetcode.com/problems/investments-in-2016/description/) |Medium|To Do|To Do|
|586|[Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders/description/) |Easy|To Do|To Do|
|587|[Erect the Fence](https://leetcode.com/problems/erect-the-fence/description/) |Hard|To Do|To Do|
|588|[Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system/description/) :lock:|Hard|To Do|To Do|
|591|[Tag Validator](https://leetcode.com/problems/tag-validator/description/) |Hard|To Do|To Do|
|592|[Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction/description/) |Medium|To Do|To Do|
|593|[Valid Square](https://leetcode.com/problems/valid-square/description/) |Medium|To Do|To Do|
|594|[Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence/description/) |Easy|To Do|To Do|
|595|[Big Countries](https://leetcode.com/problems/big-countries/description/) |Easy|To Do|To Do|
|596|[Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students/description/) |Easy|To Do|To Do|
|597|[Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate/description/) :lock:|Easy|To Do|To Do|
|598|[Range Addition II](https://leetcode.com/problems/range-addition-ii/description/) |Easy|To Do|To Do|
|599|[Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists/description/) |Easy|To Do|To Do|
|600|[Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones/description/) |Hard|To Do|To Do|
|601|[Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium/description/) |Hard|To Do|To Do|
|602|[Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends/description/) |Medium|To Do|To Do|
|603|[Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats/description/) :lock:|Easy|To Do|To Do|
|604|[Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator/description/) :lock:|Easy|To Do|To Do|
|605|[Can Place Flowers](https://leetcode.com/problems/can-place-flowers/description/) |Easy|To Do|To Do|
|606|[Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree/description/) |Easy|To Do|To Do|
|607|[Sales Person](https://leetcode.com/problems/sales-person/description/) |Easy|To Do|To Do|
|608|[Tree Node](https://leetcode.com/problems/tree-node/description/) |Medium|To Do|To Do|
|609|[Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system/description/) |Medium|To Do|To Do|
|610|[Triangle Judgement](https://leetcode.com/problems/triangle-judgement/description/) |Easy|To Do|To Do|
|611|[Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number/description/) |Medium|To Do|To Do|
|612|[Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane/description/) :lock:|Medium|To Do|To Do|
|613|[Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line/description/) :lock:|Easy|To Do|To Do|
|614|[Second Degree Follower](https://leetcode.com/problems/second-degree-follower/description/) :lock:|Medium|To Do|To Do|
|615|[Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company/description/) :lock:|Hard|To Do|To Do|
|616|[Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string/description/) :lock:|Medium|To Do|To Do|
|617|[Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/description/) |Easy|To Do|To Do|
|618|[Students Report By Geography](https://leetcode.com/problems/students-report-by-geography/description/) :lock:|Hard|To Do|To Do|
|619|[Biggest Single Number](https://leetcode.com/problems/biggest-single-number/description/) |Easy|To Do|To Do|
|620|[Not Boring Movies](https://leetcode.com/problems/not-boring-movies/description/) |Easy|To Do|To Do|
|621|[Task Scheduler](https://leetcode.com/problems/task-scheduler/description/) |Medium|To Do|To Do|
|623|[Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree/description/) |Medium|To Do|To Do|
|624|[Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays/description/) :lock:|Medium|To Do|To Do|
|625|[Minimum Factorization](https://leetcode.com/problems/minimum-factorization/description/) :lock:|Medium|To Do|To Do|
|626|[Exchange Seats](https://leetcode.com/problems/exchange-seats/description/) |Medium|To Do|To Do|
|627|[Swap Salary](https://leetcode.com/problems/swap-salary/description/) |Easy|To Do|To Do|
|628|[Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/description/) |Easy|To Do|To Do|
|629|[K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array/description/) |Hard|To Do|To Do|
|630|[Course Schedule III](https://leetcode.com/problems/course-schedule-iii/description/) |Hard|To Do|To Do|
|631|[Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula/description/) :lock:|Hard|To Do|To Do|
|632|[Smallest Range Covering Elements from K Lists](https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/description/) |Hard|To Do|To Do|
|633|[Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers/description/) |Medium|To Do|To Do|
|634|[Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array/description/) :lock:|Medium|To Do|To Do|
|635|[Design Log Storage System](https://leetcode.com/problems/design-log-storage-system/description/) :lock:|Medium|To Do|To Do|
|636|[Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions/description/) |Medium|To Do|To Do|
|637|[Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/description/) |Easy|To Do|To Do|
|638|[Shopping Offers](https://leetcode.com/problems/shopping-offers/description/) |Medium|To Do|To Do|
|639|[Decode Ways II](https://leetcode.com/problems/decode-ways-ii/description/) |Hard|To Do|To Do|
|640|[Solve the Equation](https://leetcode.com/problems/solve-the-equation/description/) |Medium|To Do|To Do|
|642|[Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system/description/) :lock:|Hard|To Do|To Do|
|643|[Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/description/) |Easy|To Do|To Do|
|644|[Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii/description/) :lock:|Hard|To Do|To Do|
|645|[Set Mismatch](https://leetcode.com/problems/set-mismatch/description/) |Easy|To Do|To Do|
|646|[Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain/description/) |Medium|To Do|To Do|
|647|[Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/description/) |Medium|To Do|To Do|
|648|[Replace Words](https://leetcode.com/problems/replace-words/description/) |Medium|To Do|To Do|
|649|[Dota2 Senate](https://leetcode.com/problems/dota2-senate/description/) |Medium|To Do|To Do|
|650|[2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard/description/) |Medium|To Do|To Do|
|651|[4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard/description/) :lock:|Medium|To Do|To Do|
|652|[Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees/description/) |Medium|To Do|To Do|
|653|[Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/description/) |Easy|To Do|To Do|
|654|[Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree/description/) |Medium|To Do|To Do|
|655|[Print Binary Tree](https://leetcode.com/problems/print-binary-tree/description/) |Medium|To Do|To Do|
|656|[Coin Path](https://leetcode.com/problems/coin-path/description/) :lock:|Hard|To Do|To Do|
|657|[Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin/description/) |Easy|To Do|To Do|
|658|[Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements/description/) |Medium|To Do|To Do|
|659|[Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences/description/) |Medium|To Do|To Do|
|660|[Remove 9](https://leetcode.com/problems/remove-9/description/) :lock:|Hard|To Do|To Do|
|661|[Image Smoother](https://leetcode.com/problems/image-smoother/description/) |Easy|To Do|To Do|
|662|[Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree/description/) |Medium|To Do|To Do|
|663|[Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition/description/) :lock:|Medium|To Do|To Do|
|664|[Strange Printer](https://leetcode.com/problems/strange-printer/description/) |Hard|To Do|To Do|
|665|[Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array/description/) |Medium|To Do|To Do|
|666|[Path Sum IV](https://leetcode.com/problems/path-sum-iv/description/) :lock:|Medium|To Do|To Do|
|667|[Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii/description/) |Medium|To Do|To Do|
|668|[Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table/description/) |Hard|To Do|To Do|
|669|[Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree/description/) |Medium|To Do|To Do|
|670|[Maximum Swap](https://leetcode.com/problems/maximum-swap/description/) |Medium|To Do|To Do|
|671|[Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/description/) |Easy|To Do|To Do|
|672|[Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii/description/) |Medium|To Do|To Do|
|673|[Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence/description/) |Medium|To Do|To Do|
|674|[Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence/description/) |Easy|To Do|To Do|
|675|[Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event/description/) |Hard|To Do|To Do|
|676|[Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary/description/) |Medium|To Do|To Do|
|677|[Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs/description/) |Medium|To Do|To Do|
|678|[Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string/description/) |Medium|To Do|To Do|
|679|[24 Game](https://leetcode.com/problems/24-game/description/) |Hard|To Do|To Do|
|680|[Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii/description/) |Easy|To Do|To Do|
|681|[Next Closest Time](https://leetcode.com/problems/next-closest-time/description/) :lock:|Medium|To Do|To Do|
|682|[Baseball Game](https://leetcode.com/problems/baseball-game/description/) |Easy|To Do|To Do|
|683|[K Empty Slots](https://leetcode.com/problems/k-empty-slots/description/) :lock:|Hard|To Do|To Do|
|684|[Redundant Connection](https://leetcode.com/problems/redundant-connection/description/) |Medium|To Do|To Do|
|685|[Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii/description/) |Hard|To Do|To Do|
|686|[Repeated String Match](https://leetcode.com/problems/repeated-string-match/description/) |Medium|To Do|To Do|
|687|[Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path/description/) |Medium|To Do|To Do|
|688|[Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard/description/) |Medium|To Do|To Do|
|689|[Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays/description/) |Hard|To Do|To Do|
|690|[Employee Importance](https://leetcode.com/problems/employee-importance/description/) |Medium|To Do|To Do|
|691|[Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word/description/) |Hard|To Do|To Do|
|692|[Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/description/) |Medium|To Do|To Do|
|693|[Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits/description/) |Easy|To Do|To Do|
|694|[Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands/description/) :lock:|Medium|To Do|To Do|
|695|[Max Area of Island](https://leetcode.com/problems/max-area-of-island/description/) |Medium|To Do|To Do|
|696|[Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings/description/) |Easy|To Do|To Do|
|697|[Degree of an Array](https://leetcode.com/problems/degree-of-an-array/description/) |Easy|To Do|To Do|
|698|[Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets/description/) |Medium|To Do|To Do|
|699|[Falling Squares](https://leetcode.com/problems/falling-squares/description/) |Hard|To Do|To Do|
|711|[Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii/description/) :lock:|Hard|To Do|To Do|
|712|[Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/description/) |Medium|To Do|To Do|
|713|[Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k/description/) |Medium|To Do|To Do|
|714|[Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/description/) |Medium|To Do|To Do|
|715|[Range Module](https://leetcode.com/problems/range-module/description/) |Hard|To Do|To Do|
|716|[Max Stack](https://leetcode.com/problems/max-stack/description/) :lock:|Hard|To Do|To Do|
|717|[1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters/description/) |Easy|To Do|To Do|
|718|[Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/description/) |Medium|To Do|To Do|
|719|[Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance/description/) |Hard|To Do|To Do|
|720|[Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary/description/) |Medium|To Do|To Do|
|721|[Accounts Merge](https://leetcode.com/problems/accounts-merge/description/) |Medium|To Do|To Do|
|722|[Remove Comments](https://leetcode.com/problems/remove-comments/description/) |Medium|To Do|To Do|
|723|[Candy Crush](https://leetcode.com/problems/candy-crush/description/) :lock:|Medium|To Do|To Do|
|724|[Find Pivot Index](https://leetcode.com/problems/find-pivot-index/description/) |Easy|To Do|To Do|
|725|[Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts/description/) |Medium|To Do|To Do|
|726|[Number of Atoms](https://leetcode.com/problems/number-of-atoms/description/) |Hard|To Do|To Do|
|727|[Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence/description/) :lock:|Hard|To Do|To Do|
|728|[Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers/description/) |Easy|To Do|To Do|
|729|[My Calendar I](https://leetcode.com/problems/my-calendar-i/description/) |Medium|To Do|To Do|
|730|[Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences/description/) |Hard|To Do|To Do|
|731|[My Calendar II](https://leetcode.com/problems/my-calendar-ii/description/) |Medium|To Do|To Do|
|732|[My Calendar III](https://leetcode.com/problems/my-calendar-iii/description/) |Hard|To Do|To Do|
|733|[Flood Fill](https://leetcode.com/problems/flood-fill/description/) |Easy|To Do|To Do|
|734|[Sentence Similarity](https://leetcode.com/problems/sentence-similarity/description/) :lock:|Easy|To Do|To Do|
|735|[Asteroid Collision](https://leetcode.com/problems/asteroid-collision/description/) |Medium|To Do|To Do|
|736|[Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression/description/) |Hard|To Do|To Do|
|737|[Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii/description/) :lock:|Medium|To Do|To Do|
|738|[Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits/description/) |Medium|To Do|To Do|
|739|[Daily Temperatures](https://leetcode.com/problems/daily-temperatures/description/) |Medium|To Do|To Do|
|740|[Delete and Earn](https://leetcode.com/problems/delete-and-earn/description/) |Medium|To Do|To Do|
|741|[Cherry Pickup](https://leetcode.com/problems/cherry-pickup/description/) |Hard|To Do|To Do|
|709|[To Lower Case](https://leetcode.com/problems/to-lower-case/description/) |Easy|To Do|To Do|
|742|[Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree/description/) :lock:|Medium|To Do|To Do|
|743|[Network Delay Time](https://leetcode.com/problems/network-delay-time/description/) |Medium|To Do|To Do|
|744|[Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target/description/) |Easy|To Do|To Do|
|745|[Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search/description/) |Hard|To Do|To Do|
|746|[Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/description/) |Easy|To Do|To Do|
|747|[Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others/description/) |Easy|To Do|To Do|
|748|[Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word/description/) |Easy|To Do|To Do|
|749|[Contain Virus](https://leetcode.com/problems/contain-virus/description/) |Hard|To Do|To Do|
|750|[Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles/description/) :lock:|Medium|To Do|To Do|
|751|[IP to CIDR](https://leetcode.com/problems/ip-to-cidr/description/) :lock:|Medium|To Do|To Do|
|752|[Open the Lock](https://leetcode.com/problems/open-the-lock/description/) |Medium|To Do|To Do|
|753|[Cracking the Safe](https://leetcode.com/problems/cracking-the-safe/description/) |Hard|To Do|To Do|
|754|[Reach a Number](https://leetcode.com/problems/reach-a-number/description/) |Medium|To Do|To Do|
|755|[Pour Water](https://leetcode.com/problems/pour-water/description/) :lock:|Medium|To Do|To Do|
|756|[Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix/description/) |Medium|To Do|To Do|
|426|[Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/description/) :lock:|Medium|To Do|To Do|
|757|[Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two/description/) |Hard|To Do|To Do|
|758|[Bold Words in String](https://leetcode.com/problems/bold-words-in-string/description/) :lock:|Medium|To Do|To Do|
|759|[Employee Free Time](https://leetcode.com/problems/employee-free-time/description/) :lock:|Hard|To Do|To Do|
|760|[Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings/description/) :lock:|Easy|To Do|To Do|
|761|[Special Binary String](https://leetcode.com/problems/special-binary-string/description/) |Hard|To Do|To Do|
|429|[N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal/description/) |Medium|To Do|To Do|
|428|[Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree/description/) :lock:|Hard|To Do|To Do|
|430|[Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/description/) |Medium|To Do|To Do|
|762|[Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/description/) |Easy|To Do|To Do|
|763|[Partition Labels](https://leetcode.com/problems/partition-labels/description/) |Medium|To Do|To Do|
|764|[Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign/description/) |Medium|To Do|To Do|
|765|[Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands/description/) |Hard|To Do|To Do|
|431|[Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree/description/) :lock:|Hard|To Do|To Do|
|427|[Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree/description/) |Medium|To Do|To Do|
|558|[Logical OR of Two Binary Grids Represented as Quad-Trees](https://leetcode.com/problems/logical-or-of-two-binary-grids-represented-as-quad-trees/description/) |Medium|To Do|To Do|
|559|[Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree/description/) |Easy|To Do|To Do|
|589|[N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal/description/) |Easy|To Do|To Do|
|590|[N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal/description/) |Easy|To Do|To Do|
|766|[Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix/description/) |Easy|To Do|To Do|
|767|[Reorganize String](https://leetcode.com/problems/reorganize-string/description/) |Medium|To Do|To Do|
|768|[Max Chunks To Make Sorted II](https://leetcode.com/problems/max-chunks-to-make-sorted-ii/description/) |Hard|To Do|To Do|
|769|[Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted/description/) |Medium|To Do|To Do|
|770|[Basic Calculator IV](https://leetcode.com/problems/basic-calculator-iv/description/) |Hard|To Do|To Do|
|771|[Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/description/) |Easy|To Do|To Do|
|700|[Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/description/) |Easy|To Do|To Do|
|701|[Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/description/) |Medium|To Do|To Do|
|772|[Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii/description/) :lock:|Hard|To Do|To Do|
|702|[Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size/description/) :lock:|Medium|To Do|To Do|
|773|[Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle/description/) |Hard|To Do|To Do|
|774|[Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station/description/) :lock:|Hard|To Do|To Do|
|703|[Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/description/) |Easy|To Do|To Do|
|775|[Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions/description/) |Medium|To Do|To Do|
|776|[Split BST](https://leetcode.com/problems/split-bst/description/) :lock:|Medium|To Do|To Do|
|704|[Binary Search](https://leetcode.com/problems/binary-search/description/) |Easy|To Do|To Do|
|777|[Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string/description/) |Medium|To Do|To Do|
|778|[Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water/description/) |Hard|To Do|To Do|
|779|[K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar/description/) |Medium|To Do|To Do|
|780|[Reaching Points](https://leetcode.com/problems/reaching-points/description/) |Hard|To Do|To Do|
|781|[Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest/description/) |Medium|To Do|To Do|
|782|[Transform to Chessboard](https://leetcode.com/problems/transform-to-chessboard/description/) |Hard|To Do|To Do|
|783|[Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/description/) |Easy|To Do|To Do|
|784|[Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation/description/) |Medium|To Do|To Do|
|785|[Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite/description/) |Medium|To Do|To Do|
|786|[K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction/description/) |Medium|To Do|To Do|
|787|[Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/787.%20Cheapest%20Flights%20Within%20K%20Stops/CheapestFlightsWithinKStopsSolution.js)|To Do|
|788|[Rotated Digits](https://leetcode.com/problems/rotated-digits/description/) |Medium|To Do|To Do|
|789|[Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts/description/) |Medium|To Do|To Do|
|790|[Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling/description/) |Medium|To Do|To Do|
|791|[Custom Sort String](https://leetcode.com/problems/custom-sort-string/description/) |Medium|To Do|To Do|
|792|[Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences/description/) |Medium|To Do|To Do|
|793|[Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function/description/) |Hard|To Do|To Do|
|794|[Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state/description/) |Medium|To Do|To Do|
|795|[Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum/description/) |Medium|To Do|To Do|
|796|[Rotate String](https://leetcode.com/problems/rotate-string/description/) |Easy|To Do|To Do|
|797|[All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target/description/) |Medium|To Do|To Do|
|798|[Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score/description/) |Hard|To Do|To Do|
|799|[Champagne Tower](https://leetcode.com/problems/champagne-tower/description/) |Medium|To Do|To Do|
|705|[Design HashSet](https://leetcode.com/problems/design-hashset/description/) |Easy|To Do|To Do|
|706|[Design HashMap](https://leetcode.com/problems/design-hashmap/description/) |Easy|To Do|To Do|
|800|[Similar RGB Color](https://leetcode.com/problems/similar-rgb-color/description/) :lock:|Easy|To Do|To Do|
|801|[Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing/description/) |Hard|To Do|To Do|
|802|[Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states/description/) |Medium|To Do|To Do|
|803|[Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit/description/) |Hard|To Do|To Do|
|804|[Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/description/) |Easy|To Do|To Do|
|805|[Split Array With Same Average](https://leetcode.com/problems/split-array-with-same-average/description/) |Hard|To Do|To Do|
|806|[Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string/description/) |Easy|To Do|To Do|
|807|[Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline/description/) |Medium|To Do|To Do|
|808|[Soup Servings](https://leetcode.com/problems/soup-servings/description/) |Medium|To Do|To Do|
|809|[Expressive Words](https://leetcode.com/problems/expressive-words/description/) |Medium|To Do|To Do|
|810|[Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game/description/) |Hard|To Do|To Do|
|811|[Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/description/) |Medium|To Do|To Do|
|812|[Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area/description/) |Easy|To Do|To Do|
|813|[Largest Sum of Averages](https://leetcode.com/problems/largest-sum-of-averages/description/) |Medium|To Do|To Do|
|814|[Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning/description/) |Medium|To Do|To Do|
|815|[Bus Routes](https://leetcode.com/problems/bus-routes/description/) |Hard|To Do|To Do|
|816|[Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates/description/) |Medium|To Do|To Do|
|817|[Linked List Components](https://leetcode.com/problems/linked-list-components/description/) |Medium|To Do|To Do|
|818|[Race Car](https://leetcode.com/problems/race-car/description/) |Hard|To Do|To Do|
|819|[Most Common Word](https://leetcode.com/problems/most-common-word/description/) |Easy|To Do|To Do|
|707|[Design Linked List](https://leetcode.com/problems/design-linked-list/description/) |Medium|To Do|To Do|
|820|[Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words/description/) |Medium|To Do|To Do|
|821|[Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character/description/) |Easy|To Do|To Do|
|822|[Card Flipping Game](https://leetcode.com/problems/card-flipping-game/description/) |Medium|To Do|To Do|
|823|[Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors/description/) |Medium|To Do|To Do|
|708|[Insert into a Sorted Circular Linked List](https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list/description/) :lock:|Medium|To Do|To Do|
|824|[Goat Latin](https://leetcode.com/problems/goat-latin/description/) |Easy|To Do|To Do|
|825|[Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages/description/) |Medium|To Do|To Do|
|826|[Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work/description/) |Medium|To Do|To Do|
|827|[Making A Large Island](https://leetcode.com/problems/making-a-large-island/description/) |Hard|To Do|To Do|
|828|[Count Unique Characters of All Substrings of a Given String](https://leetcode.com/problems/count-unique-characters-of-all-substrings-of-a-given-string/description/) |Hard|To Do|To Do|
|829|[Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum/description/) |Hard|To Do|To Do|
|830|[Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups/description/) |Easy|To Do|To Do|
|831|[Masking Personal Information](https://leetcode.com/problems/masking-personal-information/description/) |Medium|To Do|To Do|
|641|[Design Circular Deque](https://leetcode.com/problems/design-circular-deque/description/) |Medium|To Do|To Do|
|622|[Design Circular Queue](https://leetcode.com/problems/design-circular-queue/description/) |Medium|To Do|To Do|
|832|[Flipping an Image](https://leetcode.com/problems/flipping-an-image/description/) |Easy|To Do|To Do|
|833|[Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string/description/) |Medium|To Do|To Do|
|834|[Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree/description/) |Hard|To Do|To Do|
|835|[Image Overlap](https://leetcode.com/problems/image-overlap/description/) |Medium|To Do|To Do|
|489|[Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner/description/) :lock:|Hard|To Do|To Do|
|836|[Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap/description/) |Easy|To Do|To Do|
|837|[New 21 Game](https://leetcode.com/problems/new-21-game/description/) |Medium|To Do|To Do|
|838|[Push Dominoes](https://leetcode.com/problems/push-dominoes/description/) |Medium|To Do|To Do|
|839|[Similar String Groups](https://leetcode.com/problems/similar-string-groups/description/) |Hard|To Do|To Do|
|840|[Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid/description/) |Medium|To Do|To Do|
|841|[Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/description/) |Medium|To Do|To Do|
|842|[Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence/description/) |Medium|To Do|To Do|
|843|[Guess the Word](https://leetcode.com/problems/guess-the-word/description/) |Hard|To Do|To Do|
|844|[Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/description/) |Easy|To Do|To Do|
|845|[Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array/description/) |Medium|To Do|To Do|
|846|[Hand of Straights](https://leetcode.com/problems/hand-of-straights/description/) |Medium|To Do|To Do|
|847|[Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes/description/) |Hard|To Do|To Do|
|848|[Shifting Letters](https://leetcode.com/problems/shifting-letters/description/) |Medium|To Do|To Do|
|849|[Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person/description/) |Medium|To Do|To Do|
|850|[Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii/description/) |Hard|To Do|To Do|
|851|[Loud and Rich](https://leetcode.com/problems/loud-and-rich/description/) |Medium|To Do|To Do|
|852|[Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/description/) |Medium|To Do|To Do|
|853|[Car Fleet](https://leetcode.com/problems/car-fleet/description/) |Medium|To Do|To Do|
|854|[K-Similar Strings](https://leetcode.com/problems/k-similar-strings/description/) |Hard|To Do|To Do|
|855|[Exam Room](https://leetcode.com/problems/exam-room/description/) |Medium|To Do|To Do|
|856|[Score of Parentheses](https://leetcode.com/problems/score-of-parentheses/description/) |Medium|To Do|To Do|
|857|[Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers/description/) |Hard|To Do|To Do|
|858|[Mirror Reflection](https://leetcode.com/problems/mirror-reflection/description/) |Medium|To Do|To Do|
|859|[Buddy Strings](https://leetcode.com/problems/buddy-strings/description/) |Easy|To Do|To Do|
|860|[Lemonade Change](https://leetcode.com/problems/lemonade-change/description/) |Easy|To Do|To Do|
|861|[Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix/description/) |Medium|To Do|To Do|
|862|[Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/description/) |Hard|To Do|To Do|
|863|[All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/description/) |Medium|To Do|To Do|
|710|[Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist/description/) |Hard|To Do|To Do|
|864|[Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys/description/) |Hard|To Do|To Do|
|865|[Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes/description/) |Medium|To Do|To Do|
|866|[Prime Palindrome](https://leetcode.com/problems/prime-palindrome/description/) |Medium|To Do|To Do|
|867|[Transpose Matrix](https://leetcode.com/problems/transpose-matrix/description/) |Easy|To Do|To Do|
|868|[Binary Gap](https://leetcode.com/problems/binary-gap/description/) |Easy|To Do|To Do|
|869|[Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2/description/) |Medium|To Do|To Do|
|870|[Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle/description/) |Medium|To Do|To Do|
|871|[Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops/description/) |Hard|To Do|To Do|
|470|[Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7/description/) |Medium|To Do|To Do|
|872|[Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees/description/) |Easy|To Do|To Do|
|873|[Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence/description/) |Medium|To Do|To Do|
|874|[Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation/description/) |Medium|To Do|To Do|
|875|[Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas/description/) |Medium|To Do|To Do|
|876|[Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/description/) |Easy|To Do|To Do|
|877|[Stone Game](https://leetcode.com/problems/stone-game/description/) |Medium|To Do|To Do|
|878|[Nth Magical Number](https://leetcode.com/problems/nth-magical-number/description/) |Hard|To Do|To Do|
|879|[Profitable Schemes](https://leetcode.com/problems/profitable-schemes/description/) |Hard|To Do|To Do|
|528|[Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/528.%20Random%20Pick%20with%20Weight/RandomPickWithWeight.js)|To Do|
|519|[Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix/description/) |Medium|To Do|To Do|
|497|[Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles/description/) |Medium|To Do|To Do|
|478|[Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle/description/) |Medium|To Do|To Do|
|880|[Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index/description/) |Medium|To Do|To Do|
|881|[Boats to Save People](https://leetcode.com/problems/boats-to-save-people/description/) |Medium|To Do|To Do|
|882|[Reachable Nodes In Subdivided Graph](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph/description/) |Hard|To Do|To Do|
|883|[Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes/description/) |Easy|To Do|To Do|
|884|[Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences/description/) |Easy|To Do|To Do|
|885|[Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii/description/) |Medium|To Do|To Do|
|886|[Possible Bipartition](https://leetcode.com/problems/possible-bipartition/description/) |Medium|To Do|To Do|
|887|[Super Egg Drop](https://leetcode.com/problems/super-egg-drop/description/) |Hard|To Do|To Do|
|888|[Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap/description/) |Easy|To Do|To Do|
|889|[Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal/description/) |Medium|To Do|To Do|
|890|[Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern/description/) |Medium|To Do|To Do|
|891|[Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths/description/) |Hard|To Do|To Do|
|892|[Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes/description/) |Easy|To Do|To Do|
|893|[Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings/description/) |Medium|To Do|To Do|
|894|[All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees/description/) |Medium|To Do|To Do|
|895|[Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack/description/) |Hard|To Do|To Do|
|896|[Monotonic Array](https://leetcode.com/problems/monotonic-array/description/) |Easy|To Do|To Do|
|897|[Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree/description/) |Easy|To Do|To Do|
|898|[Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays/description/) |Medium|To Do|To Do|
|899|[Orderly Queue](https://leetcode.com/problems/orderly-queue/description/) |Hard|To Do|To Do|
|900|[RLE Iterator](https://leetcode.com/problems/rle-iterator/description/) |Medium|To Do|To Do|
|901|[Online Stock Span](https://leetcode.com/problems/online-stock-span/description/) |Medium|To Do|To Do|
|902|[Numbers At Most N Given Digit Set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set/description/) |Hard|To Do|To Do|
|903|[Valid Permutations for DI Sequence](https://leetcode.com/problems/valid-permutations-for-di-sequence/description/) |Hard|To Do|To Do|
|904|[Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets/description/) |Medium|To Do|To Do|
|905|[Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity/description/) |Easy|To Do|To Do|
|906|[Super Palindromes](https://leetcode.com/problems/super-palindromes/description/) |Hard|To Do|To Do|
|907|[Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums/description/) |Medium|To Do|To Do|
|908|[Smallest Range I](https://leetcode.com/problems/smallest-range-i/description/) |Easy|To Do|To Do|
|909|[Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders/description/) |Medium|To Do|To Do|
|910|[Smallest Range II](https://leetcode.com/problems/smallest-range-ii/description/) |Medium|To Do|To Do|
|911|[Online Election](https://leetcode.com/problems/online-election/description/) |Medium|To Do|To Do|
|912|[Sort an Array](https://leetcode.com/problems/sort-an-array/description/) |Medium|To Do|To Do|
|913|[Cat and Mouse](https://leetcode.com/problems/cat-and-mouse/description/) |Hard|To Do|To Do|
|914|[X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/description/) |Easy|To Do|To Do|
|915|[Partition Array into Disjoint Intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals/description/) |Medium|To Do|To Do|
|916|[Word Subsets](https://leetcode.com/problems/word-subsets/description/) |Medium|To Do|To Do|
|917|[Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters/description/) |Easy|To Do|To Do|
|918|[Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/918.%20Maximum%20Sum%20Circular%20Subarray/MaximumSumCircularSubarray.js)|To Do|
|919|[Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter/description/) |Medium|To Do|To Do|
|920|[Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists/description/) |Hard|To Do|To Do|
|921|[Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/description/) |Medium|To Do|To Do|
|922|[Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii/description/) |Easy|To Do|To Do|
|923|[3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity/description/) |Medium|To Do|To Do|
|924|[Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread/description/) |Hard|To Do|To Do|
|925|[Long Pressed Name](https://leetcode.com/problems/long-pressed-name/description/) |Easy|To Do|To Do|
|926|[Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing/description/) |Medium|To Do|To Do|
|927|[Three Equal Parts](https://leetcode.com/problems/three-equal-parts/description/) |Hard|To Do|To Do|
|928|[Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii/description/) |Hard|To Do|To Do|
|929|[Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses/description/) |Easy|To Do|To Do|
|930|[Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum/description/) |Medium|To Do|To Do|
|931|[Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum/description/) |Medium|To Do|To Do|
|932|[Beautiful Array](https://leetcode.com/problems/beautiful-array/description/) |Medium|To Do|To Do|
|933|[Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/description/) |Easy|To Do|To Do|
|934|[Shortest Bridge](https://leetcode.com/problems/shortest-bridge/description/) |Medium|To Do|To Do|
|935|[Knight Dialer](https://leetcode.com/problems/knight-dialer/description/) |Medium|To Do|To Do|
|936|[Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence/description/) |Hard|To Do|To Do|
|937|[Reorder Data in Log Files](https://leetcode.com/problems/reorder-data-in-log-files/description/) |Medium|To Do|To Do|
|938|[Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/description/) |Easy|To Do|To Do|
|939|[Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle/description/) |Medium|To Do|To Do|
|940|[Distinct Subsequences II](https://leetcode.com/problems/distinct-subsequences-ii/description/) |Hard|To Do|To Do|
|941|[Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array/description/) |Easy|To Do|To Do|
|942|[DI String Match](https://leetcode.com/problems/di-string-match/description/) |Easy|To Do|To Do|
|943|[Find the Shortest Superstring](https://leetcode.com/problems/find-the-shortest-superstring/description/) |Hard|To Do|To Do|
|944|[Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted/description/) |Easy|To Do|To Do|
|945|[Minimum Increment to Make Array Unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique/description/) |Medium|To Do|To Do|
|946|[Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences/description/) |Medium|To Do|To Do|
|947|[Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/description/) |Medium|To Do|To Do|
|948|[Bag of Tokens](https://leetcode.com/problems/bag-of-tokens/description/) |Medium|To Do|To Do|
|949|[Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits/description/) |Medium|To Do|To Do|
|950|[Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order/description/) |Medium|To Do|To Do|
|951|[Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees/description/) |Medium|To Do|To Do|
|952|[Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor/description/) |Hard|To Do|To Do|
|953|[Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary/description/) |Easy|To Do|To Do|
|954|[Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs/description/) |Medium|To Do|To Do|
|955|[Delete Columns to Make Sorted II](https://leetcode.com/problems/delete-columns-to-make-sorted-ii/description/) |Medium|To Do|To Do|
|956|[Tallest Billboard](https://leetcode.com/problems/tallest-billboard/description/) |Hard|To Do|To Do|
|957|[Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days/description/) |Medium|To Do|To Do|
|958|[Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree/description/) |Medium|To Do|To Do|
|959|[Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes/description/) |Medium|To Do|To Do|
|960|[Delete Columns to Make Sorted III](https://leetcode.com/problems/delete-columns-to-make-sorted-iii/description/) |Hard|To Do|To Do|
|961|[N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array/description/) |Easy|To Do|To Do|
|962|[Maximum Width Ramp](https://leetcode.com/problems/maximum-width-ramp/description/) |Medium|To Do|To Do|
|963|[Minimum Area Rectangle II](https://leetcode.com/problems/minimum-area-rectangle-ii/description/) |Medium|To Do|To Do|
|964|[Least Operators to Express Number](https://leetcode.com/problems/least-operators-to-express-number/description/) |Hard|To Do|To Do|
|965|[Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree/description/) |Easy|To Do|To Do|
|966|[Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker/description/) |Medium|To Do|To Do|
|967|[Numbers With Same Consecutive Differences](https://leetcode.com/problems/numbers-with-same-consecutive-differences/description/) |Medium|To Do|To Do|
|968|[Binary Tree Cameras](https://leetcode.com/problems/binary-tree-cameras/description/) |Hard|To Do|To Do|
|969|[Pancake Sorting](https://leetcode.com/problems/pancake-sorting/description/) |Medium|To Do|To Do|
|970|[Powerful Integers](https://leetcode.com/problems/powerful-integers/description/) |Medium|To Do|To Do|
|971|[Flip Binary Tree To Match Preorder Traversal](https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal/description/) |Medium|To Do|To Do|
|972|[Equal Rational Numbers](https://leetcode.com/problems/equal-rational-numbers/description/) |Hard|To Do|To Do|
|509|[Fibonacci Number](https://leetcode.com/problems/fibonacci-number/description/) |Easy|To Do|To Do|
|973|[K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/description/) |Medium|To Do|To Do|
|974|[Subarray Sums Divisible by K](https://leetcode.com/problems/subarray-sums-divisible-by-k/description/) |Medium|To Do|To Do|
|975|[Odd Even Jump](https://leetcode.com/problems/odd-even-jump/description/) |Hard|To Do|To Do|
|976|[Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/description/) |Easy|To Do|To Do|
|977|[Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/description/) |Easy|To Do|To Do|
|978|[Longest Turbulent Subarray](https://leetcode.com/problems/longest-turbulent-subarray/description/) |Medium|To Do|To Do|
|979|[Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree/description/) |Medium|To Do|To Do|
|980|[Unique Paths III](https://leetcode.com/problems/unique-paths-iii/description/) |Hard|To Do|To Do|
|981|[Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/description/) |Medium|To Do|To Do|
|982|[Triples with Bitwise AND Equal To Zero](https://leetcode.com/problems/triples-with-bitwise-and-equal-to-zero/description/) |Hard|To Do|To Do|
|983|[Minimum Cost For Tickets](https://leetcode.com/problems/minimum-cost-for-tickets/description/) |Medium|To Do|To Do|
|984|[String Without AAA or BBB](https://leetcode.com/problems/string-without-aaa-or-bbb/description/) |Medium|To Do|To Do|
|985|[Sum of Even Numbers After Queries](https://leetcode.com/problems/sum-of-even-numbers-after-queries/description/) |Medium|To Do|To Do|
|986|[Interval List Intersections](https://leetcode.com/problems/interval-list-intersections/description/) |Medium|To Do|To Do|
|987|[Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/description/) |Hard|To Do|To Do|
|988|[Smallest String Starting From Leaf](https://leetcode.com/problems/smallest-string-starting-from-leaf/description/) |Medium|To Do|To Do|
|989|[Add to Array-Form of Integer](https://leetcode.com/problems/add-to-array-form-of-integer/description/) |Easy|To Do|To Do|
|990|[Satisfiability of Equality Equations](https://leetcode.com/problems/satisfiability-of-equality-equations/description/) |Medium|To Do|To Do|
|991|[Broken Calculator](https://leetcode.com/problems/broken-calculator/description/) |Medium|To Do|To Do|
|992|[Subarrays with K Different Integers](https://leetcode.com/problems/subarrays-with-k-different-integers/description/) |Hard|To Do|To Do|
|993|[Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree/description/) |Easy|To Do|To Do|
|994|[Rotting Oranges](https://leetcode.com/problems/rotting-oranges/description/) |Medium|To Do|To Do|
|995|[Minimum Number of K Consecutive Bit Flips](https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/description/) |Hard|To Do|To Do|
|996|[Number of Squareful Arrays](https://leetcode.com/problems/number-of-squareful-arrays/description/) |Hard|To Do|To Do|
|997|[Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/description/) |Easy|To Do|To Do|
|998|[Maximum Binary Tree II](https://leetcode.com/problems/maximum-binary-tree-ii/description/) |Medium|To Do|To Do|
|999|[Available Captures for Rook](https://leetcode.com/problems/available-captures-for-rook/description/) |Easy|To Do|To Do|
|1000|[Minimum Cost to Merge Stones](https://leetcode.com/problems/minimum-cost-to-merge-stones/description/) |Hard|To Do|To Do|
|1001|[Grid Illumination](https://leetcode.com/problems/grid-illumination/description/) |Hard|To Do|To Do|
|1002|[Find Common Characters](https://leetcode.com/problems/find-common-characters/description/) |Easy|To Do|To Do|
|1003|[Check If Word Is Valid After Substitutions](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions/description/) |Medium|To Do|To Do|
|1004|[Max Consecutive Ones III](https://leetcode.com/problems/max-consecutive-ones-iii/description/) |Medium|To Do|To Do|
|1005|[Maximize Sum Of Array After K Negations](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/description/) |Easy|To Do|To Do|
|1006|[Clumsy Factorial](https://leetcode.com/problems/clumsy-factorial/description/) |Medium|To Do|To Do|
|1007|[Minimum Domino Rotations For Equal Row](https://leetcode.com/problems/minimum-domino-rotations-for-equal-row/description/) |Medium|To Do|To Do|
|1008|[Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/1008.%20Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal/ConstructBinarySearchTreefromPreorderTraversal.js)|To Do|
|1055|[Shortest Way to Form String](https://leetcode.com/problems/shortest-way-to-form-string/description/) :lock:|Medium|To Do|To Do|
|1057|[Campus Bikes](https://leetcode.com/problems/campus-bikes/description/) :lock:|Medium|To Do|To Do|
|1058|[Minimize Rounding Error to Meet Target](https://leetcode.com/problems/minimize-rounding-error-to-meet-target/description/) :lock:|Medium|To Do|To Do|
|1009|[Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer/description/) |Easy|To Do|To Do|
|1010|[Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/description/) |Medium|To Do|To Do|
|1011|[Capacity To Ship Packages Within D Days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/description/) |Medium|To Do|To Do|
|1012|[Numbers With Repeated Digits](https://leetcode.com/problems/numbers-with-repeated-digits/description/) |Hard|To Do|To Do|
|1061|[Lexicographically Smallest Equivalent String](https://leetcode.com/problems/lexicographically-smallest-equivalent-string/description/) |Medium|To Do|To Do|
|1060|[Missing Element in Sorted Array](https://leetcode.com/problems/missing-element-in-sorted-array/description/) :lock:|Medium|To Do|To Do|
|1062|[Longest Repeating Substring](https://leetcode.com/problems/longest-repeating-substring/description/) :lock:|Medium|To Do|To Do|
|1063|[Number of Valid Subarrays](https://leetcode.com/problems/number-of-valid-subarrays/description/) :lock:|Hard|To Do|To Do|
|1013|[Partition Array Into Three Parts With Equal Sum](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/description/) |Easy|To Do|To Do|
|1014|[Best Sightseeing Pair](https://leetcode.com/problems/best-sightseeing-pair/description/) |Medium|To Do|To Do|
|1015|[Smallest Integer Divisible by K](https://leetcode.com/problems/smallest-integer-divisible-by-k/description/) |Medium|To Do|To Do|
|1016|[Binary String With Substrings Representing 1 To N](https://leetcode.com/problems/binary-string-with-substrings-representing-1-to-n/description/) |Medium|To Do|To Do|
|1064|[Fixed Point](https://leetcode.com/problems/fixed-point/description/) :lock:|Easy|To Do|To Do|
|1066|[Campus Bikes II](https://leetcode.com/problems/campus-bikes-ii/description/) :lock:|Medium|To Do|To Do|
|1067|[Digit Count in Range](https://leetcode.com/problems/digit-count-in-range/description/) :lock:|Hard|To Do|To Do|
|1056|[Confusing Number](https://leetcode.com/problems/confusing-number/description/) :lock:|Easy|To Do|To Do|
|1017|[Convert to Base -2](https://leetcode.com/problems/convert-to-base-2/description/) |Medium|To Do|To Do|
|1018|[Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5/description/) |Easy|To Do|To Do|
|1019|[Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/description/) |Medium|To Do|To Do|
|1020|[Number of Enclaves](https://leetcode.com/problems/number-of-enclaves/description/) |Medium|To Do|To Do|
|1086|[High Five](https://leetcode.com/problems/high-five/description/) :lock:|Easy|To Do|To Do|
|1065|[Index Pairs of a String](https://leetcode.com/problems/index-pairs-of-a-string/description/) :lock:|Easy|To Do|To Do|
|1087|[Brace Expansion](https://leetcode.com/problems/brace-expansion/description/) :lock:|Medium|To Do|To Do|
|1088|[Confusing Number II](https://leetcode.com/problems/confusing-number-ii/description/) :lock:|Hard|To Do|To Do|
|1021|[Remove Outermost Parentheses](https://leetcode.com/problems/remove-outermost-parentheses/description/) |Easy|To Do|To Do|
|1022|[Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/description/) |Easy|To Do|To Do|
|1023|[Camelcase Matching](https://leetcode.com/problems/camelcase-matching/description/) |Medium|To Do|To Do|
|1024|[Video Stitching](https://leetcode.com/problems/video-stitching/description/) |Medium|To Do|To Do|
|1085|[Sum of Digits in the Minimum Number](https://leetcode.com/problems/sum-of-digits-in-the-minimum-number/description/) :lock:|Easy|To Do|To Do|
|1099|[Two Sum Less Than K](https://leetcode.com/problems/two-sum-less-than-k/description/) :lock:|Easy|To Do|To Do|
|1100|[Find K-Length Substrings With No Repeated Characters](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/description/) :lock:|Medium|To Do|To Do|
|1101|[The Earliest Moment When Everyone Become Friends](https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends/description/) :lock:|Medium|To Do|To Do|
|1025|[Divisor Game](https://leetcode.com/problems/divisor-game/description/) |Easy|To Do|To Do|
|1027|[Longest Arithmetic Subsequence](https://leetcode.com/problems/longest-arithmetic-subsequence/description/) |Medium|To Do|To Do|
|1118|[Number of Days in a Month](https://leetcode.com/problems/number-of-days-in-a-month/description/) :lock:|Easy|To Do|To Do|
|1119|[Remove Vowels from a String](https://leetcode.com/problems/remove-vowels-from-a-string/description/) :lock:|Easy|To Do|To Do|
|1134|[Armstrong Number](https://leetcode.com/problems/armstrong-number/description/) :lock:|Easy|To Do|To Do|
|1120|[Maximum Average Subtree](https://leetcode.com/problems/maximum-average-subtree/description/) :lock:|Medium|To Do|To Do|
|1026|[Maximum Difference Between Node and Ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/description/) |Medium|To Do|To Do|
|1028|[Recover a Tree From Preorder Traversal](https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/description/) |Hard|To Do|To Do|
|1030|[Matrix Cells in Distance Order](https://leetcode.com/problems/matrix-cells-in-distance-order/description/) |Easy|To Do|To Do|
|1029|[Two City Scheduling](https://leetcode.com/problems/two-city-scheduling/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/1029.%20Two%20City%20Scheduling/TwoCityScheduling.js)|To Do|
|1031|[Maximum Sum of Two Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-two-non-overlapping-subarrays/description/) |Medium|To Do|To Do|
|1032|[Stream of Characters](https://leetcode.com/problems/stream-of-characters/description/) |Hard|To Do|To Do|
|1133|[Largest Unique Number](https://leetcode.com/problems/largest-unique-number/description/) :lock:|Easy|To Do|To Do|
|1102|[Path With Maximum Minimum Value](https://leetcode.com/problems/path-with-maximum-minimum-value/description/) :lock:|Medium|To Do|To Do|
|1135|[Connecting Cities With Minimum Cost](https://leetcode.com/problems/connecting-cities-with-minimum-cost/description/) :lock:|Medium|To Do|To Do|
|1136|[Parallel Courses](https://leetcode.com/problems/parallel-courses/description/) :lock:|Medium|To Do|To Do|
|1150|[Check If a Number Is Majority Element in a Sorted Array](https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/description/) :lock:|Easy|To Do|To Do|
|1033|[Moving Stones Until Consecutive](https://leetcode.com/problems/moving-stones-until-consecutive/description/) |Medium|To Do|To Do|
|1034|[Coloring A Border](https://leetcode.com/problems/coloring-a-border/description/) |Medium|To Do|To Do|
|1035|[Uncrossed Lines](https://leetcode.com/problems/uncrossed-lines/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/1035.%20Uncrossed%20Lines/UncrossedLines.js)|To Do|
|1036|[Escape a Large Maze](https://leetcode.com/problems/escape-a-large-maze/description/) |Hard|To Do|To Do|
|1151|[Minimum Swaps to Group All 1's Together](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together/description/) :lock:|Medium|To Do|To Do|
|1152|[Analyze User Website Visit Pattern](https://leetcode.com/problems/analyze-user-website-visit-pattern/description/) :lock:|Medium|To Do|To Do|
|1039|[Minimum Score Triangulation of Polygon](https://leetcode.com/problems/minimum-score-triangulation-of-polygon/description/) |Medium|To Do|To Do|
|1160|[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/description/) |Easy|To Do|To Do|
|1040|[Moving Stones Until Consecutive II](https://leetcode.com/problems/moving-stones-until-consecutive-ii/description/) |Medium|To Do|To Do|
|1038|[Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/description/) |Medium|To Do|To Do|
|1037|[Valid Boomerang](https://leetcode.com/problems/valid-boomerang/description/) |Easy|To Do|[python](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/1037.%20Valid%20Boomerang/validBoomerang.py)|
|1161|[Maximum Level Sum of a Binary Tree](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/description/) |Medium|To Do|To Do|
|1162|[As Far from Land as Possible](https://leetcode.com/problems/as-far-from-land-as-possible/description/) |Medium|To Do|To Do|
|1121|[Divide Array Into Increasing Sequences](https://leetcode.com/problems/divide-array-into-increasing-sequences/description/) :lock:|Hard|To Do|To Do|
|1041|[Robot Bounded In Circle](https://leetcode.com/problems/robot-bounded-in-circle/description/) |Medium|To Do|To Do|
|1042|[Flower Planting With No Adjacent](https://leetcode.com/problems/flower-planting-with-no-adjacent/description/) |Medium|To Do|To Do|
|1043|[Partition Array for Maximum Sum](https://leetcode.com/problems/partition-array-for-maximum-sum/description/) |Medium|To Do|To Do|
|1044|[Longest Duplicate Substring](https://leetcode.com/problems/longest-duplicate-substring/description/) |Hard|To Do|To Do|
|1165|[Single-Row Keyboard](https://leetcode.com/problems/single-row-keyboard/description/) :lock:|Easy|To Do|To Do|
|1153|[String Transforms Into Another String](https://leetcode.com/problems/string-transforms-into-another-string/description/) :lock:|Hard|To Do|To Do|
|1166|[Design File System](https://leetcode.com/problems/design-file-system/description/) :lock:|Medium|To Do|To Do|
|1167|[Minimum Cost to Connect Sticks](https://leetcode.com/problems/minimum-cost-to-connect-sticks/description/) :lock:|Medium|To Do|To Do|
|1046|[Last Stone Weight](https://leetcode.com/problems/last-stone-weight/description/) |Easy|To Do|To Do|
|1047|[Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/description/) |Easy|To Do|To Do|
|1048|[Longest String Chain](https://leetcode.com/problems/longest-string-chain/description/) |Medium|To Do|To Do|
|1049|[Last Stone Weight II](https://leetcode.com/problems/last-stone-weight-ii/description/) |Medium|To Do|To Do|
|1180|[Count Substrings with Only One Distinct Letter](https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter/description/) :lock:|Easy|To Do|To Do|
|1181|[Before and After Puzzle](https://leetcode.com/problems/before-and-after-puzzle/description/) :lock:|Medium|To Do|To Do|
|1163|[Last Substring in Lexicographical Order](https://leetcode.com/problems/last-substring-in-lexicographical-order/description/) |Hard|To Do|To Do|
|1182|[Shortest Distance to Target Color](https://leetcode.com/problems/shortest-distance-to-target-color/description/) :lock:|Medium|To Do|To Do|
|1045|[Customers Who Bought All Products](https://leetcode.com/problems/customers-who-bought-all-products/description/) |Medium|To Do|To Do|
|1050|[Actors and Directors Who Cooperated At Least Three Times](https://leetcode.com/problems/actors-and-directors-who-cooperated-at-least-three-times/description/) |Easy|To Do|To Do|
|1051|[Height Checker](https://leetcode.com/problems/height-checker/description/) |Easy|To Do|To Do|
|1052|[Grumpy Bookstore Owner](https://leetcode.com/problems/grumpy-bookstore-owner/description/) |Medium|To Do|To Do|
|1053|[Previous Permutation With One Swap](https://leetcode.com/problems/previous-permutation-with-one-swap/description/) |Medium|To Do|To Do|
|1054|[Distant Barcodes](https://leetcode.com/problems/distant-barcodes/description/) |Medium|To Do|To Do|
|1196|[How Many Apples Can You Put into the Basket](https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket/description/) :lock:|Easy|To Do|To Do|
|1197|[Minimum Knight Moves](https://leetcode.com/problems/minimum-knight-moves/description/) :lock:|Medium|To Do|To Do|
|1198|[Find Smallest Common Element in All Rows](https://leetcode.com/problems/find-smallest-common-element-in-all-rows/description/) :lock:|Medium|To Do|To Do|
|1168|[Optimize Water Distribution in a Village](https://leetcode.com/problems/optimize-water-distribution-in-a-village/description/) :lock:|Hard|To Do|To Do|
|1074|[Number of Submatrices That Sum to Target](https://leetcode.com/problems/number-of-submatrices-that-sum-to-target/description/) |Hard|To Do|To Do|
|1071|[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/description/) |Easy|To Do|To Do|
|1072|[Flip Columns For Maximum Number of Equal Rows](https://leetcode.com/problems/flip-columns-for-maximum-number-of-equal-rows/description/) |Medium|To Do|To Do|
|1073|[Adding Two Negabinary Numbers](https://leetcode.com/problems/adding-two-negabinary-numbers/description/) |Medium|To Do|To Do|
|1213|[Intersection of Three Sorted Arrays](https://leetcode.com/problems/intersection-of-three-sorted-arrays/description/) :lock:|Easy|To Do|To Do|
|1214|[Two Sum BSTs](https://leetcode.com/problems/two-sum-bsts/description/) :lock:|Medium|To Do|To Do|
|1215|[Stepping Numbers](https://leetcode.com/problems/stepping-numbers/description/) :lock:|Medium|To Do|To Do|
|1183|[Maximum Number of Ones](https://leetcode.com/problems/maximum-number-of-ones/description/) :lock:|Hard|To Do|To Do|
|1068|[Product Sales Analysis I](https://leetcode.com/problems/product-sales-analysis-i/description/) |Easy|To Do|To Do|
|1069|[Product Sales Analysis II](https://leetcode.com/problems/product-sales-analysis-ii/description/) :lock:|Easy|To Do|To Do|
|1070|[Product Sales Analysis III](https://leetcode.com/problems/product-sales-analysis-iii/description/) |Medium|To Do|To Do|
|1078|[Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/description/) |Easy|To Do|To Do|
|1080|[Insufficient Nodes in Root to Leaf Paths](https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths/description/) |Medium|To Do|To Do|
|1081|[Smallest Subsequence of Distinct Characters](https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/description/) |Medium|To Do|To Do|
|1079|[Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities/description/) |Medium|To Do|To Do|
|1075|[Project Employees I](https://leetcode.com/problems/project-employees-i/description/) |Easy|To Do|To Do|
|1076|[Project Employees II](https://leetcode.com/problems/project-employees-ii/description/) :lock:|Easy|To Do|To Do|
|1077|[Project Employees III](https://leetcode.com/problems/project-employees-iii/description/) :lock:|Medium|To Do|To Do|
|1228|[Missing Number In Arithmetic Progression](https://leetcode.com/problems/missing-number-in-arithmetic-progression/description/) :lock:|Easy|To Do|To Do|
|1229|[Meeting Scheduler](https://leetcode.com/problems/meeting-scheduler/description/) :lock:|Medium|To Do|To Do|
|1230|[Toss Strange Coins](https://leetcode.com/problems/toss-strange-coins/description/) :lock:|Medium|To Do|To Do|
|1199|[Minimum Time to Build Blocks](https://leetcode.com/problems/minimum-time-to-build-blocks/description/) :lock:|Hard|To Do|To Do|
|1089|[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/description/) |Easy|To Do|To Do|
|1090|[Largest Values From Labels](https://leetcode.com/problems/largest-values-from-labels/description/) |Medium|To Do|To Do|
|1092|[Shortest Common Supersequence ](https://leetcode.com/problems/shortest-common-supersequence/description/) |Hard|To Do|To Do|
|1091|[Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/description/) |Medium|To Do|To Do|
|1082|[Sales Analysis I](https://leetcode.com/problems/sales-analysis-i/description/) :lock:|Easy|To Do|To Do|
|1083|[Sales Analysis II](https://leetcode.com/problems/sales-analysis-ii/description/) :lock:|Easy|To Do|To Do|
|1084|[Sales Analysis III](https://leetcode.com/problems/sales-analysis-iii/description/) |Easy|To Do|To Do|
|1243|[Array Transformation](https://leetcode.com/problems/array-transformation/description/) :lock:|Easy|To Do|To Do|
|1244|[Design A Leaderboard](https://leetcode.com/problems/design-a-leaderboard/description/) :lock:|Medium|To Do|To Do|
|1245|[Tree Diameter](https://leetcode.com/problems/tree-diameter/description/) :lock:|Medium|To Do|To Do|
|1216|[Valid Palindrome III](https://leetcode.com/problems/valid-palindrome-iii/description/) :lock:|Hard|To Do|To Do|
|511|[Game Play Analysis I](https://leetcode.com/problems/game-play-analysis-i/description/) |Easy|To Do|To Do|
|512|[Game Play Analysis II](https://leetcode.com/problems/game-play-analysis-ii/description/) :lock:|Easy|To Do|To Do|
|534|[Game Play Analysis III](https://leetcode.com/problems/game-play-analysis-iii/description/) :lock:|Medium|To Do|To Do|
|550|[Game Play Analysis IV](https://leetcode.com/problems/game-play-analysis-iv/description/) |Medium|To Do|To Do|
|1093|[Statistics from a Large Sample](https://leetcode.com/problems/statistics-from-a-large-sample/description/) |Medium|To Do|To Do|
|1094|[Car Pooling](https://leetcode.com/problems/car-pooling/description/) |Medium|To Do|To Do|
|1095|[Find in Mountain Array](https://leetcode.com/problems/find-in-mountain-array/description/) |Hard|To Do|To Do|
|1117|[Building H2O](https://leetcode.com/problems/building-h2o/description/) |Medium|To Do|To Do|
|1115|[Print FooBar Alternately](https://leetcode.com/problems/print-foobar-alternately/description/) |Medium|To Do|To Do|
|1096|[Brace Expansion II](https://leetcode.com/problems/brace-expansion-ii/description/) |Hard|To Do|To Do|
|1256|[Encode Number](https://leetcode.com/problems/encode-number/description/) :lock:|Medium|To Do|To Do|
|1257|[Smallest Common Region](https://leetcode.com/problems/smallest-common-region/description/) :lock:|Medium|To Do|To Do|
|1258|[Synonymous Sentences](https://leetcode.com/problems/synonymous-sentences/description/) :lock:|Medium|To Do|To Do|
|1231|[Divide Chocolate](https://leetcode.com/problems/divide-chocolate/description/) :lock:|Hard|To Do|To Do|
|1097|[Game Play Analysis V](https://leetcode.com/problems/game-play-analysis-v/description/) :lock:|Hard|To Do|To Do|
|1104|[Path In Zigzag Labelled Binary Tree](https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/description/) |Medium|To Do|To Do|
|1103|[Distribute Candies to People](https://leetcode.com/problems/distribute-candies-to-people/description/) |Easy|To Do|To Do|
|1105|[Filling Bookcase Shelves](https://leetcode.com/problems/filling-bookcase-shelves/description/) |Medium|To Do|To Do|
|1106|[Parsing A Boolean Expression](https://leetcode.com/problems/parsing-a-boolean-expression/description/) |Hard|To Do|To Do|
|1098|[Unpopular Books](https://leetcode.com/problems/unpopular-books/description/) :lock:|Medium|To Do|To Do|
|1271|[Hexspeak](https://leetcode.com/problems/hexspeak/description/) :lock:|Easy|To Do|To Do|
|1272|[Remove Interval](https://leetcode.com/problems/remove-interval/description/) :lock:|Medium|To Do|To Do|
|1273|[Delete Tree Nodes](https://leetcode.com/problems/delete-tree-nodes/description/) :lock:|Medium|To Do|To Do|
|1246|[Palindrome Removal](https://leetcode.com/problems/palindrome-removal/description/) :lock:|Hard|To Do|To Do|
|1114|[Print in Order](https://leetcode.com/problems/print-in-order/description/) |Easy|To Do|To Do|
|1107|[New Users Daily Count](https://leetcode.com/problems/new-users-daily-count/description/) :lock:|Medium|To Do|To Do|
|1108|[Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address/description/) |Easy|To Do|To Do|
|1109|[Corporate Flight Bookings](https://leetcode.com/problems/corporate-flight-bookings/description/) |Medium|To Do|To Do|
|1110|[Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest/description/) |Medium|To Do|To Do|
|1111|[Maximum Nesting Depth of Two Valid Parentheses Strings](https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/description/) |Medium|To Do|To Do|
|1188|[Design Bounded Blocking Queue](https://leetcode.com/problems/design-bounded-blocking-queue/description/) :lock:|Medium|To Do|To Do|
|1619|[Mean of Array After Removing Some Elements](https://leetcode.com/problems/mean-of-array-after-removing-some-elements/description/) |Easy|To Do|To Do|
|1286|[Iterator for Combination](https://leetcode.com/problems/iterator-for-combination/description/) |Medium|To Do|To Do|
|1291|[Sequential Digits](https://leetcode.com/problems/sequential-digits/description/) |Medium|To Do|To Do|
|1259|[Handshakes That Don't Cross](https://leetcode.com/problems/handshakes-that-dont-cross/description/) :lock:|Hard|To Do|To Do|
|1112|[Highest Grade For Each Student](https://leetcode.com/problems/highest-grade-for-each-student/description/) :lock:|Medium|To Do|To Do|
|1113|[Reported Posts](https://leetcode.com/problems/reported-posts/description/) :lock:|Easy|To Do|To Do|
|1116|[Print Zero Even Odd](https://leetcode.com/problems/print-zero-even-odd/description/) |Medium|To Do|To Do|
|1122|[Relative Sort Array](https://leetcode.com/problems/relative-sort-array/description/) |Easy|To Do|To Do|
|1123|[Lowest Common Ancestor of Deepest Leaves](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/description/) |Medium|To Do|To Do|
|1124|[Longest Well-Performing Interval](https://leetcode.com/problems/longest-well-performing-interval/description/) |Medium|To Do|To Do|
|1125|[Smallest Sufficient Team](https://leetcode.com/problems/smallest-sufficient-team/description/) |Hard|To Do|To Do|
|1287|[Element Appearing More Than 25% In Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/description/) |Easy|To Do|To Do|
|1288|[Remove Covered Intervals](https://leetcode.com/problems/remove-covered-intervals/description/) |Medium|To Do|To Do|
|1627|[Graph Connectivity With Threshold](https://leetcode.com/problems/graph-connectivity-with-threshold/description/) |Hard|To Do|To Do|
|1289|[Minimum Falling Path Sum II](https://leetcode.com/problems/minimum-falling-path-sum-ii/description/) |Hard|To Do|To Do|
|1126|[Active Businesses](https://leetcode.com/problems/active-businesses/description/) :lock:|Medium|To Do|To Do|
|1127|[User Purchase Platform](https://leetcode.com/problems/user-purchase-platform/description/) :lock:|Hard|To Do|To Do|
|1128|[Number of Equivalent Domino Pairs](https://leetcode.com/problems/number-of-equivalent-domino-pairs/description/) |Easy|To Do|To Do|
|1130|[Minimum Cost Tree From Leaf Values](https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/description/) |Medium|To Do|To Do|
|1129|[Shortest Path with Alternating Colors](https://leetcode.com/problems/shortest-path-with-alternating-colors/description/) |Medium|To Do|To Do|
|1131|[Maximum of Absolute Value Expression](https://leetcode.com/problems/maximum-of-absolute-value-expression/description/) |Medium|To Do|To Do|
|1299|[Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/description/) |Easy|To Do|To Do|
|1300|[Sum of Mutated Array Closest to Target](https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/description/) |Medium|To Do|To Do|
|1274|[Number of Ships in a Rectangle](https://leetcode.com/problems/number-of-ships-in-a-rectangle/description/) :lock:|Hard|To Do|To Do|
|1301|[Number of Paths with Max Score](https://leetcode.com/problems/number-of-paths-with-max-score/description/) |Hard|To Do|To Do|
|1137|[N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/description/) |Easy|To Do|To Do|
|1132|[Reported Posts II](https://leetcode.com/problems/reported-posts-ii/description/) :lock:|Medium|To Do|To Do|
|1138|[Alphabet Board Path](https://leetcode.com/problems/alphabet-board-path/description/) |Medium|To Do|To Do|
|1139|[Largest 1-Bordered Square](https://leetcode.com/problems/largest-1-bordered-square/description/) |Medium|To Do|To Do|
|1140|[Stone Game II](https://leetcode.com/problems/stone-game-ii/description/) |Medium|To Do|To Do|
|1313|[Decompress Run-Length Encoded List](https://leetcode.com/problems/decompress-run-length-encoded-list/description/) |Easy|To Do|To Do|
|1314|[Matrix Block Sum](https://leetcode.com/problems/matrix-block-sum/description/) |Medium|To Do|To Do|
|1315|[Sum of Nodes with Even-Valued Grandparent](https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/description/) |Medium|To Do|To Do|
|1316|[Distinct Echo Substrings](https://leetcode.com/problems/distinct-echo-substrings/description/) |Hard|To Do|To Do|
|1141|[User Activity for the Past 30 Days I](https://leetcode.com/problems/user-activity-for-the-past-30-days-i/description/) |Easy|To Do|To Do|
|1142|[User Activity for the Past 30 Days II](https://leetcode.com/problems/user-activity-for-the-past-30-days-ii/description/) :lock:|Easy|To Do|To Do|
|1144|[Decrease Elements To Make Array Zigzag](https://leetcode.com/problems/decrease-elements-to-make-array-zigzag/description/) |Medium|To Do|To Do|
|1145|[Binary Tree Coloring Game](https://leetcode.com/problems/binary-tree-coloring-game/description/) |Medium|To Do|To Do|
|1146|[Snapshot Array](https://leetcode.com/problems/snapshot-array/description/) |Medium|To Do|To Do|
|1143|[Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/description/) |Medium|To Do|To Do|
|1147|[Longest Chunked Palindrome Decomposition](https://leetcode.com/problems/longest-chunked-palindrome-decomposition/description/) |Hard|To Do|To Do|
|1328|[Break a Palindrome](https://leetcode.com/problems/break-a-palindrome/description/) |Medium|To Do|To Do|
|1329|[Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/description/) |Medium|To Do|To Do|
|1302|[Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/description/) |Medium|To Do|To Do|
|1330|[Reverse Subarray To Maximize Array Value](https://leetcode.com/problems/reverse-subarray-to-maximize-array-value/description/) |Hard|To Do|To Do|
|1331|[Rank Transform of an Array](https://leetcode.com/problems/rank-transform-of-an-array/description/) |Easy|To Do|To Do|
|1632|[Rank Transform of a Matrix](https://leetcode.com/problems/rank-transform-of-a-matrix/description/) |Hard|To Do|To Do|
|1148|[Article Views I](https://leetcode.com/problems/article-views-i/description/) |Easy|To Do|To Do|
|1149|[Article Views II](https://leetcode.com/problems/article-views-ii/description/) :lock:|Medium|To Do|To Do|
|1154|[Day of the Year](https://leetcode.com/problems/day-of-the-year/description/) |Easy|To Do|To Do|
|1156|[Swap For Longest Repeated Character Substring](https://leetcode.com/problems/swap-for-longest-repeated-character-substring/description/) |Medium|To Do|To Do|
|1157|[Online Majority Element In Subarray](https://leetcode.com/problems/online-majority-element-in-subarray/description/) |Hard|To Do|To Do|
|1155|[Number of Dice Rolls With Target Sum](https://leetcode.com/problems/number-of-dice-rolls-with-target-sum/description/) |Medium|To Do|To Do|
|1935|[Maximum Number of Words You Can Type](https://leetcode.com/problems/maximum-number-of-words-you-can-type/description/) |Easy|To Do|To Do|
|1171|[Remove Zero Sum Consecutive Nodes from Linked List](https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/description/) |Medium|To Do|To Do|
|1158|[Market Analysis I](https://leetcode.com/problems/market-analysis-i/description/) |Medium|To Do|To Do|
|1159|[Market Analysis II](https://leetcode.com/problems/market-analysis-ii/description/) :lock:|Hard|To Do|To Do|
|1172|[Dinner Plate Stacks](https://leetcode.com/problems/dinner-plate-stacks/description/) |Hard|To Do|To Do|
|1236|[Web Crawler](https://leetcode.com/problems/web-crawler/description/) :lock:|Medium|To Do|To Do|
|1169|[Invalid Transactions](https://leetcode.com/problems/invalid-transactions/description/) |Medium|To Do|To Do|
|1170|[Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/description/) |Medium|To Do|To Do|
|1360|[Number of Days Between Two Dates](https://leetcode.com/problems/number-of-days-between-two-dates/description/) |Easy|To Do|To Do|
|1361|[Validate Binary Tree Nodes](https://leetcode.com/problems/validate-binary-tree-nodes/description/) |Medium|To Do|To Do|
|1362|[Closest Divisors](https://leetcode.com/problems/closest-divisors/description/) |Medium|To Do|To Do|
|1363|[Largest Multiple of Three](https://leetcode.com/problems/largest-multiple-of-three/description/) |Hard|To Do|To Do|
|1164|[Product Price at a Given Date](https://leetcode.com/problems/product-price-at-a-given-date/description/) |Medium|To Do|To Do|
|1175|[Prime Arrangements](https://leetcode.com/problems/prime-arrangements/description/) |Easy|To Do|To Do|
|1176|[Diet Plan Performance](https://leetcode.com/problems/diet-plan-performance/description/) :lock:|Easy|To Do|To Do|
|1177|[Can Make Palindrome from Substring](https://leetcode.com/problems/can-make-palindrome-from-substring/description/) |Medium|To Do|To Do|
|1178|[Number of Valid Words for Each Puzzle](https://leetcode.com/problems/number-of-valid-words-for-each-puzzle/description/) |Hard|To Do|To Do|
|1507|[Reformat Date](https://leetcode.com/problems/reformat-date/description/) |Easy|To Do|To Do|
|1390|[Four Divisors](https://leetcode.com/problems/four-divisors/description/) |Medium|To Do|To Do|
|1382|[Balance a Binary Search Tree](https://leetcode.com/problems/balance-a-binary-search-tree/description/) |Medium|To Do|To Do|
|1425|[Constrained Subsequence Sum](https://leetcode.com/problems/constrained-subsequence-sum/description/) |Hard|To Do|To Do|
|1184|[Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops/description/) |Easy|To Do|To Do|
|1186|[Maximum Subarray Sum with One Deletion](https://leetcode.com/problems/maximum-subarray-sum-with-one-deletion/description/) |Medium|To Do|To Do|
|1185|[Day of the Week](https://leetcode.com/problems/day-of-the-week/description/) |Easy|To Do|To Do|
|1187|[Make Array Strictly Increasing](https://leetcode.com/problems/make-array-strictly-increasing/description/) |Hard|To Do|To Do|
|1173|[Immediate Food Delivery I](https://leetcode.com/problems/immediate-food-delivery-i/description/) :lock:|Easy|To Do|To Do|
|1174|[Immediate Food Delivery II](https://leetcode.com/problems/immediate-food-delivery-ii/description/) |Medium|To Do|To Do|
|1550|[Three Consecutive Odds](https://leetcode.com/problems/three-consecutive-odds/description/) |Easy|To Do|To Do|
|2080|[Range Frequency Queries](https://leetcode.com/problems/range-frequency-queries/description/) |Medium|To Do|To Do|
|1954|[Minimum Garden Perimeter to Collect Enough Apples](https://leetcode.com/problems/minimum-garden-perimeter-to-collect-enough-apples/description/) |Medium|To Do|To Do|
|1483|[Kth Ancestor of a Tree Node](https://leetcode.com/problems/kth-ancestor-of-a-tree-node/description/) |Hard|To Do|To Do|
|1189|[Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/description/) |Easy|To Do|To Do|
|1190|[Reverse Substrings Between Each Pair of Parentheses](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/description/) |Medium|To Do|To Do|
|1191|[K-Concatenation Maximum Sum](https://leetcode.com/problems/k-concatenation-maximum-sum/description/) |Medium|To Do|To Do|
|1192|[Critical Connections in a Network](https://leetcode.com/problems/critical-connections-in-a-network/description/) |Hard|To Do|To Do|
|1179|[Reformat Department Table](https://leetcode.com/problems/reformat-department-table/description/) |Easy|To Do|To Do|
|1957|[Delete Characters to Make Fancy String](https://leetcode.com/problems/delete-characters-to-make-fancy-string/description/) |Easy|To Do|To Do|
|2139|[Minimum Moves to Reach Target Score](https://leetcode.com/problems/minimum-moves-to-reach-target-score/description/) |Medium|To Do|To Do|
|1405|[Longest Happy String](https://leetcode.com/problems/longest-happy-string/description/) |Medium|To Do|To Do|
|1944|[Number of Visible People in a Queue](https://leetcode.com/problems/number-of-visible-people-in-a-queue/description/) |Hard|To Do|To Do|
|1200|[Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/description/) |Easy|To Do|To Do|
|1201|[Ugly Number III](https://leetcode.com/problems/ugly-number-iii/description/) |Medium|To Do|To Do|
|1202|[Smallest String With Swaps](https://leetcode.com/problems/smallest-string-with-swaps/description/) |Medium|To Do|To Do|
|1203|[Sort Items by Groups Respecting Dependencies](https://leetcode.com/problems/sort-items-by-groups-respecting-dependencies/description/) |Hard|To Do|To Do|
|2079|[Watering Plants](https://leetcode.com/problems/watering-plants/description/) |Medium|To Do|To Do|
|1895|[Largest Magic Square](https://leetcode.com/problems/largest-magic-square/description/) |Medium|To Do|To Do|
|2201|[Count Artifacts That Can Be Extracted](https://leetcode.com/problems/count-artifacts-that-can-be-extracted/description/) |Medium|To Do|To Do|
|1916|[Count Ways to Build Rooms in an Ant Colony](https://leetcode.com/problems/count-ways-to-build-rooms-in-an-ant-colony/description/) |Hard|To Do|To Do|
|1195|[Fizz Buzz Multithreaded](https://leetcode.com/problems/fizz-buzz-multithreaded/description/) |Medium|To Do|To Do|
|1193|[Monthly Transactions I](https://leetcode.com/problems/monthly-transactions-i/description/) |Medium|To Do|To Do|
|1194|[Tournament Winners](https://leetcode.com/problems/tournament-winners/description/) :lock:|Hard|To Do|To Do|
|1207|[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/description/) |Easy|To Do|To Do|
|1209|[Remove All Adjacent Duplicates in String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/description/) |Medium|To Do|To Do|
|1208|[Get Equal Substrings Within Budget](https://leetcode.com/problems/get-equal-substrings-within-budget/description/) |Medium|To Do|To Do|
|1210|[Minimum Moves to Reach Target with Rotations](https://leetcode.com/problems/minimum-moves-to-reach-target-with-rotations/description/) |Hard|To Do|To Do|
|1706|[Where Will the Ball Fall](https://leetcode.com/problems/where-will-the-ball-fall/description/) |Medium|To Do|To Do|
|1514|[Path with Maximum Probability](https://leetcode.com/problems/path-with-maximum-probability/description/) |Medium|To Do|To Do|
|1862|[Sum of Floored Pairs](https://leetcode.com/problems/sum-of-floored-pairs/description/) |Hard|To Do|To Do|
|1204|[Last Person to Fit in the Bus](https://leetcode.com/problems/last-person-to-fit-in-the-bus/description/) |Medium|To Do|To Do|
|1205|[Monthly Transactions II](https://leetcode.com/problems/monthly-transactions-ii/description/) :lock:|Medium|To Do|To Do|
|1217|[Minimum Cost to Move Chips to The Same Position](https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position/description/) |Easy|To Do|To Do|
|1218|[Longest Arithmetic Subsequence of Given Difference](https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference/description/) |Medium|To Do|To Do|
|1219|[Path with Maximum Gold](https://leetcode.com/problems/path-with-maximum-gold/description/) |Medium|To Do|To Do|
|1220|[Count Vowels Permutation](https://leetcode.com/problems/count-vowels-permutation/description/) |Hard|To Do|To Do|
|2191|[Sort the Jumbled Numbers](https://leetcode.com/problems/sort-the-jumbled-numbers/description/) |Medium|To Do|To Do|
|2310|[Sum of Numbers With Units Digit K](https://leetcode.com/problems/sum-of-numbers-with-units-digit-k/description/) |Medium|To Do|To Do|
|2226|[Maximum Candies Allocated to K Children](https://leetcode.com/problems/maximum-candies-allocated-to-k-children/description/) |Medium|To Do|To Do|
|1960|[Maximum Product of the Length of Two Palindromic Substrings](https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-substrings/description/) |Hard|To Do|To Do|
|1206|[Design Skiplist](https://leetcode.com/problems/design-skiplist/description/) |Hard|To Do|To Do|
|1211|[Queries Quality and Percentage](https://leetcode.com/problems/queries-quality-and-percentage/description/) |Easy|To Do|To Do|
|1212|[Team Scores in Football Tournament](https://leetcode.com/problems/team-scores-in-football-tournament/description/) :lock:|Medium|To Do|To Do|
|1226|[The Dining Philosophers](https://leetcode.com/problems/the-dining-philosophers/description/) |Medium|To Do|To Do|
|1221|[Split a String in Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings/description/) |Easy|To Do|To Do|
|1222|[Queens That Can Attack the King](https://leetcode.com/problems/queens-that-can-attack-the-king/description/) |Medium|To Do|To Do|
|1223|[Dice Roll Simulation](https://leetcode.com/problems/dice-roll-simulation/description/) |Hard|To Do|To Do|
|1224|[Maximum Equal Frequency](https://leetcode.com/problems/maximum-equal-frequency/description/) |Hard|To Do|To Do|
|1427|[Perform String Shifts](https://leetcode.com/problems/perform-string-shifts/description/) :lock:|Easy|To Do|To Do|
|2202|[Maximize the Topmost Element After K Moves](https://leetcode.com/problems/maximize-the-topmost-element-after-k-moves/description/) |Medium|To Do|To Do|
|2204|[Distance to a Cycle in Undirected Graph](https://leetcode.com/problems/distance-to-a-cycle-in-undirected-graph/description/) :lock:|Hard|To Do|To Do|
|2321|[Maximum Score Of Spliced Array](https://leetcode.com/problems/maximum-score-of-spliced-array/description/) |Hard|To Do|To Do|
|1232|[Check If It Is a Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line/description/) |Easy|To Do|To Do|
|1233|[Remove Sub-Folders from the Filesystem](https://leetcode.com/problems/remove-sub-folders-from-the-filesystem/description/) |Medium|To Do|To Do|
|1234|[Replace the Substring for Balanced String](https://leetcode.com/problems/replace-the-substring-for-balanced-string/description/) |Medium|To Do|To Do|
|1235|[Maximum Profit in Job Scheduling](https://leetcode.com/problems/maximum-profit-in-job-scheduling/description/) |Hard|To Do|To Do|
|2273|[Find Resultant Array After Removing Anagrams](https://leetcode.com/problems/find-resultant-array-after-removing-anagrams/description/) |Easy|To Do|To Do|
|2225|[Find Players With Zero or One Losses](https://leetcode.com/problems/find-players-with-zero-or-one-losses/description/) |Medium|To Do|To Do|
|2216|[Minimum Deletions to Make Array Beautiful](https://leetcode.com/problems/minimum-deletions-to-make-array-beautiful/description/) |Medium|To Do|To Do|
|2193|[Minimum Number of Moves to Make Palindrome](https://leetcode.com/problems/minimum-number-of-moves-to-make-palindrome/description/) |Hard|To Do|To Do|
|1225|[Report Contiguous Dates](https://leetcode.com/problems/report-contiguous-dates/description/) :lock:|Hard|To Do|To Do|
|1237|[Find Positive Integer Solution for a Given Equation](https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/description/) |Medium|To Do|To Do|
|1238|[Circular Permutation in Binary Representation](https://leetcode.com/problems/circular-permutation-in-binary-representation/description/) |Medium|To Do|To Do|
|1239|[Maximum Length of a Concatenated String with Unique Characters](https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters/description/) |Medium|To Do|To Do|
|1240|[Tiling a Rectangle with the Fewest Squares](https://leetcode.com/problems/tiling-a-rectangle-with-the-fewest-squares/description/) |Hard|To Do|To Do|
|1227|[Airplane Seat Assignment Probability](https://leetcode.com/problems/airplane-seat-assignment-probability/description/) |Medium|To Do|To Do|
|2309|[Greatest English Letter in Upper and Lower Case](https://leetcode.com/problems/greatest-english-letter-in-upper-and-lower-case/description/) |Easy|To Do|To Do|
|1726|[Tuple with Same Product](https://leetcode.com/problems/tuple-with-same-product/description/) |Medium|To Do|To Do|
|1429|[First Unique Number](https://leetcode.com/problems/first-unique-number/description/) :lock:|Medium|To Do|To Do|
|1691|[Maximum Height by Stacking Cuboids ](https://leetcode.com/problems/maximum-height-by-stacking-cuboids/description/) |Hard|To Do|To Do|
|1242|[Web Crawler Multithreaded](https://leetcode.com/problems/web-crawler-multithreaded/description/) :lock:|Medium|To Do|To Do|
|1247|[Minimum Swaps to Make Strings Equal](https://leetcode.com/problems/minimum-swaps-to-make-strings-equal/description/) |Medium|To Do|To Do|
|1248|[Count Number of Nice Subarrays](https://leetcode.com/problems/count-number-of-nice-subarrays/description/) |Medium|To Do|To Do|
|1249|[Minimum Remove to Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/description/) |Medium|To Do|To Do|
|1250|[Check If It Is a Good Array](https://leetcode.com/problems/check-if-it-is-a-good-array/description/) |Hard|To Do|To Do|
|1428|[Leftmost Column with at Least a One](https://leetcode.com/problems/leftmost-column-with-at-least-a-one/description/) :lock:|Medium|To Do|To Do|
|2217|[Find Palindrome With Fixed Length](https://leetcode.com/problems/find-palindrome-with-fixed-length/description/) |Medium|To Do|To Do|
|2312|[Selling Pieces of Wood](https://leetcode.com/problems/selling-pieces-of-wood/description/) |Hard|To Do|To Do|
|1241|[Number of Comments per Post](https://leetcode.com/problems/number-of-comments-per-post/description/) :lock:|Easy|To Do|To Do|
|1252|[Cells with Odd Values in a Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/description/) |Easy|To Do|To Do|
|1253|[Reconstruct a 2-Row Binary Matrix](https://leetcode.com/problems/reconstruct-a-2-row-binary-matrix/description/) |Medium|To Do|To Do|
|1254|[Number of Closed Islands](https://leetcode.com/problems/number-of-closed-islands/description/) |Medium|To Do|To Do|
|1255|[Maximum Score Words Formed by Letters](https://leetcode.com/problems/maximum-score-words-formed-by-letters/description/) |Hard|To Do|To Do|
|2303|[Calculate Amount Paid in Taxes](https://leetcode.com/problems/calculate-amount-paid-in-taxes/description/) |Easy|To Do|To Do|
|2198|[Number of Single Divisor Triplets](https://leetcode.com/problems/number-of-single-divisor-triplets/description/) :lock:|Medium|To Do|To Do|
|1618|[Maximum Font to Fit a Sentence in a Screen](https://leetcode.com/problems/maximum-font-to-fit-a-sentence-in-a-screen/description/) :lock:|Medium|To Do|To Do|
|2189|[Number of Ways to Build House of Cards](https://leetcode.com/problems/number-of-ways-to-build-house-of-cards/description/) :lock:|Medium|To Do|To Do|
|1260|[Shift 2D Grid](https://leetcode.com/problems/shift-2d-grid/description/) |Easy|To Do|To Do|
|1261|[Find Elements in a Contaminated Binary Tree](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/description/) |Medium|To Do|To Do|
|1262|[Greatest Sum Divisible by Three](https://leetcode.com/problems/greatest-sum-divisible-by-three/description/) |Medium|To Do|To Do|
|1263|[Minimum Moves to Move a Box to Their Target Location](https://leetcode.com/problems/minimum-moves-to-move-a-box-to-their-target-location/description/) |Hard|To Do|To Do|
|1251|[Average Selling Price](https://leetcode.com/problems/average-selling-price/description/) |Easy|To Do|To Do|
|1426|[Counting Elements](https://leetcode.com/problems/counting-elements/description/) :lock:|Easy|To Do|To Do|
|2215|[Find the Difference of Two Arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays/description/) |Easy|To Do|To Do|
|2218|[Maximum Value of K Coins From Piles](https://leetcode.com/problems/maximum-value-of-k-coins-from-piles/description/) |Hard|To Do|To Do|
|2304|[Minimum Path Cost in a Grid](https://leetcode.com/problems/minimum-path-cost-in-a-grid/description/) |Medium|To Do|To Do|
|1266|[Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points/description/) |Easy|To Do|To Do|
|1267|[Count Servers that Communicate](https://leetcode.com/problems/count-servers-that-communicate/description/) |Medium|To Do|To Do|
|1268|[Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/description/) |Medium|To Do|To Do|
|1269|[Number of Ways to Stay in the Same Place After Some Steps](https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/description/) |Hard|To Do|To Do|
|1264|[Page Recommendations](https://leetcode.com/problems/page-recommendations/description/) :lock:|Medium|To Do|To Do|
|1275|[Find Winner on a Tic Tac Toe Game](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/description/) |Easy|To Do|To Do|
|1276|[Number of Burgers with No Waste of Ingredients](https://leetcode.com/problems/number-of-burgers-with-no-waste-of-ingredients/description/) |Medium|To Do|To Do|
|1277|[Count Square Submatrices with All Ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones/description/) |Medium|[JavaScript](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/1277.%20Count%20Square%20Submatrices%20with%20All%20Ones/CountSquareSubmatricesWithAllOnes.js)|To Do|
|1278|[Palindrome Partitioning III](https://leetcode.com/problems/palindrome-partitioning-iii/description/) |Hard|To Do|To Do|
|1265|[Print Immutable Linked List in Reverse](https://leetcode.com/problems/print-immutable-linked-list-in-reverse/description/) :lock:|Medium|To Do|To Do|
|1270|[All People Report to the Given Manager](https://leetcode.com/problems/all-people-report-to-the-given-manager/description/) :lock:|Medium|To Do|To Do|
|1281|[Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/description/) |Easy|To Do|To Do|
|1282|[Group the People Given the Group Size They Belong To](https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/description/) |Medium|To Do|To Do|
|1283|[Find the Smallest Divisor Given a Threshold](https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/description/) |Medium|To Do|To Do|
|1284|[Minimum Number of Flips to Convert Binary Matrix to Zero Matrix](https://leetcode.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/description/) |Hard|To Do|To Do|
|1279|[Traffic Light Controlled Intersection](https://leetcode.com/problems/traffic-light-controlled-intersection/description/) :lock:|Easy|To Do|To Do|
|1290|[Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/description/) |Easy|To Do|To Do|
|1292|[Maximum Side Length of a Square with Sum Less than or Equal to Threshold](https://leetcode.com/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/description/) |Medium|To Do|To Do|
|1293|[Shortest Path in a Grid with Obstacles Elimination](https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/description/) |Hard|To Do|To Do|
|1280|[Students and Examinations](https://leetcode.com/problems/students-and-examinations/description/) |Easy|To Do|To Do|
|2229|[Check if an Array Is Consecutive](https://leetcode.com/problems/check-if-an-array-is-consecutive/description/) :lock:|Easy|To Do|To Do|
|2305|[Fair Distribution of Cookies](https://leetcode.com/problems/fair-distribution-of-cookies/description/) |Medium|To Do|To Do|
|2263|[Make Array Non-decreasing or Non-increasing](https://leetcode.com/problems/make-array-non-decreasing-or-non-increasing/description/) :lock:|Hard|To Do|To Do|
|1285|[Find the Start and End Number of Continuous Ranges](https://leetcode.com/problems/find-the-start-and-end-number-of-continuous-ranges/description/) :lock:|Medium|To Do|To Do|
|1295|[Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/description/) |Easy|To Do|To Do|
|1296|[Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/description/) |Medium|To Do|To Do|
|1297|[Maximum Number of Occurrences of a Substring](https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/description/) |Medium|To Do|To Do|
|1298|[Maximum Candies You Can Get from Boxes](https://leetcode.com/problems/maximum-candies-you-can-get-from-boxes/description/) |Hard|To Do|To Do|
|1294|[Weather Type in Each Country](https://leetcode.com/problems/weather-type-in-each-country/description/) :lock:|Easy|To Do|To Do|
|1304|[Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/description/) |Easy|To Do|To Do|
|1305|[All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/description/) |Medium|To Do|To Do|
|1306|[Jump Game III](https://leetcode.com/problems/jump-game-iii/description/) |Medium|To Do|To Do|
|1307|[Verbal Arithmetic Puzzle](https://leetcode.com/problems/verbal-arithmetic-puzzle/description/) |Hard|To Do|To Do|
|2269|[Find the K-Beauty of a Number](https://leetcode.com/problems/find-the-k-beauty-of-a-number/description/) |Easy|To Do|To Do|
|2192|[All Ancestors of a Node in a Directed Acyclic Graph](https://leetcode.com/problems/all-ancestors-of-a-node-in-a-directed-acyclic-graph/description/) |Medium|To Do|To Do|
|1430|[Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree](https://leetcode.com/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree/description/) :lock:|Medium|To Do|To Do|
|2227|[Encrypt and Decrypt Strings](https://leetcode.com/problems/encrypt-and-decrypt-strings/description/) |Hard|To Do|To Do|
|1309|[Decrypt String from Alphabet to Integer Mapping](https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping/description/) |Easy|To Do|To Do|
|1310|[XOR Queries of a Subarray](https://leetcode.com/problems/xor-queries-of-a-subarray/description/) |Medium|To Do|To Do|
|1311|[Get Watched Videos by Your Friends](https://leetcode.com/problems/get-watched-videos-by-your-friends/description/) |Medium|To Do|To Do|
|1312|[Minimum Insertion Steps to Make a String Palindrome](https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/description/) |Hard|To Do|To Do|
|1303|[Find the Team Size](https://leetcode.com/problems/find-the-team-size/description/) :lock:|Easy|To Do|To Do|
|1308|[Running Total for Different Genders](https://leetcode.com/problems/running-total-for-different-genders/description/) :lock:|Medium|To Do|To Do|
|1317|[Convert Integer to the Sum of Two No-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/description/) |Easy|To Do|To Do|
|1318|[Minimum Flips to Make a OR b Equal to c](https://leetcode.com/problems/minimum-flips-to-make-a-or-b-equal-to-c/description/) |Medium|To Do|To Do|
|1319|[Number of Operations to Make Network Connected](https://leetcode.com/problems/number-of-operations-to-make-network-connected/description/) |Medium|To Do|To Do|
|1320|[Minimum Distance to Type a Word Using Two Fingers](https://leetcode.com/problems/minimum-distance-to-type-a-word-using-two-fingers/description/) |Hard|To Do|To Do|
|1342|[Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/description/) |Easy|To Do|To Do|
|1343|[Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold](https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/description/) |Medium|To Do|To Do|
|1344|[Angle Between Hands of a Clock](https://leetcode.com/problems/angle-between-hands-of-a-clock/description/) |Medium|To Do|[python](https://github.com/seal0112/leetcode/tree/master/leetcode-algorithms/1344.%20Angle%20Between%20Hands%20of%20a%20Clock/AngleBetweenHandsOfAClock.py)|
|1345|[Jump Game IV](https://leetcode.com/problems/jump-game-iv/description/) |Hard|To Do|To Do|
|1323|[Maximum 69 Number](https://leetcode.com/problems/maximum-69-number/description/) |Easy|To Do|To Do|
|1324|[Print Words Vertically](https://leetcode.com/problems/print-words-vertically/description/) |Medium|To Do|To Do|
|1325|[Delete Leaves With a Given Value](https://leetcode.com/problems/delete-leaves-with-a-given-value/description/) |Medium|To Do|To Do|
|1326|[Minimum Number of Taps to Open to Water a Garden](https://leetcode.com/problems/minimum-number-of-taps-to-open-to-water-a-garden/description/) |Hard|To Do|To Do|
|1321|[Restaurant Growth](https://leetcode.com/problems/restaurant-growth/description/) |Medium|To Do|To Do|
|1322|[Ads Performance](https://leetcode.com/problems/ads-performance/description/) :lock:|Easy|To Do|To Do|
|1332|[Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/description/) |Easy|To Do|To Do|
|1333|[Filter Restaurants by Vegan-Friendly, Price and Distance](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/description/) |Medium|To Do|To Do|
|1334|[Find the City With the Smallest Number of Neighbors at a Threshold Distance](https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/description/) |Medium|To Do|To Do|
|1335|[Minimum Difficulty of a Job Schedule](https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule/description/) |Hard|To Do|To Do|
|1356|[Sort Integers by The Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/description/) |Easy|To Do|To Do|
|1357|[Apply Discount Every n Orders](https://leetcode.com/problems/apply-discount-every-n-orders/description/) |Medium|To Do|To Do|
|1358|[Number of Substrings Containing All Three Characters](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/description/) |Medium|To Do|To Do|
|1359|[Count All Valid Pickup and Delivery Options](https://leetcode.com/problems/count-all-valid-pickup-and-delivery-options/description/) |Hard|To Do|To Do|
|1327|[List the Products Ordered in a Period](https://leetcode.com/problems/list-the-products-ordered-in-a-period/description/) |Easy|To Do|To Do|
|1337|[The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/description/) |Easy|To Do|To Do|
|1338|[Reduce Array Size to The Half](https://leetcode.com/problems/reduce-array-size-to-the-half/description/) |Medium|To Do|To Do|
|1339|[Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/description/) |Medium|To Do|To Do|
|1340|[Jump Game V](https://leetcode.com/problems/jump-game-v/description/) |Hard|To Do|To Do|
|1336|[Number of Transactions per Visit](https://leetcode.com/problems/number-of-transactions-per-visit/description/) :lock:|Hard|To Do|To Do|
|1346|[Check If N and Its Double Exist](https://leetcode.com/problems/check-if-n-and-its-double-exist/description/) |Easy|To Do|To Do|
|1347|[Minimum Number of Steps to Make Two Strings Anagram](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/description/) |Medium|To Do|To Do|
|1348|[Tweet Counts Per Frequency](https://leetcode.com/problems/tweet-counts-per-frequency/description/) |Medium|To Do|To Do|
|1349|[Maximum Students Taking Exam](https://leetcode.com/problems/maximum-students-taking-exam/description/) |Hard|To Do|To Do|
|1370|[Increasing Decreasing String](https://leetcode.com/problems/increasing-decreasing-string/description/) |Easy|To Do|To Do|
|1371|[Find the Longest Substring Containing Vowels in Even Counts](https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/description/) |Medium|To Do|To Do|
|1372|[Longest ZigZag Path in a Binary Tree](https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/description/) |Medium|To Do|To Do|
|1373|[Maximum Sum BST in Binary Tree](https://leetcode.com/problems/maximum-sum-bst-in-binary-tree/description/) |Hard|To Do|To Do|
|1351|[Count Negative Numbers in a Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/description/) |Easy|To Do|To Do|
|1352|[Product of the Last K Numbers](https://leetcode.com/problems/product-of-the-last-k-numbers/description/) |Medium|To Do|To Do|
|1353|[Maximum Number of Events That Can Be Attended](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/description/) |Medium|To Do|To Do|
|1354|[Construct Target Array With Multiple Sums](https://leetcode.com/problems/construct-target-array-with-multiple-sums/description/) |Hard|To Do|To Do|
|1341|[Movie Rating](https://leetcode.com/problems/movie-rating/description/) |Medium|To Do|To Do|
|1350|[Students With Invalid Departments](https://leetcode.com/problems/students-with-invalid-departments/description/) :lock:|Easy|To Do|To Do|
|1365|[How Many Numbers Are Smaller Than the Current Number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/description/) |Easy|To Do|To Do|
|1366|[Rank Teams by Votes](https://leetcode.com/problems/rank-teams-by-votes/description/) |Medium|To Do|To Do|
|1367|[Linked List in Binary Tree](https://leetcode.com/problems/linked-list-in-binary-tree/description/) |Medium|To Do|To Do|
|1368|[Minimum Cost to Make at Least One Valid Path in a Grid](https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/description/) |Hard|To Do|To Do|
|1385|[Find the Distance Value Between Two Arrays](https://leetcode.com/problems/find-the-distance-value-between-two-arrays/description/) |Easy|To Do|To Do|
|1386|[Cinema Seat Allocation](https://leetcode.com/problems/cinema-seat-allocation/description/) |Medium|To Do|To Do|
|1387|[Sort Integers by The Power Value](https://leetcode.com/problems/sort-integers-by-the-power-value/description/) |Medium|To Do|To Do|
|1388|[Pizza With 3n Slices](https://leetcode.com/problems/pizza-with-3n-slices/description/) |Hard|To Do|To Do|
|1374|[Generate a String With Characters That Have Odd Counts](https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/description/) |Easy|To Do|To Do|
|1375|[Number of Times Binary String Is Prefix-Aligned](https://leetcode.com/problems/number-of-times-binary-string-is-prefix-aligned/description/) |Medium|To Do|To Do|
|1376|[Time Needed to Inform All Employees](https://leetcode.com/problems/time-needed-to-inform-all-employees/description/) |Medium|To Do|To Do|
|1377|[Frog Position After T Seconds](https://leetcode.com/problems/frog-position-after-t-seconds/description/) |Hard|To Do|To Do|
|1355|[Activity Participants](https://leetcode.com/problems/activity-participants/description/) :lock:|Medium|To Do|To Do|
|1364|[Number of Trusted Contacts of a Customer](https://leetcode.com/problems/number-of-trusted-contacts-of-a-customer/description/) :lock:|Medium|To Do|To Do|
|1380|[Lucky Numbers in a Matrix](https://leetcode.com/problems/lucky-numbers-in-a-matrix/description/) |Easy|To Do|To Do|
|1381|[Design a Stack With Increment Operation](https://leetcode.com/problems/design-a-stack-with-increment-operation/description/) |Medium|To Do|To Do|
|1379|[Find a Corresponding Node of a Binary Tree in a Clone of That Tree](https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/description/) |Easy|To Do|To Do|
|1383|[Maximum Performance of a Team](https://leetcode.com/problems/maximum-performance-of-a-team/description/) |Hard|To Do|To Do|
|1399|[Count Largest Group](https://leetcode.com/problems/count-largest-group/description/) |Easy|To Do|To Do|
|1401|[Circle and Rectangle Overlapping](https://leetcode.com/problems/circle-and-rectangle-overlapping/description/) |Medium|To Do|To Do|
|1400|[Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/description/) |Medium|To Do|To Do|
|1402|[Reducing Dishes](https://leetcode.com/problems/reducing-dishes/description/) |Hard|To Do|To Do|
|1369|[Get the Second Most Recent Activity](https://leetcode.com/problems/get-the-second-most-recent-activity/description/) :lock:|Hard|To Do|To Do|
|1389|[Create Target Array in the Given Order](https://leetcode.com/problems/create-target-array-in-the-given-order/description/) |Easy|To Do|To Do|
|1391|[Check if There is a Valid Path in a Grid](https://leetcode.com/problems/check-if-there-is-a-valid-path-in-a-grid/description/) |Medium|To Do|To Do|
|1392|[Longest Happy Prefix](https://leetcode.com/problems/longest-happy-prefix/description/) |Hard|To Do|To Do|
|1378|[Replace Employee ID With The Unique Identifier](https://leetcode.com/problems/replace-employee-id-with-the-unique-identifier/description/) |Easy|To Do|To Do|
|1394|[Find Lucky Integer in an Array](https://leetcode.com/problems/find-lucky-integer-in-an-array/description/) |Easy|To Do|To Do|
|1395|[Count Number of Teams](https://leetcode.com/problems/count-number-of-teams/description/) |Medium|To Do|To Do|
|1396|[Design Underground System](https://leetcode.com/problems/design-underground-system/description/) |Medium|To Do|To Do|
|1397|[Find All Good Strings](https://leetcode.com/problems/find-all-good-strings/description/) |Hard|To Do|To Do|
|1413|[Minimum Value to Get Positive Step by Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/description/) |Easy|To Do|To Do|
|1414|[Find the Minimum Number of Fibonacci Numbers Whose Sum Is K](https://leetcode.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/description/) |Medium|To Do|To Do|
|1415|[The k-th Lexicographical String of All Happy Strings of Length n](https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/description/) |Medium|To Do|To Do|
|1416|[Restore The Array](https://leetcode.com/problems/restore-the-array/description/) |Hard|To Do|To Do|
|1384|[Total Sales Amount by Year](https://leetcode.com/problems/total-sales-amount-by-year/description/) :lock:|Hard|To Do|To Do|
|1403|[Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/description/) |Easy|To Do|To Do|
|1404|[Number of Steps to Reduce a Number in Binary Representation to One](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/description/) |Medium|To Do|To Do|
|1406|[Stone Game III](https://leetcode.com/problems/stone-game-iii/description/) |Hard|To Do|To Do|
|1393|[Capital Gain Loss](https://leetcode.com/problems/capital-gainloss/description/) |Medium|To Do|To Do|
|1408|[String Matching in an Array](https://leetcode.com/problems/string-matching-in-an-array/description/) |Easy|To Do|To Do|
|1409|[Queries on a Permutation With Key](https://leetcode.com/problems/queries-on-a-permutation-with-key/description/) |Medium|To Do|To Do|
|1410|[HTML Entity Parser](https://leetcode.com/problems/html-entity-parser/description/) |Medium|To Do|To Do|
|1411|[Number of Ways to Paint N × 3 Grid](https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid/description/) |Hard|To Do|To Do|
|1431|[Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/description/) |Easy|To Do|To Do|
|1432|[Max Difference You Can Get From Changing an Integer](https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer/description/) |Medium|To Do|To Do|
|1433|[Check If a String Can Break Another String](https://leetcode.com/problems/check-if-a-string-can-break-another-string/description/) |Medium|To Do|To Do|
|1434|[Number of Ways to Wear Different Hats to Each Other](https://leetcode.com/problems/number-of-ways-to-wear-different-hats-to-each-other/description/) |Hard|To Do|To Do|
|1417|[Reformat The String](https://leetcode.com/problems/reformat-the-string/description/) |Easy|To Do|To Do|
|1418|[Display Table of Food Orders in a Restaurant](https://leetcode.com/problems/display-table-of-food-orders-in-a-restaurant/description/) |Medium|To Do|To Do|
|1419|[Minimum Number of Frogs Croaking](https://leetcode.com/problems/minimum-number-of-frogs-croaking/description/) |Medium|To Do|To Do|
|1420|[Build Array Where You Can Find The Maximum Exactly K Comparisons](https://leetcode.com/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons/description/) |Hard|To Do|To Do|
|1398|[Customers Who Bought Products A and B but Not C](https://leetcode.com/problems/customers-who-bought-products-a-and-b-but-not-c/description/) :lock:|Medium|To Do|To Do|
|1422|[Maximum Score After Splitting a String](https://leetcode.com/problems/maximum-score-after-splitting-a-string/description/) |Easy|To Do|To Do|
|1423|[Maximum Points You Can Obtain from Cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/description/) |Medium|To Do|To Do|
|1424|[Diagonal Traverse II](https://leetcode.com/problems/diagonal-traverse-ii/description/) |Medium|To Do|To Do|
|1407|[Top Travellers](https://leetcode.com/problems/top-travellers/description/) |Easy|To Do|To Do|
|1446|[Consecutive Characters](https://leetcode.com/problems/consecutive-characters/description/) |Easy|To Do|To Do|
|1447|[Simplified Fractions](https://leetcode.com/problems/simplified-fractions/description/) |Medium|To Do|To Do|
|1448|[Count Good Nodes in Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/description/) |Medium|To Do|To Do|
|1449|[Form Largest Integer With Digits That Add up to Target](https://leetcode.com/problems/form-largest-integer-with-digits-that-add-up-to-target/description/) |Hard|To Do|To Do|
|1412|[Find the Quiet Students in All Exams](https://leetcode.com/problems/find-the-quiet-students-in-all-exams/description/) :lock:|Hard|To Do|To Do|
|1436|[Destination City](https://leetcode.com/problems/destination-city/description/) |Easy|To Do|To Do|
|1437|[Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/description/) |Easy|To Do|To Do|
|1438|[Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/description/) |Medium|To Do|To Do|
|1439|[Find the Kth Smallest Sum of a Matrix With Sorted Rows](https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/description/) |Hard|To Do|To Do|
|1421|[NPV Queries](https://leetcode.com/problems/npv-queries/description/) :lock:|Easy|To Do|To Do|
|1441|[Build an Array With Stack Operations](https://leetcode.com/problems/build-an-array-with-stack-operations/description/) |Medium|To Do|To Do|
|1442|[Count Triplets That Can Form Two Arrays of Equal XOR](https://leetcode.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor/description/) |Medium|To Do|To Do|
|1443|[Minimum Time to Collect All Apples in a Tree](https://leetcode.com/problems/minimum-time-to-collect-all-apples-in-a-tree/description/) |Medium|To Do|To Do|
|1444|[Number of Ways of Cutting a Pizza](https://leetcode.com/problems/number-of-ways-of-cutting-a-pizza/description/) |Hard|To Do|To Do|
|1460|[Make Two Arrays Equal by Reversing Subarrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-subarrays/description/) |Easy|To Do|To Do|
|1461|[Check If a String Contains All Binary Codes of Size K](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/description/) |Medium|To Do|To Do|
|1462|[Course Schedule IV](https://leetcode.com/problems/course-schedule-iv/description/) |Medium|To Do|To Do|
|1463|[Cherry Pickup II](https://leetcode.com/problems/cherry-pickup-ii/description/) |Hard|To Do|To Do|
|1450|[Number of Students Doing Homework at a Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/description/) |Easy|To Do|To Do|
|1451|[Rearrange Words in a Sentence](https://leetcode.com/problems/rearrange-words-in-a-sentence/description/) |Medium|To Do|To Do|
|1452|[People Whose List of Favorite Companies Is Not a Subset of Another List](https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/description/) |Medium|To Do|To Do|
|1453|[Maximum Number of Darts Inside of a Circular Dartboard](https://leetcode.com/problems/maximum-number-of-darts-inside-of-a-circular-dartboard/description/) |Hard|To Do|To Do|
|1435|[Create a Session Bar Chart](https://leetcode.com/problems/create-a-session-bar-chart/description/) :lock:|Easy|To Do|To Do|
|1440|[Evaluate Boolean Expression](https://leetcode.com/problems/evaluate-boolean-expression/description/) :lock:|Medium|To Do|To Do|
|1455|[Check If a Word Occurs As a Prefix of Any Word in a Sentence](https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/description/) |Easy|To Do|To Do|
|1456|[Maximum Number of Vowels in a Substring of Given Length](https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/description/) |Medium|To Do|To Do|
|1457|[Pseudo-Palindromic Paths in a Binary Tree](https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/description/) |Medium|To Do|To Do|
|1458|[Max Dot Product of Two Subsequences](https://leetcode.com/problems/max-dot-product-of-two-subsequences/description/) |Hard|To Do|To Do|
|1475|[Final Prices With a Special Discount in a Shop](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/description/) |Easy|To Do|To Do|
|1478|[Allocate Mailboxes](https://leetcode.com/problems/allocate-mailboxes/description/) |Hard|To Do|To Do|
|1476|[Subrectangle Queries](https://leetcode.com/problems/subrectangle-queries/description/) |Medium|To Do|To Do|
|1477|[Find Two Non-overlapping Sub-arrays Each With Target Sum](https://leetcode.com/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum/description/) |Medium|To Do|To Do|
|1464|[Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/description/) |Easy|To Do|To Do|
|1465|[Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts](https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/description/) |Medium|To Do|To Do|
|1466|[Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/description/) |Medium|To Do|To Do|
|1467|[Probability of a Two Boxes Having The Same Number of Distinct Balls](https://leetcode.com/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/description/) |Hard|To Do|To Do|
|1445|[Apples & Oranges](https://leetcode.com/problems/apples-oranges/description/) :lock:|Medium|To Do|To Do|
|1454|[Active Users](https://leetcode.com/problems/active-users/description/) :lock:|Medium|To Do|To Do|
|1470|[Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/description/) |Easy|To Do|To Do|
|1471|[The k Strongest Values in an Array](https://leetcode.com/problems/the-k-strongest-values-in-an-array/description/) |Medium|To Do|To Do|
|1472|[Design Browser History](https://leetcode.com/problems/design-browser-history/description/) |Medium|To Do|To Do|
|1473|[Paint House III](https://leetcode.com/problems/paint-house-iii/description/) |Hard|To Do|To Do|
|1491|[Average Salary Excluding the Minimum and Maximum Salary](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/description/) |Easy|To Do|To Do|
|1492|[The kth Factor of n](https://leetcode.com/problems/the-kth-factor-of-n/description/) |Medium|To Do|To Do|
|1493|[Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/description/) |Medium|To Do|To Do|
|1494|[Parallel Courses II](https://leetcode.com/problems/parallel-courses-ii/description/) |Hard|To Do|To Do|
|1480|[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/description/) |Easy|To Do|To Do|
|1481|[Least Number of Unique Integers after K Removals](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/description/) |Medium|To Do|To Do|
|1482|[Minimum Number of Days to Make m Bouquets](https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/description/) |Medium|To Do|To Do|
|1459|[Rectangles Area](https://leetcode.com/problems/rectangles-area/description/) :lock:|Medium|To Do|To Do|
|1468|[Calculate Salaries](https://leetcode.com/problems/calculate-salaries/description/) :lock:|Medium|To Do|To Do|
|1469|[Find All The Lonely Nodes](https://leetcode.com/problems/find-all-the-lonely-nodes/description/) :lock:|Easy|To Do|To Do|
|1486|[XOR Operation in an Array](https://leetcode.com/problems/xor-operation-in-an-array/description/) |Easy|To Do|To Do|
|1487|[Making File Names Unique](https://leetcode.com/problems/making-file-names-unique/description/) |Medium|To Do|To Do|
|1488|[Avoid Flood in The City](https://leetcode.com/problems/avoid-flood-in-the-city/description/) |Medium|To Do|To Do|
|1489|[Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/description/) |Hard|To Do|To Do|
|1508|[Range Sum of Sorted Subarray Sums](https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/description/) |Medium|To Do|To Do|
|1509|[Minimum Difference Between Largest and Smallest Value in Three Moves](https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves/description/) |Medium|To Do|To Do|
|1510|[Stone Game IV](https://leetcode.com/problems/stone-game-iv/description/) |Hard|To Do|To Do|
|1474|[Delete N Nodes After M Nodes of a Linked List](https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/description/) :lock:|Easy|To Do|To Do|
|1496|[Path Crossing](https://leetcode.com/problems/path-crossing/description/) |Easy|To Do|To Do|
|1497|[Check If Array Pairs Are Divisible by k](https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k/description/) |Medium|To Do|To Do|
|1498|[Number of Subsequences That Satisfy the Given Sum Condition](https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/description/) |Medium|To Do|To Do|
|1499|[Max Value of Equation](https://leetcode.com/problems/max-value-of-equation/description/) |Hard|To Do|To Do|
|1479|[Sales by Day of the Week](https://leetcode.com/problems/sales-by-day-of-the-week/description/) :lock:|Hard|To Do|To Do|
|1485|[Clone Binary Tree With Random Pointer](https://leetcode.com/problems/clone-binary-tree-with-random-pointer/description/) :lock:|Medium|To Do|To Do|
|1484|[Group Sold Products By The Date](https://leetcode.com/problems/group-sold-products-by-the-date/description/) |Easy|To Do|To Do|
|1502|[Can Make Arithmetic Progression From Sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/description/) |Easy|To Do|To Do|
|1503|[Last Moment Before All Ants Fall Out of a Plank](https://leetcode.com/problems/last-moment-before-all-ants-fall-out-of-a-plank/description/) |Medium|To Do|To Do|
|1504|[Count Submatrices With All Ones](https://leetcode.com/problems/count-submatrices-with-all-ones/description/) |Medium|To Do|To Do|
|1505|[Minimum Possible Integer After at Most K Adjacent Swaps On Digits](https://leetcode.com/problems/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/description/) |Hard|To Do|To Do|
|1523|[Count Odd Numbers in an Interval Range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/description/) |Easy|To Do|To Do|
|1524|[Number of Sub-arrays With Odd Sum](https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/description/) |Medium|To Do|To Do|
|1525|[Number of Good Ways to Split a String](https://leetcode.com/problems/number-of-good-ways-to-split-a-string/description/) |Medium|To Do|To Do|
|1526|[Minimum Number of Increments on Subarrays to Form a Target Array](https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/description/) |Hard|To Do|To Do|
|1490|[Clone N-ary Tree](https://leetcode.com/problems/clone-n-ary-tree/description/) :lock:|Medium|To Do|To Do|
|1512|[Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs/description/) |Easy|To Do|To Do|
|1513|[Number of Substrings With Only 1s](https://leetcode.com/problems/number-of-substrings-with-only-1s/description/) |Medium|To Do|To Do|
|1531|[String Compression II](https://leetcode.com/problems/string-compression-ii/description/) |Hard|To Do|To Do|
|1515|[Best Position for a Service Centre](https://leetcode.com/problems/best-position-for-a-service-centre/description/) |Hard|To Do|To Do|
|1495|[Friendly Movies Streamed Last Month](https://leetcode.com/problems/friendly-movies-streamed-last-month/description/) :lock:|Easy|To Do|To Do|
|1500|[Design a File Sharing System](https://leetcode.com/problems/design-a-file-sharing-system/description/) :lock:|Medium|To Do|To Do|
|1501|[Countries You Can Safely Invest In](https://leetcode.com/problems/countries-you-can-safely-invest-in/description/) :lock:|Medium|To Do|To Do|
|1518|[Water Bottles](https://leetcode.com/problems/water-bottles/description/) |Easy|To Do|To Do|
|1519|[Number of Nodes in the Sub-Tree With the Same Label](https://leetcode.com/problems/number-of-nodes-in-the-sub-tree-with-the-same-label/description/) |Medium|To Do|To Do|
|1520|[Maximum Number of Non-Overlapping Substrings](https://leetcode.com/problems/maximum-number-of-non-overlapping-substrings/description/) |Hard|To Do|To Do|
|1521|[Find a Value of a Mysterious Function Closest to Target](https://leetcode.com/problems/find-a-value-of-a-mysterious-function-closest-to-target/description/) |Hard|To Do|To Do|
|1539|[Kth Missing Positive Number](https://leetcode.com/problems/kth-missing-positive-number/description/) |Easy|To Do|To Do|
|1540|[Can Convert String in K Moves](https://leetcode.com/problems/can-convert-string-in-k-moves/description/) |Medium|To Do|To Do|
|1541|[Minimum Insertions to Balance a Parentheses String](https://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string/description/) |Medium|To Do|To Do|
|1546|[Maximum Number of Non-Overlapping Subarrays With Sum Equals Target](https://leetcode.com/problems/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target/description/) |Medium|To Do|To Do|
|1506|[Find Root of N-Ary Tree](https://leetcode.com/problems/find-root-of-n-ary-tree/description/) :lock:|Medium|To Do|To Do|
|1528|[Shuffle String](https://leetcode.com/problems/shuffle-string/description/) |Easy|To Do|To Do|
|1529|[Minimum Suffix Flips](https://leetcode.com/problems/minimum-suffix-flips/description/) |Medium|To Do|To Do|
|1530|[Number of Good Leaf Nodes Pairs](https://leetcode.com/problems/number-of-good-leaf-nodes-pairs/description/) |Medium|To Do|To Do|
|1511|[Customer Order Frequency](https://leetcode.com/problems/customer-order-frequency/description/) :lock:|Easy|To Do|To Do|
|1516|[Move Sub-Tree of N-Ary Tree](https://leetcode.com/problems/move-sub-tree-of-n-ary-tree/description/) :lock:|Hard|To Do|To Do|
|1534|[Count Good Triplets](https://leetcode.com/problems/count-good-triplets/description/) |Easy|To Do|To Do|
|1535|[Find the Winner of an Array Game](https://leetcode.com/problems/find-the-winner-of-an-array-game/description/) |Medium|To Do|To Do|
|1536|[Minimum Swaps to Arrange a Binary Grid](https://leetcode.com/problems/minimum-swaps-to-arrange-a-binary-grid/description/) |Medium|To Do|To Do|
|1537|[Get the Maximum Score](https://leetcode.com/problems/get-the-maximum-score/description/) |Hard|To Do|To Do|
|1556|[Thousand Separator](https://leetcode.com/problems/thousand-separator/description/) |Easy|To Do|To Do|
|1557|[Minimum Number of Vertices to Reach All Nodes](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/description/) |Medium|To Do|To Do|
|1558|[Minimum Numbers of Function Calls to Make Target Array](https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array/description/) |Medium|To Do|To Do|
|1559|[Detect Cycles in 2D Grid](https://leetcode.com/problems/detect-cycles-in-2d-grid/description/) |Medium|To Do|To Do|
|1517|[Find Users With Valid E-Mails](https://leetcode.com/problems/find-users-with-valid-e-mails/description/) |Easy|To Do|To Do|
|1522|[Diameter of N-Ary Tree](https://leetcode.com/problems/diameter-of-n-ary-tree/description/) :lock:|Medium|To Do|To Do|
|1544|[Make The String Great](https://leetcode.com/problems/make-the-string-great/description/) |Easy|To Do|To Do|
|1545|[Find Kth Bit in Nth Binary String](https://leetcode.com/problems/find-kth-bit-in-nth-binary-string/description/) |Medium|To Do|To Do|
|1542|[Find Longest Awesome Substring](https://leetcode.com/problems/find-longest-awesome-substring/description/) |Hard|To Do|To Do|
|1547|[Minimum Cost to Cut a Stick](https://leetcode.com/problems/minimum-cost-to-cut-a-stick/description/) |Hard|To Do|To Do|
|1527|[Patients With a Condition](https://leetcode.com/problems/patients-with-a-condition/description/) |Easy|To Do|To Do|
|1532|[The Most Recent Three Orders](https://leetcode.com/problems/the-most-recent-three-orders/description/) :lock:|Medium|To Do|To Do|
|1533|[Find the Index of the Large Integer](https://leetcode.com/problems/find-the-index-of-the-large-integer/description/) :lock:|Medium|To Do|To Do|
|1551|[Minimum Operations to Make Array Equal](https://leetcode.com/problems/minimum-operations-to-make-array-equal/description/) |Medium|To Do|To Do|
|1552|[Magnetic Force Between Two Balls](https://leetcode.com/problems/magnetic-force-between-two-balls/description/) |Medium|To Do|To Do|
|1553|[Minimum Number of Days to Eat N Oranges](https://leetcode.com/problems/minimum-number-of-days-to-eat-n-oranges/description/) |Hard|To Do|To Do|
|1572|[Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/description/) |Easy|To Do|To Do|
|1573|[Number of Ways to Split a String](https://leetcode.com/problems/number-of-ways-to-split-a-string/description/) |Medium|To Do|To Do|
|1574|[Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/description/) |Medium|To Do|To Do|
|1575|[Count All Possible Routes](https://leetcode.com/problems/count-all-possible-routes/description/) |Hard|To Do|To Do|
|1538|[Guess the Majority in a Hidden Array](https://leetcode.com/problems/guess-the-majority-in-a-hidden-array/description/) :lock:|Medium|To Do|To Do|
|1560|[Most Visited Sector in  a Circular Track](https://leetcode.com/problems/most-visited-sector-in-a-circular-track/description/) |Easy|To Do|To Do|
|1561|[Maximum Number of Coins You Can Get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/description/) |Medium|To Do|To Do|
|1562|[Find Latest Group of Size M](https://leetcode.com/problems/find-latest-group-of-size-m/description/) |Medium|To Do|To Do|
|1563|[Stone Game V](https://leetcode.com/problems/stone-game-v/description/) |Hard|To Do|To Do|
|1543|[Fix Product Name Format](https://leetcode.com/problems/fix-product-name-format/description/) :lock:|Easy|To Do|To Do|
|1548|[The Most Similar Path in a Graph](https://leetcode.com/problems/the-most-similar-path-in-a-graph/description/) :lock:|Hard|To Do|To Do|
|1549|[The Most Recent Orders for Each Product](https://leetcode.com/problems/the-most-recent-orders-for-each-product/description/) :lock:|Medium|To Do|To Do|
|1566|[Detect Pattern of Length M Repeated K or More Times](https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/description/) |Easy|To Do|To Do|
|1567|[Maximum Length of Subarray With Positive Product](https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/description/) |Medium|To Do|To Do|
|1568|[Minimum Number of Days to Disconnect Island](https://leetcode.com/problems/minimum-number-of-days-to-disconnect-island/description/) |Hard|To Do|To Do|
|1569|[Number of Ways to Reorder Array to Get Same BST](https://leetcode.com/problems/number-of-ways-to-reorder-array-to-get-same-bst/description/) |Hard|To Do|To Do|
|1588|[Sum of All Odd Length Subarrays](https://leetcode.com/problems/sum-of-all-odd-length-subarrays/description/) |Easy|To Do|To Do|
|1590|[Make Sum Divisible by P](https://leetcode.com/problems/make-sum-divisible-by-p/description/) |Medium|To Do|To Do|
|1589|[Maximum Sum Obtained of Any Permutation](https://leetcode.com/problems/maximum-sum-obtained-of-any-permutation/description/) |Medium|To Do|To Do|
|1591|[Strange Printer II](https://leetcode.com/problems/strange-printer-ii/description/) |Hard|To Do|To Do|
|1554|[Strings Differ by One Character](https://leetcode.com/problems/strings-differ-by-one-character/description/) :lock:|Medium|To Do|To Do|
|1576|[Replace All ?'s to Avoid Consecutive Repeating Characters](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/description/) |Easy|To Do|To Do|
|1577|[Number of Ways Where Square of Number Is Equal to Product of Two Numbers](https://leetcode.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/description/) |Medium|To Do|To Do|
|1578|[Minimum Time to Make Rope Colorful](https://leetcode.com/problems/minimum-time-to-make-rope-colorful/description/) |Medium|To Do|To Do|
|1579|[Remove Max Number of Edges to Keep Graph Fully Traversable](https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/description/) |Hard|To Do|To Do|
|1555|[Bank Account Summary](https://leetcode.com/problems/bank-account-summary/description/) :lock:|Medium|To Do|To Do|
|1564|[Put Boxes Into the Warehouse I](https://leetcode.com/problems/put-boxes-into-the-warehouse-i/description/) :lock:|Medium|To Do|To Do|
|1582|[Special Positions in a Binary Matrix](https://leetcode.com/problems/special-positions-in-a-binary-matrix/description/) |Easy|To Do|To Do|
|1583|[Count Unhappy Friends](https://leetcode.com/problems/count-unhappy-friends/description/) |Medium|To Do|To Do|
|1584|[Min Cost to Connect All Points](https://leetcode.com/problems/min-cost-to-connect-all-points/description/) |Medium|To Do|To Do|
|1585|[Check If String Is Transformable With Substring Sort Operations](https://leetcode.com/problems/check-if-string-is-transformable-with-substring-sort-operations/description/) |Hard|To Do|To Do|
|1603|[Design Parking System](https://leetcode.com/problems/design-parking-system/description/) |Easy|To Do|To Do|
|1604|[Alert Using Same Key-Card Three or More Times in a One Hour Period](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/description/) |Medium|To Do|To Do|
|1606|[Find Servers That Handled Most Number of Requests](https://leetcode.com/problems/find-servers-that-handled-most-number-of-requests/description/) |Hard|To Do|To Do|
|1605|[Find Valid Matrix Given Row and Column Sums](https://leetcode.com/problems/find-valid-matrix-given-row-and-column-sums/description/) |Medium|To Do|To Do|
|1565|[Unique Orders and Customers Per Month](https://leetcode.com/problems/unique-orders-and-customers-per-month/description/) :lock:|Easy|To Do|To Do|
|1570|[Dot Product of Two Sparse Vectors](https://leetcode.com/problems/dot-product-of-two-sparse-vectors/description/) :lock:|Medium|To Do|To Do|
|1592|[Rearrange Spaces Between Words](https://leetcode.com/problems/rearrange-spaces-between-words/description/) |Easy|To Do|To Do|
|1593|[Split a String Into the Max Number of Unique Substrings](https://leetcode.com/problems/split-a-string-into-the-max-number-of-unique-substrings/description/) |Medium|To Do|To Do|
|1594|[Maximum Non Negative Product in a Matrix](https://leetcode.com/problems/maximum-non-negative-product-in-a-matrix/description/) |Medium|To Do|To Do|
|1595|[Minimum Cost to Connect Two Groups of Points](https://leetcode.com/problems/minimum-cost-to-connect-two-groups-of-points/description/) |Hard|To Do|To Do|
|1571|[Warehouse Manager](https://leetcode.com/problems/warehouse-manager/description/) :lock:|Easy|To Do|To Do|
|1580|[Put Boxes Into the Warehouse II](https://leetcode.com/problems/put-boxes-into-the-warehouse-ii/description/) :lock:|Medium|To Do|To Do|
|1598|[Crawler Log Folder](https://leetcode.com/problems/crawler-log-folder/description/) |Easy|To Do|To Do|
|1599|[Maximum Profit of Operating a Centennial Wheel](https://leetcode.com/problems/maximum-profit-of-operating-a-centennial-wheel/description/) |Medium|To Do|To Do|
|1600|[Throne Inheritance](https://leetcode.com/problems/throne-inheritance/description/) |Medium|To Do|To Do|
|1601|[Maximum Number of Achievable Transfer Requests](https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests/description/) |Hard|To Do|To Do|
|1581|[Customer Who Visited but Did Not Make Any Transactions](https://leetcode.com/problems/customer-who-visited-but-did-not-make-any-transactions/description/) |Easy|To Do|To Do|
|1621|[Number of Sets of K Non-Overlapping Line Segments](https://leetcode.com/problems/number-of-sets-of-k-non-overlapping-line-segments/description/) |Medium|To Do|To Do|
|1620|[Coordinate With Maximum Network Quality](https://leetcode.com/problems/coordinate-with-maximum-network-quality/description/) |Medium|To Do|To Do|
|1728|[Cat and Mouse II](https://leetcode.com/problems/cat-and-mouse-ii/description/) |Hard|To Do|To Do|
|1622|[Fancy Sequence](https://leetcode.com/problems/fancy-sequence/description/) |Hard|To Do|To Do|
|1586|[Binary Search Tree Iterator II](https://leetcode.com/problems/binary-search-tree-iterator-ii/description/) :lock:|Medium|To Do|To Do|
|1608|[Special Array With X Elements Greater Than or Equal X](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/description/) |Easy|To Do|To Do|
|1609|[Even Odd Tree](https://leetcode.com/problems/even-odd-tree/description/) |Medium|To Do|To Do|
|1611|[Minimum One Bit Operations to Make Integers Zero](https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero/description/) |Hard|To Do|To Do|
|1610|[Maximum Number of Visible Points](https://leetcode.com/problems/maximum-number-of-visible-points/description/) |Hard|To Do|To Do|
|1587|[Bank Account Summary II](https://leetcode.com/problems/bank-account-summary-ii/description/) |Easy|To Do|To Do|
|1596|[The Most Frequently Ordered Products for Each Customer](https://leetcode.com/problems/the-most-frequently-ordered-products-for-each-customer/description/) :lock:|Medium|To Do|To Do|
|1597|[Build Binary Expression Tree From Infix Expression](https://leetcode.com/problems/build-binary-expression-tree-from-infix-expression/description/) :lock:|Hard|To Do|To Do|
|1614|[Maximum Nesting Depth of the Parentheses](https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/description/) |Easy|To Do|To Do|
|1615|[Maximal Network Rank](https://leetcode.com/problems/maximal-network-rank/description/) |Medium|To Do|To Do|
|1616|[Split Two Strings to Make Palindrome](https://leetcode.com/problems/split-two-strings-to-make-palindrome/description/) |Medium|To Do|To Do|
|1617|[Count Subtrees With Max Distance Between Cities](https://leetcode.com/problems/count-subtrees-with-max-distance-between-cities/description/) |Hard|To Do|To Do|
|1636|[Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/description/) |Easy|To Do|To Do|
|1637|[Widest Vertical Area Between Two Points Containing No Points](https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/description/) |Medium|To Do|To Do|
|1638|[Count Substrings That Differ by One Character](https://leetcode.com/problems/count-substrings-that-differ-by-one-character/description/) |Medium|To Do|To Do|
|1639|[Number of Ways to Form a Target String Given a Dictionary](https://leetcode.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary/description/) |Hard|To Do|To Do|
|1602|[Find Nearest Right Node in Binary Tree](https://leetcode.com/problems/find-nearest-right-node-in-binary-tree/description/) :lock:|Medium|To Do|To Do|
|1624|[Largest Substring Between Two Equal Characters](https://leetcode.com/problems/largest-substring-between-two-equal-characters/description/) |Easy|To Do|To Do|
|1625|[Lexicographically Smallest String After Applying Operations](https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/description/) |Medium|To Do|To Do|
|1626|[Best Team With No Conflicts](https://leetcode.com/problems/best-team-with-no-conflicts/description/) |Medium|To Do|To Do|
|1607|[Sellers With No Sales](https://leetcode.com/problems/sellers-with-no-sales/description/) :lock:|Easy|To Do|To Do|
|1612|[Check If Two Expression Trees are Equivalent](https://leetcode.com/problems/check-if-two-expression-trees-are-equivalent/description/) :lock:|Medium|To Do|To Do|
|1629|[Slowest Key](https://leetcode.com/problems/slowest-key/description/) |Easy|To Do|To Do|
|1630|[Arithmetic Subarrays](https://leetcode.com/problems/arithmetic-subarrays/description/) |Medium|To Do|To Do|
|1631|[Path With Minimum Effort](https://leetcode.com/problems/path-with-minimum-effort/description/) |Medium|To Do|To Do|
|1652|[Defuse the Bomb](https://leetcode.com/problems/defuse-the-bomb/description/) |Easy|To Do|To Do|
|1653|[Minimum Deletions to Make String Balanced](https://leetcode.com/problems/minimum-deletions-to-make-string-balanced/description/) |Medium|To Do|To Do|
|1654|[Minimum Jumps to Reach Home](https://leetcode.com/problems/minimum-jumps-to-reach-home/description/) |Medium|To Do|To Do|
|1655|[Distribute Repeating Integers](https://leetcode.com/problems/distribute-repeating-integers/description/) |Hard|To Do|To Do|
|1613|[Find the Missing IDs](https://leetcode.com/problems/find-the-missing-ids/description/) :lock:|Medium|To Do|To Do|
|1640|[Check Array Formation Through Concatenation](https://leetcode.com/problems/check-array-formation-through-concatenation/description/) |Easy|To Do|To Do|
|1641|[Count Sorted Vowel Strings](https://leetcode.com/problems/count-sorted-vowel-strings/description/) |Medium|To Do|To Do|
|1642|[Furthest Building You Can Reach](https://leetcode.com/problems/furthest-building-you-can-reach/description/) |Medium|To Do|To Do|
|1623|[All Valid Triplets That Can Represent a Country](https://leetcode.com/problems/all-valid-triplets-that-can-represent-a-country/description/) :lock:|Easy|To Do|To Do|
|1668|[Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring/description/) |Easy|To Do|To Do|
|1669|[Merge In Between Linked Lists](https://leetcode.com/problems/merge-in-between-linked-lists/description/) |Medium|To Do|To Do|
|1671|[Minimum Number of Removals to Make Mountain Array](https://leetcode.com/problems/minimum-number-of-removals-to-make-mountain-array/description/) |Hard|To Do|To Do|
|1670|[Design Front Middle Back Queue](https://leetcode.com/problems/design-front-middle-back-queue/description/) |Medium|To Do|To Do|
|1628|[Design an Expression Tree With Evaluate Function](https://leetcode.com/problems/design-an-expression-tree-with-evaluate-function/description/) :lock:|Medium|To Do|To Do|
|1646|[Get Maximum in Generated Array](https://leetcode.com/problems/get-maximum-in-generated-array/description/) |Easy|To Do|To Do|
|1647|[Minimum Deletions to Make Character Frequencies Unique](https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique/description/) |Medium|To Do|To Do|
|1648|[Sell Diminishing-Valued Colored Balls](https://leetcode.com/problems/sell-diminishing-valued-colored-balls/description/) |Medium|To Do|To Do|
|1649|[Create Sorted Array through Instructions](https://leetcode.com/problems/create-sorted-array-through-instructions/description/) |Hard|To Do|To Do|
|1633|[Percentage of Users Attended a Contest](https://leetcode.com/problems/percentage-of-users-attended-a-contest/description/) |Easy|To Do|To Do|
|1634|[Add Two Polynomials Represented as Linked Lists](https://leetcode.com/problems/add-two-polynomials-represented-as-linked-lists/description/) :lock:|Medium|To Do|To Do|
|1656|[Design an Ordered Stream](https://leetcode.com/problems/design-an-ordered-stream/description/) |Easy|To Do|To Do|
|1658|[Minimum Operations to Reduce X to Zero](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/description/) |Medium|To Do|To Do|
|1657|[Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/description/) |Medium|To Do|To Do|
|1659|[Maximize Grid Happiness](https://leetcode.com/problems/maximize-grid-happiness/description/) |Hard|To Do|To Do|
|1635|[Hopper Company Queries I](https://leetcode.com/problems/hopper-company-queries-i/description/) :lock:|Hard|To Do|To Do|
|1644|[Lowest Common Ancestor of a Binary Tree II](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-ii/description/) :lock:|Medium|To Do|To Do|
|1662|[Check If Two String Arrays are Equivalent](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/description/) |Easy|To Do|To Do|
|1663|[Smallest String With A Given Numeric Value](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/description/) |Medium|To Do|To Do|
|1664|[Ways to Make a Fair Array](https://leetcode.com/problems/ways-to-make-a-fair-array/description/) |Medium|To Do|To Do|
|1665|[Minimum Initial Energy to Finish Tasks](https://leetcode.com/problems/minimum-initial-energy-to-finish-tasks/description/) |Hard|To Do|To Do|
|1645|[Hopper Company Queries II](https://leetcode.com/problems/hopper-company-queries-ii/description/) :lock:|Hard|To Do|To Do|
|1684|[Count the Number of Consistent Strings](https://leetcode.com/problems/count-the-number-of-consistent-strings/description/) |Easy|To Do|To Do|
|1685|[Sum of Absolute Differences in a Sorted Array](https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array/description/) |Medium|To Do|To Do|
|1686|[Stone Game VI](https://leetcode.com/problems/stone-game-vi/description/) |Medium|To Do|To Do|
|1687|[Delivering Boxes from Storage to Ports](https://leetcode.com/problems/delivering-boxes-from-storage-to-ports/description/) |Hard|To Do|To Do|
|1650|[Lowest Common Ancestor of a Binary Tree III](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/description/) :lock:|Medium|To Do|To Do|
|1672|[Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth/description/) |Easy|To Do|To Do|
|1673|[Find the Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence/description/) |Medium|To Do|To Do|
|1674|[Minimum Moves to Make Array Complementary](https://leetcode.com/problems/minimum-moves-to-make-array-complementary/description/) |Medium|To Do|To Do|
|1675|[Minimize Deviation in Array](https://leetcode.com/problems/minimize-deviation-in-array/description/) |Hard|To Do|To Do|
|1651|[Hopper Company Queries III](https://leetcode.com/problems/hopper-company-queries-iii/description/) :lock:|Hard|To Do|To Do|
|1660|[Correct a Binary Tree](https://leetcode.com/problems/correct-a-binary-tree/description/) :lock:|Medium|To Do|To Do|
|1678|[Goal Parser Interpretation](https://leetcode.com/problems/goal-parser-interpretation/description/) |Easy|To Do|To Do|
|1679|[Max Number of K-Sum Pairs](https://leetcode.com/problems/max-number-of-k-sum-pairs/description/) |Medium|To Do|To Do|
|1681|[Minimum Incompatibility](https://leetcode.com/problems/minimum-incompatibility/description/) |Hard|To Do|To Do|
|1680|[Concatenation of Consecutive Binary Numbers](https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/description/) |Medium|To Do|To Do|
|1661|[Average Time of Process per Machine](https://leetcode.com/problems/average-time-of-process-per-machine/description/) |Easy|To Do|To Do|
|1700|[Number of Students Unable to Eat Lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/description/) |Easy|To Do|To Do|
|1701|[Average Waiting Time](https://leetcode.com/problems/average-waiting-time/description/) |Medium|To Do|To Do|
|1702|[Maximum Binary String After Change](https://leetcode.com/problems/maximum-binary-string-after-change/description/) |Medium|To Do|To Do|
|1703|[Minimum Adjacent Swaps for K Consecutive Ones](https://leetcode.com/problems/minimum-adjacent-swaps-for-k-consecutive-ones/description/) |Hard|To Do|To Do|
|1688|[Count of Matches in Tournament](https://leetcode.com/problems/count-of-matches-in-tournament/description/) |Easy|To Do|To Do|
|1689|[Partitioning Into Minimum Number Of Deci-Binary Numbers](https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/description/) |Medium|To Do|To Do|
|1690|[Stone Game VII](https://leetcode.com/problems/stone-game-vii/description/) |Medium|To Do|To Do|
|1714|[Sum Of Special Evenly-Spaced Elements In Array](https://leetcode.com/problems/sum-of-special-evenly-spaced-elements-in-array/description/) :lock:|Hard|To Do|To Do|
|1666|[Change the Root of a Binary Tree](https://leetcode.com/problems/change-the-root-of-a-binary-tree/description/) :lock:|Medium|To Do|To Do|
|1667|[Fix Names in a Table](https://leetcode.com/problems/fix-names-in-a-table/description/) |Easy|To Do|To Do|
|1694|[Reformat Phone Number](https://leetcode.com/problems/reformat-phone-number/description/) |Easy|To Do|To Do|
|1695|[Maximum Erasure Value](https://leetcode.com/problems/maximum-erasure-value/description/) |Medium|To Do|To Do|
|1696|[Jump Game VI](https://leetcode.com/problems/jump-game-vi/description/) |Medium|To Do|To Do|
|1697|[Checking Existence of Edge Length Limited Paths](https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths/description/) |Hard|To Do|To Do|
|1676|[Lowest Common Ancestor of a Binary Tree IV](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iv/description/) :lock:|Medium|To Do|To Do|
|1716|[Calculate Money in Leetcode Bank](https://leetcode.com/problems/calculate-money-in-leetcode-bank/description/) |Easy|To Do|To Do|
|1717|[Maximum Score From Removing Substrings](https://leetcode.com/problems/maximum-score-from-removing-substrings/description/) |Medium|To Do|To Do|
|1718|[Construct the Lexicographically Largest Valid Sequence](https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/description/) |Medium|To Do|To Do|
|1719|[Number Of Ways To Reconstruct A Tree](https://leetcode.com/problems/number-of-ways-to-reconstruct-a-tree/description/) |Hard|To Do|To Do|
|1677|[Product's Worth Over Invoices](https://leetcode.com/problems/products-worth-over-invoices/description/) :lock:|Easy|To Do|To Do|
|1682|[Longest Palindromic Subsequence II](https://leetcode.com/problems/longest-palindromic-subsequence-ii/description/) :lock:|Medium|To Do|To Do|
|1704|[Determine if String Halves Are Alike](https://leetcode.com/problems/determine-if-string-halves-are-alike/description/) |Easy|To Do|To Do|
|1705|[Maximum Number of Eaten Apples](https://leetcode.com/problems/maximum-number-of-eaten-apples/description/) |Medium|To Do|To Do|
|1723|[Find Minimum Time to Finish All Jobs](https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs/description/) |Hard|To Do|To Do|
|1707|[Maximum XOR With an Element From Array](https://leetcode.com/problems/maximum-xor-with-an-element-from-array/description/) |Hard|To Do|To Do|
|1683|[Invalid Tweets](https://leetcode.com/problems/invalid-tweets/description/) |Easy|To Do|To Do|
|1692|[Count Ways to Distribute Candies](https://leetcode.com/problems/count-ways-to-distribute-candies/description/) :lock:|Hard|To Do|To Do|
|1710|[Maximum Units on a Truck](https://leetcode.com/problems/maximum-units-on-a-truck/description/) |Easy|To Do|To Do|
|1711|[Count Good Meals](https://leetcode.com/problems/count-good-meals/description/) |Medium|To Do|To Do|
|1712|[Ways to Split Array Into Three Subarrays](https://leetcode.com/problems/ways-to-split-array-into-three-subarrays/description/) |Medium|To Do|To Do|
|1713|[Minimum Operations to Make a Subsequence](https://leetcode.com/problems/minimum-operations-to-make-a-subsequence/description/) |Hard|To Do|To Do|
|1732|[Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude/description/) |Easy|To Do|To Do|
|1733|[Minimum Number of People to Teach](https://leetcode.com/problems/minimum-number-of-people-to-teach/description/) |Medium|To Do|To Do|
|1734|[Decode XORed Permutation](https://leetcode.com/problems/decode-xored-permutation/description/) |Medium|To Do|To Do|
|1735|[Count Ways to Make Array With Product](https://leetcode.com/problems/count-ways-to-make-array-with-product/description/) |Hard|To Do|To Do|
|1693|[Daily Leads and Partners](https://leetcode.com/problems/daily-leads-and-partners/description/) |Easy|To Do|To Do|
|1698|[Number of Distinct Substrings in a String](https://leetcode.com/problems/number-of-distinct-substrings-in-a-string/description/) :lock:|Medium|To Do|To Do|
|1720|[Decode XORed Array](https://leetcode.com/problems/decode-xored-array/description/) |Easy|To Do|To Do|
|1722|[Minimize Hamming Distance After Swap Operations](https://leetcode.com/problems/minimize-hamming-distance-after-swap-operations/description/) |Medium|To Do|To Do|
|1699|[Number of Calls Between Two Persons](https://leetcode.com/problems/number-of-calls-between-two-persons/description/) :lock:|Medium|To Do|To Do|
|1725|[Number Of Rectangles That Can Form The Largest Square](https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/description/) |Easy|To Do|To Do|
|1742|[Maximum Number of Balls in a Box](https://leetcode.com/problems/maximum-number-of-balls-in-a-box/description/) |Easy|To Do|To Do|
|1727|[Largest Submatrix With Rearrangements](https://leetcode.com/problems/largest-submatrix-with-rearrangements/description/) |Medium|To Do|To Do|
|1708|[Largest Subarray Length K](https://leetcode.com/problems/largest-subarray-length-k/description/) :lock:|Easy|To Do|To Do|
|1748|[Sum of Unique Elements](https://leetcode.com/problems/sum-of-unique-elements/description/) |Easy|To Do|To Do|
|1749|[Maximum Absolute Sum of Any Subarray](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/description/) |Medium|To Do|To Do|
|1750|[Minimum Length of String After Deleting Similar Ends](https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/description/) |Medium|To Do|To Do|
|1751|[Maximum Number of Events That Can Be Attended II](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended-ii/description/) |Hard|To Do|To Do|
|1709|[Biggest Window Between Visits](https://leetcode.com/problems/biggest-window-between-visits/description/) :lock:|Medium|To Do|To Do|
|1736|[Latest Time by Replacing Hidden Digits](https://leetcode.com/problems/latest-time-by-replacing-hidden-digits/description/) |Easy|To Do|To Do|
|1737|[Change Minimum Characters to Satisfy One of Three Conditions](https://leetcode.com/problems/change-minimum-characters-to-satisfy-one-of-three-conditions/description/) |Medium|To Do|To Do|
|1738|[Find Kth Largest XOR Coordinate Value](https://leetcode.com/problems/find-kth-largest-xor-coordinate-value/description/) |Medium|To Do|To Do|
|1739|[Building Boxes](https://leetcode.com/problems/building-boxes/description/) |Hard|To Do|To Do|
|1715|[Count Apples and Oranges](https://leetcode.com/problems/count-apples-and-oranges/description/) :lock:|Medium|To Do|To Do|
|1724|[Checking Existence of Edge Length Limited Paths II](https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths-ii/description/) :lock:|Hard|To Do|To Do|
|1743|[Restore the Array From Adjacent Pairs](https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/description/) |Medium|To Do|To Do|
|1745|[Palindrome Partitioning IV](https://leetcode.com/problems/palindrome-partitioning-iv/description/) |Hard|To Do|To Do|
|1744|[Can You Eat Your Favorite Candy on Your Favorite Day?](https://leetcode.com/problems/can-you-eat-your-favorite-candy-on-your-favorite-day/description/) |Medium|To Do|To Do|
|1763|[Longest Nice Substring](https://leetcode.com/problems/longest-nice-substring/description/) |Easy|To Do|To Do|
|1764|[Form Array by Concatenating Subarrays of Another Array](https://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array/description/) |Medium|To Do|To Do|
|1766|[Tree of Coprimes](https://leetcode.com/problems/tree-of-coprimes/description/) |Hard|To Do|To Do|
|1765|[Map of Highest Peak](https://leetcode.com/problems/map-of-highest-peak/description/) |Medium|To Do|To Do|
|1729|[Find Followers Count](https://leetcode.com/problems/find-followers-count/description/) |Easy|To Do|To Do|
|1752|[Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/description/) |Easy|To Do|To Do|
|1753|[Maximum Score From Removing Stones](https://leetcode.com/problems/maximum-score-from-removing-stones/description/) |Medium|To Do|To Do|
|1754|[Largest Merge Of Two Strings](https://leetcode.com/problems/largest-merge-of-two-strings/description/) |Medium|To Do|To Do|
|1755|[Closest Subsequence Sum](https://leetcode.com/problems/closest-subsequence-sum/description/) |Hard|To Do|To Do|
|1731|[The Number of Employees Which Report to Each Employee](https://leetcode.com/problems/the-number-of-employees-which-report-to-each-employee/description/) |Easy|To Do|To Do|
|1740|[Find Distance in a Binary Tree](https://leetcode.com/problems/find-distance-in-a-binary-tree/description/) :lock:|Medium|To Do|To Do|
|1758|[Minimum Changes To Make Alternating Binary String](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/description/) |Easy|To Do|To Do|
|1759|[Count Number of Homogenous Substrings](https://leetcode.com/problems/count-number-of-homogenous-substrings/description/) |Medium|To Do|To Do|
|1760|[Minimum Limit of Balls in a Bag](https://leetcode.com/problems/minimum-limit-of-balls-in-a-bag/description/) |Medium|To Do|To Do|
|1761|[Minimum Degree of a Connected Trio in a Graph](https://leetcode.com/problems/minimum-degree-of-a-connected-trio-in-a-graph/description/) |Hard|To Do|To Do|
|1779|[Find Nearest Point That Has the Same X or Y Coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/description/) |Easy|To Do|To Do|
|1780|[Check if Number is a Sum of Powers of Three](https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/description/) |Medium|To Do|To Do|
|1781|[Sum of Beauty of All Substrings](https://leetcode.com/problems/sum-of-beauty-of-all-substrings/description/) |Medium|To Do|To Do|
|1782|[Count Pairs Of Nodes](https://leetcode.com/problems/count-pairs-of-nodes/description/) |Hard|To Do|To Do|
|1741|[Find Total Time Spent by Each Employee](https://leetcode.com/problems/find-total-time-spent-by-each-employee/description/) |Easy|To Do|To Do|
|1746|[Maximum Subarray Sum After One Operation](https://leetcode.com/problems/maximum-subarray-sum-after-one-operation/description/) :lock:|Medium|To Do|To Do|
|1768|[Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/description/) |Easy|To Do|To Do|
|1769|[Minimum Number of Operations to Move All Balls to Each Box](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/description/) |Medium|To Do|To Do|
|1770|[Maximum Score from Performing Multiplication Operations](https://leetcode.com/problems/maximum-score-from-performing-multiplication-operations/description/) |Hard|To Do|To Do|
|1771|[Maximize Palindrome Length From Subsequences](https://leetcode.com/problems/maximize-palindrome-length-from-subsequences/description/) |Hard|To Do|To Do|
|1747|[Leetflex Banned Accounts](https://leetcode.com/problems/leetflex-banned-accounts/description/) :lock:|Medium|To Do|To Do|
|1773|[Count Items Matching a Rule](https://leetcode.com/problems/count-items-matching-a-rule/description/) |Easy|To Do|To Do|
|1774|[Closest Dessert Cost](https://leetcode.com/problems/closest-dessert-cost/description/) |Medium|To Do|To Do|
|1775|[Equal Sum Arrays With Minimum Number of Operations](https://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations/description/) |Medium|To Do|To Do|
|1776|[Car Fleet II](https://leetcode.com/problems/car-fleet-ii/description/) |Hard|To Do|To Do|
|1756|[Design Most Recently Used Queue](https://leetcode.com/problems/design-most-recently-used-queue/description/) :lock:|Medium|To Do|To Do|
|1796|[Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string/description/) |Easy|To Do|To Do|
|1797|[Design Authentication Manager](https://leetcode.com/problems/design-authentication-manager/description/) |Medium|To Do|To Do|
|1799|[Maximize Score After N Operations](https://leetcode.com/problems/maximize-score-after-n-operations/description/) |Hard|To Do|To Do|
|1803|[Count Pairs With XOR in a Range](https://leetcode.com/problems/count-pairs-with-xor-in-a-range/description/) |Hard|To Do|To Do|
|1757|[Recyclable and Low Fat Products](https://leetcode.com/problems/recyclable-and-low-fat-products/description/) |Easy|To Do|To Do|
|1762|[Buildings With an Ocean View](https://leetcode.com/problems/buildings-with-an-ocean-view/description/) :lock:|Medium|To Do|To Do|
|1784|[Check if Binary String Has at Most One Segment of Ones](https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones/description/) |Easy|To Do|To Do|
|1785|[Minimum Elements to Add to Form a Given Sum](https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/description/) |Medium|To Do|To Do|
|1786|[Number of Restricted Paths From First to Last Node](https://leetcode.com/problems/number-of-restricted-paths-from-first-to-last-node/description/) |Medium|To Do|To Do|
|1787|[Make the XOR of All Segments Equal to Zero](https://leetcode.com/problems/make-the-xor-of-all-segments-equal-to-zero/description/) |Hard|To Do|To Do|
|1767|[Find the Subtasks That Did Not Execute](https://leetcode.com/problems/find-the-subtasks-that-did-not-execute/description/) :lock:|Hard|To Do|To Do|
|1790|[Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/description/) |Easy|To Do|To Do|
|1791|[Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph/description/) |Easy|To Do|To Do|
|1792|[Maximum Average Pass Ratio](https://leetcode.com/problems/maximum-average-pass-ratio/description/) |Medium|To Do|To Do|
|1793|[Maximum Score of a Good Subarray](https://leetcode.com/problems/maximum-score-of-a-good-subarray/description/) |Hard|To Do|To Do|
|1772|[Sort Features by Popularity](https://leetcode.com/problems/sort-features-by-popularity/description/) :lock:|Medium|To Do|To Do|
|1812|[Determine Color of a Chessboard Square](https://leetcode.com/problems/determine-color-of-a-chessboard-square/description/) |Easy|To Do|To Do|
|1813|[Sentence Similarity III](https://leetcode.com/problems/sentence-similarity-iii/description/) |Medium|To Do|To Do|
|1815|[Maximum Number of Groups Getting Fresh Donuts](https://leetcode.com/problems/maximum-number-of-groups-getting-fresh-donuts/description/) |Hard|To Do|To Do|
|1814|[Count Nice Pairs in an Array](https://leetcode.com/problems/count-nice-pairs-in-an-array/description/) |Medium|To Do|To Do|
|1777|[Product's Price for Each Store](https://leetcode.com/problems/products-price-for-each-store/description/) :lock:|Easy|To Do|To Do|
|1800|[Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/description/) |Easy|To Do|To Do|
|1801|[Number of Orders in the Backlog](https://leetcode.com/problems/number-of-orders-in-the-backlog/description/) |Medium|To Do|To Do|
|1802|[Maximum Value at a Given Index in a Bounded Array](https://leetcode.com/problems/maximum-value-at-a-given-index-in-a-bounded-array/description/) |Medium|To Do|To Do|
|1798|[Maximum Number of Consecutive Values You Can Make](https://leetcode.com/problems/maximum-number-of-consecutive-values-you-can-make/description/) |Medium|To Do|To Do|
|1778|[Shortest Path in a Hidden Grid](https://leetcode.com/problems/shortest-path-in-a-hidden-grid/description/) :lock:|Medium|To Do|To Do|
|1783|[Grand Slam Titles](https://leetcode.com/problems/grand-slam-titles/description/) :lock:|Medium|To Do|To Do|
|1805|[Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string/description/) |Easy|To Do|To Do|
|1807|[Evaluate the Bracket Pairs of a String](https://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string/description/) |Medium|To Do|To Do|
|1806|[Minimum Number of Operations to Reinitialize a Permutation](https://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation/description/) |Medium|To Do|To Do|
|1808|[Maximize Number of Nice Divisors](https://leetcode.com/problems/maximize-number-of-nice-divisors/description/) |Hard|To Do|To Do|
|1788|[Maximize the Beauty of the Garden](https://leetcode.com/problems/maximize-the-beauty-of-the-garden/description/) :lock:|Hard|To Do|To Do|
|1827|[Minimum Operations to Make the Array Increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/description/) |Easy|To Do|To Do|
|1828|[Queries on Number of Points Inside a Circle](https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle/description/) |Medium|To Do|To Do|
|1829|[Maximum XOR for Each Query](https://leetcode.com/problems/maximum-xor-for-each-query/description/) |Medium|To Do|To Do|
|1830|[Minimum Number of Operations to Make String Sorted](https://leetcode.com/problems/minimum-number-of-operations-to-make-string-sorted/description/) |Hard|To Do|To Do|
|1789|[Primary Department for Each Employee](https://leetcode.com/problems/primary-department-for-each-employee/description/) |Easy|To Do|To Do|
|1794|[Count Pairs of Equal Substrings With Minimum Difference](https://leetcode.com/problems/count-pairs-of-equal-substrings-with-minimum-difference/description/) :lock:|Medium|To Do|To Do|
|1816|[Truncate Sentence](https://leetcode.com/problems/truncate-sentence/description/) |Easy|To Do|To Do|
|1817|[Finding the Users Active Minutes](https://leetcode.com/problems/finding-the-users-active-minutes/description/) |Medium|To Do|To Do|
|1818|[Minimum Absolute Sum Difference](https://leetcode.com/problems/minimum-absolute-sum-difference/description/) |Medium|To Do|To Do|
|1819|[Number of Different Subsequences GCDs](https://leetcode.com/problems/number-of-different-subsequences-gcds/description/) |Hard|To Do|To Do|
|1795|[Rearrange Products Table](https://leetcode.com/problems/rearrange-products-table/description/) |Easy|To Do|To Do|
|1804|[Implement Trie II (Prefix Tree)](https://leetcode.com/problems/implement-trie-ii-prefix-tree/description/) :lock:|Medium|To Do|To Do|
|1822|[Sign of the Product of an Array](https://leetcode.com/problems/sign-of-the-product-of-an-array/description/) |Easy|To Do|To Do|
|1823|[Find the Winner of the Circular Game](https://leetcode.com/problems/find-the-winner-of-the-circular-game/description/) |Medium|To Do|To Do|
|1824|[Minimum Sideway Jumps](https://leetcode.com/problems/minimum-sideway-jumps/description/) |Medium|To Do|To Do|
|1825|[Finding MK Average](https://leetcode.com/problems/finding-mk-average/description/) |Hard|To Do|To Do|
|1844|[Replace All Digits with Characters](https://leetcode.com/problems/replace-all-digits-with-characters/description/) |Easy|To Do|To Do|
|1845|[Seat Reservation Manager](https://leetcode.com/problems/seat-reservation-manager/description/) |Medium|To Do|To Do|
|1846|[Maximum Element After Decreasing and Rearranging](https://leetcode.com/problems/maximum-element-after-decreasing-and-rearranging/description/) |Medium|To Do|To Do|
|1847|[Closest Room](https://leetcode.com/problems/closest-room/description/) |Hard|To Do|To Do|
|1809|[Ad-Free Sessions](https://leetcode.com/problems/ad-free-sessions/description/) :lock:|Easy|To Do|To Do|
|1810|[Minimum Path Cost in a Hidden Grid](https://leetcode.com/problems/minimum-path-cost-in-a-hidden-grid/description/) :lock:|Medium|To Do|To Do|
|1832|[Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram/description/) |Easy|To Do|To Do|
|1833|[Maximum Ice Cream Bars](https://leetcode.com/problems/maximum-ice-cream-bars/description/) |Medium|To Do|To Do|
|1834|[Single-Threaded CPU](https://leetcode.com/problems/single-threaded-cpu/description/) |Medium|To Do|To Do|
|1835|[Find XOR Sum of All Pairs Bitwise AND](https://leetcode.com/problems/find-xor-sum-of-all-pairs-bitwise-and/description/) |Hard|To Do|To Do|
|1811|[Find Interview Candidates](https://leetcode.com/problems/find-interview-candidates/description/) :lock:|Medium|To Do|To Do|
|1837|[Sum of Digits in Base K](https://leetcode.com/problems/sum-of-digits-in-base-k/description/) |Easy|To Do|To Do|
|1838|[Frequency of the Most Frequent Element](https://leetcode.com/problems/frequency-of-the-most-frequent-element/description/) |Medium|To Do|To Do|
|1839|[Longest Substring Of All Vowels in Order](https://leetcode.com/problems/longest-substring-of-all-vowels-in-order/description/) |Medium|To Do|To Do|
|1840|[Maximum Building Height](https://leetcode.com/problems/maximum-building-height/description/) |Hard|To Do|To Do|
|1820|[Maximum Number of Accepted Invitations](https://leetcode.com/problems/maximum-number-of-accepted-invitations/description/) :lock:|Medium|To Do|To Do|
|1859|[Sorting the Sentence](https://leetcode.com/problems/sorting-the-sentence/description/) |Easy|To Do|To Do|
|1860|[Incremental Memory Leak](https://leetcode.com/problems/incremental-memory-leak/description/) |Medium|To Do|To Do|
|1861|[Rotating the Box](https://leetcode.com/problems/rotating-the-box/description/) |Medium|To Do|To Do|
|1821|[Find Customers With Positive Revenue this Year](https://leetcode.com/problems/find-customers-with-positive-revenue-this-year/description/) :lock:|Easy|To Do|To Do|
|1848|[Minimum Distance to the Target Element](https://leetcode.com/problems/minimum-distance-to-the-target-element/description/) |Easy|To Do|To Do|
|1849|[Splitting a String Into Descending Consecutive Values](https://leetcode.com/problems/splitting-a-string-into-descending-consecutive-values/description/) |Medium|To Do|To Do|
|1851|[Minimum Interval to Include Each Query](https://leetcode.com/problems/minimum-interval-to-include-each-query/description/) |Hard|To Do|To Do|
|1850|[Minimum Adjacent Swaps to Reach the Kth Smallest Number](https://leetcode.com/problems/minimum-adjacent-swaps-to-reach-the-kth-smallest-number/description/) |Medium|To Do|To Do|
|1989|[Maximum Number of People That Can Be Caught in Tag](https://leetcode.com/problems/maximum-number-of-people-that-can-be-caught-in-tag/description/) :lock:|Medium|To Do|To Do|
|1826|[Faulty Sensor](https://leetcode.com/problems/faulty-sensor/description/) :lock:|Easy|To Do|To Do|
|1831|[Maximum Transaction Each Day](https://leetcode.com/problems/maximum-transaction-each-day/description/) :lock:|Medium|To Do|To Do|
|1836|[Remove Duplicates From an Unsorted Linked List](https://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list/description/) :lock:|Medium|To Do|To Do|
|1854|[Maximum Population Year](https://leetcode.com/problems/maximum-population-year/description/) |Easy|To Do|To Do|
|1855|[Maximum Distance Between a Pair of Values](https://leetcode.com/problems/maximum-distance-between-a-pair-of-values/description/) |Medium|To Do|To Do|
|1856|[Maximum Subarray Min-Product](https://leetcode.com/problems/maximum-subarray-min-product/description/) |Medium|To Do|To Do|
|1857|[Largest Color Value in a Directed Graph](https://leetcode.com/problems/largest-color-value-in-a-directed-graph/description/) |Hard|To Do|To Do|
|1876|[Substrings of Size Three with Distinct Characters](https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/description/) |Easy|To Do|To Do|
|1877|[Minimize Maximum Pair Sum in Array](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/description/) |Medium|To Do|To Do|
|1879|[Minimum XOR Sum of Two Arrays](https://leetcode.com/problems/minimum-xor-sum-of-two-arrays/description/) |Hard|To Do|To Do|
|1878|[Get Biggest Three Rhombus Sums in a Grid](https://leetcode.com/problems/get-biggest-three-rhombus-sums-in-a-grid/description/) |Medium|To Do|To Do|
|1841|[League Statistics](https://leetcode.com/problems/league-statistics/description/) :lock:|Medium|To Do|To Do|
|2046|[Sort Linked List Already Sorted Using Absolute Values](https://leetcode.com/problems/sort-linked-list-already-sorted-using-absolute-values/description/) :lock:|Medium|To Do|To Do|
|1863|[Sum of All Subset XOR Totals](https://leetcode.com/problems/sum-of-all-subset-xor-totals/description/) |Easy|To Do|To Do|
|1864|[Minimum Number of Swaps to Make the Binary String Alternating](https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-binary-string-alternating/description/) |Medium|To Do|To Do|
|1865|[Finding Pairs With a Certain Sum](https://leetcode.com/problems/finding-pairs-with-a-certain-sum/description/) |Medium|To Do|To Do|
|1866|[Number of Ways to Rearrange Sticks With K Sticks Visible](https://leetcode.com/problems/number-of-ways-to-rearrange-sticks-with-k-sticks-visible/description/) |Hard|To Do|To Do|
|1842|[Next Palindrome Using Same Digits](https://leetcode.com/problems/next-palindrome-using-same-digits/description/) :lock:|Hard|To Do|To Do|
|1843|[Suspicious Bank Accounts](https://leetcode.com/problems/suspicious-bank-accounts/description/) :lock:|Medium|To Do|To Do|
|1869|[Longer Contiguous Segments of Ones than Zeros](https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros/description/) |Easy|To Do|To Do|
|1870|[Minimum Speed to Arrive on Time](https://leetcode.com/problems/minimum-speed-to-arrive-on-time/description/) |Medium|To Do|To Do|
|1871|[Jump Game VII](https://leetcode.com/problems/jump-game-vii/description/) |Medium|To Do|To Do|
|1872|[Stone Game VIII](https://leetcode.com/problems/stone-game-viii/description/) |Hard|To Do|To Do|
|1852|[Distinct Numbers in Each Subarray](https://leetcode.com/problems/distinct-numbers-in-each-subarray/description/) :lock:|Medium|To Do|To Do|
|1853|[Convert Date Format](https://leetcode.com/problems/convert-date-format/description/) :lock:|Easy|To Do|To Do|
|1893|[Check if All the Integers in a Range Are Covered](https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered/description/) |Easy|To Do|To Do|
|1894|[Find the Student that Will Replace the Chalk](https://leetcode.com/problems/find-the-student-that-will-replace-the-chalk/description/) |Medium|To Do|To Do|
|2247|[Maximum Cost of Trip With K Highways](https://leetcode.com/problems/maximum-cost-of-trip-with-k-highways/description/) :lock:|Hard|To Do|To Do|
|1896|[Minimum Cost to Change the Final Value of Expression](https://leetcode.com/problems/minimum-cost-to-change-the-final-value-of-expression/description/) |Hard|To Do|To Do|
|1858|[Longest Word With All Prefixes](https://leetcode.com/problems/longest-word-with-all-prefixes/description/) :lock:|Medium|To Do|To Do|
|1880|[Check if Word Equals Summation of Two Words](https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/description/) |Easy|To Do|To Do|
|1881|[Maximum Value after Insertion](https://leetcode.com/problems/maximum-value-after-insertion/description/) |Medium|To Do|To Do|
|1882|[Process Tasks Using Servers](https://leetcode.com/problems/process-tasks-using-servers/description/) |Medium|To Do|To Do|
|1883|[Minimum Skips to Arrive at Meeting On Time](https://leetcode.com/problems/minimum-skips-to-arrive-at-meeting-on-time/description/) |Hard|To Do|To Do|
|1867|[Orders With Maximum Quantity Above Average](https://leetcode.com/problems/orders-with-maximum-quantity-above-average/description/) :lock:|Medium|To Do|To Do|
|1886|[Determine Whether Matrix Can Be Obtained By Rotation](https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation/description/) |Easy|To Do|To Do|
|1887|[Reduction Operations to Make the Array Elements Equal](https://leetcode.com/problems/reduction-operations-to-make-the-array-elements-equal/description/) |Medium|To Do|To Do|
|1888|[Minimum Number of Flips to Make the Binary String Alternating](https://leetcode.com/problems/minimum-number-of-flips-to-make-the-binary-string-alternating/description/) |Medium|To Do|To Do|
|1889|[Minimum Space Wasted From Packaging](https://leetcode.com/problems/minimum-space-wasted-from-packaging/description/) |Hard|To Do|To Do|
|1868|[Product of Two Run-Length Encoded Arrays](https://leetcode.com/problems/product-of-two-run-length-encoded-arrays/description/) :lock:|Medium|To Do|To Do|
|1909|[Remove One Element to Make the Array Strictly Increasing](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/description/) |Easy|To Do|To Do|
|1910|[Remove All Occurrences of a Substring](https://leetcode.com/problems/remove-all-occurrences-of-a-substring/description/) |Medium|To Do|To Do|
|1911|[Maximum Alternating Subsequence Sum](https://leetcode.com/problems/maximum-alternating-subsequence-sum/description/) |Medium|To Do|To Do|
|1912|[Design Movie Rental System](https://leetcode.com/problems/design-movie-rental-system/description/) |Hard|To Do|To Do|
|1873|[Calculate Special Bonus](https://leetcode.com/problems/calculate-special-bonus/description/) |Easy|To Do|To Do|
|1897|[Redistribute Characters to Make All Strings Equal](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/description/) |Easy|To Do|To Do|
|1899|[Merge Triplets to Form Target Triplet](https://leetcode.com/problems/merge-triplets-to-form-target-triplet/description/) |Medium|To Do|To Do|
|1898|[Maximum Number of Removable Characters](https://leetcode.com/problems/maximum-number-of-removable-characters/description/) |Medium|To Do|To Do|
|1900|[The Earliest and Latest Rounds Where Players Compete](https://leetcode.com/problems/the-earliest-and-latest-rounds-where-players-compete/description/) |Hard|To Do|To Do|
|1874|[Minimize Product Sum of Two Arrays](https://leetcode.com/problems/minimize-product-sum-of-two-arrays/description/) :lock:|Medium|To Do|To Do|
|1875|[Group Employees of the Same Salary](https://leetcode.com/problems/group-employees-of-the-same-salary/description/) :lock:|Medium|To Do|To Do|
|1884|[Egg Drop With 2 Eggs and N Floors](https://leetcode.com/problems/egg-drop-with-2-eggs-and-n-floors/description/) |Medium|To Do|To Do|
|1903|[Largest Odd Number in String](https://leetcode.com/problems/largest-odd-number-in-string/description/) |Easy|To Do|To Do|
|1904|[The Number of Full Rounds You Have Played](https://leetcode.com/problems/the-number-of-full-rounds-you-have-played/description/) |Medium|To Do|To Do|
|1906|[Minimum Absolute Difference Queries](https://leetcode.com/problems/minimum-absolute-difference-queries/description/) |Medium|To Do|To Do|
|1905|[Count Sub Islands](https://leetcode.com/problems/count-sub-islands/description/) |Medium|To Do|To Do|
|1885|[Count Pairs in Two Arrays](https://leetcode.com/problems/count-pairs-in-two-arrays/description/) :lock:|Medium|To Do|To Do|
|1925|[Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples/description/) |Easy|To Do|To Do|
|1926|[Nearest Exit from Entrance in Maze](https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/description/) |Medium|To Do|To Do|
|1927|[Sum Game](https://leetcode.com/problems/sum-game/description/) |Medium|To Do|To Do|
|1928|[Minimum Cost to Reach Destination in Time](https://leetcode.com/problems/minimum-cost-to-reach-destination-in-time/description/) |Hard|To Do|To Do|
|1890|[The Latest Login in 2020](https://leetcode.com/problems/the-latest-login-in-2020/description/) |Easy|To Do|To Do|
|1913|[Maximum Product Difference Between Two Pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs/description/) |Easy|To Do|To Do|
|1914|[Cyclically Rotating a Grid](https://leetcode.com/problems/cyclically-rotating-a-grid/description/) |Medium|To Do|To Do|
|1915|[Number of Wonderful Substrings](https://leetcode.com/problems/number-of-wonderful-substrings/description/) |Medium|To Do|To Do|
|1891|[Cutting Ribbons](https://leetcode.com/problems/cutting-ribbons/description/) :lock:|Medium|To Do|To Do|
|1892|[Page Recommendations II](https://leetcode.com/problems/page-recommendations-ii/description/) :lock:|Hard|To Do|To Do|
|1901|[Find a Peak Element II](https://leetcode.com/problems/find-a-peak-element-ii/description/) |Medium|To Do|To Do|
|1920|[Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation/description/) |Easy|To Do|To Do|
|1921|[Eliminate Maximum Number of Monsters](https://leetcode.com/problems/eliminate-maximum-number-of-monsters/description/) |Medium|To Do|To Do|
|1922|[Count Good Numbers](https://leetcode.com/problems/count-good-numbers/description/) |Medium|To Do|To Do|
|1923|[Longest Common Subpath](https://leetcode.com/problems/longest-common-subpath/description/) |Hard|To Do|To Do|
|1902|[Depth of BST Given Insertion Order](https://leetcode.com/problems/depth-of-bst-given-insertion-order/description/) :lock:|Medium|To Do|To Do|
|1941|[Check if All Characters Have Equal Number of Occurrences](https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/description/) |Easy|To Do|To Do|
|1942|[The Number of the Smallest Unoccupied Chair](https://leetcode.com/problems/the-number-of-the-smallest-unoccupied-chair/description/) |Medium|To Do|To Do|
|1943|[Describe the Painting](https://leetcode.com/problems/describe-the-painting/description/) |Medium|To Do|To Do|
|2297|[Jump Game VIII](https://leetcode.com/problems/jump-game-viii/description/) :lock:|Medium|To Do|To Do|
|1907|[Count Salary Categories](https://leetcode.com/problems/count-salary-categories/description/) |Medium|To Do|To Do|
|1929|[Concatenation of Array](https://leetcode.com/problems/concatenation-of-array/description/) |Easy|To Do|To Do|
|1930|[Unique Length-3 Palindromic Subsequences](https://leetcode.com/problems/unique-length-3-palindromic-subsequences/description/) |Medium|To Do|To Do|
|1932|[Merge BSTs to Create Single BST](https://leetcode.com/problems/merge-bsts-to-create-single-bst/description/) |Hard|To Do|To Do|
|1931|[Painting a Grid With Three Different Colors](https://leetcode.com/problems/painting-a-grid-with-three-different-colors/description/) |Hard|To Do|To Do|
|1908|[Game of Nim](https://leetcode.com/problems/game-of-nim/description/) :lock:|Medium|To Do|To Do|
|1917|[Leetcodify Friends Recommendations](https://leetcode.com/problems/leetcodify-friends-recommendations/description/) :lock:|Hard|To Do|To Do|
|1919|[Leetcodify Similar Friends](https://leetcode.com/problems/leetcodify-similar-friends/description/) :lock:|Hard|To Do|To Do|
|2307|[Check for Contradictions in Equations](https://leetcode.com/problems/check-for-contradictions-in-equations/description/) :lock:|Hard|To Do|To Do|
|1936|[Add Minimum Number of Rungs](https://leetcode.com/problems/add-minimum-number-of-rungs/description/) |Medium|To Do|To Do|
|1937|[Maximum Number of Points with Cost](https://leetcode.com/problems/maximum-number-of-points-with-cost/description/) |Medium|To Do|To Do|
|1938|[Maximum Genetic Difference Query](https://leetcode.com/problems/maximum-genetic-difference-query/description/) |Hard|To Do|To Do|
|1918|[Kth Smallest Subarray Sum](https://leetcode.com/problems/kth-smallest-subarray-sum/description/) :lock:|Medium|To Do|To Do|
|1933|[Check if String Is Decomposable Into Value-Equal Substrings](https://leetcode.com/problems/check-if-string-is-decomposable-into-value-equal-substrings/description/) :lock:|Easy|To Do|To Do|
|1940|[Longest Common Subsequence Between Sorted Arrays](https://leetcode.com/problems/longest-common-subsequence-between-sorted-arrays/description/) :lock:|Medium|To Do|To Do|
|1950|[Maximum of Minimum Values in All Subarrays](https://leetcode.com/problems/maximum-of-minimum-values-in-all-subarrays/description/) :lock:|Medium|To Do|To Do|
|1956|[Minimum Time For K Virus Variants to Spread](https://leetcode.com/problems/minimum-time-for-k-virus-variants-to-spread/description/) :lock:|Hard|To Do|To Do|
|1924|[Erect the Fence II](https://leetcode.com/problems/erect-the-fence-ii/description/) :lock:|Hard|To Do|To Do|
|2021|[Brightest Position on Street](https://leetcode.com/problems/brightest-position-on-street/description/) :lock:|Medium|To Do|To Do|
|1945|[Sum of Digits of String After Convert](https://leetcode.com/problems/sum-of-digits-of-string-after-convert/description/) |Easy|To Do|To Do|
|1946|[Largest Number After Mutating Substring](https://leetcode.com/problems/largest-number-after-mutating-substring/description/) |Medium|To Do|To Do|
|1947|[Maximum Compatibility Score Sum](https://leetcode.com/problems/maximum-compatibility-score-sum/description/) |Medium|To Do|To Do|
|1948|[Delete Duplicate Folders in System](https://leetcode.com/problems/delete-duplicate-folders-in-system/description/) |Hard|To Do|To Do|
|1958|[Check if Move is Legal](https://leetcode.com/problems/check-if-move-is-legal/description/) |Medium|To Do|To Do|
|1959|[Minimum Total Space Wasted With K Resizing Operations](https://leetcode.com/problems/minimum-total-space-wasted-with-k-resizing-operations/description/) |Medium|To Do|To Do|
|2052|[Minimum Cost to Separate Sentence Into Rows](https://leetcode.com/problems/minimum-cost-to-separate-sentence-into-rows/description/) :lock:|Medium|To Do|To Do|
|1952|[Three Divisors](https://leetcode.com/problems/three-divisors/description/) |Easy|To Do|To Do|
|1953|[Maximum Number of Weeks for Which You Can Work](https://leetcode.com/problems/maximum-number-of-weeks-for-which-you-can-work/description/) |Medium|To Do|To Do|
|1968|[Array With Elements Not Equal to Average of Neighbors](https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors/description/) |Medium|To Do|To Do|
|1955|[Count Number of Special Subsequences](https://leetcode.com/problems/count-number-of-special-subsequences/description/) |Hard|To Do|To Do|
|1934|[Confirmation Rate](https://leetcode.com/problems/confirmation-rate/description/) |Medium|To Do|To Do|
|1974|[Minimum Time to Type Word Using Special Typewriter](https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter/description/) |Easy|To Do|To Do|
|1975|[Maximum Matrix Sum](https://leetcode.com/problems/maximum-matrix-sum/description/) |Medium|To Do|To Do|
|1976|[Number of Ways to Arrive at Destination](https://leetcode.com/problems/number-of-ways-to-arrive-at-destination/description/) |Medium|To Do|To Do|
|1977|[Number of Ways to Separate Numbers](https://leetcode.com/problems/number-of-ways-to-separate-numbers/description/) |Hard|To Do|To Do|
|1939|[Users That Actively Request Confirmation Messages](https://leetcode.com/problems/users-that-actively-request-confirmation-messages/description/) :lock:|Easy|To Do|To Do|
|1961|[Check If String Is a Prefix of Array](https://leetcode.com/problems/check-if-string-is-a-prefix-of-array/description/) |Easy|To Do|To Do|
|1962|[Remove Stones to Minimize the Total](https://leetcode.com/problems/remove-stones-to-minimize-the-total/description/) |Medium|To Do|To Do|
|1963|[Minimum Number of Swaps to Make the String Balanced](https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-string-balanced/description/) |Medium|To Do|To Do|
|1964|[Find the Longest Valid Obstacle Course at Each Position](https://leetcode.com/problems/find-the-longest-valid-obstacle-course-at-each-position/description/) |Hard|To Do|To Do|
|1949|[Strong Friendship](https://leetcode.com/problems/strong-friendship/description/) :lock:|Medium|To Do|To Do|
|1951|[All the Pairs With the Maximum Number of Common Followers](https://leetcode.com/problems/all-the-pairs-with-the-maximum-number-of-common-followers/description/) :lock:|Medium|To Do|To Do|
|1967|[Number of Strings That Appear as Substrings in Word](https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word/description/) |Easy|To Do|To Do|
|1969|[Minimum Non-Zero Product of the Array Elements](https://leetcode.com/problems/minimum-non-zero-product-of-the-array-elements/description/) |Medium|To Do|To Do|
|1970|[Last Day Where You Can Still Cross](https://leetcode.com/problems/last-day-where-you-can-still-cross/description/) |Hard|To Do|To Do|
|1991|[Find the Middle Index in Array](https://leetcode.com/problems/find-the-middle-index-in-array/description/) |Easy|To Do|To Do|
|1992|[Find All Groups of Farmland](https://leetcode.com/problems/find-all-groups-of-farmland/description/) |Medium|To Do|To Do|
|1993|[Operations on Tree](https://leetcode.com/problems/operations-on-tree/description/) |Medium|To Do|To Do|
|1994|[The Number of Good Subsets](https://leetcode.com/problems/the-number-of-good-subsets/description/) |Hard|To Do|To Do|
|1979|[Find Greatest Common Divisor of Array](https://leetcode.com/problems/find-greatest-common-divisor-of-array/description/) |Easy|To Do|To Do|
|1980|[Find Unique Binary String](https://leetcode.com/problems/find-unique-binary-string/description/) |Medium|To Do|To Do|
|1981|[Minimize the Difference Between Target and Chosen Elements](https://leetcode.com/problems/minimize-the-difference-between-target-and-chosen-elements/description/) |Medium|To Do|To Do|
|1982|[Find Array Given Subset Sums](https://leetcode.com/problems/find-array-given-subset-sums/description/) |Hard|To Do|To Do|
|1965|[Employees With Missing Information](https://leetcode.com/problems/employees-with-missing-information/description/) |Easy|To Do|To Do|
|1966|[Binary Searchable Numbers in an Unsorted Array](https://leetcode.com/problems/binary-searchable-numbers-in-an-unsorted-array/description/) :lock:|Medium|To Do|To Do|
|1984|[Minimum Difference Between Highest and Lowest of K Scores](https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/description/) |Easy|To Do|To Do|
|1985|[Find the Kth Largest Integer in the Array](https://leetcode.com/problems/find-the-kth-largest-integer-in-the-array/description/) |Medium|To Do|To Do|
|1986|[Minimum Number of Work Sessions to Finish the Tasks](https://leetcode.com/problems/minimum-number-of-work-sessions-to-finish-the-tasks/description/) |Medium|To Do|To Do|
|1987|[Number of Unique Good Subsequences](https://leetcode.com/problems/number-of-unique-good-subsequences/description/) |Hard|To Do|To Do|
|2006|[Count Number of Pairs With Absolute Difference K](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/description/) |Easy|To Do|To Do|
|2007|[Find Original Array From Doubled Array](https://leetcode.com/problems/find-original-array-from-doubled-array/description/) |Medium|To Do|To Do|
|2008|[Maximum Earnings From Taxi](https://leetcode.com/problems/maximum-earnings-from-taxi/description/) |Medium|To Do|To Do|
|2009|[Minimum Number of Operations to Make Array Continuous](https://leetcode.com/problems/minimum-number-of-operations-to-make-array-continuous/description/) |Hard|To Do|To Do|
|1972|[First and Last Call On the Same Day](https://leetcode.com/problems/first-and-last-call-on-the-same-day/description/) :lock:|Hard|To Do|To Do|
|1971|[Find if Path Exists in Graph](https://leetcode.com/problems/find-if-path-exists-in-graph/description/) |Easy|To Do|To Do|
|1995|[Count Special Quadruplets](https://leetcode.com/problems/count-special-quadruplets/description/) |Easy|To Do|To Do|
|1996|[The Number of Weak Characters in the Game](https://leetcode.com/problems/the-number-of-weak-characters-in-the-game/description/) |Medium|To Do|To Do|
|1997|[First Day Where You Have Been in All the Rooms](https://leetcode.com/problems/first-day-where-you-have-been-in-all-the-rooms/description/) |Medium|To Do|To Do|
|1998|[GCD Sort of an Array](https://leetcode.com/problems/gcd-sort-of-an-array/description/) |Hard|To Do|To Do|
|1973|[Count Nodes Equal to Sum of Descendants](https://leetcode.com/problems/count-nodes-equal-to-sum-of-descendants/description/) :lock:|Medium|To Do|To Do|
|1978|[Employees Whose Manager Left the Company](https://leetcode.com/problems/employees-whose-manager-left-the-company/description/) |Easy|To Do|To Do|
|2000|[Reverse Prefix of Word](https://leetcode.com/problems/reverse-prefix-of-word/description/) |Easy|To Do|To Do|
|2001|[Number of Pairs of Interchangeable Rectangles](https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles/description/) |Medium|To Do|To Do|
|2002|[Maximum Product of the Length of Two Palindromic Subsequences](https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-subsequences/description/) |Medium|To Do|To Do|
|2003|[Smallest Missing Genetic Value in Each Subtree](https://leetcode.com/problems/smallest-missing-genetic-value-in-each-subtree/description/) |Hard|To Do|To Do|
|2022|[Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array/description/) |Easy|To Do|To Do|
|2023|[Number of Pairs of Strings With Concatenation Equal to Target](https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/description/) |Medium|To Do|To Do|
|2024|[Maximize the Confusion of an Exam](https://leetcode.com/problems/maximize-the-confusion-of-an-exam/description/) |Medium|To Do|To Do|
|2025|[Maximum Number of Ways to Partition an Array](https://leetcode.com/problems/maximum-number-of-ways-to-partition-an-array/description/) |Hard|To Do|To Do|
|1988|[Find Cutoff Score for Each School](https://leetcode.com/problems/find-cutoff-score-for-each-school/description/) :lock:|Medium|To Do|To Do|
|2011|[Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/description/) |Easy|To Do|To Do|
|2012|[Sum of Beauty in the Array](https://leetcode.com/problems/sum-of-beauty-in-the-array/description/) |Medium|To Do|To Do|
|2013|[Detect Squares](https://leetcode.com/problems/detect-squares/description/) |Medium|To Do|To Do|
|2014|[Longest Subsequence Repeated k Times](https://leetcode.com/problems/longest-subsequence-repeated-k-times/description/) |Hard|To Do|To Do|
|1999|[Smallest Greater Multiple Made of Two Digits](https://leetcode.com/problems/smallest-greater-multiple-made-of-two-digits/description/) :lock:|Medium|To Do|To Do|
|2015|[Average Height of Buildings in Each Segment](https://leetcode.com/problems/average-height-of-buildings-in-each-segment/description/) :lock:|Medium|To Do|To Do|
|1990|[Count the Number of Experiments](https://leetcode.com/problems/count-the-number-of-experiments/description/) :lock:|Medium|To Do|To Do|
|2016|[Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements/description/) |Easy|To Do|To Do|
|2017|[Grid Game](https://leetcode.com/problems/grid-game/description/) |Medium|To Do|To Do|
|2018|[Check if Word Can Be Placed In Crossword](https://leetcode.com/problems/check-if-word-can-be-placed-in-crossword/description/) |Medium|To Do|To Do|
|2019|[The Score of Students Solving Math Expression](https://leetcode.com/problems/the-score-of-students-solving-math-expression/description/) |Hard|To Do|To Do|
|2037|[Minimum Number of Moves to Seat Everyone](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/description/) |Easy|To Do|To Do|
|2038|[Remove Colored Pieces if Both Neighbors are the Same Color](https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/description/) |Medium|To Do|To Do|
|2040|[Kth Smallest Product of Two Sorted Arrays](https://leetcode.com/problems/kth-smallest-product-of-two-sorted-arrays/description/) |Hard|To Do|To Do|
|2039|[The Time When the Network Becomes Idle](https://leetcode.com/problems/the-time-when-the-network-becomes-idle/description/) |Medium|To Do|To Do|
|2004|[The Number of Seniors and Juniors to Join the Company](https://leetcode.com/problems/the-number-of-seniors-and-juniors-to-join-the-company/description/) :lock:|Hard|To Do|To Do|
|2005|[Subtree Removal Game with Fibonacci Tree](https://leetcode.com/problems/subtree-removal-game-with-fibonacci-tree/description/) :lock:|Hard|To Do|To Do|
|2027|[Minimum Moves to Convert String](https://leetcode.com/problems/minimum-moves-to-convert-string/description/) |Easy|To Do|To Do|
|2028|[Find Missing Observations](https://leetcode.com/problems/find-missing-observations/description/) |Medium|To Do|To Do|
|2029|[Stone Game IX](https://leetcode.com/problems/stone-game-ix/description/) |Medium|To Do|To Do|
|2030|[Smallest K-Length Subsequence With Occurrences of a Letter](https://leetcode.com/problems/smallest-k-length-subsequence-with-occurrences-of-a-letter/description/) |Hard|To Do|To Do|
|2010|[The Number of Seniors and Juniors to Join the Company II](https://leetcode.com/problems/the-number-of-seniors-and-juniors-to-join-the-company-ii/description/) :lock:|Hard|To Do|To Do|
|2032|[Two Out of Three](https://leetcode.com/problems/two-out-of-three/description/) |Easy|To Do|To Do|
|2033|[Minimum Operations to Make a Uni-Value Grid](https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/description/) |Medium|To Do|To Do|
|2034|[Stock Price Fluctuation ](https://leetcode.com/problems/stock-price-fluctuation/description/) |Medium|To Do|To Do|
|2035|[Partition Array Into Two Arrays to Minimize Sum Difference](https://leetcode.com/problems/partition-array-into-two-arrays-to-minimize-sum-difference/description/) |Hard|To Do|To Do|
|2053|[Kth Distinct String in an Array](https://leetcode.com/problems/kth-distinct-string-in-an-array/description/) |Easy|To Do|To Do|
|2054|[Two Best Non-Overlapping Events](https://leetcode.com/problems/two-best-non-overlapping-events/description/) |Medium|To Do|To Do|
|2055|[Plates Between Candles](https://leetcode.com/problems/plates-between-candles/description/) |Medium|To Do|To Do|
|2056|[Number of Valid Move Combinations On Chessboard](https://leetcode.com/problems/number-of-valid-move-combinations-on-chessboard/description/) |Hard|To Do|To Do|
|2020|[Number of Accounts That Did Not Stream](https://leetcode.com/problems/number-of-accounts-that-did-not-stream/description/) :lock:|Medium|To Do|To Do|
|2042|[Check if Numbers Are Ascending in a Sentence](https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence/description/) |Easy|To Do|To Do|
|2043|[Simple Bank System](https://leetcode.com/problems/simple-bank-system/description/) |Medium|To Do|To Do|
|2044|[Count Number of Maximum Bitwise-OR Subsets](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/description/) |Medium|To Do|To Do|
|2045|[Second Minimum Time to Reach Destination](https://leetcode.com/problems/second-minimum-time-to-reach-destination/description/) |Hard|To Do|To Do|
|2026|[Low-Quality Problems](https://leetcode.com/problems/low-quality-problems/description/) :lock:|Easy|To Do|To Do|
|2047|[Number of Valid Words in a Sentence](https://leetcode.com/problems/number-of-valid-words-in-a-sentence/description/) |Easy|To Do|To Do|
|2048|[Next Greater Numerically Balanced Number](https://leetcode.com/problems/next-greater-numerically-balanced-number/description/) |Medium|To Do|To Do|
|2049|[Count Nodes With the Highest Score](https://leetcode.com/problems/count-nodes-with-the-highest-score/description/) |Medium|To Do|To Do|
|2050|[Parallel Courses III](https://leetcode.com/problems/parallel-courses-iii/description/) |Hard|To Do|To Do|
|2068|[Check Whether Two Strings are Almost Equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/description/) |Easy|To Do|To Do|
|2069|[Walking Robot Simulation II](https://leetcode.com/problems/walking-robot-simulation-ii/description/) |Medium|To Do|To Do|
|2070|[Most Beautiful Item for Each Query](https://leetcode.com/problems/most-beautiful-item-for-each-query/description/) |Medium|To Do|To Do|
|2071|[Maximum Number of Tasks You Can Assign](https://leetcode.com/problems/maximum-number-of-tasks-you-can-assign/description/) |Hard|To Do|To Do|
|2057|[Smallest Index With Equal Value](https://leetcode.com/problems/smallest-index-with-equal-value/description/) |Easy|To Do|To Do|
|2058|[Find the Minimum and Maximum Number of Nodes Between Critical Points](https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/description/) |Medium|To Do|To Do|
|2059|[Minimum Operations to Convert Number](https://leetcode.com/problems/minimum-operations-to-convert-number/description/) |Medium|To Do|To Do|
|2060|[Check if an Original String Exists Given Two Encoded Strings](https://leetcode.com/problems/check-if-an-original-string-exists-given-two-encoded-strings/description/) |Hard|To Do|To Do|
|2041|[Accepted Candidates From the Interviews](https://leetcode.com/problems/accepted-candidates-from-the-interviews/description/) :lock:|Medium|To Do|To Do|
|2062|[Count Vowel Substrings of a String](https://leetcode.com/problems/count-vowel-substrings-of-a-string/description/) |Easy|To Do|To Do|
|2063|[Vowels of All Substrings](https://leetcode.com/problems/vowels-of-all-substrings/description/) |Medium|To Do|To Do|
|2064|[Minimized Maximum of Products Distributed to Any Store](https://leetcode.com/problems/minimized-maximum-of-products-distributed-to-any-store/description/) |Medium|To Do|To Do|
|2065|[Maximum Path Quality of a Graph](https://leetcode.com/problems/maximum-path-quality-of-a-graph/description/) |Hard|To Do|To Do|
|2085|[Count Common Words With One Occurrence](https://leetcode.com/problems/count-common-words-with-one-occurrence/description/) |Easy|To Do|To Do|
|2086|[Minimum Number of Food Buckets to Feed the Hamsters](https://leetcode.com/problems/minimum-number-of-food-buckets-to-feed-the-hamsters/description/) |Medium|To Do|To Do|
|2087|[Minimum Cost Homecoming of a Robot in a Grid](https://leetcode.com/problems/minimum-cost-homecoming-of-a-robot-in-a-grid/description/) |Medium|To Do|To Do|
|2088|[Count Fertile Pyramids in a Land](https://leetcode.com/problems/count-fertile-pyramids-in-a-land/description/) |Hard|To Do|To Do|
|2051|[The Category of Each Member in the Store](https://leetcode.com/problems/the-category-of-each-member-in-the-store/description/) :lock:|Medium|To Do|To Do|
|2073|[Time Needed to Buy Tickets](https://leetcode.com/problems/time-needed-to-buy-tickets/description/) |Easy|To Do|To Do|
|2074|[Reverse Nodes in Even Length Groups](https://leetcode.com/problems/reverse-nodes-in-even-length-groups/description/) |Medium|To Do|To Do|
|2075|[Decode the Slanted Ciphertext](https://leetcode.com/problems/decode-the-slanted-ciphertext/description/) |Medium|To Do|To Do|
|2076|[Process Restricted Friend Requests](https://leetcode.com/problems/process-restricted-friend-requests/description/) |Hard|To Do|To Do|
|2078|[Two Furthest Houses With Different Colors](https://leetcode.com/problems/two-furthest-houses-with-different-colors/description/) |Easy|To Do|To Do|
|2132|[Stamping the Grid](https://leetcode.com/problems/stamping-the-grid/description/) |Hard|To Do|To Do|
|2097|[Valid Arrangement of Pairs](https://leetcode.com/problems/valid-arrangement-of-pairs/description/) |Hard|To Do|To Do|
|2081|[Sum of k-Mirror Numbers](https://leetcode.com/problems/sum-of-k-mirror-numbers/description/) |Hard|To Do|To Do|
|2061|[Number of Spaces Cleaning Robot Cleaned](https://leetcode.com/problems/number-of-spaces-cleaning-robot-cleaned/description/) :lock:|Medium|To Do|To Do|
|2099|[Find Subsequence of Length K With the Largest Sum](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/description/) |Easy|To Do|To Do|
|2100|[Find Good Days to Rob the Bank](https://leetcode.com/problems/find-good-days-to-rob-the-bank/description/) |Medium|To Do|To Do|
|2101|[Detonate the Maximum Bombs](https://leetcode.com/problems/detonate-the-maximum-bombs/description/) |Medium|To Do|To Do|
|2102|[Sequentially Ordinal Rank Tracker](https://leetcode.com/problems/sequentially-ordinal-rank-tracker/description/) |Hard|To Do|To Do|
|2066|[Account Balance](https://leetcode.com/problems/account-balance/description/) :lock:|Medium|To Do|To Do|
|2067|[Number of Equal Count Substrings](https://leetcode.com/problems/number-of-equal-count-substrings/description/) :lock:|Medium|To Do|To Do|
|2089|[Find Target Indices After Sorting Array](https://leetcode.com/problems/find-target-indices-after-sorting-array/description/) |Easy|To Do|To Do|
|2090|[K Radius Subarray Averages](https://leetcode.com/problems/k-radius-subarray-averages/description/) |Medium|To Do|To Do|
|2091|[Removing Minimum and Maximum From Array](https://leetcode.com/problems/removing-minimum-and-maximum-from-array/description/) |Medium|To Do|To Do|
|2092|[Find All People With Secret](https://leetcode.com/problems/find-all-people-with-secret/description/) |Hard|To Do|To Do|
|2072|[The Winner University](https://leetcode.com/problems/the-winner-university/description/) :lock:|Easy|To Do|To Do|
|2094|[Finding 3-Digit Even Numbers](https://leetcode.com/problems/finding-3-digit-even-numbers/description/) |Easy|To Do|To Do|
|2095|[Delete the Middle Node of a Linked List](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/description/) |Medium|To Do|To Do|
|2096|[Step-By-Step Directions From a Binary Tree Node to Another](https://leetcode.com/problems/step-by-step-directions-from-a-binary-tree-node-to-another/description/) |Medium|To Do|To Do|
|2077|[Paths in Maze That Lead to Same Room](https://leetcode.com/problems/paths-in-maze-that-lead-to-same-room/description/) :lock:|Medium|To Do|To Do|
|2114|[Maximum Number of Words Found in Sentences](https://leetcode.com/problems/maximum-number-of-words-found-in-sentences/description/) |Easy|To Do|To Do|
|2115|[Find All Possible Recipes from Given Supplies](https://leetcode.com/problems/find-all-possible-recipes-from-given-supplies/description/) |Medium|To Do|To Do|
|2116|[Check if a Parentheses String Can Be Valid](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/description/) |Medium|To Do|To Do|
|2117|[Abbreviating the Product of a Range](https://leetcode.com/problems/abbreviating-the-product-of-a-range/description/) |Hard|To Do|To Do|
|2082|[The Number of Rich Customers](https://leetcode.com/problems/the-number-of-rich-customers/description/) :lock:|Easy|To Do|To Do|
|2084|[Drop Type 1 Orders for Customers With Type 0 Orders](https://leetcode.com/problems/drop-type-1-orders-for-customers-with-type-0-orders/description/) :lock:|Medium|To Do|To Do|
|2083|[Substrings That Begin and End With the Same Letter](https://leetcode.com/problems/substrings-that-begin-and-end-with-the-same-letter/description/) :lock:|Medium|To Do|To Do|
|2103|[Rings and Rods](https://leetcode.com/problems/rings-and-rods/description/) |Easy|To Do|To Do|
|2104|[Sum of Subarray Ranges](https://leetcode.com/problems/sum-of-subarray-ranges/description/) |Medium|To Do|To Do|
|2105|[Watering Plants II](https://leetcode.com/problems/watering-plants-ii/description/) |Medium|To Do|To Do|
|2106|[Maximum Fruits Harvested After at Most K Steps](https://leetcode.com/problems/maximum-fruits-harvested-after-at-most-k-steps/description/) |Hard|To Do|To Do|
|2093|[Minimum Cost to Reach City With Discounts](https://leetcode.com/problems/minimum-cost-to-reach-city-with-discounts/description/) :lock:|Medium|To Do|To Do|
|2108|[Find First Palindromic String in the Array](https://leetcode.com/problems/find-first-palindromic-string-in-the-array/description/) |Easy|To Do|To Do|
|2109|[Adding Spaces to a String](https://leetcode.com/problems/adding-spaces-to-a-string/description/) |Medium|To Do|To Do|
|2110|[Number of Smooth Descent Periods of a Stock](https://leetcode.com/problems/number-of-smooth-descent-periods-of-a-stock/description/) |Medium|To Do|To Do|
|2111|[Minimum Operations to Make the Array K-Increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-k-increasing/description/) |Hard|To Do|To Do|
|2129|[Capitalize the Title](https://leetcode.com/problems/capitalize-the-title/description/) |Easy|To Do|To Do|
|2130|[Maximum Twin Sum of a Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/description/) |Medium|To Do|To Do|
|2131|[Longest Palindrome by Concatenating Two Letter Words](https://leetcode.com/problems/longest-palindrome-by-concatenating-two-letter-words/description/) |Medium|To Do|To Do|
|2119|[A Number After a Double Reversal](https://leetcode.com/problems/a-number-after-a-double-reversal/description/) |Easy|To Do|To Do|
|2120|[Execution of All Suffix Instructions Staying in a Grid](https://leetcode.com/problems/execution-of-all-suffix-instructions-staying-in-a-grid/description/) |Medium|To Do|To Do|
|2121|[Intervals Between Identical Elements](https://leetcode.com/problems/intervals-between-identical-elements/description/) |Medium|To Do|To Do|
|2122|[Recover the Original Array](https://leetcode.com/problems/recover-the-original-array/description/) |Hard|To Do|To Do|
|2098|[Subsequence of Size K With the Largest Even Sum](https://leetcode.com/problems/subsequence-of-size-k-with-the-largest-even-sum/description/) :lock:|Medium|To Do|To Do|
|2124|[Check if All A's Appears Before All B's](https://leetcode.com/problems/check-if-all-as-appears-before-all-bs/description/) |Easy|To Do|To Do|
|2125|[Number of Laser Beams in a Bank](https://leetcode.com/problems/number-of-laser-beams-in-a-bank/description/) |Medium|To Do|To Do|
|2126|[Destroying Asteroids](https://leetcode.com/problems/destroying-asteroids/description/) |Medium|To Do|To Do|
|2127|[Maximum Employees to Be Invited to a Meeting](https://leetcode.com/problems/maximum-employees-to-be-invited-to-a-meeting/description/) |Hard|To Do|To Do|
|2107|[Number of Unique Flavors After Sharing K Candies](https://leetcode.com/problems/number-of-unique-flavors-after-sharing-k-candies/description/) :lock:|Medium|To Do|To Do|
|2144|[Minimum Cost of Buying Candies With Discount](https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount/description/) |Easy|To Do|To Do|
|2145|[Count the Hidden Sequences](https://leetcode.com/problems/count-the-hidden-sequences/description/) |Medium|To Do|To Do|
|2146|[K Highest Ranked Items Within a Price Range](https://leetcode.com/problems/k-highest-ranked-items-within-a-price-range/description/) |Medium|To Do|To Do|
|2147|[Number of Ways to Divide a Long Corridor](https://leetcode.com/problems/number-of-ways-to-divide-a-long-corridor/description/) |Hard|To Do|To Do|
|2112|[The Airport With the Most Traffic](https://leetcode.com/problems/the-airport-with-the-most-traffic/description/) :lock:|Medium|To Do|To Do|
|2118|[Build the Equation](https://leetcode.com/problems/build-the-equation/description/) :lock:|Hard|To Do|To Do|
|2133|[Check if Every Row and Column Contains All Numbers](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/description/) |Easy|To Do|To Do|
|2134|[Minimum Swaps to Group All 1's Together II](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/description/) |Medium|To Do|To Do|
|2135|[Count Words Obtained After Adding a Letter](https://leetcode.com/problems/count-words-obtained-after-adding-a-letter/description/) |Medium|To Do|To Do|
|2136|[Earliest Possible Day of Full Bloom](https://leetcode.com/problems/earliest-possible-day-of-full-bloom/description/) |Hard|To Do|To Do|
|2113|[Elements in Array After Removing and Replacing Elements](https://leetcode.com/problems/elements-in-array-after-removing-and-replacing-elements/description/) :lock:|Medium|To Do|To Do|
|2123|[Minimum Operations to Remove Adjacent Ones in Matrix](https://leetcode.com/problems/minimum-operations-to-remove-adjacent-ones-in-matrix/description/) :lock:|Hard|To Do|To Do|
|2138|[Divide a String Into Groups of Size k](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/description/) |Easy|To Do|To Do|
|2155|[All Divisions With the Highest Score of a Binary Array](https://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array/description/) |Medium|To Do|To Do|
|2140|[Solving Questions With Brainpower](https://leetcode.com/problems/solving-questions-with-brainpower/description/) |Medium|To Do|To Do|
|2141|[Maximum Running Time of N Computers](https://leetcode.com/problems/maximum-running-time-of-n-computers/description/) |Hard|To Do|To Do|
|2160|[Minimum Sum of Four Digit Number After Splitting Digits](https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/description/) |Easy|To Do|To Do|
|2161|[Partition Array According to Given Pivot](https://leetcode.com/problems/partition-array-according-to-given-pivot/description/) |Medium|To Do|To Do|
|2162|[Minimum Cost to Set Cooking Time](https://leetcode.com/problems/minimum-cost-to-set-cooking-time/description/) |Medium|To Do|To Do|
|2163|[Minimum Difference in Sums After Removal of Elements](https://leetcode.com/problems/minimum-difference-in-sums-after-removal-of-elements/description/) |Hard|To Do|To Do|
|2128|[Remove All Ones With Row and Column Flips](https://leetcode.com/problems/remove-all-ones-with-row-and-column-flips/description/) :lock:|Medium|To Do|To Do|
|2148|[Count Elements With Strictly Smaller and Greater Elements ](https://leetcode.com/problems/count-elements-with-strictly-smaller-and-greater-elements/description/) |Easy|To Do|To Do|
|2150|[Find All Lonely Numbers in the Array](https://leetcode.com/problems/find-all-lonely-numbers-in-the-array/description/) |Medium|To Do|To Do|
|2149|[Rearrange Array Elements by Sign](https://leetcode.com/problems/rearrange-array-elements-by-sign/description/) |Medium|To Do|To Do|
|2151|[Maximum Good People Based on Statements](https://leetcode.com/problems/maximum-good-people-based-on-statements/description/) |Hard|To Do|To Do|
|2137|[Pour Water Between Buckets to Make Water Levels Equal](https://leetcode.com/problems/pour-water-between-buckets-to-make-water-levels-equal/description/) :lock:|Medium|To Do|To Do|
|2154|[Keep Multiplying Found Values by Two](https://leetcode.com/problems/keep-multiplying-found-values-by-two/description/) |Easy|To Do|To Do|
|2156|[Find Substring With Given Hash Value](https://leetcode.com/problems/find-substring-with-given-hash-value/description/) |Hard|To Do|To Do|
|2157|[Groups of Strings](https://leetcode.com/problems/groups-of-strings/description/) |Hard|To Do|To Do|
|2176|[Count Equal and Divisible Pairs in an Array](https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/description/) |Easy|To Do|To Do|
|2177|[Find Three Consecutive Integers That Sum to a Given Number](https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/description/) |Medium|To Do|To Do|
|2178|[Maximum Split of Positive Even Integers](https://leetcode.com/problems/maximum-split-of-positive-even-integers/description/) |Medium|To Do|To Do|
|2179|[Count Good Triplets in an Array](https://leetcode.com/problems/count-good-triplets-in-an-array/description/) |Hard|To Do|To Do|
|2142|[The Number of Passengers in Each Bus I](https://leetcode.com/problems/the-number-of-passengers-in-each-bus-i/description/) :lock:|Medium|To Do|To Do|
|2143|[Choose Numbers From Two Arrays in Range](https://leetcode.com/problems/choose-numbers-from-two-arrays-in-range/description/) :lock:|Hard|To Do|To Do|
|2164|[Sort Even and Odd Indices Independently](https://leetcode.com/problems/sort-even-and-odd-indices-independently/description/) |Easy|To Do|To Do|
|2165|[Smallest Value of the Rearranged Number](https://leetcode.com/problems/smallest-value-of-the-rearranged-number/description/) |Medium|To Do|To Do|
|2166|[Design Bitset](https://leetcode.com/problems/design-bitset/description/) |Medium|To Do|To Do|
|2167|[Minimum Time to Remove All Cars Containing Illegal Goods](https://leetcode.com/problems/minimum-time-to-remove-all-cars-containing-illegal-goods/description/) |Hard|To Do|To Do|
|2152|[Minimum Number of Lines to Cover Points](https://leetcode.com/problems/minimum-number-of-lines-to-cover-points/description/) :lock:|Medium|To Do|To Do|
|2169|[Count Operations to Obtain Zero](https://leetcode.com/problems/count-operations-to-obtain-zero/description/) |Easy|To Do|To Do|
|2170|[Minimum Operations to Make the Array Alternating](https://leetcode.com/problems/minimum-operations-to-make-the-array-alternating/description/) |Medium|To Do|To Do|
|2171|[Removing Minimum Number of Magic Beans](https://leetcode.com/problems/removing-minimum-number-of-magic-beans/description/) |Medium|To Do|To Do|
|2172|[Maximum AND Sum of Array](https://leetcode.com/problems/maximum-and-sum-of-array/description/) |Hard|To Do|To Do|
|2185|[Counting Words With a Given Prefix](https://leetcode.com/problems/counting-words-with-a-given-prefix/description/) |Easy|To Do|To Do|
|2186|[Minimum Number of Steps to Make Two Strings Anagram II](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/description/) |Medium|To Do|To Do|
|2187|[Minimum Time to Complete Trips](https://leetcode.com/problems/minimum-time-to-complete-trips/description/) |Medium|To Do|To Do|
|2188|[Minimum Time to Finish the Race](https://leetcode.com/problems/minimum-time-to-finish-the-race/description/) |Hard|To Do|To Do|
|2153|[The Number of Passengers in Each Bus II](https://leetcode.com/problems/the-number-of-passengers-in-each-bus-ii/description/) :lock:|Hard|To Do|To Do|
|2158|[Amount of New Area Painted Each Day](https://leetcode.com/problems/amount-of-new-area-painted-each-day/description/) :lock:|Hard|To Do|To Do|
|2180|[Count Integers With Even Digit Sum](https://leetcode.com/problems/count-integers-with-even-digit-sum/description/) |Easy|To Do|To Do|
|2181|[Merge Nodes in Between Zeros](https://leetcode.com/problems/merge-nodes-in-between-zeros/description/) |Medium|To Do|To Do|
|2182|[Construct String With Repeat Limit](https://leetcode.com/problems/construct-string-with-repeat-limit/description/) |Medium|To Do|To Do|
|2183|[Count Array Pairs Divisible by K](https://leetcode.com/problems/count-array-pairs-divisible-by-k/description/) |Hard|To Do|To Do|
|2159|[Order Two Columns Independently](https://leetcode.com/problems/order-two-columns-independently/description/) :lock:|Medium|To Do|To Do|
|2168|[Unique Substrings With Equal Digit Frequency](https://leetcode.com/problems/unique-substrings-with-equal-digit-frequency/description/) :lock:|Medium|To Do|To Do|
|2194|[Cells in a Range on an Excel Sheet](https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet/description/) |Easy|To Do|To Do|
|2195|[Append K Integers With Minimal Sum](https://leetcode.com/problems/append-k-integers-with-minimal-sum/description/) |Medium|To Do|To Do|
|2196|[Create Binary Tree From Descriptions](https://leetcode.com/problems/create-binary-tree-from-descriptions/description/) |Medium|To Do|To Do|
|2197|[Replace Non-Coprime Numbers in Array](https://leetcode.com/problems/replace-non-coprime-numbers-in-array/description/) |Hard|To Do|To Do|
|2206|[Divide Array Into Equal Pairs](https://leetcode.com/problems/divide-array-into-equal-pairs/description/) |Easy|To Do|To Do|
|2207|[Maximize Number of Subsequences in a String](https://leetcode.com/problems/maximize-number-of-subsequences-in-a-string/description/) |Medium|To Do|To Do|
|2208|[Minimum Operations to Halve Array Sum](https://leetcode.com/problems/minimum-operations-to-halve-array-sum/description/) |Medium|To Do|To Do|
|2209|[Minimum White Tiles After Covering With Carpets](https://leetcode.com/problems/minimum-white-tiles-after-covering-with-carpets/description/) |Hard|To Do|To Do|
|2190|[Most Frequent Number Following Key In an Array](https://leetcode.com/problems/most-frequent-number-following-key-in-an-array/description/) |Easy|To Do|To Do|
|2173|[Longest Winning Streak](https://leetcode.com/problems/longest-winning-streak/description/) :lock:|Hard|To Do|To Do|
|2174|[Remove All Ones With Row and Column Flips II](https://leetcode.com/problems/remove-all-ones-with-row-and-column-flips-ii/description/) :lock:|Medium|To Do|To Do|
|2175|[The Change in Global Rankings](https://leetcode.com/problems/the-change-in-global-rankings/description/) :lock:|Medium|To Do|To Do|
|2210|[Count Hills and Valleys in an Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array/description/) |Easy|To Do|To Do|
|2211|[Count Collisions on a Road](https://leetcode.com/problems/count-collisions-on-a-road/description/) |Medium|To Do|To Do|
|2212|[Maximum Points in an Archery Competition](https://leetcode.com/problems/maximum-points-in-an-archery-competition/description/) |Medium|To Do|To Do|
|2213|[Longest Substring of One Repeating Character](https://leetcode.com/problems/longest-substring-of-one-repeating-character/description/) |Hard|To Do|To Do|
|2200|[Find All K-Distant Indices in an Array](https://leetcode.com/problems/find-all-k-distant-indices-in-an-array/description/) |Easy|To Do|To Do|
|2203|[Minimum Weighted Subgraph With the Required Paths](https://leetcode.com/problems/minimum-weighted-subgraph-with-the-required-paths/description/) |Hard|To Do|To Do|
|2184|[Number of Ways to Build Sturdy Brick Wall](https://leetcode.com/problems/number-of-ways-to-build-sturdy-brick-wall/description/) :lock:|Medium|To Do|To Do|
|2220|[Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number/description/) |Easy|To Do|To Do|
|2221|[Find Triangular Sum of an Array](https://leetcode.com/problems/find-triangular-sum-of-an-array/description/) |Medium|To Do|To Do|
|2222|[Number of Ways to Select Buildings](https://leetcode.com/problems/number-of-ways-to-select-buildings/description/) |Medium|To Do|To Do|
|2223|[Sum of Scores of Built Strings](https://leetcode.com/problems/sum-of-scores-of-built-strings/description/) |Hard|To Do|To Do|
|2231|[Largest Number After Digit Swaps by Parity](https://leetcode.com/problems/largest-number-after-digit-swaps-by-parity/description/) |Easy|To Do|To Do|
|2232|[Minimize Result by Adding Parentheses to Expression](https://leetcode.com/problems/minimize-result-by-adding-parentheses-to-expression/description/) |Medium|To Do|To Do|
|2233|[Maximum Product After K Increments](https://leetcode.com/problems/maximum-product-after-k-increments/description/) |Medium|To Do|To Do|
|2234|[Maximum Total Beauty of the Gardens](https://leetcode.com/problems/maximum-total-beauty-of-the-gardens/description/) |Hard|To Do|To Do|
|2248|[Intersection of Multiple Arrays](https://leetcode.com/problems/intersection-of-multiple-arrays/description/) |Easy|To Do|To Do|
|2249|[Count Lattice Points Inside a Circle](https://leetcode.com/problems/count-lattice-points-inside-a-circle/description/) |Medium|To Do|To Do|
|2250|[Count Number of Rectangles Containing Each Point](https://leetcode.com/problems/count-number-of-rectangles-containing-each-point/description/) |Medium|To Do|To Do|
|2251|[Number of Flowers in Full Bloom](https://leetcode.com/problems/number-of-flowers-in-full-bloom/description/) |Hard|To Do|To Do|
|2199|[Finding the Topic of Each Post](https://leetcode.com/problems/finding-the-topic-of-each-post/description/) :lock:|Hard|To Do|To Do|
|2205|[The Number of Users That Are Eligible for Discount](https://leetcode.com/problems/the-number-of-users-that-are-eligible-for-discount/description/) :lock:|Easy|To Do|To Do|
|2259|[Remove Digit From Number to Maximize Result](https://leetcode.com/problems/remove-digit-from-number-to-maximize-result/description/) |Easy|To Do|To Do|
|2260|[Minimum Consecutive Cards to Pick Up](https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/description/) |Medium|To Do|To Do|
|2261|[K Divisible Elements Subarrays](https://leetcode.com/problems/k-divisible-elements-subarrays/description/) |Medium|To Do|To Do|
|2262|[Total Appeal of A String](https://leetcode.com/problems/total-appeal-of-a-string/description/) |Hard|To Do|To Do|
|2255|[Count Prefixes of a Given String](https://leetcode.com/problems/count-prefixes-of-a-given-string/description/) |Easy|To Do|To Do|
|2256|[Minimum Average Difference](https://leetcode.com/problems/minimum-average-difference/description/) |Medium|To Do|To Do|
|2257|[Count Unguarded Cells in the Grid](https://leetcode.com/problems/count-unguarded-cells-in-the-grid/description/) |Medium|To Do|To Do|
|2258|[Escape the Spreading Fire](https://leetcode.com/problems/escape-the-spreading-fire/description/) |Hard|To Do|To Do|
|2224|[Minimum Number of Operations to Convert Time](https://leetcode.com/problems/minimum-number-of-operations-to-convert-time/description/) |Easy|To Do|To Do|
|2264|[Largest 3-Same-Digit Number in String](https://leetcode.com/problems/largest-3-same-digit-number-in-string/description/) |Easy|To Do|To Do|
|2265|[Count Nodes Equal to Average of Subtree](https://leetcode.com/problems/count-nodes-equal-to-average-of-subtree/description/) |Medium|To Do|To Do|
|2266|[Count Number of Texts](https://leetcode.com/problems/count-number-of-texts/description/) |Medium|To Do|To Do|
|2267|[ Check if There Is a Valid Parentheses String Path](https://leetcode.com/problems/check-if-there-is-a-valid-parentheses-string-path/description/) |Hard|To Do|To Do|
|2239|[Find Closest Number to Zero](https://leetcode.com/problems/find-closest-number-to-zero/description/) |Easy|To Do|To Do|
|2240|[Number of Ways to Buy Pens and Pencils](https://leetcode.com/problems/number-of-ways-to-buy-pens-and-pencils/description/) |Medium|To Do|To Do|
|2241|[Design an ATM Machine](https://leetcode.com/problems/design-an-atm-machine/description/) |Medium|To Do|To Do|
|2242|[Maximum Score of a Node Sequence](https://leetcode.com/problems/maximum-score-of-a-node-sequence/description/) |Hard|To Do|To Do|
|2214|[Minimum Health to Beat Game](https://leetcode.com/problems/minimum-health-to-beat-game/description/) :lock:|Medium|To Do|To Do|
|2274|[Maximum Consecutive Floors Without Special Floors](https://leetcode.com/problems/maximum-consecutive-floors-without-special-floors/description/) |Medium|To Do|To Do|
|2275|[Largest Combination With Bitwise AND Greater Than Zero](https://leetcode.com/problems/largest-combination-with-bitwise-and-greater-than-zero/description/) |Medium|To Do|To Do|
|2276|[Count Integers in Intervals](https://leetcode.com/problems/count-integers-in-intervals/description/) |Hard|To Do|To Do|
|2270|[Number of Ways to Split Array](https://leetcode.com/problems/number-of-ways-to-split-array/description/) |Medium|To Do|To Do|
|2271|[Maximum White Tiles Covered by a Carpet](https://leetcode.com/problems/maximum-white-tiles-covered-by-a-carpet/description/) |Medium|To Do|To Do|
|2272|[Substring With Largest Variance](https://leetcode.com/problems/substring-with-largest-variance/description/) |Hard|To Do|To Do|
|2243|[Calculate Digit Sum of a String](https://leetcode.com/problems/calculate-digit-sum-of-a-string/description/) |Easy|To Do|To Do|
|2244|[Minimum Rounds to Complete All Tasks](https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/description/) |Medium|To Do|To Do|
|2245|[Maximum Trailing Zeros in a Cornered Path](https://leetcode.com/problems/maximum-trailing-zeros-in-a-cornered-path/description/) |Medium|To Do|To Do|
|2246|[Longest Path With Different Adjacent Characters](https://leetcode.com/problems/longest-path-with-different-adjacent-characters/description/) |Hard|To Do|To Do|
|2278|[Percentage of Letter in String](https://leetcode.com/problems/percentage-of-letter-in-string/description/) |Easy|To Do|To Do|
|2279|[Maximum Bags With Full Capacity of Rocks](https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks/description/) |Medium|To Do|To Do|
|2280|[Minimum Lines to Represent a Line Chart](https://leetcode.com/problems/minimum-lines-to-represent-a-line-chart/description/) |Medium|To Do|To Do|
|2281|[Sum of Total Strength of Wizards](https://leetcode.com/problems/sum-of-total-strength-of-wizards/description/) |Hard|To Do|To Do|
|2219|[Maximum Sum Score of Array](https://leetcode.com/problems/maximum-sum-score-of-array/description/) :lock:|Medium|To Do|To Do|
|2228|[Users With Two Purchases Within Seven Days](https://leetcode.com/problems/users-with-two-purchases-within-seven-days/description/) :lock:|Medium|To Do|To Do|
|2230|[The Users That Are Eligible for Discount](https://leetcode.com/problems/the-users-that-are-eligible-for-discount/description/) :lock:|Easy|To Do|To Do|
|2287|[Rearrange Characters to Make Target String](https://leetcode.com/problems/rearrange-characters-to-make-target-string/description/) |Easy|To Do|To Do|
|2288|[Apply Discount to Prices](https://leetcode.com/problems/apply-discount-to-prices/description/) |Medium|To Do|To Do|
|2289|[Steps to Make Array Non-decreasing](https://leetcode.com/problems/steps-to-make-array-non-decreasing/description/) |Medium|To Do|To Do|
|2290|[Minimum Obstacle Removal to Reach Corner](https://leetcode.com/problems/minimum-obstacle-removal-to-reach-corner/description/) |Hard|To Do|To Do|
|2238|[Number of Times a Driver Was a Passenger](https://leetcode.com/problems/number-of-times-a-driver-was-a-passenger/description/) :lock:|Medium|To Do|To Do|
|2283|[Check if Number Has Equal Digit Count and Digit Value](https://leetcode.com/problems/check-if-number-has-equal-digit-count-and-digit-value/description/) |Easy|To Do|To Do|
|2284|[Sender With Largest Word Count](https://leetcode.com/problems/sender-with-largest-word-count/description/) |Medium|To Do|To Do|
|2285|[Maximum Total Importance of Roads](https://leetcode.com/problems/maximum-total-importance-of-roads/description/) |Medium|To Do|To Do|
|2286|[Booking Concert Tickets in Groups](https://leetcode.com/problems/booking-concert-tickets-in-groups/description/) |Hard|To Do|To Do|
|2252|[Dynamic Pivoting of a Table](https://leetcode.com/problems/dynamic-pivoting-of-a-table/description/) :lock:|Hard|To Do|To Do|
|2253|[Dynamic Unpivoting of a Table](https://leetcode.com/problems/dynamic-unpivoting-of-a-table/description/) :lock:|Hard|To Do|To Do|
|2235|[Add Two Integers](https://leetcode.com/problems/add-two-integers/description/) |Easy|To Do|To Do|
|2236|[Root Equals Sum of Children](https://leetcode.com/problems/root-equals-sum-of-children/description/) |Easy|To Do|To Do|
|2237|[Count Positions on Street With Required Brightness](https://leetcode.com/problems/count-positions-on-street-with-required-brightness/description/) :lock:|Medium|To Do|To Do|
|2293|[Min Max Game](https://leetcode.com/problems/min-max-game/description/) |Easy|To Do|To Do|
|2294|[Partition Array Such That Maximum Difference Is K](https://leetcode.com/problems/partition-array-such-that-maximum-difference-is-k/description/) |Medium|To Do|To Do|
|2295|[Replace Elements in an Array](https://leetcode.com/problems/replace-elements-in-an-array/description/) |Medium|To Do|To Do|
|2296|[Design a Text Editor](https://leetcode.com/problems/design-a-text-editor/description/) |Hard|To Do|To Do|
|2306|[Naming a Company](https://leetcode.com/problems/naming-a-company/description/) |Hard|To Do|To Do|
|2299|[Strong Password Checker II](https://leetcode.com/problems/strong-password-checker-ii/description/) |Easy|To Do|To Do|
|2300|[Successful Pairs of Spells and Potions](https://leetcode.com/problems/successful-pairs-of-spells-and-potions/description/) |Medium|To Do|To Do|
|2301|[Match Substring After Replacement](https://leetcode.com/problems/match-substring-after-replacement/description/) |Hard|To Do|To Do|
|2302|[Count Subarrays With Score Less Than K](https://leetcode.com/problems/count-subarrays-with-score-less-than-k/description/) |Hard|To Do|To Do|
|2311|[Longest Binary Subsequence Less Than or Equal to K](https://leetcode.com/problems/longest-binary-subsequence-less-than-or-equal-to-k/description/) |Medium|To Do|To Do|
|2254|[Design Video Sharing Platform](https://leetcode.com/problems/design-video-sharing-platform/description/) :lock:|Hard|To Do|To Do|
|2320|[Count Number of Ways to Place Houses](https://leetcode.com/problems/count-number-of-ways-to-place-houses/description/) |Medium|To Do|To Do|
|2319|[Check if Matrix Is X-Matrix](https://leetcode.com/problems/check-if-matrix-is-x-matrix/description/) |Easy|To Do|To Do|
|2313|[Minimum Flips in Binary Tree to Get Result](https://leetcode.com/problems/minimum-flips-in-binary-tree-to-get-result/description/) :lock:|Hard|To Do|To Do|
|2322|[Minimum Score After Removals on a Tree](https://leetcode.com/problems/minimum-score-after-removals-on-a-tree/description/) |Hard|To Do|To Do|
|2315|[Count Asterisks](https://leetcode.com/problems/count-asterisks/description/) |Easy|To Do|To Do|
|2317|[Maximum XOR After Operations ](https://leetcode.com/problems/maximum-xor-after-operations/description/) |Medium|To Do|To Do|
|2316|[Count Unreachable Pairs of Nodes in an Undirected Graph](https://leetcode.com/problems/count-unreachable-pairs-of-nodes-in-an-undirected-graph/description/) |Medium|To Do|To Do|
|2318|[Number of Distinct Roll Sequences](https://leetcode.com/problems/number-of-distinct-roll-sequences/description/) |Hard|To Do|To Do|
|2268|[Minimum Number of Keypresses](https://leetcode.com/problems/minimum-number-of-keypresses/description/) :lock:|Medium|To Do|To Do|
|2325|[Decode the Message](https://leetcode.com/problems/decode-the-message/description/) |Easy|To Do|To Do|
|2327|[Number of People Aware of a Secret](https://leetcode.com/problems/number-of-people-aware-of-a-secret/description/) |Medium|To Do|To Do|
|2328|[Number of Increasing Paths in a Grid](https://leetcode.com/problems/number-of-increasing-paths-in-a-grid/description/) |Hard|To Do|To Do|
|2326|[Spiral Matrix IV](https://leetcode.com/problems/spiral-matrix-iv/description/) |Medium|To Do|To Do|
|2335|[Minimum Amount of Time to Fill Cups](https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups/description/) |Easy|To Do|To Do|
|2336|[Smallest Number in Infinite Set](https://leetcode.com/problems/smallest-number-in-infinite-set/description/) |Medium|To Do|To Do|
|2337|[Move Pieces to Obtain a String](https://leetcode.com/problems/move-pieces-to-obtain-a-string/description/) |Medium|To Do|To Do|
|2338|[Count the Number of Ideal Arrays](https://leetcode.com/problems/count-the-number-of-ideal-arrays/description/) |Hard|To Do|To Do|
|2331|[Evaluate Boolean Binary Tree](https://leetcode.com/problems/evaluate-boolean-binary-tree/description/) |Easy|To Do|To Do|
|2332|[The Latest Time to Catch a Bus](https://leetcode.com/problems/the-latest-time-to-catch-a-bus/description/) |Medium|To Do|To Do|
|2333|[Minimum Sum of Squared Difference](https://leetcode.com/problems/minimum-sum-of-squared-difference/description/) |Medium|To Do|To Do|
|2334|[Subarray With Elements Greater Than Varying Threshold](https://leetcode.com/problems/subarray-with-elements-greater-than-varying-threshold/description/) |Hard|To Do|To Do|
|2277|[Closest Node to Path in Tree](https://leetcode.com/problems/closest-node-to-path-in-tree/description/) :lock:|Hard|To Do|To Do|
|2341|[Maximum Number of Pairs in Array](https://leetcode.com/problems/maximum-number-of-pairs-in-array/description/) |Easy|To Do|To Do|
|2343|[Query Kth Smallest Trimmed Number](https://leetcode.com/problems/query-kth-smallest-trimmed-number/description/) |Medium|To Do|To Do|
|2344|[Minimum Deletions to Make Array Divisible](https://leetcode.com/problems/minimum-deletions-to-make-array-divisible/description/) |Hard|To Do|To Do|
|2282|[Number of People That Can Be Seen in a Grid](https://leetcode.com/problems/number-of-people-that-can-be-seen-in-a-grid/description/) :lock:|Medium|To Do|To Do|
|2291|[Maximum Profit From Trading Stocks](https://leetcode.com/problems/maximum-profit-from-trading-stocks/description/) :lock:|Medium|To Do|To Do|
|2351|[First Letter to Appear Twice](https://leetcode.com/problems/first-letter-to-appear-twice/description/) |Easy|To Do|To Do|
|2352|[Equal Row and Column Pairs](https://leetcode.com/problems/equal-row-and-column-pairs/description/) |Medium|To Do|To Do|
|2353|[Design a Food Rating System](https://leetcode.com/problems/design-a-food-rating-system/description/) |Medium|To Do|To Do|
|2354|[Number of Excellent Pairs](https://leetcode.com/problems/number-of-excellent-pairs/description/) |Hard|To Do|To Do|
|2292|[Products With Three or More Orders in Two Consecutive Years](https://leetcode.com/problems/products-with-three-or-more-orders-in-two-consecutive-years/description/) :lock:|Medium|To Do|To Do|
|2348|[Number of Zero-Filled Subarrays](https://leetcode.com/problems/number-of-zero-filled-subarrays/description/) |Medium|To Do|To Do|
|2347|[Best Poker Hand](https://leetcode.com/problems/best-poker-hand/description/) |Easy|To Do|To Do|
|2349|[Design a Number Container System](https://leetcode.com/problems/design-a-number-container-system/description/) |Medium|To Do|To Do|
|2350|[Shortest Impossible Sequence of Rolls](https://leetcode.com/problems/shortest-impossible-sequence-of-rolls/description/) |Hard|To Do|To Do|
|2357|[Make Array Zero by Subtracting Equal Amounts](https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts/description/) |Easy|To Do|To Do|
|2358|[Maximum Number of Groups Entering a Competition](https://leetcode.com/problems/maximum-number-of-groups-entering-a-competition/description/) |Medium|To Do|To Do|
|2359|[Find Closest Node to Given Two Nodes](https://leetcode.com/problems/find-closest-node-to-given-two-nodes/description/) |Medium|To Do|To Do|
|2360|[Longest Cycle in a Graph](https://leetcode.com/problems/longest-cycle-in-a-graph/description/) |Hard|To Do|To Do|
|2298|[Tasks Count in the Weekend](https://leetcode.com/problems/tasks-count-in-the-weekend/description/) :lock:|Medium|To Do|To Do|
|2308|[Arrange Table by Gender](https://leetcode.com/problems/arrange-table-by-gender/description/) :lock:|Medium|To Do|To Do|
|2367|[Number of Arithmetic Triplets](https://leetcode.com/problems/number-of-arithmetic-triplets/description/) |Easy|To Do|To Do|
|2369|[Check if There is a Valid Partition For The Array](https://leetcode.com/problems/check-if-there-is-a-valid-partition-for-the-array/description/) |Medium|To Do|To Do|
|2370|[Longest Ideal Subsequence](https://leetcode.com/problems/longest-ideal-subsequence/description/) |Medium|To Do|To Do|
|2368|[Reachable Nodes With Restrictions](https://leetcode.com/problems/reachable-nodes-with-restrictions/description/) |Medium|To Do|To Do|
|2314|[The First Day of the Maximum Recorded Degree in Each City](https://leetcode.com/problems/the-first-day-of-the-maximum-recorded-degree-in-each-city/description/) :lock:|Medium|To Do|To Do|
|2363|[Merge Similar Items](https://leetcode.com/problems/merge-similar-items/description/) |Easy|To Do|To Do|
|2364|[Count Number of Bad Pairs](https://leetcode.com/problems/count-number-of-bad-pairs/description/) |Medium|To Do|To Do|
|2398|[Maximum Number of Robots Within Budget](https://leetcode.com/problems/maximum-number-of-robots-within-budget/description/) |Hard|To Do|To Do|
|2366|[Minimum Replacements to Sort the Array](https://leetcode.com/problems/minimum-replacements-to-sort-the-array/description/) |Hard|To Do|To Do|
|2324|[Product Sales Analysis IV](https://leetcode.com/problems/product-sales-analysis-iv/description/) :lock:|Medium|To Do|To Do|
|2329|[Product Sales Analysis V](https://leetcode.com/problems/product-sales-analysis-v/description/) :lock:|Easy|To Do|To Do|
|2339|[All the Matches of the League](https://leetcode.com/problems/all-the-matches-of-the-league/description/) :lock:|Easy|To Do|To Do|
|2373|[Largest Local Values in a Matrix](https://leetcode.com/problems/largest-local-values-in-a-matrix/description/) |Easy|To Do|To Do|
|2374|[Node With Highest Edge Score](https://leetcode.com/problems/node-with-highest-edge-score/description/) |Medium|To Do|To Do|
|2375|[Construct Smallest Number From DI String](https://leetcode.com/problems/construct-smallest-number-from-di-string/description/) |Medium|To Do|To Do|
|2376|[Count Special Integers](https://leetcode.com/problems/count-special-integers/description/) |Hard|To Do|To Do|
|2323|[Find Minimum Time to Finish All Jobs II](https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs-ii/description/) :lock:|Medium|To Do|To Do|
|2383|[Minimum Hours of Training to Win a Competition](https://leetcode.com/problems/minimum-hours-of-training-to-win-a-competition/description/) |Easy|To Do|To Do|
|2385|[Amount of Time for Binary Tree to Be Infected](https://leetcode.com/problems/amount-of-time-for-binary-tree-to-be-infected/description/) |Medium|To Do|To Do|
|2386|[Find the K-Sum of an Array](https://leetcode.com/problems/find-the-k-sum-of-an-array/description/) |Hard|To Do|To Do|
|2379|[Minimum Recolors to Get K Consecutive Black Blocks](https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks/description/) |Easy|To Do|To Do|
|2380|[Time Needed to Rearrange a Binary String](https://leetcode.com/problems/time-needed-to-rearrange-a-binary-string/description/) |Medium|To Do|To Do|
|2381|[Shifting Letters II](https://leetcode.com/problems/shifting-letters-ii/description/) |Medium|To Do|To Do|
|2382|[Maximum Segment Sum After Removals](https://leetcode.com/problems/maximum-segment-sum-after-removals/description/) |Hard|To Do|To Do|
|2330|[Valid Palindrome IV](https://leetcode.com/problems/valid-palindrome-iv/description/) :lock:|Medium|To Do|To Do|
|2389|[Longest Subsequence With Limited Sum](https://leetcode.com/problems/longest-subsequence-with-limited-sum/description/) |Easy|To Do|To Do|
|2390|[Removing Stars From a String](https://leetcode.com/problems/removing-stars-from-a-string/description/) |Medium|To Do|To Do|
|2391|[Minimum Amount of Time to Collect Garbage](https://leetcode.com/problems/minimum-amount-of-time-to-collect-garbage/description/) |Medium|To Do|To Do|
|2392|[Build a Matrix With Conditions](https://leetcode.com/problems/build-a-matrix-with-conditions/description/) |Hard|To Do|To Do|
|2342|[Max Sum of a Pair With Equal Sum of Digits](https://leetcode.com/problems/max-sum-of-a-pair-with-equal-sum-of-digits/description/) |Medium|To Do|To Do|
|2340|[Minimum Adjacent Swaps to Make a Valid Array](https://leetcode.com/problems/minimum-adjacent-swaps-to-make-a-valid-array/description/) :lock:|Medium|To Do|To Do|
|2384|[Largest Palindromic Number](https://leetcode.com/problems/largest-palindromic-number/description/) |Medium|To Do|To Do|
|2399|[Check Distances Between Same Letters](https://leetcode.com/problems/check-distances-between-same-letters/description/) |Easy|To Do|To Do|
|2400|[Number of Ways to Reach a Position After Exactly k Steps](https://leetcode.com/problems/number-of-ways-to-reach-a-position-after-exactly-k-steps/description/) |Medium|To Do|To Do|
|2401|[Longest Nice Subarray](https://leetcode.com/problems/longest-nice-subarray/description/) |Medium|To Do|To Do|
|2402|[Meeting Rooms III](https://leetcode.com/problems/meeting-rooms-iii/description/) |Hard|To Do|To Do|
|2395|[Find Subarrays With Equal Sum](https://leetcode.com/problems/find-subarrays-with-equal-sum/description/) |Easy|To Do|To Do|
|2396|[Strictly Palindromic Number](https://leetcode.com/problems/strictly-palindromic-number/description/) |Medium|To Do|To Do|
|2397|[Maximum Rows Covered by Columns](https://leetcode.com/problems/maximum-rows-covered-by-columns/description/) |Medium|To Do|To Do|
|2365|[Task Scheduler II](https://leetcode.com/problems/task-scheduler-ii/description/) |Medium|To Do|To Do|
|2346|[Compute the Rank as a Percentage](https://leetcode.com/problems/compute-the-rank-as-a-percentage/description/) :lock:|Medium|To Do|To Do|
|2345|[Finding the Number of Visible Mountains](https://leetcode.com/problems/finding-the-number-of-visible-mountains/description/) :lock:|Medium|To Do|To Do|
|2404|[Most Frequent Even Element](https://leetcode.com/problems/most-frequent-even-element/description/) |Easy|To Do|To Do|
|2405|[Optimal Partition of String](https://leetcode.com/problems/optimal-partition-of-string/description/) |Medium|To Do|To Do|
|2406|[Divide Intervals Into Minimum Number of Groups](https://leetcode.com/problems/divide-intervals-into-minimum-number-of-groups/description/) |Medium|To Do|To Do|
|2459|[Sort Array by Moving Items to Empty Space](https://leetcode.com/problems/sort-array-by-moving-items-to-empty-space/description/) :lock:|Hard|To Do|To Do|
|2355|[Maximum Number of Books You Can Take](https://leetcode.com/problems/maximum-number-of-books-you-can-take/description/) :lock:|Hard|To Do|To Do|
|2413|[Smallest Even Multiple](https://leetcode.com/problems/smallest-even-multiple/description/) |Easy|To Do|To Do|
|2414|[Length of the Longest Alphabetical Continuous Substring](https://leetcode.com/problems/length-of-the-longest-alphabetical-continuous-substring/description/) |Medium|To Do|To Do|
|2415|[Reverse Odd Levels of Binary Tree](https://leetcode.com/problems/reverse-odd-levels-of-binary-tree/description/) |Medium|To Do|To Do|
|2416|[Sum of Prefix Scores of Strings](https://leetcode.com/problems/sum-of-prefix-scores-of-strings/description/) |Hard|To Do|To Do|
|2356|[Number of Unique Subjects Taught by Each Teacher](https://leetcode.com/problems/number-of-unique-subjects-taught-by-each-teacher/description/) |Easy|To Do|To Do|
|2409|[Count Days Spent Together](https://leetcode.com/problems/count-days-spent-together/description/) |Easy|To Do|To Do|
|2410|[Maximum Matching of Players With Trainers](https://leetcode.com/problems/maximum-matching-of-players-with-trainers/description/) |Medium|To Do|To Do|
|2411|[Smallest Subarrays With Maximum Bitwise OR](https://leetcode.com/problems/smallest-subarrays-with-maximum-bitwise-or/description/) |Medium|To Do|To Do|
|2412|[Minimum Money Required Before Transactions](https://leetcode.com/problems/minimum-money-required-before-transactions/description/) |Hard|To Do|To Do|
|2361|[Minimum Costs Using the Train Line](https://leetcode.com/problems/minimum-costs-using-the-train-line/description/) :lock:|Hard|To Do|To Do|
|2362|[Generate the Invoice](https://leetcode.com/problems/generate-the-invoice/description/) :lock:|Hard|To Do|To Do|
|2418|[Sort the People](https://leetcode.com/problems/sort-the-people/description/) |Easy|To Do|To Do|
|2419|[Longest Subarray With Maximum Bitwise AND](https://leetcode.com/problems/longest-subarray-with-maximum-bitwise-and/description/) |Medium|To Do|To Do|
|2420|[Find All Good Indices](https://leetcode.com/problems/find-all-good-indices/description/) |Medium|To Do|To Do|
|2421|[Number of Good Paths](https://leetcode.com/problems/number-of-good-paths/description/) |Hard|To Do|To Do|
|2371|[Minimize Maximum Value in a Grid](https://leetcode.com/problems/minimize-maximum-value-in-a-grid/description/) :lock:|Hard|To Do|To Do|
|2427|[Number of Common Factors](https://leetcode.com/problems/number-of-common-factors/description/) |Easy|To Do|To Do|
|2428|[Maximum Sum of an Hourglass](https://leetcode.com/problems/maximum-sum-of-an-hourglass/description/) |Medium|To Do|To Do|
|2429|[Minimize XOR](https://leetcode.com/problems/minimize-xor/description/) |Medium|To Do|To Do|
|2430|[Maximum Deletions on a String](https://leetcode.com/problems/maximum-deletions-on-a-string/description/) |Hard|To Do|To Do|
|2522|[Partition String Into Substrings With Values at Most K](https://leetcode.com/problems/partition-string-into-substrings-with-values-at-most-k/description/) |Medium|To Do|To Do|
|2424|[Longest Uploaded Prefix](https://leetcode.com/problems/longest-uploaded-prefix/description/) |Medium|To Do|To Do|
|2426|[Number of Pairs Satisfying Inequality](https://leetcode.com/problems/number-of-pairs-satisfying-inequality/description/) |Hard|To Do|To Do|
|2372|[Calculate the Influence of Each Salesperson](https://leetcode.com/problems/calculate-the-influence-of-each-salesperson/description/) :lock:|Medium|To Do|To Do|
|2377|[Sort the Olympic Table](https://leetcode.com/problems/sort-the-olympic-table/description/) :lock:|Easy|To Do|To Do|
|2378|[Choose Edges to Maximize Score in a Tree](https://leetcode.com/problems/choose-edges-to-maximize-score-in-a-tree/description/) :lock:|Medium|To Do|To Do|
|2432|[The Employee That Worked on the Longest Task](https://leetcode.com/problems/the-employee-that-worked-on-the-longest-task/description/) |Easy|To Do|To Do|
|2433|[Find The Original Array of Prefix Xor](https://leetcode.com/problems/find-the-original-array-of-prefix-xor/description/) |Medium|To Do|To Do|
|2434|[Using a Robot to Print the Lexicographically Smallest String](https://leetcode.com/problems/using-a-robot-to-print-the-lexicographically-smallest-string/description/) |Medium|To Do|To Do|
|2435|[Paths in Matrix Whose Sum Is Divisible by K](https://leetcode.com/problems/paths-in-matrix-whose-sum-is-divisible-by-k/description/) |Hard|To Do|To Do|
|2387|[Median of a Row Wise Sorted Matrix](https://leetcode.com/problems/median-of-a-row-wise-sorted-matrix/description/) :lock:|Medium|To Do|To Do|
|2388|[Change Null Values in a Table to the Previous Value](https://leetcode.com/problems/change-null-values-in-a-table-to-the-previous-value/description/) :lock:|Medium|To Do|To Do|
|2441|[Largest Positive Integer That Exists With Its Negative](https://leetcode.com/problems/largest-positive-integer-that-exists-with-its-negative/description/) |Easy|To Do|To Do|
|2442|[Count Number of Distinct Integers After Reverse Operations](https://leetcode.com/problems/count-number-of-distinct-integers-after-reverse-operations/description/) |Medium|To Do|To Do|
|2407|[Longest Increasing Subsequence II](https://leetcode.com/problems/longest-increasing-subsequence-ii/description/) |Hard|To Do|To Do|
|2444|[Count Subarrays With Fixed Bounds](https://leetcode.com/problems/count-subarrays-with-fixed-bounds/description/) |Hard|To Do|To Do|
|2437|[Number of Valid Clock Times](https://leetcode.com/problems/number-of-valid-clock-times/description/) |Easy|To Do|To Do|
|2438|[Range Product Queries of Powers](https://leetcode.com/problems/range-product-queries-of-powers/description/) |Medium|To Do|To Do|
|2439|[Minimize Maximum of Array](https://leetcode.com/problems/minimize-maximum-of-array/description/) |Medium|To Do|To Do|
|2440|[Create Components With Same Value](https://leetcode.com/problems/create-components-with-same-value/description/) |Hard|To Do|To Do|
|2423|[Remove Letter To Equalize Frequency](https://leetcode.com/problems/remove-letter-to-equalize-frequency/description/) |Easy|To Do|To Do|
|2425|[Bitwise XOR of All Pairings](https://leetcode.com/problems/bitwise-xor-of-all-pairings/description/) |Medium|To Do|To Do|
|2394|[Employees With Deductions](https://leetcode.com/problems/employees-with-deductions/description/) :lock:|Medium|To Do|To Do|
|2393|[Count Strictly Increasing Subarrays](https://leetcode.com/problems/count-strictly-increasing-subarrays/description/) :lock:|Medium|To Do|To Do|
|2446|[Determine if Two Events Have Conflict](https://leetcode.com/problems/determine-if-two-events-have-conflict/description/) |Easy|To Do|To Do|
|2403|[Minimum Time to Kill All Monsters](https://leetcode.com/problems/minimum-time-to-kill-all-monsters/description/) :lock:|Hard|To Do|To Do|
|2448|[Minimum Cost to Make Array Equal](https://leetcode.com/problems/minimum-cost-to-make-array-equal/description/) |Hard|To Do|To Do|
|2449|[Minimum Number of Operations to Make Arrays Similar](https://leetcode.com/problems/minimum-number-of-operations-to-make-arrays-similar/description/) |Hard|To Do|To Do|
|2647|[Color the Triangle Red](https://leetcode.com/problems/color-the-triangle-red/description/) :lock:|Hard|To Do|To Do|
|2443|[Sum of Number and Its Reverse](https://leetcode.com/problems/sum-of-number-and-its-reverse/description/) |Medium|To Do|To Do|
|2455|[Average Value of Even Numbers That Are Divisible by Three](https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three/description/) |Easy|To Do|To Do|
|2456|[Most Popular Video Creator](https://leetcode.com/problems/most-popular-video-creator/description/) |Medium|To Do|To Do|
|2457|[Minimum Addition to Make Integer Beautiful](https://leetcode.com/problems/minimum-addition-to-make-integer-beautiful/description/) |Medium|To Do|To Do|
|2458|[Height of Binary Tree After Subtree Removal Queries](https://leetcode.com/problems/height-of-binary-tree-after-subtree-removal-queries/description/) |Hard|To Do|To Do|
|2447|[Number of Subarrays With GCD Equal to K](https://leetcode.com/problems/number-of-subarrays-with-gcd-equal-to-k/description/) |Medium|To Do|To Do|
|2451|[Odd String Difference](https://leetcode.com/problems/odd-string-difference/description/) |Easy|To Do|To Do|
|2453|[Destroy Sequential Targets](https://leetcode.com/problems/destroy-sequential-targets/description/) |Medium|To Do|To Do|
|2454|[Next Greater Element IV](https://leetcode.com/problems/next-greater-element-iv/description/) |Hard|To Do|To Do|
|2452|[Words Within Two Edits of Dictionary](https://leetcode.com/problems/words-within-two-edits-of-dictionary/description/) |Medium|To Do|To Do|
|2460|[Apply Operations to an Array](https://leetcode.com/problems/apply-operations-to-an-array/description/) |Easy|To Do|To Do|
|2461|[Maximum Sum of Distinct Subarrays With Length K](https://leetcode.com/problems/maximum-sum-of-distinct-subarrays-with-length-k/description/) |Medium|To Do|To Do|
|2462|[Total Cost to Hire K Workers](https://leetcode.com/problems/total-cost-to-hire-k-workers/description/) |Medium|To Do|To Do|
|2463|[Minimum Total Distance Traveled](https://leetcode.com/problems/minimum-total-distance-traveled/description/) |Hard|To Do|To Do|
|2408|[Design SQL](https://leetcode.com/problems/design-sql/description/) :lock:|Medium|To Do|To Do|
|2469|[Convert the Temperature](https://leetcode.com/problems/convert-the-temperature/description/) |Easy|To Do|To Do|
|2470|[Number of Subarrays With LCM Equal to K](https://leetcode.com/problems/number-of-subarrays-with-lcm-equal-to-k/description/) |Medium|To Do|To Do|
|2471|[Minimum Number of Operations to Sort a Binary Tree by Level](https://leetcode.com/problems/minimum-number-of-operations-to-sort-a-binary-tree-by-level/description/) |Medium|To Do|To Do|
|2472|[Maximum Number of Non-overlapping Palindrome Substrings](https://leetcode.com/problems/maximum-number-of-non-overlapping-palindrome-substrings/description/) |Hard|To Do|To Do|
|2417|[Closest Fair Integer](https://leetcode.com/problems/closest-fair-integer/description/) :lock:|Medium|To Do|To Do|
|2465|[Number of Distinct Averages](https://leetcode.com/problems/number-of-distinct-averages/description/) |Easy|To Do|To Do|
|2466|[Count Ways To Build Good Strings](https://leetcode.com/problems/count-ways-to-build-good-strings/description/) |Medium|To Do|To Do|
|2468|[Split Message Based on Limit](https://leetcode.com/problems/split-message-based-on-limit/description/) |Hard|To Do|To Do|
|2467|[Most Profitable Path in a Tree](https://leetcode.com/problems/most-profitable-path-in-a-tree/description/) |Medium|To Do|To Do|
|2422|[Merge Operations to Turn Array Into a Palindrome](https://leetcode.com/problems/merge-operations-to-turn-array-into-a-palindrome/description/) :lock:|Medium|To Do|To Do|
|2475|[Number of Unequal Triplets in Array](https://leetcode.com/problems/number-of-unequal-triplets-in-array/description/) |Easy|To Do|To Do|
|2476|[Closest Nodes Queries in a Binary Search Tree](https://leetcode.com/problems/closest-nodes-queries-in-a-binary-search-tree/description/) |Medium|To Do|To Do|
|2477|[Minimum Fuel Cost to Report to the Capital](https://leetcode.com/problems/minimum-fuel-cost-to-report-to-the-capital/description/) |Medium|To Do|To Do|
|2478|[Number of Beautiful Partitions](https://leetcode.com/problems/number-of-beautiful-partitions/description/) |Hard|To Do|To Do|
|2431|[Maximize Total Tastiness of Purchased Fruits](https://leetcode.com/problems/maximize-total-tastiness-of-purchased-fruits/description/) :lock:|Medium|To Do|To Do|
|2485|[Find the Pivot Integer](https://leetcode.com/problems/find-the-pivot-integer/description/) |Easy|To Do|To Do|
|2486|[Append Characters to String to Make Subsequence](https://leetcode.com/problems/append-characters-to-string-to-make-subsequence/description/) |Medium|To Do|To Do|
|2487|[Remove Nodes From Linked List](https://leetcode.com/problems/remove-nodes-from-linked-list/description/) |Medium|To Do|To Do|
|2488|[Count Subarrays With Median K](https://leetcode.com/problems/count-subarrays-with-median-k/description/) |Hard|To Do|To Do|
|2481|[Minimum Cuts to Divide a Circle](https://leetcode.com/problems/minimum-cuts-to-divide-a-circle/description/) |Easy|To Do|To Do|
|2483|[Minimum Penalty for a Shop](https://leetcode.com/problems/minimum-penalty-for-a-shop/description/) |Medium|To Do|To Do|
|2484|[Count Palindromic Subsequences](https://leetcode.com/problems/count-palindromic-subsequences/description/) |Hard|To Do|To Do|
|2436|[Minimum Split Into Subarrays With GCD Greater Than One](https://leetcode.com/problems/minimum-split-into-subarrays-with-gcd-greater-than-one/description/) :lock:|Medium|To Do|To Do|
|2490|[Circular Sentence](https://leetcode.com/problems/circular-sentence/description/) |Easy|To Do|To Do|
|2491|[Divide Players Into Teams of Equal Skill](https://leetcode.com/problems/divide-players-into-teams-of-equal-skill/description/) |Medium|To Do|To Do|
|2492|[Minimum Score of a Path Between Two Cities](https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities/description/) |Medium|To Do|To Do|
|2493|[Divide Nodes Into the Maximum Number of Groups](https://leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups/description/) |Hard|To Do|To Do|
|2445|[Number of Nodes With Value One](https://leetcode.com/problems/number-of-nodes-with-value-one/description/) :lock:|Medium|To Do|To Do|
|2500|[Delete Greatest Value in Each Row](https://leetcode.com/problems/delete-greatest-value-in-each-row/description/) |Easy|To Do|To Do|
|2501|[Longest Square Streak in an Array](https://leetcode.com/problems/longest-square-streak-in-an-array/description/) |Medium|To Do|To Do|
|2502|[Design Memory Allocator](https://leetcode.com/problems/design-memory-allocator/description/) |Medium|To Do|To Do|
|2503|[Maximum Number of Points From Grid Queries](https://leetcode.com/problems/maximum-number-of-points-from-grid-queries/description/) |Hard|To Do|To Do|
|2496|[Maximum Value of a String in an Array](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/description/) |Easy|To Do|To Do|
|2497|[Maximum Star Sum of a Graph](https://leetcode.com/problems/maximum-star-sum-of-a-graph/description/) |Medium|To Do|To Do|
|2498|[Frog Jump II](https://leetcode.com/problems/frog-jump-ii/description/) |Medium|To Do|To Do|
|2499|[Minimum Total Cost to Make Arrays Unequal](https://leetcode.com/problems/minimum-total-cost-to-make-arrays-unequal/description/) |Hard|To Do|To Do|
|2450|[Number of Distinct Binary Strings After Applying Operations](https://leetcode.com/problems/number-of-distinct-binary-strings-after-applying-operations/description/) :lock:|Medium|To Do|To Do|
|2506|[Count Pairs Of Similar Strings](https://leetcode.com/problems/count-pairs-of-similar-strings/description/) |Easy|To Do|To Do|
|2507|[Smallest Value After Replacing With Sum of Prime Factors](https://leetcode.com/problems/smallest-value-after-replacing-with-sum-of-prime-factors/description/) |Medium|To Do|To Do|
|2508|[Add Edges to Make Degrees of All Nodes Even](https://leetcode.com/problems/add-edges-to-make-degrees-of-all-nodes-even/description/) |Hard|To Do|To Do|
|2509|[Cycle Length Queries in a Tree](https://leetcode.com/problems/cycle-length-queries-in-a-tree/description/) |Hard|To Do|To Do|
|2515|[Shortest Distance to Target String in a Circular Array](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array/description/) |Easy|To Do|To Do|
|2516|[Take K of Each Character From Left and Right](https://leetcode.com/problems/take-k-of-each-character-from-left-and-right/description/) |Medium|To Do|To Do|
|2517|[Maximum Tastiness of Candy Basket](https://leetcode.com/problems/maximum-tastiness-of-candy-basket/description/) |Medium|To Do|To Do|
|2518|[Number of Great Partitions](https://leetcode.com/problems/number-of-great-partitions/description/) |Hard|To Do|To Do|
|2511|[Maximum Enemy Forts That Can Be Captured](https://leetcode.com/problems/maximum-enemy-forts-that-can-be-captured/description/) |Easy|To Do|To Do|
|2512|[Reward Top K Students](https://leetcode.com/problems/reward-top-k-students/description/) |Medium|To Do|To Do|
|2541|[Minimum Operations to Make Array Equal II](https://leetcode.com/problems/minimum-operations-to-make-array-equal-ii/description/) |Medium|To Do|To Do|
|2514|[Count Anagrams](https://leetcode.com/problems/count-anagrams/description/) |Hard|To Do|To Do|
|2482|[Difference Between Ones and Zeros in Row and Column](https://leetcode.com/problems/difference-between-ones-and-zeros-in-row-and-column/description/) |Medium|To Do|To Do|
|2464|[Minimum Subarrays in a Valid Split](https://leetcode.com/problems/minimum-subarrays-in-a-valid-split/description/) :lock:|Medium|To Do|To Do|
|2520|[Count the Digits That Divide a Number](https://leetcode.com/problems/count-the-digits-that-divide-a-number/description/) |Easy|To Do|To Do|
|2521|[Distinct Prime Factors of Product of Array](https://leetcode.com/problems/distinct-prime-factors-of-product-of-array/description/) |Medium|To Do|To Do|
|2523|[Closest Prime Numbers in Range](https://leetcode.com/problems/closest-prime-numbers-in-range/description/) |Medium|To Do|To Do|
|2473|[Minimum Cost to Buy Apples](https://leetcode.com/problems/minimum-cost-to-buy-apples/description/) :lock:|Medium|To Do|To Do|
|2474|[Customers With Strictly Increasing Purchases](https://leetcode.com/problems/customers-with-strictly-increasing-purchases/description/) :lock:|Hard|To Do|To Do|
|2529|[Maximum Count of Positive Integer and Negative Integer](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer/description/) |Easy|To Do|To Do|
|2531|[Make Number of Distinct Characters Equal](https://leetcode.com/problems/make-number-of-distinct-characters-equal/description/) |Medium|To Do|To Do|
|2530|[Maximal Score After Applying K Operations](https://leetcode.com/problems/maximal-score-after-applying-k-operations/description/) |Medium|To Do|To Do|
|2534|[Time Taken to Cross the Door](https://leetcode.com/problems/time-taken-to-cross-the-door/description/) :lock:|Hard|To Do|To Do|
|2528|[Maximize the Minimum Powered City](https://leetcode.com/problems/maximize-the-minimum-powered-city/description/) |Hard|To Do|To Do|
|2525|[Categorize Box According to Criteria](https://leetcode.com/problems/categorize-box-according-to-criteria/description/) |Easy|To Do|To Do|
|2526|[Find Consecutive Integers from a Data Stream](https://leetcode.com/problems/find-consecutive-integers-from-a-data-stream/description/) |Medium|To Do|To Do|
|2527|[Find Xor-Beauty of Array](https://leetcode.com/problems/find-xor-beauty-of-array/description/) |Medium|To Do|To Do|
|2480|[Form a Chemical Bond](https://leetcode.com/problems/form-a-chemical-bond/description/) :lock:|Easy|To Do|To Do|
|2479|[Maximum XOR of Two Non-Overlapping Subtrees](https://leetcode.com/problems/maximum-xor-of-two-non-overlapping-subtrees/description/) :lock:|Hard|To Do|To Do|
|2535|[Difference Between Element Sum and Digit Sum of an Array](https://leetcode.com/problems/difference-between-element-sum-and-digit-sum-of-an-array/description/) |Easy|To Do|To Do|
|2536|[Increment Submatrices by One](https://leetcode.com/problems/increment-submatrices-by-one/description/) |Medium|To Do|To Do|
|2537|[Count the Number of Good Subarrays](https://leetcode.com/problems/count-the-number-of-good-subarrays/description/) |Medium|To Do|To Do|
|2538|[Difference Between Maximum and Minimum Price Sum](https://leetcode.com/problems/difference-between-maximum-and-minimum-price-sum/description/) |Hard|To Do|To Do|
|2513|[Minimize the Maximum of Two Arrays](https://leetcode.com/problems/minimize-the-maximum-of-two-arrays/description/) |Medium|To Do|To Do|
|2489|[Number of Substrings With Fixed Ratio](https://leetcode.com/problems/number-of-substrings-with-fixed-ratio/description/) :lock:|Medium|To Do|To Do|
|2544|[Alternating Digit Sum](https://leetcode.com/problems/alternating-digit-sum/description/) |Easy|To Do|To Do|
|2545|[Sort the Students by Their Kth Score](https://leetcode.com/problems/sort-the-students-by-their-kth-score/description/) |Medium|To Do|To Do|
|2546|[Apply Bitwise Operations to Make Strings Equal](https://leetcode.com/problems/apply-bitwise-operations-to-make-strings-equal/description/) |Medium|To Do|To Do|
|2547|[Minimum Cost to Split an Array](https://leetcode.com/problems/minimum-cost-to-split-an-array/description/) |Hard|To Do|To Do|
|2540|[Minimum Common Value](https://leetcode.com/problems/minimum-common-value/description/) |Easy|To Do|To Do|
|2543|[Check if Point Is Reachable](https://leetcode.com/problems/check-if-point-is-reachable/description/) |Hard|To Do|To Do|
|2542|[Maximum Subsequence Score](https://leetcode.com/problems/maximum-subsequence-score/description/) |Medium|To Do|To Do|
|2494|[Merge Overlapping Events in the Same Hall](https://leetcode.com/problems/merge-overlapping-events-in-the-same-hall/description/) :lock:|Hard|To Do|To Do|
|2495|[Number of Subarrays Having Even Product](https://leetcode.com/problems/number-of-subarrays-having-even-product/description/) :lock:|Medium|To Do|To Do|
|2553|[Separate the Digits in an Array](https://leetcode.com/problems/separate-the-digits-in-an-array/description/) |Easy|To Do|To Do|
|2554|[Maximum Number of Integers to Choose From a Range I](https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-i/description/) |Medium|To Do|To Do|
|2556|[Disconnect Path in a Binary Matrix by at Most One Flip](https://leetcode.com/problems/disconnect-path-in-a-binary-matrix-by-at-most-one-flip/description/) |Medium|To Do|To Do|
|2532|[Time to Cross a Bridge](https://leetcode.com/problems/time-to-cross-a-bridge/description/) |Hard|To Do|To Do|
|2504|[Concatenate the Name and the Profession](https://leetcode.com/problems/concatenate-the-name-and-the-profession/description/) :lock:|Easy|To Do|To Do|
|2505|[Bitwise OR of All Subsequence Sums](https://leetcode.com/problems/bitwise-or-of-all-subsequence-sums/description/) :lock:|Medium|To Do|To Do|
|2582|[Pass the Pillow](https://leetcode.com/problems/pass-the-pillow/description/) |Easy|To Do|To Do|
|2583|[Kth Largest Sum in a Binary Tree](https://leetcode.com/problems/kth-largest-sum-in-a-binary-tree/description/) |Medium|To Do|To Do|
|2584|[Split the Array to Make Coprime Products](https://leetcode.com/problems/split-the-array-to-make-coprime-products/description/) |Hard|To Do|To Do|
|2585|[Number of Ways to Earn Points](https://leetcode.com/problems/number-of-ways-to-earn-points/description/) |Hard|To Do|To Do|
|2579|[Count Total Number of Colored Cells](https://leetcode.com/problems/count-total-number-of-colored-cells/description/) |Medium|To Do|To Do|
|2578|[Split With Minimum Sum](https://leetcode.com/problems/split-with-minimum-sum/description/) |Easy|To Do|To Do|
|2580|[Count Ways to Group Overlapping Ranges](https://leetcode.com/problems/count-ways-to-group-overlapping-ranges/description/) |Medium|To Do|To Do|
|2581|[Count Number of Possible Root Nodes](https://leetcode.com/problems/count-number-of-possible-root-nodes/description/) |Hard|To Do|To Do|
|2510|[Check if There is a Path With Equal Number of 0's And 1's](https://leetcode.com/problems/check-if-there-is-a-path-with-equal-number-of-0s-and-1s/description/) :lock:|Medium|To Do|To Do|
|2586|[Count the Number of Vowel Strings in Range](https://leetcode.com/problems/count-the-number-of-vowel-strings-in-range/description/) |Easy|To Do|To Do|
|2587|[Rearrange Array to Maximize Prefix Score](https://leetcode.com/problems/rearrange-array-to-maximize-prefix-score/description/) |Medium|To Do|To Do|
|2588|[Count the Number of Beautiful Subarrays](https://leetcode.com/problems/count-the-number-of-beautiful-subarrays/description/) |Medium|To Do|To Do|
|2589|[Minimum Time to Complete All Tasks](https://leetcode.com/problems/minimum-time-to-complete-all-tasks/description/) |Hard|To Do|To Do|
|2519|[Count the Number of K-Big Indices](https://leetcode.com/problems/count-the-number-of-k-big-indices/description/) :lock:|Hard|To Do|To Do|
|2595|[Number of Even and Odd Bits](https://leetcode.com/problems/number-of-even-and-odd-bits/description/) |Easy|To Do|To Do|
|2598|[Smallest Missing Non-negative Integer After Operations](https://leetcode.com/problems/smallest-missing-non-negative-integer-after-operations/description/) |Medium|To Do|To Do|
|2596|[Check Knight Tour Configuration](https://leetcode.com/problems/check-knight-tour-configuration/description/) |Medium|To Do|To Do|
|2591|[Distribute Money to Maximum Children](https://leetcode.com/problems/distribute-money-to-maximum-children/description/) |Easy|To Do|To Do|
|2592|[Maximize Greatness of an Array](https://leetcode.com/problems/maximize-greatness-of-an-array/description/) |Medium|To Do|To Do|
|2594|[Minimum Time to Repair Cars](https://leetcode.com/problems/minimum-time-to-repair-cars/description/) |Medium|To Do|To Do|
|2604|[Minimum Time to Eat All Grains](https://leetcode.com/problems/minimum-time-to-eat-all-grains/description/) :lock:|Hard|To Do|To Do|
|2524|[Maximum Frequency Score of a Subarray](https://leetcode.com/problems/maximum-frequency-score-of-a-subarray/description/) :lock:|Hard|To Do|To Do|
|2605|[Form Smallest Number From Two Digit Arrays](https://leetcode.com/problems/form-smallest-number-from-two-digit-arrays/description/) |Easy|To Do|To Do|
|2606|[Find the Substring With Maximum Cost](https://leetcode.com/problems/find-the-substring-with-maximum-cost/description/) |Medium|To Do|To Do|
|2607|[Make K-Subarray Sums Equal](https://leetcode.com/problems/make-k-subarray-sums-equal/description/) |Medium|To Do|To Do|
|2608|[Shortest Cycle in a Graph](https://leetcode.com/problems/shortest-cycle-in-a-graph/description/) |Hard|To Do|To Do|
|2533|[Number of Good Binary Strings](https://leetcode.com/problems/number-of-good-binary-strings/description/) :lock:|Medium|To Do|To Do|
|2555|[Maximize Win From Two Segments](https://leetcode.com/problems/maximize-win-from-two-segments/description/) |Medium|To Do|To Do|
|2599|[Make the Prefix Sum Non-negative](https://leetcode.com/problems/make-the-prefix-sum-non-negative/description/) :lock:|Medium|To Do|To Do|
|2639|[Find the Width of Columns of a Grid](https://leetcode.com/problems/find-the-width-of-columns-of-a-grid/description/) |Easy|To Do|To Do|
|2640|[Find the Score of All Prefixes of an Array](https://leetcode.com/problems/find-the-score-of-all-prefixes-of-an-array/description/) |Medium|To Do|To Do|
|2641|[Cousins in Binary Tree II](https://leetcode.com/problems/cousins-in-binary-tree-ii/description/) |Medium|To Do|To Do|
|2642|[Design Graph With Shortest Path Calculator](https://leetcode.com/problems/design-graph-with-shortest-path-calculator/description/) |Hard|To Do|To Do|
|2549|[Count Distinct Numbers on Board](https://leetcode.com/problems/count-distinct-numbers-on-board/description/) |Easy|To Do|To Do|
|2550|[Count Collisions of Monkeys on a Polygon](https://leetcode.com/problems/count-collisions-of-monkeys-on-a-polygon/description/) |Medium|To Do|To Do|
|2551|[Put Marbles in Bags](https://leetcode.com/problems/put-marbles-in-bags/description/) |Hard|To Do|To Do|
|2552|[Count Increasing Quadruplets](https://leetcode.com/problems/count-increasing-quadruplets/description/) |Hard|To Do|To Do|
|2539|[Count the Number of Good Subsequences](https://leetcode.com/problems/count-the-number-of-good-subsequences/description/) :lock:|Medium|To Do|To Do|
|2660|[Determine the Winner of a Bowling Game](https://leetcode.com/problems/determine-the-winner-of-a-bowling-game/description/) |Easy|To Do|To Do|
|2661|[First Completely Painted Row or Column](https://leetcode.com/problems/first-completely-painted-row-or-column/description/) |Medium|To Do|To Do|
|2662|[Minimum Cost of a Path With Special Roads](https://leetcode.com/problems/minimum-cost-of-a-path-with-special-roads/description/) |Medium|To Do|To Do|
|2663|[Lexicographically Smallest Beautiful String](https://leetcode.com/problems/lexicographically-smallest-beautiful-string/description/) |Hard|To Do|To Do|
|2590|[Design a Todo List](https://leetcode.com/problems/design-a-todo-list/description/) :lock:|Medium|To Do|To Do|
|2561|[Rearranging Fruits](https://leetcode.com/problems/rearranging-fruits/description/) |Hard|To Do|To Do|
|2560|[House Robber IV](https://leetcode.com/problems/house-robber-iv/description/) |Medium|To Do|To Do|
|2559|[Count Vowel Strings in Ranges](https://leetcode.com/problems/count-vowel-strings-in-ranges/description/) |Medium|To Do|To Do|
|2558|[Take Gifts From the Richest Pile](https://leetcode.com/problems/take-gifts-from-the-richest-pile/description/) |Easy|To Do|To Do|
|2548|[Maximum Price to Fill a Bag](https://leetcode.com/problems/maximum-price-to-fill-a-bag/description/) :lock:|Medium|To Do|To Do|
|2644|[Find the Maximum Divisibility Score](https://leetcode.com/problems/find-the-maximum-divisibility-score/description/) |Easy|To Do|To Do|
|2593|[Find Score of an Array After Marking All Elements](https://leetcode.com/problems/find-score-of-an-array-after-marking-all-elements/description/) |Medium|To Do|To Do|
|2597|[The Number of Beautiful Subsets](https://leetcode.com/problems/the-number-of-beautiful-subsets/description/) |Medium|To Do|To Do|
|2617|[Minimum Number of Visited Cells in a Grid](https://leetcode.com/problems/minimum-number-of-visited-cells-in-a-grid/description/) |Hard|To Do|To Do|
|2562|[Find the Array Concatenation Value](https://leetcode.com/problems/find-the-array-concatenation-value/description/) |Easy|To Do|To Do|
|2563|[Count the Number of Fair Pairs](https://leetcode.com/problems/count-the-number-of-fair-pairs/description/) |Medium|To Do|To Do|
|2564|[Substring XOR Queries](https://leetcode.com/problems/substring-xor-queries/description/) |Medium|To Do|To Do|
|2565|[Subsequence With the Minimum Score](https://leetcode.com/problems/subsequence-with-the-minimum-score/description/) |Hard|To Do|To Do|
|2557|[Maximum Number of Integers to Choose From a Range II](https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-ii/description/) :lock:|Medium|To Do|To Do|
|2569|[Handling Sum Queries After Update](https://leetcode.com/problems/handling-sum-queries-after-update/description/) |Hard|To Do|To Do|
|2566|[Maximum Difference by Remapping a Digit](https://leetcode.com/problems/maximum-difference-by-remapping-a-digit/description/) |Easy|To Do|To Do|
|2568|[Minimum Impossible OR](https://leetcode.com/problems/minimum-impossible-or/description/) |Medium|To Do|To Do|
|2567|[Minimum Score by Changing Two Elements](https://leetcode.com/problems/minimum-score-by-changing-two-elements/description/) |Medium|To Do|To Do|
|2570|[Merge Two 2D Arrays by Summing Values](https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values/description/) |Easy|To Do|To Do|
|2573|[Find the String with LCP](https://leetcode.com/problems/find-the-string-with-lcp/description/) |Hard|To Do|To Do|
|2572|[Count the Number of Square-Free Subsets](https://leetcode.com/problems/count-the-number-of-square-free-subsets/description/) |Medium|To Do|To Do|
|2571|[Minimum Operations to Reduce an Integer to 0](https://leetcode.com/problems/minimum-operations-to-reduce-an-integer-to-0/description/) |Medium|To Do|To Do|
|2577|[Minimum Time to Visit a Cell In a Grid](https://leetcode.com/problems/minimum-time-to-visit-a-cell-in-a-grid/description/) |Hard|To Do|To Do|
|2576|[Find the Maximum Number of Marked Indices](https://leetcode.com/problems/find-the-maximum-number-of-marked-indices/description/) |Medium|To Do|To Do|
|2575|[Find the Divisibility Array of a String](https://leetcode.com/problems/find-the-divisibility-array-of-a-string/description/) |Medium|To Do|To Do|
|2574|[Left and Right Sum Differences](https://leetcode.com/problems/left-and-right-sum-differences/description/) |Easy|To Do|To Do|
|2600|[K Items With the Maximum Sum](https://leetcode.com/problems/k-items-with-the-maximum-sum/description/) |Easy|To Do|To Do|
|2601|[Prime Subtraction Operation](https://leetcode.com/problems/prime-subtraction-operation/description/) |Medium|To Do|To Do|
|2603|[Collect Coins in a Tree](https://leetcode.com/problems/collect-coins-in-a-tree/description/) |Hard|To Do|To Do|
|2602|[Minimum Operations to Make All Array Elements Equal](https://leetcode.com/problems/minimum-operations-to-make-all-array-elements-equal/description/) |Medium|To Do|To Do|
|2613|[Beautiful Pairs](https://leetcode.com/problems/beautiful-pairs/description/) :lock:|Hard|To Do|To Do|
|2616|[Minimize the Maximum Difference of Pairs](https://leetcode.com/problems/minimize-the-maximum-difference-of-pairs/description/) |Medium|To Do|To Do|
|2615|[Sum of Distances](https://leetcode.com/problems/sum-of-distances/description/) |Medium|To Do|To Do|
|2614|[Prime In Diagonal](https://leetcode.com/problems/prime-in-diagonal/description/) |Easy|To Do|To Do|
|2609|[Find the Longest Balanced Substring of a Binary String](https://leetcode.com/problems/find-the-longest-balanced-substring-of-a-binary-string/description/) |Easy|To Do|To Do|
|2610|[Convert an Array Into a 2D Array With Conditions](https://leetcode.com/problems/convert-an-array-into-a-2d-array-with-conditions/description/) |Medium|To Do|To Do|
|2611|[Mice and Cheese](https://leetcode.com/problems/mice-and-cheese/description/) |Medium|To Do|To Do|
|2612|[Minimum Reverse Operations](https://leetcode.com/problems/minimum-reverse-operations/description/) |Hard|To Do|To Do|
|2678|[Number of Senior Citizens](https://leetcode.com/problems/number-of-senior-citizens/description/) |Easy|To Do|To Do|
|2679|[Sum in a Matrix](https://leetcode.com/problems/sum-in-a-matrix/description/) |Medium|To Do|To Do|
|2680|[Maximum OR](https://leetcode.com/problems/maximum-or/description/) |Medium|To Do|To Do|
|2623|[Memoize](https://leetcode.com/problems/memoize/description/) |Medium|To Do|To Do|
|2620|[Counter](https://leetcode.com/problems/counter/description/) |Easy|To Do|To Do|
|2621|[Sleep](https://leetcode.com/problems/sleep/description/) |Easy|To Do|To Do|
|2619|[Array Prototype Last](https://leetcode.com/problems/array-prototype-last/description/) |Easy|To Do|To Do|
|2628|[JSON Deep Equal](https://leetcode.com/problems/json-deep-equal/description/) |Medium|To Do|To Do|
|2645|[Minimum Additions to Make Valid String](https://leetcode.com/problems/minimum-additions-to-make-valid-string/description/) |Medium|To Do|To Do|
|2643|[Row With Maximum Ones](https://leetcode.com/problems/row-with-maximum-ones/description/) |Easy|To Do|To Do|
|2638|[Count the Number of K-Free Subsets](https://leetcode.com/problems/count-the-number-of-k-free-subsets/description/) :lock:|Medium|To Do|To Do|
|2646|[Minimize the Total Price of the Trips](https://leetcode.com/problems/minimize-the-total-price-of-the-trips/description/) |Hard|To Do|To Do|
|2632|[Curry](https://leetcode.com/problems/curry/description/) |Medium|To Do|To Do|
|2629|[Function Composition](https://leetcode.com/problems/function-composition/description/) |Easy|To Do|To Do|
|2631|[Group By](https://leetcode.com/problems/group-by/description/) |Medium|To Do|To Do|
|2627|[Debounce](https://leetcode.com/problems/debounce/description/) |Medium|To Do|To Do|
|2630|[Memoize II](https://leetcode.com/problems/memoize-ii/description/) |Hard|To Do|To Do|
|2633|[Convert Object to JSON String](https://leetcode.com/problems/convert-object-to-json-string/description/) |Medium|To Do|To Do|
|2634|[Filter Elements from Array](https://leetcode.com/problems/filter-elements-from-array/description/) |Easy|To Do|To Do|
|2635|[Apply Transform Over Each Element in Array](https://leetcode.com/problems/apply-transform-over-each-element-in-array/description/) |Easy|To Do|To Do|
|2651|[Calculate Delayed Arrival Time](https://leetcode.com/problems/calculate-delayed-arrival-time/description/) |Easy|To Do|To Do|
|2637|[Promise Time Limit](https://leetcode.com/problems/promise-time-limit/description/) |Easy|To Do|To Do|
|2636|[Promise Pool](https://leetcode.com/problems/promise-pool/description/) |Medium|To Do|To Do|
|2653|[Sliding Subarray Beauty](https://leetcode.com/problems/sliding-subarray-beauty/description/) |Medium|To Do|To Do|
|2652|[Sum Multiples](https://leetcode.com/problems/sum-multiples/description/) |Easy|To Do|To Do|
|2654|[Minimum Number of Operations to Make All Array Elements Equal to 1](https://leetcode.com/problems/minimum-number-of-operations-to-make-all-array-elements-equal-to-1/description/) |Medium|To Do|To Do|
|2618|[Check if Object Instance of Class](https://leetcode.com/problems/check-if-object-instance-of-class/description/) |Medium|To Do|To Do|
|2625|[Flatten Deeply Nested Array](https://leetcode.com/problems/flatten-deeply-nested-array/description/) |Medium|To Do|To Do|
|2624|[Snail Traversal](https://leetcode.com/problems/snail-traversal/description/) |Medium|To Do|To Do|
|2626|[Array Reduce Transformation](https://leetcode.com/problems/array-reduce-transformation/description/) |Easy|To Do|To Do|
|2622|[Cache With Time Limit](https://leetcode.com/problems/cache-with-time-limit/description/) |Medium|To Do|To Do|
|2658|[Maximum Number of Fish in a Grid](https://leetcode.com/problems/maximum-number-of-fish-in-a-grid/description/) |Medium|To Do|To Do|
|2659|[Make Array Empty](https://leetcode.com/problems/make-array-empty/description/) |Hard|To Do|To Do|
|2657|[Find the Prefix Common Array of Two Arrays](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/description/) |Medium|To Do|To Do|
|2656|[Maximum Sum With Exactly K Elements ](https://leetcode.com/problems/maximum-sum-with-exactly-k-elements/description/) |Easy|To Do|To Do|
|2675|[Array of Objects to Matrix](https://leetcode.com/problems/array-of-objects-to-matrix/description/) |Medium|To Do|To Do|
|2676|[Throttle](https://leetcode.com/problems/throttle/description/) |Medium|To Do|To Do|
|2648|[Generate Fibonacci Sequence](https://leetcode.com/problems/generate-fibonacci-sequence/description/) |Easy|To Do|To Do|
|2670|[Find the Distinct Difference Array](https://leetcode.com/problems/find-the-distinct-difference-array/description/) |Easy|To Do|To Do|
|2671|[Frequency Tracker](https://leetcode.com/problems/frequency-tracker/description/) |Medium|To Do|To Do|
|2672|[Number of Adjacent Elements With the Same Color](https://leetcode.com/problems/number-of-adjacent-elements-with-the-same-color/description/) |Medium|To Do|To Do|
|2673|[Make Costs of Paths Equal in a Binary Tree](https://leetcode.com/problems/make-costs-of-paths-equal-in-a-binary-tree/description/) |Medium|To Do|To Do|
|2649|[Nested Array Generator](https://leetcode.com/problems/nested-array-generator/description/) |Medium|To Do|To Do|
|2681|[Power of Heroes](https://leetcode.com/problems/power-of-heroes/description/) |Hard|To Do|To Do|
|2650|[Design Cancellable Function](https://leetcode.com/problems/design-cancellable-function/description/) |Hard|To Do|To Do|
|2665|[Counter II](https://leetcode.com/problems/counter-ii/description/) |Easy|To Do|To Do|
|2682|[Find the Losers of the Circular Game](https://leetcode.com/problems/find-the-losers-of-the-circular-game/description/) |Easy|To Do|To Do|
|2683|[Neighboring Bitwise XOR](https://leetcode.com/problems/neighboring-bitwise-xor/description/) |Medium|To Do|To Do|
|2685|[Count the Number of Complete Components](https://leetcode.com/problems/count-the-number-of-complete-components/description/) |Medium|To Do|To Do|
|2684|[Maximum Number of Moves in a Grid](https://leetcode.com/problems/maximum-number-of-moves-in-a-grid/description/) |Medium|To Do|To Do|
|2666|[Allow One Function Call](https://leetcode.com/problems/allow-one-function-call/description/) |Easy|To Do|To Do|
|2677|[Chunk Array](https://leetcode.com/problems/chunk-array/description/) |Easy|To Do|To Do|
|2667|[Create Hello World Function](https://leetcode.com/problems/create-hello-world-function/description/) |Easy|To Do|To Do|
|2655|[Find Maximal Uncovered Ranges](https://leetcode.com/problems/find-maximal-uncovered-ranges/description/) :lock:|Medium|To Do|To Do|
|2664|[The Knight’s Tour](https://leetcode.com/problems/the-knights-tour/description/) :lock:|Medium|To Do|To Do|
|2668|[Find Latest Salaries](https://leetcode.com/problems/find-latest-salaries/description/) :lock:|Easy|To Do|To Do|
|2669|[Count Artist Occurrences On Spotify Ranking List](https://leetcode.com/problems/count-artist-occurrences-on-spotify-ranking-list/description/) :lock:|Easy|To Do|To Do|
|2674|[Split a Circular Linked List](https://leetcode.com/problems/split-a-circular-linked-list/description/) :lock:|Medium|To Do|To Do|
|2686|[Immediate Food Delivery III](https://leetcode.com/problems/immediate-food-delivery-iii/description/) :lock:|Medium|To Do|To Do|
|2687|[Bikes Last Time Used ](https://leetcode.com/problems/bikes-last-time-used/description/) :lock:|Easy|To Do|To Do|
|2688|[Find Active Users](https://leetcode.com/problems/find-active-users/description/) :lock:|Medium|To Do|To Do|