Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.
Awesome Lists | Featured Topics | Projects
https://github.com/mkfsn/leetcode

Last synced: about 1 month ago
JSON representation
Host: GitHub
URL: https://github.com/mkfsn/leetcode
Owner: mkfsn
Created: 2016-03-28T08:33:41.000Z (over 8 years ago)
Default Branch: master
Last Pushed: 2022-08-14T23:28:46.000Z (over 2 years ago)
Last Synced: 2023-03-23T03:42:38.938Z (almost 2 years ago)
Language: Go
Size: 426 KB
Stars: 1
Watchers: 4
Forks: 0
Open Issues: 0
Metadata Files:
- Readme: README.md
Awesome Lists containing this project

README

        # LeetCode

[LeetCode](https://leetcode.com)

## Algorithm

+ [1. Two Sum](https://leetcode.com/problems/two-sum/)

    * [algorithm/two-sum](algorithm/two-sum)

* [2. Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)

    * [algorithm/add-two-numbers](algorithm/add-two-numbers)

* [3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)

    * [algorithm/longest-substring-without-repeating-characters](algorithm/longest-substring-without-repeating-characters)

* [5. Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)

    * [algorithm/longest-palindromic-substring](algorithm/longest-palindromic-substring) 

+ [6. ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/)

    * [algorithm/zigzag-conversion](algorithm/zigzag-conversion)

+ [9. Palindrome Number](https://leetcode.com/problems/palindrome-number/)

    * [algorithm/palindrome-number](algorithm/palindrome-number)

* [11. Container With Most Water](https://leetcode.com/problems/container-with-most-water/)

    * [algorithm/container-with-most-water](algorithm/container-with-most-water)

+ [13. Roman to Integer](https://leetcode.com/problems/roman-to-integer/)

    * [algorithm/roman-to-integer](algorithm/roman-to-integer)

+ [14. Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)

    * [algorithm/longest-common-prefix](algorithm/longest-common-prefix)

* [15. 3Sum](https://leetcode.com/problems/3sum/)

    * [algorithm/3sum](algorithm/3sum) 

+ [21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)

    * [algorithm/merge-two-sorted-lists](algorithm/merge-two-sorted-lists)

* [46. Permutations](https://leetcode.com/problems/permutations/)

    * [algorithm/permutations](algorithm/permutations)

* [50. Pow(x, n)](https://leetcode.com/problems/powx-n/)

    * [algorithm/powx-n](algorithm/powx-n)

* [53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)

    * [algorithm/maximum-subarray](algorithm/maximum-subarray)

* [56. Merge Intervals](https://leetcode.com/problems/merge-intervals/)

    * [algorithm/merge-intervals](algorithm/merge-intervals)

+ [58. Length of Last Word](https://leetcode.com/problems/length-of-last-word/)

    * [algorithm/length-of-last-word](algorithm/length-of-last-word)

* [62. Unique Paths](https://leetcode.com/problems/unique-paths/)

    * [algorithm/unique-paths](algorithm/unique-paths)

+ [70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)

    * [algorithm/climbing-stairs](algorithm/climbing-stairs)

+ [94. Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)

    * [algorithm/binary-tree-inorder-traversal](algorithm/binary-tree-inorder-traversal)

* [98. Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)

    * [algorithm/validate-binary-search-tree](algorithm/validate-binary-search-tree)

+ [101. Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)

    * [algorithm/symmetric-tree](algorithm/symmetric-tree)

* [102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)

    * [algorithm/binary-tree-level-order-traversal](algorithm/binary-tree-level-order-traversal)

* [103. Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)

    * [algorithm/binary-tree-zigzag-level-order-traversal](algorithm/binary-tree-zigzag-level-order-traversal)

* [108. Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)

    * [algorithm/convert-sorted-array-to-binary-search-tree](algorithm/convert-sorted-array-to-binary-search-tree) 

* [121. Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)

    * [algorithm/best-time-to-buy-and-sell-stock](algorithm/best-time-to-buy-and-sell-stock)

* [133. Clone Graph](https://leetcode.com/problems/clone-graph/)

    * [algorithm/clone-graph](algorithm/clone-graph)

* [142. Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)

    * [algorithm/linked-list-cycle-ii](algorithm/linked-list-cycle-ii)

+ [144. Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/)

    * [algorithm/binary-tree-preorder-traversal](algorithm/binary-tree-preorder-traversal)

+ [145. Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/)

    * [algorithm/binary-tree-postorder-traversal](algorithm/binary-tree-postorder-traversal)

* [148. Sort List](https://leetcode.com/problems/sort-list/)

    * [algorithm/sort-list](algorithm/sort-list)

+ [102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)

    * [algorithm/binary-tree-level-order-traversal](algorithm/binary-tree-level-order-traversal)

* [105. Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)

    * [algorithm/construct-binary-tree-from-preorder-and-inorder-traversal](algorithm/construct-binary-tree-from-preorder-and-inorder-traversal)

* [114. Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/)

    * [algorithm/flatten-binary-tree-to-linked-list](algorithm/flatten-binary-tree-to-linked-list)

* [138. Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/)

    * [algorithm/copy-list-with-random-pointer](algorithm/copy-list-with-random-pointer)

* [199. Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/)

    * [algorithm/binary-tree-right-side-view](algorithm/binary-tree-right-side-view) 

* [200. Number of Islands](https://leetcode.com/problems/number-of-islands/)

    * [algorithm/number-of-islands](algorithm/number-of-islands)

* [205. Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/)

    * [algorithm/isomorphic-strings](algorithm/isomorphic-strings)

* [206. Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)

    * [algorithm/reverse-linked-list](algorithm/reverse-linked-list)

* [215. Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)

    * [algorithm/kth-largest-element-in-an-array](algorithm/kth-largest-element-in-an-array) 

* [228. Summary Ranges](https://leetcode.com/problems/summary-ranges/)

    * [algorithm/summary-ranges](algorithm/summary-ranges)

* [230. Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)

    * [algorithm/kth-smallest-element-in-a-bst](algorithm/kth-smallest-element-in-a-bst)

+ [235. Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)

    * [algorithm/lowest-common-ancestor-of-a-binary-search-tree](algorithm/lowest-common-ancestor-of-a-binary-search-tree)

* [236. Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)

    * [algorithm/lowest-common-ancestor-of-a-binary-tree](algorithm/lowest-common-ancestor-of-a-binary-tree)

+ [237. Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)

    * [algorithm/delete-node-in-a-linked-list](algorithm/delete-node-in-a-linked-list)

* [242. Valid Anagram](https://leetcode.com/problems/valid-anagram/)

    * [algorithm/valid-anagram](algorithm/valid-anagram)

+ [257. Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/)

    * [algorithm/binary-tree-path](algorithm/binary-tree-path)

* [278. First Bad Version](https://leetcode.com/problems/first-bad-version/)

    * [algorithm/first-bad-version](algorithm/first-bad-version)

* [283. Move Zeroes](https://leetcode.com/problems/move-zeroes/)

    * [algorithm/move-zeroes](algorithm/move-zeroes)

* [300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)

    * [algorithm/longest-increasing-subsequence](algorithm/longest-increasing-subsequence)

+ [310. Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/)

    * [algorithm/minimum-height-trees](algorithm/minimum-height-trees)

+ [328. Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/)

    * [algorithm/odd-even-linked-list](algorithm/odd-even-linked-list)

* [334. Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/)

    * [algorithm/increasing-triplet-subsequence](algorithm/increasing-triplet-subsequence)

* [342. Power of Four](https://leetcode.com/problems/power-of-four/)

    * [algorithm/power-of-four](algorithm/power-of-four)

* [347. Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)

    * [algorithm/top-k-frequent-elements](algorithm/top-k-frequent-elements)

* [349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)

    * [algorithm/intersection-of-two-arrays](algorithm/intersection-of-two-arrays)

* [377. Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/)

    * [algorithm/combination-sum-iv](algorithm/combination-sum-iv)

* [378. Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/)

    * [algorithm/kth-smallest-element-in-a-sorted-matrix](algorithm/kth-smallest-element-in-a-sorted-matrix)

* [392. Is Subsequence](https://leetcode.com/problems/is-subsequence/)

    * [algorithm/is-subsequence](algorithm/is-subsequence)

* [394. Decode String](https://leetcode.com/problems/decode-string/)

    * [algorithm/decode-string](algorithm/decode-string)

* [398. Random Pick Index](https://leetcode.com/problems/random-pick-index/)

    * [algorithm/random-pick-index](algorithm/random-pick-index)

* [401. Binary Watch](https://leetcode.com/problems/binary-watch/)

    * [algorithm/binary-watch](algorithm/binary-watch)

* [409. Longest Palindrome](https://leetcode.com/problems/longest-palindrome/)

    * [algorithm/longest-palindrome](algorithm/longest-palindrome)

* [424. Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/)

    * [algorithm/longest-repeating-character-replacement](algorithm/longest-repeating-character-replacement)

* [434. Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/)

    * [algorithm/number-of-segments-in-a-string](algorithm/number-of-segments-in-a-string)

* [438. Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/)

    * [algorithm/find-all-anagrams-in-a-string](algorithm/find-all-anagrams-in-a-string)

* [454. 4Sum II](https://leetcode.com/problems/4sum-ii/)

    * [algorithm/4sum-ii](algorithm/4sum-ii)

* [455. Assign Cookies](https://leetcode.com/problems/assign-cookies/)

    * [algorithm/assign-cookies](algorithm/assign-cookies)

* [496. Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/)

    * [algorithm/next-greater-element-i](algorithm/next-greater-element-i)

* [506. Relative Ranks](https://leetcode.com/problems/relative-ranks/)

    * [algorithm/relative-ranks](algorithm/relative-ranks)

* [509. Fibonacci Number](https://leetcode.com/problems/fibonacci-number/)

    * [algorithm/fibonacci-number](algorithm/fibonacci-number)

* [516. Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/)

    * [algorithm/longest-palindromic-subsequence](algorithm/longest-palindromic-subsequence)

* [530. Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/)

    * [algorithm/minimum-absolute-difference-in-bst](algorithm/minimum-absolute-difference-in-bst)

* [541. Reverse String II](https://leetcode.com/problems/reverse-string-ii/)

  * [algorithm/reverse-string-ii](algorithm/reverse-string-ii)

* [543. Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/)

    * [algorithm/diameter-of-binary-tree](algorithm/diameter-of-binary-tree)

* [557. Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/)

    * [algorithm/reverse-words-in-a-string-iii](algorithm/reverse-words-in-a-string-iii)

* [581. Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/)

    * [algorithm/shortest-unsorted-continuous-subarray](algorithm/shortest-unsorted-continuous-subarray)

* [589. N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal/)

    * [algorithm/n-ary-tree-preorder-traversal](algorithm/n-ary-tree-preorder-traversal)

* [649. Dota2 Senate](https://leetcode.com/problems/dota2-senate/)

    * [algorithm/dota2-senate](algorithm/dota2-senate)

* [692. Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/)

    * [algorithm/top-k-frequent-words](algorithm/top-k-frequent-words)

* [695. Max Area of Island](https://leetcode.com/problems/max-area-of-island/)

    * [algorithm/max-area-of-island](algorithm/max-area-of-island)

* [704. Binary Search](https://leetcode.com/problems/binary-search/)

    * [algorithm/binary-search](algorithm/binary-search)

* [724. Find Pivot Index](https://leetcode.com/problems/find-pivot-index/)

    * [algorithm/find-pivot-index](algorithm/find-pivot-index)

* [729. My Calendar I](https://leetcode.com/problems/my-calendar-i/)

    * [algorithm/my-calendar-i](algorithm/my-calendar-i)

* [733. Flood Fill](https://leetcode.com/problems/flood-fill/)

    * [algorithm/flood-fill](algorithm/flood-fill)

* [744. Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target/)

    * [algorithm/find-smallest-letter-greater-than-target](algorithm/find-smallest-letter-greater-than-target)

* [746. Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/)

    * [algorithm/min-cost-climbing-stairs](algorithm/min-cost-climbing-stairs)

* [783. Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)

    * [algorithm/minimum-distance-between-bst-nodes](algorithm/minimum-distance-between-bst-nodes)

* [797. All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target/)

    * [algorithm/all-paths-from-source-to-target](algorithm/all-paths-from-source-to-target)

* [804. Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/)

    * [algorithm/unique-morse-code-words](algorithm/unique-morse-code-words) 

* [811. Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/)

    * [algorithm/subdomain-visit-count](algorithm/subdomain-visit-count)

* [819. Most Common Word](https://leetcode.com/problems/most-common-word/)

    * [algorithm/most-common-word](algorithm/most-common-word)

* [823. Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors/)

    * [algorithm/binary-trees-with-factors](algorithm/binary-trees-with-factors)

* [844. Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/)

    * [algorithm/backspace-string-compare](algorithm/backspace-string-compare)

* [858. Mirror Reflection](https://leetcode.com/problems/mirror-reflection/)

    * [algorithm/mirror-reflection](algorithm/mirror-reflection)

* [863. All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/)

    * [algorithm/all-nodes-distance-k-in-binary-tree](algorithm/all-nodes-distance-k-in-binary-tree)

* [876. Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/)

    * [algorithm/middle-of-the-linked-list](algorithm/middle-of-the-linked-list) 

* [890. Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern/)

    * [algorithm/find-and-replace-pattern](algorithm/find-and-replace-pattern)

* [905. Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity/)

    * [algorithm/sort-array-by-parity](algorithm/sort-array-by-parity) 

* [912. Sort an Array](https://leetcode.com/problems/sort-an-array/)

    * [algorithm/sort-an-array](algorithm/sort-an-array)

* [914. X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/)

    * [algorithm/x-of-a-kind-in-a-deck-of-cards](algorithm/x-of-a-kind-in-a-deck-of-cards)

* [922. Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii/)

    * [algorithm/sort-array-by-parity-ii](algorithm/sort-array-by-parity-ii)

* [929. Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses/)

    * [algorithm/unique-email-addresses](algorithm/unique-email-addresses)

* [953. Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary/)

    * [algorithm/verifying-an-alien-dictionary](algorithm/verifying-an-alien-dictionary)

* [965. Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree/)

    * [algorithm/univalued-binary-tree](algorithm/univalued-binary-tree)

* [973. K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/)

    * [algorithm/k-closest-points-to-origin](algorithm/k-closest-points-to-origin)  

* [993. Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree/)

    * [algorithm/cousins-in-binary-tree](algorithm/cousins-in-binary-tree) 

* [1022. Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/)

    * [algorithm/sum-of-root-to-leaf-binary-numbers](algorithm/sum-of-root-to-leaf-binary-numbers)

* [1025. Divisor Game](https://leetcode.com/problems/divisor-game/)

    * [algorithm/divisor-game](algorithm/divisor-game)

* [1035. Uncrossed Lines](https://leetcode.com/problems/uncrossed-lines/)

    * [algorithm/uncrossed-lines](algorithm/uncrossed-lines)

* [1037. Valid Boomerang](https://leetcode.com/problems/valid-boomerang/)

    * [algorithm/valid-boomerang](algorithm/valid-boomerang)

* [1046. Last Stone Weight](https://leetcode.com/problems/last-stone-weight/)

    * [algorithm/last-stone-weight](algorithm/last-stone-weight)

* [1048. Longest String Chain](https://leetcode.com/problems/longest-string-chain/)

    * [algorithm/longest-string-chain](algorithm/longest-string-chain)

* [1071. Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/)

    * [algorithm/greatest-common-divisor-of-strings](algorithm/greatest-common-divisor-of-strings)

* [1122. Relative Sort Array](https://leetcode.com/problems/relative-sort-array/)

    * [algorithm/relative-sort-array](algorithm/relative-sort-array)

* [1137. N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/)

    * [algorithm/n-th-tribonacci-number](algorithm/n-th-tribonacci-number)

* [1143. Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)

    * [algorithm/longest-common-subsequence](algorithm/longest-common-subsequence)

* [1169. Invalid Transactions](https://leetcode.com/problems/invalid-transactions/)

    * [algorithm/invalid-transactions](algorithm/invalid-transactions)

* [1237. Find Positive Integer Solution for a Given Equation](https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/)

    * [algorithm/find-positive-integer-solution-for-a-given-equation](algorithm/find-positive-integer-solution-for-a-given-equation)

* [1266. Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points/)

    * [algorithm/minimum-time-visiting-all-points](algorithm/minimum-time-visiting-all-points)

* [1268. Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/)

    * [algorithm/search-suggestions-system](algorithm/search-suggestions-system)

* [1281. Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/)

    * [algorithm/subtract-the-product-and-sum-of-digits-of-an-integer](algorithm/subtract-the-product-and-sum-of-digits-of-an-integer)

* [1309. Decrypt String from Alphabet to Integer Mapping](https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping/)

    * [algorithm/decrypt-string-from-alphabet-to-integer-mapping](algorithm/decrypt-string-from-alphabet-to-integer-mapping)

* [1337. The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/)

    * [algorithm/the-k-weakest-rows-in-a-matrix](algorithm/the-k-weakest-rows-in-a-matrix)

* [1346. Check If N and Its Double Exist](https://leetcode.com/problems/check-if-n-and-its-double-exist/)

    * [algorithm/check-if-n-and-its-double-exist](algorithm/check-if-n-and-its-double-exist)

* [1351. Count Negative Numbers in a Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/)

    * [algorithm/count-negative-numbers-in-a-sorted-matrix](algorithm/count-negative-numbers-in-a-sorted-matrix)

* [1365. How Many Numbers Are Smaller Than the Current Number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/)

    * [algorithm/how-many-numbers-are-smaller-than-the-current-number](algorithm/how-many-numbers-are-smaller-than-the-current-number)

* [1386. Cinema Seat Allocation](https://leetcode.com/problems/cinema-seat-allocation/)

    * [algorithm/cinema-seat-allocation](algorithm/cinema-seat-allocation)

* [1422. Maximum Score After Splitting a String](https://leetcode.com/problems/maximum-score-after-splitting-a-string/)

    * [algorithm/maximum-score-after-splitting-a-string](algorithm/maximum-score-after-splitting-a-string)

* [1464. Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/)

    * [algorithm/maximum-product-of-two-elements-in-an-array](algorithm/maximum-product-of-two-elements-in-an-array)

* [1470. Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/)

    * [algorithm/shuffle-the-array](algorithm/shuffle-the-array)

* [1475. Final Prices With a Special Discount in a Shop](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/)

    * [algorithm/final-prices-with-a-special-discount-in-a-shop](algorithm/final-prices-with-a-special-discount-in-a-shop)

* [1480. Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/)

    * [algorithm/running-sum-of-1d-array](algorithm/running-sum-of-1d-array)

* [1502. Can Make Arithmetic Progression From Sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/)

    * [algorithm/can-make-arithmetic-progression-from-sequence](algorithm/can-make-arithmetic-progression-from-sequence)

* [1512. Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs/)

    * [algorithm/number-of-good-pairs](algorithm/number-of-good-pairs)

* [1539. Kth Missing Positive Number](https://leetcode.com/problems/kth-missing-positive-number/)

    * [algorithm/kth-missing-positive-number](algorithm/kth-missing-positive-number)

* [1603. Design Parking System](https://leetcode.com/problems/design-parking-system/)

    * [algorithm/design-parking-system](algorithm/design-parking-system)

* [1608. Special Array With X Elements Greater Than or Equal X](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/)

    * [algorithm/special-array-with-x-elements-greater-than-or-equal-x](algorithm/special-array-with-x-elements-greater-than-or-equal-x)

* [1641. Count Sorted Vowel Strings](https://leetcode.com/problems/count-sorted-vowel-strings/)

    * [algorithm/count-sorted-vowel-strings](algorithm/count-sorted-vowel-strings)

* [1646. Get Maximum in Generated Array](https://leetcode.com/problems/get-maximum-in-generated-array/)

    * [algorithm/get-maximum-in-generated-array](algorithm/get-maximum-in-generated-array)

* [1672. Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth/)

    * [algorithm/richest-customer-wealth](algorithm/richest-customer-wealth)

* [1678. Goal Parser Interpretation](https://leetcode.com/problems/goal-parser-interpretation/)

    * [algorithm/goal-parser-interpretation](algorithm/goal-parser-interpretation) 

* [1720. Decode XORed Array](https://leetcode.com/problems/decode-xored-array/)

    * [algorithm/decode-xored-array](algorithm/decode-xored-array)

* [1732. Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude/)

    * [algorithm/find-the-highest-altitude](algorithm/find-the-highest-altitude) 

* [1736. Latest Time by Replacing Hidden Digits](https://leetcode.com/problems/latest-time-by-replacing-hidden-digits/)

    * [algorithm/latest-time-by-replacing-hidden-digits](algorithm/latest-time-by-replacing-hidden-digits)

* [1863. Sum of All Subset XOR Totals](https://leetcode.com/problems/sum-of-all-subset-xor-totals/)

    * [algorithm/sum-of-all-subset-xor-totals](algorithm/sum-of-all-subset-xor-totals)

* [1869. Longer Contiguous Segments of Ones than Zeros](https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros/)

    * [algorithm/longer-contiguous-segments-of-ones-than-zeros](algorithm/longer-contiguous-segments-of-ones-than-zeros)

* [1913. Maximum Product Difference Between Two Pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs/)

    * [algorithm/maximum-product-difference-between-two-pairs](algorithm/maximum-product-difference-between-two-pairs)

* [1920. Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation/)

    * [algorithm/build-array-from-permutation](algorithm/build-array-from-permutation)

* [1929. Concatenation of Array](https://leetcode.com/problems/concatenation-of-array/)

    * [algorithm/concatenation-of-array](algorithm/concatenation-of-array)

* [1971. Find if Path Exists in Graph](https://leetcode.com/problems/find-if-path-exists-in-graph/)

    * [algorithm/find-if-path-exists-in-graph](algorithm/find-if-path-exists-in-graph)

* [1979. Find Greatest Common Divisor of Array](https://leetcode.com/problems/find-greatest-common-divisor-of-array/)

    * [algorithm/find-greatest-common-divisor-of-array](algorithm/find-greatest-common-divisor-of-array)

* [1991. Find the Middle Index in Array](https://leetcode.com/problems/find-the-middle-index-in-array/)

    * [algorithm/find-the-middle-index-in-array](algorithm/find-the-middle-index-in-array)

* [2011. Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/)

    * [algorithm/final-value-of-variable-after-performing-operations](algorithm/final-value-of-variable-after-performing-operations)

* [2047. Number of Valid Words in a Sentence](https://leetcode.com/problems/number-of-valid-words-in-a-sentence/)

    * [algorithm/number-of-valid-words-in-a-sentence](algorithm/number-of-valid-words-in-a-sentence)

* [2068. Check Whether Two Strings are Almost Equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/)

    * [algorithm/check-whether-two-strings-are-almost-equivalent](algorithm/check-whether-two-strings-are-almost-equivalent)

* [2089. Find Target Indices After Sorting Array](https://leetcode.com/problems/find-target-indices-after-sorting-array/)

    * [algorithm/find-target-indices-after-sorting-array](algorithm/find-target-indices-after-sorting-array)

* [2099. Find Subsequence of Length K With the Largest Sum](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/)

    * [algorithm/find-subsequence-of-length-k-with-the-largest-sum](algorithm/find-subsequence-of-length-k-with-the-largest-sum)

* [2108. Find First Palindromic String in the Array](https://leetcode.com/problems/find-first-palindromic-string-in-the-array/)

    * [algorithm/find-first-palindromic-string-in-the-array](algorithm/find-first-palindromic-string-in-the-array)

* [2114. Maximum Number of Words Found in Sentences](https://leetcode.com/problems/maximum-number-of-words-found-in-sentences/)

    * [algorithm/maximum-number-of-words-found-in-sentences](algorithm/maximum-number-of-words-found-in-sentences)

* [2160. Minimum Sum of Four Digit Number After Splitting Digits](https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/)

    * [algorithm/minimum-sum-of-four-digit-number-after-splitting-digits](algorithm/minimum-sum-of-four-digit-number-after-splitting-digits) 

* [2231. Largest Number After Digit Swaps by Parity](https://leetcode.com/problems/largest-number-after-digit-swaps-by-parity/)

    * [algorithm/largest-number-after-digit-swaps-by-parity](algorithm/largest-number-after-digit-swaps-by-parity)

* [2235. Add Two Integers](https://leetcode.com/problems/add-two-integers/)

    * [algorithm/add-two-integers](algorithm/add-two-integers)  

* [2236. Root Equals Sum of Children](https://leetcode.com/problems/root-equals-sum-of-children/)

    * [algorithm/root-equals-sum-of-children](algorithm/root-equals-sum-of-children)

* [2273. Find Resultant Array After Removing Anagrams](https://leetcode.com/problems/find-resultant-array-after-removing-anagrams/)

    * [algorithm/find-resultant-array-after-removing-anagrams](algorithm/find-resultant-array-after-removing-anagrams)

* [2325. Decode the Message](https://leetcode.com/problems/decode-the-message/)

    * [algorithm/decode-the-message](algorithm/decode-the-message)

* [2343. Query Kth Smallest Trimmed Number](https://leetcode.com/contest/weekly-contest-302/problems/query-kth-smallest-trimmed-number/)

    * [algorithm/query-kth-smallest-trimmed-number](algorithm/query-kth-smallest-trimmed-number)

* [2331. Evaluate Boolean Binary Tree](https://leetcode.com/problems/evaluate-boolean-binary-tree/)

    * [algorithm/evaluate-boolean-binary-tree](algorithm/evaluate-boolean-binary-tree)

* [2335. Minimum Amount of Time to Fill Cups](https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups/)

    * [algorithm/minimum-amount-of-time-to-fill-cups](algorithm/minimum-amount-of-time-to-fill-cups)

* [6120. Maximum Number of Pairs in Array]

    * [algorithm/maximum-number-of-pairs-in-array](algorithm/maximum-number-of-pairs-in-array)

* [6164. Max Sum of a Pair With Equal Sum of Digits]

    * [algorithm/max-sum-of-a-pair-with-equal-sum-of-digits](algorithm/max-sum-of-a-pair-with-equal-sum-of-digits)

## Database

+ [175. Combine Two Tables](https://leetcode.com/problems/combine-two-tables/)

    * [database/combine-two-tables](database/combine-two-tables)

+ [176. Second Highest Salary](https://leetcode.com/problems/second-highest-salary/)

    * [database/second-highest-salary](database/second-highest-salary)

+ [177. Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary/)

    * [database/nth-highest-salary](database/nth-highest-salary)

+ [178. Rank Scores](https://leetcode.com/problems/rank-scores/)

    * [database/rank-scores](database/rank-scores)

+ [180. Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers/)

    * [database/consecutive-numbers](database/consecutive-numbers)

+ [181. Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers/)

    * [database/employees-earning-more-than-their-managers](database/employees-earning-more-than-their-managers)

+ [182. Duplicate Emails](https://leetcode.com/problems/duplicate-emails/)

    * [database/duplicate-emails](database/duplicate-emails)

+ [183. Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order/)

    * [database/customers-who-never-order](database/customers-who-never-order)

+ [184. Department Highest Salary](https://leetcode.com/problems/department-highest-salary/)

    * [database/department-highest-salary](database/department-highest-salary)

+ [185. Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries/)

    * [database/department-top-three-salaries](database/department-top-three-salaries)

+ [196. Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails/)

    * [database/delete-duplicate-emails](database/delete-duplicate-emails)

+ [197. Rising Temperature](https://leetcode.com/problems/rising-temperature/)

    * [database/rising-temperature](database/rising-temperature)

+ [262. Trips and Users](https://leetcode.com/problems/trips-and-users/)

    * [database/trips-and-users](database/trips-and-users)

## Shell

+ [192. Word Frequency](https://leetcode.com/problems/word-frequency/)

    * [shell/word-frequency](shell/word-frequency)

+ [193. Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers/)

    * [shell/valid-phone-numbers](shell/valid-phone-numbers)

+ [194. Transpose File](https://leetcode.com/problems/transpose-file/)

    * [shell/transpose-file](shell/transpose-file)

+ [195. Tenth Line](https://leetcode.com/problems/tenth-line/)

    * [shell/tenth-line](shell/tenth-line)