Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/icherya/leetcode
🌟 LeetCode solutions in JavaScript
https://github.com/icherya/leetcode
algorithms javascript leetcode
Last synced: 2 days ago
JSON representation
🌟 LeetCode solutions in JavaScript
- Host: GitHub
- URL: https://github.com/icherya/leetcode
- Owner: iCherya
- Created: 2020-12-08T15:25:19.000Z (about 4 years ago)
- Default Branch: main
- Last Pushed: 2022-07-04T04:35:05.000Z (over 2 years ago)
- Last Synced: 2024-11-06T06:44:44.931Z (about 2 months ago)
- Topics: algorithms, javascript, leetcode
- Language: JavaScript
- Homepage:
- Size: 513 KB
- Stars: 8
- Watchers: 1
- Forks: 7
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# leetCode
🎓 My solutions to [LeetCode](https://leetcode.com/) in JavaScript
## LeetCode Algorithms
| # | Title | Solution | Difficulty |
| ---- | ----------------------------------------------------------------------------------------------------------------------------------------------------------------------- | ----------------------------------------------------------------------------------------------------- | ---------- |
| 2283 | [Check if Number Has Equal Digit Count and Digit Value](https://leetcode.com/problems/check-if-number-has-equal-digit-count-and-digit-value/) | [JavaScript](./algorithms/2283-Check-if-Number-Has-Equal-Digit-Count-and-Digit-Value.js) | Easy |
| 2236 | [Root Equals Sum of Children](https://leetcode.com/problems/root-equals-sum-of-children/) | [JavaScript](./algorithms/2236-Root-Equals-Sum-of-Children.js) | Easy |
| 2235 | [Add Two Integers](https://leetcode.com/problems/add-two-integers/) | [JavaScript](./algorithms/2235-Add-Two-Integers.js) | Easy |
| 2185 | [Counting Words With a Given Prefix](https://leetcode.com/problems/counting-words-with-a-given-prefix/) | [JavaScript](./algorithms/2185-Counting-Words-With-a-Given-Prefix.js) | Easy |
| 2181 | [Merge Nodes in Between Zeros](https://leetcode.com/problems/merge-nodes-in-between-zeros/) | [JavaScript](./algorithms/2181-Merge-Nodes-in-Between-Zeros.js) | Medium |
| 2176 | [Count Equal and Divisible Pairs in an Array](https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/) | [JavaScript](./algorithms/2176-Count-Equal-and-Divisible-Pairs-in-an-Array.js) | Easy |
| 2160 | [Minimum Sum of Four Digit Number After Splitting Digits](https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/) | [JavaScript](./algorithms/2160-Minimum-Sum-of-Four-Digit-Number-After-Splitting-Digits.js) | Easy |
| 2129 | [Capitalize the Title](https://leetcode.com/problems/capitalize-the-title/) | [JavaScript](./algorithms/2129-Capitalize-the-Title.js) | Easy |
| 2124 | [Check if All A's Appears Before All B's](https://leetcode.com/problems/check-if-all-as-appears-before-all-bs/) | [JavaScript](./algorithms/2124-Check-if-All-A's-Appears-Before-All-B's.js) | Easy |
| 2119 | [A Number After a Double Reversal](https://leetcode.com/problems/a-number-after-a-double-reversal/) | [JavaScript](./algorithms/2119-A-Number-After-a-Double-Reversal.js) | Easy |
| 2114 | [Maximum Number of Words Found in Sentences](https://leetcode.com/problems/maximum-number-of-words-found-in-sentences/) | [JavaScript](./algorithms/2114-Maximum-Number-of-Words-Found-in-Sentences.js) | Easy |
| 2108 | [Find First Palindromic String in the Array](https://leetcode.com/problems/find-first-palindromic-string-in-the-array/) | [JavaScript](./algorithms/2108-Find-First-Palindromic-String-in-the-Array.js) | Easy |
| 2099 | [Find Subsequence of Length K With the Largest Sum](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum) | [JavaScript](./algorithms/2099-Find-Subsequence-of-Length-K-With-the-Largest-Sum.js) | Easy |
| 2089 | [Find Target Indices After Sorting Array](https://leetcode.com/problems/find-target-indices-after-sorting-array/) | [JavaScript](./algorithms/2089-Find-Target-Indices-After-Sorting-Array.js) | Easy |
| 2032 | [Two Out of Three](https://leetcode.com/problems/two-out-of-three/) | [JavaScript](./algorithms/2032-Two-Out-of-Three.js) | Easy |
| 2011 | [Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/) | [JavaScript](./algorithms/2011-Final-Value-of-Variable-After-Performing-Operations.js) | Easy |
| 2006 | [Count Number of Pairs With Absolute Difference K](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/) | [JavaScript](./algorithms/2006-Count-Number-of-Pairs-With-Absolute-Difference-K.js) | Easy |
| 2000 | [Reverse Prefix of Word](https://leetcode.com/problems/reverse-prefix-of-word/) | [JavaScript](./algorithms/2000-Reverse-Prefix-of-Word.js) | Easy |
| 1984 | [Minimum Difference Between Highest and Lowest of K Scores](https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/) | [JavaScript](./algorithms/1984-Minimum-Difference-Between-Highest-and%20-Lowest-of-K-Scores.js) | Easy |
| 1979 | [Find Greatest Common Divisor of Array](https://leetcode.com/problems/find-greatest-common-divisor-of-array/) | [JavaScript](./algorithms/1979-Find-Greatest-Common-Divisor-of-Array.js) | Easy |
| 1967 | [Number of Strings That Appear as Substrings in Word](https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word/) | [JavaScript](./algorithms/1967-Number-of-Strings-That-Appear-as-Substrings-in-Word.js) | Easy |
| 1961 | [Check If String Is a Prefix of Array](https://leetcode.com/problems/check-if-string-is-a-prefix-of-array/) | [JavaScript](./algorithms/1961-Check-If-String-Is-a-Prefix-of-Array.js) | Easy |
| 1957 | [Delete Characters to Make Fancy String](https://leetcode.com/problems/delete-characters-to-make-fancy-string/) | [JavaScript](./algorithms/1957-Delete-Characters-to-Make-Fancy-String.js) | Easy |
| 1941 | [Check if All Characters Have Equal Number of Occurrences](https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/) | [JavaScript](./algorithms/1941-Check-if-All-Characters-Have-Equal-Number-of-Occurrences.js) | Easy |
| 1935 | [Maximum Number of Words You Can Type](https://leetcode.com/problems/maximum-number-of-words-you-can-type/) | [JavaScript](./algorithms/1935-Maximum-Number-of-Words-You-Can-Type.js) | Easy |
| 1929 | [Concatenation of Array](https://leetcode.com/problems/concatenation-of-array/) | [JavaScript](./algorithms/1929-Concatenation-of-Array.js) | Easy |
| 1920 | [Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation/) | [JavaScript](./algorithms/1920-Build-Array-from-Permutation.js) | Easy |
| 1913 | [Maximum Product Difference Between Two Pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs/) | [JavaScript](./algorithms/1913-Maximum-Product-Difference-Between-Two-Pairs.js) | Easy |
| 1911 | [Maximum Alternating Subsequence Sum](https://leetcode.com/problems/maximum-alternating-subsequence-sum/) | [JavaScript](./algorithms/1911-Maximum-Alternating-Subsequence-Sum.js) | Medium |
| 1910 | [Remove All Occurrences of a Substring](https://leetcode.com/problems/remove-all-occurrences-of-a-substring/) | [JavaScript](./algorithms/1910-Remove-All-Occurrences-of-a-Substring.js) | Medium |
| 1909 | [Remove One Element to Make the Array Strictly Increasing](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/) | [JavaScript](./algorithms/1909-Remove-One-Element-to-Make-the-Array-Strictly-Increasing.js) | Easy |
| 1903 | [Largest Odd Number in String](https://leetcode.com/problems/largest-odd-number-in-string/) | [JavaScript](./algorithms/1903-Largest-Odd-Number-in-String.js) | Easy |
| 1895 | [Largest Magic Square](https://leetcode.com/problems/largest-magic-square/) | [JavaScript](./algorithms/1895-Largest-Magic-Square.js) | Medium |
| 1894 | [Find the Student that Will Replace the Chalk](https://leetcode.com/problems/find-the-student-that-will-replace-the-chalk/) | [JavaScript](./algorithms/1894-Find-the-Student-that-Will-Replace-the-Chalk.js) | Medium |
| 1893 | [Check if All the Integers in a Range Are Covered](https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered/) | [JavaScript](./algorithms/1893-Check-if-All-the-Integers-in-a-Range-Are-Covered.js) | Easy |
| 1886 | [Determine Whether Matrix Can Be Obtained By Rotation](https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation/) | [JavaScript](./algorithms/1886-Determine-Whether-Matrix-Can-Be-Obtained-By-Rotation.js) | Easy |
| 1881 | [Maximum Value after Insertion](https://leetcode.com/problems/maximum-value-after-insertion/) | [JavaScript](./algorithms/1881-Maximum-Value-after-Insertion.js) | Medium |
| 1880 | [Check if Word Equals Summation of Two Words](https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/) | [JavaScript](./algorithms/1880-Check-if-Word-Equals-Summation-of-Two-Words.js) | Easy |
| 1877 | [Minimize Maximum Pair Sum in Array](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/) | [JavaScript](./algorithms/1877-Minimize-Maximum-Pair-Sum-in-Array.js) | Medium |
| 1876 | [Substrings of Size Three with Distinct Characters](https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/) | [JavaScript](./algorithms/1876-Substrings-of-Size-Three-with-Distinct-Characters.js) | Easy |
| 1869 | [Longer Contiguous Segments of Ones than Zeros](https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros/) | [JavaScript](./algorithms/1869-Longer-Contiguous-Segments-of-Ones-than-Zeros.js) | Easy |
| 1862 | [Sum of Floored Pairs](https://leetcode.com/problems/sum-of-floored-pairs/) | [JavaScript](./algorithms/1862-Sum-of-Floored-Pairs.js) | Hard |
| 1860 | [Incremental Memory Leak](https://leetcode.com/problems/incremental-memory-leak/) | [JavaScript](./algorithms/1860-Incremental-Memory-Leak.js) | Medium |
| 1859 | [Sorting the Sentence](https://leetcode.com/problems/sorting-the-sentence/) | [JavaScript](./algorithms/1859-Sorting-the-Sentence.js) | Easy |
| 1855 | [Maximum Distance Between a Pair of Values](https://leetcode.com/problems/maximum-distance-between-a-pair-of-values/) | [JavaScript](./algorithms/1855-Maximum-Distance-Between-a-Pair-of-Values.js) | Medium |
| 1854 | [Maximum Population Year](https://leetcode.com/problems/maximum-population-year/) | [JavaScript](./algorithms/1854-Maximum-Population-Year.js) | Easy |
| 1848 | [Minimum Distance to the Target Element](https://leetcode.com/problems/minimum-distance-to-the-target-element/) | [JavaScript](./algorithms/1848-Minimum-Distance-to-the-Target-Element.js) | Easy |
| 1844 | [Replace All Digits with Characters](https://leetcode.com/problems/replace-all-digits-with-characters/) | [JavaScript](./algorithms/1844-Replace-All-Digits-with-Characters.js) | Easy |
| 1837 | [Sum of Digits in Base K](https://leetcode.com/problems/sum-of-digits-in-base-k/) | [JavaScript](./algorithms/1837-Sum-of-Digits-in-Base-K.js) | Easy |
| 1832 | [Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram/) | [JavaScript](./algorithms/1832-Check-if-the-Sentence-Is-Pangram.js) | Easy |
| 1829 | [Maximum XOR for Each Query](https://leetcode.com/problems/maximum-xor-for-each-query/) | [JavaScript](./algorithms/1829-Maximum-XOR-for-Each-Query.js) | Medium |
| 1828 | [Queries on Number of Points Inside a Circle](https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle/) | [JavaScript](./algorithms/1828-Queries-on-Number-of-Points-Inside-a-Circle.js) | Medium |
| 1827 | [Minimum Operations to Make the Array Increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/) | [JavaScript](./algorithms/1827-Minimum-Operations-to-Make-the-Array-Increasing.js) | Easy |
| 1822 | [Sign of the Product of an Array](https://leetcode.com/problems/sign-of-the-product-of-an-array/) | [JavaScript](./algorithms/1822-Sign-of-the-Product-of-an-Array.js) | Easy |
| 1816 | [Truncate Sentence](https://leetcode.com/problems/truncate-sentence/) | [JavaScript](./algorithms/1816-Truncate-Sentence.js) | Easy |
| 1814 | [Count Nice Pairs in an Array](https://leetcode.com/problems/count-nice-pairs-in-an-array/) | [JavaScript](./algorithms/1814-Count-Nice-Pairs-in-an-Array.js) | Medium |
| 1813 | [Sentence Similarity III](https://leetcode.com/problems/sentence-similarity-iii/) | [JavaScript](./algorithms/1813-Sentence-Similarity-III.js) | Medium |
| 1812 | [Determine Color of a Chessboard Square](https://leetcode.com/problems/determine-color-of-a-chessboard-square/) | [JavaScript](./algorithms/1812-Determine-Color-of-a-Chessboard-Square.js) | Easy |
| 1805 | [Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string/) | [JavaScript](./algorithms/1805-Number-of-Different-Integers-in-a-String.js) | Easy |
| 1800 | [Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/) | [JavaScript](./algorithms/1800-Maximum-Ascending-Subarray-Sum.js) | Easy |
| 1798 | [Maximum Number of Consecutive Values You Can Make](https://leetcode.com/problems/maximum-number-of-consecutive-values-you-can-make/) | [JavaScript](./algorithms/1798-Maximum-Number-of-Consecutive-Values-You-Can-Make.js) | Medium |
| 1797 | [Design Authentication Manager](https://leetcode.com/problems/design-authentication-manager/) | [JavaScript](./algorithms/1797-Design-Authentication-Manager.js) | Medium |
| 1796 | [Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string/) | [JavaScript](./algorithms/1796-Second-Largest-Digit-in-a-String.js) | Easy |
| 1791 | [Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph/) | [JavaScript](./algorithms/1791-Find-Center-of-Star-Graph.js) | Easy |
| 1784 | [Check if Binary String Has at Most One Segment of Ones](https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones/) | [JavaScript](./algorithms/1784-Check-if-Binary-String-Has-at-Most-One-Segment-of-Ones.js) | Easy |
| 1781 | [Sum of Beauty of All Substrings](https://leetcode.com/problems/sum-of-beauty-of-all-substrings/) | [JavaScript](./algorithms/1781-Sum-of-Beauty-of-All-Substrings.js) | Medium |
| 1780 | [Check if Number is a Sum of Powers of Three](https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/) | [JavaScript](./algorithms/1780-Check-if-Number-is-a-Sum-of-Powers-of-Three.js) | Medium |
| 1779 | [Find Nearest Point That Has the Same X or Y Coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/) | [JavaScript](./algorithms/1779-Find-Nearest-Point-That-Has-the-Same-X-or-Y-Coordinate.js) | Easy |
| 1773 | [Count Items Matching a Rule](https://leetcode.com/problems/count-items-matching-a-rule/) | [JavaScript](./algorithms/1773-Count-Items-Matching-a-Rule.js) | Easy |
| 1769 | [Minimum Number of Operations to Move All Balls to Each Box](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/) | [JavaScript](./algorithms/1769-Minimum-Number-of-Operations-to-Move-All-Balls-to-Each-Box.js) | Medium |
| 1768 | [Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/) | [JavaScript](./algorithms/1768-Merge-Strings-Alternately.js) | Easy |
| 1757 | [Recyclable and Low Fat Products](https://leetcode.com/problems/recyclable-and-low-fat-products/) | [SQL](./algorithms/1757-Recyclable-and-Low-Fat-Products.sql) | Easy |
| 1752 | [Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/) | [JavaScript](./algorithms/1752-Check-if-Array-Is-Sorted-and-Rotated.js) | Easy |
| 1750 | [Minimum Length of String After Deleting Similar Ends](https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/) | [JavaScript](./algorithms/1750-Minimum-Length-of-String-After-Deleting-Similar-Ends.js) | Medium |
| 1749 | [Maximum Absolute Sum of Any Subarray](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/) | [JavaScript](./algorithms/1749-Maximum-Absolute-Sum-of-Any-Subarray.js) | Medium |
| 1748 | [Sum of Unique Elements](https://leetcode.com/problems/sum-of-unique-elements/) | [JavaScript](./algorithms/1748-Sum-of-Unique-Elements.js) | Easy |
| 1734 | [Decode XORed Permutation](https://leetcode.com/problems/decode-xored-permutation/) | [JavaScript](./algorithms/1734-Decode-XORed-Permutation.js) | Medium |
| 1732 | [Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude/) | [JavaScript](./algorithms/1732-Find-the-Highest-Altitude.js) | Easy |
| 1721 | [Swapping Nodes in a Linked List](https://leetcode.com/problems/swapping-nodes-in-a-linked-list/) | [JavaScript](./algorithms/1721-Swapping-Nodes-in-a-Linked-List.js) | Medium |
| 1720 | [Decode XORed Array](https://leetcode.com/problems/decode-xored-array/) | [JavaScript](./algorithms/1720-Decode-XORed-Array.js) | Easy |
| 1717 | [Maximum Score From Removing Substrings](https://leetcode.com/problems/maximum-score-from-removing-substrings/) | [JavaScript](./algorithms/1717-Maximum-Score-From-Removing-Substrings.js) | Medium |
| 1716 | [Calculate Money in Leetcode Bank](https://leetcode.com/problems/calculate-money-in-leetcode-bank/) | [JavaScript](./algorithms/1716-Calculate-Money-in-Leetcode-Bank.js) | Easy |
| 1710 | [Maximum Units on a Truck](https://leetcode.com/problems/maximum-units-on-a-truck/) | [JavaScript](./algorithms/1710-Maximum-Units-on-a-Truck.js) | Easy |
| 1704 | [Determine if String Halves Are Alike](https://leetcode.com/problems/determine-if-string-halves-are-alike/) | [JavaScript](./algorithms/1704-Determine-if-String-Halves-Are-Alike.js) | Easy |
| 1696 | [Jump Game VI](https://leetcode.com/problems/jump-game-vi/) | [JavaScript](./algorithms/1696-Jump-Game-VI.js) | Medium |
| 1695 | [Maximum Erasure Value](https://leetcode.com/problems/maximum-erasure-value/) | [JavaScript](./algorithms/1695-Maximum-Erasure-Value.js) | Medium |
| 1694 | [Reformat Phone Number](https://leetcode.com/problems/reformat-phone-number/) | [JavaScript](./algorithms/1694-Reformat-Phone-Number.js) | Easy |
| 1690 | [Stone Game VII](https://leetcode.com/problems/stone-game-vii/) | [JavaScript](./algorithms/1690-Stone-Game-VII.js) | Medium |
| 1689 | [Partitioning Into Minimum Number Of Deci-Binary Numbers](https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/) | [JavaScript](./algorithms/1689-Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.js) | Medium |
| 1688 | [Count of Matches in Tournament](https://leetcode.com/problems/count-of-matches-in-tournament/) | [JavaScript](./algorithms/1688-Count-of-Matches-in-Tournament.js) | Easy |
| 1685 | [Sum of Absolute Differences in a Sorted Array](https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array/) | [JavaScript](./algorithms/1685-Sum-of-Absolute-Differences-in-a-Sorted-Array.js) | Medium |
| 1684 | [Count the Number of Consistent Strings](https://leetcode.com/problems/count-the-number-of-consistent-strings/) | [JavaScript](./algorithms/1684-Count-the-Number-of-Consistent-Strings.js) | Easy |
| 1680 | [Concatenation of Consecutive Binary Numbers](https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/) | [JavaScript](./algorithms/1680-Concatenation-of-Consecutive-Binary-Numbers.js) | Medium |
| 1679 | [Max Number of K-Sum Pairs](https://leetcode.com/problems/max-number-of-k-sum-pairs/) | [JavaScript](./algorithms/1679-Max-Number-of-K-Sum-Pairs.js) | Medium |
| 1678 | [Goal Parser Interpretation](https://leetcode.com/problems/goal-parser-interpretation/) | [JavaScript](./algorithms/1678-Goal-Parser-Interpretation.js) | Easy |
| 1675 | [Minimize Deviation in Array](https://leetcode.com/problems/minimize-deviation-in-array/) | [JavaScript](./algorithms/1675-Minimize-Deviation-in-Array.js) | Hard |
| 1673 | [Find the Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence/) | [JavaScript](./algorithms/1673-Find-the-Most-Competitive-Subsequence.js) | Medium |
| 1672 | [Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth/) | [JavaScript](./algorithms/1672-Richest-Customer-Wealth.js) | Easy |
| 1668 | [Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring/) | [JavaScript](./algorithms/1668-Maximum-Repeating-Substring.js) | Easy |
| 1663 | [Smallest String With A Given Numeric Value](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/) | [JavaScript](./algorithms/1663-Smallest-String-With-A-Given-Numeric-Value.js) | Medium |
| 1662 | [Check If Two String Arrays are Equivalent](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/) | [JavaScript](./algorithms/1662-Check-If-Two-String-Arrays-are-Equivalent.js) | Easy |
| 1658 | [Minimum Operations to Reduce X to Zero](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/) | [JavaScript](./algorithms/1658-Minimum-Operations-to-Reduce-X-to-Zero.js) | Medium |
| 1657 | [Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/) | [JavaScript](./algorithms/1657-Determine-if-Two-Strings-Are-Close.js) | Medium |
| 1656 | [Design an Ordered Stream](https://leetcode.com/problems/design-an-ordered-stream/) | [JavaScript](./algorithms/1656-Design-an-Ordered-Stream.js) | Easy |
| 1649 | [Create Sorted Array through Instructions](https://leetcode.com/problems/create-sorted-array-through-instructions/) | [JavaScript](./algorithms/1649-Create-Sorted-Array-through-Instructions.js) | Hard |
| 1646 | [Get Maximum in Generated Array](https://leetcode.com/problems/get-maximum-in-generated-array/) | [JavaScript](./algorithms/1646-Get-Maximum-in-Generated-Array.js) | Easy |
| 1642 | [Furthest Building You Can Reach](https://leetcode.com/problems/furthest-building-you-can-reach/) | [JavaScript](./algorithms/1642-Furthest-Building-You-Can-Reach.js) | Medium |
| 1641 | [Count Sorted Vowel Strings](https://leetcode.com/problems/count-sorted-vowel-strings/) | [JavaScript](./algorithms/1641-Count-Sorted-Vowel-Strings.js) | Medium |
| 1640 | [Check Array Formation Through Concatenation](https://leetcode.com/problems/check-array-formation-through-concatenation/) | [JavaScript](./algorithms/1640-Check-Array-Formation-Through-Concatenation.js) | Easy |
| 1636 | [Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/) | [JavaScript](./algorithms/1636-Sort-Array-by-Increasing-Frequency.js) | Easy |
| 1632 | [Rank Transform of a Matrix](https://leetcode.com/problems/rank-transform-of-a-matrix/) | [JavaScript](./algorithms/1632-Rank-Transform-of-a-Matrix.js) | Hard |
| 1631 | [Path With Minimum Effort](https://leetcode.com/problems/path-with-minimum-effort/) | [JavaScript](./algorithms/1631-Path-With-Minimum-Effort.js) | Medium |
| 1629 | [Slowest Key](https://leetcode.com/problems/slowest-key/) | [JavaScript](./algorithms/1629-Slowest-Key.js) | Easy |
| 1624 | [Largest Substring Between Two Equal Characters](https://leetcode.com/problems/largest-substring-between-two-equal-characters/) | [JavaScript](./algorithms/1624-Largest-Substring-Between-Two-Equal-Characters.js) | Easy |
| 1619 | [Mean of Array After Removing Some Elements](https://leetcode.com/problems/mean-of-array-after-removing-some-elements/) | [JavaScript](./algorithms/1619-Mean-of-Array-After-Removing-Some-Elements.js) | Easy |
| 1614 | [Maximum Nesting Depth of the Parentheses](https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/) | [JavaScript](./algorithms/1614-Maximum-Nesting-Depth-of-the-Parentheses.js) | Easy |
| 1603 | [Design Parking System](https://leetcode.com/problems/design-parking-system/) | [JavaScript](./algorithms/1603-Design-Parking-System.js) | Easy |
| 1588 | [Sum of All Odd Length Subarrays](https://leetcode.com/problems/sum-of-all-odd-length-subarrays/) | [JavaScript](./algorithms/1588-Sum-of-All-Odd-Length-Subarrays.js) | Easy |
| 1572 | [Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/) | [JavaScript](./algorithms/1572-Matrix-Diagonal-Sum.js) | Easy |
| 1556 | [Thousand Separator](https://leetcode.com/problems/thousand-separator/) | [JavaScript](./algorithms/1556-Thousand-Separator.js) | Easy |
| 1551 | [Minimum Operations to Make Array Equal](https://leetcode.com/problems/minimum-operations-to-make-array-equal/) | [JavaScript](./algorithms/1551-Minimum-Operations-to-Make-Array-Equal.js) | Medium |
| 1550 | [Three Consecutive Odds](https://leetcode.com/problems/three-consecutive-odds/) | [JavaScript](./algorithms/1550-Three-Consecutive-Odds.js) | Easy |
| 1539 | [Kth Missing Positive Number](https://leetcode.com/problems/kth-missing-positive-number/) | [JavaScript](./algorithms/1539-Kth-Missing-Positive-Number.js) | Easy |
| 1534 | [Count Good Triplets](https://leetcode.com/problems/count-good-triplets/) | [JavaScript](./algorithms/1534-Count-Good-Triplets.js) | Easy |
| 1528 | [Shuffle String](https://leetcode.com/problems/shuffle-string/) | [JavaScript](./algorithms/1528-Shuffle-String.js) | Easy |
| 1523 | [Count Odd Numbers in an Interval Range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/) | [JavaScript](./algorithms/1523-Count-Odd-Numbers-in-an-Interval-Range.js) | Easy |
| 1518 | [Water Bottles](https://leetcode.com/problems/water-bottles/) | [JavaScript](./algorithms/1518-Water-Bottles.js) | Easy |
| 1512 | [Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs/) | [JavaScript](./algorithms/1512-Number-of-Good-Pairs.js) | Easy |
| 1507 | [Reformat Date](https://leetcode.com/problems/reformat-date/) | [JavaScript](./algorithms/1507-Reformat-Date.js) | Easy |
| 1502 | [Can Make Arithmetic Progression From Sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/) | [JavaScript](./algorithms/1502-Can-Make-Arithmetic-Progression-From-Sequence.js) | Easy |
| 1491 | [Average Salary Excluding the Minimum and Maximum Salary](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/) | [JavaScript](./algorithms/1491-Average-Salary-Excluding-the-Minimum-and-Maximum-Salary.js) | Easy |
| 1486 | [XOR Operation in an Array](https://leetcode.com/problems/xor-operation-in-an-array/) | [JavaScript](./algorithms/1486-XOR-Operation-in-an-Array.js) | Easy |
| 1480 | [Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/) | [JavaScript](./algorithms/1480-Running-Sum-of-1d-Array.js) | Easy |
| 1476 | [Subrectangle Queries](https://leetcode.com/problems/subrectangle-queries/) | [JavaScript](./algorithms/1476-Subrectangle-Queries.js) | Easy |
| 1470 | [Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/) | [JavaScript](./algorithms/1470-Shuffle-the-Array.js) | Easy |
| 1465 | [Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts](https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/) | [JavaScript](./algorithms/1465-Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts.js) | Medium |
| 1464 | [Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/) | [JavaScript](./algorithms/1464-Maximum-Product-of-Two-Elements-in-an-Array.js) | Easy |
| 1463 | [Cherry Pickup II](https://leetcode.com/problems/cherry-pickup-ii/) | [JavaScript](./algorithms/1463-Cherry-Pickup-II.js) | Hard |
| 1461 | [Check If a String Contains All Binary Codes of Size K](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/) | [JavaScript](./algorithms/1461-Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.js) | Medium |
| 1457 | [Pseudo-Palindromic Paths in a Binary Tree](https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/) | [JavaScript](./algorithms/1457-Pseudo-Palindromic-Paths-in-a-Binary-Tree.js) | Medium |
| 1455 | [Check If a Word Occurs As a Prefix of Any Word in a Sentence](https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/) | [JavaScript](./algorithms/1455-Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.js) | Easy |
| 1450 | [Number of Students Doing Homework at a Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/) | [JavaScript](./algorithms/1450-Number-of-Students-Doing-Homework-at-a-Given-Time.js) | Easy |
| 1448 | [Count Good Nodes in Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/) | [JavaScript](./algorithms/1448-Count-Good-Nodes-in-Binary-Tree.js) | Medium |
| 1446 | [Consecutive Characters](https://leetcode.com/problems/consecutive-characters/) | [JavaScript](./algorithms/1446-Consecutive-Characters.js) | Easy |
| 1437 | [Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/) | [JavaScript](./algorithms/1437-Check-If-All-1's-Are-at-Least-Length-K-Places-Away.js) | Easy |
| 1431 | [Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/) | [JavaScript](./algorithms/1431-Kids-With-the-Greatest-Number-of-Candies.js) | Easy |
| 1423 | [Maximum Points You Can Obtain from Cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/) | [JavaScript](./algorithms/1423-Maximum-Points-You-Can-Obtain-from-Cards.js) | Medium |
| 1396 | [Design Underground System](https://leetcode.com/problems/design-underground-system/) | [JavaScript](./algorithms/1396-Design-Underground-System.js) | Medium |
| 1394 | [Find Lucky Integer in an Array](https://leetcode.com/problems/find-lucky-integer-in-an-array/) | [JavaScript](./algorithms/1394-Find-Lucky-Integer-in-an-Array.js) | Easy |
| 1389 | [Create Target Array in the Given Order](https://leetcode.com/problems/create-target-array-in-the-given-order/) | [JavaScript](./algorithms/1389-Create-Target-Array-in-the-Given-Order.js) | Easy |
| 1385 | [Find the Distance Value Between Two Arrays](https://leetcode.com/problems/find-the-distance-value-between-two-arrays/) | [JavaScript](./algorithms/1385-Find-the-Distance-Value-Between-Two-Arrays.js) | Easy |
| 1383 | [Maximum Performance of a Team](https://leetcode.com/problems/maximum-performance-of-a-team/) | [JavaScript](./algorithms/1383-Maximum-Performance-of-a-Team.js) | Hard |
| 1379 | [Find a Corresponding Node of a Binary Tree in a Clone of That Tree](https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/) | [JavaScript](./algorithms/1379-Find-a-Corresponding-Node-of-a-Binary-Tree-in-a-Clone-of-That-Tree.js) | Medium |
| 1365 | [How Many Numbers Are Smaller Than the Current Number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/) | [JavaScript](./algorithms/1365-How-Many-Numbers-Are-Smaller-Than-the-Current-Number.js) | Easy |
| 1360 | [Number of Days Between Two Dates](https://leetcode.com/problems/number-of-days-between-two-dates/) | [JavaScript](./algorithms/1360-Number-of-Days-Between-Two-Dates.js) | Easy |
| 1356 | [Sort Integers by The Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/) | [JavaScript](./algorithms/1356-Sort-Integers-by-The-Number-of-1-Bits.js) | Easy |
| 1354 | [Construct Target Array With Multiple Sums](https://leetcode.com/problems/construct-target-array-with-multiple-sums/) | [JavaScript](./algorithms/1354-Construct-Target-Array-With-Multiple-Sums.js) | Hard |
| 1351 | [Count Negative Numbers in a Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/) | [JavaScript](./algorithms/1351-Count-Negative-Numbers-in-a-Sorted-Matrix.js) | Easy |
| 1346 | [Check If N and Its Double Exist](https://leetcode.com/problems/check-if-n-and-its-double-exist/) | [JavaScript](./algorithms/1346-Check-If-N-and-Its-Double-Exist.js) | Easy |
| 1345 | [Jump Game IV](https://leetcode.com/problems/jump-game-iv/) | [JavaScript](./algorithms/1345-Jump-Game-IV.js) | Hard |
| 1342 | [Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/) | [JavaScript](./algorithms/1342-Number-of-Steps-to-Reduce-a-Number-to-Zero.js) | Easy |
| 1339 | [Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/) | [JavaScript](./algorithms/1339-Maximum-Product-of-Splitted-Binary-Tree.js) | Medium |
| 1338 | [Reduce Array Size to The Half](https://leetcode.com/problems/reduce-array-size-to-the-half/) | [JavaScript](./algorithms/1338-Reduce-Array-Size-to-The-Half.js) | Medium |
| 1337 | [The K Weakest Rows in a Matrix](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/) | [JavaScript](./algorithms/1337-The-K-Weakest-Rows-in-a-Matrix.js) | Easy |
| 1332 | [Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/) | [JavaScript](./algorithms/1332-Remove-Palindromic-Subsequences.js) | Easy |
| 1329 | [Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/) | [JavaScript](./algorithms/1329-Sort-the-Matrix-Diagonally.js) | Medium |
| 1325 | [Delete Leaves With a Given Value](https://leetcode.com/problems/delete-leaves-with-a-given-value/) | [JavaScript](./algorithms/1325-Delete-Leaves-With-a-Given-Value.js) | Medium |
| 1323 | [Maximum 69 Number](https://leetcode.com/problems/maximum-69-number/) | [JavaScript](./algorithms/1323-Maximum-69-Number.js) | Easy |
| 1313 | [Decompress Run-Length Encoded List](https://leetcode.com/problems/decompress-run-length-encoded-list/) | [JavaScript](./algorithms/1313-Decompress-Run-Length-Encoded-List.js) | Easy |
| 1305 | [All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/) | [JavaScript](./algorithms/1305-All-Elements-in-Two-Binary-Search-Trees.js) | Medium |
| 1302 | [Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/) | [JavaScript](./algorithms/1302-Deepest-Leaves-Sum.js) | Medium |
| 1299 | [Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/) | [JavaScript](./algorithms/1299-Replace-Elements-with-Greatest-Element-on-Right-Side.js) | Easy |
| 1295 | [Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/) | [JavaScript](./algorithms/1295-Find-Numbers-with-Even-Number-of-Digits.js) | Easy |
| 1290 | [Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/) | [JavaScript](./algorithms/1290-Convert-Binary-Number-in-a-Linked-List-to-Integer.js) | Easy |
| 1287 | [Element Appearing More Than 25% In Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/) | [JavaScript](./algorithms/1287-Element-Appearing-More-Than-25%-In-Sorted-Array.js) | Easy |
| 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/) | [JavaScript](./algorithms/1281-Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.js) | Easy |
| 1268 | [Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/) | [JavaScript](./algorithms/1268-Search-Suggestions-System.js) | Medium |
| 1249 | [Minimum Remove to Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/) | [JavaScript](./algorithms/1249-Minimum-Remove-to-Make-Valid-Parentheses.js) | Medium |
| 1232 | [Check If It Is a Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line/) | [JavaScript](./algorithms/1232-Check-If-It-Is-a-Straight-Line.js) | Easy |
| 1221 | [Split a String in Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings/) | [JavaScript](./algorithms/1221-Split-a-String-in-Balanced-Strings.js) | Easy |
| 1220 | [Count Vowels Permutation](https://leetcode.com/problems/count-vowels-permutation/) | [JavaScript](./algorithms/1220-Count-Vowels-Permutation.js) | Hard |
| 1209 | [Remove All Adjacent Duplicates in String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/) | [JavaScript](./algorithms/1209-Remove-All-Adjacent-Duplicates-in-String-II.js) | Medium |
| 1207 | [Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/) | [JavaScript](./algorithms/1207-Unique-Number-of-Occurrences.js) | Easy |
| 1200 | [Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/) | [JavaScript](./algorithms/1200-Minimum-Absolute-Difference.js) | Easy |
| 1192 | [Critical Connections in a Network](https://leetcode.com/problems/critical-connections-in-a-network/) | [JavaScript](./algorithms/1192-Critical-Connections-in-a-Network.js) | Hard |
| 1185 | [Day of the Week](https://leetcode.com/problems/day-of-the-week/) | [JavaScript](./algorithms/1185-Day-of-the-Week.js) | Easy |
| 1160 | [Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/) | [JavaScript](./algorithms/1160-Find-Words-That-Can-Be-Formed-by-Characters.js) | Easy |
| 1154 | [Day of the Year](https://leetcode.com/problems/day-of-the-year/) | [JavaScript](./algorithms/1154-Day-of-the-Year.js) | Easy |
| 1143 | [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | [JavaScript](./algorithms/1143-Longest-Common-Subsequence.js) | Medium |
| 1137 | [N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/) | [JavaScript](./algorithms/1137-N-th-Tribonacci-Number.js) | Easy |
| 1128 | [Number of Equivalent Domino Pairs](https://leetcode.com/problems/number-of-equivalent-domino-pairs/) | [JavaScript](./algorithms/1128-Number-of-Equivalent-Domino-Pairs.js) | Easy |
| 1122 | [Relative Sort Array](https://leetcode.com/problems/relative-sort-array/) | [JavaScript](./algorithms/1122-Relative-Sort-Array.js) | Easy |
| 1108 | [Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address/) | [JavaScript](./algorithms/1108-Defanging-an-IP-Address.js) | Easy |
| 1094 | [Car Pooling](https://leetcode.com/problems/car-pooling/) | [JavaScript](./algorithms/1094-Car-Pooling.js) | Medium |
| 1091 | [Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/) | [JavaScript](./algorithms/1091-Shortest-Path-in-Binary-Matrix.js) | Medium |
| 1089 | [Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/) | [JavaScript](./algorithms/1089-Duplicate-Zeros.js) | Easy |
| 1078 | [Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/) | [JavaScript](./algorithms/1078-Occurrences-After-Bigram.js) | Easy |
| 1074 | [Number of Submatrices That Sum to Target](https://leetcode.com/problems/number-of-submatrices-that-sum-to-target/) | [JavaScript](./algorithms/1074-Number-of-Submatrices-That-Sum-to-Target.js) | Hard |
| 1071 | [Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/) | [JavaScript](./algorithms/1071-Greatest-Common-Divisor-of-Strings.js) | Easy |
| 1051 | [Height Checker](https://leetcode.com/problems/height-checker/) | [JavaScript](./algorithms/1051-Height-Checker.js) | Easy |
| 1048 | [Longest String Chain](https://leetcode.com/problems/longest-string-chain/) | [JavaScript](./algorithms/1048-Longest-String-Chain.js) | Medium |
| 1047 | [Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/) | [JavaScript](./algorithms/1047-Remove-All-Adjacent-Duplicates-In-String.js) | Easy |
| 1046 | [Last Stone Weight](https://leetcode.com/problems/last-stone-weight/) | [JavaScript](./algorithms/1046-Last-Stone-Weight.js) | Easy |
| 1041 | [Robot Bounded In Circle](https://leetcode.com/problems/robot-bounded-in-circle/) | [JavaScript](./algorithms/1041-Robot-Bounded-In-Circle.js) | Medium |
| 1038 | [Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/) | [JavaScript](./algorithms/1038-Binary-Search-Tree-to-Greater-Sum-Tree.js) | Medium |
| 1032 | [Stream of Characters](https://leetcode.com/problems/stream-of-characters/) | [JavaScript](./algorithms/1032-Stream-of-Characters.js) | Hard |
| 1022 | [Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/) | [JavaScript](./algorithms/1022-Sum-of-Root-To-Leaf-Binary-Numbers.js) | Easy |
| 1013 | [Partition Array Into Three Parts With Equal Sum](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/) | [JavaScript](./algorithms/1013-Partition-Array-Into-Three-Parts-With-Equal-Sum.js) | Easy |
| 1010 | [Complement of Base 10 Integer](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/) | [JavaScript](./algorithms/1010-Pairs-of-Songs-With-Total-Durations-Divisible-by-60.js) | Medium |
| 1009 | [Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer/) | [JavaScript](./algorithms/1009-Complement-of-Base-10-Integer.js) | Easy |
| 1004 | [Max Consecutive Ones III](https://leetcode.com/problems/max-consecutive-ones-iii/) | [JavaScript](./algorithms/1004-Max-Consecutive-Ones-III.js) | Medium |
| 1002 | [Find Common Characters](https://leetcode.com/problems/find-common-characters/) | [JavaScript](./algorithms/1002-Find-Common-Characters.js) | Easy |
| 997 | [Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/) | [JavaScript](./algorithms/997-Find-the-Town-Judge.js) | Easy |
| 994 | [Rotting Oranges](https://leetcode.com/problems/rotting-oranges/) | [JavaScript](./algorithms/994-Rotting-Oranges.js) | Medium |
| 993 | [Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree/) | [JavaScript](./algorithms/993-Cousins-in-Binary-Tree.js) | Easy |
| 991 | [Broken Calculator](https://leetcode.com/problems/broken-calculator/) | [JavaScript](./algorithms/991-Broken-Calculator.js) | Medium |
| 987 | [Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/) | [JavaScript](./algorithms/987-Vertical-Order-Traversal-of-a-Binary-Tree.js) | Hard |
| 985 | [Sum of Even Numbers After Queries](https://leetcode.com/problems/sum-of-even-numbers-after-queries/) | [JavaScript](./algorithms/985-Sum-of-Even-Numbers-After-Queries.js) | Easy |
| 977 | [Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/) | [JavaScript](./algorithms/977-Squares-of-a-Sorted-Array.js) | Easy |
| 971 | [Flip Binary Tree To Match Preorder Traversal](https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal/) | [JavaScript](./algorithms/971-Flip-Binary-Tree-To-Match-Preorder-Traversal.js) | Medium |
| 970 | [Powerful Integers](https://leetcode.com/problems/powerful-integers/) | [JavaScript](./algorithms/970-Powerful-Integers.js) | Medium |
| 968 | [Binary Tree Cameras](https://leetcode.com/problems/binary-tree-cameras/) | [JavaScript](./algorithms/968-Binary-Tree-Cameras.js) | Hard |
| 966 | [Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker/) | [JavaScript](./algorithms/966-Vowel-Spellchecker.js) | Medium |
| 961 | [N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array/) | [JavaScript](./algorithms/961-N-Repeated-Element-in-Size-2N-Array.js) | Easy |
| 954 | [Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs/) | [JavaScript](./algorithms/954-Array-of-Doubled-Pairs.js) | Medium |
| 953 | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary/) | [JavaScript](./algorithms/953-Verifying-an-Alien-Dictionary.js) | Easy |
| 946 | [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences/) | [JavaScript](./algorithms/946-Validate-Stack-Sequences.js) | Medium |
| 943 | [Valid Mountain Array](https://leetcode.com/problems/find-the-shortest-superstring/) | [JavaScript](./algorithms/943-Find-the-Shortest-Superstring.js) | Hard |
| 941 | [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array/) | [JavaScript](./algorithms/941-Valid-Mountain-Array.js) | Easy |
| 938 | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/) | [JavaScript](./algorithms/938-Range-Sum-of-BST.js) | Easy |
| 936 | [Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence/) | [JavaScript](./algorithms/936-Stamping-The-Sequence.js) | Hard |
| 932 | [Beautiful Array](https://leetcode.com/problems/beautiful-array/) | [JavaScript](./algorithms/932-Beautiful-Array.js) | Medium |
| 927 | [Three Equal Parts](https://leetcode.com/problems/three-equal-parts/) | [JavaScript](./algorithms/927-Three-Equal-Parts.js) | Hard |
| 926 | [Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing/) | [JavaScript](./algorithms/926-Flip-String-to-Monotone-Increasing.js) | Medium |
| 923 | [3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity/) | [JavaScript](./algorithms/923-3Sum-With-Multiplicity.js) | Medium |
| 917 | [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters/) | [JavaScript](./algorithms/917-Reverse-Only-Letters.js) | Easy |
| 916 | [Word Subsets](https://leetcode.com/problems/word-subsets/) | [JavaScript](./algorithms/916-Word-Subsets.js) | Medium |
| 915 | [Partition Array into Disjoint Intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals/) | [JavaScript](./algorithms/915-Partition-Array-into-Disjoint-Intervals.js) | Medium |
| 910 | [Smallest Range II](https://leetcode.com/problems/smallest-range-ii/) | [JavaScript](./algorithms/910-Smallest-Range-II.js) | Medium |
| 906 | [Super Palindromes](https://leetcode.com/problems/super-palindromes/) | [JavaScript](./algorithms/906-Super-Palindromes.js) | Hard |
| 905 | [Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity/) | [JavaScript](./algorithms/905-Sort-Array-By-Parity.js) | Easy |
| 897 | [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree/) | [JavaScript](./algorithms/897-Increasing-Order-Search-Tree.js) | Easy |
| 896 | [Monotonic Array](https://leetcode.com/problems/monotonic-array/) | [JavaScript](./algorithms/896-Monotonic-Array.js) | Easy |
| 895 | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack/) | [JavaScript](./algorithms/895-Maximum-Frequency-Stack.js) | Hard |
| 890 | [Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern/) | [JavaScript](./algorithms/890-Find-and-Replace-Pattern.js) | Medium |
| 884 | [Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences/) | [JavaScript](./algorithms/884-Uncommon-Words-from-Two-Sentences.js) | Easy |
| 881 | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people/) | [JavaScript](./algorithms/881-Boats-to-Save-People.js) | Medium |
| 880 | [Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index/) | [JavaScript](./algorithms/880-Decoded-String-at-Index.js) | Medium |
| 877 | [Stone Game](https://leetcode.com/problems/stone-game/) | [JavaScript](./algorithms/877-Stone-Game.js) | Medium |
| 876 | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/) | [JavaScript](./algorithms/876-Middle-of-the-Linked-List.js) | Easy |
| 871 | [Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops/) | [JavaScript](./algorithms/871-Minimum-Number-of-Refueling-Stops.js) | Hard |
| 870 | [Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle/) | [JavaScript](./algorithms/870-Advantage-Shuffle.js) | Medium |
| 869 | [Decoded String at Index](https://leetcode.com/problems/reordered-power-of-2/) | [JavaScript](./algorithms/869-Reordered-Power-of-2.js) | Medium |
| 867 | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix/) | [JavaScript](./algorithms/867-Transpose-Matrix.js) | Easy |
| 865 | [Smallest Subtree with all the Deepest Nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes/) | [JavaScript](./algorithms/865-Smallest-Subtree-with-all-the-Deepest-Nodes.js) | Medium |
| 860 | [Lemonade Change](https://leetcode.com/problems/lemonade-change/) | [JavaScript](./algorithms/860-Lemonade-Change.js) | Easy |
| 856 | [Score of Parentheses](https://leetcode.com/problems/score-of-parentheses/) | [JavaScript](./algorithms/856-Score-of-Parentheses.js) | Medium |
| 849 | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person/) | [JavaScript](./algorithms/849-Maximize-Distance-to-Closest-Person.js) | Medium |
| 848 | [Shifting Letters](https://leetcode.com/problems/shifting-letters/) | [JavaScript](./algorithms/848-Shifting-Letters.js) | Medium |
| 844 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/) | [JavaScript](./algorithms/844-Backspace-String-Compare.js) | Easy |
| 841 | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/) | [JavaScript](./algorithms/841-Keys-and-Rooms.js) | Medium |
| 838 | [Push Dominoes](https://leetcode.com/problems/push-dominoes/) | [JavaScript](./algorithms/838-Push-Dominoes.js) | Medium |
| 832 | [Flipping an Image](https://leetcode.com/problems/flipping-an-image/) | [JavaScript](./algorithms/832-Flipping-an-Image.js) | Easy |
| 827 | [Making A Large Island](https://leetcode.com/problems/making-a-large-island/) | [JavaScript](./algorithms/827-Making-A-Large-Island.js) | Hard |
| 824 | [Goat Latin](https://leetcode.com/problems/goat-latin/) | [JavaScript](./algorithms/824-Goat-Latin.js) | Easy |
| 823 | [Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors/) | [JavaScript](./algorithms/823-Binary-Trees-With-Factors.js) | Medium |
| 821 | [Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character/) | [JavaScript](./algorithms/821-Shortest-Distance-to-a-Character.js) | Easy |
| 820 | [Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words/) | [JavaScript](./algorithms/820-Short-Encoding-of-Words.js) | Medium |
| 819 | [Most Common Word](https://leetcode.com/problems/most-common-word/) | [JavaScript](./algorithms/819-Most-Common-Word.js) | Easy |
| 816 | [Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates/) | [JavaScript](./algorithms/816-Ambiguous-Coordinates.js) | Medium |
| 814 | [Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning/) | [JavaScript](./algorithms/814-Binary-Tree-Pruning.js) | Medium |
| 804 | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/) | [JavaScript](./algorithms/804-Unique-Morse-Code-Words.js) | Easy |
| 796 | [Rotate String](https://leetcode.com/problems/rotate-string/) | [JavaScript](./algorithms/796-Rotate-String.js) | Easy |
| 795 | [Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum/) | [JavaScript](./algorithms/795-Number-of-Subarrays-with-Bounded-Maximum.js) | Medium |
| 792 | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences/) | [JavaScript](./algorithms/792-Number-of-Matching-Subsequences.js) | Medium |
| 791 | [Custom Sort String](https://leetcode.com/problems/custom-sort-string/) | [JavaScript](./algorithms/791-Custom-Sort-String.js) | Medium |
| 785 | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite/) | [JavaScript](./algorithms/785-Is-Graph-Bipartite?.js) | Easy |
| 784 | [Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation/) | [JavaScript](./algorithms/784-Letter-Case-Permutation.js) | Medium |
| 778 | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water/) | [JavaScript](./algorithms/778-Swim-in-Rising-Water.js) | Hard |
| 775 | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions/) | [JavaScript](./algorithms/775-Global-and-Local-Inversions.js) | Medium |
| 771 | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/) | [JavaScript](./algorithms/771-Jewels-and-Stones.js) | Easy |
| 754 | [Reach a Number](https://leetcode.com/problems/reach-a-number/) | [JavaScript](./algorithms/754-Reach-a-Number.js) | Medium |
| 752 | [Open the Lock](https://leetcode.com/problems/open-the-lock/) | [JavaScript](./algorithms/752-Open-the-Lock.js) | Medium |
| 748 | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word/) | [JavaScript](./algorithms/748-Shortest-Completing-Word.js) | Easy |
| 747 | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others/) | [JavaScript](./algorithms/747-Largest-Number-At-Least-Twice-of-Others.js) | Easy |
| 746 | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/) | [JavaScript](./algorithms/746-Min-Cost-Climbing-Stairs.js) | Easy |
| 745 | [Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search/) | [JavaScript](./algorithms/745-Prefix-and-Suffix-Search.js) | Hard |
| 744 | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target/) | [JavaScript](./algorithms/744-Find-Smallest-Letter-Greater-Than-Target.js) | Easy |
| 733 | [Flood Fill](https://leetcode.com/problems/flood-fill/) | [JavaScript](./algorithms/733-Flood-Fill.js) | Easy |
| 729 | [My Calendar I](https://leetcode.com/problems/my-calendar-i/) | [JavaScript](./algorithms/729-My-Calendar-I.js) | Medium |
| 728 | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers/) | [JavaScript](./algorithms/728-Self-Dividing-Numbers.js) | Easy |
| 724 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index/) | [JavaScript](./algorithms/724-Find-Pivot-Index.js) | Easy |
| 720 | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary/) | [JavaScript](./algorithms/720-Longest-Word-in-Dictionary.js) | Easy |
| 718 | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/) | [JavaScript](./algorithms/718-Maximum-Length-of-Repeated-Subarray.js) | 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/) | [JavaScript](./algorithms/714-Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.js) | Medium |
| 709 | [To Lower Case](https://leetcode.com/problems/to-lower-case/) | [JavaScript](./algorithms/709-To-Lower-Case.js) | Easy |
| 707 | [Design Linked List](https://leetcode.com/problems/design-linked-list/) | [JavaScript](./algorithms/707-Design-Linked-List.js) | Medium |
| 706 | [Design HashMap](https://leetcode.com/problems/design-hashmap/) | [JavaScript](./algorithms/706-Design-HashMap.js) | Easy |
| 705 | [Design HashSet](https://leetcode.com/problems/design-hashset/) | [JavaScript](./algorithms/705-Design-HashSet.js) | Easy |
| 704 | [Binary Search](https://leetcode.com/problems/binary-search/) | [JavaScript](./algorithms/704-Binary-Search.js) | Easy |
| 703 | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/) | [JavaScript](./algorithms/703-Kth-Largest-Element-in-a-Stream.js) | Easy |
| 701 | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/) | [JavaScript](./algorithms/701-Insert-into-a-Binary-Search-Tree.js) | Medium |
| 700 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/) | [JavaScript](./algorithms/700-Search-in-a-Binary-Search-Tree.js) | Easy |
| 697 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array/) | [JavaScript](./algorithms/697-Degree-of-an-Array.js) | Easy |
| 696 | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings/) | [JavaScript](./algorithms/696-Count-Binary-Substrings.js) | Easy |
| 695 | [Max Area of Island](https://leetcode.com/problems/max-area-of-island/) | [JavaScript](./algorithms/695-Max-Area-of-Island.js) | Medium |
| 684 | [Redundant Connection](https://leetcode.com/problems/redundant-connection/) | [JavaScript](./algorithms/684-Redundant-Connection.js) | Medium |
| 682 | [Baseball Game](https://leetcode.com/problems/baseball-game/) | [JavaScript](./algorithms/682-Baseball-Game.js) | Easy |
| 680 | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii/) | [JavaScript](./algorithms/680-Valid-Palindrome-II.js) | Easy |
| 677 | [Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs/) | [JavaScript](./algorithms/677-Map-Sum-Pairs.js) | Medium |
| 669 | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree/) | [JavaScript](./algorithms/669-Trim-a-Binary-Search-Tree.js) | Medium |
| 667 | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii/) | [JavaScript](./algorithms/667-Beautiful-Arrangement-II.js) | Medium |
| 665 | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array/) | [JavaScript](./algorithms/665-Non-decreasing-Array.js) | Medium |
| 658 | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements/) | [JavaScript](./algorithms/658-Find-K-Closest-Elements.js) | Medium |
| 653 | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/) | [JavaScript](./algorithms/653-Two-Sum-IV-Input-is-a-BST.js) | Easy |
| 647 | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) | [JavaScript](./algorithms/647-Palindromic-Substrings.js) | Medium |
| 645 | [Set Mismatch](https://leetcode.com/problems/set-mismatch/) | [JavaScript](./algorithms/645-Set-Mismatch.js) | Easy |
| 643 | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/) | [JavaScript](./algorithms/643-Maximum-Average-Subarray-I.js) | Easy |
| 639 | [Decode Ways II](https://leetcode.com/problems/decode-ways-ii/) | [JavaScript](./algorithms/639-Decode-Ways-II.js) | Hard |
| 637 | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/) | [JavaScript](./algorithms/637-Average-of-Levels-in-Binary-Tree.js) | Easy |
| 633 | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers/) | [JavaScript](./algorithms/633-Sum-of-Square-Numbers.js) | Medium |
| 630 | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii/) | [JavaScript](./algorithms/630-Course-Schedule-III.js) | Hard |
| 629 | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array/) | [JavaScript](./algorithms/629-K-Inverse-Pairs-Array.js) | Hard |
| 623 | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree/) | [JavaScript](./algorithms/623-Add-One-Row-to-Tree.js) | Medium |
| 622 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue/) | [JavaScript](./algorithms/622-Design-Circular-Queue.js) | Medium |
| 617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/) | [JavaScript](./algorithms/617-Merge-Two-Binary-Trees.js) | Easy |
| 611 | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number/) | [JavaScript](./algorithms/611-Valid-Triangle-Number.js) | Medium |
| 609 | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system/) | [JavaScript](./algorithms/609-Find-Duplicate-File-in-System.js) | Medium |
| 605 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers/) | [JavaScript](./algorithms/605-Can-Place-Flowers.js) | Easy |
| 600 | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones/) | [JavaScript](./algorithms/600-Non-negative-Integers-without-Consecutive-Ones.js) | Hard |
| 598 | [Range Addition II](https://leetcode.com/problems/range-addition-ii/) | [JavaScript](./algorithms/598-Range-Addition-II.js) | Easy |
| 594 | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence/) | [JavaScript](./algorithms/594-Longest-Harmonious-Subsequence.js) | Easy |
| 589 | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal/) | [JavaScript](./algorithms/589-N-ary-Tree-Preorder-Traversal.js) | Easy |
| 583 | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings/) | [JavaScript](./algorithms/583-Delete-Operation-for-Two-Strings.js) | Medium |
| 581 | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/) | [JavaScript](./algorithms/581-Shortest-Unsorted-Continuous-Subarray.js) | Medium |
| 576 | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths/) | [JavaScript](./algorithms/576-Out-of-Boundary-Paths.js) | Medium |
| 575 | [Distribute Candies](https://leetcode.com/problems/distribute-candies/) | [JavaScript](./algorithms/575-Distribute-Candies.js) | Easy |
| 567 | [Permutation in String](https://leetcode.com/problems/permutation-in-string/) | [JavaScript](./algorithms/567-Permutation-in-String.js) | Medium |
| 566 | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix/) | [JavaScript](./algorithms/566-Reshape-the-Matrix.js) | Easy |
| 565 | [Array Nesting](https://leetcode.com/problems/array-nesting/) | [JavaScript](./algorithms/565-Array-Nesting.js) | Medium |
| 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i/) | [JavaScript](./algorithms/561-Array-Partition-I.js) | Easy |
| 560 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | [JavaScript](./algorithms/560-Subarray-Sum-Equals-K.js) | Medium |
| 557 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/) | [JavaScript](./algorithms/557-Reverse-Words-in-a-String-III.js) | Easy |
| 556 | [Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii/) | [JavaScript](./algorithms/556-Next-Greater-Element-III.js) | Medium |
| 554 | [Brick Wall](https://leetcode.com/problems/brick-wall/) | [JavaScript](./algorithms/554-Brick-Wall.js) | Medium |
| 542 | [01 Matrix](https://leetcode.com/problems/01-matrix/) | [JavaScript](./algorithms/542-01-Matrix.js) | Medium |
| 538 | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/) | [JavaScript](./algorithms/538-Convert-BST-to-Greater-Tree.js) | Medium |
| 537 | [Simple Javascript Solution Explained](https://leetcode.com/problems/complex-number-multiplication/) | [JavaScript](./algorithms/537-Complex-Number-Multiplication.js) | Medium |
| 536 | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl/) | [JavaScript](./algorithms/535-Encode-and-Decode-TinyURL.js) | Medium |
| 526 | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement/) | [JavaScript](./algorithms/526-Beautiful-Arrangement.js) | Medium |
| 524 | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/) | [JavaScript](./algorithms/524-Longest-Word-in-Dictionary-through-Deleting.js) | Medium |
| 520 | [Detect Capital](https://leetcode.com/problems/detect-capital/) | [JavaScript](./algorithms/520-Detect-Capital.js) | Easy |
| 509 | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number/) | [JavaScript](./algorithms/509-Fibonacci-Number.js) | Easy |
| 504 | [Base 7](https://leetcode.com/problems/base-7/) | [JavaScript](./algorithms/504-Base-7.js) | Easy |
| 500 | [Keyboard Row](https://leetcode.com/problems/keyboard-row/) | [JavaScript](./algorithms/500-Keyboard-Row.js) | Easy |
| 498 | [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse/) | [JavaScript](./algorithms/498-Diagonal-Traverse.js) | Medium |
| 496 | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/) | [JavaScript](./algorithms/496-Next-Greater-Element-I.js) | Easy |
| 485 | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/) | [JavaScript](./algorithms/485-Max-Consecutive-Ones.js) | Easy |
| 478 | [Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle/) | [JavaScript](./algorithms/478-Generate-Random-Point-in-a-Circle.js) | Medium |
| 476 | [Number Complement](https://leetcode.com/problems/number-complement/) | [JavaScript](./algorithms/476-Number-Complement.js) | Easy |
| 474 | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes/) | [JavaScript](./algorithms/474-Ones-and-Zeroes.js) | Medium |
| 473 | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square/) | [JavaScript](./algorithms/473-Matchsticks-to-Square.js) | Medium |
| 463 | [Island Perimeter](https://leetcode.com/problems/island-perimeter/) | [JavaScript](./algorithms/463-Island-Perimeter.js) | Easy |
| 462 | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/) | [JavaScript](./algorithms/462-Minimum-Moves-to-Equal-Array-Elements-II.js) | Medium |
| 461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance/) | [JavaScript](./algorithms/461-Hamming-Distance.js) | Easy |
| 454 | [4Sum II](https://leetcode.com/problems/4sum-ii/) | [JavaScript](./algorithms/454-4Sum-II.js) | Medium |
| 451 | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/) | [JavaScript](./algorithms/451-Sort-Characters-By-Frequency.js) | Medium |
| 448 | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/) | [JavaScript](./algorithms/448-Find-All-Numbers-Disappeared-in-an-Array.js) | Easy |
| 438 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/) | [JavaScript](./algorithms/438-Find-All-Anagrams-in-a-String.js) | Medium |
| 434 | [Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/) | [JavaScript](./algorithms/434-Number-of-Segments-in-a-String.js) | Easy |
| 429 | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal/) | [JavaScript](./algorithms/429-N-ary-Tree-Level-Order-Traversal.js) | Medium |
| 423 | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english/) | [JavaScript](./algorithms/423-Reconstruct-Original-Digits-from-English.js) | Medium |
| 417 | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/) | [JavaScript](./algorithms/417-Pacific-Atlantic-Water-Flow.js) | Medium |
| 415 | [Add Strings](https://leetcode.com/problems/add-strings/) | [JavaScript](./algorithms/415-Add-Strings.js) | Easy |
| 414 | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number/) | [JavaScript](./algorithms/414-Third-Maximum-Number.js) | Easy |
| 413 | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/) | [JavaScript](./algorithms/413-Arithmetic-Slices.js) | Medium |
| 412 | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz/) | [JavaScript](./algorithms/412-Fizz-Buzz.js) | Easy |
| 409 | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome/) | [JavaScript](./algorithms/409-Longest-Palindrome.js) | Easy |
| 404 | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/) | [JavaScript](./algorithms/404-Sum-of-Left-Leaves.js) | Easy |
| 392 | [Is Subsequence](https://leetcode.com/problems/is-subsequence/) | [JavaScript](./algorithms/392-Is-Subsequence.js) | Easy |
| 389 | [Find the Difference](https://leetcode.com/problems/find-the-difference/) | [JavaScript](./algorithms/389-Find-the-Difference.js) | Easy |
| 387 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | [JavaScript](./algorithms/387-First-Unique-Character-in-a-String.js) | Easy |
| 384 | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/) | [JavaScript](./algorithms/384-Shuffle-an-Array.js) | Medium |
| 383 | [Ransom Note](https://leetcode.com/problems/ransom-note/) | [JavaScript](./algorithms/383-Ransom-Note.js) | Easy |
| 382 | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/) | [JavaScript](./algorithms/382-Linked-List-Random-Node.js) | Medium |
| 378 | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/) | [JavaScript](./algorithms/378-Kth-Smallest-Element-in-a-Sorted-Matrix.js) | Medium |
| 377 | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/) | [JavaScript](./algorithms/377-Combination-Sum-IV.js) | Medium |
| 376 | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/) | [JavaScript](./algorithms/376-Wiggle-Subsequence.js) | Medium |
| 374 | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/) | [JavaScript](./algorithms/374-Guess-Number-Higher-or-Lower.js) | Easy |
| 367 | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/) | [JavaScript](./algorithms/367-Valid-Perfect-Square.js) | Easy |
| 363 | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/) | [JavaScript](./algorithms/363-Max-Sum-of-Rectangle-No-Larger-Than-K.js) | Hard |
| 354 | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes/) | [JavaScript](./algorithms/354-Russian-Doll-Envelopes.js) | Hard |
| 350 | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | [JavaScript](./algorithms/350-Intersection-of-Two-Arrays-II.js) | Easy |
| 349 | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/) | [JavaScript](./algorithms/349-Intersection-of-Two-Arrays.js) | Easy |
| 347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | [JavaScript](./algorithms/347-Top-K-Frequent-Elements.js) | Medium |
| 345 | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/) | [JavaScript](./algorithms/345-Reverse-Vowels-of-a-String.js) | Easy |
| 344 | [Reverse String](https://leetcode.com/problems/reverse-string/) | [JavaScript](./algorithms/344-Reverse-String.js) | Easy |
| 342 | [Power of Four](https://leetcode.com/problems/power-of-four/) | [JavaScript](./algorithms/342-Power-of-Four.js) | Easy |
| 341 | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/) | [JavaScript](./algorithms/341-Flatten-Nested-List-Iterator.js) | Medium |
| 338 | [Counting Bits](https://leetcode.com/problems/counting-bits/) | [JavaScript](./algorithms/338-Counting-Bits.js) | Easy |
| 336 | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/) | [JavaScript](./algorithms/336-Palindrome-Pairs.js) | Hard |
| 334 | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/) | [JavaScript](./algorithms/334-Increasing-Triplet-Subsequence.js) | Medium |
| 331 | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/) | [JavaScript](./algorithms/331-Verify-Preorder-Serialization-of-a-Binary-Tree.js) | Medium |
| 329 | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/) | [JavaScript](./algorithms/329-Longest-Increasing-Path-in-a-Matrix.js) | Hard |
| 328 | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/) | [JavaScript](./algorithms/328-Odd-Even-Linked-List.js) | Medium |
| 326 | [Power of Three](https://leetcode.com/problems/power-of-three/) | [JavaScript](./algorithms/326-Power-of-Three.js) | Easy |
| 322 | [Coin Change](https://leetcode.com/problems/coin-change/) | [JavaScript](./algorithms/322-Coin-Change.js) | Medium |
| 318 | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) | [JavaScript](./algorithms/318-Maximum-Product-of-Word-Lengths.js) | Medium |
| 315 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/) | [JavaScript](./algorithms/315-Count-of-Smaller-Numbers-After-Self.js) | Hard |
| 312 | [Burst Balloons](https://leetcode.com/problems/burst-balloons/) | [JavaScript](./algorithms/312-Burst-Balloons.js) | Hard |
| 307 | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/) | [JavaScript](./algorithms/307-Range-Sum-Query-Mutable.js) | Medium |
| 304 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/) | [JavaScript](./algorithms/304-Range-Sum-Query-2D-Immutable.js) | Medium |
| 303 | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/) | [JavaScript](./algorithms/303-Range-Sum-Query-Immutable.js) | Easy |
| 300 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | [JavaScript](./algorithms/300-Longest-Increasing-Subsequence.js) | Medium |
| 295 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | [JavaScript](./algorithms/295-Find-Median-from-Data-Stream.js) | Hard |
| 290 | [Word Pattern](https://leetcode.com/problems/word-pattern/) | [JavaScript](./algorithms/290-Word-Pattern.js) | Easy |
| 289 | [Game of Life](https://leetcode.com/problems/game-of-life/) | [JavaScript](./algorithms/289-Game-of-Life.js) | Medium |
| 284 | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator/) | [JavaScript](./algorithms/284-Peeking-Iterator.js) | Medium |
| 283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | [JavaScript](./algorithms/283-Move-Zeroes.js) | Easy |
| 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version/) | [JavaScript](./algorithms/278-First-Bad-Version.js) | Easy |
| 268 | [Missing Number](https://leetcode.com/problems/missing-number/) | [JavaScript](./algorithms/268-Missing-Number.js) | Easy |
| 263 | [Ugly Number](https://leetcode.com/problems/ugly-number/) | [JavaScript](./algorithms/263-Ugly-Number.js) | Easy |
| 258 | [Add Digits](https://leetcode.com/problems/add-digits/) | [JavaScript](./algorithms/258-Add-Digits.js) | Easy |
| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | [JavaScript](./algorithms/242-Valid-Anagram.js) | Easy |
| 240 | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/) | [JavaScript](./algorithms/240-Search-a-2D-Matrix-II.js) | Medium |
| 237 | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/) | [JavaScript](./algorithms/237-Delete-Node-in-a-Linked-List.js) | Easy |
| 236 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | [JavaScript](./algorithms/236-Lowest-Common-Ancestor-of-a-Binary-Tree.js) | Medium |
| 235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | [JavaScript](./algorithms/235-Lowest-Common-Ancestor-of-a-Binary-Search-Tree.js) | Easy |
| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | [JavaScript](./algorithms/234-Palindrome-Linked-List.js) | Easy |
| 231 | [Power of Two](https://leetcode.com/problems/power-of-two/) | [JavaScript](./algorithms/231-Power-of-Two.js) | Easy |
| 228 | [Summary Ranges](https://leetcode.com/problems/summary-ranges/) | [JavaScript](./algorithms/228-Summary-Ranges.js) | Easy |
| 227 | [Summary Ranges](https://leetcode.com/problems/basic-calculator-ii/) | [JavaScript](./algorithms/227-Basic-Calculator-II.js) | Hard |
| 225 | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/) | [JavaScript](./algorithms/225-Implement-Stack-using-Queues.js) | Easy |
| 219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/) | [JavaScript](./algorithms/219-Contains-Duplicate-II.js) | Easy |
| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [JavaScript](./algorithms/217-Contains-Duplicate.js) | Easy |
| 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | [JavaScript](./algorithms/215-Kth-Largest-Element-in-an-Array.js) | Medium |
| 209 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/) | [JavaScript](./algorithms/209-Minimum-Size-Subarray-Sum.js) | Easy |
| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | [JavaScript](./algorithms/206-Reverse-Linked-List.js) | Easy |
| 205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/) | [JavaScript](./algorithms/205-Isomorphic-Strings.js) | Easy |
| 204 | [Count Primes](https://leetcode.com/problems/count-primes/) | [JavaScript](./algorithms/204-Count-Primes.js) | Easy |
| 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/) | [JavaScript](./algorithms/203-Remove-Linked-List-Elements.js) | Easy |
| 202 | [Happy Number](https://leetcode.com/problems/happy-number/) | [JavaScript](./algorithms/202-Happy-Number.js) | Easy |
| 199 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) | [JavaScript](./algorithms/199-Binary-Tree-Right-Side-View.js) | Medium |
| 198 | [House Robber](https://leetcode.com/problems/house-robber/) | [JavaScript](./algorithms/198-House-Robber.js) | Medium |
| 195 | [Tenth Line](https://leetcode.com/problems/tenth-line/) | [Shell](./shell/195-Tenth-Line.sh) | Easy |
| 191 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | [JavaScript](./algorithms/191-Number-of-1-Bits.js) | Easy |
| 190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits/) | [JavaScript](./algorithms/190-Reverse-Bits.js) | Easy |
| 189 | [Rotate Array](https://leetcode.com/problems/rotate-array/) | [JavaScript](./algorithms/189-Rotate-Array.js) | Medium |
| 182 | [Duplicate Emails](https://leetcode.com/problems/duplicate-emails/) | [SQL](./algorithms/182-Duplicate-Emails.sql) | Easy |
| 172 | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/) | [JavaScript](./algorithms/172-Factorial-Trailing-Zeroes.js) | Easy |
| 171 | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/) | [JavaScript](./algorithms/171-Excel-Sheet-Column-Number.js) | Easy |
| 169 | [Majority Element](https://leetcode.com/problems/majority-element/) | [JavaScript](./algorithms/169-Majority-Element.js) | Easy |
| 167 | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) | [JavaScript](./algorithms/167-Two-Sum-II-Input-array-is-sorted.js) | Easy |
| 164 | [Maximum Gap](https://leetcode.com/problems/maximum-gap/) | [JavaScript](./algorithms/164-Maximum-Gap.js) | Hard |
| 162 | [Find Peak Element](https://leetcode.com/problems/find-peak-element/) | [JavaScript](./algorithms/162-Find-Peak-Element.js) | Medium |
| 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | [JavaScript](./algorithms/160-Intersection-of-Two-Linked-Lists.js) | Easy |
| 155 | [Min Stack](https://leetcode.com/problems/min-stack/) | [JavaScript](./algorithms/155-Min-Stack.js) | Easy |
| 154 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/) | [JavaScript](./algorithms/154-Find-Minimum-in-Rotated-Sorted-Array-II.js) | Hard |
| 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | [JavaScript](./algorithms/153-Find-Minimum-in-Rotated-Sorted-Array.js) | Medium |
| 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | [JavaScript](./algorithms/152-Maximum-Product-Subarray.js) | Medium |
| 150 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) | [JavaScript](./algorithms/150-Evaluate-Reverse-Polish-Notation.js) | Medium |
| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | [JavaScript](./algorithms/141-Linked-List-Cycle.js) | Easy |
| 138 | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/) | [JavaScript](./algorithms/138-Copy-List-with-Random-Pointer.js) | Medium |
| 136 | [Single Number](https://leetcode.com/problems/single-number/) | [JavaScript](./algorithms/136-Single-Number.js) | Easy |
| 135 | [Candy](https://leetcode.com/problems/candy/) | [JavaScript](./algorithms/135-Candy.js) | Hard |
| 132 | [Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii/) | [JavaScript](./algorithms/132-Palindrome-Partitioning-II.js) | Hard |
| 131 | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/) | [JavaScript](./algorithms/131-Palindrome-Partitioning.js) | Medium |
| 128 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | [JavaScript](./algorithms/128-Longest-Consecutive-Sequence.js) | Medium |
| 127 | [Word Ladder](https://leetcode.com/problems/word-ladder/) | [JavaScript](./algorithms/127-Word-Ladder.js) | Hard |
| 126 | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii/) | [JavaScript](./algorithms/126-Word-Ladder-II.js) | Hard |
| 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | [JavaScript](./algorithms/125-Valid-Palindrome.js) | Easy |
| 121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [JavaScript](./algorithms/121-Best-Time-to-Buy-and-Sell-Stock.js) | Easy |
| 120 | [Triangle](https://leetcode.com/problems/triangle/) | [JavaScript](./algorithms/120-Triangle.js) | Medium |
| 119 | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/) | [JavaScript](./algorithms/119-Pascal's-Triangle-II.js) | Easy |
| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) | [JavaScript](./algorithms/118-Pascal's-Triangle.js) | Easy |
| 116 | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) | [JavaScript](./algorithms/116-Populating-Next-Right-Pointers-in-Each-Node.js) | Medium |
| 114 | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/) | [JavaScript](./algorithms/114-Flatten-Binary-Tree-to-Linked-List.js) | Medium |
| 113 | [Path Sum II](https://leetcode.com/problems/path-sum-ii/) | [JavaScript](./algorithms/113-Path-Sum-II.js) | Medium |
| 112 | [Path Sum](https://leetcode.com/problems/path-sum/) | [JavaScript](./algorithms/112-Path-Sum.js) | Easy |
| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | [JavaScript](./algorithms/110-Balanced-Binary-Tree.js) | Easy |
| 109 | [Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/) | [JavaScript](./algorithms/109-Convert-Sorted-List-to-Binary-Search-Tree.js) | Medium |
| 108 | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) | [JavaScript](./algorithms/108-Convert-Sorted-Array-to-Binary-Search-Tree.js) | Easy |
| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [JavaScript](./algorithms/105-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.js) | Medium |
| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | [JavaScript](./algorithms/104-Maximum-Depth-of-Binary-Tree.js) | Easy |
| 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | [JavaScript](./algorithms/102-Binary-Tree-Level-Order-Traversal.js) | Medium |
| 100 | [Same Tree](https://leetcode.com/problems/same-tree/) | [JavaScript](./algorithms/100-Same-Tree.js) | Easy |
| 98 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | [JavaScript](./algorithms/98-Validate-Binary-Search-Tree.js) | Medium |
| 97 | [Interleaving String](https://leetcode.com/problems/interleaving-string/) | [JavaScript](./algorithms/97-Interleaving-String.js) | Medium |
| 92 | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/) | [JavaScript](./algorithms/92-Reverse-Linked-List-II.js) | Medium |
| 91 | [Decode Ways](https://leetcode.com/problems/decode-ways/) | [JavaScript](./algorithms/91-Decode-Ways.js) | Medium |
| 90 | [Subsets II](https://leetcode.com/problems/subsets-ii/) | [JavaScript](./algorithms/90-Subsets-II.js) | Medium |
| 89 | [Gray Code](https://leetcode.com/problems/gray-code/) | [JavaScript](./algorithms/89-Gray-Code.js) | Medium |
| 88 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | [JavaScript](./algorithms/88-Merge-Sorted-Array.js) | Easy |
| 86 | [Partition List](https://leetcode.com/problems/partition-list/) | [JavaScript](./algorithms/86-Partition-List.js) | Medium |
| 83 | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | [JavaScript](./algorithms/83-Remove-Duplicates-from-Sorted-List.js) | Easy |
| 82 | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/) | [JavaScript](./algorithms/82-Remove-Duplicates-from-Sorted-List-II.js) | Medium |
| 80 | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) | [JavaScript](./algorithms/80-Remove-Duplicates-from-Sorted-Array-II.js) | Medium |
| 77 | [Combinations](https://leetcode.com/problems/combinations/) | [JavaScript](./algorithms/77-Combinations.js) | Medium |
| 74 | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/) | [JavaScript](./algorithms/74-Search-a-2D-Matrix.js) | Medium |
| 73 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | [JavaScript](./algorithms/73-Set-Matrix-Zeroes.js) | Medium |
| 71 | [Simplify Path](https://leetcode.com/problems/simplify-path/) | [JavaScript](./algorithms/71-Simplify-Path.js) | Medium |
| 70 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | [JavaScript](./algorithms/70-Climbing-Stairs.js) | Easy |
| 69 | [Sqrt(x)](https://leetcode.com/problems/sqrtx/) | [JavaScript](<./algorithms/69-Sqrt(x).js>) | Easy |
| 67 | [Add Binary](https://leetcode.com/problems/add-binary/) | [JavaScript](./algorithms/67-Add-Binary.js) | Easy |
| 66 | [Plus One](https://leetcode.com/problems/plus-one/) | [JavaScript](./algorithms/66-Plus-One.js) | Easy |
| 65 | [Valid Number](https://leetcode.com/problems/valid-number/) | [JavaScript](./algorithms/65-Valid-Number.js) | Hard |
| 63 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii/) | [JavaScript](./algorithms/63-Unique-Paths-II.js) | Medium |
| 58 | [Length of Last Word](https://leetcode.com/problems/length-of-last-word/) | [JavaScript](./algorithms/58-Length-of-Last-Word.js) | Easy |
| 56 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | [JavaScript](./algorithms/56-Merge-Intervals.js) | Medium |
| 54 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | [JavaScript](./algorithms/54-Spiral-Matrix.js) | Medium |
| 53 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | [JavaScript](./algorithms/53-Maximum-Subarray.js) | Easy |
| 52 | [N-Queens II](https://leetcode.com/problems/n-queens-ii/) | [JavaScript](./algorithms/52-N-Queens-II.js) | Hard |
| 51 | [N-Queens](https://leetcode.com/problems/n-queens/) | [JavaScript](./algorithms/51-N-Queens.js) | Hard |
| 49 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | [JavaScript](./algorithms/49-Group-Anagrams.js) | Medium |
| 48 | [Rotate Image](https://leetcode.com/problems/rotate-image/) | [JavaScript](./algorithms/48-Rotate-Image.js) | Medium |
| 46 | [Permutations](https://leetcode.com/problems/permutations/) | [JavaScript](./algorithms/46-Permutations.js) | Medium |
| 45 | [Jump Game II](https://leetcode.com/problems/jump-game-ii/) | [JavaScript](./algorithms/45-Jump-Game-II.js) | Medium |
| 43 | [Multiply Strings](https://leetcode.com/problems/multiply-strings/) | [JavaScript](./algorithms/43-Multiply-Strings.js) | Medium |
| 42 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | [JavaScript](./algorithms/42-Trapping-Rain-Water.js) | Hard |
| 41 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/) | [JavaScript](./algorithms/41-First-Missing-Positive.js) | Hard |
| 35 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | [JavaScript](./algorithms/35-Search-Insert-Position.js) | Easy |
| 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/) | [JavaScript](./algorithms/34-Find-First-and-Last-Position-of-Element-in-Sorted-Array.js) | Medium |
| 32 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | [JavaScript](./algorithms/32-Longest-Valid-Parentheses.js) | Hard |
| 31 | [Next Permutation](https://leetcode.com/problems/next-permutation/) | [JavaScript](./algorithms/31-Next-Permutation.js) | Medium |
| 29 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) | [JavaScript](./algorithms/29-Divide-Two-Integers.js) | Medium |
| 28 | [Implement strStr()](https://leetcode.com/problems/implement-strstr/) | [JavaScript](<./algorithms/28-Implement-strStr().js>) | Easy |
| 27 | [Remove Element](https://leetcode.com/problems/remove-element/) | [JavaScript](./algorithms/27-Remove-Element.js) | Easy |
| 26 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | [JavaScript](./algorithms/26-Remove-Duplicates-from-Sorted-Array.js) | Easy |
| 25 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | [JavaScript](./algorithms/25-Reverse-Nodes-in-k-Group.js) | Hard |
| 24 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) | [JavaScript](./algorithms/24-Swap-Nodes-in-Pairs.js) | Medium |
| 23 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | [JavaScript](./algorithms/23-Merge-k-Sorted-Lists.js) | Hard |
| 22 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | [JavaScript](./algorithms/22-Generate-Parentheses.js) | Medium |
| 21 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | [JavaScript](./algorithms/21-Merge-Two-Sorted-Lists.js) | Easy |
| 20 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | [JavaScript](./algorithms/20-Valid-Parentheses.js) | Easy |
| 19 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | [JavaScript](./algorithms/19-Remove-Nth-Node-From-End-of-List.js) | Medium |
| 18 | [4Sum](https://leetcode.com/problems/4sum/) | [JavaScript](./algorithms/18-4Sum.js) | Medium |
| 17 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | [JavaScript](./algorithms/17-Letter-Combinations-of-a-Phone-Number.js) | Medium |
| 16 | [3Sum Closest](https://leetcode.com/problems/3sum-closest/) | [JavaScript](./algorithms/16-3Sum-Closest.js) | Medium |
| 15 | [3Sum](https://leetcode.com/problems/3sum/) | [JavaScript](./algorithms/15-3Sum.js) | Medium |
| 14 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | [JavaScript](./algorithms/14-Longest-Common-Prefix.js) | Easy |
| 13 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer/) | [JavaScript](./algorithms/13-Roman-to-Integer.js) | Easy |
| 12 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman/) | [JavaScript](./algorithms/12-Integer-to-Roman.js) | Medium |
| 11 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | [JavaScript](./algorithms/11-Container-With-Most-Water.js) | Medium |
| 9 | [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | [JavaScript](./algorithms/9-Palindrome-Number.js) | Easy |
| 8 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/) | [JavaScript](<./algorithms/8-String-to-Integer-(atoi).js>) | Medium |
| 7 | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | [JavaScript](./algorithms/7-Reverse-Integer.js) | Easy |
| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | [JavaScript](./algorithms/5-Longest-Palindromic-Substring.js) | Medium |
| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [JavaScript](./algorithms/4-Median-of-Two-Sorted-Arrays.js) | Hard |
| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [JavaScript](./algorithms/3-Longest-Substring-Without-Repeating-Characters.js) | Medium |
| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | [JavaScript](./algorithms/2-Add-Two-Numbers.js) | Medium |
| 1 | [Two Sum](https://leetcode.com/problems/two-sum/) | [JavaScript](./algorithms/1-Two-Sum.js) | Easy |