KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#developer-tools #typescript #claude-code #codex #dsh #dsh-plugin #ai-agent #ai-agents #deepseek-harness #agent-skills #macos #cli

leetcode

★ 10 Open GitHub ↗

:100: Some Leetcode algorithm and data structure answer wrote by Python/Javascript/Go...

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Leetcode

> Some [Leetcode](https://leetcode.com) algorithm and data structure answer wrote by Python/JavaScript ... :100:.

[![Progress](http://progressed.io/bar/11?title=done)](https://leetcode.com/problemset/all/)
[![codebeat badge](https://codebeat.co/badges/348b71c8-c264-4483-a194-079ad959a6ed)](https://codebeat.co/projects/github-com-kkxujq-leetcode-master)
[![GitHub issues](https://img.shields.io/github/issues/kkxujq/leetcode.svg)](https://github.com/kkxujq/leetcode/issues)
[![GitHub stars](https://img.shields.io/github/stars/kkxujq/leetcode.svg)](https://github.com/kkxujq/leetcode/stargazers)
[![GitHub license](https://img.shields.io/github/license/kkxujq/leetcode.svg)](https://github.com/kkxujq/leetcode/blob/master/LICENSE)

[TOC]

## Usage

**Initialize the repository:**
```shell
sh init-hook.sh
```

bypass the hook:
```shell
git commit --no-verify
```

:bangbang: Commit rule：<br>
- **Your solution can be placed in the `./answer/` directory, the directory name should be the problem `ID`**;
- `README` does not need to be manually modified.

## Statistics

|Easy|Medium|Hard|<h3>Total</h3>|
|:-:|:-:|:-:|:-:|
|48|48|11|<h3>107</h3>|

:clap: Rank:
<pre>

🥇 JavaScript ■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■■□□□□□□□□□□□□□□□□□□□□□□□□□□□□□  77/132
🥈     Python ■■■■■■■■■■■■■■■■■■■■■■■■■■□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□  49/132
🥉         Go ■■■□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□   4/132
4️⃣        SQL ■■□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□□   2/132

</pre>

:two_men_holding_hands: Contributors:

|<a href="https://github.com/linningmii"><img alt="linningmii" src="https://avatars1.githubusercontent.com/u/14858674?v=4&s=60"/><br>linningmii</a>|<a href="https://github.com/kkxujq"><img alt="kkxujq" src="https://avatars3.githubusercontent.com/u/14943597?v=4&s=60"/><br>kkxujq</a>|<a href="https://github.com/inJs"><img alt="inJs" src="https://avatars3.githubusercontent.com/u/11471397?v=4&s=60"/><br>inJs</a>|<a href="https://github.com/zy445566"><img alt="zy445566" src="https://avatars2.githubusercontent.com/u/14976489?v=4&s=60"/><br>zy445566</a>|<a href="https://github.com/zh-rocco"><img alt="zh-rocco" src="https://avatars0.githubusercontent.com/u/23545037?v=4&s=60"/><br>zh-rocco</a>|
|:-:|:-:|:-:|:-:|:-:|
|<a href="https://github.com/kkxujq/leetcode/graphs/contributors">89<br>contributions</a>|<a href="https://github.com/kkxujq/leetcode/graphs/contributors">75<br>contributions</a>|<a href="https://github.com/kkxujq/leetcode/graphs/contributors">10<br>contributions</a>|<a href="https://github.com/kkxujq/leetcode/graphs/contributors">8<br>contributions</a>|<a href="https://github.com/kkxujq/leetcode/graphs/contributors">2<br>contributions</a>|

## QUESTIONS

- [:us:All problems](https://leetcode.com/problemset/all/)
- [:cn:题库](https://leetcode-cn.com/problemset/all/)

| ID | Title | Answer | Difficulty |
|:--:|:------|:------:|:----------:|
|0001|[Two Sum](https://leetcode.com/problems/two-sum)|[Go, Python, JavaScript](./answer/0001)|Easy|
|0002|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers)|[Python, JavaScript](./answer/0002)|Medium|
|0003|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)|[Python, JavaScript](./answer/0003)|Medium|
|0004|[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays)|[Python, JavaScript](./answer/0004)|Hard|
|0005|[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring)|[Python, JavaScript](./answer/0005)|Medium|
|0006|[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion)|[Python, JavaScript](./answer/0006)|Medium|
|0007|[Reverse Integer](https://leetcode.com/problems/reverse-integer)|[Go, Python, JavaScript](./answer/0007)|Easy|
|0008|[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi)|[JavaScript](./answer/0008)|Medium|
|0009|[Palindrome Number](https://leetcode.com/problems/palindrome-number)|[Go, Python, JavaScript](./answer/0009)|Easy|
|0010|[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching)|[JavaScript](./answer/0010)|Hard|
|0011|[Container With Most Water](https://leetcode.com/problems/container-with-most-water)|[Python, JavaScript](./answer/0011)|Medium|
|0012|[Integer to Roman](https://leetcode.com/problems/integer-to-roman)|[JavaScript](./answer/0012)|Medium|
|0013|[Roman to Integer](https://leetcode.com/problems/roman-to-integer)|[JavaScript](./answer/0013)|Easy|
|0014|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix)|[Python, JavaScript](./answer/0014)|Easy|
|0015|[3Sum](https://leetcode.com/problems/3sum)|[JavaScript](./answer/0015)|Medium|
|0016|[3Sum Closest](https://leetcode.com/problems/3sum-closest)|[JavaScript](./answer/0016)|Medium|
|0017|[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number)|[JavaScript](./answer/0017)|Medium|
|0018|[4Sum](https://leetcode.com/problems/4sum)|[JavaScript](./answer/0018)|Medium|
|0019|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list)|[JavaScript](./answer/0019)|Medium|
|0020|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses)|[JavaScript, Python](./answer/0020)|Easy|
|0021|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists)|[JavaScript, Python](./answer/0021)|Easy|
|0022|[Generate Parentheses](https://leetcode.com/problems/generate-parentheses)|[JavaScript](./answer/0022)|Medium|
|0023|[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists)|[JavaScript](./answer/0023)|Hard|
|0024|[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs)|[Python, JavaScript](./answer/0024)|Medium|
|0025|[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group)|[JavaScript](./answer/0025)|Hard|
|0026|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array)|[JavaScript](./answer/0026)|Easy|
|0027|[Remove Element](https://leetcode.com/problems/remove-element)|[JavaScript](./answer/0027)|Easy|
|0028|[Implement strStr()](https://leetcode.com/problems/implement-strstr)|[JavaScript](./answer/0028)|Easy|
|0029|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers)|[JavaScript](./answer/0029)|Medium|
|0030|[Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words)|[JavaScript](./answer/0030)|Hard|
|0031|[Next Permutation](https://leetcode.com/problems/next-permutation)|[JavaScript](./answer/0031)|Medium|
|0032|[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses)|[JavaScript](./answer/0032)|Hard|
|0033|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array)|[JavaScript](./answer/0033)|Medium|
|0034|[Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array)|[JavaScript](./answer/0034)|Medium|
|0035|[Search Insert Position](https://leetcode.com/problems/search-insert-position)|[JavaScript](./answer/0035)|Easy|
|0036|[Valid Sudoku](https://leetcode.com/problems/valid-sudoku)|[JavaScript](./answer/0036)|Medium|
|0037|[Sudoku Solver](https://leetcode.com/problems/sudoku-solver)|[JavaScript](./answer/0037)|Hard|
|0038|[Count and Say](https://leetcode.com/problems/count-and-say)|[Python](./answer/0038)|Easy|
|0039|[Combination Sum](https://leetcode.com/problems/combination-sum)|[](./answer/0039)|Medium|
|0040|[Combination Sum II](https://leetcode.com/problems/combination-sum-ii)|[](./answer/0040)|Medium|
|0041|[First Missing Positive](https://leetcode.com/problems/first-missing-positive)|[](./answer/0041)|Hard|
|0042|[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water)|[JavaScript](./answer/0042)|Hard|
|0043|[Multiply Strings](https://leetcode.com/problems/multiply-strings)|[](./answer/0043)|Medium|
|0044|[Wildcard Matching](https://leetcode.com/problems/wildcard-matching)|[](./answer/0044)|Hard|
|0045|[Jump Game II](https://leetcode.com/problems/jump-game-ii)|[](./answer/0045)|Hard|
|0046|[Permutations](https://leetcode.com/problems/permutations)|[JavaScript](./answer/0046)|Medium|
|0047|[Permutations II](https://leetcode.com/problems/permutations-ii)|[](./answer/0047)|Medium|
|0048|[Rotate Image](https://leetcode.com/problems/rotate-image)|[](./answer/0048)|Medium|
|0049|[Group Anagrams](https://leetcode.com/problems/group-anagrams)|[](./answer/0049)|Medium|
|0050|[Pow(x, n)](https://leetcode.com/problems/powx-n)|[](./answer/0050)|Medium|
|0051|[N-Queens](https://leetcode.com/problems/n-queens)|[JavaScript](./answer/0051)|Hard|
|0052|[N-Queens II](https://leetcode.com/problems/n-queens-ii)|[](./answer/0052)|Hard|
|0053|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray)|[Python, JavaScript](./answer/0053)|Easy|
|0054|[Spiral Matrix](https://leetcode.com/problems/spiral-matrix)|[](./answer/0054)|Medium|
|0055|[Jump Game](https://leetcode.com/problems/jump-game)|[](./answer/0055)|Medium|
|0056|[Merge Intervals](https://leetcode.com/problems/merge-intervals)|[](./answer/0056)|Medium|
|0057|[Insert Interval](https://leetcode.com/problems/insert-interval)|[](./answer/0057)|Hard|
|0058|[Length of Last Word](https://leetcode.com/problems/length-of-last-word)|[JavaScript](./answer/0058)|Easy|
|0059|[Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii)|[](./answer/0059)|Medium|
|0060|[Permutation Sequence](https://leetcode.com/problems/permutation-sequence)|[](./answer/0060)|Medium|
|0061|[Rotate List](https://leetcode.com/problems/rotate-list)|[](./answer/0061)|Medium|
|0062|[Unique Paths](https://leetcode.com/problems/unique-paths)|[](./answer/0062)|Medium|
|0063|[Unique Paths II](https://leetcode.com/problems/unique-paths-ii)|[](./answer/0063)|Medium|
|0064|[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum)|[](./answer/0064)|Medium|
|0065|[Valid Number](https://leetcode.com/problems/valid-number)|[](./answer/0065)|Hard|
|0066|[Plus One](https://leetcode.com/problems/plus-one)|[Python](./answer/0066)|Easy|
|0067|[Add Binary](https://leetcode.com/problems/add-binary)|[](./answer/0067)|Easy|
|0068|[Text Justification](https://leetcode.com/problems/text-justification)|[](./answer/0068)|Hard|
|0069|[Sqrt(x)](https://leetcode.com/problems/sqrtx)|[JavaScript](./answer/0069)|Easy|
|0070|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs)|[Python](./answer/0070)|Easy|
|0071|[Simplify Path](https://leetcode.com/problems/simplify-path)|[JavaScript](./answer/0071)|Medium|
|0072|[Edit Distance](https://leetcode.com/problems/edit-distance)|[](./answer/0072)|Hard|
|0073|[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes)|[](./answer/0073)|Medium|
|0074|[Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix)|[](./answer/0074)|Medium|
|0075|[Sort Colors](https://leetcode.com/problems/sort-colors)|[](./answer/0075)|Medium|
|0076|[Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring)|[](./answer/0076)|Hard|
|0077|[Combinations](https://leetcode.com/problems/combinations)|[](./answer/0077)|Medium|
|0078|[Subsets](https://leetcode.com/problems/subsets)|[JavaScript](./answer/0078)|Medium|
|0079|[Word Search](https://leetcode.com/problems/word-search)|[](./answer/0079)|Medium|
|0080|[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii)|[](./answer/0080)|Medium|
|0081|[Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii)|[](./answer/0081)|Medium|
|0082|[Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii)|[Python](./answer/0082)|Medium|
|0083|[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list)|[Python](./answer/0083)|Easy|
|0084|[Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram)|[](./answer/0084)|Hard|
|0085|[Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle)|[](./answer/0085)|Hard|
|0086|[Partition List](https://leetcode.com/problems/partition-list)|[](./answer/0086)|Medium|
|0087|[Scramble String](https://leetcode.com/problems/scramble-string)|[](./answer/0087)|Hard|
|0088|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array)|[Python](./answer/0088)|Easy|
|0089|[Gray Code](https://leetcode.com/problems/gray-code)|[](./answer/0089)|Medium|
|0090|[Subsets II](https://leetcode.com/problems/subsets-ii)|[](./answer/0090)|Medium|
|0091|[Decode Ways](https://leetcode.com/problems/decode-ways)|[](./answer/0091)|Medium|
|0092|[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii)|[Python](./answer/0092)|Medium|
|0093|[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses)|[JavaScript](./answer/0093)|Medium|
|0094|[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal)|[Python, JavaScript](./answer/0094)|Medium|
|0095|[Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii)|[](./answer/0095)|Medium|
|0096|[Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees)|[](./answer/0096)|Medium|
|0097|[Interleaving String](https://leetcode.com/problems/interleaving-string)|[](./answer/0097)|Hard|
|0098|[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree)|[JavaScript](./answer/0098)|Medium|
|0099|[Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree)|[](./answer/0099)|Hard|
|0100|[Same Tree](https://leetcode.com/problems/same-tree)|[Python](./answer/0100)|Easy|
|0101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree)|[](./answer/0101)|Easy|
|0102|[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal)|[Python](./answer/0102)|Medium|
|0103|[Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal)|[Python](./answer/0103)|Medium|
|0104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)|[Python, JavaScript](./answer/0104)|Easy|
|0105|[Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal)|[](./answer/0105)|Medium|
|0106|[Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal)|[](./answer/0106)|Medium|
|0107|[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii)|[](./answer/0107)|Easy|
|0108|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree)|[](./answer/0108)|Easy|
|0109|[Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree)|[](./answer/0109)|Medium|
|0110|[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree)|[Python](./answer/0110)|Easy|
|0111|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree)|[](./answer/0111)|Easy|
|0112|[Path Sum](https://leetcode.com/problems/path-sum)|[](./answer/0112)|Easy|
|0113|[Path Sum II](https://leetcode.com/problems/path-sum-ii)|[](./answer/0113)|Medium|
|0114|[Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list)|[](./answer/0114)|Medium|
|0115|[Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences)|[](./answer/0115)|Hard|
|0116|[Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node)|[](./answer/0116)|Medium|
|0117|[Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii)|[](./answer/0117)|Medium|
|0118|[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle)|[](./answer/0118)|Easy|
|0119|[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii)|[](./answer/0119)|Easy|
|0120|[Triangle](https://leetcode.com/problems/triangle)|[](./answer/0120)|Medium|
|0121|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)|[JavaScript, Python](./answer/0121)|Easy|
|0122|[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii)|[JavaScript](./answer/0122)|Easy|
|0123|[Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii)|[](./answer/0123)|Hard|
|0124|[Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum)|[](./answer/0124)|Hard|
|0125|[Valid Palindrome](https://leetcode.com/problems/valid-palindrome)|[](./answer/0125)|Easy|
|0126|[Word Ladder II](https://leetcode.com/problems/word-ladder-ii)|[](./answer/0126)|Hard|
|0127|[Word Ladder](https://leetcode.com/problems/word-ladder)|[](./answer/0127)|Medium|
|0128|[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence)|[](./answer/0128)|Hard|
|0129|[Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers)|[](./answer/0129)|Medium|
|0130|[Surrounded Regions](https://leetcode.com/problems/surrounded-regions)|[](./answer/0130)|Medium|
|0131|[Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning)|[](./answer/0131)|Medium|
|0132|[Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii)|[](./answer/0132)|Hard|
|0133|[Clone Graph](https://leetcode.com/problems/clone-graph)|[](./answer/0133)|Medium|
|0134|[Gas Station](https://leetcode.com/problems/gas-station)|[](./answer/0134)|Medium|
|0135|[Candy](https://leetcode.com/problems/candy)|[](./answer/0135)|Hard|
|0136|[Single Number](https://leetcode.com/problems/single-number)|[JavaScript](./answer/0136)|Easy|
|0137|[Single Number II](https://leetcode.com/problems/single-number-ii)|[](./answer/0137)|Medium|
|0138|[Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer)|[](./answer/0138)|Medium|
|0139|[Word Break](https://leetcode.com/problems/word-break)|[](./answer/0139)|Medium|
|0140|[Word Break II](https://leetcode.com/problems/word-break-ii)|[](./answer/0140)|Hard|
|0141|[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle)|[](./answer/0141)|Easy|
|0142|[Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii)|[JavaScript](./answer/0142)|Medium|
|0143|[Reorder List](https://leetcode.com/problems/reorder-list)|[](./answer/0143)|Medium|
|0144|[Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal)|[](./answer/0144)|Medium|
|0145|[Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal)|[](./answer/0145)|Hard|
|0146|[LRU Cache](https://leetcode.com/problems/lru-cache)|[JavaScript](./answer/0146)|Medium|
|0147|[Insertion Sort List](https://leetcode.com/problems/insertion-sort-list)|[](./answer/0147)|Medium|
|0148|[Sort List](https://leetcode.com/problems/sort-list)|[Python, JavaScript](./answer/0148)|Medium|
|0149|[Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line)|[](./answer/0149)|Hard|
|0150|[Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation)|[](./answer/0150)|Medium|
|0151|[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string)|[](./answer/0151)|Medium|
|0152|[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray)|[](./answer/0152)|Medium|
|0153|[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array)|[](./answer/0153)|Medium|
|0154|[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii)|[](./answer/0154)|Hard|
|0155|[Min Stack](https://leetcode.com/problems/min-stack)|[JavaScript](./answer/0155)|Easy|
|0156|[Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down)|[](./answer/0156)|Medium|
|0157|[Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4)|[](./answer/0157)|Easy|
|0158|[Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times)|[](./answer/0158)|Hard|
|0159|[Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters)|[](./answer/0159)|Hard|
|0160|[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists)|[](./answer/0160)|Easy|
|0161|[One Edit Distance](https://leetcode.com/problems/one-edit-distance)|[](./answer/0161)|Medium|
|0162|[Find Peak Element](https://leetcode.com/problems/find-peak-element)|[](./answer/0162)|Medium|
|0163|[Missing Ranges](https://leetcode.com/problems/missing-ranges)|[](./answer/0163)|Medium|
|0164|[Maximum Gap](https://leetcode.com/problems/maximum-gap)|[](./answer/0164)|Hard|
|0165|[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers)|[](./answer/0165)|Medium|
|0166|[Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal)|[](./answer/0166)|Medium|
|0167|[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted)|[](./answer/0167)|Easy|
|0168|[Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title)|[](./answer/0168)|Easy|
|0169|[Majority Element](https://leetcode.com/problems/majority-element)|[](./answer/0169)|Easy|
|0170|[Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design)|[](./answer/0170)|Easy|
|0171|[Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number)|[](./answer/0171)|Easy|
|0172|[Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes)|[](./answer/0172)|Easy|
|0173|[Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator)|[](./answer/0173)|Medium|
|0174|[Dungeon Game](https://leetcode.com/problems/dungeon-game)|[](./answer/0174)|Hard|
|0175|[Combine Two Tables](https://leetcode.com/problems/combine-two-tables)|[](./answer/0175)|Easy|
|0176|[Second Highest Salary](https://leetcode.com/problems/second-highest-salary)|[SQL](./answer/0176)|Easy|
|0177|[Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary)|[](./answer/0177)|Medium|
|0178|[Rank Scores](https://leetcode.com/problems/rank-scores)|[](./answer/0178)|Medium|
|0179|[Largest Number](https://leetcode.com/problems/largest-number)|[](./answer/0179)|Medium|
|0180|[Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers)|[](./answer/0180)|Medium|
|0181|[Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers)|[](./answer/0181)|Easy|
|0182|[Duplicate Emails](https://leetcode.com/problems/duplicate-emails)|[](./answer/0182)|Easy|
|0183|[Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order)|[](./answer/0183)|Easy|
|0184|[Department Highest Salary](https://leetcode.com/problems/department-highest-salary)|[](./answer/0184)|Medium|
|0185|[Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries)|[](./answer/0185)|Hard|
|0186|[Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii)|[](./answer/0186)|Medium|
|0187|[Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences)|[](./answer/0187)|Medium|
|0188|[Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv)|[](./answer/0188)|Hard|
|0189|[Rotate Array](https://leetcode.com/problems/rotate-array)|[](./answer/0189)|Easy|
|0190|[Reverse Bits](https://leetcode.com/problems/reverse-bits)|[](./answer/0190)|Easy|
|0191|[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits)|[](./answer/0191)|Easy|
|0192|[Word Frequency](https://leetcode.com/problems/word-frequency)|[](./answer/0192)|Medium|
|0193|[Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers)|[](./answer/0193)|Easy|
|0194|[Transpose File](https://leetcode.com/problems/transpose-file)|[](./answer/0194)|Medium|
|0195|[Tenth Line](https://leetcode.com/problems/tenth-line)|[](./answer/0195)|Easy|
|0196|[Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails)|[](./answer/0196)|Easy|
|0197|[Rising Temperature](https://leetcode.com/problems/rising-temperature)|[](./answer/0197)|Easy|
|0198|[House Robber](https://leetcode.com/problems/house-robber)|[Python](./answer/0198)|Easy|
|0199|[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view)|[](./answer/0199)|Medium|
|0200|[Number of Islands](https://leetcode.com/problems/number-of-islands)|[](./answer/0200)|Medium|
|0201|[Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range)|[](./answer/0201)|Medium|
|0202|[Happy Number](https://leetcode.com/problems/happy-number)|[](./answer/0202)|Easy|
|0203|[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements)|[](./answer/0203)|Easy|
|0204|[Count Primes](https://leetcode.com/problems/count-primes)|[](./answer/0204)|Easy|
|0205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings)|[](./answer/0205)|Easy|
|0206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list)|[JavaScript, Python](./answer/0206)|Easy|
|0207|[Course Schedule](https://leetcode.com/problems/course-schedule)|[](./answer/0207)|Medium|
|0208|[Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree)|[](./answer/0208)|Medium|
|0209|[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum)|[](./answer/0209)|Medium|
|0210|[Course Schedule II](https://leetcode.com/problems/course-schedule-ii)|[](./answer/0210)|Medium|
|0211|[Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design)|[](./answer/0211)|Medium|
|0212|[Word Search II](https://leetcode.com/problems/word-search-ii)|[](./answer/0212)|Hard|
|0213|[House Robber II](https://leetcode.com/problems/house-robber-ii)|[](./answer/0213)|Medium|
|0214|[Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome)|[](./answer/0214)|Hard|
|0215|[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array)|[JavaScript](./answer/0215)|Medium|
|0216|[Combination Sum III](https://leetcode.com/problems/combination-sum-iii)|[](./answer/0216)|Medium|
|0217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate)|[](./answer/0217)|Easy|
|0218|[The Skyline Problem](https://leetcode.com/problems/the-skyline-problem)|[](./answer/0218)|Hard|
|0219|[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii)|[](./answer/0219)|Easy|
|0220|[Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii)|[](./answer/0220)|Medium|
|0221|[Maximal Square](https://leetcode.com/problems/maximal-square)|[](./answer/0221)|Medium|
|0222|[Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes)|[](./answer/0222)|Medium|
|0223|[Rectangle Area](https://leetcode.com/problems/rectangle-area)|[](./answer/0223)|Medium|
|0224|[Basic Calculator](https://leetcode.com/problems/basic-calculator)|[](./answer/0224)|Hard|
|0225|[Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues)|[](./answer/0225)|Easy|
|0226|[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree)|[](./answer/0226)|Easy|
|0227|[Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii)|[](./answer/0227)|Medium|
|0228|[Summary Ranges](https://leetcode.com/problems/summary-ranges)|[](./answer/0228)|Medium|
|0229|[Majority Element II](https://leetcode.com/problems/majority-element-ii)|[JavaScript](./answer/0229)|Medium|
|0230|[Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst)|[JavaScript](./answer/0230)|Medium|
|0231|[Power of Two](https://leetcode.com/problems/power-of-two)|[](./answer/0231)|Easy|
|0232|[Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks)|[](./answer/0232)|Easy|
|0233|[Number of Digit One](https://leetcode.com/problems/number-of-digit-one)|[](./answer/0233)|Hard|
|0234|[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list)|[](./answer/0234)|Easy|
|0235|[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree)|[](./answer/0235)|Easy|
|0236|[Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree)|[](./answer/0236)|Medium|
|0237|[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list)|[](./answer/0237)|Easy|
|0238|[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self)|[](./answer/0238)|Medium|
|0239|[Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum)|[](./answer/0239)|Hard|
|0240|[Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii)|[](./answer/0240)|Medium|
|0241|[Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses)|[](./answer/0241)|Medium|
|0242|[Valid Anagram](https://leetcode.com/problems/valid-anagram)|[Python](./answer/0242)|Easy|
|0243|[Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance)|[](./answer/0243)|Easy|
|0244|[Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii)|[](./answer/0244)|Medium|
|0245|[Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii)|[](./answer/0245)|Medium|
|0246|[Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number)|[](./answer/0246)|Easy|
|0247|[Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii)|[](./answer/0247)|Medium|
|0248|[Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii)|[](./answer/0248)|Hard|
|0249|[Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings)|[](./answer/0249)|Medium|
|0250|[Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees)|[](./answer/0250)|Medium|
|0251|[Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector)|[](./answer/0251)|Medium|
|0252|[Meeting Rooms](https://leetcode.com/problems/meeting-rooms)|[](./answer/0252)|Easy|
|0253|[Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii)|[](./answer/0253)|Medium|
|0254|[Factor Combinations](https://leetcode.com/problems/factor-combinations)|[](./answer/0254)|Medium|
|0255|[Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree)|[](./answer/0255)|Medium|
|0256|[Paint House](https://leetcode.com/problems/paint-house)|[](./answer/0256)|Easy|
|0257|[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths)|[](./answer/0257)|Easy|
|0258|[Add Digits](https://leetcode.com/problems/add-digits)|[](./answer/0258)|Easy|
|0259|[3Sum Smaller](https://leetcode.com/problems/3sum-smaller)|[](./answer/0259)|Medium|
|0260|[Single Number III](https://leetcode.com/problems/single-number-iii)|[Python](./answer/0260)|Medium|
|0261|[Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree)|[](./answer/0261)|Medium|
|0262|[Trips and Users](https://leetcode.com/problems/trips-and-users)|[](./answer/0262)|Hard|
|0263|[Ugly Number](https://leetcode.com/problems/ugly-number)|[](./answer/0263)|Easy|
|0264|[Ugly Number II](https://leetcode.com/problems/ugly-number-ii)|[](./answer/0264)|Medium|
|0265|[Paint House II](https://leetcode.com/problems/paint-house-ii)|[](./answer/0265)|Hard|
|0266|[Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation)|[](./answer/0266)|Easy|
|0267|[Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii)|[](./answer/0267)|Medium|
|0268|[Missing Number](https://leetcode.com/problems/missing-number)|[](./answer/0268)|Easy|
|0269|[Alien Dictionary](https://leetcode.com/problems/alien-dictionary)|[](./answer/0269)|Hard|
|0270|[Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value)|[](./answer/0270)|Easy|
|0271|[Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings)|[](./answer/0271)|Medium|
|0272|[Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii)|[](./answer/0272)|Hard|
|0273|[Integer to English Words](https://leetcode.com/problems/integer-to-english-words)|[](./answer/0273)|Hard|
|0274|[H-Index](https://leetcode.com/problems/h-index)|[](./answer/0274)|Medium|
|0275|[H-Index II](https://leetcode.com/problems/h-index-ii)|[](./answer/0275)|Medium|
|0276|[Paint Fence](https://leetcode.com/problems/paint-fence)|[](./answer/0276)|Easy|
|0277|[Find the Celebrity](https://leetcode.com/problems/find-the-celebrity)|[](./answer/0277)|Medium|
|0278|[First Bad Version](https://leetcode.com/problems/first-bad-version)|[](./answer/0278)|Easy|
|0279|[Perfect Squares](https://leetcode.com/problems/perfect-squares)|[](./answer/0279)|Medium|
|0280|[Wiggle Sort](https://leetcode.com/problems/wiggle-sort)|[](./answer/0280)|Medium|
|0281|[Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator)|[](./answer/0281)|Medium|
|0282|[Expression Add Operators](https://leetcode.com/problems/expression-add-operators)|[](./answer/0282)|Hard|
|0283|[Move Zeroes](https://leetcode.com/problems/move-zeroes)|[](./answer/0283)|Easy|
|0284|[Peeking Iterator](https://leetcode.com/problems/peeking-iterator)|[](./answer/0284)|Medium|
|0285|[Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst)|[](./answer/0285)|Medium|
|0286|[Walls and Gates](https://leetcode.com/problems/walls-and-gates)|[](./answer/0286)|Medium|
|0287|[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number)|[JavaScript](./answer/0287)|Medium|
|0288|[Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation)|[](./answer/0288)|Medium|
|0289|[Game of Life](https://leetcode.com/problems/game-of-life)|[](./answer/0289)|Medium|
|0290|[Word Pattern](https://leetcode.com/problems/word-pattern)|[](./answer/0290)|Easy|
|0291|[Word Pattern II](https://leetcode.com/problems/word-pattern-ii)|[](./answer/0291)|Hard|
|0292|[Nim Game](https://leetcode.com/problems/nim-game)|[](./answer/0292)|Easy|
|0293|[Flip Game](https://leetcode.com/problems/flip-game)|[](./answer/0293)|Easy|
|0294|[Flip Game II](https://leetcode.com/problems/flip-game-ii)|[](./answer/0294)|Medium|
|0295|[Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream)|[](./answer/0295)|Hard|
|0296|[Best Meeting Point](https://leetcode.com/problems/best-meeting-point)|[](./answer/0296)|Hard|
|0297|[Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree)|[](./answer/0297)|Hard|
|0298|[Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence)|[](./answer/0298)|Medium|
|0299|[Bulls and Cows](https://leetcode.com/problems/bulls-and-cows)|[](./answer/0299)|Medium|
|0300|[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence)|[](./answer/0300)|Medium|
|0301|[Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses)|[](./answer/0301)|Hard|
|0302|[Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels)|[](./answer/0302)|Hard|
|0303|[Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable)|[Python](./answer/0303)|Easy|
|0304|[Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable)|[](./answer/0304)|Medium|
|0305|[Number of Islands II](https://leetcode.com/problems/number-of-islands-ii)|[](./answer/0305)|Hard|
|0306|[Additive Number](https://leetcode.com/problems/additive-number)|[](./answer/0306)|Medium|
|0307|[Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable)|[](./answer/0307)|Medium|
|0308|[Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable)|[](./answer/0308)|Hard|
|0309|[Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown)|[](./answer/0309)|Medium|
|0310|[Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees)|[](./answer/0310)|Medium|
|0311|[Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication)|[](./answer/0311)|Medium|
|0312|[Burst Balloons](https://leetcode.com/problems/burst-balloons)|[](./answer/0312)|Hard|
|0313|[Super Ugly Number](https://leetcode.com/problems/super-ugly-number)|[](./answer/0313)|Medium|
|0314|[Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal)|[](./answer/0314)|Medium|
|0315|[Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self)|[](./answer/0315)|Hard|
|0316|[Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters)|[](./answer/0316)|Hard|
|0317|[Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings)|[](./answer/0317)|Hard|
|0318|[Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths)|[](./answer/0318)|Medium|
|0319|[Bulb Switcher](https://leetcode.com/problems/bulb-switcher)|[](./answer/0319)|Medium|
|0320|[Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation)|[](./answer/0320)|Medium|
|0321|[Create Maximum Number](https://leetcode.com/problems/create-maximum-number)|[](./answer/0321)|Hard|
|0322|[Coin Change](https://leetcode.com/problems/coin-change)|[](./answer/0322)|Medium|
|0323|[Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph)|[](./answer/0323)|Medium|
|0324|[Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii)|[](./answer/0324)|Medium|
|0325|[Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k)|[](./answer/0325)|Medium|
|0326|[Power of Three](https://leetcode.com/problems/power-of-three)|[Python](./answer/0326)|Easy|
|0327|[Count of Range Sum](https://leetcode.com/problems/count-of-range-sum)|[](./answer/0327)|Hard|
|0328|[Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list)|[](./answer/0328)|Medium|
|0329|[Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix)|[](./answer/0329)|Hard|
|0330|[Patching Array](https://leetcode.com/problems/patching-array)|[](./answer/0330)|Hard|
|0331|[Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree)|[](./answer/0331)|Medium|
|0332|[Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary)|[](./answer/0332)|Medium|
|0333|[Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree)|[](./answer/0333)|Medium|
|0334|[Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence)|[](./answer/0334)|Medium|
|0335|[Self Crossing](https://leetcode.com/problems/self-crossing)|[](./answer/0335)|Hard|
|0336|[Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs)|[](./answer/0336)|Hard|
|0337|[House Robber III](https://leetcode.com/problems/house-robber-iii)|[](./answer/0337)|Medium|
|0338|[Counting Bits](https://leetcode.com/problems/counting-bits)|[Python](./answer/0338)|Medium|
|0339|[Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum)|[](./answer/0339)|Easy|
|0340|[Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters)|[](./answer/0340)|Hard|
|0341|[Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator)|[](./answer/0341)|Medium|
|0342|[Power of Four](https://leetcode.com/problems/power-of-four)|[](./answer/0342)|Easy|
|0343|[Integer Break](https://leetcode.com/problems/integer-break)|[](./answer/0343)|Medium|
|0344|[Reverse String](https://leetcode.com/problems/reverse-string)|[](./answer/0344)|Easy|
|0345|[Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string)|[](./answer/0345)|Easy|
|0346|[Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream)|[](./answer/0346)|Easy|
|0347|[Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements)|[Python](./answer/0347)|Medium|
|0348|[Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe)|[](./answer/0348)|Medium|
|0349|[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays)|[](./answer/0349)|Easy|
|0350|[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii)|[JavaScript](./answer/0350)|Easy|
|0351|[Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns)|[](./answer/0351)|Medium|
|0352|[Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals)|[](./answer/0352)|Hard|
|0353|[Design Snake Game](https://leetcode.com/problems/design-snake-game)|[](./answer/0353)|Medium|
|0354|[Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes)|[](./answer/0354)|Hard|
|0355|[Design Twitter](https://leetcode.com/problems/design-twitter)|[](./answer/0355)|Medium|
|0356|[Line Reflection](https://leetcode.com/problems/line-reflection)|[](./answer/0356)|Medium|
|0357|[Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits)|[](./answer/0357)|Medium|
|0358|[Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart)|[](./answer/0358)|Hard|
|0359|[Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter)|[](./answer/0359)|Easy|
|0360|[Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array)|[](./answer/0360)|Medium|
|0361|[Bomb Enemy](https://leetcode.com/problems/bomb-enemy)|[](./answer/0361)|Medium|
|0362|[Design Hit Counter](https://leetcode.com/problems/design-hit-counter)|[](./answer/0362)|Medium|
|0363|[Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k)|[](./answer/0363)|Hard|
|0364|[Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii)|[](./answer/0364)|Medium|
|0365|[Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem)|[](./answer/0365)|Medium|
|0366|[Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree)|[](./answer/0366)|Medium|
|0367|[Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square)|[](./answer/0367)|Easy|
|0368|[Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset)|[](./answer/0368)|Medium|
|0369|[Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list)|[](./answer/0369)|Medium|
|0370|[Range Addition](https://leetcode.com/problems/range-addition)|[](./answer/0370)|Medium|
|0371|[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers)|[](./answer/0371)|Easy|
|0372|[Super Pow](https://leetcode.com/problems/super-pow)|[](./answer/0372)|Medium|
|0373|[Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums)|[](./answer/0373)|Medium|
|0374|[Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower)|[](./answer/0374)|Easy|
|0375|[Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii)|[](./answer/0375)|Medium|
|0376|[Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence)|[](./answer/0376)|Medium|
|0377|[Combination Sum IV](https://leetcode.com/problems/combination-sum-iv)|[](./answer/0377)|Medium|
|0378|[Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix)|[](./answer/0378)|Medium|
|0379|[Design Phone Directory](https://leetcode.com/problems/design-phone-directory)|[](./answer/0379)|Medium|
|0380|[Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1)|[](./answer/0380)|Medium|
|0381|[Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed)|[](./answer/0381)|Hard|
|0382|[Linked List Random Node](https://leetcode.com/problems/linked-list-random-node)|[](./answer/0382)|Medium|
|0383|[Ransom Note](https://leetcode.com/problems/ransom-note)|[](./answer/0383)|Easy|
|0384|[Shuffle an Array](https://leetcode.com/problems/shuffle-an-array)|[](./answer/0384)|Medium|
|0385|[Mini Parser](https://leetcode.com/problems/mini-parser)|[](./answer/0385)|Medium|
|0386|[Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers)|[](./answer/0386)|Medium|
|0387|[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string)|[](./answer/0387)|Easy|
|0388|[Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path)|[](./answer/0388)|Medium|
|0389|[Find the Difference](https://leetcode.com/problems/find-the-difference)|[](./answer/0389)|Easy|
|0390|[Elimination Game](https://leetcode.com/problems/elimination-game)|[](./answer/0390)|Medium|
|0391|[Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle)|[](./answer/0391)|Hard|
|0392|[Is Subsequence](https://leetcode.com/problems/is-subsequence)|[](./answer/0392)|Medium|
|0393|[UTF-8 Validation](https://leetcode.com/problems/utf-8-validation)|[JavaScript](./answer/0393)|Medium|
|0394|[Decode String](https://leetcode.com/problems/decode-string)|[](./answer/0394)|Medium|
|0395|[Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters)|[](./answer/0395)|Medium|
|0396|[Rotate Function](https://leetcode.com/problems/rotate-function)|[](./answer/0396)|Medium|
|0397|[Integer Replacement](https://leetcode.com/problems/integer-replacement)|[](./answer/0397)|Medium|
|0398|[Random Pick Index](https://leetcode.com/problems/random-pick-index)|[](./answer/0398)|Medium|
|0399|[Evaluate Division](https://leetcode.com/problems/evaluate-division)|[](./answer/0399)|Medium|
|0400|[Nth Digit](https://leetcode.com/problems/nth-digit)|[](./answer/0400)|Easy|
|0401|[Binary Watch](https://leetcode.com/problems/binary-watch)|[](./answer/0401)|Easy|
|0402|[Remove K Digits](https://leetcode.com/problems/remove-k-digits)|[](./answer/0402)|Medium|
|0403|[Frog Jump](https://leetcode.com/problems/frog-jump)|[](./answer/0403)|Hard|
|0404|[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves)|[](./answer/0404)|Easy|
|0405|[Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal)|[](./answer/0405)|Easy|
|0406|[Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height)|[](./answer/0406)|Medium|
|0407|[Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii)|[](./answer/0407)|Hard|
|0408|[Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation)|[](./answer/0408)|Easy|
|0409|[Longest Palindrome](https://leetcode.com/problems/longest-palindrome)|[](./answer/0409)|Easy|
|0410|[Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum)|[](./answer/0410)|Hard|
|0411|[Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation)|[](./answer/0411)|Hard|
|0412|[Fizz Buzz](https://leetcode.com/problems/fizz-buzz)|[](./answer/0412)|Easy|
|0413|[Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices)|[](./answer/0413)|Medium|
|0414|[Third Maximum Number](https://leetcode.com/problems/third-maximum-number)|[Python](./answer/0414)|Easy|
|0415|[Add Strings](https://leetcode.com/problems/add-strings)|[](./answer/0415)|Easy|
|0416|[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum)|[](./answer/0416)|Medium|
|0417|[Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow)|[](./answer/0417)|Medium|
|0418|[Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting)|[](./answer/0418)|Medium|
|0419|[Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board)|[](./answer/0419)|Medium|
|0420|[Strong Password Checker](https://leetcode.com/problems/strong-password-checker)|[](./answer/0420)|Hard|
|0421|[Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array)|[](./answer/0421)|Medium|
|0422|[Valid Word Square](https://leetcode.com/problems/valid-word-square)|[](./answer/0422)|Easy|
|0423|[Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english)|[](./answer/0423)|Medium|
|0424|[Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement)|[](./answer/0424)|Medium|
|0425|[Word Squares](https://leetcode.com/problems/word-squares)|[](./answer/0425)|Hard|
|0426|[Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list)|[](./answer/0426)|Medium|
|0427|[Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree)|[](./answer/0427)|Medium|
|0428|[Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree)|[](./answer/0428)|Hard|
|0429|[N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal)|[](./answer/0429)|Easy|
|0430|[Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list)|[](./answer/0430)|Medium|
|0431|[Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree)|[](./answer/0431)|Hard|
|0432|[All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure)|[JavaScript](./answer/0432)|Hard|
|0433|[Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation)|[](./answer/0433)|Medium|
|0434|[Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string)|[](./answer/0434)|Easy|
|0435|[Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals)|[](./answer/0435)|Medium|
|0436|[Find Right Interval](https://leetcode.com/problems/find-right-interval)|[](./answer/0436)|Medium|
|0437|[Path Sum III](https://leetcode.com/problems/path-sum-iii)|[](./answer/0437)|Easy|
|0438|[Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string)|[](./answer/0438)|Easy|
|0439|[Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser)|[](./answer/0439)|Medium|
|0440|[K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order)|[](./answer/0440)|Hard|
|0441|[Arranging Coins](https://leetcode.com/problems/arranging-coins)|[](./answer/0441)|Easy|
|0442|[Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array)|[](./answer/0442)|Medium|
|0443|[String Compression](https://leetcode.com/problems/string-compression)|[JavaScript](./answer/0443)|Easy|
|0444|[Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction)|[](./answer/0444)|Medium|
|0445|[Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii)|[Python](./answer/0445)|Medium|
|0446|[Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence)|[](./answer/0446)|Hard|
|0447|[Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs)|[](./answer/0447)|Easy|
|0448|[Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array)|[](./answer/0448)|Easy|
|0449|[Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst)|[](./answer/0449)|Medium|
|0450|[Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst)|[](./answer/0450)|Medium|
|0451|[Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency)|[Python](./answer/0451)|Medium|
|0452|[Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons)|[](./answer/0452)|Medium|
|0453|[Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements)|[](./answer/0453)|Easy|
|0454|[4Sum II](https://leetcode.com/problems/4sum-ii)|[](./answer/0454)|Medium|
|0455|[Assign Cookies](https://leetcode.com/problems/assign-cookies)|[](./answer/0455)|Easy|
|0456|[132 Pattern](https://leetcode.com/problems/132-pattern)|[](./answer/0456)|Medium|
|0457|[Circular Array Loop](https://leetcode.com/problems/circular-array-loop)|[](./answer/0457)|Medium|
|0458|[Poor Pigs](https://leetcode.com/problems/poor-pigs)|[](./answer/0458)|Hard|
|0459|[Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern)|[](./answer/0459)|Easy|
|0460|[LFU Cache](https://leetcode.com/problems/lfu-cache)|[](./answer/0460)|Hard|
|0461|[Hamming Distance](https://leetcode.com/problems/hamming-distance)|[](./answer/0461)|Easy|
|0462|[Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii)|[](./answer/0462)|Medium|
|0463|[Island Perimeter](https://leetcode.com/problems/island-perimeter)|[Python](./answer/0463)|Easy|
|0464|[Can I Win](https://leetcode.com/problems/can-i-win)|[](./answer/0464)|Medium|
|0465|[Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing)|[](./answer/0465)|Hard|
|0466|[Count The Repetitions](https://leetcode.com/problems/count-the-repetitions)|[](./answer/0466)|Hard|
|0467|[Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string)|[](./answer/0467)|Medium|
|0468|[Validate IP Address](https://leetcode.com/problems/validate-ip-address)|[](./answer/0468)|Medium|
|0469|[Convex Polygon](https://leetcode.com/problems/convex-polygon)|[](./answer/0469)|Medium|
|0470|[Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7)|[](./answer/0470)|Medium|
|0471|[Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length)|[](./answer/0471)|Hard|
|0472|[Concatenated Words](https://leetcode.com/problems/concatenated-words)|[](./answer/0472)|Hard|
|0473|[Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square)|[](./answer/0473)|Medium|
|0474|[Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes)|[](./answer/0474)|Medium|
|0475|[Heaters](https://leetcode.com/problems/heaters)|[](./answer/0475)|Easy|
|0476|[Number Complement](https://leetcode.com/problems/number-complement)|[](./answer/0476)|Easy|
|0477|[Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance)|[](./answer/0477)|Medium|
|0478|[Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle)|[](./answer/0478)|Medium|
|0479|[Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product)|[](./answer/0479)|Hard|
|0480|[Sliding Window Median](https://leetcode.com/problems/sliding-window-median)|[](./answer/0480)|Hard|
|0481|[Magical String](https://leetcode.com/problems/magical-string)|[](./answer/0481)|Medium|
|0482|[License Key Formatting](https://leetcode.com/problems/license-key-formatting)|[](./answer/0482)|Easy|
|0483|[Smallest Good Base](https://leetcode.com/problems/smallest-good-base)|[](./answer/0483)|Hard|
|0484|[Find Permutation](https://leetcode.com/problems/find-permutation)|[](./answer/0484)|Medium|
|0485|[Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones)|[](./answer/0485)|Easy|
|0486|[Predict the Winner](https://leetcode.com/problems/predict-the-winner)|[](./answer/0486)|Medium|
|0487|[Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii)|[](./answer/0487)|Medium|
|0488|[Zuma Game](https://leetcode.com/problems/zuma-game)|[](./answer/0488)|Hard|
|0489|[Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner)|[](./answer/0489)|Hard|
|0490|[The Maze](https://leetcode.com/problems/the-maze)|[](./answer/0490)|Medium|
|0491|[Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences)|[](./answer/0491)|Medium|
|0492|[Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle)|[](./answer/0492)|Easy|
|0493|[Reverse Pairs](https://leetcode.com/problems/reverse-pairs)|[](./answer/0493)|Hard|
|0494|[Target Sum](https://leetcode.com/problems/target-sum)|[](./answer/0494)|Medium|
|0495|[Teemo Attacking](https://leetcode.com/problems/teemo-attacking)|[](./answer/0495)|Medium|
|0496|[Next Greater Element I](https://leetcode.com/problems/next-greater-element-i)|[](./answer/0496)|Easy|
|0497|[Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles)|[](./answer/0497)|Medium|
|0498|[Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse)|[](./answer/0498)|Medium|
|0499|[The Maze III](https://leetcode.com/problems/the-maze-iii)|[](./answer/0499)|Hard|
|0500|[Keyboard Row](https://leetcode.com/problems/keyboard-row)|[](./answer/0500)|Easy|
|0501|[Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree)|[](./answer/0501)|Easy|
|0502|[IPO](https://leetcode.com/problems/ipo)|[](./answer/0502)|Hard|
|0503|[Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii)|[](./answer/0503)|Medium|
|0504|[Base 7](https://leetcode.com/problems/base-7)|[](./answer/0504)|Easy|
|0505|[The Maze II](https://leetcode.com/problems/the-maze-ii)|[](./answer/0505)|Medium|
|0506|[Relative Ranks](https://leetcode.com/problems/relative-ranks)|[](./answer/0506)|Easy|
|0507|[Perfect Number](https://leetcode.com/problems/perfect-number)|[](./answer/0507)|Easy|
|0508|[Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum)|[](./answer/0508)|Medium|
|0509|[Fibonacci Number](https://leetcode.com/problems/fibonacci-number)|[](./answer/0509)|Easy|
|0510|[Inorder Successor in BST II](https://leetcode.com/problems/inorder-successor-in-bst-ii)|[](./answer/0510)|Medium|
|0511|[Game Play Analysis I](https://leetcode.com/problems/game-play-analysis-i)|[](./answer/0511)|Easy|
|0512|[Game Play Analysis II](https://leetcode.com/problems/game-play-analysis-ii)|[](./answer/0512)|Easy|
|0513|[Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value)|[](./answer/0513)|Medium|
|0514|[Freedom Trail](https://leetcode.com/problems/freedom-trail)|[](./answer/0514)|Hard|
|0515|[Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row)|[](./answer/0515)|Medium|
|0516|[Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence)|[](./answer/0516)|Medium|
|0517|[Super Washing Machines](https://leetcode.com/problems/super-washing-machines)|[](./answer/0517)|Hard|
|0518|[Coin Change 2](https://leetcode.com/problems/coin-change-2)|[](./answer/0518)|Medium|
|0519|[Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix)|[](./answer/0519)|Medium|
|0520|[Detect Capital](https://leetcode.com/problems/detect-capital)|[](./answer/0520)|Easy|
|0521|[Longest Uncommon Subsequence I ](https://leetcode.com/problems/longest-uncommon-subsequence-i)|[](./answer/0521)|Easy|
|0522|[Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii)|[](./answer/0522)|Medium|
|0523|[Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum)|[](./answer/0523)|Medium|
|0524|[Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting)|[Python](./answer/0524)|Medium|
|0525|[Contiguous Array](https://leetcode.com/problems/contiguous-array)|[](./answer/0525)|Medium|
|0526|[Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement)|[](./answer/0526)|Medium|
|0527|[Word Abbreviation](https://leetcode.com/problems/word-abbreviation)|[](./answer/0527)|Hard|
|0528|[Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight)|[](./answer/0528)|Medium|
|0529|[Minesweeper](https://leetcode.com/problems/minesweeper)|[](./answer/0529)|Medium|
|0530|[Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst)|[](./answer/0530)|Easy|
|0531|[Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i)|[](./answer/0531)|Medium|
|0532|[K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array)|[](./answer/0532)|Easy|
|0533|[Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii)|[](./answer/0533)|Medium|
|0534|[Game Play Analysis III](https://leetcode.com/problems/game-play-analysis-iii)|[](./answer/0534)|Medium|
|0535|[Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl)|[](./answer/0535)|Medium|
|0536|[Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string)|[](./answer/0536)|Medium|
|0537|[Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication)|[](./answer/0537)|Medium|
|0538|[Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree)|[](./answer/0538)|Easy|
|0539|[Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference)|[](./answer/0539)|Medium|
|0540|[Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array)|[](./answer/0540)|Medium|
|0541|[Reverse String II](https://leetcode.com/problems/reverse-string-ii)|[](./answer/0541)|Easy|
|0542|[01 Matrix](https://leetcode.com/problems/01-matrix)|[](./answer/0542)|Medium|
|0543|[Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree)|[](./answer/0543)|Easy|
|0544|[Output Contest Matches](https://leetcode.com/problems/output-contest-matches)|[](./answer/0544)|Medium|
|0545|[Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree)|[](./answer/0545)|Medium|
|0546|[Remove Boxes](https://leetcode.com/problems/remove-boxes)|[](./answer/0546)|Hard|
|0547|[Friend Circles](https://leetcode.com/problems/friend-circles)|[JavaScript](./answer/0547)|Medium|
|0548|[Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum)|[](./answer/0548)|Medium|
|0549|[Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii)|[](./answer/0549)|Medium|
|0550|[Game Play Analysis IV](https://leetcode.com/problems/game-play-analysis-iv)|[](./answer/0550)|Medium|
|0551|[Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i)|[JavaScript](./answer/0551)|Easy|
|0552|[Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii)|[](./answer/0552)|Hard|
|0553|[Optimal Division](https://leetcode.com/problems/optimal-division)|[](./answer/0553)|Medium|
|0554|[Brick Wall](https://leetcode.com/problems/brick-wall)|[](./answer/0554)|Medium|
|0555|[Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings)|[](./answer/0555)|Medium|
|0556|[Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii)|[](./answer/0556)|Medium|
|0557|[Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii)|[](./answer/0557)|Easy|
|0558|[Quad Tree Intersection](https://leetcode.com/problems/quad-tree-intersection)|[](./answer/0558)|Easy|
|0559|[Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree)|[](./answer/0559)|Easy|
|0560|[Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k)|[](./answer/0560)|Medium|
|0561|[Array Partition I](https://leetcode.com/problems/array-partition-i)|[](./answer/0561)|Easy|
|0562|[Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix)|[](./answer/0562)|Medium|
|0563|[Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt)|[](./answer/0563)|Easy|
|0564|[Find the Closest Palindrome](https://leetcode.com/problems/find-the-closest-palindrome)|[](./answer/0564)|Hard|
|0565|[Array Nesting](https://leetcode.com/problems/array-nesting)|[JavaScript](./answer/0565)|Medium|
|0566|[Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix)|[](./answer/0566)|Easy|
|0567|[Permutation in String](https://leetcode.com/problems/permutation-in-string)|[](./answer/0567)|Medium|
|0568|[Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days)|[](./answer/0568)|Hard|
|0569|[Median Employee Salary](https://leetcode.com/problems/median-employee-salary)|[](./answer/0569)|Hard|
|0570|[Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports)|[](./answer/0570)|Medium|
|0571|[Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers)|[](./answer/0571)|Hard|
|0572|[Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree)|[](./answer/0572)|Easy|
|0573|[Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation)|[](./answer/0573)|Medium|
|0574|[Winning Candidate](https://leetcode.com/problems/winning-candidate)|[](./answer/0574)|Medium|
|0575|[Distribute Candies](https://leetcode.com/problems/distribute-candies)|[](./answer/0575)|Easy|
|0576|[Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths)|[](./answer/0576)|Medium|
|0577|[Employee Bonus](https://leetcode.com/problems/employee-bonus)|[](./answer/0577)|Easy|
|0578|[Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question)|[](./answer/0578)|Medium|
|0579|[Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee)|[](./answer/0579)|Hard|
|0580|[Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments)|[](./answer/0580)|Medium|
|0581|[Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray)|[](./answer/0581)|Easy|
|0582|[Kill Process](https://leetcode.com/problems/kill-process)|[](./answer/0582)|Medium|
|0583|[Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings)|[](./answer/0583)|Medium|
|0584|[Find Customer Referee](https://leetcode.com/problems/find-customer-referee)|[](./answer/0584)|Easy|
|0585|[Investments in 2016](https://leetcode.com/problems/investments-in-2016)|[](./answer/0585)|Medium|
|0586|[Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders)|[](./answer/0586)|Easy|
|0587|[Erect the Fence](https://leetcode.com/problems/erect-the-fence)|[](./answer/0587)|Hard|
|0588|[Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system)|[](./answer/0588)|Hard|
|0589|[N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal)|[](./answer/0589)|Easy|
|0590|[N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal)|[](./answer/0590)|Easy|
|0591|[Tag Validator](https://leetcode.com/problems/tag-validator)|[](./answer/0591)|Hard|
|0592|[Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction)|[](./answer/0592)|Medium|
|0593|[Valid Square](https://leetcode.com/problems/valid-square)|[](./answer/0593)|Medium|
|0594|[Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence)|[](./answer/0594)|Easy|
|0595|[Big Countries](https://leetcode.com/problems/big-countries)|[SQL](./answer/0595)|Easy|
|0596|[Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students)|[](./answer/0596)|Easy|
|0597|[Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate)|[](./answer/0597)|Easy|
|0598|[Range Addition II](https://leetcode.com/problems/range-addition-ii)|[](./answer/0598)|Easy|
|0599|[Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists)|[](./answer/0599)|Easy|
|0600|[Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones)|[](./answer/0600)|Hard|
|0601|[Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium)|[](./answer/0601)|Hard|
|0602|[Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends)|[](./answer/0602)|Medium|
|0603|[Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats)|[](./answer/0603)|Easy|
|0604|[Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator)|[](./answer/0604)|Easy|
|0605|[Can Place Flowers](https://leetcode.com/problems/can-place-flowers)|[](./answer/0605)|Easy|
|0606|[Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree)|[](./answer/0606)|Easy|
|0607|[Sales Person](https://leetcode.com/problems/sales-person)|[](./answer/0607)|Easy|
|0608|[Tree Node](https://leetcode.com/problems/tree-node)|[](./answer/0608)|Medium|
|0609|[Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system)|[](./answer/0609)|Medium|
|0610|[Triangle Judgement](https://leetcode.com/problems/triangle-judgement)|[](./answer/0610)|Easy|
|0611|[Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number)|[](./answer/0611)|Medium|
|0612|[Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane)|[](./answer/0612)|Medium|
|0613|[Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line)|[](./answer/0613)|Easy|
|0614|[Second Degree Follower](https://leetcode.com/problems/second-degree-follower)|[](./answer/0614)|Medium|
|0615|[Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company)|[](./answer/0615)|Hard|
|0616|[Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string)|[](./answer/0616)|Medium|
|0617|[Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees)|[](./answer/0617)|Easy|
|0618|[Students Report By Geography](https://leetcode.com/problems/students-report-by-geography)|[](./answer/0618)|Hard|
|0619|[Biggest Single Number](https://leetcode.com/problems/biggest-single-number)|[](./answer/0619)|Easy|
|0620|[Not Boring Movies](https://leetcode.com/problems/not-boring-movies)|[](./answer/0620)|Easy|
|0621|[Task Scheduler](https://leetcode.com/problems/task-scheduler)|[](./answer/0621)|Medium|
|0622|[Design Circular Queue](https://leetcode.com/problems/design-circular-queue)|[](./answer/0622)|Medium|
|0623|[Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree)|[](./answer/0623)|Medium|
|0624|[Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays)|[](./answer/0624)|Easy|
|0625|[Minimum Factorization](https://leetcode.com/problems/minimum-factorization)|[](./answer/0625)|Medium|
|0626|[Exchange Seats](https://leetcode.com/problems/exchange-seats)|[](./answer/0626)|Medium|
|0627|[Swap Salary](https://leetcode.com/problems/swap-salary)|[](./answer/0627)|Easy|
|0628|[Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers)|[](./answer/0628)|Easy|
|0629|[K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array)|[](./answer/0629)|Hard|
|0630|[Course Schedule III](https://leetcode.com/problems/course-schedule-iii)|[](./answer/0630)|Hard|
|0631|[Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula)|[](./answer/0631)|Hard|
|0632|[Smallest Range](https://leetcode.com/problems/smallest-range)|[](./answer/0632)|Hard|
|0633|[Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers)|[](./answer/0633)|Easy|
|0634|[Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array)|[](./answer/0634)|Medium|
|0635|[Design Log Storage System](https://leetcode.com/problems/design-log-storage-system)|[](./answer/0635)|Medium|
|0636|[Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions)|[](./answer/0636)|Medium|
|0637|[Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree)|[](./answer/0637)|Easy|
|0638|[Shopping Offers](https://leetcode.com/problems/shopping-offers)|[](./answer/0638)|Medium|
|0639|[Decode Ways II](https://leetcode.com/problems/decode-ways-ii)|[](./answer/0639)|Hard|
|0640|[Solve the Equation](https://leetcode.com/problems/solve-the-equation)|[](./answer/0640)|Medium|
|0641|[Design Circular Deque](https://leetcode.com/problems/design-circular-deque)|[](./answer/0641)|Medium|
|0642|[Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system)|[](./answer/0642)|Hard|
|0643|[Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i)|[](./answer/0643)|Easy|
|0644|[Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii)|[](./answer/0644)|Hard|
|0645|[Set Mismatch](https://leetcode.com/problems/set-mismatch)|[](./answer/0645)|Easy|
|0646|[Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain)|[](./answer/0646)|Medium|
|0647|[Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings)|[](./answer/0647)|Medium|
|0648|[Replace Words](https://leetcode.com/problems/replace-words)|[](./answer/0648)|Medium|
|0649|[Dota2 Senate](https://leetcode.com/problems/dota2-senate)|[](./answer/0649)|Medium|
|0650|[2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard)|[](./answer/0650)|Medium|
|0651|[4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard)|[](./answer/0651)|Medium|
|0652|[Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees)|[](./answer/0652)|Medium|
|0653|[Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst)|[](./answer/0653)|Easy|
|0654|[Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree)|[](./answer/0654)|Medium|
|0655|[Print Binary Tree](https://leetcode.com/problems/print-binary-tree)|[](./answer/0655)|Medium|
|0656|[Coin Path](https://leetcode.com/problems/coin-path)|[](./answer/0656)|Hard|
|0657|[Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin)|[](./answer/0657)|Easy|
|0658|[Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements)|[](./answer/0658)|Medium|
|0659|[Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences)|[](./answer/0659)|Medium|
|0660|[Remove 9](https://leetcode.com/problems/remove-9)|[](./answer/0660)|Hard|
|0661|[Image Smoother](https://leetcode.com/problems/image-smoother)|[](./answer/0661)|Easy|
|0662|[Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree)|[](./answer/0662)|Medium|
|0663|[Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition)|[](./answer/0663)|Medium|
|0664|[Strange Printer](https://leetcode.com/problems/strange-printer)|[](./answer/0664)|Hard|
|0665|[Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array)|[](./answer/0665)|Easy|
|0666|[Path Sum IV](https://leetcode.com/problems/path-sum-iv)|[](./answer/0666)|Medium|
|0667|[Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii)|[](./answer/0667)|Medium|
|0668|[Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table)|[](./answer/0668)|Hard|
|0669|[Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree)|[](./answer/0669)|Easy|
|0670|[Maximum Swap](https://leetcode.com/problems/maximum-swap)|[JavaScript](./answer/0670)|Medium|
|0671|[Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree)|[](./answer/0671)|Easy|
|0672|[Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii)|[](./answer/0672)|Medium|
|0673|[Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence)|[](./answer/0673)|Medium|
|0674|[Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence)|[](./answer/0674)|Easy|
|0675|[Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event)|[](./answer/0675)|Hard|
|0676|[Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary)|[](./answer/0676)|Medium|
|0677|[Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs)|[](./answer/0677)|Medium|
|0678|[Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string)|[](./answer/0678)|Medium|
|0679|[24 Game](https://leetcode.com/problems/24-game)|[](./answer/0679)|Hard|
|0680|[Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii)|[](./answer/0680)|Easy|
|0681|[Next Closest Time](https://leetcode.com/problems/next-closest-time)|[](./answer/0681)|Medium|
|0682|[Baseball Game](https://leetcode.com/problems/baseball-game)|[](./answer/0682)|Easy|
|0683|[K Empty Slots](https://leetcode.com/problems/k-empty-slots)|[](./answer/0683)|Hard|
|0684|[Redundant Connection](https://leetcode.com/problems/redundant-connection)|[](./answer/0684)|Medium|
|0685|[Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii)|[](./answer/0685)|Hard|
|0686|[Repeated String Match](https://leetcode.com/problems/repeated-string-match)|[JavaScript](./answer/0686)|Easy|
|0687|[Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path)|[](./answer/0687)|Easy|
|0688|[Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard)|[](./answer/0688)|Medium|
|0689|[Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays)|[](./answer/0689)|Hard|
|0690|[Employee Importance](https://leetcode.com/problems/employee-importance)|[](./answer/0690)|Easy|
|0691|[Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word)|[](./answer/0691)|Hard|
|0692|[Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words)|[](./answer/0692)|Medium|
|0693|[Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits)|[](./answer/0693)|Easy|
|0694|[Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands)|[](./answer/0694)|Medium|
|0695|[Max Area of Island](https://leetcode.com/problems/max-area-of-island)|[JavaScript](./answer/0695)|Medium|
|0696|[Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings)|[](./answer/0696)|Easy|
|0697|[Degree of an Array](https://leetcode.com/problems/degree-of-an-array)|[](./answer/0697)|Easy|
|0698|[Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets)|[](./answer/0698)|Medium|
|0699|[Falling Squares](https://leetcode.com/problems/falling-squares)|[](./answer/0699)|Hard|
|0700|[Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree)|[](./answer/0700)|Easy|
|0701|[Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree)|[](./answer/0701)|Medium|
|0702|[Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size)|[](./answer/0702)|Medium|
|0703|[Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream)|[](./answer/0703)|Easy|
|0704|[Binary Search](https://leetcode.com/problems/binary-search)|[](./answer/0704)|Easy|
|0705|[Design HashSet](https://leetcode.com/problems/design-hashset)|[](./answer/0705)|Easy|
|0706|[Design HashMap](https://leetcode.com/problems/design-hashmap)|[](./answer/0706)|Easy|
|0707|[Design Linked List](https://leetcode.com/problems/design-linked-list)|[](./answer/0707)|Easy|
|0708|[Insert into a Cyclic Sorted List](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list)|[](./answer/0708)|Medium|
|0709|[To Lower Case](https://leetcode.com/problems/to-lower-case)|[JavaScript, Python](./answer/0709)|Easy|
|0710|[Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist)|[](./answer/0710)|Hard|
|0711|[Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii)|[](./answer/0711)|Hard|
|0712|[Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings)|[](./answer/0712)|Medium|
|0713|[Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k)|[](./answer/0713)|Medium|
|0714|[Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee)|[](./answer/0714)|Medium|
|0715|[Range Module](https://leetcode.com/problems/range-module)|[](./answer/0715)|Hard|
|0716|[Max Stack](https://leetcode.com/problems/max-stack)|[](./answer/0716)|Easy|
|0717|[1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters)|[](./answer/0717)|Easy|
|0718|[Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray)|[](./answer/0718)|Medium|
|0719|[Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance)|[](./answer/0719)|Hard|
|0720|[Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary)|[](./answer/0720)|Easy|
|0721|[Accounts Merge](https://leetcode.com/problems/accounts-merge)|[](./answer/0721)|Medium|
|0722|[Remove Comments](https://leetcode.com/problems/remove-comments)|[](./answer/0722)|Medium|
|0723|[Candy Crush](https://leetcode.com/problems/candy-crush)|[](./answer/0723)|Medium|
|0724|[Find Pivot Index](https://leetcode.com/problems/find-pivot-index)|[](./answer/0724)|Easy|
|0725|[Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts)|[](./answer/0725)|Medium|
|0726|[Number of Atoms](https://leetcode.com/problems/number-of-atoms)|[Python](./answer/0726)|Hard|
|0727|[Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence)|[](./answer/0727)|Hard|
|0728|[Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers)|[](./answer/0728)|Easy|
|0729|[My Calendar I](https://leetcode.com/problems/my-calendar-i)|[](./answer/0729)|Medium|
|0730|[Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences)|[](./answer/0730)|Hard|
|0731|[My Calendar II](https://leetcode.com/problems/my-calendar-ii)|[](./answer/0731)|Medium|
|0732|[My Calendar III](https://leetcode.com/problems/my-calendar-iii)|[](./answer/0732)|Hard|
|0733|[Flood Fill](https://leetcode.com/problems/flood-fill)|[](./answer/0733)|Easy|
|0734|[Sentence Similarity](https://leetcode.com/problems/sentence-similarity)|[](./answer/0734)|Easy|
|0735|[Asteroid Collision](https://leetcode.com/problems/asteroid-collision)|[](./answer/0735)|Medium|
|0736|[Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression)|[](./answer/0736)|Hard|
|0737|[Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii)|[](./answer/0737)|Medium|
|0738|[Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits)|[](./answer/0738)|Medium|
|0739|[Daily Temperatures](https://leetcode.com/problems/daily-temperatures)|[](./answer/0739)|Medium|
|0740|[Delete and Earn](https://leetcode.com/problems/delete-and-earn)|[](./answer/0740)|Medium|
|0741|[Cherry Pickup](https://leetcode.com/problems/cherry-pickup)|[](./answer/0741)|Hard|
|0742|[Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree)|[](./answer/0742)|Medium|
|0743|[Network Delay Time](https://leetcode.com/problems/network-delay-time)|[](./answer/0743)|Medium|
|0744|[Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target)|[](./answer/0744)|Easy|
|0745|[Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search)|[](./answer/0745)|Hard|
|0746|[Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs)|[Python](./answer/0746)|Easy|
|0747|[Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others)|[](./answer/0747)|Easy|
|0748|[Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word)|[](./answer/0748)|Easy|
|0749|[Contain Virus](https://leetcode.com/problems/contain-virus)|[](./answer/0749)|Hard|
|0750|[Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles)|[](./answer/0750)|Medium|
|0751|[IP to CIDR](https://leetcode.com/problems/ip-to-cidr)|[](./answer/0751)|Easy|
|0752|[Open the Lock](https://leetcode.com/problems/open-the-lock)|[](./answer/0752)|Medium|
|0753|[Cracking the Safe](https://leetcode.com/problems/cracking-the-safe)|[](./answer/0753)|Hard|
|0754|[Reach a Number](https://leetcode.com/problems/reach-a-number)|[](./answer/0754)|Easy|
|0755|[Pour Water](https://leetcode.com/problems/pour-water)|[](./answer/0755)|Medium|
|0756|[Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix)|[](./answer/0756)|Medium|
|0757|[Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two)|[](./answer/0757)|Hard|
|0758|[Bold Words in String](https://leetcode.com/problems/bold-words-in-string)|[](./answer/0758)|Easy|
|0759|[Employee Free Time](https://leetcode.com/problems/employee-free-time)|[](./answer/0759)|Hard|
|0760|[Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings)|[](./answer/0760)|Easy|
|0761|[Special Binary String](https://leetcode.com/problems/special-binary-string)|[](./answer/0761)|Hard|
|0762|[Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation)|[](./answer/0762)|Easy|
|0763|[Partition Labels](https://leetcode.com/problems/partition-labels)|[](./answer/0763)|Medium|
|0764|[Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign)|[](./answer/0764)|Medium|
|0765|[Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands)|[](./answer/0765)|Hard|
|0766|[Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix)|[](./answer/0766)|Easy|
|0767|[Reorganize String](https://leetcode.com/problems/reorganize-string)|[](./answer/0767)|Medium|
|0768|[Max Chunks To Make Sorted II](https://leetcode.com/problems/max-chunks-to-make-sorted-ii)|[](./answer/0768)|Hard|
|0769|[Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted)|[](./answer/0769)|Medium|
|0770|[Basic Calculator IV](https://leetcode.com/problems/basic-calculator-iv)|[](./answer/0770)|Hard|
|0771|[Jewels and Stones](https://leetcode.com/problems/jewels-and-stones)|[JavaScript, Python](./answer/0771)|Easy|
|0772|[Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii)|[](./answer/0772)|Hard|
|0773|[Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle)|[](./answer/0773)|Hard|
|0774|[Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station)|[](./answer/0774)|Hard|
|0775|[Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions)|[](./answer/0775)|Medium|
|0776|[Split BST](https://leetcode.com/problems/split-bst)|[](./answer/0776)|Medium|
|0777|[Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string)|[](./answer/0777)|Medium|
|0778|[Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water)|[](./answer/0778)|Hard|
|0779|[K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar)|[](./answer/0779)|Medium|
|0780|[Reaching Points](https://leetcode.com/problems/reaching-points)|[](./answer/0780)|Hard|
|0781|[Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest)|[](./answer/0781)|Medium|
|0782|[Transform to Chessboard](https://leetcode.com/problems/transform-to-chessboard)|[](./answer/0782)|Hard|
|0783|[Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes)|[](./answer/0783)|Easy|
|0784|[Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation)|[](./answer/0784)|Easy|
|0785|[Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite)|[](./answer/0785)|Medium|
|0786|[K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction)|[](./answer/0786)|Hard|
|0787|[Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops)|[](./answer/0787)|Medium|
|0788|[Rotated Digits](https://leetcode.com/problems/rotated-digits)|[](./answer/0788)|Easy|
|0789|[Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts)|[](./answer/0789)|Medium|
|0790|[Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling)|[](./answer/0790)|Medium|
|0791|[Custom Sort String](https://leetcode.com/problems/custom-sort-string)|[](./answer/0791)|Medium|
|0792|[Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences)|[](./answer/0792)|Medium|
|0793|[Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function)|[](./answer/0793)|Hard|
|0794|[Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state)|[](./answer/0794)|Medium|
|0795|[Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum)|[](./answer/0795)|Medium|
|0796|[Rotate String](https://leetcode.com/problems/rotate-string)|[](./answer/0796)|Easy|
|0797|[All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target)|[](./answer/0797)|Medium|
|0798|[Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score)|[](./answer/0798)|Hard|
|0799|[Champagne Tower](https://leetcode.com/problems/champagne-tower)|[](./answer/0799)|Medium|
|0800|[Similar RGB Color](https://leetcode.com/problems/similar-rgb-color)|[](./answer/0800)|Easy|
|0801|[Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing)|[](./answer/0801)|Medium|
|0802|[Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states)|[](./answer/0802)|Medium|
|0803|[Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit)|[](./answer/0803)|Hard|
|0804|[Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words)|[](./answer/0804)|Easy|
|0805|[Split Array With Same Average](https://leetcode.com/problems/split-array-with-same-average)|[](./answer/0805)|Hard|
|0806|[Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string)|[](./answer/0806)|Easy|
|0807|[Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline)|[](./answer/0807)|Medium|
|0808|[Soup Servings](https://leetcode.com/problems/soup-servings)|[](./answer/0808)|Medium|
|0809|[Expressive Words](https://leetcode.com/problems/expressive-words)|[](./answer/0809)|Medium|
|0810|[Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game)|[](./answer/0810)|Hard|
|0811|[Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count)|[](./answer/0811)|Easy|
|0812|[Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area)|[](./answer/0812)|Easy|
|0813|[Largest Sum of Averages](https://leetcode.com/problems/largest-sum-of-averages)|[](./answer/0813)|Medium|
|0814|[Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning)|[](./answer/0814)|Medium|
|0815|[Bus Routes](https://leetcode.com/problems/bus-routes)|[](./answer/0815)|Hard|
|0816|[Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates)|[](./answer/0816)|Medium|
|0817|[Linked List Components](https://leetcode.com/problems/linked-list-components)|[](./answer/0817)|Medium|
|0818|[Race Car](https://leetcode.com/problems/race-car)|[](./answer/0818)|Hard|
|0819|[Most Common Word](https://leetcode.com/problems/most-common-word)|[](./answer/0819)|Easy|
|0820|[Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words)|[](./answer/0820)|Medium|
|0821|[Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character)|[](./answer/0821)|Easy|
|0822|[Card Flipping Game](https://leetcode.com/problems/card-flipping-game)|[](./answer/0822)|Medium|
|0823|[Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors)|[](./answer/0823)|Medium|
|0824|[Goat Latin](https://leetcode.com/problems/goat-latin)|[](./answer/0824)|Easy|
|0825|[Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages)|[](./answer/0825)|Medium|
|0826|[Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work)|[](./answer/0826)|Medium|
|0827|[Making A Large Island](https://leetcode.com/problems/making-a-large-island)|[](./answer/0827)|Hard|
|0828|[Unique Letter String](https://leetcode.com/problems/unique-letter-string)|[](./answer/0828)|Hard|
|0829|[Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum)|[](./answer/0829)|Hard|
|0830|[Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups)|[](./answer/0830)|Easy|
|0831|[Masking Personal Information](https://leetcode.com/problems/masking-personal-information)|[](./answer/0831)|Medium|
|0832|[Flipping an Image](https://leetcode.com/problems/flipping-an-image)|[JavaScript](./answer/0832)|Easy|
|0833|[Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string)|[](./answer/0833)|Medium|
|0834|[Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree)|[](./answer/0834)|Hard|
|0835|[Image Overlap](https://leetcode.com/problems/image-overlap)|[](./answer/0835)|Medium|
|0836|[Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap)|[](./answer/0836)|Easy|
|0837|[New 21 Game](https://leetcode.com/problems/new-21-game)|[](./answer/0837)|Medium|
|0838|[Push Dominoes](https://leetcode.com/problems/push-dominoes)|[](./answer/0838)|Medium|
|0839|[Similar String Groups](https://leetcode.com/problems/similar-string-groups)|[](./answer/0839)|Hard|
|0840|[Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid)|[](./answer/0840)|Easy|
|0841|[Keys and Rooms](https://leetcode.com/problems/keys-and-rooms)|[](./answer/0841)|Medium|
|0842|[Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence)|[](./answer/0842)|Medium|
|0843|[Guess the Word](https://leetcode.com/problems/guess-the-word)|[](./answer/0843)|Hard|
|0844|[Backspace String Compare](https://leetcode.com/problems/backspace-string-compare)|[](./answer/0844)|Easy|
|0845|[Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array)|[](./answer/0845)|Medium|
|0846|[Hand of Straights](https://leetcode.com/problems/hand-of-straights)|[](./answer/0846)|Medium|
|0847|[Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes)|[](./answer/0847)|Hard|
|0848|[Shifting Letters](https://leetcode.com/problems/shifting-letters)|[](./answer/0848)|Medium|
|0849|[Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person)|[](./answer/0849)|Easy|
|0850|[Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii)|[](./answer/0850)|Hard|
|0851|[Loud and Rich](https://leetcode.com/problems/loud-and-rich)|[](./answer/0851)|Medium|
|0852|[Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array)|[](./answer/0852)|Easy|
|0853|[Car Fleet](https://leetcode.com/problems/car-fleet)|[](./answer/0853)|Medium|
|0854|[K-Similar Strings](https://leetcode.com/problems/k-similar-strings)|[](./answer/0854)|Hard|
|0855|[Exam Room](https://leetcode.com/problems/exam-room)|[](./answer/0855)|Medium|
|0856|[Score of Parentheses](https://leetcode.com/problems/score-of-parentheses)|[](./answer/0856)|Medium|
|0857|[Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers)|[](./answer/0857)|Hard|
|0858|[Mirror Reflection](https://leetcode.com/problems/mirror-reflection)|[](./answer/0858)|Medium|
|0859|[Buddy Strings](https://leetcode.com/problems/buddy-strings)|[](./answer/0859)|Easy|
|0860|[Lemonade Change](https://leetcode.com/problems/lemonade-change)|[](./answer/0860)|Easy|
|0861|[Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix)|[](./answer/0861)|Medium|
|0862|[Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k)|[](./answer/0862)|Hard|
|0863|[All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree)|[](./answer/0863)|Medium|
|0864|[Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys)|[](./answer/0864)|Hard|
|0865|[Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes)|[](./answer/0865)|Medium|
|0866|[Prime Palindrome](https://leetcode.com/problems/prime-palindrome)|[](./answer/0866)|Medium|
|0867|[Transpose Matrix](https://leetcode.com/problems/transpose-matrix)|[](./answer/0867)|Easy|
|0868|[Binary Gap](https://leetcode.com/problems/binary-gap)|[](./answer/0868)|Easy|
|0869|[Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2)|[](./answer/0869)|Medium|
|0870|[Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle)|[](./answer/0870)|Medium|
|0871|[Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops)|[](./answer/0871)|Hard|
|0872|[Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees)|[](./answer/0872)|Easy|
|0873|[Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence)|[](./answer/0873)|Medium|
|0874|[Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation)|[](./answer/0874)|Easy|
|0875|[Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas)|[](./answer/0875)|Medium|
|0876|[Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list)|[Python](./answer/0876)|Easy|
|0877|[Stone Game](https://leetcode.com/problems/stone-game)|[Python](./answer/0877)|Medium|
|0878|[Nth Magical Number](https://leetcode.com/problems/nth-magical-number)|[](./answer/0878)|Hard|
|0879|[Profitable Schemes](https://leetcode.com/problems/profitable-schemes)|[](./answer/0879)|Hard|
|0880|[Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index)|[](./answer/0880)|Medium|
|0881|[Boats to Save People](https://leetcode.com/problems/boats-to-save-people)|[](./answer/0881)|Medium|
|0882|[Reachable Nodes In Subdivided Graph](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph)|[](./answer/0882)|Hard|
|0883|[Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes)|[](./answer/0883)|Easy|
|0884|[Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences)|[](./answer/0884)|Easy|
|0885|[Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii)|[](./answer/0885)|Medium|
|0886|[Possible Bipartition](https://leetcode.com/problems/possible-bipartition)|[](./answer/0886)|Medium|
|0887|[Super Egg Drop](https://leetcode.com/problems/super-egg-drop)|[](./answer/0887)|Hard|
|0888|[Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap)|[](./answer/0888)|Easy|
|0889|[Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal)|[](./answer/0889)|Medium|
|0890|[Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern)|[](./answer/0890)|Medium|
|0891|[Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths)|[](./answer/0891)|Hard|
|0892|[Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes)|[](./answer/0892)|Easy|
|0893|[Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings)|[](./answer/0893)|Easy|
|0894|[All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees)|[](./answer/0894)|Medium|
|0895|[Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack)|[](./answer/0895)|Hard|
|0896|[Monotonic Array](https://leetcode.com/problems/monotonic-array)|[](./answer/0896)|Easy|
|0897|[Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree)|[](./answer/0897)|Easy|
|0898|[Bitwise ORs of Subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays)|[](./answer/0898)|Medium|
|0899|[Orderly Queue](https://leetcode.com/problems/orderly-queue)|[](./answer/0899)|Hard|
|0900|[RLE Iterator](https://leetcode.com/problems/rle-iterator)|[](./answer/0900)|Medium|
|0901|[Online Stock Span](https://leetcode.com/problems/online-stock-span)|[](./answer/0901)|Medium|
|0902|[Numbers At Most N Given Digit Set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set)|[](./answer/0902)|Hard|
|0903|[Valid Permutations for DI Sequence](https://leetcode.com/problems/valid-permutations-for-di-sequence)|[](./answer/0903)|Hard|
|0904|[Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets)|[](./answer/0904)|Medium|
|0905|[Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity)|[JavaScript](./answer/0905)|Easy|
|0906|[Super Palindromes](https://leetcode.com/problems/super-palindromes)|[](./answer/0906)|Hard|
|0907|[Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums)|[](./answer/0907)|Medium|
|0908|[Smallest Range I](https://leetcode.com/problems/smallest-range-i)|[](./answer/0908)|Easy|
|0909|[Snakes and Ladders](https://leetcode.com/problems/snakes-and-ladders)|[](./answer/0909)|Medium|
|0910|[Smallest Range II](https://leetcode.com/problems/smallest-range-ii)|[](./answer/0910)|Medium|
|0911|[Online Election](https://leetcode.com/problems/online-election)|[](./answer/0911)|Medium|
|0912|[Sort an Array](https://leetcode.com/problems/sort-an-array)|[](./answer/0912)|Medium|
|0913|[Cat and Mouse](https://leetcode.com/problems/cat-and-mouse)|[](./answer/0913)|Hard|
|0914|[X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards)|[Python](./answer/0914)|Easy|
|0915|[Partition Array into Disjoint Intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals)|[](./answer/0915)|Medium|
|0916|[Word Subsets](https://leetcode.com/problems/word-subsets)|[](./answer/0916)|Medium|
|0917|[Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters)|[](./answer/0917)|Easy|
|0918|[Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray)|[](./answer/0918)|Medium|
|0919|[Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter)|[](./answer/0919)|Medium|
|0920|[Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists)|[](./answer/0920)|Hard|
|0921|[Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid)|[](./answer/0921)|Medium|
|0922|[Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii)|[](./answer/0922)|Easy|
|0923|[3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity)|[](./answer/0923)|Medium|
|0924|[Minimize Malware Spread](https://leetcode.com/problems/minimize-malware-spread)|[](./answer/0924)|Hard|
|0925|[Long Pressed Name](https://leetcode.com/problems/long-pressed-name)|[](./answer/0925)|Easy|
|0926|[Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing)|[](./answer/0926)|Medium|
|0927|[Three Equal Parts](https://leetcode.com/problems/three-equal-parts)|[](./answer/0927)|Hard|
|0928|[Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii)|[](./answer/0928)|Hard|
|0929|[Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses)|[JavaScript](./answer/0929)|Easy|
|0930|[Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum)|[](./answer/0930)|Medium|
|0931|[Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum)|[](./answer/0931)|Medium|
|0932|[Beautiful Array](https://leetcode.com/problems/beautiful-array)|[](./answer/0932)|Medium|
|0933|[Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls)|[](./answer/0933)|Easy|
|0934|[Shortest Bridge](https://leetcode.com/problems/shortest-bridge)|[](./answer/0934)|Medium|
|0935|[Knight Dialer](https://leetcode.com/problems/knight-dialer)|[](./answer/0935)|Medium|
|0936|[Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence)|[](./answer/0936)|Hard|
|0937|[Reorder Log Files](https://leetcode.com/problems/reorder-log-files)|[](./answer/0937)|Easy|
|0938|[Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst)|[](./answer/0938)|Easy|
|0939|[Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle)|[](./answer/0939)|Medium|
|0940|[Distinct Subsequences II](https://leetcode.com/problems/distinct-subsequences-ii)|[](./answer/0940)|Hard|
|0941|[Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array)|[](./answer/0941)|Easy|
|0942|[DI String Match](https://leetcode.com/problems/di-string-match)|[](./answer/0942)|Easy|
|0943|[Find the Shortest Superstring](https://leetcode.com/problems/find-the-shortest-superstring)|[](./answer/0943)|Hard|
|0944|[Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted)|[](./answer/0944)|Easy|
|0945|[Minimum Increment to Make Array Unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique)|[](./answer/0945)|Medium|
|0946|[Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences)|[](./answer/0946)|Medium|
|0947|[Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column)|[](./answer/0947)|Medium|
|0948|[Bag of Tokens](https://leetcode.com/problems/bag-of-tokens)|[](./answer/0948)|Medium|
|0949|[Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits)|[](./answer/0949)|Easy|
|0950|[Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order)|[](./answer/0950)|Medium|
|0951|[Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees)|[](./answer/0951)|Medium|
|0952|[Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor)|[](./answer/0952)|Hard|
|0953|[Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary)|[](./answer/0953)|Easy|
|0954|[Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs)|[](./answer/0954)|Medium|
|0955|[Delete Columns to Make Sorted II](https://leetcode.com/problems/delete-columns-to-make-sorted-ii)|[](./answer/0955)|Medium|
|0956|[Tallest Billboard](https://leetcode.com/problems/tallest-billboard)|[](./answer/0956)|Hard|
|0957|[Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days)|[](./answer/0957)|Medium|
|0958|[Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree)|[](./answer/0958)|Medium|
|0959|[Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes)|[](./answer/0959)|Medium|
|0960|[Delete Columns to Make Sorted III](https://leetcode.com/problems/delete-columns-to-make-sorted-iii)|[](./answer/0960)|Hard|
|0961|[N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array)|[Go, JavaScript](./answer/0961)|Easy|
|0962|[Maximum Width Ramp](https://leetcode.com/problems/maximum-width-ramp)|[](./answer/0962)|Medium|
|0963|[Minimum Area Rectangle II](https://leetcode.com/problems/minimum-area-rectangle-ii)|[](./answer/0963)|Medium|
|0964|[Least Operators to Express Number](https://leetcode.com/problems/least-operators-to-express-number)|[](./answer/0964)|Hard|
|0965|[Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree)|[](./answer/0965)|Easy|
|0966|[Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker)|[](./answer/0966)|Medium|
|0967|[Numbers With Same Consecutive Differences](https://leetcode.com/problems/numbers-with-same-consecutive-differences)|[](./answer/0967)|Medium|
|0968|[Binary Tree Cameras](https://leetcode.com/problems/binary-tree-cameras)|[](./answer/0968)|Hard|
|0969|[Pancake Sorting](https://leetcode.com/problems/pancake-sorting)|[](./answer/0969)|Medium|
|0970|[Powerful Integers](https://leetcode.com/problems/powerful-integers)|[](./answer/0970)|Easy|
|0971|[Flip Binary Tree To Match Preorder Traversal](https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal)|[](./answer/0971)|Medium|
|0972|[Equal Rational Numbers](https://leetcode.com/problems/equal-rational-numbers)|[](./answer/0972)|Hard|
|0973|[K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin)|[](./answer/0973)|Medium|
|0974|[Subarray Sums Divisible by K](https://leetcode.com/problems/subarray-sums-divisible-by-k)|[](./answer/0974)|Medium|
|0975|[Odd Even Jump](https://leetcode.com/problems/odd-even-jump)|[](./answer/0975)|Hard|
|0976|[Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle)|[](./answer/0976)|Easy|
|0977|[Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array)|[](./answer/0977)|Easy|
|0978|[Longest Turbulent Subarray](https://leetcode.com/problems/longest-turbulent-subarray)|[](./answer/0978)|Medium|
|0979|[Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree)|[](./answer/0979)|Medium|
|0980|[Unique Paths III](https://leetcode.com/problems/unique-paths-iii)|[](./answer/0980)|Hard|
|0981|[Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store)|[](./answer/0981)|Medium|
|0982|[Triples with Bitwise AND Equal To Zero](https://leetcode.com/problems/triples-with-bitwise-and-equal-to-zero)|[](./answer/0982)|Hard|
|0983|[Minimum Cost For Tickets](https://leetcode.com/problems/minimum-cost-for-tickets)|[](./answer/0983)|Medium|
|0984|[String Without AAA or BBB](https://leetcode.com/problems/string-without-aaa-or-bbb)|[](./answer/0984)|Medium|
|0985|[Sum of Even Numbers After Queries](https://leetcode.com/problems/sum-of-even-numbers-after-queries)|[](./answer/0985)|Easy|
|0986|[Interval List Intersections](https://leetcode.com/problems/interval-list-intersections)|[](./answer/0986)|Medium|
|0987|[Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree)|[](./answer/0987)|Medium|
|0988|[Smallest String Starting From Leaf](https://leetcode.com/problems/smallest-string-starting-from-leaf)|[](./answer/0988)|Medium|
|0989|[Add to Array-Form of Integer](https://leetcode.com/problems/add-to-array-form-of-integer)|[](./answer/0989)|Easy|
|0990|[Satisfiability of Equality Equations](https://leetcode.com/problems/satisfiability-of-equality-equations)|[](./answer/0990)|Medium|
|0991|[Broken Calculator](https://leetcode.com/problems/broken-calculator)|[](./answer/0991)|Medium|
|0992|[Subarrays with K Different Integers](https://leetcode.com/problems/subarrays-with-k-different-integers)|[](./answer/0992)|Hard|
|0993|[Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree)|[](./answer/0993)|Easy|
|0994|[Rotting Oranges](https://leetcode.com/problems/rotting-oranges)|[](./answer/0994)|Easy|
|0995|[Minimum Number of K Consecutive Bit Flips](https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips)|[](./answer/0995)|Hard|
|0996|[Number of Squareful Arrays](https://leetcode.com/problems/number-of-squareful-arrays)|[](./answer/0996)|Hard|
|0997|[Find the Town Judge](https://leetcode.com/problems/find-the-town-judge)|[](./answer/0997)|Easy|
|0998|[Maximum Binary Tree II](https://leetcode.com/problems/maximum-binary-tree-ii)|[](./answer/0998)|Medium|
|0999|[Available Captures for Rook](https://leetcode.com/problems/available-captures-for-rook)|[](./answer/0999)|Easy|
|1000|[Minimum Cost to Merge Stones](https://leetcode.com/problems/minimum-cost-to-merge-stones)|[](./answer/1000)|Hard|
|1001|[Grid Illumination](https://leetcode.com/problems/grid-illumination)|[](./answer/1001)|Hard|
|1002|[Find Common Characters](https://leetcode.com/problems/find-common-characters)|[](./answer/1002)|Easy|
|1003|[Check If Word Is Valid After Substitutions](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions)|[](./answer/1003)|Medium|
|1004|[Max Consecutive Ones III](https://leetcode.com/problems/max-consecutive-ones-iii)|[](./answer/1004)|Medium|
|1005|[Maximize Sum Of Array After K Negations](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations)|[](./answer/1005)|Easy|
|1006|[Clumsy Factorial](https://leetcode.com/problems/clumsy-factorial)|[](./answer/1006)|Medium|
|1007|[Minimum Domino Rotations For Equal Row](https://leetcode.com/problems/minimum-domino-rotations-for-equal-row)|[](./answer/1007)|Medium|
|1008|[Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal)|[](./answer/1008)|Medium|
|1009|[Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer)|[](./answer/1009)|Easy|
|1010|[Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60)|[](./answer/1010)|Easy|
|1011|[Capacity To Ship Packages Within D Days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days)|[](./answer/1011)|Medium|
|1012|[Numbers With Repeated Digits](https://leetcode.com/problems/numbers-with-repeated-digits)|[](./answer/1012)|Hard|
|1013|[Partition Array Into Three Parts With Equal Sum](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum)|[](./answer/1013)|Easy|
|1014|[Best Sightseeing Pair](https://leetcode.com/problems/best-sightseeing-pair)|[](./answer/1014)|Medium|
|1015|[Smallest Integer Divisible by K](https://leetcode.com/problems/smallest-integer-divisible-by-k)|[](./answer/1015)|Medium|
|1016|[Binary String With Substrings Representing 1 To N](https://leetcode.com/problems/binary-string-with-substrings-representing-1-to-n)|[](./answer/1016)|Medium|
|1017|[Convert to Base -2](https://leetcode.com/problems/convert-to-base-2)|[](./answer/1017)|Medium|
|1018|[Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5)|[](./answer/1018)|Easy|
|1019|[Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list)|[](./answer/1019)|Medium|
|1020|[Number of Enclaves](https://leetcode.com/problems/number-of-enclaves)|[](./answer/1020)|Medium|
|1021|[Remove Outermost Parentheses](https://leetcode.com/problems/remove-outermost-parentheses)|[](./answer/1021)|Easy|
|1022|[Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers)|[](./answer/1022)|Easy|
|1023|[Camelcase Matching](https://leetcode.com/problems/camelcase-matching)|[](./answer/1023)|Medium|
|1024|[Video Stitching](https://leetcode.com/problems/video-stitching)|[](./answer/1024)|Medium|
|1025|[Divisor Game](https://leetcode.com/problems/divisor-game)|[](./answer/1025)|Easy|
|1026|[Maximum Difference Between Node and Ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor)|[](./answer/1026)|Medium|
|1027|[Longest Arithmetic Sequence](https://leetcode.com/problems/longest-arithmetic-sequence)|[](./answer/1027)|Medium|
|1028|[Recover a Tree From Preorder Traversal](https://leetcode.com/problems/recover-a-tree-from-preorder-traversal)|[](./answer/1028)|Hard|
|1029|[Two City Scheduling](https://leetcode.com/problems/two-city-scheduling)|[](./answer/1029)|Easy|
|1030|[Matrix Cells in Distance Order](https://leetcode.com/problems/matrix-cells-in-distance-order)|[](./answer/1030)|Easy|
|1031|[Maximum Sum of Two Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-two-non-overlapping-subarrays)|[](./answer/1031)|Medium|
|1032|[Stream of Characters](https://leetcode.com/problems/stream-of-characters)|[](./answer/1032)|Hard|
|1033|[Moving Stones Until Consecutive](https://leetcode.com/problems/moving-stones-until-consecutive)|[](./answer/1033)|Easy|
|1034|[Coloring A Border](https://leetcode.com/problems/coloring-a-border)|[](./answer/1034)|Medium|
|1035|[Uncrossed Lines](https://leetcode.com/problems/uncrossed-lines)|[](./answer/1035)|Medium|
|1036|[Escape a Large Maze](https://leetcode.com/problems/escape-a-large-maze)|[](./answer/1036)|Hard|
|1037|[Valid Boomerang](https://leetcode.com/problems/valid-boomerang)|[](./answer/1037)|Easy|
|1038|[Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree)|[](./answer/1038)|Medium|
|1039|[Minimum Score Triangulation of Polygon](https://leetcode.com/problems/minimum-score-triangulation-of-polygon)|[](./answer/1039)|Medium|
|1040|[Moving Stones Until Consecutive II](https://leetcode.com/problems/moving-stones-until-consecutive-ii)|[](./answer/1040)|Medium|
|1041|[Robot Bounded In Circle](https://leetcode.com/problems/robot-bounded-in-circle)|[](./answer/1041)|Easy|
|1042|[Flower Planting With No Adjacent](https://leetcode.com/problems/flower-planting-with-no-adjacent)|[](./answer/1042)|Easy|
|1043|[Partition Array for Maximum Sum](https://leetcode.com/problems/partition-array-for-maximum-sum)|[](./answer/1043)|Medium|
|1044|[Longest Duplicate Substring](https://leetcode.com/problems/longest-duplicate-substring)|[](./answer/1044)|Hard|
|1045|[Customers Who Bought All Products](https://leetcode.com/problems/customers-who-bought-all-products)|[](./answer/1045)|Medium|
|1046|[Last Stone Weight](https://leetcode.com/problems/last-stone-weight)|[](./answer/1046)|Easy|
|1047|[Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string)|[](./answer/1047)|Easy|
|1048|[Longest String Chain](https://leetcode.com/problems/longest-string-chain)|[](./answer/1048)|Medium|
|1049|[Last Stone Weight II](https://leetcode.com/problems/last-stone-weight-ii)|[](./answer/1049)|Medium|
|1050|[Actors and Directors Who Cooperated At Least Three Times](https://leetcode.com/problems/actors-and-directors-who-cooperated-at-least-three-times)|[](./answer/1050)|Easy|
|1051|[Height Checker](https://leetcode.com/problems/height-checker)|[](./answer/1051)|Easy|
|1052|[Grumpy Bookstore Owner](https://leetcode.com/problems/grumpy-bookstore-owner)|[](./answer/1052)|Medium|
|1053|[Previous Permutation With One Swap](https://leetcode.com/problems/previous-permutation-with-one-swap)|[](./answer/1053)|Medium|
|1054|[Distant Barcodes](https://leetcode.com/problems/distant-barcodes)|[](./answer/1054)|Medium|
|1055|[Shortest Way to Form String](https://leetcode.com/problems/shortest-way-to-form-string)|[](./answer/1055)|Medium|
|1056|[Confusing Number](https://leetcode.com/problems/confusing-number)|[](./answer/1056)|Easy|
|1057|[Campus Bikes](https://leetcode.com/problems/campus-bikes)|[](./answer/1057)|Medium|
|1058|[Minimize Rounding Error to Meet Target](https://leetcode.com/problems/minimize-rounding-error-to-meet-target)|[](./answer/1058)|Medium|
|1059|[All Paths from Source Lead to Destination](https://leetcode.com/problems/all-paths-from-source-lead-to-destination)|[](./answer/1059)|Medium|
|1060|[Missing Element in Sorted Array](https://leetcode.com/problems/missing-element-in-sorted-array)|[](./answer/1060)|Medium|
|1061|[Lexicographically Smallest Equivalent String](https://leetcode.com/problems/lexicographically-smallest-equivalent-string)|[](./answer/1061)|Medium|
|1062|[Longest Repeating Substring](https://leetcode.com/problems/longest-repeating-substring)|[](./answer/1062)|Medium|
|1063|[Number of Valid Subarrays](https://leetcode.com/problems/number-of-valid-subarrays)|[](./answer/1063)|Hard|
|1064|[Fixed Point](https://leetcode.com/problems/fixed-point)|[](./answer/1064)|Easy|
|1065|[Index Pairs of a String](https://leetcode.com/problems/index-pairs-of-a-string)|[](./answer/1065)|Easy|
|1066|[Campus Bikes II](https://leetcode.com/problems/campus-bikes-ii)|[](./answer/1066)|Medium|
|1067|[Digit Count in Range](https://leetcode.com/problems/digit-count-in-range)|[](./answer/1067)|Hard|
|1068|[Product Sales Analysis I](https://leetcode.com/problems/product-sales-analysis-i)|[](./answer/1068)|Easy|
|1069|[Product Sales Analysis II](https://leetcode.com/problems/product-sales-analysis-ii)|[](./answer/1069)|Easy|
|1070|[Product Sales Analysis III](https://leetcode.com/problems/product-sales-analysis-iii)|[](./answer/1070)|Medium|
|1071|[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings)|[](./answer/1071)|Easy|
|1072|[Flip Columns For Maximum Number of Equal Rows](https://leetcode.com/problems/flip-columns-for-maximum-number-of-equal-rows)|[](./answer/1072)|Medium|
|1073|[Adding Two Negabinary Numbers](https://leetcode.com/problems/adding-two-negabinary-numbers)|[](./answer/1073)|Medium|
|1074|[Number of Submatrices That Sum to Target](https://leetcode.com/problems/number-of-submatrices-that-sum-to-target)|[](./answer/1074)|Hard|
|1075|[Project Employees I](https://leetcode.com/problems/project-employees-i)|[](./answer/1075)|Easy|
|1076|[Project Employees II](https://leetcode.com/problems/project-employees-ii)|[](./answer/1076)|Easy|
|1077|[Project Employees III](https://leetcode.com/problems/project-employees-iii)|[](./answer/1077)|Medium|
|1078|[Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram)|[](./answer/1078)|Easy|
|1079|[Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities)|[](./answer/1079)|Medium|
|1080|[Insufficient Nodes in Root to Leaf Paths](https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths)|[](./answer/1080)|Medium|
|1081|[Smallest Subsequence of Distinct Characters](https://leetcode.com/problems/smallest-subsequence-of-distinct-characters)|[](./answer/1081)|Medium|
|1082|[Sales Analysis I](https://leetcode.com/problems/sales-analysis-i)|[](./answer/1082)|Easy|
|1083|[Sales Analysis II](https://leetcode.com/problems/sales-analysis-ii)|[](./answer/1083)|Easy|
|1084|[Sales Analysis III](https://leetcode.com/problems/sales-analysis-iii)|[](./answer/1084)|Easy|
|1085|[Sum of Digits in the Minimum Number](https://leetcode.com/problems/sum-of-digits-in-the-minimum-number)|[](./answer/1085)|Easy|
|1086|[High Five](https://leetcode.com/problems/high-five)|[](./answer/1086)|Easy|
|1087|[Brace Expansion](https://leetcode.com/problems/brace-expansion)|[](./answer/1087)|Medium|
|1088|[Confusing Number II](https://leetcode.com/problems/confusing-number-ii)|[](./answer/1088)|Hard|
|1089|[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros)|[](./answer/1089)|Easy|
|1090|[Largest Values From Labels](https://leetcode.com/problems/largest-values-from-labels)|[](./answer/1090)|Medium|
|1091|[Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix)|[](./answer/1091)|Medium|
|1092|[Shortest Common Supersequence](https://leetcode.com/problems/shortest-common-supersequence)|[](./answer/1092)|Hard|

[回到顶部 :top:](#readme)

leetcode

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README