https://github.com/suxrobgm/leet-code
LeetCode problems and solutions
https://github.com/suxrobgm/leet-code
csharp leetcode-solutions
Last synced: over 1 year ago
JSON representation
LeetCode problems and solutions
- Host: GitHub
- URL: https://github.com/suxrobgm/leet-code
- Owner: suxrobGM
- License: mit
- Created: 2021-08-20T14:10:57.000Z (almost 5 years ago)
- Default Branch: main
- Last Pushed: 2024-05-17T02:33:16.000Z (about 2 years ago)
- Last Synced: 2024-05-17T02:56:48.954Z (about 2 years ago)
- Topics: csharp, leetcode-solutions
- Language: C#
- Homepage:
- Size: 276 KB
- Stars: 2
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# LeetCode Solutions
LeetCode problems and solutions.
My profile on LeetCode: https://leetcode.com/u/SuxrobGM
| # | Title | Solution | Difficulty |
|------|--------------------------------------------------------------------------------------------------------------------------------|--------------------------------------------------|--|
| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | [C#](./src/CSharp/Solutions/Solution1.cs) | Easy |
| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | [C#](./src/CSharp/Solutions/Solution2.cs) | Medium |
| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | [C#](./src/CSharp/Solutions/Solution3.cs) | Medium |
| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | [C#](./src/CSharp/Solutions/Solution4.cs) | Hard |
| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | [Java](./src/Java/Solutions/Solution4.java) | Hard |
| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | [C#](./src/CSharp/Solutions/Solution5.cs) | Medium |
| 6 | [Zigzag Conversion](https://leetcode.com/problems/zigzag-conversion) | [C#](./src/CSharp/Solutions/Solution6.cs) | Medium |
| 7 | [Reverse Integer](https://leetcode.com/problems/reverse-integer) | [C#](./src/CSharp/Solutions/Solution7.cs) | Medium |
| 8 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | [C#](./src/CSharp/Solutions/Solution8.cs) | Medium |
| 9 | [Palindrome Number](https://leetcode.com/problems/palindrome-number) | [C#](./src/CSharp/Solutions/Solution9.cs) | Easy |
| 10 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | [C#](./src/CSharp/Solutions/Solution10.cs) | Hard |
| 11 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | [C#](./src/CSharp/Solutions/Solution11.cs) | Medium |
| 12 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman) | [C#](./src/CSharp/Solutions/Solution12.cs) | Medium |
| 13 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | [C#](./src/CSharp/Solutions/Solution13.cs) | Easy |
| 14 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix) | [C#](./src/CSharp/Solutions/Solution14.cs) | Easy |
| 15 | [3Sum](https://leetcode.com/problems/3sum) | [C#](./src/CSharp/Solutions/Solution15.cs) | Medium |
| 16 | [3Sum Closest](https://leetcode.com/problems/3sum-closest) | [C#](./src/CSharp/Solutions/Solution16.cs) | Medium |
| 17 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | [C#](./src/CSharp/Solutions/Solution17.cs) | Medium |
| 18 | [4Sum](https://leetcode.com/problems/4sum) | [C#](./src/CSharp/Solutions/Solution18.cs) | Medium |
| 19 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | [C#](./src/CSharp/Solutions/Solution19.cs) | Medium |
| 20 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | [C#](./src/CSharp/Solutions/Solution20.cs) | Easy |
| 21 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [C#](./src/CSharp/Solutions/Solution21.cs) | Easy |
| 22 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | [C#](./src/CSharp/Solutions/Solution22.cs) | Medium |
| 23 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | [C#](./src/CSharp/Solutions/Solution23.cs) | Hard |
| 24 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) | [C#](./src/CSharp/Solutions/Solution24.cs) | Medium |
| 25 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | [C#](./src/CSharp/Solutions/Solution25.cs) | Hard |
| 26 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [C#](./src/CSharp/Solutions/Solution26.cs) | Easy |
| 27 | [Remove Element](https://leetcode.com/problems/remove-element) | [C#](./src/CSharp/Solutions/Solution27.cs) | Easy |
| 28 | [Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string) | [C#](./src/CSharp/Solutions/Solution28.cs) | Easy |
| 29 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers) | [C#](./src/CSharp/Solutions/Solution29.cs) | Medium |
| 30 | [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words) | [C#](./src/CSharp/Solutions/Solution30.cs) | Hard |
| 31 | [Next Permutation](https://leetcode.com/problems/next-permutation) | [C#](./src/CSharp/Solutions/Solution31.cs) | Medium |
| 32 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses) | [C#](./src/CSharp/Solutions/Solution32.cs) | Hard |
| 33 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | [C#](./src/CSharp/Solutions/Solution33.cs) | Medium |
| 34 | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array) | [C#](./src/CSharp/Solutions/Solution34.cs) | Medium |
| 35 | [Search Insert Position](https://leetcode.com/problems/search-insert-position) | [C#](./src/CSharp/Solutions/Solution35.cs) | Easy |
| 36 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku) | [C#](./src/CSharp/Solutions/Solution36.cs) | Medium |
| 37 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver) | [C#](./src/CSharp/Solutions/Solution37.cs) | Hard |
| 38 | [Count and Say](https://leetcode.com/problems/count-and-say) | [C#](./src/CSharp/Solutions/Solution38.cs) | Easy |
| 39 | [Combination Sum](https://leetcode.com/problems/combination-sum) | [C#](./src/CSharp/Solutions/Solution39.cs) | Medium |
| 40 | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii) | [C#](./src/CSharp/Solutions/Solution40.cs) | Medium |
| 41 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive) | [C#](./src/CSharp/Solutions/Solution41.cs) | Hard |
| 42 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water) | [C#](./src/CSharp/Solutions/Solution42.cs) | Hard |
| 43 | [Multiply Strings](https://leetcode.com/problems/multiply-strings) | [C#](./src/CSharp/Solutions/Solution43.cs) | Medium |
| 44 | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching) | [C#](./src/CSharp/Solutions/Solution44.cs) | Hard |
| 45 | [Jump Game II](https://leetcode.com/problems/jump-game-ii) | [C#](./src/CSharp/Solutions/Solution45.cs) | Medium |
| 46 | [Permutations](https://leetcode.com/problems/permutations) | [C#](./src/CSharp/Solutions/Solution46.cs) | Medium |
| 47 | [Permutations II](https://leetcode.com/problems/permutations-ii) | [C#](./src/CSharp/Solutions/Solution47.cs) | Medium |
| 48 | [Rotate Image](https://leetcode.com/problems/rotate-image) | [C#](./src/CSharp/Solutions/Solution48.cs) | Medium |
| 49 | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | [C#](./src/CSharp/Solutions/Solution49.cs) | Medium |
| 50 | [Pow(x, n)](https://leetcode.com/problems/powx-n) | [C#](./src/CSharp/Solutions/Solution50.cs) | Medium |
| 51 | [N-Queens](https://leetcode.com/problems/n-queens) | [C#](./src/CSharp/Solutions/Solution51.cs) | Hard |
| 52 | [N-Queens II](https://leetcode.com/problems/n-queens-ii) | [C#](./src/CSharp/Solutions/Solution52.cs) | Hard |
| 53 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [C#](./src/CSharp/Solutions/Solution53.cs) | Easy |
| 54 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | [C#](./src/CSharp/Solutions/Solution54.cs) | Medium |
| 55 | [Jump Game](https://leetcode.com/problems/jump-game) | [C#](./src/CSharp/Solutions/Solution55.cs) | Medium |
| 56 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | [C#](./src/CSharp/Solutions/Solution56.cs) | Medium |
| 57 | [Insert Interval](https://leetcode.com/problems/insert-interval) | [C#](./src/CSharp/Solutions/Solution57.cs) | Medium |
| 58 | [Length of Last Word](https://leetcode.com/problems/length-of-last-word) | [C#](./src/CSharp/Solutions/Solution58.cs) | Easy |
| 59 | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii) | [C#](./src/CSharp/Solutions/Solution59.cs) | Medium |
| 60 | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence) | [C#](./src/CSharp/Solutions/Solution60.cs) | Hard |
| 61 | [Rotate List](https://leetcode.com/problems/rotate-list) | [C#](./src/CSharp/Solutions/Solution61.cs) | Medium |
| 62 | [Unique Paths](https://leetcode.com/problems/unique-paths) | [C#](./src/CSharp/Solutions/Solution62.cs) | Medium |
| 63 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii) | [C#](./src/CSharp/Solutions/Solution63.cs) | Medium |
| 64 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) | [C#](./src/CSharp/Solutions/Solution64.cs) | Medium |
| 65 | [Valid Number](https://leetcode.com/problems/valid-number) | [C#](./src/CSharp/Solutions/Solution65.cs) | Hard |
| 66 | [Plus One](https://leetcode.com/problems/plus-one) | [C#](./src/CSharp/Solutions/Solution66.cs) | Easy |
| 67 | [Add Binary](https://leetcode.com/problems/add-binary) | [C#](./src/CSharp/Solutions/Solution67.cs) | Easy |
| 68 | [Text Justification](https://leetcode.com/problems/text-justification) | [C#](./src/CSharp/Solutions/Solution68.cs) | Hard |
| 69 | [Sqrt(x)](https://leetcode.com/problems/sqrtx) | [C#](./src/CSharp/Solutions/Solution69.cs) | Easy |
| 70 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [Java](./src/Java/Solutions/Solution70.java) | Easy |
| 71 | [Simplify Path](https://leetcode.com/problems/simplify-path) | [C#](./src/CSharp/Solutions/Solution71.cs) | Medium |
| 72 | [Edit Distance](https://leetcode.com/problems/edit-distance) | [C#](./src/CSharp/Solutions/Solution72.cs) | Medium |
| 73 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | [C#](./src/CSharp/Solutions/Solution73.cs) | Medium | Hard |
| 74 | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix) | [C#](./src/CSharp/Solutions/Solution74.cs) | Medium |
| 75 | [Sort Colors](https://leetcode.com/problems/sort-colors) | [C#](./src/CSharp/Solutions/Solution75.cs) | Medium |
| 76 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | [C#](./src/CSharp/Solutions/Solution76.cs) | Hard |
| 77 | [Combinations](https://leetcode.com/problems/combinations) | [C#](./src/CSharp/Solutions/Solution77.cs) | Medium |
| 78 | [Subsets](https://leetcode.com/problems/subsets) | [C#](./src/CSharp/Solutions/Solution78.cs) | Medium |
| 79 | [Word Search](https://leetcode.com/problems/word-search) | [C#](./src/CSharp/Solutions/Solution79.cs) | Medium |
| 80 | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) | [C#](./src/CSharp/Solutions/Solution80.cs) | Medium |
| 81 | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii) | [C#](./src/CSharp/Solutions/Solution81.cs) | Medium |
| 82 | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii) | [C#](./src/CSharp/Solutions/Solution82.cs) | Medium |
| 83 | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list) | [Java](./src/Java/Solutions/Solution83.java) | Easy |
| 84 | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram) | [C#](./src/CSharp/Solutions/Solution84.cs) | Hard |
| 85 | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | [C#](./src/CSharp/Solutions/Solution85.cs) | Hard |
| 86 | [Partition List](https://leetcode.com/problems/partition-list) | [C#](./src/CSharp/Solutions/Solution86.cs) | Medium |
| 87 | [Scramble String](https://leetcode.com/problems/scramble-string) | [C#](./src/CSharp/Solutions/Solution87.cs) | Hard |
| 88 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | [Java](./src/Java/Solutions/Solution88.java) | Easy |
| 88 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | [C#](./src/CSharp/Solutions/Solution88.cs) | Easy |
| 89 | [Gray Code](https://leetcode.com/problems/gray-code) | [C#](./src/CSharp/Solutions/Solution89.cs) | Medium |
| 90 | [Subsets II](https://leetcode.com/problems/subsets-ii) | [C#](./src/CSharp/Solutions/Solution90.cs) | Medium |
| 91 | [Decode Ways](https://leetcode.com/problems/decode-ways) | [C#](./src/CSharp/Solutions/Solution91.cs) | Medium |
| 92 | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii) | [C#](./src/CSharp/Solutions/Solution92.cs) | Medium |
| 93 | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses) | [C#](./src/CSharp/Solutions/Solution93.cs) | Medium |
| 94 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | [Java](./src/Java/Solutions/Solution94.java) | Easy |
| 95 | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii) | [C#](./src/CSharp/Solutions/Solution95.cs) | Medium |
| 96 | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees) | [C#](./src/CSharp/Solutions/Solution96.cs) | Medium |
| 97 | [Interleaving String](https://leetcode.com/problems/interleaving-string) | [C#](./src/CSharp/Solutions/Solution97.cs) | Medium |
| 98 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | [C#](./src/CSharp/Solutions/Solution98.cs) | Medium |
| 99 | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree) | [C#](./src/CSharp/Solutions/Solution99.cs) | Medium |
| 100 | [Same Tree](https://leetcode.com/problems/same-tree) | [Java](./src/Java/Solutions/Solution100.java) | Easy |
| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree) | [Java](./src/Java/Solutions/Solution101.java) | Easy |
| 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | [C#](./src/CSharp/Solutions/Solution102.cs) | Medium |
| 103 | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal) | [C#](./src/CSharp/Solutions/Solution103.cs) | Medium |
| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | [Java](./src/Java/Solutions/Solution104.java) | Easy |
| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [C#](./src/CSharp/Solutions/Solution105.cs) | Medium |
| 106 | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [C#](./src/CSharp/Solutions/Solution106.cs) | Medium |
| 107 | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii) | [C#](./src/CSharp/Solutions/Solution107.cs) | Medium |
| 108 | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | [Java](./src/Java/Solutions/Solution108.java) | Easy |
| 109 | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree) | [C#](./src/CSharp/Solutions/Solution109.cs) | Medium |
| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree) | [C#](./src/CSharp/Solutions/Solution110.cs) | Easy |
| 111 | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | [C#](./src/CSharp/Solutions/Solution111.cs) | Easy |
| 112 | [Path Sum](https://leetcode.com/problems/path-sum) | [C#](./src/CSharp/Solutions/Solution112.cs) | Easy |
| 113 | [Path Sum II](https://leetcode.com/problems/path-sum-ii) | [C#](./src/CSharp/Solutions/Solution113.cs) | Medium |
| 114 | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list) | [C#](./src/CSharp/Solutions/Solution114.cs) | Medium |
| 115 | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences) | [C#](./src/CSharp/Solutions/Solution115.cs) | Hard |
| 116 | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node) | [C#](./src/CSharp/Solutions/Solution116.cs) | Medium |
| 117 | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii) | [C#](./src/CSharp/Solutions/Solution117.cs) | Medium |
| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle) | [C#](./src/CSharp/Solutions/Solution118.cs) | Easy |
| 119 | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii) | [C#](./src/CSharp/Solutions/Solution119.cs) | Easy |
| 120 | [Triangle](https://leetcode.com/problems/triangle) | [C#](./src/CSharp/Solutions/Solution120.cs) | Medium |
| 121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [C#](./src/CSharp/Solutions/Solution121.cs) | Easy |
| 122 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | [C#](./src/CSharp/Solutions/Solution122.cs) | Medium |
| 123 | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii) | [C#](./src/CSharp/Solutions/Solution123.cs) | Hard |
| 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | [C#](./src/CSharp/Solutions/Solution125.cs) | Easy |
| 127 | [Word Ladder](https://leetcode.com/problems/word-ladder) | [C#](./src/CSharp/Solutions/Solution127.cs) | Hard |
| 128 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | [C#](./src/CSharp/Solutions/Solution128.cs) | Medium |
| 129 | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers) | [C#](./src/CSharp/Solutions/Solution129.cs) | Medium |
| 130 | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions) | [C#](./src/CSharp/Solutions/Solution130.cs) | Medium |
| 131 | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning) | [C#](./src/CSharp/Solutions/Solution131.cs) | Medium |
| 132 | [Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii) | [C#](./src/CSharp/Solutions/Solution132.cs) | Hard |
| 133 | [Clone Graph](https://leetcode.com/problems/clone-graph) | [C#](./src/CSharp/Solutions/Solution133.cs) | Medium |
| 134 | [Gas Station](https://leetcode.com/problems/gas-station) | [C#](./src/CSharp/Solutions/Solution134.cs) | Medium |
| 135 | [Candy](https://leetcode.com/problems/candy) | [C#](./src/CSharp/Solutions/Solution135.cs) | Hard |
| 136 | [Single Number](https://leetcode.com/problems/single-number) | [C#](./src/CSharp/Solutions/Solution136.cs) | Easy |
| 137 | [Single Number II](https://leetcode.com/problems/single-number-ii) | [C#](./src/CSharp/Solutions/Solution137.cs) | Medium |
| 138 | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) | [C#](./src/CSharp/Solutions/Solution138.cs) | Medium |
| 139 | [Word Break](https://leetcode.com/problems/word-break) | [C#](./src/CSharp/Solutions/Solution139.cs) | Medium |
| 140 | [Word Break II](https://leetcode.com/problems/word-break-ii) | [C#](./src/CSharp/Solutions/Solution140.cs) | Hard |
| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | [C#](./src/CSharp/Solutions/Solution141.cs) | Easy |
| 142 | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii) | [C#](./src/CSharp/Solutions/Solution142.cs) | Medium |
| 143 | [Reorder List](https://leetcode.com/problems/reorder-list) | [C#](./src/CSharp/Solutions/Solution143.cs) | Medium |
| 144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal) | [C#](./src/CSharp/Solutions/Solution144.cs) | Easy |
| 145 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal) | [C#](./src/CSharp/Solutions/Solution145.cs) | Easy |
| 146 | [LRU Cache](https://leetcode.com/problems/lru-cache) | [C#](./src/CSharp/Solutions/Solution146.cs) | Medium |
| 147 | [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list) | [C#](./src/CSharp/Solutions/Solution147.cs) | Medium |
| 148 | [Sort List](https://leetcode.com/problems/sort-list) | [C#](./src/CSharp/Solutions/Solution148.cs) | Medium |
| 149 | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line) | [C#](./src/CSharp/Solutions/Solution149.cs) | Hard |
| 150 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | [C#](./src/CSharp/Solutions/Solution150.cs) | Medium |
| 151 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string) | [C#](./src/CSharp/Solutions/Solution151.cs) | Medium |
| 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray) | [C#](./src/CSharp/Solutions/Solution152.cs) | Medium |
| 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [C#](./src/CSharp/Solutions/Solution153.cs) | Medium |
| 154 | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii) | [C#](./src/CSharp/Solutions/Solution154.cs) | Hard |
| 155 | [Min Stack](https://leetcode.com/problems/min-stack) | [C#](./src/CSharp/Solutions/Solution155.cs) | Medium |
| 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | [C#](./src/CSharp/Solutions/Solution160.cs) | Easy |
| 162 | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | [C#](./src/CSharp/Solutions/Solution162.cs) | Medium |
| 164 | [Maximum Gap](https://leetcode.com/problems/maximum-gap) | [C#](./src/CSharp/Solutions/Solution164.cs) | Medium |
| 165 | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | [C#](./src/CSharp/Solutions/Solution165.cs) | Medium |
| 166 | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal) | [C#](./src/CSharp/Solutions/Solution166.cs) | Medium |
| 167 | [Two Sum II - Input Array Is Sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | [C#](./src/CSharp/Solutions/Solution167.cs) | Medium |
| 168 | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title) | [C#](./src/CSharp/Solutions/Solution168.cs) | Easy |
| 169 | [Majority Element](https://leetcode.com/problems/majority-element) | [C#](./src/CSharp/Solutions/Solution169.cs) | Easy |
| 171 | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | [C#](./src/CSharp/Solutions/Solution171.cs) | Easy |
| 172 | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | [C#](./src/CSharp/Solutions/Solution172.cs) | Medium |
| 173 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator) | [C#](./src/CSharp/Solutions/Solution173.cs) | Medium |
| 174 | [Dungeon Game](https://leetcode.com/problems/dungeon-game) | [C#](./src/CSharp/Solutions/Solution174.cs) | Hard |
| 175 | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables) | [SQL](./src/SQL/Solution175.sql) | Easy |
| 176 | [Second Highest Salary](https://leetcode.com/problems/second-highest-salary) | [SQL](./src/SQL/Solution176.sql) | Medium |
| 177 | [Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary) | [SQL](./src/SQL/Solution177.sql) | Medium |
| 178 | [Rank Scores](https://leetcode.com/problems/rank-scores) | [SQL](./src/SQL/Solution178.sql) | Medium |
| 179 | [Largest Number](https://leetcode.com/problems/largest-number) | [C#](./src/CSharp/Solutions/Solution179.cs) | Medium |
| 181 | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers) | [SQL](./src/SQL/Solution181.sql) | Easy |
| 187 | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | [C#](./src/CSharp/Solutions/Solution187.cs) | Medium |
| 188 | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv) | [C#](./src/CSharp/Solutions/Solution188.cs) | Hard |
| 189 | [Rotate Array](https://leetcode.com/problems/rotate-array) | [C#](./src/CSharp/Solutions/Solution189.cs) | Medium |
| 190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits) | [C#](./src/CSharp/Solutions/Solution190.cs) | Easy |
| 191 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits) | [C#](./src/CSharp/Solutions/Solution191.cs) | Easy |
| 192 | [Word Frequency](https://leetcode.com/problems/word-frequency) | [Shell](./src/Shell/Solution192.sh) | Medium |
| 193 | [Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers) | [Shell](./src/Shell/Solution193.sh) | Easy |
| 194 | [Transpose File](https://leetcode.com/problems/transpose-file) | [Shell](./src/Shell/Solution194.sh) | Medium |
| 195 | [Tenth Line](https://leetcode.com/problems/tenth-line) | [Shell](./src/Shell/Solution195.sh) | Easy |
| 196 | [Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails) | [SQL](./src/SQL/Solution196.sql) | Easy |
| 197 | [Rising Temperature](https://leetcode.com/problems/rising-temperature) | [SQL](./src/SQL/Solution197.sql) | Easy |
| 198 | [House Robber](https://leetcode.com/problems/house-robber) | [C#](./src/CSharp/Solutions/Solution198.cs) | Medium |
| 199 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) | [C#](./src/CSharp/Solutions/Solution199.cs) | Medium |
| 200 | [Number of Islands](https://leetcode.com/problems/number-of-islands) | [C#](./src/CSharp/Solutions/Solution200.cs) | Medium |
| 201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range) | [C#](./src/CSharp/Solutions/Solution201.cs) | Medium |
| 202 | [Happy Number](https://leetcode.com/problems/happy-number) | [C#](./src/CSharp/Solutions/Solution202.cs) | Easy |
| 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | [C#](./src/CSharp/Solutions/Solution203.cs) | Easy |
| 204 | [Count Primes](https://leetcode.com/problems/count-primes) | [C#](./src/CSharp/Solutions/Solution204.cs) | Easy |
| 205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | [C#](./src/CSharp/Solutions/Solution205.cs) | Easy |
| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | [C#](./src/CSharp/Solutions/Solution206.cs) | Easy |
| 207 | [Course Schedule](https://leetcode.com/problems/course-schedule) | [C#](./src/CSharp/Solutions/Solution207.cs) | Medium |
| 208 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree) | [C#](./src/CSharp/Solutions/Solution208.cs) | Medium |
| 209 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum) | [C#](./src/CSharp/Solutions/Solution209.cs) | Medium |
| 210 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii) | [C#](./src/CSharp/Solutions/Solution210.cs) | Medium |
| 211 | [Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure) | [C#](./src/CSharp/Solutions/Solution211.cs) | Medium |
| 212 | [Word Search II](https://leetcode.com/problems/word-search-ii) | [C#](./src/CSharp/Solutions/Solution212.cs) | Hard |
| 213 | [House Robber II](https://leetcode.com/problems/house-robber-ii) | [C#](./src/CSharp/Solutions/Solution213.cs) | Medium |
| 214 | [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome) | [C#](./src/CSharp/Solutions/Solution214.cs) | Hard |
| 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | [C#](./src/CSharp/Solutions/Solution215.cs) | Medium |
| 216 | [Combination Sum III](https://leetcode.com/problems/combination-sum-iii) | [C#](./src/CSharp/Solutions/Solution216.cs) | Medium |
| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | [C#](./src/CSharp/Solutions/Solution217.cs) | Easy |
| 218 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | [C#](./src/CSharp/Solutions/Solution218.cs) | Hard |
| 219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii) | [C#](./src/CSharp/Solutions/Solution219.cs) | Medium |
| 220 | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii) | [C#](./src/CSharp/Solutions/Solution220.cs) | Hard |
| 221 | [Maximal Square](https://leetcode.com/problems/maximal-square) | [C#](./src/CSharp/Solutions/Solution221.cs) | Medium |
| 222 | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes) | [C#](./src/CSharp/Solutions/Solution222.cs) | Medium |
| 223 | [Rectangle Area](https://leetcode.com/problems/rectangle-area) | [C#](./src/CSharp/Solutions/Solution223.cs) | Medium |
| 224 | [Basic Calculator](https://leetcode.com/problems/basic-calculator) | [C#](./src/CSharp/Solutions/Solution224.cs) | Hard |
| 225 | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues) | [C#](./src/CSharp/Solutions/Solution225.cs) | Easy |
| 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) | [C#](./src/CSharp/Solutions/Solution226.cs) | Easy |
| 227 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii) | [C#](./src/CSharp/Solutions/Solution227.cs) | Medium |
| 228 | [Summary Ranges](https://leetcode.com/problems/summary-ranges) | [C#](./src/CSharp/Solutions/Solution228.cs) | Easy |
| 229 | [Majority Element II](https://leetcode.com/problems/majority-element-ii) | [C#](./src/CSharp/Solutions/Solution229.cs) | Medium |
| 230 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | [C#](./src/CSharp/Solutions/Solution230.cs) | Medium |
| 231 | [Power of Two](https://leetcode.com/problems/power-of-two) | [C#](./src/CSharp/Solutions/Solution231.cs) | Easy |
| 232 | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks) | [C#](./src/CSharp/Solutions/Solution232.cs) | Easy |
| 233 | [Number of Digit One](https://leetcode.com/problems/number-of-digit-one) | [C#](./src/CSharp/Solutions/Solution233.cs) | Hard |
| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list) | [C#](./src/CSharp/Solutions/Solution234.cs) | Easy |
| 235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | [C#](./src/CSharp/Solutions/Solution235.cs) | Easy |
| 236 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | [C#](./src/CSharp/Solutions/Solution236.cs) | Medium |
| 237 | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list) | [C#](./src/CSharp/Solutions/Solution237.cs) | Easy |
| 238 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self) | [C#](./src/CSharp/Solutions/Solution238.cs) | Medium
| 239 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum) | [C#](./src/CSharp/Solutions/Solution239.cs) | Hard |
| 240 | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii) | [C#](./src/CSharp/Solutions/Solution240.cs) | Medium |
| 241 | [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses) | [C#](./src/CSharp/Solutions/Solution241.cs) | Medium |
| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | [C#](./src/CSharp/Solutions/Solution242.cs) | Easy |
| 257 | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths) | [C#](./src/CSharp/Solutions/Solution257.cs) | Easy |
| 258 | [Add Digits](https://leetcode.com/problems/add-digits) | [C#](./src/CSharp/Solutions/Solution258.cs) | Easy |
| 260 | [Single Number III](https://leetcode.com/problems/single-number-iii) | [C#](./src/CSharp/Solutions/Solution260.cs) | Medium |
| 263 | [Ugly Number](https://leetcode.com/problems/ugly-number) | [C#](./src/CSharp/Solutions/Solution263.cs) | Easy |
| 264 | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii) | [C#](./src/CSharp/Solutions/Solution264.cs) | Medium |
| 268 | [Missing Number](https://leetcode.com/problems/missing-number) | [C#](./src/CSharp/Solutions/Solution268.cs) | Easy |
| 273 | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words) | [C#](./src/CSharp/Solutions/Solution273.cs) | Hard |
| 274 | [H-Index](https://leetcode.com/problems/h-index) | [C#](./src/CSharp/Solutions/Solution274.cs) | Medium |
| 275 | [H-Index II](https://leetcode.com/problems/h-index-ii) | [C#](./src/CSharp/Solutions/Solution275.cs) | Medium |
| 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version) | [C#](./src/CSharp/Solutions/Solution278.cs) | Easy |
| 279 | [Perfect Squares](https://leetcode.com/problems/perfect-squares) | [C#](./src/CSharp/Solutions/Solution279.cs) | Medium |
| 282 | [Expression Add Operators](https://leetcode.com/problems/expression-add-operators) | [C#](./src/CSharp/Solutions/Solution282.cs) | Hard |
| 283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | [C#](./src/CSharp/Solutions/Solution283.cs) | Easy |
| 284 | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator) | [C#](./src/CSharp/Solutions/Solution284.cs) | Medium |
| 287 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | [C#](./src/CSharp/Solutions/Solution287.cs) | Medium |
| 289 | [Game of Life](https://leetcode.com/problems/game-of-life) | [C#](./src/CSharp/Solutions/Solution289.cs) | Medium |
| 290 | [Word Pattern](https://leetcode.com/problems/word-pattern) | [C#](./src/CSharp/Solutions/Solution290.cs) | Easy |
| 292 | [Nim Game](https://leetcode.com/problems/nim-game) | [C#](./src/CSharp/Solutions/Solution292.cs) | Easy |
| 295 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | [C#](./src/CSharp/Solutions/Solution295.cs) | Hard |
| 297 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | [C#](./src/CSharp/Solutions/Solution297.cs) | Hard |
| 299 | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | [C#](./src/CSharp/Solutions/Solution299.cs) | Medium |
| 300 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | [C#](./src/CSharp/Solutions/Solution300.cs) | Medium |
| 301 | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses) | [C#](./src/CSharp/Solutions/Solution301.cs) | Hard |
| 303 | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable) | [C#](./src/CSharp/Solutions/Solution303.cs) | Easy |
| 304 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable) | [C#](./src/CSharp/Solutions/Solution304.cs) | Medium |
| 306 | [Additive Number](https://leetcode.com/problems/additive-number) | [C#](./src/CSharp/Solutions/Solution306.cs) | Medium |
| 307 | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable) | [C#](./src/CSharp/Solutions/Solution307.cs) | Medium |
| 308 | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable) | [C#](./src/CSharp/Solutions/Solution308.cs) | Hard |
| 309 | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown) | [C#](./src/CSharp/Solutions/Solution309.cs) | Medium |
| 310 | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees) | [C#](./src/CSharp/Solutions/Solution310.cs) | Medium |
| 312 | [Burst Balloons](https://leetcode.com/problems/burst-balloons) | [C#](./src/CSharp/Solutions/Solution312.cs) | Hard |
| 315 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | [C#](./src/CSharp/Solutions/Solution315.cs) | Hard |
| 316 | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters) | [C#](./src/CSharp/Solutions/Solution316.cs) | Medium |
| 318 | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths) | [C#](./src/CSharp/Solutions/Solution318.cs) | Medium |
| 319 | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher) | [C#](./src/CSharp/Solutions/Solution319.cs) | Medium |
| 321 | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number) | [C#](./src/CSharp/Solutions/Solution321.cs) | Hard |
| 322 | [Coin Change](https://leetcode.com/problems/coin-change) | [C#](./src/CSharp/Solutions/Solution322.cs) | Medium |
| 324 | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii) | [C#](./src/CSharp/Solutions/Solution324.cs) | Medium |
| 327 | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum) | [C#](./src/CSharp/Solutions/Solution327.cs) | Hard |
| 328 | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list) | [C#](./src/CSharp/Solutions/Solution328.cs) | Medium |
| 329 | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | [C#](./src/CSharp/Solutions/Solution329.cs) | Hard |
| 330 | [Patching Array](https://leetcode.com/problems/patching-array) | [C#](./src/CSharp/Solutions/Solution330.cs) | Hard |
| 331 | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree) | [C#](./src/CSharp/Solutions/Solution331.cs) | Medium |
| 332 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | [C#](./src/CSharp/Solutions/Solution332.cs) | Medium |
| 334 | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence) | [C#](./src/CSharp/Solutions/Solution334.cs) | Medium |
| 335 | [Self Crossing](https://leetcode.com/problems/self-crossing) | [C#](./src/CSharp/Solutions/Solution335.cs) | Hard |
| 337 | [House Robber III](https://leetcode.com/problems/house-robber-iii) | [C#](./src/CSharp/Solutions/Solution337.cs) | Medium |
| 338 | [Counting Bits](https://leetcode.com/problems/counting-bits) | [C#](./src/CSharp/Solutions/Solution338.cs) | Medium |
| 341 | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator) | [C#](./src/CSharp/Solutions/Solution341.cs) | Medium |
| 342 | [Power of Four](https://leetcode.com/problems/power-of-four) | [C#](./src/CSharp/Solutions/Solution342.cs) | Easy |
| 343 | [Integer Break](https://leetcode.com/problems/integer-break) | [C#](./src/CSharp/Solutions/Solution343.cs) | Medium |
| 344 | [Reverse String](https://leetcode.com/problems/reverse-string) | [C#](./src/CSharp/Solutions/Solution344.cs) | Easy |
| 345 | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | [C#](./src/CSharp/Solutions/Solution345.cs) | Easy |
| 347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | [C#](./src/CSharp/Solutions/Solution347.cs) | Medium |
| 349 | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | [C#](./src/CSharp/Solutions/Solution349.cs) | Easy |
| 350 | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii) | [C#](./src/CSharp/Solutions/Solution350.cs) | Easy |
| 352 | [Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals) | [C#](./src/CSharp/Solutions/Solution352.cs) | Hard |
| 355 | [Design Twitter](https://leetcode.com/problems/design-twitter) | [C#](./src/CSharp/Solutions/Solution355.cs) | Medium |
| 357 | [Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits) | [C#](./src/CSharp/Solutions/Solution357.cs) | Medium |
| 365 | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem) | [C#](./src/CSharp/Solutions/Solution365.cs) | Medium |
| 367 | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | [C#](./src/CSharp/Solutions/Solution367.cs) | Easy |
| 368 | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset) | [C#](./src/CSharp/Solutions/Solution368.cs) | Medium |
| 371 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers) | [C#](./src/CSharp/Solutions/Solution371.cs) | Easy |
| 372 | [Super Pow](https://leetcode.com/problems/super-pow) | [C#](./src/CSharp/Solutions/Solution372.cs) | Medium |
| 373 | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums) | [C#](./src/CSharp/Solutions/Solution373.cs) | Medium |
| 374 | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower) | [C#](./src/CSharp/Solutions/Solution374.cs) | Easy |
| 375 | [Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii) | [C#](./src/CSharp/Solutions/Solution375.cs) | Medium |
| 376 | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence) | [C#](./src/CSharp/Solutions/Solution376.cs) | Medium |
| 377 | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv) | [C#](./src/CSharp/Solutions/Solution377.cs) | Medium |
| 378 | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix) | [C#](./src/CSharp/Solutions/Solution378.cs) | Medium |
| 380 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1) | [C#](./src/CSharp/Solutions/Solution380.cs) | Medium |
| 381 | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed) | [C#](./src/CSharp/Solutions/Solution381.cs) | Hard |
| 382 | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node) | [C#](./src/CSharp/Solutions/Solution382.cs) | Medium |
| 383 | [Ransom Note](https://leetcode.com/problems/ransom-note) | [C#](./src/CSharp/Solutions/Solution380.cs) | Easy |
| 384 | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array) | [C#](./src/CSharp/Solutions/Solution384.cs) | Medium |
| 385 | [Mini Parser](https://leetcode.com/problems/mini-parser) | [C#](./src/CSharp/Solutions/Solution385.cs) | Medium |
| 386 | [Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers) | [C#](./src/CSharp/Solutions/Solution386.cs) | Medium |
| 387 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | [C#](./src/CSharp/Solutions/Solution387.cs) | Easy |
| 388 | [Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path) | [C#](./src/CSharp/Solutions/Solution388.cs) | Medium |
| 389 | [Find the Difference](https://leetcode.com/problems/find-the-difference) | [C#](./src/CSharp/Solutions/Solution389.cs) | Easy |
| 390 | [Elimination Game](https://leetcode.com/problems/elimination-game) | [C#](./src/CSharp/Solutions/Solution390.cs) | Medium |
| 391 | [Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle) | [C#](./src/CSharp/Solutions/Solution391.cs) | Hard |
| 392 | [Is Subsequence](https://leetcode.com/problems/is-subsequence) | [C#](./src/CSharp/Solutions/Solution392.cs) | Easy |
| 393 | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation) | [C#](./src/CSharp/Solutions/Solution393.cs) | Medium |
| 394 | [Decode String](https://leetcode.com/problems/decode-string) | [C#](./src/CSharp/Solutions/Solution394.cs) | Medium |
| 395 | [Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters) | [C#](./src/CSharp/Solutions/Solution395.cs) | Medium |
| 396 | [Rotate Function](https://leetcode.com/problems/rotate-function) | [C#](./src/CSharp/Solutions/Solution396.cs) | Medium |
| 397 | [Integer Replacement](https://leetcode.com/problems/integer-replacement) | [C#](./src/CSharp/Solutions/Solution397.cs) | Medium |
| 398 | [Random Pick Index](https://leetcode.com/problems/random-pick-index) | [C#](./src/CSharp/Solutions/Solution398.cs) | Medium |
| 399 | [Evaluate Division](https://leetcode.com/problems/evaluate-division) | [C#](./src/CSharp/Solutions/Solution399.cs) | Medium |
| 400 | [Nth Digit](https://leetcode.com/problems/nth-digit) | [C#](./src/CSharp/Solutions/Solution400.cs) | Easy |
| 401 | [Binary Watch](https://leetcode.com/problems/binary-watch) | [C#](./src/CSharp/Solutions/Solution401.cs) | Easy |
| 402 | [Remove K Digits](https://leetcode.com/problems/remove-k-digits) | [C#](./src/CSharp/Solutions/Solution402.cs) | Medium |
| 403 | [Frog Jump](https://leetcode.com/problems/frog-jump) | [C#](./src/CSharp/Solutions/Solution403.cs) | Hard |
| 404 | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves) | [C#](./src/CSharp/Solutions/Solution404.cs) | Easy |
| 405 | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal) | [C#](./src/CSharp/Solutions/Solution405.cs) | Easy |
| 406 | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height) | [C#](./src/CSharp/Solutions/Solution406.cs) | Medium |
| 407 | [Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii) | [C#](./src/CSharp/Solutions/Solution407.cs) | Hard |
| 409 | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | [C#](./src/CSharp/Solutions/Solution409.cs) | Easy |
| 410 | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum) | [C#](./src/CSharp/Solutions/Solution410.cs) | Hard |
| 412 | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz) | [C#](./src/CSharp/Solutions/Solution412.cs) | Easy |
| 413 | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices) | [C#](./src/CSharp/Solutions/Solution413.cs) | Medium |
| 414 | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number) | [C#](./src/CSharp/Solutions/Solution414.cs) | Easy |
| 415 | [Add Strings](https://leetcode.com/problems/add-strings) | [C#](./src/CSharp/Solutions/Solution415.cs) | Easy |
| 416 | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | [C#](./src/CSharp/Solutions/Solution416.cs) | Medium |
| 417 | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow) | [C#](./src/CSharp/Solutions/Solution417.cs) | Medium |
| 419 | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board) | [C#](./src/CSharp/Solutions/Solution419.cs) | Medium |
| 420 | [Strong Password Checker](https://leetcode.com/problems/strong-password-checker) | [C#](./src/CSharp/Solutions/Solution420.cs) | Hard |
| 421 | [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array) | [C#](./src/CSharp/Solutions/Solution421.cs) | Medium |
| 423 | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english) | [C#](./src/CSharp/Solutions/Solution423.cs) | Medium |
| 424 | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement) | [C#](./src/CSharp/Solutions/Solution424.cs) | Medium |
| 427 | [Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree) | [C#](./src/CSharp/Solutions/Solution427.cs) | Medium |
| 429 | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal) | [C#](./src/CSharp/Solutions/Solution429.cs) | Medium |
| 430 | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list) | [C#](./src/CSharp/Solutions/Solution430.cs) | Medium |
| 432 | [All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure) | [C#](./src/CSharp/Solutions/Solution432.cs) | Hard |
| 433 | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation) | [C#](./src/CSharp/Solutions/Solution433.cs) | Medium |
| 434 | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | [C#](./src/CSharp/Solutions/Solution434.cs) | Easy |
| 435 | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals) | [C#](./src/CSharp/Solutions/Solution435.cs) | Medium |
| 436 | [Find Right Interval](https://leetcode.com/problems/find-right-interval) | [C#](./src/CSharp/Solutions/Solution436.cs) | Medium |
| 437 | [Path Sum III](https://leetcode.com/problems/path-sum-iii) | [C#](./src/CSharp/Solutions/Solution437.cs) | Easy |
| 438 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string) | [C#](./src/CSharp/Solutions/Solution438.cs) | Medium |
| 440 | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order) | [C#](./src/CSharp/Solutions/Solution440.cs) | Hard |
| 441 | [Arranging Coins](https://leetcode.com/problems/arranging-coins) | [C#](./src/CSharp/Solutions/Solution441.cs) | Easy |
| 442 | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array) | [C#](./src/CSharp/Solutions/Solution442.cs) | Medium |
| 443 | [String Compression](https://leetcode.com/problems/string-compression) | [C#](./src/CSharp/Solutions/Solution443.cs) | Easy |
| 445 | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii) | [C#](./src/CSharp/Solutions/Solution445.cs) | Medium |
| 446 | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence) | [C#](./src/CSharp/Solutions/Solution446.cs) | Hard |
| 447 | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | [C#](./src/CSharp/Solutions/Solution447.cs) | Easy |
| 448 | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | [C#](./src/CSharp/Solutions/Solution448.cs) | Easy |
| 449 | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst) | [C#](./src/CSharp/Solutions/Solution449.cs) | Medium |
| 450 | [Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst) | [C#](./src/CSharp/Solutions/Solution450.cs) | Medium |
| 451 | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency) | [C#](./src/CSharp/Solutions/Solution451.cs) | Medium |
| 452 | [Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons) | [C#](./src/CSharp/Solutions/Solution452.cs) | Medium |
| 453 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements) | [C#](./src/CSharp/Solutions/Solution453.cs) | Medium |
| 454 | [4Sum II](https://leetcode.com/problems/4sum-ii) | [C#](./src/CSharp/Solutions/Solution454.cs) | Medium |
| 455 | [Assign Cookies](https://leetcode.com/problems/assign-cookies) | [C#](./src/CSharp/Solutions/Solution455.cs) | Easy |
| 456 | [132 Pattern](https://leetcode.com/problems/132-pattern) | [C#](./src/CSharp/Solutions/Solution456.cs) | Medium |
| 458 | [Poor Pigs](https://leetcode.com/problems/poor-pigs) | [C#](./src/CSharp/Solutions/Solution458.cs) | Hard |
| 459 | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern) | [C#](./src/CSharp/Solutions/Solution459.cs) | Easy |
| 460 | [LFU Cache](https://leetcode.com/problems/lfu-cache) | [C#](./src/CSharp/Solutions/Solution460.cs) | Hard |
| 461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance) | [C#](./src/CSharp/Solutions/Solution461.cs) | Easy |
| 462 | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii) | [C#](./src/CSharp/Solutions/Solution462.cs) | Medium |
| 463 | [Island Perimeter](https://leetcode.com/problems/island-perimeter) | [C#](./src/CSharp/Solutions/Solution463.cs) | Easy |
| 464 | [Can I Win](https://leetcode.com/problems/can-i-win) | [C#](./src/CSharp/Solutions/Solution464.cs) | Medium |
| 466 | [Count The Repetitions](https://leetcode.com/problems/count-the-repetitions) | [C#](./src/CSharp/Solutions/Solution466.cs) | Hard |
| 467 | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string) | [C#](./src/CSharp/Solutions/Solution467.cs) | Medium |
| 468 | [Validate IP Address](https://leetcode.com/problems/validate-ip-address) | [C#](./src/CSharp/Solutions/Solution468.cs) | Medium |
| 470 | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7) | [C#](./src/CSharp/Solutions/Solution470.cs) | Medium |
| 472 | [Concatenated Words](https://leetcode.com/problems/concatenated-words) | [C#](./src/CSharp/Solutions/Solution472.cs) | Hard |
| 473 | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square) | [C#](./src/CSharp/Solutions/Solution473.cs) | Medium |
| 474 | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes) | [C#](./src/CSharp/Solutions/Solution474.cs) | Medium |
| 475 | [Heaters](https://leetcode.com/problems/heaters) | [C#](./src/CSharp/Solutions/Solution475.cs) | Medium |
| 476 | [Number Complement](https://leetcode.com/problems/number-complement) | [C#](./src/CSharp/Solutions/Solution476.cs) | Easy |
| 477 | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance) | [C#](./src/CSharp/Solutions/Solution477.cs) | Medium |
| 478 | [Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle) | [C#](./src/CSharp/Solutions/Solution478.cs) | Medium |
| 481 | [Magical String](https://leetcode.com/problems/magical-string) | [C#](./src/CSharp/Solutions/Solution481.cs) | Medium |
| 482 | [License Key Formatting](https://leetcode.com/problems/license-key-formatting) | [C#](./src/CSharp/Solutions/Solution482.cs) | Easy |
| 483 | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base) | [C#](./src/CSharp/Solutions/Solution483.cs) | Hard |
| 485 | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones) | [C#](./src/CSharp/Solutions/Solution485.cs) | Easy |
| 486 | [Predict the Winner](https://leetcode.com/problems/predict-the-winner) | [C#](./src/CSharp/Solutions/Solution486.cs) | Medium |
| 491 | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences) | [C#](./src/CSharp/Solutions/Solution491.cs) | Medium |
| 492 | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle) | [C#](./src/CSharp/Solutions/Solution492.cs) | Easy |
| 493 | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs) | [C#](./src/CSharp/Solutions/Solution493.cs) | Hard |
| 494 | [Target Sum](https://leetcode.com/problems/target-sum) | [C#](./src/CSharp/Solutions/Solution494.cs) | Medium |
| 495 | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking) | [C#](./src/CSharp/Solutions/Solution495.cs) | Medium
| 496 | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | [C#](./src/CSharp/Solutions/Solution496.cs) | Easy |
| 497 | [Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles) | [C#](./src/CSharp/Solutions/Solution497.cs) | Medium |
| 498 | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse) | [C#](./src/CSharp/Solutions/Solution498.cs) | Medium
| 500 | [Keyboard Row](https://leetcode.com/problems/keyboard-row) | [C#](./src/CSharp/Solutions/Solution500.cs) | Easy |
| 501 | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | [C#](./src/CSharp/Solutions/Solution501.cs) | Easy |
| 502 | [IPO](https://leetcode.com/problems/ipo) | [C#](./src/CSharp/Solutions/Solution502.cs) | Hard
| 503 | [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii) | [C#](./src/CSharp/Solutions/Solution503.cs) | Medium |
| 504 | [Base 7](https://leetcode.com/problems/base-7) | [C#](./src/CSharp/Solutions/Solution504.cs) | Easy |
| 506 | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | [C#](./src/CSharp/Solutions/Solution506.cs) | Easy |
| 507 | [Perfect Number](https://leetcode.com/problems/perfect-number) | [C#](./src/CSharp/Solutions/Solution507.cs) | Easy |
| 508 | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum) | [C#](./src/CSharp/Solutions/Solution508.cs) | Medium |
| 509 | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number) | [C#](./src/CSharp/Solutions/Solution509.cs) | Easy |
| 511 | [Game Play Analysis I](https://leetcode.com/problems/game-play-analysis-i) | [SQL](./src/SQL/Solutions/Solution511.sql) | Easy |
| 513 | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value) | [C#](./src/CSharp/Solutions/Solution513.cs) | Medium |
| 514 | [Freedom Trail](https://leetcode.com/problems/freedom-trail) | [C#](./src/CSharp/Solutions/Solution514.cs) | Hard |
| 515 | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row) | [C#](./src/CSharp/Solutions/Solution515.cs) | Medium |
| 516 | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence) | [C#](./src/CSharp/Solutions/Solution516.cs) | Medium |
| 517 | [Super Washing Machines](https://leetcode.com/problems/super-washing-machines) | [C#](./src/CSharp/Solutions/Solution517.cs) | Hard |
| 518 | [Coin Change 2](https://leetcode.com/problems/coin-change-2) | [C#](./src/CSharp/Solutions/Solution518.cs) | Medium |
| 519 | [Random Flip Matrix](https://leetcode.com/problems/random-flip-matrix) | [C#](./src/CSharp/Solutions/Solution519.cs) | Medium |
| 520 | [Detect Capital](https://leetcode.com/problems/detect-capital) | [C#](./src/CSharp/Solutions/Solution520.cs) | Easy |
| 521 | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i) | [C#](./src/CSharp/Solutions/Solution521.cs) | Easy |
| 522 | [Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii) | [C#](./src/CSharp/Solutions/Solution522.cs) | Medium |
| 523 | [Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum) | [C#](./src/CSharp/Solutions/Solution523.cs) | Medium |
| 524 | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting) | [C#](./src/CSharp/Solutions/Solution524.cs) | Medium |
| 525 | [Contiguous Array](https://leetcode.com/problems/contiguous-array) | [C#](./src/CSharp/Solutions/Solution525.cs) | Medium |
| 526 | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement) | [C#](./src/CSharp/Solutions/Solution526.cs) | Medium |
| 528 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight) | [C#](./src/CSharp/Solutions/Solution528.cs) | Medium |
| 529 | [Minesweeper](https://leetcode.com/problems/minesweeper) | [C#](./src/CSharp/Solutions/Solution529.cs) | Medium |
| 530 | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | [C#](./src/CSharp/Solutions/Solution530.cs) | Easy |
| 532 | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | [C#](./src/CSharp/Solutions/Solution532.cs) | Medium |
| 535 | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl) | [C#](./src/CSharp/Solutions/Solution535.cs) | Medium |
| 537 | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication) | [C#](./src/CSharp/Solutions/Solution537.cs) | Medium |
| 538 | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree) | [C#](./src/CSharp/Solutions/Solution538.cs) | Easy |
| 539 | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference) | [C#](./src/CSharp/Solutions/Solution539.cs) | Medium |
| 540 | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array) | [C#](./src/CSharp/Solutions/Solution540.cs) | Medium |
| 541 | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | [C#](./src/CSharp/Solutions/Solution541.cs) | Easy |
| 542 | [01 Matrix](https://leetcode.com/problems/01-matrix) | [C#](./src/CSharp/Solutions/Solution542.cs) | Medium |
| 543 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | [C#](./src/CSharp/Solutions/Solution543.cs) | Easy |
| 546 | [Remove Boxes](https://leetcode.com/problems/remove-boxes) | [C#](./src/CSharp/Solutions/Solution546.cs) | Hard |
| 547 | [Number of Provinces](https://leetcode.com/problems/number-of-provinces) | [C#](./src/CSharp/Solutions/Solution547.cs) | Medium |
| 550 | [Game Play Analysis IV](https://leetcode.com/problems/game-play-analysis-iv) | [SQL](./src/SQL/Solutions/Solution550.sql) | Easy |
| 551 | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | [C#](./src/CSharp/Solutions/Solution551.cs) | Easy |
| 552 | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii) | [C#](./src/CSharp/Solutions/Solution552.cs) | Hard |
| 553 | [Optimal Division](https://leetcode.com/problems/optimal-division) | [C#](./src/CSharp/Solutions/Solution553.cs) | Medium |
| 554 | [Brick Wall](https://leetcode.com/problems/brick-wall) | [C#](./src/CSharp/Solutions/Solution554.cs) | Medium |
| 556 | [Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii) | [C#](./src/CSharp/Solutions/Solution556.cs) | Medium |
| 557 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | [C#](./src/CSharp/Solutions/Solution557.cs) | Easy |
| 558 | [Logical OR of Two Binary Grids Represented as Quad-Trees](https://leetcode.com/problems/logical-or-of-two-binary-grids-represented-as-quad-trees) | [C#](./src/CSharp/Solutions/Solution558.cs) | Medium |
| 559 | [Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | [C#](./src/CSharp/Solutions/Solution559.cs) | Easy |
| 560 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) | [C#](./src/CSharp/Solutions/Solution560.cs) | Medium |
| 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i) | [C#](./src/CSharp/Solutions/Solution561.cs) | Easy |
| 563 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | [C#](./src/CSharp/Solutions/Solution563.cs) | Easy |
| 565 | [Array Nesting](https://leetcode.com/problems/array-nesting) | [C#](./src/CSharp/Solutions/Solution565.cs) | Medium |
| 566 | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix) | [C#](./src/CSharp/Solutions/Solution566.cs) | Easy |
| 567 | [Permutation in String](https://leetcode.com/problems/permutation-in-string) | [C#](./src/CSharp/Solutions/Solution567.cs) | Medium |
| 570 | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) | [SQL](./src/SQL/Solutions/Solution570.sql) | Medium |
| 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | [C#](./src/CSharp/Solutions/Solution572.cs) | Easy |
| 575 | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | [C#](./src/CSharp/Solutions/Solution575.cs) | Easy |
| 576 | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths) | [C#](./src/CSharp/Solutions/Solution576.cs) | Medium |
| 577 | [Employee Bonus](https://leetcode.com/problems/employee-bonus) | [SQL](./src/SQL/Solutions/Solution577.sql) | Easy |
| 581 | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | [C#](./src/CSharp/Solutions/Solution581.cs) | Medium |
| 583 | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings) | [C#](./src/CSharp/Solutions/Solution583.cs) | Medium |
| 584 | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee) | [SQL](./src/SQL/Solutions/Solution584.sql) | Easy |
| 585 | [Investments in 2016](https://leetcode.com/problems/investments-in-2016) | [SQL](./src/SQL/Solutions/Solution585.sql) | Medium |
| 586 | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders) | [SQL](./src/SQL/Solutions/Solution586.sql) | Easy |
| 587 | [Erect the Fence](https://leetcode.com/problems/erect-the-fence) | [C#](./src/CSharp/Solutions/Solution587.cs) | Hard |
| 589 | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | [C#](./src/CSharp/Solutions/Solution589.cs) | Easy |
| 590 | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | [C#](./src/CSharp/Solutions/Solution590.cs) | Easy |
| 591 | [Tag Validator](https://leetcode.com/problems/tag-validator) | [C#](./src/CSharp/Solutions/Solution591.cs) | Hard |
| 592 | [Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction) | [C#](./src/CSharp/Solutions/Solution592.cs) | Medium |
| 593 | [Valid Square](https://leetcode.com/problems/valid-square) | [C#](./src/CSharp/Solutions/Solution593.cs) | Medium |
| 594 | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | [C#](./src/CSharp/Solutions/Solution594.cs) | Easy |
| 595 | [Big Countries](https://leetcode.com/problems/big-countries) | [SQL](./src/SQL/Solutions/Solution595.sql) | Easy |
| 596 | [Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [SQL](./src/SQL/Solutions/Solution596.sql) | Easy |
| 598 | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | [C#](./src/CSharp/Solutions/Solution598.cs) | Easy |
| 599 | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [C#](./src/CSharp/Solutions/Solution599.cs) | Easy |
| 600 | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones) | [C#](./src/CSharp/Solutions/Solution600.cs) | Hard |
| 601 | [Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium) | [SQL](./src/SQL/Solutions/Solution601.sql) | Hard |
| 602 | [Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate) | [SQL](./src/SQL/Solutions/Solution602.sql) | Medium |
| 605 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | [C#](./src/CSharp/Solutions/Solution605.cs) | Easy |
| 606 | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | [C#](./src/CSharp/Solutions/Solution606.cs) | Easy |
| 607 | [Sales Person](https://leetcode.com/problems/sales-person) | [SQL](./src/SQL/Solutions/Solution607.sql) | Easy |
| 608 | [Tree Node](https://leetcode.com/problems/tree-node) | [SQL](./src/SQL/Solutions/Solution608.sql) | Easy |
| 609 | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system) | [C#](./src/CSharp/Solutions/Solution609.cs) | Medium |
| 610 | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement) | [SQL](./src/SQL/Solutions/Solution610.sql) | Easy |
| 611 | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number) | [C#](./src/CSharp/Solutions/Solution611.cs) | Medium |
| 617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [C#](./src/CSharp/Solutions/Solution617.cs) | Easy |
| 619 | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) | [SQL](./src/SQL/Solutions/Solution619.sql) | Easy |
| 620 | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies) | [SQL](./src/SQL/Solutions/Solution620.sql) | Easy |
| 621 | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | [C#](./src/CSharp/Solutions/Solution621.cs) | Medium |
| 622 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue) | [C#](./src/CSharp/Solutions/Solution622.cs) | Medium |
| 623 | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree) | [C#](./src/CSharp/Solutions/Solution623.cs) | Medium |
| 624 | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) | [C#](./src/CSharp/Solutions/Solution624.cs) | Medium |
| 626 | [Exchange Seats](https://leetcode.com/problems/exchange-seats) | [SQL](./src/SQL/Solutions/Solution626.sql) | Medium |
| 627 | [Swap Salary](https://leetcode.com/problems/swap-salary) | [SQL](./src/SQL/Solutions/Solution627.sql) | Easy |
| 628 | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | [C#](./src/CSharp/Solutions/Solution628.cs) | Easy |
| 629 | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array) | [C#](./src/CSharp/Solutions/Solution629.cs) | Hard |
| 630 | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii) | [C#](./src/CSharp/Solutions/Solution630.cs) | Hard |
| 633 | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | [C#](./src/CSharp/Solutions/Solution633.cs) | Medium |
| 636 | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | [C#](./src/CSharp/Solutions/Solution636.cs) | Medium |
| 637 | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | [C#](./src/CSharp/Solutions/Solution637.cs) | Easy |
| 638 | [Shopping Offers](https://leetcode.com/problems/shopping-offers) | [C#](./src/CSharp/Solutions/Solution638.cs) | Medium |
| 639 | [Decode Ways II](https://leetcode.com/problems/decode-ways-ii) | [C#](./src/CSharp/Solutions/Solution639.cs) | Hard |
| 640 | [Solve the Equation](https://leetcode.com/problems/solve-the-equation) | [C#](./src/CSharp/Solutions/Solution640.cs) | Medium |
| 641 | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque) | [C#](./src/CSharp/Solutions/Solution641.cs) | Medium |
| 643 | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i) | [C#](./src/CSharp/Solutions/Solution643.cs) | Easy |
| 645 | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [C#](./src/CSharp/Solutions/Solution645.cs) | Easy |
| 646 | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain) | [C#](./src/CSharp/Solutions/Solution646.cs) | Medium |
| 647 | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings) | [C#](./src/CSharp/Solutions/Solution647.cs) | Medium |
| 648 | [Replace Words](https://leetcode.com/problems/replace-words) | [C#](./src/CSharp/Solutions/Solution648.cs) | Medium |
| 649 | [Dota2 Senate](https://leetcode.com/problems/dota2-senate) | [C#](./src/CSharp/Solutions/Solution649.cs) | Medium |
| 650 | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard) | [C#](./src/CSharp/Solutions/Solution650.cs) | Medium |
| 652 | [Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees) | [C#](./src/CSharp/Solutions/Solution652.cs) | Medium |
| 653 | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | [C#](./src/CSharp/Solutions/Solution653.cs) | Easy |
| 654 | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree) | [C#](./src/CSharp/Solutions/Solution654.cs) | Medium |
| 655 | [Print Binary Tree](https://leetcode.com/problems/print-binary-tree) | [C#](./src/CSharp/Solutions/Solution655.cs) | Medium |
| 657 | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | [C#](./src/CSharp/Solutions/Solution657.cs) | Easy |
| 658 | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | [C#](./src/CSharp/Solutions/Solution658.cs) | Medium |
| 659 | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences) | [C#](./src/CSharp/Solutions/Solution659.cs) | Medium |
| 661 | [Image Smoother](https://leetcode.com/problems/image-smoother) | [C#](./src/CSharp/Solutions/Solution661.cs) | Easy |
| 662 | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree) | [C#](./src/CSharp/Solutions/Solution662.cs) | Medium |
| 664 | [Strange Printer](https://leetcode.com/problems/strange-printer) | [C#](./src/CSharp/Solutions/Solution664.cs) | Hard |
| 665 | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array) | [C#](./src/CSharp/Solutions/Solution665.cs) | Easy |
| 667 | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii) | [C#](./src/CSharp/Solutions/Solution667.cs) | Medium |
| 668 | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table) | [C#](./src/CSharp/Solutions/Solution668.cs) | Hard |
| 669 | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | [C#](./src/CSharp/Solutions/Solution669.cs) | Medium |
| 670 | [Maximum Swap](https://leetcode.com/problems/maximum-swap) | [C#](./src/CSharp/Solutions/Solution670.cs) | Medium |
| 671 | [Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree) | [C#](./src/CSharp/Solutions/Solution671.cs) | Easy |
| 672 | [Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii) | [C#](./src/CSharp/Solutions/Solution672.cs) | Medium |
| 673 | [Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence) | [C#](./src/CSharp/Solutions/Solution673.cs) | Medium |
| 674 | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | [C#](./src/CSharp/Solutions/Solution674.cs) | Easy |
| 675 | [Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event) | [C#](./src/CSharp/Solutions/Solution675.cs) | Hard |
| 676 | [Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary) | [C#](./src/CSharp/Solutions/Solution676.cs) | Medium |
| 677 | [Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs) | [C#](./src/CSharp/Solutions/Solution677.cs) | Medium |
| 678 | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string) | [C#](./src/CSharp/Solutions/Solution678.cs) | Medium |
| 679 | [24 Game](https://leetcode.com/problems/24-game) | [C#](./src/CSharp/Solutions/Solution679.cs) | Hard |
| 680 | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii) | [C#](./src/CSharp/Solutions/Solution680.cs) | Easy |
| 682 | [Baseball Game](https://leetcode.com/problems/baseball-game) | [C#](./src/CSharp/Solutions/Solution682.cs) | Easy |
| 684 | [Redundant Connection](https://leetcode.com/problems/redundant-connection) | [C#](./src/CSharp/Solutions/Solution684.cs) | Medium |
| 685 | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii) | [C#](./src/CSharp/Solutions/Solution685.cs) | Hard |
| 686 | [Repeated String Match](https://leetcode.com/problems/repeated-string-match) | [C#](./src/CSharp/Solutions/Solution686.cs) | Easy |
| 687 | [Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path) | [C#](./src/CSharp/Solutions/Solution687.cs) | Easy |
| 688 | [Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard) | [C#](./src/CSharp/Solutions/Solution688.cs) | Medium |
| 689 | [Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays) | [C#](./src/CSharp/Solutions/Solution689.cs) | Hard |
| 690 | [Employee Importance](https://leetcode.com/problems/employee-importance) | [C#](./src/CSharp/Solutions/Solution690.cs) | Easy |
| 691 | [Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word) | [C#](./src/CSharp/Solutions/Solution691.cs) | Hard |
| 692 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words) | [C#](./src/CSharp/Solutions/Solution692.cs) | Medium |
| 693 | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits) | [C#](./src/CSharp/Solutions/Solution693.cs) | Easy |
| 695 | [Max Area of Island](https://leetcode.com/problems/max-area-of-island) | [C#](./src/CSharp/Solutions/Solution695.cs) | Medium |
| 696 | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings) | [C#](./src/CSharp/Solutions/Solution696.cs) | Easy |
| 697 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | [C#](./src/CSharp/Solutions/Solution697.cs) | Easy |
| 698 | [Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets) | [C#](./src/CSharp/Solutions/Solution698.cs) | Medium |
| 699 | [Falling Squares](https://leetcode.com/problems/falling-squares) | [C#](./src/CSharp/Solutions/Solution699.cs) | Hard |
| 700 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | [C#](./src/CSharp/Solutions/Solution700.cs) | Easy |
| 701 | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree) | [C#](./src/CSharp/Solutions/Solution701.cs) | Medium |
| 703 | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [C#](./src/CSharp/Solutions/Solution703.cs) | Easy |
| 704 | [Binary Search](https://leetcode.com/problems/binary-search) | [C#](./src/CSharp/Solutions/Solution704.cs) | Easy |
| 705 | [Design HashSet](https://leetcode.com/problems/design-hashset) | [C#](./src/CSharp/Solutions/Solution705.cs) | Easy |
| 706 | [Design HashMap](https://leetcode.com/problems/design-hashmap) | [C#](./src/CSharp/Solutions/Solution706.cs) | Easy |
| 707 | [Design Linked List](https://leetcode.com/problems/design-linked-list) | [C#](./src/CSharp/Solutions/Solution707.cs) | Medium |
| 709 | [To Lower Case](https://leetcode.com/problems/to-lower-case) | [C#](./src/CSharp/Solutions/Solution709.cs) | Easy |
| 710 | [Random Pick with Blacklist](https://leetcode.com/problems/random-pick-with-blacklist) | [C#](./src/CSharp/Solutions/Solution710.cs) | Hard |
| 712 | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings) | [C#](./src/CSharp/Solutions/Solution712.cs) | Medium |
| 713 | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k) | [C#](./src/CSharp/Solutions/Solution713.cs) | Medium |
| 714 | [Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [C#](./src/CSharp/Solutions/Solution714.cs) | Medium |
| 717 | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters) | [C#](./src/CSharp/Solutions/Solution717.cs) | Easy |
| 718 | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray) | [C#](./src/CSharp/Solutions/Solution718.cs) | Medium |
| 719 | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance) | [C#](./src/CSharp/Solutions/Solution719.cs) | Hard |
| 720 | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary) | [C#](./src/CSharp/Solutions/Solution720.cs) | Easy |
| 722 | [Remove Comments](https://leetcode.com/problems/remove-comments) | [C#](./src/CSharp/Solutions/Solution722.cs) | Medium |
| 724 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index) | [C#](./src/CSharp/Solutions/Solution724.cs) | Easy |
| 725 | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts) | [C#](./src/CSharp/Solutions/Solution725.cs) | Medium |
| 728 | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers) | [C#](./src/CSharp/Solutions/Solution728.cs) | Easy |
| 729 | [My Calendar I](https://leetcode.com/problems/my-calendar-i) | [C#](./src/CSharp/Solutions/Solution729.cs) | Medium |
| 731 | [My Calendar II](https://leetcode.com/problems/my-calendar-ii) | [C#](./src/CSharp/Solutions/Solution731.cs) | Medium |
| 732 | [My Calendar III](https://leetcode.com/problems/my-calendar-iii) | [C#](./src/CSharp/Solutions/Solution732.cs) | Hard |
| 733 | [Flood Fill](https://leetcode.com/problems/flood-fill) | [C#](./src/CSharp/Solutions/Solution733.cs) | Easy |
| 735 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision) | [C#](./src/CSharp/Solutions/Solution735.cs) | Medium |
| 736 | [Parse Lisp Expression](https://leetcode.com/problems/parse-lisp-expression) | [C#](./src/CSharp/Solutions/Solution736.cs) | Hard |
| 738 | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits) | [C#](./src/CSharp/Solutions/Solution738.cs) | Medium |
| 739 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | [C#](./src/CSharp/Solutions/Solution739.cs) | Medium |
| 740 | [Delete and Earn](https://leetcode.com/problems/delete-and-earn) | [C#](./src/CSharp/Solutions/Solution740.cs) | Medium |
| 741 | [Cherry Pickup](https://leetcode.com/problems/cherry-pickup) | [C#](./src/CSharp/Solutions/Solution741.cs) | Hard |
| 743 | [Network Delay Time](https://leetcode.com/problems/network-delay-time) | [C#](./src/CSharp/Solutions/Solution743.cs) | Medium |
| 744 | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | [C#](./src/CSharp/Solutions/Solution744.cs) | Easy |
| 746 | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs) | [C#](./src/CSharp/Solutions/Solution746.cs) | Easy |
| 747 | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others) | [C#](./src/CSharp/Solutions/Solution747.cs) | Easy |
| 748 | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word) | [C#](./src/CSharp/Solutions/Solution748.cs) | Easy |
| 749 | [Contain Virus](https://leetcode.com/problems/contain-virus) | [C#](./src/CSharp/Solutions/Solution749.cs) | Hard |
| 752 | [Open the Lock](https://leetcode.com/problems/open-the-lock) | [C#](./src/CSharp/Solutions/Solution752.cs) | Medium |
| 753 | [Cracking the Safe](https://leetcode.com/problems/cracking-the-safe) | [C#](./src/CSharp/Solutions/Solution753.cs) | Hard |
| 754 | [Reach a Number](https://leetcode.com/problems/reach-a-number) | [C#](./src/CSharp/Solutions/Solution754.cs) | Medium |
| 756 | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix) | [C#](./src/CSharp/Solutions/Solution756.cs) | Medium |
| 761 | [Special Binary String](https://leetcode.com/problems/special-binary-string) | [C#](./src/CSharp/Solutions/Solution761.cs) | Hard |
| 762 | [Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | [C#](./src/CSharp/Solutions/Solution762.cs) | Easy |
| 763 | [Partition Labels](https://leetcode.com/problems/partition-labels) | [C#](./src/CSharp/Solutions/Solution763.cs) | Medium |
| 764 | [Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign) | [C#](./src/CSharp/Solutions/Solution764.cs) | Medium |
| 765 | [Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands) | [C#](./src/CSharp/Solutions/Solution765.cs) | Hard |
| 766 | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix) | [C#](./src/CSharp/Solutions/Solution766.cs) | Easy |
| 767 | [Reorganize String](https://leetcode.com/problems/reorganize-string) | [C#](./src/CSharp/Solutions/Solution767.cs) | Medium |
| 768 | [Max Chunks To Make Sorted II](https://leetcode.com/problems/max-chunks-to-make-sorted-ii) | [C#](./src/CSharp/Solutions/Solution768.cs) | Hard |
| 769 | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted) | [C#](./src/CSharp/Solutions/Solution769.cs) | Medium |
| 771 | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones) | [C#](./src/CSharp/Solutions/Solution771.cs) | Easy |
| 773 | [Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle) | [C#](./src/CSharp/Solutions/Solution773.cs) | Hard |
| 775 | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions) | [C#](./src/CSharp/Solutions/Solution775.cs) | Medium |
| 777 | [Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string) | [C#](./src/CSharp/Solutions/Solution777.cs) | Medium |
| 778 | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water) | [C#](./src/CSharp/Solutions/Solution778.cs) | Hard |
| 779 | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar) | [C#](./src/CSharp/Solutions/Solution779.cs) | Medium |
| 780 | [Reaching Points](https://leetcode.com/problems/reaching-points) | [C#](./src/CSharp/Solutions/Solution780.cs) | Hard |
| 781 | [Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest) | [C#](./src/CSharp/Solutions/Solution781.cs) | Medium |
| 782 | [Transform to Chessboard](https://leetcode.com/problems/transform-to-chessboard) | [C#](./src/CSharp/Solutions/Solution782.cs) | Hard |
| 783 | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes) | [C#](./src/CSharp/Solutions/Solution783.cs) | Easy |
| 785 | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite) | [C#](./src/CSharp/Solutions/Solution785.cs) | Medium |
| 786 | [K-th Smallest Prime Fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction) | [C#](./src/CSharp/Solutions/Solution786.cs) | Hard |
| 787 | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops) | [C#](./src/CSharp/Solutions/Solution787.cs) | Medium |
| 788 | [Rotated Digits](https://leetcode.com/problems/rotated-digits) | [C#](./src/CSharp/Solutions/Solution788.cs) | Easy |
| 789 | [Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts) | [C#](./src/CSharp/Solutions/Solution789.cs) | Medium |
| 790 | [Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling) | [C#](./src/CSharp/Solutions/Solution790.cs) | Medium |
| 791 | [Custom Sort String](https://leetcode.com/problems/custom-sort-string) | [C#](./src/CSharp/Solutions/Solution791.cs) | Medium |
| 792 | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences) | [C#](./src/CSharp/Solutions/Solution792.cs) | Medium |
| 793 | [Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function) | [C#](./src/CSharp/Solutions/Solution793.cs) | Hard |
| 794 | [Valid Tic-Tac-Toe State](https://leetcode.com/problems/valid-tic-tac-toe-state) | [C#](./src/CSharp/Solutions/Solution794.cs) | Medium |
| 795 | [Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum) | [C#](./src/CSharp/Solutions/Solution795.cs) | Medium |
| 796 | [Rotate String](https://leetcode.com/problems/rotate-string) | [C#](./src/CSharp/Solutions/Solution796.cs) | Easy |
| 797 | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | [C#](./src/CSharp/Solutions/Solution797.cs) | Medium |
| 798 | [Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score) | [C#](./src/CSharp/Solutions/Solution798.cs) | Hard |
| 799 | [Champagne Tower](https://leetcode.com/problems/champagne-tower) | [C#](./src/CSharp/Solutions/Solution799.cs) | Medium |
| 801 | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) | [C#](./src/CSharp/Solutions/Solution801.cs) | Hard |
| 802 | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states) | [C#](./src/CSharp/Solutions/Solution802.cs) | Medium |
| 804 | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words) | [C#](./src/CSharp/Solutions/Solution804.cs) | Easy |
| 805 | [Split Array With Same Average](https://leetcode.com/problems/split-array-with-same-average) | [C#](./src/CSharp/Solutions/Solution805.cs) | Hard |
| 806 | [Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string) | [C#](./src/CSharp/Solutions/Solution806.cs) | Easy |
| 807 | [Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline) | [C#](./src/CSharp/Solutions/Solution807.cs) | Medium |
| 808 | [Soup Servings](https://leetcode.com/problems/soup-servings) | [C#](./src/CSharp/Solutions/Solution808.cs) | Medium |
| 809 | [Expressive Words](https://leetcode.com/problems/expressive-words) | [C#](./src/CSharp/Solutions/Solution809.cs) | Medium |
| 810 | [Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game) | [C#](./src/CSharp/Solutions/Solution810.cs) | Hard |
| 811 | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count) | [C#](./src/CSharp/Solutions/Solution811.cs) | Easy |
| 812 | [Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area) | [C#](./src/CSharp/Solutions/Solution812.cs) | Easy |
| 813 | [Largest Sum of Averages](https://leetcode.com/problems/largest-sum-of-averages) | [C#](./src/CSharp/Solutions/Solution813.cs) | Medium |
| 814 | [Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning) | [C#](./src/CSharp/Solutions/Solution814.cs) | Medium |
| 815 | [Bus Routes](https://leetcode.com/problems/bus-routes) | [C#](./src/CSharp/Solutions/Solution815.cs) | Hard |
| 816 | [Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates) | [C#](./src/CSharp/Solutions/Solution816.cs) | Medium |
| 817 | [Linked List Components](https://leetcode.com/problems/linked-list-components) | [C#](./src/CSharp/Solutions/Solution817.cs) | Medium |
| 818 | [Race Car](https://leetcode.com/problems/race-car) | [C#](./src/CSharp/Solutions/Solution818.cs) | Hard |
| 819 | [Most Common Word](https://leetcode.com/problems/most-common-word) | [C#](./src/CSharp/Solutions/Solution819.cs) | Easy |
| 820 | [Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words) | [C#](./src/CSharp/Solutions/Solution820.cs) | Medium |
| 821 | [Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character) | [C#](./src/CSharp/Solutions/Solution821.cs) | Easy |
| 822 | [Card Flipping Game](https://leetcode.com/problems/card-flipping-game) | [C#](./src/CSharp/Solutions/Solution822.cs) | Medium |
| 823 | [Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors) | [C#](./src/CSharp/Solutions/Solution823.cs) | Medium |
| 824 | [Goat Latin](https://leetcode.com/problems/goat-latin) | [C#](./src/CSharp/Solutions/Solution824.cs) | Easy |
| 825 | [Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages) | [C#](./src/CSharp/Solutions/Solution825.cs) | Medium |
| 826 | [Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work) | [C#](./src/CSharp/Solutions/Solution826.cs) | Medium |
| 827 | [Making A Large Island](https://leetcode.com/problems/making-a-large-island) | [C#](./src/CSharp/Solutions/Solution827.cs) | Hard |
| 828 | [Unique Letter String](https://leetcode.com/problems/unique-letter-string) | [C#](./src/CSharp/Solutions/Solution828.cs) | Hard |
| 829 | [Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum) | [C#](./src/CSharp/Solutions/Solution829.cs) | Hard |
| 830 | [Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups) | [C#](./src/CSharp/Solutions/Solution830.cs) | Easy |
| 831 | [Masking Personal Information](https://leetcode.com/problems/masking-personal-information) | [C#](./src/CSharp/Solutions/Solution831.cs) | Medium |
| 832 | [Flipping an Image](https://leetcode.com/problems/flipping-an-image) | [C#](./src/CSharp/Solutions/Solution832.cs) | Easy |
| 833 | [Find And Replace in String](https://leetcode.com/problems/find-and-replace-in-string) | [C#](./src/CSharp/Solutions/Solution833.cs) | Medium |
| 834 | [Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree) | [C#](./src/CSharp/Solutions/Solution834.cs) | Hard |
| 835 | [Image Overlap](https://leetcode.com/problems/image-overlap) | [C#](./src/CSharp/Solutions/Solution835.cs) | Medium |
| 836 | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap) | [C#](./src/CSharp/Solutions/Solution836.cs) | Easy |
| 887 | [Super Egg Drop](https://leetcode.com/problems/super-egg-drop) | [C#](./src/CSharp/Solutions/Solution887.cs) | Hard |
| 837 | [New 21 Game](https://leetcode.com/problems/new-21-game) | [C#](./src/CSharp/Solutions/Solution837.cs) | Medium |
| 838 | [Push Dominoes](https://leetcode.com/problems/push-dominoes) | [C#](./src/CSharp/Solutions/Solution838.cs) | Medium |
| 839 | [Similar String Groups](https://leetcode.com/problems/similar-string-groups) | [C#](./src/CSharp/Solutions/Solution839.cs) | Hard |
| 840 | [Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid) | [C#](./src/CSharp/Solutions/Solution840.cs) | Easy |
| 841 | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms) | [C#](./src/CSharp/Solutions/Solution841.cs) | Medium |
| 842 | [Split Array into Fibonacci Sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence) | [C#](./src/CSharp/Solutions/Solution842.cs) | Medium |
| 844 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare) | [C#](./src/CSharp/Solutions/Solution844.cs) | Easy |
| 845 | [Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array) | [C#](./src/CSharp/Solutions/Solution845.cs) | Medium |
| 846 | [Hand of Straights](https://leetcode.com/problems/hand-of-straights) | [C#](./src/CSharp/Solutions/Solution846.cs) | Medium |
| 847 | [Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes) | [C#](./src/CSharp/Solutions/Solution847.cs) | Hard |
| 848 | [Shifting Letters](https://leetcode.com/problems/shifting-letters) | [C#](./src/CSharp/Solutions/Solution848.cs) | Medium |
| 849 | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person) | [C#](./src/CSharp/Solutions/Solution849.cs) | Medium |
| 851 | [Loud and Rich](https://leetcode.com/problems/loud-and-rich) | [C#](./src/CSharp/Solutions/Solution851.cs) | Medium |
| 852 | [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array) | [C#](./src/CSharp/Solutions/Solution852.cs) | Medium |
| 853 | [Car Fleet](https://leetcode.com/problems/car-fleet) | [C#](./src/CSharp/Solutions/Solution853.cs) | Medium |
| 854 | [K-Similar Strings](https://leetcode.com/problems/k-similar-strings) | [C#](./src/CSharp/Solutions/Solution854.cs) | Hard |
| 855 | [Exam Room](https://leetcode.com/problems/exam-room) | [C#](./src/CSharp/Solutions/Solution855.cs) | Medium |
| 856 | [Score of Parentheses](https://leetcode.com/problems/score-of-parentheses) | [C#](./src/CSharp/Solutions/Solution856.cs) | Medium |
| 857 | [Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers) | [C#](./src/CSharp/Solutions/Solution857.cs) | Hard |
| 858 | [Mirror Reflection](https://leetcode.com/problems/mirror-reflection) | [C#](./src/CSharp/Solutions/Solution858.cs) | Medium |
| 859 | [Buddy Strings](https://leetcode.com/problems/buddy-strings) | [C#](./src/CSharp/Solutions/Solution859.cs) | Easy |
| 860 | [Lemonade Change](https://leetcode.com/problems/lemonade-change) | [C#](./src/CSharp/Solutions/Solution860.cs) | Easy |
| 861 | [Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix) | [C#](./src/CSharp/Solutions/Solution861.cs) | Medium |
| 862 | [Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k) | [C#](./src/CSharp/Solutions/Solution862.cs) | Hard |
| 863 | [All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree) | [C#](./src/CSharp/Solutions/Solution863.cs) | Medium |
| 864 | [Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys) | [C#](./src/CSharp/Solutions/Solution864.cs) | Hard |
| 865 | [Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes) | [C#](./src/CSharp/Solutions/Solution865.cs) | Medium |
| 866 | [Prime Palindrome](https://leetcode.com/problems/prime-palindrome) | [C#](./src/CSharp/Solutions/Solution866.cs) | Medium |
| 867 | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix) | [C#](./src/CSharp/Solutions/Solution867.cs) | Easy |
| 868 | [Binary Gap](https://leetcode.com/problems/binary-gap) | [C#](./src/CSharp/Solutions/Solution868.cs) | Easy |
| 869 | [Reordered Power of 2](https://leetcode.com/problems/reordered-power-of-2) | [C#](./src/CSharp/Solutions/Solution869.cs) | Medium |
| 870 | [Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle) | [C#](./src/CSharp/Solutions/Solution870.cs) | Medium |
| 871 | [Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops) | [C#](./src/CSharp/Solutions/Solution871.cs) | Hard |
| 872 | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees) | [C#](./src/CSharp/Solutions/Solution872.cs) | Easy |
| 873 | [Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence) | [C#](./src/CSharp/Solutions/Solution873.cs) | Medium |
| 874 | [Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simul