{"id":13701963,"url":"https://github.com/dnshi/Leetcode","last_synced_at":"2025-05-05T04:30:37.029Z","repository":{"id":78355614,"uuid":"38902966","full_name":"dnshi/Leetcode","owner":"dnshi","description":"Leetcode problems \u0026 solutions","archived":false,"fork":false,"pushed_at":"2023-12-26T08:47:19.000Z","size":1042,"stargazers_count":269,"open_issues_count":0,"forks_count":40,"subscribers_count":11,"default_branch":"master","last_synced_at":"2025-04-14T23:02:53.625Z","etag":null,"topics":["algorithms","datastructures","javascript","leetcode","solutions"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/dnshi.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.md","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null}},"created_at":"2015-07-10T21:30:24.000Z","updated_at":"2025-02-02T04:04:05.000Z","dependencies_parsed_at":"2024-01-14T19:37:47.886Z","dependency_job_id":null,"html_url":"https://github.com/dnshi/Leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dnshi%2FLeetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dnshi%2FLeetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dnshi%2FLeetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dnshi%2FLeetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dnshi","download_url":"https://codeload.github.com/dnshi/Leetcode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252439361,"owners_count":21747993,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","datastructures","javascript","leetcode","solutions"],"created_at":"2024-08-02T21:00:28.399Z","updated_at":"2025-05-05T04:30:36.701Z","avatar_url":"https://github.com/dnshi.png","language":"JavaScript","readme":"# LeetCode\n[![GitHub license](https://img.shields.io/github/license/mashape/apistatus.svg)](https://github.com/dnshi/Leetcode/blob/master/LICENSE.md)\n### LeetCode Algorithms\n\n| # | Title | Solution | Difficulty |\n|---| ----- | -------- | ---------- |\n|2974|[Minimum Number Game](https://leetcode.com/problems/minimum-number-game)|[JavaScript](algorithms/MinimumNumberGame.js)|Easy|\n|1848|[Minimum Distance to the Target Element](https://leetcode.com/problems/minimum-distance-to-the-target-element)|[JavaScript](algorithms/MinimumDistanceToTheTargetElement.js)|Easy|\n|1839|[Longest Substring Of All Vowels in Order](https://leetcode.com/problems/longest-substring-of-all-vowels-in-order)|[JavaScript](algorithms/LongestSubstringOfAllVowelsInOrder.js)|Medium|\n|1452|[People Whose List of Favorite Companies Is Not a Subset of Another List](https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list)|[JavaScript](algorithms/PeopleWhoseListOfFavoriteCompaniesIsNotASubsetOfAnotherList.js)|Medium|\n|1451|[Rearrange Words in a Sentence](https://leetcode.com/problems/rearrange-words-in-a-sentence)|[JavaScript](algorithms/RearrangeWordsInASentence.js)|Medium|\n|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/NumberOfStudentsDoingHomeworkAtAGivenTime.js)|Easy|\n|1446|[Consecutive Characters](https://leetcode.com/problems/consecutive-characters)|[JavaScript](algorithms/ConsecutiveCharacters.js)|Easy|\n|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/FindACorrespondingNodeOfABinaryTreeInACloneOfThatTree.js)|Medium|\n|1344|[Angle Between Hands of a Clock](https://leetcode.com/problems/angle-between-hands-of-a-clock)|[JavaScript](algorithms/AngleBetweenHandsOfAClock.js)|Medium|\n|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/ConvertBinaryNumberInALinkedListToInteger.js)|Easy|\n|1288|[Remove Covered Intervals](https://leetcode.com/problems/remove-covered-intervals)|[JavaScript](algorithms/RemoveCoveredIntervals.js)|Medium|\n|1089|[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros)|[JavaScript](algorithms/DuplicateZeros.js)|Easy|\n|1071|[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings)|[JavaScript](algorithms/GreatestCommonDivisorOfStrings.js)|Easy|\n|1047|[Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string)|[JavaScript](algorithms/RemoveAllAdjacentDuplicatesInString.js)|Easy|\n|1046|[Last Stone Weight](https://leetcode.com/problems/last-stone-weight)|[JavaScript](algorithms/LastStoneWeight.js)|Easy|\n|1038|[Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree)|[JavaScript](algorithms/BinarySearchTreeToGreaterSumTree.js)|Medium|\n|1021|[Remove Outermost Parentheses](https://leetcode.com/problems/remove-outermost-parentheses)|[JavaScript](algorithms/RemoveOutermostParentheses.js)|Easy|\n|1019|[Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list)|[JavaScript](algorithms/NextGreaterNodeInLinkedList.js) \u0026 [JavaScript Recursion](algorithms/NextGreaterNodeInLinkedListRecursion.js)|Medium|\n|1009|[Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer)|[JavaScript](algorithms/ComplementOfBase10Integer.js)|Easy|\n|1008|[Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal)|[JavaScript](algorithms/ConstructBinarySearchTreeFromPreorderTraversal.js)|Medium|\n|1002|[Find Common Characters](https://leetcode.com/problems/find-common-characters)|[JavaScript](algorithms/FindCommonCharacters.js)|Easy|\n|989|[Add to Array-Form of Integer](https://leetcode.com/problems/add-to-array-form-of-integer)|[JavaScript](algorithms/AddToArrayFormOfInteger.js)|Easy|\n|986|[Interval List Intersections](https://leetcode.com/problems/interval-list-intersections)|[JavaScript](algorithms/IntervalListIntersections.js)|Medium|\n|977|[Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array)|[JavaScript](algorithms/SquaresOfASortedArray.js)|Easy|\n|965|[Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree)|[JavaScript](algorithms/UnivaluedBinaryTree.js)|Easy|\n|961|[N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array)|[JavaScript](algorithms/N-RepeatedElementInSize2NArray.js)|Easy|\n|938|[Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst)|[JavaScript](algorithms/RangeSumOfBST.js)|Medium|\n|929|[Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses)|[JavaScript](algorithms/UniqueEmailAddresses.js)|Easy|\n|922|[Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii)|[JavaScript](algorithms/SortArrayByParity_II.js)|Easy|\n|905|[Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity)|[JavaScript](algorithms/SortArrayByParity.js)|Easy|\n|890|[Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern)|[JavaScript](./algorithms/FindAndReplacePattern.js)|Medium|\n|888|[Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences)|[JavaScript](./algorithms/UncommonWordsFromTwoSentences.js)|Easy|\n|881|[Boats to Save People](https://leetcode.com/problems/boats-to-save-people)|[JavaScript](./algorithms/BoatsToSavePeople.js)|Medium|\n|876|[Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list)|[JavaScript](./algorithms/MiddleOfTheLinkedList.js)|Easy|\n|859|[Buddy Strings](https://leetcode.com/problems/buddy-strings)|[JavaScript](./algorithms/BuddyStrings.js)|Easy|\n|852|[Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array)|[JavaScript](./algorithms/PeakIndexInAMountainArray.js)|Easy|\n|844|[Backspace String Compare](https://leetcode.com/problems/backspace-string-compare)|[JavaScript](./algorithms/BackspaceStringCompare.js)|Easy|\n|814|[Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning)|[JavaScript](./algorithms/BinaryTreePruning.js)|Medium|\n|804|[Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words)|[JavaScript](./algorithms/UniqueMorseCodeWords.js)|Easy|\n|796|[Rotate String](https://leetcode.com/problems/rotate-string)|[JavaScript](./algorithms/RotateString.js)|Easy|\n|788|[Rotated Digits](https://leetcode.com/problems/rotated-digits)|[JavaScript](./algorithms/RotatedDigits.js)|Easy|\n|771|[Jewels and Stones](https://leetcode.com/problems/jewels-and-stones)|[JavaScript](./algorithms/JewelsAndStones.js)|Easy|\n|760|[Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings)|[JavaScript](./algorithms/FindAnagramMappings.js)|Easy|\n|747|[Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others)|[JavaScript](./algorithms/LargestNumberAtLeastTwiceOfOthers.js)|Easy|\n|744|[Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target)|[JavaScript](./algorithms/FindSmallestLetterGreaterThanTarget.js)|Easy|\n|728|[Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers)|[JavaScript](./algorithms/SelfDividingNumbers.js)|Easy|\n|724|[Find Pivot Index](https://leetcode.com/problems/find-pivot-index)|[JavaScript](./algorithms/FindPivotIndex.js)|Easy|\n|709|[To Lower Case](https://leetcode.com/problems/to-lower-case)|[JavaScript](./algorithms/ToLowerCase.js)|Easy|\n|701|[Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree)|[JavaScript](algorithms/InsertIntoABinarySearchTree.js)|Medium|\n|693|[Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits)|[JavaScript](./algorithms/BinaryNumberWithAlternatingBits.js)|Easy|\n|692|[Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words)|[JavaScript](./algorithms/TopKFrequentWords.js)|Medium|\n|686|[Repeated String Match](https://leetcode.com/problems/repeated-string-match)|[JavaScript](./algorithms/RepeatedStringMatch.js)|Easy|\n|682|[Baseball Game](https://leetcode.com/problems/baseball-game)|[JavaScript](algorithms/BaseballGame.js)|Easy|\n|680|[Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii)|[JavaScript](./algorithms/ValidPalindrome_II.js)|Easy|\n|679|[24 Game](https://leetcode.com/problems/24-game)|[JavaScript](./algorithms/24Game.js)|Hard|\n|678|[Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string)|[JavaScript](./algorithms/ValidParenthesisString.js)|Medium|\n|677|[Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs)|[JavaScript](./algorithms/MapSumPairs.js)|Medium|\n|676|[Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary)|[JavaScript](./algorithms/ImplementMagicDict.js)|Medium|\n|674|[Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | [JavaScript](./algorithms/LongestContinuousIncreasingSubsequence.js)|Easy|\n|672|[Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii) | [JavaScript](./algorithms/BulbSwitcher_II.js)|Medium|\n|671|[Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree) | [JavaScript](./algorithms/SecondMinimumNodeInABinaryTree.js)|Easy|\n|670|[Maximum Swap](https://leetcode.com/problems/maximum-swap) | [JavaScript](./algorithms/MaximumSwap.js)|Medium|\n|660|[Remove 9](https://leetcode.com/problems/remove-9) | [JavaScript](./algorithms/Remove9.js)|Hard|\n|657|[Judge Route Circle](https://leetcode.com/problems/judge-route-circle) | [JavaScript](./algorithms/JudgeRouteCircle.js)|Easy|\n|654|[Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree) | [JavaScript](./algorithms/MaximumBinaryTree.js)|Medium|\n|653|[Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | [JavaScript](./algorithms/TwoSum_IV.js)|Easy|\n|645|[Set Mismatch](https://leetcode.com/problems/set-mismatch) | [JavaScript](./algorithms/SetMismatch.js)|Easy|\n|643|[Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i) | [JavaScript](./algorithms/MaximumAverageSubarray_I.js)|Easy|\n|637|[Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | [JavaScript](./algorithms/AverageOfLevelsInBinaryTree.js)|Easy|\n|633|[Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | [JavaScript](./algorithms/SumOfSquareNumbers.js)|Easy|\n|628|[Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/) | [JavaScript](./algorithms/MaximumProductOfThreeNumbers.js)|Easy|\n|623|[Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree) | [JavaScript](./algorithms/AddOneRowToTree.js)|Medium|\n|617|[Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [JavaScript](./algorithms/MergeTwoBinaryTrees.js)|Easy|\n|606|[Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | [JavaScript](./algorithms/ConstructStringFromBinaryTree.js)|Easy|\n|599|[Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | [JavaScript](./algorithms/MinimumIndexSumOfTwoLists.js)|Easy|\n|563|[Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | [JavaScript](./algorithms/BinaryTreeTilt.js)|Easy|\n|561|[Array Partition I](https://leetcode.com/problems/array-partition-i) | [JavaScript](./algorithms/ArrayPartition_I.js)|Easy|\n|557|[Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | [JavaScript](./algorithms/ReverseWordsInAString_III.js)|Easy|\n|551|[Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | [JavaScript](./algorithms/StudentAttendanceRecord_I.js)|Easy|\n|543|[Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | [JavaScript](./algorithms/DiameterOfBinaryTree.js)|Easy|\n|541|[Reverse String II](https://leetcode.com/problems/reverse-string-ii) | [JavaScript](./algorithms/ReverseString_II.js)|Easy|\n|532|[K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | [JavaScript](./algorithms/KdiffPairsInAnArray.js)|Easy|\n|530|[Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | [JavaScript](./algorithms/MinimumAbsoluteDifferenceInBST.js)|Easy|\n|524|[Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting) | [JavaScript](./algorithms/LongestWordInDictionaryThroughDeleting.js)|Medium|\n|520|[Detect Capital](https://leetcode.com/problems/detect-capital) | [JavaScript](./algorithms/DetectCapital.js)|Easy|\n|518|[Coin Change 2](https://leetcode.com/problems/coin-change-2) | [JavaScript](./algorithms/CoinChange_II.js)|Medium|\n|515|[Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row) | [JavaScript](./algorithms/FindLargestValueInEachTreeRow.js)|Medium|\n|513|[Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value) | [JavaScript](./algorithms/FindBottomLeftTreeValue.js)|Medium|\n|509|[Fibonacci Number](https://leetcode.com/problems/fibonacci-number)|[JavaScript](algorithms/FibonacciNumber.js)|Easy|\n|508|[Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum) | [JavaScript](./algorithms/MostFrequentSubtreeSum.js)|Medium|\n|507|[Perfect Number](https://leetcode.com/problems/perfect-number) | [JavaScript](./algorithms/PerfectNumber.js)|Easy|\n|504|[Base 7](https://leetcode.com/problems/base-7) | [JavaScript](./algorithms/Base7.js)|Easy|\n|496|[Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | [JavaScript](./algorithms/NextGreaterElementI.js)|Easy|\n|482|[License Key Formatting](https://leetcode.com/problems/license-key-formatting) | [JavaScript](./algorithms/LicenseKeyFormatting.js)|Medium|\n|476|[Number Complement](https://leetcode.com/problems/number-complement) | [JavaScript](./algorithms/NumberComplement.js)|Easy|\n|461|[Hamming Distance](https://leetcode.com/problems/hamming-distance) | [JavaScript](./algorithms/HammingDistance.js)|Easy|\n|449|[Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst)|[JavaScript](algorithms/SerializeAndDeserializeBST.js)|Medium|\n|448|[Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | [JavaScript](./algorithms/FindAllNumbersDisappearedInAnArray.js)|Easy|\n|442|[Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array) | [JavaScript](./algorithms/FindAllDuplicatesInAnArray.js)|Medium|\n|434|[Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string) | [JavaScript](./algorithms/NumberOfSegmentsInAString.js)|Easy|\n|414|[Third Maximum Number](https://leetcode.com/problems/third-maximum-number)|[JavaScript](algorithms/ThirdMaximumNumber.js)|Easy|\n|412|[Fizz Buzz](https://leetcode.com/problems/fizz-buzz) | [JavaScript](./algorithms/FizzBuzz.js)|Easy|\n|409|[Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | [JavaScript](./algorithms/LongestPalindrome.js)|Easy|\n|405|[Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal) | [JavaScript](./algorithms/ConvertANumberToHexadecimal.js)|Easy|\n|404|[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves) | [JavaScript](./algorithms/SumOfLeftLeaves.js)|Easy|\n|387|[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string) | [JavaScript](./algorithms/FirstUniqueCharacterInAString.js)|Easy|\n|384|[Shuffle an Array](https://leetcode.com/problems/shuffle-an-array) | [JavaScript](./algorithms/ShuffleAnArray.js)|Medium|\n|345|[Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string) | [JavaScript](./algorithms/ReverseVowelsOfAString.js)|Easy|\n|344|[Reverse String](https://leetcode.com/problems/reverse-string) | [JavaScript](./algorithms/ReverseString.js)|Easy|\n|342|[Power of Four](https://leetcode.com/problems/power-of-four) | [JavaScript](./algorithms/PowerOfFour.js)|Easy|\n|341|[Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator)|[JavaScript](algorithms/FlattenNestedListIterator.js)|Medium|\n|326|[Power of Three](https://leetcode.com/problems/power-of-three) | [JavaScript](./algorithms/PowerOfThree.js)|Easy|\n|322|[Coin Change](https://leetcode.com/problems/coin-change) | [JavaScript](./algorithms/CoinChange.js)|Medium|\n|319|[Bulb Switcher](https://leetcode.com/problems/bulb-switcher) | [JavaScript](./algorithms/BulbSwitcher.js)|Medium|\n|299|[Bulls and Cows](https://leetcode.com/problems/bulls-and-cows)|[JavaScript](algorithms/BullsAndCows.js)|Medium|\n|297|[Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree)|[JavaScript](algorithms/SerializeAndDeserializeBinaryTree.js)|Hard|\n|287|[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number)|[JavaScript](algorithms/FindTheDuplicateNumber.js)|Medium|\n|283|[Move Zeroes](https://leetcode.com/problems/move-zeroes)|[JavaScript](algorithms/MoveZeroes.js)|Easy|\n|278|[First Bad Version](https://leetcode.com/problems/first-bad-version)|[JavaScript](./algorithms/FirstBadVersion.js)|Easy|\n|273|[Integer to English Words](https://leetcode.com/problems/integer-to-english-words)|[JavaScript](./algorithms/IntegerToEnglishWords.js)|Hard|\n|268|[Missing Number](https://leetcode.com/problems/missing-number) | [JavaScript](./algorithms/MissingNumber.js)|Easy|\n|263|[Ugly Number](https://leetcode.com/problems/ugly-number)|[JavaScript](./algorithms/UglyNumber.js)|Easy|\n|234|[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list)|[JavaScript](./algorithms/PalindromeLinkedList.js)|Easy|\n|230|[Kth Smallest Element in BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)|[JavaScript](./algorithms/KthSmallestElementInBST.js)|Medium|\n|227|[Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii)|[JavaScript](./algorithms/BasicCalculator_II.js)|Medium|\n|226|[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)| [JavaScript](./algorithms/InvertBinaryTree.js)|Easy|\n|225|[Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/)| [JavaScript](./algorithms/ImplementStackUsingQueues.js)|Medium|\n|219|[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)| [JavaScript](./algorithms/ContainsDuplicate.II.js)|Easy|\n|217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate)|[JavaScript](algorithms/ContainsDuplicate.js)|Easy|\n|215|[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | [JavaScript](./algorithms/KthLargestElementInAnArray.js)|Medium|\n|208|[Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree)|[JavaScript](algorithms/ImplementTrie(PrefixTree).js)|Medium|\n|206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)| [JavaScript](./algorithms/ReverseLinkedList.js)|Easy|\n|205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/)| [JavaScript](./algorithms/IsomorphicStrings.js)|Easy|\n|203|[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/)| [JavaScript](./algorithms/RemoveLinkedListElements.js)|Easy|\n|202|[Happy Number](https://leetcode.com/problems/happy-number/)| [JavaScript](./algorithms/HappyNumber.js)|Easy|\n|199|[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view)|[JavaScript](algorithms/BinaryTreeRightSideView.js)|Medium|\n|191|[Number of 1 Bits](https://oj.leetcode.com/problems/number-of-1-bits/)| [JavaScript](./algorithms/NumberOf1Bits.js)|Easy|\n|190|[Reverse Bits](https://oj.leetcode.com/problems/reverse-bits/)| [JavaScript](./algorithms/ReverseBits.js)|Easy|\n|172|[Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/)|[JavaScript](./algorithms/FactorialTrailingZeroes.js)|Easy|\n|171|[Excel Sheet Column Number](https://oj.leetcode.com/problems/excel-sheet-column-number/) | [JavaScript](./algorithms/ExcelSheetColumnNumber.js)|Easy|\n|169|[Majority Element](https://oj.leetcode.com/problems/majority-element/) | [JavaScript](./algorithms/MajorityElement.js)|Easy|\n|168|[Excel Sheet Column Title](https://oj.leetcode.com/problems/excel-sheet-column-title/) | [JavaScript](./algorithms/ExcelSheetColumnTitle.js)|Easy|\n|167|[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | [JavaScript](./algorithms/TwoSum_II.js)|Easy|\n|165|[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers) | [JavaScript](./algorithms/CompareVersionNumbers.js)|Medium|\n|155|[Min Stack](https://leetcode.com/problems/min-stack) | [JavaScript](./algorithms/MinStack.js)|Easy|\n|151|[Reverse Words in a String](https://oj.leetcode.com/problems/reverse-words-in-a-string/)| [JavaScript](./algorithms/ReverseWordsInAString.js)|Medium|\n|146|[LRU Cache](https://leetcode.com/problems/lru-cache) | [JavaScript](./algorithms/LRUCache.js)|Hard|\n|142|[Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)|[JavaScript](./algorithms/LinkedListCycle_II.js)|Medium|\n|141|[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle)|[JavaScript](./algorithms/LinkedListCycle.js)|Easy|\n|136|[Single Number](https://oj.leetcode.com/problems/single-number/)| [JavaScript](./algorithms/SingleNumber.js)|Medium|\n|122|[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii)|[JavaScript](./algorithms/BestTimeToBuyAndSellStock_II.js)|Easy|\n|121|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | [JavaScript](./algorithms/BestTimeToBuyAndSellStock.js)|Easy|\n|119|[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii) | [JavaScript](./algorithms/PascalsTriangle_II.js)|Easy|\n|118|[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle) | [JavaScript](./algorithms/PascalsTriangle.js)|Easy|\n|112|[Path Sum](https://leetcode.com/problems/path-sum)|[JavaScript](algorithms/PathSum.js)|Easy|\n|111|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | [JavaScript](./algorithms/MinimumDepthOfBinaryTree.js)|Easy|\n|109|[Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree)|[JavaScript](algorithms/ConvertSortedListToBinarySearchTree.js)|Medium|\n|108|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | [JavaScript](./algorithms/ConvertSortedArrayToBinarySearchTree.js)|Easy|\n|107|[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii) | [JavaScript](./algorithms/BinaryTreeLevelOrderTraversal_II.js)|Easy|\n|103|[Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal) | [JavaScript](./algorithms/BinaryTreeZigzagLevelOrderTraversal.js)|Medium|\n|102|[Binary Tree Level Order Traversal](https://oj.leetcode.com/problems/binary-tree-level-order-traversal/)| [JavaScript](./algorithms/BinaryTreeLevelOrderTraversal.js)|Easy|\n|101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree) | [JavaScript](./algorithms/SymmetricTree.js)|Easy|\n|94|[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | [JavaScript](./algorithms/BinaryTreeInorderTraversal.js)|Medium|\n|92|[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii) | [JavaScript](./algorithms/ReverseLinkedList_II.js)|Medium|\n|88|[Merge Sorted Array](https://oj.leetcode.com/problems/merge-sorted-array/)| [JavaScript](./algorithms/MergeTwoSortedArray.js)|Easy|\n|86|[Partition List](https://leetcode.com/problems/partition-list) | [JavaScript](./algorithms/PartitionList.js)|Medium|\n|80|[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) | [JavaScript](./algorithms/RemoveDuplicatesFromSortedArray_II.js)|Medium|\n|70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [JavaScript](./algorithms/ClimbingStairs.js)|Easy|\n|69|[Sqrt(x)](https://leetcode.com/problems/sqrtx) | [JavaScript](./algorithms/SqrtX.js)|Easy|\n|67|[Add Binary](https://leetcode.com/problems/add-binary) | [JavaScript](./algorithms/AddBinary.js)|Easy|\n|66|[Plus One](https://oj.leetcode.com/problems/plus-one/)| [JavaScript](./algorithms/PlusOne.js)|Easy|\n|58|[Length of Last Word](https://oj.leetcode.com/problems/length-of-last-word/)| [JavaScript](./algorithms/LengthOfLastWord.js)|Easy|\n|56|[Merge Intervals](https://leetcode.com/problems/merge-intervals)|[JavaScript](algorithms/MergeIntervals.js)|Medium|\n|53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [JavaScript](./algorithms/MaximumSubarray.js)|Easy|\n|50|[Pow(x, n)](https://leetcode.com/problems/powx-n) | [JavaScript](./algorithms/PowXN.js)|Medium|\n|35|[Search Insert Position](https://oj.leetcode.com/problems/search-insert-position/)| [JavaScript](./algorithms/SearchInsertPosition.js)|Easy|\n|28|[Implement strStr()](https://leetcode.com/problems/implement-strstr) | [JavaScript](./algorithms/ImplementStrStr.js)|Easy|\n|27|[Remove Element](https://leetcode.com/problems/remove-element) | [JavaScript](./algorithms/RemoveElement.js)|Easy|\n|26|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | [JavaScript](./algorithms/RemoveDuplicatesFromSortedArray.js)|Easy|\n|25|[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | [JavaScript](./algorithms/ReverseNodesInK-Group.js)|Hard|\n|24|[Swap Nodes in Pairs](https://oj.leetcode.com/problems/swap-nodes-in-pairs/)| [JavaScript](./algorithms/SwapNodesInPairs.js)|Medium|\n|23|[Merge k Sorted Lists](https://oj.leetcode.com/problems/merge-k-sorted-lists/)| [JavaScript](./algorithms/MergeKSortedLists.js)|Hard|\n|22|[Generate Parentheses](https://oj.leetcode.com/problems/generate-parentheses/)| [JavaScript](./algorithms/GenerateParentheses.js)|Medium|\n|21|[Merge Two Sorted Lists](https://oj.leetcode.com/problems/merge-two-sorted-lists/)| [JavaScript](./algorithms/MergeTwoSortedList.js)|Easy|\n|20|[Valid Parentheses](https://oj.leetcode.com/problems/valid-parentheses/)| [JavaScript](./algorithms/ValidParentheses.js)|Easy|\n|19|[Remove Nth Node From End of List](https://oj.leetcode.com/problems/remove-nth-node-from-end-of-list/)| [JavaScript](./algorithms/RemoveNthNodeFromEndOfList.js)|Easy|\n|17|[Letter Combinations of a Phone Number](https://oj.leetcode.com/problems/letter-combinations-of-a-phone-number/)| [JavaScript](./algorithms/LetterCombinationsOfAPhoneNumber.js)|Medium|\n|15|[3Sum](https://leetcode.com/problems/3sum) | [JavaScript](./algorithms/3Sum.js)|Medium|\n|14|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix)|[JavaScript](algorithms/LongestCommonPrefix.js)|Easy|\n|13|[Roman to Integer](https://oj.leetcode.com/problems/roman-to-integer/)| [JavaScript](./algorithms/RomanToInteger.js)|Easy|\n|12|[Integer to Roman](https://oj.leetcode.com/problems/integer-to-roman/)| [JavaScript](./algorithms/IntegerToRoman.js)|Medium|\n|11|[Container With Most Water](https://oj.leetcode.com/problems/container-with-most-water/)| [JavaScript](./algorithms/ContainerWithMostWater.js)|Medium|\n|10|[Regular Expression Matching](https://oj.leetcode.com/problems/regular-expression-matching/)| [JavaScript](./algorithms/RegularExpressionMatching.js)|Hard|\n|9|[Palindrome Number](https://oj.leetcode.com/problems/palindrome-number/)| [JavaScript](./algorithms/PalindromeNumber.js)|Easy|\n|8|[String to Integer (atoi)](https://oj.leetcode.com/problems/string-to-integer-atoi/)| [JavaScript](./algorithms/StringToIntegerAtoi.js)|Easy|\n|7|[Reverse Integer](https://oj.leetcode.com/problems/reverse-integer/)| [JavaScript](./algorithms/ReverseInteger.js)|Easy|\n|6|[ZigZag Conversion](https://oj.leetcode.com/problems/zigzag-conversion/)| [JavaScript](./algorithms/ZigZagConversion.js)|Easy|\n|5|[Longest Palindromic Substring](https://oj.leetcode.com/problems/longest-palindromic-substring/)| [JavaScript](./algorithms/LongestPalindromicSubstring.js)|Medium|\n|4|[Median of Two Sorted Arrays](https://oj.leetcode.com/problems/median-of-two-sorted-arrays/)| [JavaScript](./algorithms/MedianOfTwoSortedArrays.js)|Hard|\n|3|[Longest Substring Without Repeating Characters](https://oj.leetcode.com/problems/longest-substring-without-repeating-characters/)| [JavaScript](./algorithms/LongestSubstringWithoutRepeatingCharacters.js)|Medium|\n|2|[Add Two Numbers](https://oj.leetcode.com/problems/add-two-numbers/)| [JavaScript](./algorithms/AddTwoNumbers.js)|Medium|\n|1|[Two Sum](https://oj.leetcode.com/problems/two-sum/)| [JavaScript](./algorithms/TwoSum.js)|Easy|\n\n\n### LeetCode Shell\n\n| # | Title | Solution | Difficulty |\n|---| ----- | -------- | ---------- |\n|195|[Tenth Line](https://leetcode.com/problems/tenth-line/)| [Shell](./shell/TenthLine.sh)|Easy|\n|193|[Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers) | [Shell](./shell/ValidPhoneNumbers.sh)|Easy|\n\n### LeetCode SQL\n\n| # | Title | Solution | Difficulty |\n|---| ----- | -------- | ---------- |\n|627|[Swap Salary](https://leetcode.com/problems/swap-salary) | [SQL](./sql/SwapSalary.sql)|Easy|\n|620|[Not Boring Movies](https://leetcode.com/problems/not-boring-movies) | [SQL](./sql/NotBoringMovies.sql)|Easy|\n|596|[Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students) | [SQL](./sql/ClassesMoreThan5Students.sql)|Easy|\n|595|[Big Countries](https://leetcode.com/problems/big-countries) | [SQL](./sql/BigCountries.sql)|Easy|\n","funding_links":[],"categories":["Javascript"],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdnshi%2FLeetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdnshi%2FLeetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdnshi%2FLeetcode/lists"}