# leetcode

**Repository Path**: elmer08/leetcode

## Basic Information

- **Project Name**: leetcode
- **Description**: LeetCode Problems' Solutions 
- **Primary Language**: C++
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2021-07-06
- **Last Updated**: 2021-07-09

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README


LeetCode
========

### LeetCode Algorithm

(Notes: "🔒" means you need to buy a book from Leetcode)


| # | Title | Solution | Difficulty |
|---| ----- | -------- | ---------- |
|1851|[Minimum Interval to Include Each Query](https://leetcode.com/problems/minimum-interval-to-include-each-query/) | [Solution](), [C++](./algorithms/cpp/minimumIntervalToIncludeEachQuery/MinimumIntervalToIncludeEachQuery.cpp), [Java](./algorithms/java/minimumIntervalToIncludeEachQuery/MinimumIntervalToIncludeEachQuery.java), [Go](./algorithms/golang/minimumIntervalToIncludeEachQuery/MinimumIntervalToIncludeEachQuery.go)|Hard|
|1850|[Minimum Adjacent Swaps to Reach the Kth Smallest Number](https://leetcode.com/problems/minimum-adjacent-swaps-to-reach-the-kth-smallest-number/) | [Solution](), [C++](./algorithms/cpp/minimumAdjacentSwapsToReachTheKthSmallestNumber/MinimumAdjacentSwapsToReachTheKthSmallestNumber.cpp), [Java](./algorithms/java/minimumAdjacentSwapsToReachTheKthSmallestNumber/MinimumAdjacentSwapsToReachTheKthSmallestNumber.java), [Go](./algorithms/golang/minimumAdjacentSwapsToReachTheKthSmallestNumber/MinimumAdjacentSwapsToReachTheKthSmallestNumber.go)|Medium|
|1849|[Splitting a String Into Descending Consecutive Values](https://leetcode.com/problems/splitting-a-string-into-descending-consecutive-values/) | [Solution](), [C++](./algorithms/cpp/splittingAStringIntoDescendingConsecutiveValues/SplittingAStringIntoDescendingConsecutiveValues.cpp), [Java](./algorithms/java/splittingAStringIntoDescendingConsecutiveValues/SplittingAStringIntoDescendingConsecutiveValues.java), [Go](./algorithms/golang/splittingAStringIntoDescendingConsecutiveValues/SplittingAStringIntoDescendingConsecutiveValues.go)|Medium|
|1848|[Minimum Distance to the Target Element](https://leetcode.com/problems/minimum-distance-to-the-target-element/) | [Solution](), [C++](./algorithms/cpp/minimumDistanceToTheTargetElement/MinimumDistanceToTheTargetElement.cpp), [Java](./algorithms/java/minimumDistanceToTheTargetElement/MinimumDistanceToTheTargetElement.java), [Go](./algorithms/golang/minimumDistanceToTheTargetElement/MinimumDistanceToTheTargetElement.go)|Easy|
|1847|[Closest Room](https://leetcode.com/problems/closest-room/) | [Solution](), [C++](./algorithms/cpp/closestRoom/ClosestRoom.cpp), [Java](./algorithms/java/closestRoom/ClosestRoom.java), [Go](./algorithms/golang/closestRoom/ClosestRoom.go)|Hard|
|1846|[Maximum Element After Decreasing and Rearranging](https://leetcode.com/problems/maximum-element-after-decreasing-and-rearranging/) | [Solution](), [C++](./algorithms/cpp/maximumElementAfterDecreasingAndRearranging/MaximumElementAfterDecreasingAndRearranging.cpp), [Java](./algorithms/java/maximumElementAfterDecreasingAndRearranging/MaximumElementAfterDecreasingAndRearranging.java), [Go](./algorithms/golang/maximumElementAfterDecreasingAndRearranging/MaximumElementAfterDecreasingAndRearranging.go)|Medium|
|1845|[Seat Reservation Manager](https://leetcode.com/problems/seat-reservation-manager/) | [Solution](), [C++](./algorithms/cpp/seatReservationManager/SeatReservationManager.cpp), [Java](./algorithms/java/seatReservationManager/SeatReservationManager.java), [Go](./algorithms/golang/seatReservationManager/SeatReservationManager.go)|Medium|
|1844|[Replace All Digits with Characters](https://leetcode.com/problems/replace-all-digits-with-characters/) | [Solution](), [C++](./algorithms/cpp/replaceAllDigitsWithCharacters/ReplaceAllDigitsWithCharacters.cpp), [Java](./algorithms/java/replaceAllDigitsWithCharacters/ReplaceAllDigitsWithCharacters.java), [Go](./algorithms/golang/replaceAllDigitsWithCharacters/ReplaceAllDigitsWithCharacters.go)|Easy|
|1840|[Maximum Building Height](https://leetcode.com/problems/maximum-building-height/) | [Solution](), [C++](./algorithms/cpp/maximumBuildingHeight/MaximumBuildingHeight.cpp), [Java](./algorithms/java/maximumBuildingHeight/MaximumBuildingHeight.java), [Go](./algorithms/golang/maximumBuildingHeight/MaximumBuildingHeight.go)|Hard|
|1839|[Longest Substring Of All Vowels in Order](https://leetcode.com/problems/longest-substring-of-all-vowels-in-order/) | [Solution](), [C++](./algorithms/cpp/longestSubstringOfAllVowelsInOrder/LongestSubstringOfAllVowelsInOrder.cpp), [Java](./algorithms/java/longestSubstringOfAllVowelsInOrder/LongestSubstringOfAllVowelsInOrder.java), [Go](./algorithms/golang/longestSubstringOfAllVowelsInOrder/LongestSubstringOfAllVowelsInOrder.go)|Medium|
|1838|[Frequency of the Most Frequent Element](https://leetcode.com/problems/frequency-of-the-most-frequent-element/) | [Solution](), [C++](./algorithms/cpp/frequencyOfTheMostFrequentElement/FrequencyOfTheMostFrequentElement.cpp), [Java](./algorithms/java/frequencyOfTheMostFrequentElement/FrequencyOfTheMostFrequentElement.java), [Go](./algorithms/golang/frequencyOfTheMostFrequentElement/FrequencyOfTheMostFrequentElement.go)|Medium|
|1837|[Sum of Digits in Base K](https://leetcode.com/problems/sum-of-digits-in-base-k/) | [Solution](), [C++](./algorithms/cpp/sumOfDigitsInBaseK/SumOfDigitsInBaseK.cpp), [Java](./algorithms/java/sumOfDigitsInBaseK/SumOfDigitsInBaseK.java), [Go](./algorithms/golang/sumOfDigitsInBaseK/SumOfDigitsInBaseK.go)|Easy|
|1835|[Find XOR Sum of All Pairs Bitwise AND](https://leetcode.com/problems/find-xor-sum-of-all-pairs-bitwise-and/) | [Solution](), [C++](./algorithms/cpp/findXorSumOfAllPairsBitwiseAnd/FindXorSumOfAllPairsBitwiseAnd.cpp), [Java](./algorithms/java/findXorSumOfAllPairsBitwiseAnd/FindXorSumOfAllPairsBitwiseAnd.java), [Go](./algorithms/golang/findXorSumOfAllPairsBitwiseAnd/FindXorSumOfAllPairsBitwiseAnd.go)|Hard|
|1834|[Single-Threaded CPU](https://leetcode.com/problems/single-threaded-cpu/) | [Solution](), [C++](./algorithms/cpp/singleThreadedCpu/SingleThreadedCpu.cpp), [Java](./algorithms/java/singleThreadedCpu/SingleThreadedCpu.java), [Go](./algorithms/golang/singleThreadedCpu/SingleThreadedCpu.go)|Medium|
|1833|[Maximum Ice Cream Bars](https://leetcode.com/problems/maximum-ice-cream-bars/) | [Solution](), [C++](./algorithms/cpp/maximumIceCreamBars/MaximumIceCreamBars.cpp), [Java](./algorithms/java/maximumIceCreamBars/MaximumIceCreamBars.java), [Go](./algorithms/golang/maximumIceCreamBars/MaximumIceCreamBars.go)|Medium|
|1832|[Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram/) | [Solution](), [C++](./algorithms/cpp/checkIfTheSentenceIsPangram/CheckIfTheSentenceIsPangram.cpp), [Java](./algorithms/java/checkIfTheSentenceIsPangram/CheckIfTheSentenceIsPangram.java), [Go](./algorithms/golang/checkIfTheSentenceIsPangram/CheckIfTheSentenceIsPangram.go)|Easy|
|1829|[Maximum XOR for Each Query](https://leetcode.com/problems/maximum-xor-for-each-query/) | [Solution](), [C++](./algorithms/cpp/maximumXorForEachQuery/MaximumXorForEachQuery.cpp), [Java](./algorithms/java/maximumXorForEachQuery/MaximumXorForEachQuery.java), [Go](./algorithms/golang/maximumXorForEachQuery/MaximumXorForEachQuery.go)|Medium|
|1828|[Queries on Number of Points Inside a Circle](https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle/) | [Solution](), [C++](./algorithms/cpp/queriesOnNumberOfPointsInsideACircle/QueriesOnNumberOfPointsInsideACircle.cpp), [Java](./algorithms/java/queriesOnNumberOfPointsInsideACircle/QueriesOnNumberOfPointsInsideACircle.java), [Go](./algorithms/golang/queriesOnNumberOfPointsInsideACircle/QueriesOnNumberOfPointsInsideACircle.go)|Medium|
|1827|[Minimum Operations to Make the Array Increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/) | [Solution](), [C++](./algorithms/cpp/minimumOperationsToMakeTheArrayIncreasing/MinimumOperationsToMakeTheArrayIncreasing.cpp), [Java](./algorithms/java/minimumOperationsToMakeTheArrayIncreasing/MinimumOperationsToMakeTheArrayIncreasing.java), [Go](./algorithms/golang/minimumOperationsToMakeTheArrayIncreasing/MinimumOperationsToMakeTheArrayIncreasing.go)|Easy|
|1825|[Finding MK Average](https://leetcode.com/problems/finding-mk-average/) | [Solution](), [C++](./algorithms/cpp/findingMkAverage/FindingMkAverage.cpp), [Java](./algorithms/java/findingMkAverage/FindingMkAverage.java), [Go](./algorithms/golang/findingMkAverage/FindingMkAverage.go)|Hard|
|1824|[Minimum Sideway Jumps](https://leetcode.com/problems/minimum-sideway-jumps/) | [Solution](), [C++](./algorithms/cpp/minimumSidewayJumps/MinimumSidewayJumps.cpp), [Java](./algorithms/java/minimumSidewayJumps/MinimumSidewayJumps.java), [Go](./algorithms/golang/minimumSidewayJumps/MinimumSidewayJumps.go)|Medium|
|1823|[Find the Winner of the Circular Game](https://leetcode.com/problems/find-the-winner-of-the-circular-game/) | [Solution](), [C++](./algorithms/cpp/findTheWinnerOfTheCircularGame/FindTheWinnerOfTheCircularGame.cpp), [Java](./algorithms/java/findTheWinnerOfTheCircularGame/FindTheWinnerOfTheCircularGame.java), [Go](./algorithms/golang/findTheWinnerOfTheCircularGame/FindTheWinnerOfTheCircularGame.go)|Medium|
|1822|[Sign of the Product of an Array](https://leetcode.com/problems/sign-of-the-product-of-an-array/) | [Solution](), [C++](./algorithms/cpp/signOfTheProductOfAnArray/SignOfTheProductOfAnArray.cpp), [Java](./algorithms/java/signOfTheProductOfAnArray/SignOfTheProductOfAnArray.java), [Go](./algorithms/golang/signOfTheProductOfAnArray/SignOfTheProductOfAnArray.go)|Easy|
|1819|[Number of Different Subsequences GCDs](https://leetcode.com/problems/number-of-different-subsequences-gcds/) | [Solution](), [C++](./algorithms/cpp/numberOfDifferentSubsequencesGcds/NumberOfDifferentSubsequencesGcds.cpp), [Java](./algorithms/java/numberOfDifferentSubsequencesGcds/NumberOfDifferentSubsequencesGcds.java), [Go](./algorithms/golang/numberOfDifferentSubsequencesGcds/NumberOfDifferentSubsequencesGcds.go)|Hard|
|1818|[Minimum Absolute Sum Difference](https://leetcode.com/problems/minimum-absolute-sum-difference/) | [Solution](), [C++](./algorithms/cpp/minimumAbsoluteSumDifference/MinimumAbsoluteSumDifference.cpp), [Java](./algorithms/java/minimumAbsoluteSumDifference/MinimumAbsoluteSumDifference.java), [Go](./algorithms/golang/minimumAbsoluteSumDifference/MinimumAbsoluteSumDifference.go)|Medium|
|1817|[Finding the Users Active Minutes](https://leetcode.com/problems/finding-the-users-active-minutes/) | [Solution](), [C++](./algorithms/cpp/findingTheUsersActiveMinutes/FindingTheUsersActiveMinutes.cpp), [Java](./algorithms/java/findingTheUsersActiveMinutes/FindingTheUsersActiveMinutes.java), [Go](./algorithms/golang/findingTheUsersActiveMinutes/FindingTheUsersActiveMinutes.go)|Medium|
|1816|[Truncate Sentence](https://leetcode.com/problems/truncate-sentence/) | [Solution](), [C++](./algorithms/cpp/truncateSentence/TruncateSentence.cpp), [Java](./algorithms/java/truncateSentence/TruncateSentence.java), [Go](./algorithms/golang/truncateSentence/TruncateSentence.go)|Easy|
|1815|[Maximum Number of Groups Getting Fresh Donuts](https://leetcode.com/problems/maximum-number-of-groups-getting-fresh-donuts/) | [Solution](), [C++](./algorithms/cpp/maximumNumberOfGroupsGettingFreshDonuts/MaximumNumberOfGroupsGettingFreshDonuts.cpp), [Java](./algorithms/java/maximumNumberOfGroupsGettingFreshDonuts/MaximumNumberOfGroupsGettingFreshDonuts.java), [Go](./algorithms/golang/maximumNumberOfGroupsGettingFreshDonuts/MaximumNumberOfGroupsGettingFreshDonuts.go)|Hard|
|1814|[Count Nice Pairs in an Array](https://leetcode.com/problems/count-nice-pairs-in-an-array/) | [Solution](), [C++](./algorithms/cpp/countNicePairsInAnArray/CountNicePairsInAnArray.cpp), [Java](./algorithms/java/countNicePairsInAnArray/CountNicePairsInAnArray.java), [Go](./algorithms/golang/countNicePairsInAnArray/CountNicePairsInAnArray.go)|Medium|
|1813|[Sentence Similarity III](https://leetcode.com/problems/sentence-similarity-iii/) | [Solution](), [C++](./algorithms/cpp/sentenceSimilarity/SentenceSimilarity.III.cpp), [Java](./algorithms/java/sentenceSimilarity/SentenceSimilarity.III.java), [Go](./algorithms/golang/sentenceSimilarity/SentenceSimilarity.III.go)|Medium|
|1812|[Determine Color of a Chessboard Square](https://leetcode.com/problems/determine-color-of-a-chessboard-square/) | [Solution](), [C++](./algorithms/cpp/determineColorOfAChessboardSquare/DetermineColorOfAChessboardSquare.cpp), [Java](./algorithms/java/determineColorOfAChessboardSquare/DetermineColorOfAChessboardSquare.java), [Go](./algorithms/golang/determineColorOfAChessboardSquare/DetermineColorOfAChessboardSquare.go)|Easy|
|1808|[Maximize Number of Nice Divisors](https://leetcode.com/problems/maximize-number-of-nice-divisors/) | [Solution](), [C++](./algorithms/cpp/maximizeNumberOfNiceDivisors/MaximizeNumberOfNiceDivisors.cpp), [Java](./algorithms/java/maximizeNumberOfNiceDivisors/MaximizeNumberOfNiceDivisors.java), [Go](./algorithms/golang/maximizeNumberOfNiceDivisors/MaximizeNumberOfNiceDivisors.go)|Hard|
|1807|[Evaluate the Bracket Pairs of a String](https://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string/) | [Solution](), [C++](./algorithms/cpp/evaluateTheBracketPairsOfAString/EvaluateTheBracketPairsOfAString.cpp), [Java](./algorithms/java/evaluateTheBracketPairsOfAString/EvaluateTheBracketPairsOfAString.java), [Go](./algorithms/golang/evaluateTheBracketPairsOfAString/EvaluateTheBracketPairsOfAString.go)|Medium|
|1806|[Minimum Number of Operations to Reinitialize a Permutation](https://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation/) | [Solution](), [C++](./algorithms/cpp/minimumNumberOfOperationsToReinitializeAPermutation/MinimumNumberOfOperationsToReinitializeAPermutation.cpp), [Java](./algorithms/java/minimumNumberOfOperationsToReinitializeAPermutation/MinimumNumberOfOperationsToReinitializeAPermutation.java), [Go](./algorithms/golang/minimumNumberOfOperationsToReinitializeAPermutation/MinimumNumberOfOperationsToReinitializeAPermutation.go)|Medium|
|1805|[Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string/) | [Solution](), [C++](./algorithms/cpp/numberOfDifferentIntegersInAString/NumberOfDifferentIntegersInAString.cpp), [Java](./algorithms/java/numberOfDifferentIntegersInAString/NumberOfDifferentIntegersInAString.java), [Go](./algorithms/golang/numberOfDifferentIntegersInAString/NumberOfDifferentIntegersInAString.go)|Easy|
|1803|[Count Pairs With XOR in a Range](https://leetcode.com/problems/count-pairs-with-xor-in-a-range/) | [Solution](), [C++](./algorithms/cpp/countPairsWithXorInARange/CountPairsWithXorInARange.cpp), [Java](./algorithms/java/countPairsWithXorInARange/CountPairsWithXorInARange.java), [Go](./algorithms/golang/countPairsWithXorInARange/CountPairsWithXorInARange.go)|Hard|
|1802|[Maximum Value at a Given Index in a Bounded Array](https://leetcode.com/problems/maximum-value-at-a-given-index-in-a-bounded-array/) | [Solution](), [C++](./algorithms/cpp/maximumValueAtAGivenIndexInABoundedArray/MaximumValueAtAGivenIndexInABoundedArray.cpp), [Java](./algorithms/java/maximumValueAtAGivenIndexInABoundedArray/MaximumValueAtAGivenIndexInABoundedArray.java), [Go](./algorithms/golang/maximumValueAtAGivenIndexInABoundedArray/MaximumValueAtAGivenIndexInABoundedArray.go)|Medium|
|1801|[Number of Orders in the Backlog](https://leetcode.com/problems/number-of-orders-in-the-backlog/) | [Solution](), [C++](./algorithms/cpp/numberOfOrdersInTheBacklog/NumberOfOrdersInTheBacklog.cpp), [Java](./algorithms/java/numberOfOrdersInTheBacklog/NumberOfOrdersInTheBacklog.java), [Go](./algorithms/golang/numberOfOrdersInTheBacklog/NumberOfOrdersInTheBacklog.go)|Medium|
|1800|[Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/) | [Solution](), [C++](./algorithms/cpp/maximumAscendingSubarraySum/MaximumAscendingSubarraySum.cpp), [Java](./algorithms/java/maximumAscendingSubarraySum/MaximumAscendingSubarraySum.java), [Go](./algorithms/golang/maximumAscendingSubarraySum/MaximumAscendingSubarraySum.go)|Easy|
|1799|[Maximize Score After N Operations](https://leetcode.com/problems/maximize-score-after-n-operations/submissions/) | [Solution](), [C++](./algorithms/cpp/maximizeScoreAfterNOperations/MaximizeScoreAfterNOperations.cpp), [Java](./algorithms/java/maximizeScoreAfterNOperations/MaximizeScoreAfterNOperations.java), [Go](./algorithms/golang/maximizeScoreAfterNOperations/MaximizeScoreAfterNOperations.go)|Hard|
|1798|[Maximum Number of Consecutive Values You Can Make](https://leetcode.com/problems/maximum-number-of-consecutive-values-you-can-make/submissions/) | [Solution](), [C++](./algorithms/cpp/maximumNumberOfConsecutiveValuesYouCanMake/MaximumNumberOfConsecutiveValuesYouCanMake.cpp), [Java](./algorithms/java/maximumNumberOfConsecutiveValuesYouCanMake/MaximumNumberOfConsecutiveValuesYouCanMake.java), [Go](./algorithms/golang/maximumNumberOfConsecutiveValuesYouCanMake/MaximumNumberOfConsecutiveValuesYouCanMake.go)|Medium|
|1797|[Design Authentication Manager](https://leetcode.com/problems/design-authentication-manager/) | [Solution](), [C++](./algorithms/cpp/designAuthenticationManager/DesignAuthenticationManager.cpp), [Java](./algorithms/java/designAuthenticationManager/DesignAuthenticationManager.java), [Go](./algorithms/golang/designAuthenticationManager/DesignAuthenticationManager.go)|Medium|
|1796|[Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string/) | [Solution](), [C++](./algorithms/cpp/secondLargestDigitInAString/SecondLargestDigitInAString.cpp), [Java](./algorithms/java/secondLargestDigitInAString/SecondLargestDigitInAString.java), [Go](./algorithms/golang/secondLargestDigitInAString/SecondLargestDigitInAString.go)|Easy|
|1793|[Maximum Score of a Good Subarray](https://leetcode.com/problems/maximum-score-of-a-good-subarray/) | [Solution](), [C++](./algorithms/cpp/maximumScoreOfAGoodSubarray/MaximumScoreOfAGoodSubarray.cpp), [Java](./algorithms/java/maximumScoreOfAGoodSubarray/MaximumScoreOfAGoodSubarray.java), [Go](./algorithms/golang/maximumScoreOfAGoodSubarray/MaximumScoreOfAGoodSubarray.go)|Hard|
|1792|[Maximum Average Pass Ratio](https://leetcode.com/problems/maximum-average-pass-ratio/) | [Solution](), [C++](./algorithms/cpp/maximumAveragePassRatio/MaximumAveragePassRatio.cpp), [Java](./algorithms/java/maximumAveragePassRatio/MaximumAveragePassRatio.java), [Go](./algorithms/golang/maximumAveragePassRatio/MaximumAveragePassRatio.go)|Medium|
|1791|[Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph/) | [Solution](), [C++](./algorithms/cpp/findCenterOfStarGraph/FindCenterOfStarGraph.cpp), [Java](./algorithms/java/findCenterOfStarGraph/FindCenterOfStarGraph.java), [Go](./algorithms/golang/findCenterOfStarGraph/FindCenterOfStarGraph.go)|Medium|
|1790|[Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/) | [Solution](), [C++](./algorithms/cpp/checkIfOneStringSwapCanMakeStringsEqual/CheckIfOneStringSwapCanMakeStringsEqual.cpp), [Java](./algorithms/java/checkIfOneStringSwapCanMakeStringsEqual/CheckIfOneStringSwapCanMakeStringsEqual.java), [Go](./algorithms/golang/checkIfOneStringSwapCanMakeStringsEqual/CheckIfOneStringSwapCanMakeStringsEqual.go)|Easy|
|1787|[Make the XOR of All Segments Equal to Zero](https://leetcode.com/problems/make-the-xor-of-all-segments-equal-to-zero/) | [Solution](), [C++](./algorithms/cpp/makeTheXorOfAllSegmentsEqualToZero/MakeTheXorOfAllSegmentsEqualToZero.cpp), [Java](./algorithms/java/makeTheXorOfAllSegmentsEqualToZero/MakeTheXorOfAllSegmentsEqualToZero.java), [Go](./algorithms/golang/makeTheXorOfAllSegmentsEqualToZero/MakeTheXorOfAllSegmentsEqualToZero.go)|Hard|
|1786|[Number of Restricted Paths From First to Last Node](https://leetcode.com/problems/number-of-restricted-paths-from-first-to-last-node/) | [Solution](), [C++](./algorithms/cpp/numberOfRestrictedPathsFromFirstToLastNode/NumberOfRestrictedPathsFromFirstToLastNode.cpp), [Java](./algorithms/java/numberOfRestrictedPathsFromFirstToLastNode/NumberOfRestrictedPathsFromFirstToLastNode.java), [Go](./algorithms/golang/numberOfRestrictedPathsFromFirstToLastNode/NumberOfRestrictedPathsFromFirstToLastNode.go)|Medium|
|1785|[Minimum Elements to Add to Form a Given Sum](https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/) | [Solution](), [C++](./algorithms/cpp/minimumElementsToAddToFormAGivenSum/MinimumElementsToAddToFormAGivenSum.cpp), [Java](./algorithms/java/minimumElementsToAddToFormAGivenSum/MinimumElementsToAddToFormAGivenSum.java), [Go](./algorithms/golang/minimumElementsToAddToFormAGivenSum/MinimumElementsToAddToFormAGivenSum.go)|Medium|
|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/) | [Solution](), [C++](./algorithms/cpp/checkIfBinaryStringHasAtMostOneSegmentOfOnes/CheckIfBinaryStringHasAtMostOneSegmentOfOnes.cpp), [Java](./algorithms/java/checkIfBinaryStringHasAtMostOneSegmentOfOnes/CheckIfBinaryStringHasAtMostOneSegmentOfOnes.java), [Go](./algorithms/golang/checkIfBinaryStringHasAtMostOneSegmentOfOnes/CheckIfBinaryStringHasAtMostOneSegmentOfOnes.go)|Easy|
|1782|[Count Pairs Of Nodes](https://leetcode.com/problems/count-pairs-of-nodes/) | [Solution](), [C++](./algorithms/cpp/countPairsOfNodes/CountPairsOfNodes.cpp), [Java](./algorithms/java/countPairsOfNodes/CountPairsOfNodes.java), [Go](./algorithms/golang/countPairsOfNodes/CountPairsOfNodes.go)|Hard|
|1781|[Sum of Beauty of All Substrings](https://leetcode.com/problems/sum-of-beauty-of-all-substrings/) | [Solution](), [C++](./algorithms/cpp/sumOfBeautyOfAllSubstrings/SumOfBeautyOfAllSubstrings.cpp), [Java](./algorithms/java/sumOfBeautyOfAllSubstrings/SumOfBeautyOfAllSubstrings.java), [Go](./algorithms/golang/sumOfBeautyOfAllSubstrings/SumOfBeautyOfAllSubstrings.go)|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/) | [Solution](), [C++](./algorithms/cpp/checkIfNumberIsASumOfPowersOfThree/CheckIfNumberIsASumOfPowersOfThree.cpp), [Java](./algorithms/java/checkIfNumberIsASumOfPowersOfThree/CheckIfNumberIsASumOfPowersOfThree.java), [Go](./algorithms/golang/checkIfNumberIsASumOfPowersOfThree/CheckIfNumberIsASumOfPowersOfThree.go)|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/) | [Solution](), [C++](./algorithms/cpp/findNearestPointThatHasTheSameXOrYCoordinate/FindNearestPointThatHasTheSameXOrYCoordinate.cpp), [Java](./algorithms/java/findNearestPointThatHasTheSameXOrYCoordinate/FindNearestPointThatHasTheSameXOrYCoordinate.java), [Go](./algorithms/golang/findNearestPointThatHasTheSameXOrYCoordinate/FindNearestPointThatHasTheSameXOrYCoordinate.go)|Easy|
|1775|[Equal Sum Arrays With Minimum Number of Operations](https://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations/) | [Solution](), [C++](./algorithms/cpp/equalSumArraysWithMinimumNumberOfOperations/EqualSumArraysWithMinimumNumberOfOperations.cpp), [Java](./algorithms/java/equalSumArraysWithMinimumNumberOfOperations/EqualSumArraysWithMinimumNumberOfOperations.java), [Go](./algorithms/golang/equalSumArraysWithMinimumNumberOfOperations/EqualSumArraysWithMinimumNumberOfOperations.go)|Medium|
|1774|[Closest Dessert Cost](https://leetcode.com/problems/closest-dessert-cost/) | [Solution](), [C++](./algorithms/cpp/closestDessertCost/ClosestDessertCost.cpp), [Java](./algorithms/java/closestDessertCost/ClosestDessertCost.java), [Go](./algorithms/golang/closestDessertCost/ClosestDessertCost.go)|Medium|
|1773|[Count Items Matching a Rule](https://leetcode.com/problems/count-items-matching-a-rule/) | [Solution](), [C++](./algorithms/cpp/countItemsMatchingARule/CountItemsMatchingARule.cpp), [Java](./algorithms/java/countItemsMatchingARule/CountItemsMatchingARule.java), [Go](./algorithms/golang/countItemsMatchingARule/CountItemsMatchingARule.go)|Easy|
|1771|[Maximize Palindrome Length From Subsequences](https://leetcode.com/problems/maximize-palindrome-length-from-subsequences/) | [Solution](), [C++](./algorithms/cpp/maximizePalindromeLengthFromSubsequences/MaximizePalindromeLengthFromSubsequences.cpp), [Java](./algorithms/java/maximizePalindromeLengthFromSubsequences/MaximizePalindromeLengthFromSubsequences.java), [Go](./algorithms/golang/maximizePalindromeLengthFromSubsequences/MaximizePalindromeLengthFromSubsequences.go)|Hard|
|1770|[Maximum Score from Performing Multiplication Operations](https://leetcode.com/problems/maximum-score-from-performing-multiplication-operations/) | [Solution](), [C++](./algorithms/cpp/maximumScoreFromPerformingMultiplicationOperations/MaximumScoreFromPerformingMultiplicationOperations.cpp), [Java](./algorithms/java/maximumScoreFromPerformingMultiplicationOperations/MaximumScoreFromPerformingMultiplicationOperations.java), [Go](./algorithms/golang/maximumScoreFromPerformingMultiplicationOperations/MaximumScoreFromPerformingMultiplicationOperations.go)|Medium|
|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/) | [Solution](), [C++](./algorithms/cpp/minimumNumberOfOperationsToMoveAllBallsToEachBox/MinimumNumberOfOperationsToMoveAllBallsToEachBox.cpp), [Java](./algorithms/java/minimumNumberOfOperationsToMoveAllBallsToEachBox/MinimumNumberOfOperationsToMoveAllBallsToEachBox.java), [Go](./algorithms/golang/minimumNumberOfOperationsToMoveAllBallsToEachBox/MinimumNumberOfOperationsToMoveAllBallsToEachBox.go)|Medium|
|1768|[Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/) | [Solution](), [C++](./algorithms/cpp/mergeStringsAlternately/MergeStringsAlternately.cpp), [Java](./algorithms/java/mergeStringsAlternately/MergeStringsAlternately.java), [Go](./algorithms/golang/mergeStringsAlternately/MergeStringsAlternately.go)|Easy|
|1766|[Tree of Coprimes](https://leetcode.com/problems/tree-of-coprimes/) | [Solution](), [C++](./algorithms/cpp/treeOfCoprimes/TreeOfCoprimes.cpp), [Java](./algorithms/java/treeOfCoprimes/TreeOfCoprimes.java), [Go](./algorithms/golang/treeOfCoprimes/TreeOfCoprimes.go)|Hard|
|1765|[Map of Highest Peak](https://leetcode.com/problems/map-of-highest-peak/) | [Solution](), [C++](./algorithms/cpp/mapOfHighestPeak/MapOfHighestPeak.cpp), [Java](./algorithms/java/mapOfHighestPeak/MapOfHighestPeak.java), [Go](./algorithms/golang/mapOfHighestPeak/MapOfHighestPeak.go)|Medium|
|1764|[Form Array by Concatenating Subarrays of Another Array](https://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array/) | [Solution](), [C++](./algorithms/cpp/formArrayByConcatenatingSubarraysOfAnotherArray/FormArrayByConcatenatingSubarraysOfAnotherArray.cpp), [Java](./algorithms/java/formArrayByConcatenatingSubarraysOfAnotherArray/FormArrayByConcatenatingSubarraysOfAnotherArray.java), [Go](./algorithms/golang/formArrayByConcatenatingSubarraysOfAnotherArray/FormArrayByConcatenatingSubarraysOfAnotherArray.go)|Medium|
|1763|[Longest Nice Substring](https://leetcode.com/problems/longest-nice-substring/) | [Solution](), [C++](./algorithms/cpp/longestNiceSubstring/LongestNiceSubstring.cpp), [Java](./algorithms/java/longestNiceSubstring/LongestNiceSubstring.java), [Go](./algorithms/golang/longestNiceSubstring/LongestNiceSubstring.go)|Easy|
|1761|[Minimum Degree of a Connected Trio in a Graph](https://leetcode.com/problems/minimum-degree-of-a-connected-trio-in-a-graph/) | [Solution](), [C++](./algorithms/cpp/minimumDegreeOfAConnectedTrioInAGraph/MinimumDegreeOfAConnectedTrioInAGraph.cpp), [Java](./algorithms/java/minimumDegreeOfAConnectedTrioInAGraph/MinimumDegreeOfAConnectedTrioInAGraph.java), [Go](./algorithms/golang/minimumDegreeOfAConnectedTrioInAGraph/MinimumDegreeOfAConnectedTrioInAGraph.go)|Hard|
|1760|[Minimum Limit of Balls in a Bag](https://leetcode.com/problems/minimum-limit-of-balls-in-a-bag/) | [Solution](), [C++](./algorithms/cpp/minimumLimitOfBallsInABag/MinimumLimitOfBallsInABag.cpp), [Java](./algorithms/java/minimumLimitOfBallsInABag/MinimumLimitOfBallsInABag.java), [Go](./algorithms/golang/minimumLimitOfBallsInABag/MinimumLimitOfBallsInABag.go)|Medium|
|1759|[Count Number of Homogenous Substrings](https://leetcode.com/problems/count-number-of-homogenous-substrings/) | [Solution](), [C++](./algorithms/cpp/countNumberOfHomogenousSubstrings/CountNumberOfHomogenousSubstrings.cpp), [Java](./algorithms/java/countNumberOfHomogenousSubstrings/CountNumberOfHomogenousSubstrings.java), [Go](./algorithms/golang/countNumberOfHomogenousSubstrings/CountNumberOfHomogenousSubstrings.go)|Medium|
|1758|[Minimum Changes To Make Alternating Binary String](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/) | [Solution](), [C++](./algorithms/cpp/minimumChangesToMakeAlternatingBinaryString/MinimumChangesToMakeAlternatingBinaryString.cpp), [Java](./algorithms/java/minimumChangesToMakeAlternatingBinaryString/MinimumChangesToMakeAlternatingBinaryString.java), [Go](./algorithms/golang/minimumChangesToMakeAlternatingBinaryString/MinimumChangesToMakeAlternatingBinaryString.go)|Easy|
|1755|[Closest Subsequence Sum](https://leetcode.com/problems/closest-subsequence-sum/) | [Solution](), [C++](./algorithms/cpp/closestSubsequenceSum/ClosestSubsequenceSum.cpp), [Java](./algorithms/java/closestSubsequenceSum/ClosestSubsequenceSum.java), [Go](./algorithms/golang/closestSubsequenceSum/ClosestSubsequenceSum.go)|Hard|
|1754|[Largest Merge Of Two Strings](https://leetcode.com/problems/largest-merge-of-two-strings/) | [Solution](), [C++](./algorithms/cpp/largestMergeOfTwoStrings/LargestMergeOfTwoStrings.cpp), [Java](./algorithms/java/largestMergeOfTwoStrings/LargestMergeOfTwoStrings.java), [Go](./algorithms/golang/largestMergeOfTwoStrings/LargestMergeOfTwoStrings.go)|Medium|
|1753|[Maximum Score From Removing Stones](https://leetcode.com/problems/maximum-score-from-removing-stones/) | [Solution](), [C++](./algorithms/cpp/maximumScoreFromRemovingStones/MaximumScoreFromRemovingStones.cpp), [Java](./algorithms/java/maximumScoreFromRemovingStones/MaximumScoreFromRemovingStones.java), [Go](./algorithms/golang/maximumScoreFromRemovingStones/MaximumScoreFromRemovingStones.go)|Medium|
|1752|[Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/) | [Solution](), [C++](./algorithms/cpp/checkIfArrayIsSortedAndRotated/CheckIfArrayIsSortedAndRotated.cpp), [Java](./algorithms/java/checkIfArrayIsSortedAndRotated/CheckIfArrayIsSortedAndRotated.java), [Go](./algorithms/golang/checkIfArrayIsSortedAndRotated/CheckIfArrayIsSortedAndRotated.go)|Easy|
|1751|[Maximum Number of Events That Can Be Attended II](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended-ii/) | [Solution](), [C++](./algorithms/cpp/maximumNumberOfEventsThatCanBeAttended/MaximumNumberOfEventsThatCanBeAttended.II.cpp), [Java](./algorithms/java/maximumNumberOfEventsThatCanBeAttended/MaximumNumberOfEventsThatCanBeAttended.II.java), [Go](./algorithms/golang/maximumNumberOfEventsThatCanBeAttended/MaximumNumberOfEventsThatCanBeAttended.II.go)|Hard|
|1750|[Minimum Length of String After Deleting Similar Ends](https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/) | [Solution](), [C++](./algorithms/cpp/minimumLengthOfStringAfterDeletingSimilarEnds/MinimumLengthOfStringAfterDeletingSimilarEnds.cpp), [Java](./algorithms/java/minimumLengthOfStringAfterDeletingSimilarEnds/MinimumLengthOfStringAfterDeletingSimilarEnds.java), [Go](./algorithms/golang/minimumLengthOfStringAfterDeletingSimilarEnds/MinimumLengthOfStringAfterDeletingSimilarEnds.go)|Medium|
|1749|[Maximum Absolute Sum of Any Subarray](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/) | [Solution](), [C++](./algorithms/cpp/maximumAbsoluteSumOfAnySubarray/MaximumAbsoluteSumOfAnySubarray.cpp), [Java](./algorithms/java/maximumAbsoluteSumOfAnySubarray/MaximumAbsoluteSumOfAnySubarray.java), [Go](./algorithms/golang/maximumAbsoluteSumOfAnySubarray/MaximumAbsoluteSumOfAnySubarray.go)|Medium|
|1748|[Sum of Unique Elements](https://leetcode.com/problems/sum-of-unique-elements/) | [Solution](), [C++](./algorithms/cpp/sumOfUniqueElements/SumOfUniqueElements.cpp), [Java](./algorithms/java/sumOfUniqueElements/SumOfUniqueElements.java), [Go](./algorithms/golang/sumOfUniqueElements/SumOfUniqueElements.go)|Easy|
|1743|[Restore the Array From Adjacent Pairs](https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/) | [Solution](), [C++](./algorithms/cpp/restoreTheArrayFromAdjacentPairs/RestoreTheArrayFromAdjacentPairs.cpp), [Java](./algorithms/java/restoreTheArrayFromAdjacentPairs/RestoreTheArrayFromAdjacentPairs.java), [Go](./algorithms/golang/restoreTheArrayFromAdjacentPairs/RestoreTheArrayFromAdjacentPairs.go)|Medium|
|1742|[Maximum Number of Balls in a Box](https://leetcode.com/problems/maximum-number-of-balls-in-a-box/) | [Solution](), [C++](./algorithms/cpp/maximumNumberOfBallsInABox/MaximumNumberOfBallsInABox.cpp), [Java](./algorithms/java/maximumNumberOfBallsInABox/MaximumNumberOfBallsInABox.java), [Go](./algorithms/golang/maximumNumberOfBallsInABox/MaximumNumberOfBallsInABox.go)|Easy|
|1739|[Building Boxes](https://leetcode.com/problems/building-boxes/) | [Solution](), [C++](./algorithms/cpp/buildingBoxes/BuildingBoxes.cpp), [Java](./algorithms/java/buildingBoxes/BuildingBoxes.java), [Go](./algorithms/golang/buildingBoxes/BuildingBoxes.go)|Hard|
|1738|[Find Kth Largest XOR Coordinate Value](https://leetcode.com/problems/find-kth-largest-xor-coordinate-value/) | [Solution](), [C++](./algorithms/cpp/findKthLargestXorCoordinateValue/FindKthLargestXorCoordinateValue.cpp), [Java](./algorithms/java/findKthLargestXorCoordinateValue/FindKthLargestXorCoordinateValue.java), [Go](./algorithms/golang/findKthLargestXorCoordinateValue/FindKthLargestXorCoordinateValue.go)|Medium|
|1736|[Latest Time by Replacing Hidden Digits](https://leetcode.com/problems/latest-time-by-replacing-hidden-digits/) | [Solution](), [C++](./algorithms/cpp/latestTimeByReplacingHiddenDigits/LatestTimeByReplacingHiddenDigits.cpp), [Java](./algorithms/java/latestTimeByReplacingHiddenDigits/LatestTimeByReplacingHiddenDigits.java), [Go](./algorithms/golang/latestTimeByReplacingHiddenDigits/LatestTimeByReplacingHiddenDigits.go)|Easy|
|1734|[Decode XORed Permutation](https://leetcode.com/problems/decode-xored-permutation/) | [Solution](), [C++](./algorithms/cpp/decodeXORedPermutation/DecodeXoredPermutation.cpp), [Java](./algorithms/java/decodeXORedPermutation/DecodeXoredPermutation.java), [Go](./algorithms/golang/decodeXORedPermutation/DecodeXoredPermutation.go)|Medium|
|1733|[Minimum Number of People to Teach](https://leetcode.com/problems/minimum-number-of-people-to-teach/) | [Solution](), [C++](./algorithms/cpp/minimumNumberOfPeopleToTeach/MinimumNumberOfPeopleToTeach.cpp), [Java](./algorithms/java/minimumNumberOfPeopleToTeach/MinimumNumberOfPeopleToTeach.java), [Go](./algorithms/golang/minimumNumberOfPeopleToTeach/MinimumNumberOfPeopleToTeach.go)|Medium|
|1732|[Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude/) | [Solution](), [C++](./algorithms/cpp/findTheHighestAltitude/FindTheHighestAltitude.cpp), [Java](./algorithms/java/findTheHighestAltitude/FindTheHighestAltitude.java), [Go](./algorithms/golang/findTheHighestAltitude/FindTheHighestAltitude.go)|Easy|
|1727|[Largest Submatrix With Rearrangements](https://leetcode.com/problems/largest-submatrix-with-rearrangements/) | [Solution](), [C++](./algorithms/cpp/largestSubmatrixWithRearrangements/LargestSubmatrixWithRearrangements.cpp), [Java](./algorithms/java/largestSubmatrixWithRearrangements/LargestSubmatrixWithRearrangements.java), [Go](./algorithms/golang/largestSubmatrixWithRearrangements/LargestSubmatrixWithRearrangements.go)|Medium|
|1726|[Tuple with Same Product](https://leetcode.com/problems/tuple-with-same-product/) | [Solution](), [C++](./algorithms/cpp/tupleWithSameProduct/TupleWithSameProduct.cpp), [Java](./algorithms/java/tupleWithSameProduct/TupleWithSameProduct.java), [Go](./algorithms/golang/tupleWithSameProduct/TupleWithSameProduct.go)|Medium|
|1725|[Number Of Rectangles That Can Form The Largest Square](https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/) | [Solution](), [C++](./algorithms/cpp/numberOfRectanglesThatCanFormTheLargestSquare/NumberOfRectanglesThatCanFormTheLargestSquare.cpp), [Java](./algorithms/java/numberOfRectanglesThatCanFormTheLargestSquare/NumberOfRectanglesThatCanFormTheLargestSquare.java), [Go](./algorithms/golang/numberOfRectanglesThatCanFormTheLargestSquare/NumberOfRectanglesThatCanFormTheLargestSquare.go)|Easy|
|1718|[Construct the Lexicographically Largest Valid Sequence](https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/) | [Solution](), [C++](./algorithms/cpp/constructTheLexicographicallyLargestValidSequence/ConstructTheLexicographicallyLargestValidSequence.cpp), [Java](./algorithms/java/constructTheLexicographicallyLargestValidSequence/ConstructTheLexicographicallyLargestValidSequence.java), [Go](./algorithms/golang/constructTheLexicographicallyLargestValidSequence/ConstructTheLexicographicallyLargestValidSequence.go)|Medium|
|1717|[Maximum Score From Removing Substrings](https://leetcode.com/problems/maximum-score-from-removing-substrings/) | [Solution](), [C++](./algorithms/cpp/maximumScoreFromRemovingSubstrings/MaximumScoreFromRemovingSubstrings.cpp), [Java](./algorithms/java/maximumScoreFromRemovingSubstrings/MaximumScoreFromRemovingSubstrings.java), [Go](./algorithms/golang/maximumScoreFromRemovingSubstrings/MaximumScoreFromRemovingSubstrings.go)|Medium|
|1716|[Calculate Money in Leetcode Bank](https://leetcode.com/problems/calculate-money-in-leetcode-bank/) | [Solution](), [C++](./algorithms/cpp/calculateMoneyInLeetcodeBank/CalculateMoneyInLeetcodeBank.cpp), [Java](./algorithms/java/calculateMoneyInLeetcodeBank/CalculateMoneyInLeetcodeBank.java), [Go](./algorithms/golang/calculateMoneyInLeetcodeBank/CalculateMoneyInLeetcodeBank.go)|Easy|
|1711|[Count Good Meals](https://leetcode.com/problems/count-good-meals/) | [Solution](), [C++](./algorithms/cpp/countGoodMeals/CountGoodMeals.cpp), [Java](./algorithms/java/countGoodMeals/CountGoodMeals.java), [Go](./algorithms/golang/countGoodMeals/CountGoodMeals.go)|Medium|
|1710|[Maximum Units on a Truck](https://leetcode.com/problems/maximum-units-on-a-truck/) | [Solution](), [C++](./algorithms/cpp/maximumUnitsOnATruck/MaximumUnitsOnATruck.cpp), [Java](./algorithms/java/maximumUnitsOnATruck/MaximumUnitsOnATruck.java), [Go](./algorithms/golang/maximumUnitsOnATruck/MaximumUnitsOnATruck.go)|Easy|
|1625|[Lexicographically Smallest String After Applying Operations](https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/) | [Solution](), [C++](./algorithms/cpp/lexicographicallySmallestStringAfterApplyingOperations/LexicographicallySmallestStringAfterApplyingOperations.cpp), [Java](./algorithms/java/lexicographicallySmallestStringAfterApplyingOperations/LexicographicallySmallestStringAfterApplyingOperations.java), [Go](./algorithms/golang/lexicographicallySmallestStringAfterApplyingOperations/LexicographicallySmallestStringAfterApplyingOperations.go)|Medium|
|1624|[Largest Substring Between Two Equal Characters](https://leetcode.com/problems/largest-substring-between-two-equal-characters/) | [Solution](), [C++](./algorithms/cpp/largestSubstringBetweenTwoEqualCharacters/LargestSubstringBetweenTwoEqualCharacters.cpp), [Java](./algorithms/java/largestSubstringBetweenTwoEqualCharacters/LargestSubstringBetweenTwoEqualCharacters.java), [Go](./algorithms/golang/largestSubstringBetweenTwoEqualCharacters/LargestSubstringBetweenTwoEqualCharacters.go)|Easy|
|1605|[Find Valid Matrix Given Row and Column Sums](https://leetcode.com/problems/find-valid-matrix-given-row-and-column-sums/) | [Solution](), [C++](./algorithms/cpp/FindValidMatrixGivenRowAndColumnSums/FindValidMatrixGivenRowAndColumnSums.cpp), [Java](./algorithms/java/FindValidMatrixGivenRowAndColumnSums/FindValidMatrixGivenRowAndColumnSums.java), [Go](./algorithms/golang/FindValidMatrixGivenRowAndColumnSums/FindValidMatrixGivenRowAndColumnSums.go)|Medium|
|1573|[Number of Ways to Split a String](https://leetcode.com/problems/number-of-ways-to-split-a-string/) | [Solution](), [C++](./algorithms/cpp/NumberOfWaysToSplitString/NumberOfWaysToSplitString.cpp), [Java](./algorithms/java/NumberOfWaysToSplitString/NumberOfWaysToSplitString.java), [Go](./algorithms/golang/NumberOfWaysToSplitString/NumberOfWaysToSplitString.go)|Medium|
|1556|[Thousand Separator](https://leetcode.com/problems/thousand-separator/) | [Solution](), [C++](./algorithms/cpp/thousandSeparator/ThousandSeparator.cpp), [Java](./algorithms/java/thousandSeparator/ThousandSeparator.java), [Go](./algorithms/golang/thousandSeparator/ThousandSeparator.go)|Easy|
|1551|[Minimum Operations to Make Array Equal](https://leetcode.com/problems/minimum-operations-to-make-array-equal/) | [Solution](), [C++](./algorithms/cpp/minimumOperationsToMakeArrayEqual/MinimumOperationsToMakeArrayEqual.cpp), [Java](./algorithms/java/minimumOperationsToMakeArrayEqual/MinimumOperationsToMakeArrayEqual.java), [Go](./algorithms/golang/minimumOperationsToMakeArrayEqual/MinimumOperationsToMakeArrayEqual.go)|Medium|
|1550|[Three Consecutive Odds](https://leetcode.com/problems/three-consecutive-odds/) | [Solution](), [C++](./algorithms/cpp/threeConsecutiveOdds/ThreeConsecutiveOdds.cpp), [Java](./algorithms/java/threeConsecutiveOdds/ThreeConsecutiveOdds.java), [Go](./algorithms/golang/threeConsecutiveOdds/ThreeConsecutiveOdds.go)|Easy|
|1541|[Minimum Insertions to Balance a Parentheses String](https://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string/) | [Solution](), [C++](./algorithms/cpp/minimumInsertionsToBalanceAParenthesesString/MinimumInsertionsToBalanceAParenthesesString.cpp), [Java](./algorithms/java/minimumInsertionsToBalanceAParenthesesString/MinimumInsertionsToBalanceAParenthesesString.java), [Go](./algorithms/golang/minimumInsertionsToBalanceAParenthesesString/MinimumInsertionsToBalanceAParenthesesString.go)|Medium|
|1535|[Find the Winner of an Array Game](https://leetcode.com/problems/find-the-winner-of-an-array-game/) | [Solution](), [C++](./algorithms/cpp/findTheWinnerOfAnArrayGame/FindTheWinnerOfAnArrayGame.cpp), [Java](./algorithms/java/findTheWinnerOfAnArrayGame/FindTheWinnerOfAnArrayGame.java), [Go](./algorithms/golang/findTheWinnerOfAnArrayGame/FindTheWinnerOfAnArrayGame.go)|Medium|
|1529|[Bulb Switcher IV](https://leetcode.com/problems/bulb-switcher-iv/) | [Solution](), [C++](./algorithms/cpp/bulbSwitcher/BulbSwitcher.IV.cpp), [Java](./algorithms/java/bulbSwitcher/BulbSwitcher.IV.java), [Go](./algorithms/golang/bulbSwitcher/BulbSwitcher.IV.go)|Medium|
|1528|[Shuffle String](https://leetcode.com/problems/shuffle-string/submissions/) | [Solution](), [C++](./algorithms/cpp/shuffleString/ShuffleString.cpp), [Java](./algorithms/java/shuffleString/ShuffleString.java), [Go](./algorithms/golang/shuffleString/ShuffleString.go)|Easy|
|1525|[Number of Good Ways to Split a String](https://leetcode.com/problems/number-of-good-ways-to-split-a-string/) | [Solution](), [C++](./algorithms/cpp/numberOfGoodWaysToSplitAString/NumberOfGoodWaysToSplitAString.cpp), [Java](./algorithms/java/numberOfGoodWaysToSplitAString/NumberOfGoodWaysToSplitAString.java), [Go](./algorithms/golang/numberOfGoodWaysToSplitAString/NumberOfGoodWaysToSplitAString.go)|Medium|
|1524|[Number of Sub-arrays With Odd Sum](https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/) | [Solution](), [C++](./algorithms/cpp/numberOfSubArraysWithOddSum/NumberOfSubArraysWithOddSum.cpp), [Java](./algorithms/java/numberOfSubArraysWithOddSum/NumberOfSubArraysWithOddSum.java), [Go](./algorithms/golang/numberOfSubArraysWithOddSum/NumberOfSubArraysWithOddSum.go)|Medium|
|1523|[Count Odd Numbers in an Interval Range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/) | [Solution](), [C++](./algorithms/cpp/countOddNumbersInAnIntervalRange/CountOddNumbersInAnIntervalRange.cpp), [Java](./algorithms/java/countOddNumbersInAnIntervalRange/CountOddNumbersInAnIntervalRange.java), [Go](./algorithms/golang/countOddNumbersInAnIntervalRange/CountOddNumbersInAnIntervalRange.go)|Easy|
|1513|[Number of Substrings With Only 1s](https://leetcode.com/problems/number-of-substrings-with-only-1s/) | [Solution](), [C++](./algorithms/cpp/numberOfSubstringsWithOnly1s/NumberOfSubstringsWithOnly1s.cpp), [Java](./algorithms/java/numberOfSubstringsWithOnly1s/NumberOfSubstringsWithOnly1s.java), [Go](./algorithms/golang/numberOfSubstringsWithOnly1s/NumberOfSubstringsWithOnly1s.go)|Medium|
|1470|[Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/) | [Solution](), [C++](./algorithms/cpp/shuffleTheArray/ShuffleTheArray.cpp), [Java](./algorithms/java/shuffleTheArray/ShuffleTheArray.java), [Go](./algorithms/golang/shuffleTheArray/ShuffleTheArray.go)|Easy|
|1464|[Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/) | [Solution](), [C++](./algorithms/cpp/maximumProductOfTwoElementsInAnArray/MaximumProductOfTwoElementsInAnArray.cpp), [Java](./algorithms/java/maximumProductOfTwoElementsInAnArray/MaximumProductOfTwoElementsInAnArray.java), [Go](./algorithms/golang/maximumProductOfTwoElementsInAnArray/MaximumProductOfTwoElementsInAnArray.go)|Easy|
|1460|[Make Two Arrays Equal by Reversing Sub-arrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays/) | [Solution](), [C++](./algorithms/cpp/twoArraysEqualByReversingSubArrays/MakeTwoArraysEqualByReversingSubArrays.cpp), [Java](./algorithms/java/twoArraysEqualByReversingSubArrays/MakeTwoArraysEqualByReversingSubArrays.java), [Go](./algorithms/golang/twoArraysEqualByReversingSubArrays/MakeTwoArraysEqualByReversingSubArrays.go)|Easy|
|1376|[Time Needed to Inform All Employees](https://leetcode.com/problems/time-needed-to-inform-all-employees/) | [Solution](), [C++](./algorithms/cpp/timeNeededToInformAllEmployees/TimeNeededToInformAllEmployees.cpp), [Java](./algorithms/java/timeNeededToInformAllEmployees/TimeNeededToInformAllEmployees.java), [Go](./algorithms/golang/timeNeededToInformAllEmployees/TimeNeededToInformAllEmployees.go)|Medium|
|1375|[Bulb Switcher III](https://leetcode.com/problems/bulb-switcher-iii) | [Solution](), [C++](./algorithms/cpp/bulbSwitcher/BulbSwitcher.III.cpp), [Java](./algorithms/java/bulbSwitcher/BulbSwitcher.III.java), [Go](./algorithms/golang/bulbSwitcher/BulbSwitcher.III.go)|Medium|
|1353|[Maximum Number of Events That Can Be Attended](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/) | [Solution](), [C++](./algorithms/cpp/maximumNumberOfEventsThatCanBeAttended/MaximumNumberOfEventsThatCanBeAttended.cpp), [Java](./algorithms/java/maximumNumberOfEventsThatCanBeAttended/MaximumNumberOfEventsThatCanBeAttended.java), [Go](./algorithms/golang/maximumNumberOfEventsThatCanBeAttended/MaximumNumberOfEventsThatCanBeAttended.go)|Medium|
|1333|[Filter Restaurants by Vegan-Friendly, Price and Distance](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/) | [Solution](), [C++](./algorithms/cpp/filterRestaurantsByVeganFriendlyPriceAndDistance/FilterRestaurantsByVeganFriendlyPriceAndDistance.cpp), [Java](./algorithms/java/filterRestaurantsByVeganFriendlyPriceAndDistance/FilterRestaurantsByVeganFriendlyPriceAndDistance.java), [Go](./algorithms/golang/filterRestaurantsByVeganFriendlyPriceAndDistance/FilterRestaurantsByVeganFriendlyPriceAndDistance.go)|Medium|
|1207|[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/) | [Solution](), [C++](./algorithms/cpp/uniqueNumberOfOccurrences/Unique-Number-of-Occurrences.cpp), [Java](./algorithms/java/uniqueNumberOfOccurrences/Unique-Number-of-Occurrences.java), [Go](./algorithms/golang/uniqueNumberOfOccurrences/Unique-Number-of-Occurrences.go)|Easy|
|1170|[Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/) | [Solution](), [C++](./algorithms/cpp/compareStringsByFrequencyOfTheSmallestCharacter/CompareStringsByFrequencyOfTheSmallestCharacter.cpp), [Java](./algorithms/java/compareStringsByFrequencyOfTheSmallestCharacter/CompareStringsByFrequencyOfTheSmallestCharacter.java), [Go](./algorithms/golang/compareStringsByFrequencyOfTheSmallestCharacter/CompareStringsByFrequencyOfTheSmallestCharacter.go)|Easy|
|1071|[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/) | [Solution](), [C++](./algorithms/cpp/greatestCommonDivisorOfStrings/GreatestCommonDivisorOfStrings.cpp), [Java](./algorithms/java/greatestCommonDivisorOfStrings/GreatestCommonDivisorOfStrings.java), [Go](./algorithms/golang/greatestCommonDivisorOfStrings/GreatestCommonDivisorOfStrings.go)|Easy|
|1030|[Matrix Cells in Distance Order](https://leetcode.com/problems/matrix-cells-in-distance-order/) | [Solution](), [C++](./algorithms/cpp/matrixCellsInDistanceOrder/MatrixCellsInDistanceOrder.cpp), [Java](./algorithms/java/matrixCellsInDistanceOrder/MatrixCellsInDistanceOrder.java), [Go](./algorithms/golang/matrixCellsInDistanceOrder/MatrixCellsInDistanceOrder.go)|Easy|
|1029|[Two City Scheduling](https://leetcode.com/problems/two-city-scheduling/) | [Solution](), [C++](./algorithms/cpp/twoCityScheduling/TwoCityScheduling.cpp), [Java](./algorithms/java/twoCityScheduling/TwoCityScheduling.java), [Go](./algorithms/golang/twoCityScheduling/TwoCityScheduling.go)|Easy|
|1028|[Recover a Tree From Preorder Traversal](https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/) | [Solution](), [C++](./algorithms/cpp/recoverATreeFromPreorderTraversal/recoverATreeFromPreorderTraversal.cpp), [Java](./algorithms/java/recoverATreeFromPreorderTraversal/recoverATreeFromPreorderTraversal.java), [Go](./algorithms/golang/recoverATreeFromPreorderTraversal/recoverATreeFromPreorderTraversal.go)|Hard|
|1024|[Video Stitching](https://leetcode.com/problems/video-stitching/) | [Solution](), [C++](./algorithms/cpp/videoStitching/VideoStitching.cpp), [Java](./algorithms/java/videoStitching/VideoStitching.java), [Go](./algorithms/golang/videoStitching/VideoStitching.go)|Medium|
|993|[Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree/) | [Solution](), [C++](./algorithms/cpp/cousinsInBinaryTree/CousinsInBinaryTree.cpp), [Java](./algorithms/java/cousinsInBinaryTree/CousinsInBinaryTree.java), [Go](./algorithms/golang/cousinsInBinaryTree/CousinsInBinaryTree.go)|Easy|
|991|[Broken Calculator](https://leetcode.com/problems/broken-calculator/) | [Solution](), [C++](./algorithms/cpp/brokenCalculator/BrokenCalculator.cpp), [Java](./algorithms/java/brokenCalculator/BrokenCalculator.java), [Go](./algorithms/golang/brokenCalculator/BrokenCalculator.go)|Medium|
|990|[Satisfiability of Equality Equations](https://leetcode.com/problems/satisfiability-of-equality-equations/) | [Solution](), [C++](./algorithms/cpp/satisfiabilityOfEqualityEquations/SatisfiabilityOfEqualityEquations.cpp), [Java](./algorithms/java/satisfiabilityOfEqualityEquations/SatisfiabilityOfEqualityEquations.java), [Go](./algorithms/golang/satisfiabilityOfEqualityEquations/SatisfiabilityOfEqualityEquations.go)|Medium|
|989|[Add to Array-Form of Integer](https://leetcode.com/problems/add-to-array-form-of-integer/) | [Solution](), [C++](./algorithms/cpp/addToArrayFormOfInteger/AddToArrayFormOfInteger.cpp), [Java](./algorithms/java/addToArrayFormOfInteger/AddToArrayFormOfInteger.java), [Go](./algorithms/golang/addToArrayFormOfInteger/AddToArrayFormOfInteger.go)|Easy|
|988|[Smallest String Starting From Leaf](https://leetcode.com/problems/smallest-string-starting-from-leaf/) | [Solution](), [C++](./algorithms/cpp/smallestStringStartingFromLeaf/SmallestStringStartingFromLeaf.cpp), [Java](./algorithms/java/smallestStringStartingFromLeaf/SmallestStringStartingFromLeaf.java), [Go](./algorithms/golang/smallestStringStartingFromLeaf/SmallestStringStartingFromLeaf.go)|Medium|
|987|[Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/) | [Solution](), [C++](./algorithms/cpp/verticalOrderTraversalOfABinaryTree/VerticalOrderTraversalOfABinaryTree.cpp), [Java](./algorithms/java/verticalOrderTraversalOfABinaryTree/VerticalOrderTraversalOfABinaryTree.java), [Go](./algorithms/golang/verticalOrderTraversalOfABinaryTree/VerticalOrderTraversalOfABinaryTree.go)|Medium|
|986|[Interval List Intersections](https://leetcode.com/problems/interval-list-intersections/) | [Solution](), [C++](./algorithms/cpp/intervalListIntersectons/IntervalListIntersections.cpp), [Java](./algorithms/java/intervalListIntersectons/IntervalListIntersections.java), [Go](./algorithms/golang/intervalListIntersectons/IntervalListIntersections.go)|Medium|
|985|[Sum of Even Numbers After Queries](https://leetcode.com/problems/sum-of-even-numbers-after-queries/) | [Solution](), [C++](./algorithms/cpp/sumOfEvenNumbersAfterQueries/SumOfEvenNumbersAfterQueries.cpp), [Java](./algorithms/java/sumOfEvenNumbersAfterQueries/SumOfEvenNumbersAfterQueries.java), [Go](./algorithms/golang/sumOfEvenNumbersAfterQueries/SumOfEvenNumbersAfterQueries.go)|Easy|
|984|[String Without AAA or BBB](https://leetcode.com/problems/string-without-aaa-or-bbb/) | [Solution](), [C++](./algorithms/cpp/stringWithoutAAAOrBBB/StringWithoutAAAOrBBB.cpp), [Java](./algorithms/java/stringWithoutAAAOrBBB/StringWithoutAAAOrBBB.java), [Go](./algorithms/golang/stringWithoutAAAOrBBB/StringWithoutAAAOrBBB.go)|Easy|
|983|[Minimum Cost For Tickets](https://leetcode.com/problems/minimum-cost-for-tickets/) | [Solution](), [C++](./algorithms/cpp/minimumCostForTickets/MinimumCostForTickets.cpp), [Java](./algorithms/java/minimumCostForTickets/MinimumCostForTickets.java), [Go](./algorithms/golang/minimumCostForTickets/MinimumCostForTickets.go)|Medium|
|982|[Triples with Bitwise AND Equal To Zero](https://leetcode.com/problems/triples-with-bitwise-and-equal-to-zero/) | [Solution](), [C++](./algorithms/cpp/triplesWithBitwiseANDEqualToZero/TriplesWithBitwiseAndEqualToZero.cpp), [Java](./algorithms/java/triplesWithBitwiseANDEqualToZero/TriplesWithBitwiseAndEqualToZero.java), [Go](./algorithms/golang/triplesWithBitwiseANDEqualToZero/TriplesWithBitwiseAndEqualToZero.go)|Hard|
|981|[Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/) | [Solution](), [C++](./algorithms/cpp/timeBasedKeyValueStore/TimeBasedKeyValueStore.cpp), [Java](./algorithms/java/timeBasedKeyValueStore/TimeBasedKeyValueStore.java), [Go](./algorithms/golang/timeBasedKeyValueStore/TimeBasedKeyValueStore.go)|Medium|
|980|[Unique Paths III](https://leetcode.com/problems/unique-paths-iii/) | [Solution](), [C++](./algorithms/cpp/uniquePaths/UniquePaths.III.cpp), [Java](./algorithms/java/uniquePaths/UniquePaths.III.java),[Python](./algorithms/python/uniquePaths/uniquePathsIII.py), [Go](./algorithms/golang/uniquePaths/UniquePaths.III.go),[Python](./algorithms/python/uniquePaths/uniquePathsIII.py)|Hard|
|979|[Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree/) | [Solution](), [C++](./algorithms/cpp/distributeCoinsInBinaryTree/DistributeCoinsInBinaryTree.cpp), [Java](./algorithms/java/distributeCoinsInBinaryTree/DistributeCoinsInBinaryTree.java), [Go](./algorithms/golang/distributeCoinsInBinaryTree/DistributeCoinsInBinaryTree.go)|Medium|
|978|[Longest Turbulent Subarray](https://leetcode.com/problems/longest-turbulent-subarray/) | [Solution](), [C++](./algorithms/cpp/longestTurbulentSubarray/LongestTurbulentSubarray.cpp), [Java](./algorithms/java/longestTurbulentSubarray/LongestTurbulentSubarray.java),[Python](./algorithms/python/LongestTurbulentSubarray/maxTurbulenceSize.py), [Go](./algorithms/golang/longestTurbulentSubarray/LongestTurbulentSubarray.go),[Python](./algorithms/python/LongestTurbulentSubarray/maxTurbulenceSize.py)|Medium|
|977|[Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/) | [Solution](), [C++](./algorithms/cpp/squaresOfASortedArray/SquaresOfASortedArray.cpp), [Java](./algorithms/java/squaresOfASortedArray/SquaresOfASortedArray.java), [Python](./algorithms/python/SquaresOfSortedArray/sortedSquares.py), [Go](./algorithms/golang/squaresOfASortedArray/SquaresOfASortedArray.go), [Python](./algorithms/python/SquaresOfSortedArray/sortedSquares.py)|Easy|
|976|[Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/) | [Solution](), [C++](./algorithms/cpp/largestPerimeterTriangle/largestPerimeterTriangle.cpp), [Java](./algorithms/java/largestPerimeterTriangle/largestPerimeterTriangle.java), [Python](./algorithms/python/LargestPerimeterTriangle/largestPerimeter.py), [Go](./algorithms/golang/largestPerimeterTriangle/largestPerimeterTriangle.go), [Python](./algorithms/python/LargestPerimeterTriangle/largestPerimeter.py)|Easy|
|971|[Flip Binary Tree To Match Preorder Traversal](https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal/) | [Python](./algorithms/python/FlipBinaryTreeToMatchPreorderTraversal/flipMatchVoyage.py)|Medium|
|969|[Pancake Sorting](https://leetcode.com/problems/pancake-sorting/) | [Python](./algorithms/python/PancakeSorting/pancakeSort.py)|Medium|
|961|[N-Repeated element in size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array/) | [Solution](), [C++](./algorithms/cpp/nRepeatedElementInSize2NArray/N-Repeated-Element-in-Size-2N-Array.cpp), [Java](./algorithms/java/nRepeatedElementInSize2NArray/N-Repeated-Element-in-Size-2N-Array.java), [Go](./algorithms/golang/nRepeatedElementInSize2NArray/N-Repeated-Element-in-Size-2N-Array.go)|Easy|
|958|[Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree/) | [Python](./algorithms/python/CheckCompletenessOfABinaryTree/isCompleteTree.py)|Medium|
|951|[Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees/) | [Python](./algorithms/python/FlipEquivalentBinaryTrees/flipEquiv.py)|Medium|
|950|[Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order/) | [Python](./algorithms/python/RevealCardsInIncreasingOrder/deckRevealedIncreasing.py)|Medium|
|941|[Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array/) | [Python](./algorithms/python/ValidMountainArray/validMountainArray.py)|Easy|
|933|[Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/) | [Solution](), [C++](./algorithms/cpp/numberOfRecentCalls/NumberOfRecentCalls.cpp), [Java](./algorithms/java/numberOfRecentCalls/NumberOfRecentCalls.java), [Go](./algorithms/golang/numberOfRecentCalls/NumberOfRecentCalls.go)|Easy|
|931|[Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum/) | [Solution](), [C++](./algorithms/cpp/minimumFallingPathSum/MinimumFallingPathSum.cpp), [Java](./algorithms/java/minimumFallingPathSum/MinimumFallingPathSum.java), [Go](./algorithms/golang/minimumFallingPathSum/MinimumFallingPathSum.go)|Medium|
|929|[Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses/) | [Solution](), [C++](./algorithms/cpp/uniqueEmailAddresses/UniqueEmailAddresses.cpp), [Java](./algorithms/java/uniqueEmailAddresses/UniqueEmailAddresses.java), [Go](./algorithms/golang/uniqueEmailAddresses/UniqueEmailAddresses.go)|Easy|
|922|[Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii/) | [Solution](), [C++](./algorithms/cpp/sortArrayByParity/SortArrayByParity.II.cpp), [Java](./algorithms/java/sortArrayByParity/SortArrayByParity.II.java), [Go](./algorithms/golang/sortArrayByParity/SortArrayByParity.II.go)|Easy|
|914|[X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/) | [Python](./algorithms/python/XOfAKindInADeckOfCards/hasGroupsSizeX.py)|Easy|
|905|[Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity/) | [Solution](), [C++](./algorithms/cpp/sortArrayByParity/SortArrayByParity.cpp), [Java](./algorithms/java/sortArrayByParity/SortArrayByParity.java), [Go](./algorithms/golang/sortArrayByParity/SortArrayByParity.go)|Easy|
|876|[Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/) | [Python](./algorithms/python/MiddleOfTheLinkedList/middleOfTheLinkedList.py)|Easy|
|859|[Buddy Strings](https://leetcode.com/problems/buddy-strings/description/) | [Solution](), [C++](./algorithms/cpp/buddyStrings/BuddyStrings.cpp), [Java](./algorithms/java/buddyStrings/BuddyStrings.java), [Go](./algorithms/golang/buddyStrings/BuddyStrings.go)|Easy|
|858|[Mirror Reflection](https://leetcode.com/problems/mirror-reflection/description/) | [Solution](), [C++](./algorithms/cpp/mirrorReflection/MirrorReflection.cpp), [Java](./algorithms/java/mirrorReflection/MirrorReflection.java), [Go](./algorithms/golang/mirrorReflection/MirrorReflection.go)|Medium|
|852|[Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/description/) | [Solution](), [C++](./algorithms/cpp/peakIndexInAMountainArray/PeakIndexInAMountainArray.cpp), [Java](./algorithms/java/peakIndexInAMountainArray/PeakIndexInAMountainArray.java), [Go](./algorithms/golang/peakIndexInAMountainArray/PeakIndexInAMountainArray.go)|Easy|
|849|[Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person/) | [Python](./algorithms/python/MaximizeDistanceToClosestPerson/maxDistToClosest.py)|Easy|
|844|[Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/description/) | [Solution](), [C++](./algorithms/cpp/backspaceStringCompare/BackspaceStringCompare.cpp), [Java](./algorithms/java/backspaceStringCompare/BackspaceStringCompare.java), [Go](./algorithms/golang/backspaceStringCompare/BackspaceStringCompare.go)|Easy|
|837|[Most Common Word](https://leetcode.com/problems/most-common-word/) | [Solution](), [C++](./algorithms/cpp/mostCommonWord/MostCommonWord.cpp), [Java](./algorithms/java/mostCommonWord/MostCommonWord.java), [Go](./algorithms/golang/mostCommonWord/MostCommonWord.go)|Easy|
|830|[Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups/) | [Python](./algorithms/python/PositionsOfLargeGroups/largeGroupPositions.py)|Easy|
|820|[Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words/) | [Solution](), [C++](./algorithms/cpp/shortEncodingOfWords/ShortEncodingOfWords.cpp), [Java](./algorithms/java/shortEncodingOfWords/ShortEncodingOfWords.java), [Go](./algorithms/golang/shortEncodingOfWords/ShortEncodingOfWords.go)|Medium|
|804|[Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/description/) | [Solution](), [C++](./algorithms/cpp/uniqueMorseCodeWords/UniqueMorseCodeWords.cpp), [Java](./algorithms/java/uniqueMorseCodeWords/UniqueMorseCodeWords.java), [Go](./algorithms/golang/uniqueMorseCodeWords/UniqueMorseCodeWords.go)|Easy|
|771|[Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/description) | [Solution](), [C++](./algorithms/cpp/jewelsAndStones/JewelsAndStones.cpp), [Java](./algorithms/java/jewelsAndStones/JewelsAndStones.java), [Go](./algorithms/golang/jewelsAndStones/JewelsAndStones.go)|Easy|
|747|[Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others/) | [Python](./algorithms/python/LargestNumberAtLeastTwiceOfOthers/dominantIndex.py)|Easy|
|746|[Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/) | [Solution](), [C++](./algorithms/cpp/minCostClimbingStairs/MinCostClimbingStairs.cpp), [Java](./algorithms/java/minCostClimbingStairs/MinCostClimbingStairs.java), [Python](./algorithms/python/MinCostClimbingStairs/minCostClimbingStairs.py), [Go](./algorithms/golang/minCostClimbingStairs/MinCostClimbingStairs.go), [Python](./algorithms/python/MinCostClimbingStairs/minCostClimbingStairs.py)|Easy|
|721|[Accounts Merge](https://leetcode.com/problems/accounts-merge/) | [Solution](), [C++](./algorithms/cpp/accountsMerge/AccountsMerge.cpp), [Java](./algorithms/java/accountsMerge/AccountsMerge.java), [Go](./algorithms/golang/accountsMerge/AccountsMerge.go)|Medium|
|717|[1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters/) | [Python](./algorithms/python/1-bitAnd2-bitCharacters/isOneBitCharacter.py)|Easy|
|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) | [Solution](), [C++](./algorithms/cpp/bestTimeToBuyAndSellStock/BestTimeToBuyAndSellStockWithTransactionFee.cpp), [Java](./algorithms/java/bestTimeToBuyAndSellStock/BestTimeToBuyAndSellStockWithTransactionFee.java), [Go](./algorithms/golang/bestTimeToBuyAndSellStock/BestTimeToBuyAndSellStockWithTransactionFee.go)|Medium|
|712|[Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/) | [Solution](), [C++](./algorithms/cpp/minimumASCIIDeleteSumForTwoStrings/MinimumAsciiDeleteSumForTwoStrings.cpp), [Java](./algorithms/java/minimumASCIIDeleteSumForTwoStrings/MinimumAsciiDeleteSumForTwoStrings.java), [Go](./algorithms/golang/minimumASCIIDeleteSumForTwoStrings/MinimumAsciiDeleteSumForTwoStrings.go)|Medium|
|695|[Max Area of Island](https://leetcode.com/problems/max-area-of-island/) | [Solution](), [C++](./algorithms/cpp/maxAreaOfIsland/MaxAreaOfIsland.cpp), [Java](./algorithms/java/maxAreaOfIsland/MaxAreaOfIsland.java), [Go](./algorithms/golang/maxAreaOfIsland/MaxAreaOfIsland.go)|Medium|
|687|[Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path/) | [Python](./algorithms/python/LongestUnivaluePath/longestUnivaluePath.py)|Easy|
|684|[Redundant Connection](https://leetcode.com/problems/redundant-connection/) | [Python](./algorithms/python/RedundantConnection/findRedundantConnection.py)|Medium|
|674|[Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence/) | [Python](./algorithms/python/LongestContinuousIncreasingSubsequence/findLengthOfLCIS.py)|Easy|
|672|[Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii/submissions/) | [Solution](), [C++](./algorithms/cpp/bulbSwitcher/BulbSwitcher.II.cpp), [Java](./algorithms/java/bulbSwitcher/BulbSwitcher.II.java), [Go](./algorithms/golang/bulbSwitcher/BulbSwitcher.II.go)|Medium|
|671|[Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/) | [Python](./algorithms/python/SecondMinimumNodeInABinaryTree/findSecondMinimumValue.py)|Easy|
|665|[Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array/) | [Python](./algorithms/python/Non-decreasingArray/checkPossibility.py)|Easy|
|662|[Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree/) | [Python](./algorithms/python/MaximumWidthOfBinaryTree/widthOfBinaryTree.py)|Medium|
|661|[Image Smoother](https://leetcode.com/problems/image-smoother/) | [Python](./algorithms/python/ImageSmoother/imageSmoother.py)|Easy|
|655|[Print Binary Tree](https://leetcode.com/problems/print-binary-tree/) | [Python](./algorithms/python/PrintBinaryTree/printTree.py)|Medium|
|652|[Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees/) | [Python](./algorithms/python/FindDuplicateSubtrees/findDuplicateSubtrees.py)|Medium|
|647|[Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) | [Solution](), [C++](./algorithms/cpp/palindromicSubstrings/PalindromicSubstrings.cpp), [Java](./algorithms/java/palindromicSubstrings/PalindromicSubstrings.java), [Go](./algorithms/golang/palindromicSubstrings/PalindromicSubstrings.go)|Medium|
|643|[Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/description/) | [Solution](), [C++](./algorithms/cpp/maximumAverageSubarray/MaximumAverageSubarray.I.cpp), [Java](./algorithms/java/maximumAverageSubarray/MaximumAverageSubarray.I.java), [Python](./algorithms/python/MaximumAverageSubarrayI/findMaxAverage.py), [Go](./algorithms/golang/maximumAverageSubarray/MaximumAverageSubarray.I.go), [Python](./algorithms/python/MaximumAverageSubarrayI/findMaxAverage.py)|Easy|
|628|[Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/) | [Python](./algorithms/python/MaximumProductOfThreeNumbers/maximumProduct.py)|Easy|
|623|[Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree/) | [Python](./algorithms/python/AddOneRowToTree/addOneRow.py)|Medium|
|581|[Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/) | [Python](./algorithms/python/ShortestUnsortedContinuousSubarray/findUnsortedSubarray.py)|Easy|
|572|[Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/) | [Python](./algorithms/python/SubtreeOfAnotherTree/isSubtree.py)|Easy|
|563|[Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/) | [Python](./algorithms/python/BinaryTreeTilt/findTilt.py)|Easy|
|547|[Friend Circles](https://leetcode.com/problems/friend-circles/) | [Solution](), [C++](./algorithms/cpp/friendCircles/FriendCircles.cpp), [Java](./algorithms/java/friendCircles/FriendCircles.java), [Go](./algorithms/golang/friendCircles/FriendCircles.go)|Medium|
|543|[Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) | [Python](./algorithms/python/DiameterOfBinaryTree/diameterOfBinaryTree.py)|Easy|
|538|[Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/) | [Python](./algorithms/python/ConvertBSTtoGreaterTree/convertBST.py)|Easy|
|532|[K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/) | [Python](./algorithms/python/K-diffPairsInAnArray/findPairs.py)|Easy|
|520|[Detect Capital](https://leetcode.com/problems/detect-capital/) | [Solution](), [C++](./algorithms/cpp/detectCapital/DetectCapital.cpp), [Java](./algorithms/java/detectCapital/DetectCapital.java), [Go](./algorithms/golang/detectCapital/DetectCapital.go)|Easy|
|518|[Coin Change 2](https://leetcode.com/problems/coin-change-2/) | [Solution](), [C++](./algorithms/cpp/coinChange/CoinChange2.cpp), [Java](./algorithms/java/coinChange/CoinChange2.java), [Go](./algorithms/golang/coinChange/CoinChange2.go)|Medium|
|516|[Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/) | [Solution](), [C++](./algorithms/cpp/longestPalindromicSubsequence/LongestPalindromicSubsequence.cpp), [Java](./algorithms/java/longestPalindromicSubsequence/LongestPalindromicSubsequence.java), [Go](./algorithms/golang/longestPalindromicSubsequence/LongestPalindromicSubsequence.go)|Medium|
|509|[Fibonacci Number](https://leetcode.com/problems/fibonacci-number/) | [Solution](), [C++](./algorithms/cpp/fibonacciNumber/FibonacciNumber.cpp), [Java](./algorithms/java/fibonacciNumber/FibonacciNumber.java), [Python](./algorithms/python/FibonacciNumber/fib.py), [Go](./algorithms/golang/fibonacciNumber/FibonacciNumber.go), [Python](./algorithms/python/FibonacciNumber/fib.py)|Easy|
|497|[Random Point in Non-overlapping Rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles/) | [Solution](), [C++](./algorithms/cpp/randomPointInNonOverlappingRectangles/randomPointInNonOverlappingRectangles.cpp), [Java](./algorithms/java/randomPointInNonOverlappingRectangles/randomPointInNonOverlappingRectangles.java), [Go](./algorithms/golang/randomPointInNonOverlappingRectangles/randomPointInNonOverlappingRectangles.go)|Medium|
|494|[Target Sum](https://leetcode.com/problems/target-sum/) | [Solution](), [C++](./algorithms/cpp/targetSum/targetSum.cpp), [Java](./algorithms/java/targetSum/targetSum.java), [Go](./algorithms/golang/targetSum/targetSum.go)|Medium|
|477|[Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/) | [Solution](), [C++](./algorithms/cpp/totalHammingDistance/totalHammingDistance.cpp), [Java](./algorithms/java/totalHammingDistance/totalHammingDistance.java), [Go](./algorithms/golang/totalHammingDistance/totalHammingDistance.go)|Medium|
|463|[Island Perimeter](https://leetcode.com/problems/island-perimeter/) | [Solution](), [C++](./algorithms/cpp/islandPerimeter/IslandPerimeter.cpp), [Java](./algorithms/java/islandPerimeter/IslandPerimeter.java), [Go](./algorithms/golang/islandPerimeter/IslandPerimeter.go)|Easy|
|450|[DeleteNodeInABST](https://leetcode.com/problems/delete-node-in-a-bst/) | [Python](./algorithms/python/DeleteNodeInABST/deleteNode.py)|Medium|
|449|[Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst/) | [Python](./algorithms/python/SerializeAndDeserializeBST/serialize.py)|Medium|
|438|[Find all Anagrams in a string](https://leetcode.com/problems/find-all-anagrams-in-a-string/) | [Solution](), [C++](./algorithms/cpp/findAllAnagramsInAString/Find-All-Anagrams-in-a-String.cpp), [Java](./algorithms/java/findAllAnagramsInAString/Find-All-Anagrams-in-a-String.java), [Go](./algorithms/golang/findAllAnagramsInAString/Find-All-Anagrams-in-a-String.go)|Medium|
|437|[Path Sum III](https://leetcode.com/problems/path-sum-iii/) | [Python](./algorithms/python/PathSumIII/pathSum.py)|Medium|
|418|[SentenceScreenFitting](https://leetcode.com/problems/sentence-screen-fitting/) 🔒 | [Solution](), [C++](./algorithms/cpp/sentenceScreenFitting/sentenceScreenFitting.cpp), [Java](./algorithms/java/sentenceScreenFitting/sentenceScreenFitting.java), [Go](./algorithms/golang/sentenceScreenFitting/sentenceScreenFitting.go)|Easy|
|416|[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/description/) | [Solution](), [C++](./algorithms/cpp/partitionEqualSubsetSum/PartitionEqualSubsetSum.cpp), [Java](./algorithms/java/partitionEqualSubsetSum/PartitionEqualSubsetSum.java), [Go](./algorithms/golang/partitionEqualSubsetSum/PartitionEqualSubsetSum.go)|Medium|
|415|[Add Strings](https://leetcode.com/problems/add-strings/) | [Solution](), [C++](./algorithms/cpp/addStrings/AddStrings.cpp), [Java](./algorithms/java/addStrings/AddStrings.java), [Go](./algorithms/golang/addStrings/AddStrings.go)|Easy|
|414|[Third Maximum Number](https://leetcode.com/problems/third-maximum-number/) | [Solution](), [C++](./algorithms/cpp/thirdMaximumNumber/ThirdMaximumNumber.cpp), [Java](./algorithms/java/thirdMaximumNumber/ThirdMaximumNumber.java), [Python](./algorithms/python/ThirdMaximumNumber/thirdMax.py), [Go](./algorithms/golang/thirdMaximumNumber/ThirdMaximumNumber.go), [Python](./algorithms/python/ThirdMaximumNumber/thirdMax.py)|Easy|
|413|[Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/) | [Solution](), [C++](./algorithms/cpp/arithmeticSlices/ArithmeticSlices.cpp), [Java](./algorithms/java/arithmeticSlices/ArithmeticSlices.java), [Go](./algorithms/golang/arithmeticSlices/ArithmeticSlices.go)|Medium|
|412|[Fizz Buzz](https://leetcode.com/problems/fizz-buzz/) | [Solution](), [C++](./algorithms/cpp/fizzBuzz/FizzBuzz.cpp), [Java](./algorithms/java/fizzBuzz/FizzBuzz.java), [Go](./algorithms/golang/fizzBuzz/FizzBuzz.go)|Easy|
|410|[Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/) | [Solution](), [C++](./algorithms/cpp/splitArrayLargestSum/SplitArrayLargestSum.cpp), [Java](./algorithms/java/splitArrayLargestSum/SplitArrayLargestSum.java), [Go](./algorithms/golang/splitArrayLargestSum/SplitArrayLargestSum.go)|Hard|
|409|[Longest Palindrome](https://leetcode.com/problems/longest-palindrome/) | [Solution](), [C++](./algorithms/cpp/longestPalindrome/LongestPalindrome.cpp), [Java](./algorithms/java/longestPalindrome/LongestPalindrome.java), [Go](./algorithms/golang/longestPalindrome/LongestPalindrome.go)|Easy|
|406|[Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height/) | [Solution](), [C++](./algorithms/cpp/queueReconstructionByHeight/QueueReconstructionByHeight.cpp), [Java](./algorithms/java/queueReconstructionByHeight/QueueReconstructionByHeight.java), [Go](./algorithms/golang/queueReconstructionByHeight/QueueReconstructionByHeight.go)|Medium|
|405|[Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal/) | [Solution](), [C++](./algorithms/cpp/convertANumberToHexadecimal/ConvertANumberToHexadecimal.cpp), [Java](./algorithms/java/convertANumberToHexadecimal/ConvertANumberToHexadecimal.java), [Go](./algorithms/golang/convertANumberToHexadecimal/ConvertANumberToHexadecimal.go)|Easy|
|404|[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/) | [Solution](), [C++](./algorithms/cpp/sumOfLeftLeaves/SumOfLeftLeaves.cpp), [Java](./algorithms/java/sumOfLeftLeaves/SumOfLeftLeaves.java), [Python](./algorithms/python/SumOfLeftLeaves/sumOfLeftLeaves.py), [Go](./algorithms/golang/sumOfLeftLeaves/SumOfLeftLeaves.go), [Python](./algorithms/python/SumOfLeftLeaves/sumOfLeftLeaves.py)|Easy|
|403|[Frog Jump](https://leetcode.com/problems/frog-jump/) | [Solution](), [C++](./algorithms/cpp/frogJump/FrogJump.cpp), [Java](./algorithms/java/frogJump/FrogJump.java), [Go](./algorithms/golang/frogJump/FrogJump.go)|Hard|
|402|[Remove K Digits](https://leetcode.com/problems/remove-k-digits/) | [Solution](), [C++](./algorithms/cpp/removeKDigits/RemoveKDigits.cpp), [Java](./algorithms/java/removeKDigits/RemoveKDigits.java), [Go](./algorithms/golang/removeKDigits/RemoveKDigits.go)|Medium|
|401|[Binary Watch](https://leetcode.com/problems/binary-watch/) | [Solution](), [C++](./algorithms/cpp/binaryWatch/BinaryWatch.cpp), [Java](./algorithms/java/binaryWatch/BinaryWatch.java), [Go](./algorithms/golang/binaryWatch/BinaryWatch.go)|Easy|
|400|[Nth Digit](https://leetcode.com/problems/nth-digit/) | [Solution](), [C++](./algorithms/cpp/nthDigit/NthDigit.cpp), [Java](./algorithms/java/nthDigit/NthDigit.java), [Go](./algorithms/golang/nthDigit/NthDigit.go)|Medium|
|399|[Evaluate Division](https://leetcode.com/problems/evaluate-division/) | [Solution](), [C++](./algorithms/cpp/evaluateDivision/EvaluateDivision.cpp), [Java](./algorithms/java/evaluateDivision/EvaluateDivision.java), [Go](./algorithms/golang/evaluateDivision/EvaluateDivision.go)|Medium|
|398|[Random Pick Index](https://leetcode.com/problems/random-pick-index/) | [Solution](), [C++](./algorithms/cpp/randomPickIndex/RandomPickIndex.cpp), [Java](./algorithms/java/randomPickIndex/RandomPickIndex.java), [Go](./algorithms/golang/randomPickIndex/RandomPickIndex.go)|Medium|
|397|[Integer Replacement](https://leetcode.com/problems/integer-replacement/) | [Solution](), [C++](./algorithms/cpp/integerReplacement/IntegerReplacement.cpp), [Java](./algorithms/java/integerReplacement/IntegerReplacement.java), [Go](./algorithms/golang/integerReplacement/IntegerReplacement.go)|Medium|
|396|[Rotate Function](https://leetcode.com/problems/rotate-function/) | [Solution](), [C++](./algorithms/cpp/rotateFunction/RotateFunction.cpp), [Java](./algorithms/java/rotateFunction/RotateFunction.java), [Go](./algorithms/golang/rotateFunction/RotateFunction.go)|Easy|
|395|[Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/) | [Solution](), [C++](./algorithms/cpp/longestSubstringWithAtLeastKRepeatingCharacters/LongestSubstringWithAtLeastKRepeatingCharacters.cpp), [Java](./algorithms/java/longestSubstringWithAtLeastKRepeatingCharacters/LongestSubstringWithAtLeastKRepeatingCharacters.java), [Go](./algorithms/golang/longestSubstringWithAtLeastKRepeatingCharacters/LongestSubstringWithAtLeastKRepeatingCharacters.go)|Medium|
|394|[Decode String](https://leetcode.com/problems/decode-string/) | [Solution](), [C++](./algorithms/cpp/decodeString/DecodeString.cpp), [Java](./algorithms/java/decodeString/DecodeString.java), [Go](./algorithms/golang/decodeString/DecodeString.go)|Medium|
|393|[UTF-8 Validation](https://leetcode.com/problems/utf-8-validation/) | [Solution](), [C++](./algorithms/cpp/UTF8Validation/UTF8Validation.cpp), [Java](./algorithms/java/UTF8Validation/UTF8Validation.java), [Go](./algorithms/golang/UTF8Validation/UTF8Validation.go)|Medium|
|392|[Is Subsequence](https://leetcode.com/problems/is-subsequence/) | [Solution](), [C++](./algorithms/cpp/isSubsequence/IsSubsequence.cpp), [Java](./algorithms/java/isSubsequence/IsSubsequence.java), [Go](./algorithms/golang/isSubsequence/IsSubsequence.go)|Medium|
|391|[Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle/) | [Solution](), [C++](./algorithms/cpp/perfectRectangle/PerfectRectangle.cpp), [Java](./algorithms/java/perfectRectangle/PerfectRectangle.java), [Go](./algorithms/golang/perfectRectangle/PerfectRectangle.go)|Hard|
|390|[Elimination Game](https://leetcode.com/problems/elimination-game/) | [Solution](), [C++](./algorithms/cpp/eliminationGame/EliminationGame.cpp), [Java](./algorithms/java/eliminationGame/EliminationGame.java), [Go](./algorithms/golang/eliminationGame/EliminationGame.go)|Medium|
|389|[Find the Difference](https://leetcode.com/problems/find-the-difference/) | [Solution](), [C++](./algorithms/cpp/findTheDifference/FindTheDifference.cpp), [Java](./algorithms/java/findTheDifference/FindTheDifference.java), [Go](./algorithms/golang/findTheDifference/FindTheDifference.go)|Easy|
|388|[Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path/) | [Solution](), [C++](./algorithms/cpp/longestAbsoluteFilePath/LongestAbsoluteFilePath.cpp), [Java](./algorithms/java/longestAbsoluteFilePath/LongestAbsoluteFilePath.java), [Go](./algorithms/golang/longestAbsoluteFilePath/LongestAbsoluteFilePath.go)|Medium|
|387|[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | [Solution](), [C++](./algorithms/cpp/firstUniqueCharacterInAString/FirstUniqueCharacterInAString.cpp), [Java](./algorithms/java/firstUniqueCharacterInAString/FirstUniqueCharacterInAString.java), [Go](./algorithms/golang/firstUniqueCharacterInAString/FirstUniqueCharacterInAString.go)|Easy|
|386|[Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/) | [Solution](), [C++](./algorithms/cpp/lexicographicalNumbers/LexicographicalNumbers.cpp), [Java](./algorithms/java/lexicographicalNumbers/LexicographicalNumbers.java), [Go](./algorithms/golang/lexicographicalNumbers/LexicographicalNumbers.go)|Medium|
|385|[Mini Parser](https://leetcode.com/problems/mini-parser/) | [Solution](), [C++](./algorithms/cpp/miniParser/MiniParser.cpp), [Java](./algorithms/java/miniParser/MiniParser.java), [Go](./algorithms/golang/miniParser/MiniParser.go)|Medium|
|384|[Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/) | [Solution](), [C++](./algorithms/cpp/shuffleAnArray/ShuffleAnArray.cpp), [Java](./algorithms/java/shuffleAnArray/ShuffleAnArray.java), [Go](./algorithms/golang/shuffleAnArray/ShuffleAnArray.go)|Medium|
|383|[Ransom Note](https://leetcode.com/problems/ransom-note/) | [Solution](), [C++](./algorithms/cpp/ransomNote/RansomNote.cpp), [Java](./algorithms/java/ransomNote/RansomNote.java), [Go](./algorithms/golang/ransomNote/RansomNote.go)|Easy|
|382|[Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/) | [Solution](), [C++](./algorithms/cpp/linkedListRandomNode/LinkedListRandomNode.cpp), [Java](./algorithms/java/linkedListRandomNode/LinkedListRandomNode.java), [Go](./algorithms/golang/linkedListRandomNode/LinkedListRandomNode.go)|Medium|
|381|[Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/) | [Solution](), [C++](./algorithms/cpp/insertDeleteGetRandom/InsertDeleteGetrandomO1DuplicatesAllowed.cpp), [Java](./algorithms/java/insertDeleteGetRandom/InsertDeleteGetrandomO1DuplicatesAllowed.java), [Go](./algorithms/golang/insertDeleteGetRandom/InsertDeleteGetrandomO1DuplicatesAllowed.go)|Hard|
|380|[Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | [Solution](), [C++](./algorithms/cpp/insertDeleteGetRandom/InsertDeleteGetrandomO1.cpp), [Java](./algorithms/java/insertDeleteGetRandom/InsertDeleteGetrandomO1.java), [Go](./algorithms/golang/insertDeleteGetRandom/InsertDeleteGetrandomO1.go)|Hard|
|377|[Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/) | [Solution](), [C++](./algorithms/cpp/combinationSumIV/combinationSumIV.cpp), [Java](./algorithms/java/combinationSumIV/combinationSumIV.java), [Go](./algorithms/golang/combinationSumIV/combinationSumIV.go)|Medium|
|376|[Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/) | [Solution](), [C++](./algorithms/cpp/wiggleSubsequence/wiggleSubsequence.cpp), [Java](./algorithms/java/wiggleSubsequence/wiggleSubsequence.java), [Go](./algorithms/golang/wiggleSubsequence/wiggleSubsequence.go)|Medium|
|371|[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/description/) | [Solution](), [C++](./algorithms/cpp/sumOfTwoIntegers/SumOfTwoIntegers.cpp), [Java](./algorithms/java/sumOfTwoIntegers/SumOfTwoIntegers.java), [Go](./algorithms/golang/sumOfTwoIntegers/SumOfTwoIntegers.go)|Easy|
|367|[Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/description/) | [Solution](), [C++](./algorithms/cpp/validPerfectSquare/ValidPerfectSquare.cpp), [Java](./algorithms/java/validPerfectSquare/ValidPerfectSquare.java), [Go](./algorithms/golang/validPerfectSquare/ValidPerfectSquare.go)|Easy|
|357|[Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits/) | [Solution](), [C++](./algorithms/cpp/countNumbersWithUniqueDigits/CountNumbersWithUniqueDigits.cpp), [Java](./algorithms/java/countNumbersWithUniqueDigits/CountNumbersWithUniqueDigits.java), [Go](./algorithms/golang/countNumbersWithUniqueDigits/CountNumbersWithUniqueDigits.go)|Medium|
|350|[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | [Solution](), [C++](./algorithms/cpp/intersectionOfTwoArrays/intersectionOfTwoArraysII.cpp), [Java](./algorithms/java/intersectionOfTwoArrays/intersectionOfTwoArraysII.java), [Go](./algorithms/golang/intersectionOfTwoArrays/intersectionOfTwoArraysII.go)|Easy|
|349|[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/) | [Solution](), [C++](./algorithms/cpp/intersectionOfTwoArrays/intersectionOfTwoArrays.cpp), [Java](./algorithms/java/intersectionOfTwoArrays/intersectionOfTwoArrays.java), [Go](./algorithms/golang/intersectionOfTwoArrays/intersectionOfTwoArrays.go)|Easy|
|347|[Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | [Solution](), [C++](./algorithms/cpp/topKFrequentElements/topKFrequentElements.cpp), [Java](./algorithms/java/topKFrequentElements/topKFrequentElements.java), [Go](./algorithms/golang/topKFrequentElements/topKFrequentElements.go)|Medium|
|345|[Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/) | [Solution](), [C++](./algorithms/cpp/reverseVowelsOfAString/reverseVowelsOfAString.cpp), [Java](./algorithms/java/reverseVowelsOfAString/reverseVowelsOfAString.java), [Go](./algorithms/golang/reverseVowelsOfAString/reverseVowelsOfAString.go)|Easy|
|344|[Reverse String](https://leetcode.com/problems/reverse-string/) | [Solution](), [C++](./algorithms/cpp/reverseString/ReverseString.cpp), [Java](./algorithms/java/reverseString/ReverseString.java), [Go](./algorithms/golang/reverseString/ReverseString.go)|Easy|
|343|[Integer Break](https://leetcode.com/problems/integer-break/) | [Solution](), [C++](./algorithms/cpp/integerBreak/IntegerBreak.cpp), [Java](./algorithms/java/integerBreak/IntegerBreak.java), [Go](./algorithms/golang/integerBreak/IntegerBreak.go)|Medium|
|342|[Power of Four](https://leetcode.com/problems/power-of-four/) | [Solution](), [C++](./algorithms/cpp/powerOfFour/PowerOfFour.cpp), [Java](./algorithms/java/powerOfFour/PowerOfFour.java), [Go](./algorithms/golang/powerOfFour/PowerOfFour.go)|Easy|
|341|[Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/) | [Solution](), [C++](./algorithms/cpp/flattenNestedListIterator/FlattenNestedListIterator.cpp), [Java](./algorithms/java/flattenNestedListIterator/FlattenNestedListIterator.java), [Go](./algorithms/golang/flattenNestedListIterator/FlattenNestedListIterator.go)|Medium|
|338|[Counting Bits](https://leetcode.com/problems/counting-bits/) | [Solution](), [C++](./algorithms/cpp/countingBits/CountingBits.cpp), [Java](./algorithms/java/countingBits/CountingBits.java), [Go](./algorithms/golang/countingBits/CountingBits.go)|Medium|
|337|[House Robber III](https://leetcode.com/problems/house-robber-iii/) | [Solution](), [C++](./algorithms/cpp/houseRobber/houseRobberIII.cpp), [Java](./algorithms/java/houseRobber/houseRobberIII.java), [Python](./algorithms/python/HouseRobberIII/rob.py), [Go](./algorithms/golang/houseRobber/houseRobberIII.go), [Python](./algorithms/python/HouseRobberIII/rob.py)|Medium|
|336|[Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/) | [Solution](), [C++](./algorithms/cpp/palindromePairs/PalindromePairs.cpp), [Java](./algorithms/java/palindromePairs/PalindromePairs.java), [Go](./algorithms/golang/palindromePairs/PalindromePairs.go)|Hard|
|334|[Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/) | [Solution](), [C++](./algorithms/cpp/increasingTripletSubsequence/increasingTripletSubsequence.cpp), [Java](./algorithms/java/increasingTripletSubsequence/increasingTripletSubsequence.java), [Go](./algorithms/golang/increasingTripletSubsequence/increasingTripletSubsequence.go)|Medium|
|332|[Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/) | [Solution](), [C++](./algorithms/cpp/reconstructItinerary/ReconstructItinerary.cpp), [Java](./algorithms/java/reconstructItinerary/ReconstructItinerary.java), [Go](./algorithms/golang/reconstructItinerary/ReconstructItinerary.go)|Medium|
|331|[Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/) | [Solution](), [C++](./algorithms/cpp/verifyPreorderSerializationOfABinaryTree/VerifyPreorderSerializationOfABinaryTree.cpp), [Java](./algorithms/java/verifyPreorderSerializationOfABinaryTree/VerifyPreorderSerializationOfABinaryTree.java), [Go](./algorithms/golang/verifyPreorderSerializationOfABinaryTree/VerifyPreorderSerializationOfABinaryTree.go)|Medium|
|330|[Patching Array](https://leetcode.com/problems/patching-array/) | [Solution](), [C++](./algorithms/cpp/patchingArray/PatchingArray.cpp), [Java](./algorithms/java/patchingArray/PatchingArray.java), [Go](./algorithms/golang/patchingArray/PatchingArray.go)|Medium|
|329|[Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/) | [Solution](), [C++](./algorithms/cpp/longestIncreasingPathInAMatrix/LongestIncreasingPathInAMatrix.cpp), [Java](./algorithms/java/longestIncreasingPathInAMatrix/LongestIncreasingPathInAMatrix.java), [Go](./algorithms/golang/longestIncreasingPathInAMatrix/LongestIncreasingPathInAMatrix.go)|Medium|
|328|[Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/) | [Solution](), [C++](./algorithms/cpp/oddEvenLinkedList/OddEvenLinkedList.cpp), [Java](./algorithms/java/oddEvenLinkedList/OddEvenLinkedList.java), [Go](./algorithms/golang/oddEvenLinkedList/OddEvenLinkedList.go)|Easy|
|327|[Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/) | [Solution](), [C++](./algorithms/cpp/countOfRangeSum/CountOfRangeSum.cpp), [Java](./algorithms/java/countOfRangeSum/CountOfRangeSum.java), [Go](./algorithms/golang/countOfRangeSum/CountOfRangeSum.go)|Hard|
|326|[Power of Three](https://leetcode.com/problems/power-of-three/) | [Solution](), [C++](./algorithms/cpp/powerOfThree/PowerOfThree.cpp), [Java](./algorithms/java/powerOfThree/PowerOfThree.java), [Go](./algorithms/golang/powerOfThree/PowerOfThree.go)|Easy|
|324|[Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii/) | [Solution](), [C++](./algorithms/cpp/wiggleSort/WiggleSort.II.cpp), [Java](./algorithms/java/wiggleSort/WiggleSort.II.java), [Go](./algorithms/golang/wiggleSort/WiggleSort.II.go)|Medium|
|322|[Coin Change](https://leetcode.com/problems/coin-change/) | [Solution](), [C++](./algorithms/cpp/coinChange/coinChange.cpp), [Java](./algorithms/java/coinChange/coinChange.java), [Go](./algorithms/golang/coinChange/coinChange.go)|Medium|
|321|[Create Maximum Number](https://leetcode.com/problems/create-maximum-number/) | [Solution](), [C++](./algorithms/cpp/createMaximumNumber/CreateMaximumNumber.cpp), [Java](./algorithms/java/createMaximumNumber/CreateMaximumNumber.java), [Go](./algorithms/golang/createMaximumNumber/CreateMaximumNumber.go)|Hard|
|319|[Bulb Switcher](https://leetcode.com/problems/bulb-switcher/) | [Solution](), [C++](./algorithms/cpp/bulbSwitcher/bulbSwitcher.cpp), [Java](./algorithms/java/bulbSwitcher/bulbSwitcher.java), [Go](./algorithms/golang/bulbSwitcher/bulbSwitcher.go)|Medium|
|318|[Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) | [Solution](), [C++](./algorithms/cpp/maximumProductOfWordLengths/MaximumProductOfWordLengths.cpp), [Java](./algorithms/java/maximumProductOfWordLengths/MaximumProductOfWordLengths.java), [Go](./algorithms/golang/maximumProductOfWordLengths/MaximumProductOfWordLengths.go)|Medium|
|316|[Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters/) | [Solution](), [C++](./algorithms/cpp/removeDuplicateLetters/RemoveDuplicateLetters.cpp), [Java](./algorithms/java/removeDuplicateLetters/RemoveDuplicateLetters.java), [Go](./algorithms/golang/removeDuplicateLetters/RemoveDuplicateLetters.go)|Hard|
|315|[Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/) | [Solution](), [C++](./algorithms/cpp/countOfSmallerNumbersAfterSelf/countOfSmallerNumbersAfterSelf.cpp), [Java](./algorithms/java/countOfSmallerNumbersAfterSelf/countOfSmallerNumbersAfterSelf.java), [Go](./algorithms/golang/countOfSmallerNumbersAfterSelf/countOfSmallerNumbersAfterSelf.go)|Hard|
|313|[Super Ugly Number](https://leetcode.com/problems/super-ugly-number/) | [Solution](), [C++](./algorithms/cpp/superUglyNumber/SuperUglyNumber.cpp), [Java](./algorithms/java/superUglyNumber/SuperUglyNumber.java), [Go](./algorithms/golang/superUglyNumber/SuperUglyNumber.go)|Medium|
|312|[Burst Balloons](https://leetcode.com/problems/burst-balloons/) | [Solution](), [C++](./algorithms/cpp/burstBalloons/BurstBalloons.cpp), [Java](./algorithms/java/burstBalloons/BurstBalloons.java), [Go](./algorithms/golang/burstBalloons/BurstBalloons.go)|Hard|
|310|[Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/) | [Solution](), [C++](./algorithms/cpp/minimumHeightTrees/MinimumHeightTrees.cpp), [Java](./algorithms/java/minimumHeightTrees/MinimumHeightTrees.java), [Go](./algorithms/golang/minimumHeightTrees/MinimumHeightTrees.go)|Medium|
|309|[Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/) | [Solution](), [C++](./algorithms/cpp/bestTimeToBuyAndSellStock/BestTimeToBuyAndSellStockWithCooldown.cpp), [Java](./algorithms/java/bestTimeToBuyAndSellStock/BestTimeToBuyAndSellStockWithCooldown.java), [Go](./algorithms/golang/bestTimeToBuyAndSellStock/BestTimeToBuyAndSellStockWithCooldown.go)|Medium|
|307|[Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/) | [Solution](), [C++](./algorithms/cpp/rangeSumQuery-Immutable/rangeSumQuery-Mutable/RangeSumQueryMutable.cpp), [Java](./algorithms/java/rangeSumQuery-Immutable/rangeSumQuery-Mutable/RangeSumQueryMutable.java), [Go](./algorithms/golang/rangeSumQuery-Immutable/rangeSumQuery-Mutable/RangeSumQueryMutable.go)|Medium|
|306|[Additive Number](https://leetcode.com/problems/additive-number/) | [Solution](), [C++](./algorithms/cpp/additiveNumber/AdditiveNumber.cpp), [Java](./algorithms/java/additiveNumber/AdditiveNumber.java), [Go](./algorithms/golang/additiveNumber/AdditiveNumber.go)|Medium|
|304|[Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/) | [Solution](), [C++](./algorithms/cpp/rangeSumQuery2D-Immutable/RangeSumQuery2dImmutable.cpp), [Java](./algorithms/java/rangeSumQuery2D-Immutable/RangeSumQuery2dImmutable.java), [Go](./algorithms/golang/rangeSumQuery2D-Immutable/RangeSumQuery2dImmutable.go)|Medium|
|303|[Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/)  | [Solution](), [C++](./algorithms/cpp/rangeSumQuery-Immutable/rangeSumQuery-Immutable.cpp), [Java](./algorithms/java/rangeSumQuery-Immutable/rangeSumQuery-Immutable.java), [Go](./algorithms/golang/rangeSumQuery-Immutable/rangeSumQuery-Immutable.go)|Easy|
|301|[Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses/) | [Solution](), [C++](./algorithms/cpp/removeInvalidParentheses/RemoveInvalidParentheses.cpp), [Java](./algorithms/java/removeInvalidParentheses/RemoveInvalidParentheses.java), [Go](./algorithms/golang/removeInvalidParentheses/RemoveInvalidParentheses.go) |Hard|
|300|[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)  | [Solution](), [C++](./algorithms/cpp/longestIncreasingSubsequence/longestIncreasingSubsequence.cpp), [Java](./algorithms/java/longestIncreasingSubsequence/longestIncreasingSubsequence.java), [Go](./algorithms/golang/longestIncreasingSubsequence/longestIncreasingSubsequence.go)|Medium|
|299|[Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/)  | [Solution](), [C++](./algorithms/cpp/bullsAndCows/bullsAndCows.cpp), [Java](./algorithms/java/bullsAndCows/bullsAndCows.java), [Go](./algorithms/golang/bullsAndCows/bullsAndCows.go)|Easy|
|297|[Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)  | [Solution](), [C++](./algorithms/cpp/serializeAndDeserializeBinaryTree/SerializeAndDeserializeBinaryTree.cpp), [Java](./algorithms/java/serializeAndDeserializeBinaryTree/SerializeAndDeserializeBinaryTree.java), [Go](./algorithms/golang/serializeAndDeserializeBinaryTree/SerializeAndDeserializeBinaryTree.go)|Medium|
|295|[Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | [Solution](), [C++](./algorithms/cpp/findMedianFromDataStream/FindMedianFromDataStream.cpp), [Java](./algorithms/java/findMedianFromDataStream/FindMedianFromDataStream.java), [Go](./algorithms/golang/findMedianFromDataStream/FindMedianFromDataStream.go)|Hard|
|292|[Nim Game](https://leetcode.com/problems/nim-game/)  | [Solution](), [C++](./algorithms/cpp/nimGame/nimGame.cpp), [Java](./algorithms/java/nimGame/nimGame.java), [Go](./algorithms/golang/nimGame/nimGame.go)|Easy|
|290|[Word Pattern](https://leetcode.com/problems/word-pattern/) | [Solution](), [C++](./algorithms/cpp/wordPattern/WordPattern.cpp), [Java](./algorithms/java/wordPattern/WordPattern.java), [Go](./algorithms/golang/wordPattern/WordPattern.go)|Easy|
|289|[Game of Life](https://leetcode.com/problems/game-of-life/) | [Solution](), [C++](./algorithms/cpp/gameOfLife/GameOfLife.cpp), [Java](./algorithms/java/gameOfLife/GameOfLife.java), [Go](./algorithms/golang/gameOfLife/GameOfLife.go)|Medium|
|287|[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/)  | [Solution](), [C++](./algorithms/cpp/findTheDuplicateNumber/findTheDuplicateNumber.cpp), [Java](./algorithms/java/findTheDuplicateNumber/findTheDuplicateNumber.java), [Python](./algorithms/python/FindTheDuplicateNumber/findDuplicate.py), [Go](./algorithms/golang/findTheDuplicateNumber/findTheDuplicateNumber.go), [Python](./algorithms/python/FindTheDuplicateNumber/findDuplicate.py)|Hard|
|285|[Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst/) 🔒 | [Java](./algorithms/java/src/inorderSuccessorInBST/inorderSuccessorInBST.java), [Go](./algorithms/golang/src/inorderSuccessorInBST/inorderSuccessorInBST.go)|Medium|
|284|[Peeking Iterator](https://leetcode.com/problems/peeking-iterator/)  | [Solution](), [C++](./algorithms/cpp/peekingIterator/PeekingIterator.cpp), [Java](./algorithms/java/peekingIterator/PeekingIterator.java), [Go](./algorithms/golang/peekingIterator/PeekingIterator.go)|Medium|
|283|[Move Zeroes](https://leetcode.com/problems/move-zeroes/)  | [Solution](), [C++](./algorithms/cpp/moveZeroes/moveZeroes.cpp), [Java](./algorithms/java/moveZeroes/moveZeroes.java), [Go](./algorithms/golang/moveZeroes/moveZeroes.go)|Easy|
|282|[Expression Add Operators](https://leetcode.com/problems/expression-add-operators/)  | [Solution](), [C++](./algorithms/cpp/expressionAddOperators/ExpressionAddOperators.cpp), [Java](./algorithms/java/expressionAddOperators/ExpressionAddOperators.java), [Go](./algorithms/golang/expressionAddOperators/ExpressionAddOperators.go)|Hard|
|279|[Perfect Squares](https://leetcode.com/problems/perfect-squares/) | [Solution](), [C++](./algorithms/cpp/perfectSquares/PerfectSquares.cpp), [Java](./algorithms/java/perfectSquares/PerfectSquares.java), [Go](./algorithms/golang/perfectSquares/PerfectSquares.go)|Medium|
|278|[First Bad Version](https://leetcode.com/problems/first-bad-version/)| [Solution](), [C++](./algorithms/cpp/firstBadVersion/FirstBadVersion.cpp), [Java](./algorithms/java/firstBadVersion/FirstBadVersion.java), [Java](./algorithms/java/src/firstBadVersion/firstBadVersion.java), [Go](./algorithms/golang/firstBadVersion/FirstBadVersion.java), [Java](./algorithms/java/src/firstBadVersion/firstBadVersion.go)|Easy|
|275|[H-Index II](https://leetcode.com/problems/h-index-ii/)| [Solution](), [C++](./algorithms/cpp/h-Index/h-Index.II.cpp), [Java](./algorithms/java/h-Index/h-Index.II.java), [Go](./algorithms/golang/h-Index/h-Index.II.go)|Medium|
|274|[H-Index](https://leetcode.com/problems/h-index/)| [Solution](), [C++](./algorithms/cpp/h-Index/h-Index.cpp), [Java](./algorithms/java/h-Index/h-Index.java), [Go](./algorithms/golang/h-Index/h-Index.go)|Medium|
|273|[Integer to English Words](https://leetcode.com/problems/integer-to-english-words/)| [Solution](), [C++](./algorithms/cpp/integerToEnglishWords/IntegerToEnglishWords.cpp), [Java](./algorithms/java/integerToEnglishWords/IntegerToEnglishWords.java), [Go](./algorithms/golang/integerToEnglishWords/IntegerToEnglishWords.go)|Medium|
|268|[Missing Number](https://leetcode.com/problems/missing-number/)| [Solution](), [C++](./algorithms/cpp/missingNumber/MissingNumber.cpp), [Java](./algorithms/java/missingNumber/MissingNumber.java), [Go](./algorithms/golang/missingNumber/MissingNumber.go)|Medium|
|264|[Ugly Number II](https://leetcode.com/problems/ugly-number-ii/)| [Solution](), [C++](./algorithms/cpp/uglyNumber/UglyNumber.II.cpp), [Java](./algorithms/java/uglyNumber/UglyNumber.II.java), [Go](./algorithms/golang/uglyNumber/UglyNumber.II.go)|Medium|
|263|[Ugly Number](https://leetcode.com/problems/ugly-number/)| [Solution](), [C++](./algorithms/cpp/uglyNumber/UglyNumber.cpp), [Java](./algorithms/java/uglyNumber/UglyNumber.java), [Go](./algorithms/golang/uglyNumber/UglyNumber.go)|Easy|
|260|[Single Number III](https://leetcode.com/problems/single-number-iii/)| [Solution](), [C++](./algorithms/cpp/singleNumber/singleNumber.III.cpp), [Java](./algorithms/java/singleNumber/singleNumber.III.java), [Go](./algorithms/golang/singleNumber/singleNumber.III.go)|Medium|
|258|[Add Digits](https://leetcode.com/problems/add-digits/)| [Solution](), [C++](./algorithms/cpp/addDigits/addDigits.cpp), [Java](./algorithms/java/addDigits/addDigits.java), [Go](./algorithms/golang/addDigits/addDigits.go)|Easy|
|257|[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/)| [Solution](), [C++](./algorithms/cpp/binaryTreePaths/binaryTreePaths.cpp), [Java](./algorithms/java/binaryTreePaths/binaryTreePaths.java), [Go](./algorithms/golang/binaryTreePaths/binaryTreePaths.go)|Easy|
|242|[Valid Anagram](https://leetcode.com/problems/valid-anagram/)| [Solution](), [C++](./algorithms/cpp/anagrams/ValidAnagram.cpp), [Java](./algorithms/java/anagrams/ValidAnagram.java), [Java](./algorithms/java/src/validAnagram/ValidAnagram.java), [Go](./algorithms/golang/anagrams/ValidAnagram.java), [Java](./algorithms/java/src/validAnagram/ValidAnagram.go)|Easy|
|241|[Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/)|[Solution](), [C++](./algorithms/cpp/differentWaysToAddParentheses/DifferentWaysToAddParentheses.cpp), [Java](./algorithms/java/differentWaysToAddParentheses/DifferentWaysToAddParentheses.java), [Python](./algorithms/python/DifferentWaysToAddParentheses/diffWaysToCompute.py), [Go](./algorithms/golang/differentWaysToAddParentheses/DifferentWaysToAddParentheses.go), [Python](./algorithms/python/DifferentWaysToAddParentheses/diffWaysToCompute.py)|Medium|
|240|[Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/)|[Solution](), [C++](./algorithms/cpp/search2DMatrix/search2DMatrix.II.cpp), [Java](./algorithms/java/search2DMatrix/search2DMatrix.II.java), [Java](./algorithms/java/src/searchA2DMatrixII/SearchA2DMatrixII.java), [Python](./algorithms/python/SearchA2DMatrixII/searchMatrix.py), [Go](./algorithms/golang/search2DMatrix/search2DMatrix.II.java), [Java](./algorithms/java/src/searchA2DMatrixII/SearchA2DMatrixII.go), [Python](./algorithms/python/SearchA2DMatrixII/searchMatrix.py)|Medium|
|239|[Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/)| [Solution](), [C++](./algorithms/cpp/slidingWindowMaximum/SlidingWindowMaximum.cpp), [Java](./algorithms/java/slidingWindowMaximum/SlidingWindowMaximum.java), [Go](./algorithms/golang/slidingWindowMaximum/SlidingWindowMaximum.go)|Hard|
|238|[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/)| [Solution](), [C++](./algorithms/cpp/productOfArrayExceptSelf/ProductOfArrayExceptSelf.cpp), [Java](./algorithms/java/productOfArrayExceptSelf/ProductOfArrayExceptSelf.java), [Go](./algorithms/golang/productOfArrayExceptSelf/ProductOfArrayExceptSelf.go)|Medium|
|237|[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)| [Solution](), [C++](./algorithms/cpp/deleteNodeInALinkedList/DeleteNodeInALinkedList.cpp), [Java](./algorithms/java/deleteNodeInALinkedList/DeleteNodeInALinkedList.java), [Go](./algorithms/golang/deleteNodeInALinkedList/DeleteNodeInALinkedList.go)|Easy|
|236|[Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)| [Solution](), [C++](./algorithms/cpp/lowestCommonAncestorOfABinaryTree/LowestCommonAncestorOfABinaryTree.cpp), [Java](./algorithms/java/lowestCommonAncestorOfABinaryTree/LowestCommonAncestorOfABinaryTree.java), [Java](./algorithms/java/src/lowestCommonAncestorOfABinaryTree/lowestCommonAncestorOfABinaryTree.java), [Python](./algorithms/python/LowestCommonAncestorOfABinaryTree/lowestCommonAncestor.py), [Go](./algorithms/golang/lowestCommonAncestorOfABinaryTree/LowestCommonAncestorOfABinaryTree.java), [Java](./algorithms/java/src/lowestCommonAncestorOfABinaryTree/lowestCommonAncestorOfABinaryTree.go), [Python](./algorithms/python/LowestCommonAncestorOfABinaryTree/lowestCommonAncestor.py)|Medium|
|235|[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)| [Solution](), [C++](./algorithms/cpp/lowestCommonAncestorOfABinarySearchTree/LowestCommonAncestorOfABinarySearchTree.cpp), [Java](./algorithms/java/lowestCommonAncestorOfABinarySearchTree/LowestCommonAncestorOfABinarySearchTree.java), [Python](./algorithms/python/LowestCommonAncestorOfABinarySearchTree/lowestCommonAncestor.py), [Go](./algorithms/golang/lowestCommonAncestorOfABinarySearchTree/LowestCommonAncestorOfABinarySearchTree.go), [Python](./algorithms/python/LowestCommonAncestorOfABinarySearchTree/lowestCommonAncestor.py)|Easy|
|234|[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/)| [Solution](), [C++](./algorithms/cpp/palindromeLinkedList/PalindromeLinkedList.cpp), [Java](./algorithms/java/palindromeLinkedList/PalindromeLinkedList.java), [Go](./algorithms/golang/palindromeLinkedList/PalindromeLinkedList.go)|Easy|
|233|[Number of Digit One](https://leetcode.com/problems/number-of-digit-one/)| [Solution](), [C++](./algorithms/cpp/numberOfDigitOne/NumberOfDigitOne.cpp), [Java](./algorithms/java/numberOfDigitOne/NumberOfDigitOne.java), [Go](./algorithms/golang/numberOfDigitOne/NumberOfDigitOne.go)|Medium|
|232|[Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/)| [Solution](), [C++](./algorithms/cpp/implementQueueUsingStacks/ImplementQueueUsingStacks.cpp), [Java](./algorithms/java/implementQueueUsingStacks/ImplementQueueUsingStacks.java), [Java](./algorithms/java/src/myQueue/MyQueue.java), [Go](./algorithms/golang/implementQueueUsingStacks/ImplementQueueUsingStacks.java), [Java](./algorithms/java/src/myQueue/MyQueue.go)|Easy|
|231|[Power of Two](https://leetcode.com/problems/power-of-two/)| [Solution](), [C++](./algorithms/cpp/powerOfTwo/PowerOfTwo.cpp), [Java](./algorithms/java/powerOfTwo/PowerOfTwo.java), [Go](./algorithms/golang/powerOfTwo/PowerOfTwo.go)|Easy|
|230|[Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)| [Solution](), [C++](./algorithms/cpp/kthSmallestElementInaBST/KthSmallestElementInABst.cpp), [Java](./algorithms/java/kthSmallestElementInaBST/KthSmallestElementInABst.java), [Python](./algorithms/python/KthSmallestElementInABST/kthSmallest.py), [Go](./algorithms/golang/kthSmallestElementInaBST/KthSmallestElementInABst.go), [Python](./algorithms/python/KthSmallestElementInABST/kthSmallest.py)|Medium|
|229|[Majority Element II](https://leetcode.com/problems/majority-element-ii/) | [Solution](), [C++](./algorithms/cpp/majorityElement/majorityElement.II.cpp), [Java](./algorithms/java/majorityElement/majorityElement.II.java), [Go](./algorithms/golang/majorityElement/majorityElement.II.go)|Medium|
|228|[Summary Ranges](https://leetcode.com/problems/summary-ranges/)| [Solution](), [C++](./algorithms/cpp/summaryRanges/SummaryRanges.cpp), [Java](./algorithms/java/summaryRanges/SummaryRanges.java), [Go](./algorithms/golang/summaryRanges/SummaryRanges.go)|Easy|
|227|[Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/)| [Solution](), [C++](./algorithms/cpp/basicCalculator/BasicCalculator.II.cpp), [Java](./algorithms/java/basicCalculator/BasicCalculator.II.java), [Go](./algorithms/golang/basicCalculator/BasicCalculator.II.go)|Medium|
|226|[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)| [Solution](), [C++](./algorithms/cpp/invertBinaryTree/InvertBinaryTree.cpp), [Java](./algorithms/java/invertBinaryTree/InvertBinaryTree.java), [Go](./algorithms/golang/invertBinaryTree/InvertBinaryTree.go)|Easy|
|225|[Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/)| [Solution](), [C++](./algorithms/cpp/implementStackUsingQueues/ImplementStackUsingQueues.cpp), [Java](./algorithms/java/implementStackUsingQueues/ImplementStackUsingQueues.java), [Java](./algorithms/java/src/myStack/MyStack.java), [Go](./algorithms/golang/implementStackUsingQueues/ImplementStackUsingQueues.java), [Java](./algorithms/java/src/myStack/MyStack.go)|Medium|
|224|[Basic Calculator](https://leetcode.com/problems/basic-calculator/)| [Solution](), [C++](./algorithms/cpp/basicCalculator/BasicCalculator.cpp), [Java](./algorithms/java/basicCalculator/BasicCalculator.java), [Go](./algorithms/golang/basicCalculator/BasicCalculator.go)|Medium|
|223|[Rectangle Area](https://leetcode.com/problems/rectangle-area/)| [Solution](), [C++](./algorithms/cpp/rectangleArea/RectangleArea.cpp), [Java](./algorithms/java/rectangleArea/RectangleArea.java), [Go](./algorithms/golang/rectangleArea/RectangleArea.go)|Easy|
|222|[Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/)| [Solution](), [C++](./algorithms/cpp/countCompleteTreeNodes/CountCompleteTreeNodes.cpp), [Java](./algorithms/java/countCompleteTreeNodes/CountCompleteTreeNodes.java), [Python](./algorithms/python/CountCompleteTreeNodes/countNodes.py), [Go](./algorithms/golang/countCompleteTreeNodes/CountCompleteTreeNodes.go), [Python](./algorithms/python/CountCompleteTreeNodes/countNodes.py)|Medium|
|221|[Maximal Square](https://leetcode.com/problems/maximal-square/)| [Solution](), [C++](./algorithms/cpp/maximalSquare/MaximalSquare.cpp), [Java](./algorithms/java/maximalSquare/MaximalSquare.java), [Go](./algorithms/golang/maximalSquare/MaximalSquare.go)|Medium|
|220|[Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/)| [Solution](), [C++](./algorithms/cpp/containsDuplicate/ContainsDuplicate.III.cpp), [Java](./algorithms/java/containsDuplicate/ContainsDuplicate.III.java), [Python](./algorithms/python/ContainsDuplicateIII/containsNearbyAlmostDuplicate.py), [Go](./algorithms/golang/containsDuplicate/ContainsDuplicate.III.go), [Python](./algorithms/python/ContainsDuplicateIII/containsNearbyAlmostDuplicate.py)|Medium|
|219|[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)| [Solution](), [C++](./algorithms/cpp/containsDuplicate/ContainsDuplicate.II.cpp), [Java](./algorithms/java/containsDuplicate/ContainsDuplicate.II.java), [Python](./algorithms/python/ContainsDuplicateII/containsNearbyDuplicate.py), [Go](./algorithms/golang/containsDuplicate/ContainsDuplicate.II.go), [Python](./algorithms/python/ContainsDuplicateII/containsNearbyDuplicate.py)|Easy|
|218|[The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/)| [Solution](), [C++](./algorithms/cpp/theSkylineProblem/TheSkylineProblem.cpp), [Java](./algorithms/java/theSkylineProblem/TheSkylineProblem.java), [Go](./algorithms/golang/theSkylineProblem/TheSkylineProblem.go)|Hard|
|217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)| [Solution](), [C++](./algorithms/cpp/containsDuplicate/ContainsDuplicate.cpp), [Java](./algorithms/java/containsDuplicate/ContainsDuplicate.java), [Go](./algorithms/golang/containsDuplicate/ContainsDuplicate.go)|Easy|
|216|[Combination Sum III](https://leetcode.com/problems/combination-sum-iii/)| [Solution](), [C++](./algorithms/cpp/combinationSum/combinationSum.III.cpp), [Java](./algorithms/java/combinationSum/combinationSum.III.java), [Go](./algorithms/golang/combinationSum/combinationSum.III.go)|Medium|
|215|[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)| [Solution](), [C++](./algorithms/cpp/kthLargestElementInAnArray/KthLargestElementInAnArray.cpp), [Java](./algorithms/java/kthLargestElementInAnArray/KthLargestElementInAnArray.java), [Go](./algorithms/golang/kthLargestElementInAnArray/KthLargestElementInAnArray.go)|Medium|
|214|[Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome/)| [Solution](), [C++](./algorithms/cpp/shortestPalindrome/ShortestPalindrome.cpp), [Java](./algorithms/java/shortestPalindrome/ShortestPalindrome.java), [Go](./algorithms/golang/shortestPalindrome/ShortestPalindrome.go)|Hard|
|213|[House Robber II](https://leetcode.com/problems/house-robber-ii/)| [Solution](), [C++](./algorithms/cpp/houseRobber/houseRobber.II.cpp), [Java](./algorithms/java/houseRobber/houseRobber.II.java), [Go](./algorithms/golang/houseRobber/houseRobber.II.go)|Medium|
|212|[Word Search II](https://leetcode.com/problems/word-search-ii/)| [Solution](), [C++](./algorithms/cpp/wordSearch/wordSearch.II.cpp), [Java](./algorithms/java/wordSearch/wordSearch.II.java), [Go](./algorithms/golang/wordSearch/wordSearch.II.go)|Hard|
|211|[Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design/)| [Solution](), [C++](./algorithms/cpp/addAndSearchWord/AddAndSearchWord.cpp), [Java](./algorithms/java/addAndSearchWord/AddAndSearchWord.java), [Go](./algorithms/golang/addAndSearchWord/AddAndSearchWord.go)|Medium|
|210|[Course Schedule II](https://leetcode.com/problems/course-schedule-ii/)| [Solution](), [C++](./algorithms/cpp/courseSchedule/CourseSchedule.II.cpp), [Java](./algorithms/java/courseSchedule/CourseSchedule.II.java), [Go](./algorithms/golang/courseSchedule/CourseSchedule.II.go)|Medium|
|209|[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/)| [Solution](), [C++](./algorithms/cpp/minimumSizeSubarraySum/MinimumSizeSubarraySum.cpp), [Java](./algorithms/java/minimumSizeSubarraySum/MinimumSizeSubarraySum.java), [Go](./algorithms/golang/minimumSizeSubarraySum/MinimumSizeSubarraySum.go)|Medium|
|208|[Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/)| [Solution](), [C++](./algorithms/cpp/implementTriePrefixTree/ImplementTriePrefixTree.cpp), [Java](./algorithms/java/implementTriePrefixTree/ImplementTriePrefixTree.java), [Go](./algorithms/golang/implementTriePrefixTree/ImplementTriePrefixTree.go)|Medium|
|207|[Course Schedule](https://leetcode.com/problems/course-schedule/)| [Solution](), [C++](./algorithms/cpp/courseSchedule/CourseSchedule.cpp), [Java](./algorithms/java/courseSchedule/CourseSchedule.java), [Go](./algorithms/golang/courseSchedule/CourseSchedule.go)|Medium|
|206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)| [Solution](), [C++](./algorithms/cpp/reverseLinkedList/reverseLinkedList.cpp), [Java](./algorithms/java/reverseLinkedList/reverseLinkedList.java), [Java](./algorithms/java/src/reverseLinkedList/ReverseLinkedList.java), [Go](./algorithms/golang/reverseLinkedList/reverseLinkedList.java), [Java](./algorithms/java/src/reverseLinkedList/ReverseLinkedList.go)|Easy|
|205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/)| [Solution](), [C++](./algorithms/cpp/isomorphicStrings/IsomorphicStrings.cpp), [Java](./algorithms/java/isomorphicStrings/IsomorphicStrings.java), [Go](./algorithms/golang/isomorphicStrings/IsomorphicStrings.go)|Easy|
|204|[Count Primes](https://leetcode.com/problems/count-primes/)| [Solution](), [C++](./algorithms/cpp/countPrimes/CountPrimes.cpp), [Java](./algorithms/java/countPrimes/CountPrimes.java), [Go](./algorithms/golang/countPrimes/CountPrimes.go)|Easy|
|203|[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/)| [Solution](), [C++](./algorithms/cpp/removeLinkedListElements/RemoveLinkedListElements.cpp), [Java](./algorithms/java/removeLinkedListElements/RemoveLinkedListElements.java), [Go](./algorithms/golang/removeLinkedListElements/RemoveLinkedListElements.go)|Easy|
|202|[Happy Number](https://leetcode.com/problems/happy-number/)| [Solution](), [C++](./algorithms/cpp/happyNumber/HappyNumber.cpp), [Java](./algorithms/java/happyNumber/HappyNumber.java), [Python](./algorithms/python/HappyNumber/isHappy.py), [Go](./algorithms/golang/happyNumber/HappyNumber.go), [Python](./algorithms/python/HappyNumber/isHappy.py)|Easy|
|201|[Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/)| [Solution](), [C++](./algorithms/cpp/bitwiseANDOfNumbersRange/BitwiseAndOfNumbersRange.cpp), [Java](./algorithms/java/bitwiseANDOfNumbersRange/BitwiseAndOfNumbersRange.java), [Go](./algorithms/golang/bitwiseANDOfNumbersRange/BitwiseAndOfNumbersRange.go)|Medium|
|200|[Number of Islands](https://leetcode.com/problems/number-of-islands/)| [Solution](), [C++](./algorithms/cpp/numberOfIslands/NumberOfIslands.cpp), [Java](./algorithms/java/numberOfIslands/NumberOfIslands.java), [Python](./algorithms/python/NumberOfIslands/numIslands.py), [Go](./algorithms/golang/numberOfIslands/NumberOfIslands.go), [Python](./algorithms/python/NumberOfIslands/numIslands.py)|Medium|
|199|[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/)| [Solution](), [C++](./algorithms/cpp/binaryTreeRightSideView/binaryTreeRightSideView.cpp), [Java](./algorithms/java/binaryTreeRightSideView/binaryTreeRightSideView.java), [Go](./algorithms/golang/binaryTreeRightSideView/binaryTreeRightSideView.go)|Medium|
|198|[House Robber](https://leetcode.com/problems/house-robber/)| [Solution](), [C++](./algorithms/cpp/houseRobber/houseRobber.cpp), [Java](./algorithms/java/houseRobber/houseRobber.java), [Python](./algorithms/python/HouseRobber/rob.py), [Go](./algorithms/golang/houseRobber/houseRobber.go), [Python](./algorithms/python/HouseRobber/rob.py)|Easy|
|191|[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)| [Solution](), [C++](./algorithms/cpp/numberOf1Bits/numberOf1Bits.cpp), [Java](./algorithms/java/numberOf1Bits/numberOf1Bits.java), [Go](./algorithms/golang/numberOf1Bits/numberOf1Bits.go)|Easy|
|190|[Reverse Bits](https://leetcode.com/problems/reverse-bits/)| [Solution](), [C++](./algorithms/cpp/reverseBits/reverseBits.cpp), [Java](./algorithms/java/reverseBits/reverseBits.java), [Go](./algorithms/golang/reverseBits/reverseBits.go)|Easy|
|189|[Rotate Array](https://leetcode.com/problems/rotate-array/)| [Solution](), [C++](./algorithms/cpp/rotateArray/rotateArray.cpp), [Java](./algorithms/java/rotateArray/rotateArray.java), [Java](./algorithms/java/src/rotateArray/RotateArray.java), [Go](./algorithms/golang/rotateArray/rotateArray.java), [Java](./algorithms/java/src/rotateArray/RotateArray.go)|Easy|
|188|[Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/)| [Solution](), [C++](./algorithms/cpp/bestTimeToBuyAndSellStock/bestTimeToBuyAndSellStock.IV.cpp), [Java](./algorithms/java/bestTimeToBuyAndSellStock/bestTimeToBuyAndSellStock.IV.java), [Go](./algorithms/golang/bestTimeToBuyAndSellStock/bestTimeToBuyAndSellStock.IV.go)|Hard|
|187|[Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/)| [Solution](), [C++](./algorithms/cpp/repeatedDNASequences/repeatedDNASequences.cpp), [Java](./algorithms/java/repeatedDNASequences/repeatedDNASequences.java), [Go](./algorithms/golang/repeatedDNASequences/repeatedDNASequences.go)|Medium|
|186|[Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii/) 🔒 | [Solution](), [C++](./algorithms/cpp/reverseWordsInAString/reverseWordsInAString.II.cpp), [Java](./algorithms/java/reverseWordsInAString/reverseWordsInAString.II.java), [Go](./algorithms/golang/reverseWordsInAString/reverseWordsInAString.II.go)|Medium|
|179|[Largest Number](https://leetcode.com/problems/largest-number/) | [Solution](), [C++](./algorithms/cpp/largestNumber/largestNumber.cpp), [Java](./algorithms/java/largestNumber/largestNumber.java), [Go](./algorithms/golang/largestNumber/largestNumber.go)|Medium|
|174|[Dungeon Game](https://leetcode.com/problems/dungeon-game/) | [Solution](), [C++](./algorithms/cpp/dungeonGame/dungeonGame.cpp), [Java](./algorithms/java/dungeonGame/dungeonGame.java), [Go](./algorithms/golang/dungeonGame/dungeonGame.go)|Hard|
|173|[Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/) | [Solution](), [C++](./algorithms/cpp/binarySearchTreeIterator/binarySearchTreeIterator.cpp), [Java](./algorithms/java/binarySearchTreeIterator/binarySearchTreeIterator.java), [Java](./algorithms/java/src/binarySearchTreeIterator/binarySearchTreeIterator.java), [Python](./algorithms/python/BinarySearchTreeIterator/BSTIterator.py), [Go](./algorithms/golang/binarySearchTreeIterator/binarySearchTreeIterator.java), [Java](./algorithms/java/src/binarySearchTreeIterator/binarySearchTreeIterator.go), [Python](./algorithms/python/BinarySearchTreeIterator/BSTIterator.py)|Medium|
|172|[Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/) | [Solution](), [C++](./algorithms/cpp/factorialTrailingZeroes/factorialTrailingZeroes.cpp), [Java](./algorithms/java/factorialTrailingZeroes/factorialTrailingZeroes.java), [Go](./algorithms/golang/factorialTrailingZeroes/factorialTrailingZeroes.go)|Easy|
|171|[Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/) | [Solution](), [C++](./algorithms/cpp/excelSheetColumnNumber/excelSheetColumnNumber.cpp), [Java](./algorithms/java/excelSheetColumnNumber/excelSheetColumnNumber.java), [Go](./algorithms/golang/excelSheetColumnNumber/excelSheetColumnNumber.go)|Easy|
|170|[Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design/) 🔒 | [Solution](), [C++](./algorithms/cpp/twoSum/twoSum.III.cpp), [Java](./algorithms/java/twoSum/twoSum.III.java), [Go](./algorithms/golang/twoSum/twoSum.III.go)|Easy|
|169|[Majority Element](https://leetcode.com/problems/majority-element/) | [Solution](), [C++](./algorithms/cpp/majorityElement/majorityElement.cpp), [Java](./algorithms/java/majorityElement/majorityElement.java), [Go](./algorithms/golang/majorityElement/majorityElement.go)|Easy|
|168|[Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/) | [Solution](), [C++](./algorithms/cpp/excelSheetColumnTitle/excelSheetColumnTitle.cpp), [Java](./algorithms/java/excelSheetColumnTitle/excelSheetColumnTitle.java), [Go](./algorithms/golang/excelSheetColumnTitle/excelSheetColumnTitle.go)|Easy|
|167|[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) 🔒 | [Solution](), [C++](./algorithms/cpp/twoSum/twoSum.II.cpp), [Java](./algorithms/java/twoSum/twoSum.II.java), [Go](./algorithms/golang/twoSum/twoSum.II.go)|Medium|
|166|[Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal/) | [Solution](), [C++](./algorithms/cpp/fractionToRecurringDecimal/fractionToRecurringDecimal.cpp), [Java](./algorithms/java/fractionToRecurringDecimal/fractionToRecurringDecimal.java), [Go](./algorithms/golang/fractionToRecurringDecimal/fractionToRecurringDecimal.go)|Medium|
|165|[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/) | [Solution](), [C++](./algorithms/cpp/compareVersionNumbers/compareVersionNumbers.cpp), [Java](./algorithms/java/compareVersionNumbers/compareVersionNumbers.java), [Go](./algorithms/golang/compareVersionNumbers/compareVersionNumbers.go)|Easy|
|164|[Maximum Gap](https://leetcode.com/problems/maximum-gap/) | [Solution](), [C++](./algorithms/cpp/maximumGap/maximumGap.cpp), [Java](./algorithms/java/maximumGap/maximumGap.java), [Go](./algorithms/golang/maximumGap/maximumGap.go)|Hard|
|163|[Missing Ranges](https://leetcode.com/problems/missing-ranges/) 🔒 | [Solution](), [C++](./algorithms/cpp/missingRanges/missingRanges.cpp), [Java](./algorithms/java/missingRanges/missingRanges.java), [Go](./algorithms/golang/missingRanges/missingRanges.go)|Medium|
|162|[Find Peak Element](https://leetcode.com/problems/find-peak-element/) | [Solution](), [C++](./algorithms/cpp/findPeakElement/findPeakElement.cpp), [Java](./algorithms/java/findPeakElement/findPeakElement.java), [Java](./algorithms/java/src/findPeakElement/findPeakElement.java), [Go](./algorithms/golang/findPeakElement/findPeakElement.java), [Java](./algorithms/java/src/findPeakElement/findPeakElement.go)|Medium|
|161|[One Edit Distance](https://leetcode.com/problems/one-edit-distance/)🔒 | [Solution](), [C++](./algorithms/cpp/oneEditDistance/oneEditDistance.cpp), [Java](./algorithms/java/oneEditDistance/oneEditDistance.java), [Go](./algorithms/golang/oneEditDistance/oneEditDistance.go)|Medium|
|160|[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | [Solution](), [C++](./algorithms/cpp/intersectionOfTwoLinkedLists/intersectionOfTwoLinkedLists.cpp), [Java](./algorithms/java/intersectionOfTwoLinkedLists/intersectionOfTwoLinkedLists.java), [Go](./algorithms/golang/intersectionOfTwoLinkedLists/intersectionOfTwoLinkedLists.go)|Easy|
|159|[Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/) 🔒 | [Solution](), [C++](./algorithms/cpp/longestSubstringWithAtMostTwoDistinctCharacters/longestSubstringWithAtMostTwoDistinctCharacters.cpp), [Java](./algorithms/java/longestSubstringWithAtMostTwoDistinctCharacters/longestSubstringWithAtMostTwoDistinctCharacters.java), [Go](./algorithms/golang/longestSubstringWithAtMostTwoDistinctCharacters/longestSubstringWithAtMostTwoDistinctCharacters.go)|Hard|
|158|[Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/) 🔒 | [Solution](), [C++](./algorithms/cpp/readNCharactersGivenRead4/readNCharactersGivenRead4.II.cpp), [Java](./algorithms/java/readNCharactersGivenRead4/readNCharactersGivenRead4.II.java), [Go](./algorithms/golang/readNCharactersGivenRead4/readNCharactersGivenRead4.II.go)|Hard|
|157|[Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/) 🔒 | [Solution](), [C++](./algorithms/cpp/readNCharactersGivenRead4/readNCharactersGivenRead4.cpp), [Java](./algorithms/java/readNCharactersGivenRead4/readNCharactersGivenRead4.java), [Go](./algorithms/golang/readNCharactersGivenRead4/readNCharactersGivenRead4.go)|Easy|
|156|[Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down/) 🔒 | [Solution](), [C++](./algorithms/cpp/binaryTreeUpsideDown/binaryTreeUpsideDown.cpp), [Java](./algorithms/java/binaryTreeUpsideDown/binaryTreeUpsideDown.java), [Go](./algorithms/golang/binaryTreeUpsideDown/binaryTreeUpsideDown.go)|Medium|
|155|[Min Stack](https://leetcode.com/problems/min-stack/)| [Solution](), [C++](./algorithms/cpp/minStack/minStack.cpp), [Java](./algorithms/java/minStack/minStack.java), [Java](./algorithms/java/src/minStack/MinStack.java), [Go](./algorithms/golang/minStack/minStack.java), [Java](./algorithms/java/src/minStack/MinStack.go)|Easy|
|154|[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/)| [Solution](), [C++](./algorithms/cpp/findMinimumInRotatedSortedArray/findMinimumInRotatedSortedArray.II.cpp), [Java](./algorithms/java/findMinimumInRotatedSortedArray/findMinimumInRotatedSortedArray.II.java), [Go](./algorithms/golang/findMinimumInRotatedSortedArray/findMinimumInRotatedSortedArray.II.go)|Hard|
|153|[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)| [Solution](), [C++](./algorithms/cpp/findMinimumInRotatedSortedArray/findMinimumInRotatedSortedArray.cpp), [Java](./algorithms/java/findMinimumInRotatedSortedArray/findMinimumInRotatedSortedArray.java), [Java](./algorithms/java/src/findMinimumInRotatedSortedArray/findMinimumInRotatedSortedArray.java), [Go](./algorithms/golang/findMinimumInRotatedSortedArray/findMinimumInRotatedSortedArray.java), [Java](./algorithms/java/src/findMinimumInRotatedSortedArray/findMinimumInRotatedSortedArray.go)|Medium|
|152|[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)| [Solution](), [C++](./algorithms/cpp/maximumProductSubarray/maximumProductSubarray.cpp), [Java](./algorithms/java/maximumProductSubarray/maximumProductSubarray.java), [Go](./algorithms/golang/maximumProductSubarray/maximumProductSubarray.go)|Medium|
|151|[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/)| [Solution](), [C++](./algorithms/cpp/reverseWordsInAString/reverseWordsInAString.cpp), [Java](./algorithms/java/reverseWordsInAString/reverseWordsInAString.java), [Java](./algorithms/java/src/reverseWordsInAString/ReverseWordsInAString.java), [Go](./algorithms/golang/reverseWordsInAString/reverseWordsInAString.java), [Java](./algorithms/java/src/reverseWordsInAString/ReverseWordsInAString.go)|Medium|
|150|[Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/)| [Solution](), [C++](./algorithms/cpp/evaluateReversePolishNotation/evaluateReversePolishNotation.cpp), [Java](./algorithms/java/evaluateReversePolishNotation/evaluateReversePolishNotation.java), [Go](./algorithms/golang/evaluateReversePolishNotation/evaluateReversePolishNotation.go)|Medium|
|149|[Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/)| [Solution](), [C++](./algorithms/cpp/maxPointsOnALine/maxPointsOnALine.cpp), [Java](./algorithms/java/maxPointsOnALine/maxPointsOnALine.java), [Go](./algorithms/golang/maxPointsOnALine/maxPointsOnALine.go)|Hard|
|148|[Sort List](https://leetcode.com/problems/sort-list/)| [Solution](), [C++](./algorithms/cpp/sortList/sortList.cpp), [Java](./algorithms/java/sortList/sortList.java), [Python](./algorithms/python/SortList/sortList.py), [Go](./algorithms/golang/sortList/sortList.go), [Python](./algorithms/python/SortList/sortList.py)|Medium|
|147|[Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/)| [Solution](), [C++](./algorithms/cpp/insertionSortList/insertionSortList.cpp), [Java](./algorithms/java/insertionSortList/insertionSortList.java), [Python](./algorithms/python/InsertionSortList/insertionSortList.py), [Go](./algorithms/golang/insertionSortList/insertionSortList.go), [Python](./algorithms/python/InsertionSortList/insertionSortList.py)|Medium|
|146|[LRU Cache](https://leetcode.com/problems/lru-cache/)| [Solution](), [C++](./algorithms/cpp/LRUCache/LRUCache.cpp), [Java](./algorithms/java/LRUCache/LRUCache.java), [Java](./algorithms/java/src/lruCache/LRUCache.java), [Go](./algorithms/golang/LRUCache/LRUCache.java), [Java](./algorithms/java/src/lruCache/LRUCache.go)|Hard|
|145|[Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/)| [Solution](), [C++](./algorithms/cpp/binaryTreePostorderTraversal/binaryTreePostorderTraversal.cpp), [Java](./algorithms/java/binaryTreePostorderTraversal/binaryTreePostorderTraversal.java), [Python](./algorithms/python/BinaryTreePostorderTraversal/postorderTraversal.py), [Go](./algorithms/golang/binaryTreePostorderTraversal/binaryTreePostorderTraversal.go), [Python](./algorithms/python/BinaryTreePostorderTraversal/postorderTraversal.py)|Hard|
|144|[Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/)| [Solution](), [C++](./algorithms/cpp/binaryTreePreorderTraversal/binaryTreePreorderTraversal.cpp), [Java](./algorithms/java/binaryTreePreorderTraversal/binaryTreePreorderTraversal.java), [Java](./algorithms/java/src/binaryTreePreorderTraversal/binaryTreePreorderTraversal.java), [Go](./algorithms/golang/binaryTreePreorderTraversal/binaryTreePreorderTraversal.java), [Java](./algorithms/java/src/binaryTreePreorderTraversal/binaryTreePreorderTraversal.go)|Medium|
|143|[Reorder List](https://leetcode.com/problems/reorder-list/)| [Solution](), [C++](./algorithms/cpp/reorderList/reorderList.cpp), [Java](./algorithms/java/reorderList/reorderList.java), [Python](./algorithms/python/ReorderList/reorderList.py), [Go](./algorithms/golang/reorderList/reorderList.go), [Python](./algorithms/python/ReorderList/reorderList.py)|Medium|
|142|[Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)| [Solution](), [C++](./algorithms/cpp/linkedListCycle/linkedListCycle.II.cpp), [Java](./algorithms/java/linkedListCycle/linkedListCycle.II.java), [Python](./algorithms/python/LinkedListCycleII/detectCycle.py), [Go](./algorithms/golang/linkedListCycle/linkedListCycle.II.go), [Python](./algorithms/python/LinkedListCycleII/detectCycle.py)|Medium|
|141|[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)| [Solution](), [C++](./algorithms/cpp/linkedListCycle/linkedListCycle.cpp), [Java](./algorithms/java/linkedListCycle/linkedListCycle.java), [Go](./algorithms/golang/linkedListCycle/linkedListCycle.go)|Medium|
|140|[Word Break II](https://leetcode.com/problems/word-break-ii/)| [Solution](), [C++](./algorithms/cpp/wordBreak/wordBreak.II.cpp), [Java](./algorithms/java/wordBreak/wordBreak.II.java), [Go](./algorithms/golang/wordBreak/wordBreak.II.go)|Hard|
|139|[Word Break](https://leetcode.com/problems/word-break/)| [Solution](), [C++](./algorithms/cpp/wordBreak/wordBreak.cpp), [Java](./algorithms/java/wordBreak/wordBreak.java), [Go](./algorithms/golang/wordBreak/wordBreak.go)|Medium|
|138|[Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/)| [Solution](), [C++](./algorithms/cpp/copyListWithRandomPointer/copyListWithRandomPointer.cpp), [Java](./algorithms/java/copyListWithRandomPointer/copyListWithRandomPointer.java), [Python](./algorithms/python/CopyListWithRandomPointer/copyRandomList.py), [Go](./algorithms/golang/copyListWithRandomPointer/copyListWithRandomPointer.go), [Python](./algorithms/python/CopyListWithRandomPointer/copyRandomList.py)|Hard|
|137|[Single Number II](https://leetcode.com/problems/single-number-ii/)| [Solution](), [C++](./algorithms/cpp/singleNumber/singleNumber.II.cpp), [Java](./algorithms/java/singleNumber/singleNumber.II.java), [Go](./algorithms/golang/singleNumber/singleNumber.II.go)|Medium|
|136|[Single Number](https://leetcode.com/problems/single-number/)| [Solution](), [C++](./algorithms/cpp/singleNumber/singleNumber.cpp), [Java](./algorithms/java/singleNumber/singleNumber.java), [Go](./algorithms/golang/singleNumber/singleNumber.go)|Medium|
|135|[Candy](https://leetcode.com/problems/candy/)| [Solution](), [C++](./algorithms/cpp/candy/candy.cpp), [Java](./algorithms/java/candy/candy.java), [Go](./algorithms/golang/candy/candy.go)|Hard|
|134|[Gas Station](https://leetcode.com/problems/gas-station/)| [Solution](), [C++](./algorithms/cpp/gasStation/gasStation.cpp), [Java](./algorithms/java/gasStation/gasStation.java), [Go](./algorithms/golang/gasStation/gasStation.go)|Medium|
|133|[Clone Graph](https://leetcode.com/problems/clone-graph/)| [Solution](), [C++](./algorithms/cpp/cloneGraph/cloneGraph.cpp), [Java](./algorithms/java/cloneGraph/cloneGraph.java), [Go](./algorithms/golang/cloneGraph/cloneGraph.go)|Medium|
|132|[Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii/)| [Solution](), [C++](./algorithms/cpp/palindromePartitioning/palindromePartitioning.II.cpp), [Java](./algorithms/java/palindromePartitioning/palindromePartitioning.II.java), [Go](./algorithms/golang/palindromePartitioning/palindromePartitioning.II.go)|Hard|
|131|[Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/)| [Solution](), [C++](./algorithms/cpp/palindromePartitioning/palindromePartitioning.cpp), [Java](./algorithms/java/palindromePartitioning/palindromePartitioning.java), [Go](./algorithms/golang/palindromePartitioning/palindromePartitioning.go)|Medium|
|130|[Surrounded Regions](https://leetcode.com/problems/surrounded-regions/)| [Solution](), [C++](./algorithms/cpp/surroundedRegions/surroundedRegions.cpp), [Java](./algorithms/java/surroundedRegions/surroundedRegions.java), [Go](./algorithms/golang/surroundedRegions/surroundedRegions.go)|Medium|
|129|[Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/)| [Solution](), [C++](./algorithms/cpp/sumRootToLeafNumber/sumRootToLeafNumber.cpp), [Java](./algorithms/java/sumRootToLeafNumber/sumRootToLeafNumber.java), [Python](./algorithms/python/SumRootToLeafNumbers/sumNumbers.py), [Go](./algorithms/golang/sumRootToLeafNumber/sumRootToLeafNumber.go), [Python](./algorithms/python/SumRootToLeafNumbers/sumNumbers.py)|Medium|
|128|[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)| [Solution](), [C++](./algorithms/cpp/longestConsecutiveSequence/longestConsecutiveSequence.cpp), [Java](./algorithms/java/longestConsecutiveSequence/longestConsecutiveSequence.java), [Go](./algorithms/golang/longestConsecutiveSequence/longestConsecutiveSequence.go)|Hard|
|127|[Word Ladder](https://leetcode.com/problems/word-ladder/)| [Solution](), [C++](./algorithms/cpp/wordLadder/wordLadder.cpp), [Java](./algorithms/java/wordLadder/wordLadder.java), [Go](./algorithms/golang/wordLadder/wordLadder.go)|Medium|
|126|[Word Ladder II](https://leetcode.com/problems/word-ladder-ii/)| [Solution](), [C++](./algorithms/cpp/wordLadder/wordLadder.II.cpp), [Java](./algorithms/java/wordLadder/wordLadder.II.java), [Go](./algorithms/golang/wordLadder/wordLadder.II.go)|Hard|
|125|[Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)| [Solution](), [C++](./algorithms/cpp/validPalindrome/validPalindrome.cpp), [Java](./algorithms/java/validPalindrome/validPalindrome.java), [Java](./algorithms/java/src/validPalindrome/ValidPalindrome.java), [Go](./algorithms/golang/validPalindrome/validPalindrome.java), [Java](./algorithms/java/src/validPalindrome/ValidPalindrome.go)|Easy|
|124|[Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)| [Solution](), [C++](./algorithms/cpp/binaryTreeMaximumPathSum/binaryTreeMaximumPathSum.cpp), [Java](./algorithms/java/binaryTreeMaximumPathSum/binaryTreeMaximumPathSum.java), [Java](./algorithms/java/src/binaryTreeMaximumPathSum/binaryTreeMaximumPathSum.java), [Go](./algorithms/golang/binaryTreeMaximumPathSum/binaryTreeMaximumPathSum.java), [Java](./algorithms/java/src/binaryTreeMaximumPathSum/binaryTreeMaximumPathSum.go)|Hard|
|123|[Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/)| [Solution](), [C++](./algorithms/cpp/bestTimeToBuyAndSellStock/bestTimeToBuyAndSellStock.III.cpp), [Java](./algorithms/java/bestTimeToBuyAndSellStock/bestTimeToBuyAndSellStock.III.java), [Go](./algorithms/golang/bestTimeToBuyAndSellStock/bestTimeToBuyAndSellStock.III.go)|Hard|
|122|[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/)| [Solution](), [C++](./algorithms/cpp/bestTimeToBuyAndSellStock/bestTimeToBuyAndSellStock.II.cpp), [Java](./algorithms/java/bestTimeToBuyAndSellStock/bestTimeToBuyAndSellStock.II.java), [Go](./algorithms/golang/bestTimeToBuyAndSellStock/bestTimeToBuyAndSellStock.II.go)|Medium|
|121|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)| [Solution](), [C++](./algorithms/cpp/bestTimeToBuyAndSellStock/bestTimeToBuyAndSellStock.cpp), [Java](./algorithms/java/bestTimeToBuyAndSellStock/bestTimeToBuyAndSellStock.java), [Go](./algorithms/golang/bestTimeToBuyAndSellStock/bestTimeToBuyAndSellStock.go)|Medium|
|120|[Triangle](https://leetcode.com/problems/triangle/)| [Solution](), [C++](./algorithms/cpp/triangle/triangle.cpp), [Java](./algorithms/java/triangle/triangle.java), [Java](./algorithms/java/src/dynamicProgramming/triangle/triangle.java), [Go](./algorithms/golang/triangle/triangle.java), [Java](./algorithms/java/src/dynamicProgramming/triangle/triangle.go)|Medium|
|119|[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/)| [Solution](), [C++](./algorithms/cpp/pascalTriangle/pascalTriangle.II.cpp), [Java](./algorithms/java/pascalTriangle/pascalTriangle.II.java), [Go](./algorithms/golang/pascalTriangle/pascalTriangle.II.go)|Easy|
|118|[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/)| [Solution](), [C++](./algorithms/cpp/pascalTriangle/pascalTriangle.cpp), [Java](./algorithms/java/pascalTriangle/pascalTriangle.java), [Go](./algorithms/golang/pascalTriangle/pascalTriangle.go)|Easy|
|117|[Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/)| [Solution](), [C++](./algorithms/cpp/populatingNextRightPointersInEachNode/populatingNextRightPointersInEachNode.II.cpp), [Java](./algorithms/java/populatingNextRightPointersInEachNode/populatingNextRightPointersInEachNode.II.java), [Python](./algorithms/python/PopulatingNextRightPointersInEachNodeII/connect.py), [Go](./algorithms/golang/populatingNextRightPointersInEachNode/populatingNextRightPointersInEachNode.II.go), [Python](./algorithms/python/PopulatingNextRightPointersInEachNodeII/connect.py)|Hard|
|116|[Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/)| [Solution](), [C++](./algorithms/cpp/populatingNextRightPointersInEachNode/populatingNextRightPointersInEachNode.cpp), [Java](./algorithms/java/populatingNextRightPointersInEachNode/populatingNextRightPointersInEachNode.java), [Python](./algorithms/python/PopulatingNextRightPointersInEachNode/connect.py), [Go](./algorithms/golang/populatingNextRightPointersInEachNode/populatingNextRightPointersInEachNode.go), [Python](./algorithms/python/PopulatingNextRightPointersInEachNode/connect.py)|Medium|
|115|[Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/)| [Solution](), [C++](./algorithms/cpp/distinctSubsequences/distinctSubsequences.cpp), [Java](./algorithms/java/distinctSubsequences/distinctSubsequences.java), [Go](./algorithms/golang/distinctSubsequences/distinctSubsequences.go)|Hard|
|114|[Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/)| [Solution](), [C++](./algorithms/cpp/flattenBinaryTreeToLinkedList/flattenBinaryTreeToLinkedList.cpp), [Java](./algorithms/java/flattenBinaryTreeToLinkedList/flattenBinaryTreeToLinkedList.java), [Python](./algorithms/python/FlattenBinaryTreeToLinkedList/flatten.py), [Go](./algorithms/golang/flattenBinaryTreeToLinkedList/flattenBinaryTreeToLinkedList.go), [Python](./algorithms/python/FlattenBinaryTreeToLinkedList/flatten.py)|Medium|
|113|[Path Sum II](https://leetcode.com/problems/path-sum-ii/)| [Solution](), [C++](./algorithms/cpp/pathSum/pathSum.II.cpp), [Java](./algorithms/java/pathSum/pathSum.II.java), [Python](./algorithms/python/PathSumII/pathSum.py), [Go](./algorithms/golang/pathSum/pathSum.II.go), [Python](./algorithms/python/PathSumII/pathSum.py)|Medium|
|112|[Path Sum](https://leetcode.com/problems/path-sum/)| [Solution](), [C++](./algorithms/cpp/pathSum/pathSum.cpp), [Java](./algorithms/java/pathSum/pathSum.java), [Go](./algorithms/golang/pathSum/pathSum.go)|Easy|
|111|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/)| [Solution](), [C++](./algorithms/cpp/minimumDepthOfBinaryTree/minimumDepthOfBinaryTree.cpp), [Java](./algorithms/java/minimumDepthOfBinaryTree/minimumDepthOfBinaryTree.java), [Go](./algorithms/golang/minimumDepthOfBinaryTree/minimumDepthOfBinaryTree.go)|Easy|
|110|[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/)| [Solution](), [C++](./algorithms/cpp/balancedBinaryTree/balancedBinaryTree.cpp), [Java](./algorithms/java/balancedBinaryTree/balancedBinaryTree.java), [Java](./algorithms/java/src/balancedBinaryTree/balancedBinaryTree.java), [Go](./algorithms/golang/balancedBinaryTree/balancedBinaryTree.java), [Java](./algorithms/java/src/balancedBinaryTree/balancedBinaryTree.go)|Easy|
|109|[Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/)| [Solution](), [C++](./algorithms/cpp/convertSortedListToBinarySearchTree/convertSortedListToBinarySearchTree.cpp), [Java](./algorithms/java/convertSortedListToBinarySearchTree/convertSortedListToBinarySearchTree.java), [Go](./algorithms/golang/convertSortedListToBinarySearchTree/convertSortedListToBinarySearchTree.go)|Medium|
|108|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)| [Solution](), [C++](./algorithms/cpp/convertSortedArrayToBinarySearchTree/convertSortedArrayToBinarySearchTree.cpp), [Java](./algorithms/java/convertSortedArrayToBinarySearchTree/convertSortedArrayToBinarySearchTree.java), [Go](./algorithms/golang/convertSortedArrayToBinarySearchTree/convertSortedArrayToBinarySearchTree.go)|Medium|
|107|[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/)| [Solution](), [C++](./algorithms/cpp/binaryTreeLevelOrderTraversal/binaryTreeLevelOrderTraversal.II.cpp), [Java](./algorithms/java/binaryTreeLevelOrderTraversal/binaryTreeLevelOrderTraversal.II.java), [Go](./algorithms/golang/binaryTreeLevelOrderTraversal/binaryTreeLevelOrderTraversal.II.go)|Easy|
|106|[Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)| [Solution](), [C++](./algorithms/cpp/constructBinaryTreeFromInorderAndPostorderTraversal/constructBinaryTreeFromInorderAndPostorderTraversal.cpp), [Java](./algorithms/java/constructBinaryTreeFromInorderAndPostorderTraversal/constructBinaryTreeFromInorderAndPostorderTraversal.java), [Python](./algorithms/python/ConstructBinaryTreeFromInorderAndPostorderTraversal/buildTree.py), [Go](./algorithms/golang/constructBinaryTreeFromInorderAndPostorderTraversal/constructBinaryTreeFromInorderAndPostorderTraversal.go), [Python](./algorithms/python/ConstructBinaryTreeFromInorderAndPostorderTraversal/buildTree.py)|Medium|
|105|[Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)| [Solution](), [C++](./algorithms/cpp/constructBinaryTreeFromPreorderAndInorderTraversal/constructBinaryTreeFromPreorderAndInorderTraversal.cpp), [Java](./algorithms/java/constructBinaryTreeFromPreorderAndInorderTraversal/constructBinaryTreeFromPreorderAndInorderTraversal.java), [Python](./algorithms/python/ConstructBinaryTreeFromPreorderAndInorderTraversal/buildTree.py), [Go](./algorithms/golang/constructBinaryTreeFromPreorderAndInorderTraversal/constructBinaryTreeFromPreorderAndInorderTraversal.go), [Python](./algorithms/python/ConstructBinaryTreeFromPreorderAndInorderTraversal/buildTree.py)|Medium|
|104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)| [Solution](), [C++](./algorithms/cpp/maximumDepthOfBinaryTree/maximumDepthOfBinaryTree.cpp), [Java](./algorithms/java/maximumDepthOfBinaryTree/maximumDepthOfBinaryTree.java), [Java](./algorithms/java/src/maximumDepthOfBinaryTree/maximumDepthOfBinaryTree.java), [Go](./algorithms/golang/maximumDepthOfBinaryTree/maximumDepthOfBinaryTree.java), [Java](./algorithms/java/src/maximumDepthOfBinaryTree/maximumDepthOfBinaryTree.go)|Easy|
|103|[Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)| [Solution](), [C++](./algorithms/cpp/binaryTreeZigzagLevelOrderTraversal/binaryTreeZigzagLevelOrderTraversal.cpp), [Java](./algorithms/java/binaryTreeZigzagLevelOrderTraversal/binaryTreeZigzagLevelOrderTraversal.java), [Python](./algorithms/python/BinaryTreeZigzagLevelOrderTraversal/zigzagLevelOrder.py), [Go](./algorithms/golang/binaryTreeZigzagLevelOrderTraversal/binaryTreeZigzagLevelOrderTraversal.go), [Python](./algorithms/python/BinaryTreeZigzagLevelOrderTraversal/zigzagLevelOrder.py)|Medium|
|102|[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)| [Solution](), [C++](./algorithms/cpp/binaryTreeLevelOrderTraversal/binaryTreeLevelOrderTraversal.cpp), [Java](./algorithms/java/binaryTreeLevelOrderTraversal/binaryTreeLevelOrderTraversal.java), [Java](./algorithms/java/src/binaryTreeLevelOrderTraversal/binaryTreeLevelOrderTraversal.java), [Go](./algorithms/golang/binaryTreeLevelOrderTraversal/binaryTreeLevelOrderTraversal.java), [Java](./algorithms/java/src/binaryTreeLevelOrderTraversal/binaryTreeLevelOrderTraversal.go)|Easy|
|101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)| [Solution](), [C++](./algorithms/cpp/symmetricTree/symmetricTree.cpp), [Java](./algorithms/java/symmetricTree/symmetricTree.java), [Go](./algorithms/golang/symmetricTree/symmetricTree.go)|Easy|
|100|[Same Tree](https://leetcode.com/problems/same-tree/)| [Solution](), [C++](./algorithms/cpp/sameTree/sameTree.cpp), [Java](./algorithms/java/sameTree/sameTree.java), [Go](./algorithms/golang/sameTree/sameTree.go)|Easy|
|99|[Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/)| [Solution](), [C++](./algorithms/cpp/recoverBinarySearchTree/recoverBinarySearchTree.cpp), [Java](./algorithms/java/recoverBinarySearchTree/recoverBinarySearchTree.java), [Go](./algorithms/golang/recoverBinarySearchTree/recoverBinarySearchTree.go)|Hard|
|98|[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)| [Solution](), [C++](./algorithms/cpp/validateBinarySearchTree/validateBinarySearchTree.cpp), [Java](./algorithms/java/validateBinarySearchTree/validateBinarySearchTree.java), [Java](./algorithms/java/src/validateBinarySearchTree/validateBinarySearchTree.java), [Python](./algorithms/python/ValidateBinarySearchTree/isValidBST.py), [Go](./algorithms/golang/validateBinarySearchTree/validateBinarySearchTree.java), [Java](./algorithms/java/src/validateBinarySearchTree/validateBinarySearchTree.go), [Python](./algorithms/python/ValidateBinarySearchTree/isValidBST.py)|Medium|
|97|[Interleaving String](https://leetcode.com/problems/interleaving-string/)| [Solution](), [C++](./algorithms/cpp/interleavingString/interleavingString.cpp), [Java](./algorithms/java/interleavingString/interleavingString.java), [Go](./algorithms/golang/interleavingString/interleavingString.go)|Hard|
|96|[Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/)| [Solution](), [C++](./algorithms/cpp/uniqueBinarySearchTrees/uniqueBinarySearchTrees.cpp), [Java](./algorithms/java/uniqueBinarySearchTrees/uniqueBinarySearchTrees.java), [Python](./algorithms/python/UniqueBinarySearchTrees/numTrees.py), [Go](./algorithms/golang/uniqueBinarySearchTrees/uniqueBinarySearchTrees.go), [Python](./algorithms/python/UniqueBinarySearchTrees/numTrees.py)|Medium|
|95|[Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/)| [Solution](), [C++](./algorithms/cpp/uniqueBinarySearchTrees/uniqueBinarySearchTrees.II.cpp), [Java](./algorithms/java/uniqueBinarySearchTrees/uniqueBinarySearchTrees.II.java), [Python](./algorithms/python/UniqueBinarySearchTreesII/generateTrees.py), [Go](./algorithms/golang/uniqueBinarySearchTrees/uniqueBinarySearchTrees.II.go), [Python](./algorithms/python/UniqueBinarySearchTreesII/generateTrees.py)|Medium|
|94|[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)| [Solution](), [C++](./algorithms/cpp/binaryTreeInorderTraversal/binaryTreeInorderTraversal.cpp), [Java](./algorithms/java/binaryTreeInorderTraversal/binaryTreeInorderTraversal.java), [Go](./algorithms/golang/binaryTreeInorderTraversal/binaryTreeInorderTraversal.go)|Medium|
|93|[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/)| [Solution](), [C++](./algorithms/cpp/restoreIPAddresses/restoreIPAddresses.cpp), [Java](./algorithms/java/restoreIPAddresses/restoreIPAddresses.java), [Go](./algorithms/golang/restoreIPAddresses/restoreIPAddresses.go)|Medium|
|92|[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/)| [Solution](), [C++](./algorithms/cpp/reverseLinkedList/reverseLinkedList.II.cpp), [Java](./algorithms/java/reverseLinkedList/reverseLinkedList.II.java), [Java](./algorithms/java/src/reverseLinkedListII/ReverseLinkedListII.java), [Python](./algorithms/python/ReverseLinkedListII/reverseBetween.py), [Go](./algorithms/golang/reverseLinkedList/reverseLinkedList.II.java), [Java](./algorithms/java/src/reverseLinkedListII/ReverseLinkedListII.go), [Python](./algorithms/python/ReverseLinkedListII/reverseBetween.py)|Medium|
|91|[Decode Ways](https://leetcode.com/problems/decode-ways/)| [Solution](), [C++](./algorithms/cpp/decodeWays/decodeWays.cpp), [Java](./algorithms/java/decodeWays/decodeWays.java), [Go](./algorithms/golang/decodeWays/decodeWays.go)|Medium|
|90|[Subsets II](https://leetcode.com/problems/subsets-ii/)| [Solution](), [C++](./algorithms/cpp/subsets/subsets.II.cpp), [Java](./algorithms/java/subsets/subsets.II.java), [Java](./algorithms/java/src/subsets/subsetsII.java), [Go](./algorithms/golang/subsets/subsets.II.java), [Java](./algorithms/java/src/subsets/subsetsII.go)|Medium|
|89|[Gray Code](https://leetcode.com/problems/gray-code/)| [Solution](), [C++](./algorithms/cpp/grayCode/grayCode.cpp), [Java](./algorithms/java/grayCode/grayCode.java), [Go](./algorithms/golang/grayCode/grayCode.go)|Medium|
|88|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)| [Solution](), [C++](./algorithms/cpp/mergeTwoSortedArray/mergeTwoSortedArray.cpp), [Java](./algorithms/java/mergeTwoSortedArray/mergeTwoSortedArray.java), [Go](./algorithms/golang/mergeTwoSortedArray/mergeTwoSortedArray.go)|Easy|
|87|[Scramble String](https://leetcode.com/problems/scramble-string/)| [Solution](), [C++](./algorithms/cpp/scrambleString/scrambleString.cpp), [Java](./algorithms/java/scrambleString/scrambleString.java), [Go](./algorithms/golang/scrambleString/scrambleString.go)|Hard|
|86|[Partition List](https://leetcode.com/problems/partition-list/)| [Solution](), [C++](./algorithms/cpp/partitionList/partitionList.cpp), [Java](./algorithms/java/partitionList/partitionList.java), [Python](./algorithms/python/PartitionList/partition.py), [Go](./algorithms/golang/partitionList/partitionList.go), [Python](./algorithms/python/PartitionList/partition.py)|Medium|
|85|[Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/)| [Solution](), [C++](./algorithms/cpp/maximalRectangle/maximalRectangle.cpp), [Java](./algorithms/java/maximalRectangle/maximalRectangle.java), [Go](./algorithms/golang/maximalRectangle/maximalRectangle.go)|Hard|
|84|[Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/)| [Solution](), [C++](./algorithms/cpp/largestRectangleInHistogram/largestRectangleInHistogram.cpp), [Java](./algorithms/java/largestRectangleInHistogram/largestRectangleInHistogram.java), [Go](./algorithms/golang/largestRectangleInHistogram/largestRectangleInHistogram.go)|Hard|
|83|[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)| [Solution](), [C++](./algorithms/cpp/removeDuplicatesFromSortedList/removeDuplicatesFromSortedList.cpp), [Java](./algorithms/java/removeDuplicatesFromSortedList/removeDuplicatesFromSortedList.java), [Go](./algorithms/golang/removeDuplicatesFromSortedList/removeDuplicatesFromSortedList.go)|Easy|
|82|[Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/)| [Solution](), [C++](./algorithms/cpp/removeDuplicatesFromSortedList/removeDuplicatesFromSortedList.II.cpp), [Java](./algorithms/java/removeDuplicatesFromSortedList/removeDuplicatesFromSortedList.II.java), [Python](./algorithms/python/RemoveDuplicatesFromSortedListII/deleteDuplicates.py), [Go](./algorithms/golang/removeDuplicatesFromSortedList/removeDuplicatesFromSortedList.II.go), [Python](./algorithms/python/RemoveDuplicatesFromSortedListII/deleteDuplicates.py)|Medium|
|81|[Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)| [Solution](), [C++](./algorithms/cpp/searchInRotatedSortedArray/searchInRotatedSortedArray.II.cpp), [Java](./algorithms/java/searchInRotatedSortedArray/searchInRotatedSortedArray.II.java), [Go](./algorithms/golang/searchInRotatedSortedArray/searchInRotatedSortedArray.II.go)|Medium|
|80|[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)| [Solution](), [C++](./algorithms/cpp/removeDuplicatesFromSortedArray/removeDuplicatesFromSortedArray.II.cpp), [Java](./algorithms/java/removeDuplicatesFromSortedArray/removeDuplicatesFromSortedArray.II.java), [Go](./algorithms/golang/removeDuplicatesFromSortedArray/removeDuplicatesFromSortedArray.II.go)|Medium|
|79|[Word Search](https://leetcode.com/problems/word-search/)| [Solution](), [C++](./algorithms/cpp/wordSearch/wordSearch.cpp), [Java](./algorithms/java/wordSearch/wordSearch.java), [Go](./algorithms/golang/wordSearch/wordSearch.go)|Medium|
|78|[Subsets](https://leetcode.com/problems/subsets/)| [Solution](), [C++](./algorithms/cpp/subsets/subsets.cpp), [Java](./algorithms/java/subsets/subsets.java), [Java](./algorithms/java/src/subsets/subsets.java), [Python](./algorithms/python/Subsets/subsets.py), [Go](./algorithms/golang/subsets/subsets.java), [Java](./algorithms/java/src/subsets/subsets.go), [Python](./algorithms/python/Subsets/subsets.py)|Medium|
|77|[Combinations](https://leetcode.com/problems/combinations/)| [Solution](), [C++](./algorithms/cpp/combinations/combinations.cpp), [Java](./algorithms/java/combinations/combinations.java), [Go](./algorithms/golang/combinations/combinations.go)|Medium|
|76|[Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/)| [Solution](), [C++](./algorithms/cpp/minimumWindowSubstring/minimumWindowSubstring.cpp), [Java](./algorithms/java/minimumWindowSubstring/minimumWindowSubstring.java), [Go](./algorithms/golang/minimumWindowSubstring/minimumWindowSubstring.go)|Hard|
|75|[Sort Colors](https://leetcode.com/problems/sort-colors/)| [Solution](), [C++](./algorithms/cpp/sortColors/sortColors.cpp), [Java](./algorithms/java/sortColors/sortColors.java), [Go](./algorithms/golang/sortColors/sortColors.go)|Medium|
|74|[Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/)| [Solution](), [C++](./algorithms/cpp/search2DMatrix/search2DMatrix.cpp), [Java](./algorithms/java/search2DMatrix/search2DMatrix.java), [Java](./algorithms/java/src/search2DMatrix/search2DMatrix.java), [Go](./algorithms/golang/search2DMatrix/search2DMatrix.java), [Java](./algorithms/java/src/search2DMatrix/search2DMatrix.go)|Medium|
|73|[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)| [Solution](), [C++](./algorithms/cpp/setMatrixZeroes/setMatrixZeroes.cpp), [Java](./algorithms/java/setMatrixZeroes/setMatrixZeroes.java), [Go](./algorithms/golang/setMatrixZeroes/setMatrixZeroes.go)|Medium|
|72|[Edit Distance](https://leetcode.com/problems/edit-distance/)| [Solution](), [C++](./algorithms/cpp/editDistance/editDistance.cpp), [Java](./algorithms/java/editDistance/editDistance.java), [Go](./algorithms/golang/editDistance/editDistance.go)|Hard|
|71|[Simplify Path](https://leetcode.com/problems/simplify-path/)| [Solution](), [C++](./algorithms/cpp/simplifyPath/simplifyPath.cpp), [Java](./algorithms/java/simplifyPath/simplifyPath.java), [Go](./algorithms/golang/simplifyPath/simplifyPath.go)|Medium|
|70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)| [Solution](), [C++](./algorithms/cpp/climbStairs/climbStairs.cpp), [Java](./algorithms/java/climbStairs/climbStairs.java), [Java](./algorithms/java/src/dynamicProgramming/climbStairs/climbStairs.java), [Go](./algorithms/golang/climbStairs/climbStairs.java), [Java](./algorithms/java/src/dynamicProgramming/climbStairs/climbStairs.go)|Easy|
|69|[Sqrt(x)](https://leetcode.com/problems/sqrtx/)| [Solution](), [C++](./algorithms/cpp/sqrt/sqrt.cpp), [Java](./algorithms/java/sqrt/sqrt.java), [Go](./algorithms/golang/sqrt/sqrt.go)|Medium|
|68|[Text Justification](https://leetcode.com/problems/text-justification/)| [Solution](), [C++](./algorithms/cpp/textJustification/textJustification.cpp), [Java](./algorithms/java/textJustification/textJustification.java), [Go](./algorithms/golang/textJustification/textJustification.go)|Hard|
|67|[Add Binary](https://leetcode.com/problems/add-binary/)| [Solution](), [C++](./algorithms/cpp/addBinary/addBinary.cpp), [Java](./algorithms/java/addBinary/addBinary.java), [Go](./algorithms/golang/addBinary/addBinary.go)|Easy|
|66|[Plus One](https://leetcode.com/problems/plus-one/)| [Solution](), [C++](./algorithms/cpp/plusOne/plusOne.cpp), [Java](./algorithms/java/plusOne/plusOne.java), [Go](./algorithms/golang/plusOne/plusOne.go)|Easy|
|65|[Valid Number](https://leetcode.com/problems/valid-number/)| [Solution](), [C++](./algorithms/cpp/validNumber/validNumber.cpp), [Java](./algorithms/java/validNumber/validNumber.java), [Go](./algorithms/golang/validNumber/validNumber.go)|Easy|
|64|[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/)| [Solution](), [C++](./algorithms/cpp/minimumPathSum/minimumPathSum.cpp), [Java](./algorithms/java/minimumPathSum/minimumPathSum.java), [Java](./algorithms/java/src/dynamicProgramming/minimumPathSum/minimumPathSum.java), [Go](./algorithms/golang/minimumPathSum/minimumPathSum.java), [Java](./algorithms/java/src/dynamicProgramming/minimumPathSum/minimumPathSum.go)|Medium|
|63|[Unique Paths II](https://leetcode.com/problems/unique-paths-ii/)| [Solution](), [C++](./algorithms/cpp/uniquePaths/uniquePaths.II.cpp), [Java](./algorithms/java/uniquePaths/uniquePaths.II.java), [Java](./algorithms/java/src/dynamicProgramming/uniquePaths/uniquePathsII.java), [Go](./algorithms/golang/uniquePaths/uniquePaths.II.java), [Java](./algorithms/java/src/dynamicProgramming/uniquePaths/uniquePathsII.go)|Medium|
|62|[Unique Paths](https://leetcode.com/problems/unique-paths/)| [Solution](), [C++](./algorithms/cpp/uniquePaths/uniquePaths.cpp), [Java](./algorithms/java/uniquePaths/uniquePaths.java), [Java](./algorithms/java/src/dynamicProgramming/uniquePaths/uniquePaths.java), [Go](./algorithms/golang/uniquePaths/uniquePaths.java), [Java](./algorithms/java/src/dynamicProgramming/uniquePaths/uniquePaths.go)|Medium|
|61|[Rotate List](https://leetcode.com/problems/rotate-list/)| [Solution](), [C++](./algorithms/cpp/rotateList/rotateList.cpp), [Java](./algorithms/java/rotateList/rotateList.java), [Go](./algorithms/golang/rotateList/rotateList.go)|Medium|
|60|[Permutation Sequence](https://leetcode.com/problems/permutation-sequence/)| [Solution](), [C++](./algorithms/cpp/permutationSequence/permutationSequence.cpp), [Java](./algorithms/java/permutationSequence/permutationSequence.java), [Go](./algorithms/golang/permutationSequence/permutationSequence.go)|Medium|
|59|[Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/)| [Solution](), [C++](./algorithms/cpp/spiralMatrix/spiralMatrix.II.cpp), [Java](./algorithms/java/spiralMatrix/spiralMatrix.II.java), [Go](./algorithms/golang/spiralMatrix/spiralMatrix.II.go)|Medium|
|58|[Length of Last Word](https://leetcode.com/problems/length-of-last-word/)| [Solution](), [C++](./algorithms/cpp/lengthOfLastWord/lengthOfLastWord.cpp), [Java](./algorithms/java/lengthOfLastWord/lengthOfLastWord.java), [Java](./algorithms/java/src/lengthOfLastWord/LengthOfLastWord.java), [Go](./algorithms/golang/lengthOfLastWord/lengthOfLastWord.java), [Java](./algorithms/java/src/lengthOfLastWord/LengthOfLastWord.go)|Easy|
|57|[Insert Interval](https://leetcode.com/problems/insert-interval/)| [Solution](), [C++](./algorithms/cpp/insertInterval/insertInterval.cpp), [Java](./algorithms/java/insertInterval/insertInterval.java), [Go](./algorithms/golang/insertInterval/insertInterval.go)|Hard|
|56|[Merge Intervals](https://leetcode.com/problems/merge-intervals/)| [Solution](), [C++](./algorithms/cpp/mergeIntervals/mergeIntervals.cpp), [Java](./algorithms/java/mergeIntervals/mergeIntervals.java), [Go](./algorithms/golang/mergeIntervals/mergeIntervals.go)|Hard|
|55|[Jump Game](https://leetcode.com/problems/jump-game/)| [Solution](), [C++](./algorithms/cpp/jumpGame/jumpGame.cpp), [Java](./algorithms/java/jumpGame/jumpGame.java), [Python](./algorithms/python/jumpGame/jumpGame.py), [Go](./algorithms/golang/jumpGame/jumpGame.go), [Python](./algorithms/python/jumpGame/jumpGame.py)|Medium|
|54|[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)| [Solution](), [C++](./algorithms/cpp/spiralMatrix/spiralMatrix.cpp), [Java](./algorithms/java/spiralMatrix/spiralMatrix.java), [Go](./algorithms/golang/spiralMatrix/spiralMatrix.go)|Medium|
|53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)| [Solution](), [C++](./algorithms/cpp/maximumSubArray/maximumSubArray.cpp), [Java](./algorithms/java/maximumSubArray/maximumSubArray.java), [Java](./algorithms/java/src/MaxSubArray/MaxSubarray.java), [Go](./algorithms/golang/maximumSubArray/maximumSubArray.java), [Java](./algorithms/java/src/MaxSubArray/MaxSubarray.go)|Medium|
|52|[N-Queens II](https://leetcode.com/problems/n-queens-ii/)| [Solution](), [C++](./algorithms/cpp/nQueens/nQueuens.II.cpp), [Java](./algorithms/java/nQueens/nQueuens.II.java), [Go](./algorithms/golang/nQueens/nQueuens.II.go)|Hard|
|51|[N-Queens](https://leetcode.com/problems/n-queens/)| [Solution](), [C++](./algorithms/cpp/nQueens/nQueuens.cpp), [Java](./algorithms/java/nQueens/nQueuens.java), [Go](./algorithms/golang/nQueens/nQueuens.go)|Hard|
|50|["Pow(x, n)"](https://leetcode.com/problems/powx-n/)| [Solution](), [C++](./algorithms/cpp/pow/pow.cpp), [Java](./algorithms/java/pow/pow.java), [Java](./algorithms/java/src/powXn/PowXn.java), [Go](./algorithms/golang/pow/pow.java), [Java](./algorithms/java/src/powXn/PowXn.go)|Medium|
|49|[Group Anagrams](https://leetcode.com/problems/anagrams/)| [Solution](), [C++](./algorithms/cpp/anagrams/GroupAnagrams.cpp), [Java](./algorithms/java/anagrams/GroupAnagrams.java), [Go](./algorithms/golang/anagrams/GroupAnagrams.go)|Medium|
|48|[Rotate Image](https://leetcode.com/problems/rotate-image/)| [Solution](), [C++](./algorithms/cpp/rotateImage/rotateImage.cpp), [Java](./algorithms/java/rotateImage/rotateImage.java), [Go](./algorithms/golang/rotateImage/rotateImage.go)|Medium|
|47|[Permutations II](https://leetcode.com/problems/permutations-ii/)| [Solution](), [C++](./algorithms/cpp/permutations/permutations.II.cpp), [Java](./algorithms/java/permutations/permutations.II.java), [Go](./algorithms/golang/permutations/permutations.II.go)|Hard|
|46|[Permutations](https://leetcode.com/problems/permutations/)| [Solution](), [C++](./algorithms/cpp/permutations/permutations.cpp), [Java](./algorithms/java/permutations/permutations.java), [Go](./algorithms/golang/permutations/permutations.go)|Medium|
|45|[Jump Game II](https://leetcode.com/problems/jump-game-ii/)| [Solution](), [C++](./algorithms/cpp/jumpGame/jumpGame.II.cpp), [Java](./algorithms/java/jumpGame/jumpGame.II.java), [Go](./algorithms/golang/jumpGame/jumpGame.II.go)|Hard|
|44|[Wildcard Matching](https://leetcode.com/problems/wildcard-matching/)| [Solution](), [C++](./algorithms/cpp/wildcardMatching/wildcardMatching.cpp), [Java](./algorithms/java/wildcardMatching/wildcardMatching.java), [Go](./algorithms/golang/wildcardMatching/wildcardMatching.go)|Hard|
|43|[Multiply Strings](https://leetcode.com/problems/multiply-strings/)| [Solution](), [C++](./algorithms/cpp/multiplyStrings/multiplyStrings.cpp), [Java](./algorithms/java/multiplyStrings/multiplyStrings.java), [Go](./algorithms/golang/multiplyStrings/multiplyStrings.go)|Medium|
|42|[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)| [Solution](), [C++](./algorithms/cpp/trappingRainWater/trappingRainWater.cpp), [Java](./algorithms/java/trappingRainWater/trappingRainWater.java), [Go](./algorithms/golang/trappingRainWater/trappingRainWater.go)|Hard|
|41|[First Missing Positive](https://leetcode.com/problems/first-missing-positive/)| [Solution](), [C++](./algorithms/cpp/firstMissingPositive/firstMissingPositive.cpp), [Java](./algorithms/java/firstMissingPositive/firstMissingPositive.java), [Python](././algorithms/python/firstMissingPositive/firstMissingPositive.py), [Go](./algorithms/golang/firstMissingPositive/firstMissingPositive.go), [Python](././algorithms/python/firstMissingPositive/firstMissingPositive.py)|Hard|
|40|[Combination Sum II](https://leetcode.com/problems/combination-sum-ii/)| [Solution](), [C++](./algorithms/cpp/combinationSum/combinationSum.II.cpp), [Java](./algorithms/java/combinationSum/combinationSum.II.java), [Go](./algorithms/golang/combinationSum/combinationSum.II.go)|Medium|
|39|[Combination Sum](https://leetcode.com/problems/combination-sum/)| [Solution](), [C++](./algorithms/cpp/combinationSum/combinationSum.cpp), [Java](./algorithms/java/combinationSum/combinationSum.java), [Go](./algorithms/golang/combinationSum/combinationSum.go)|Medium|
|38|[Count and Say](https://leetcode.com/problems/count-and-say/)| [Solution](), [C++](./algorithms/cpp/countAndSay/countAndSay.cpp), [Java](./algorithms/java/countAndSay/countAndSay.java), [Java](./algorithms/java/src/countAndSay/CountAndSay.java), [Go](./algorithms/golang/countAndSay/countAndSay.java), [Java](./algorithms/java/src/countAndSay/CountAndSay.go)|Easy|
|37|[Sudoku Solver](https://leetcode.com/problems/sudoku-solver/)| [Solution](), [C++](./algorithms/cpp/sudokuSolver/sudokuSolver.cpp), [Java](./algorithms/java/sudokuSolver/sudokuSolver.java), [Go](./algorithms/golang/sudokuSolver/sudokuSolver.go)|Hard|
|36|[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)| [Solution](), [C++](./algorithms/cpp/validSudoku/validSudoku.cpp), [Java](./algorithms/java/validSudoku/validSudoku.java), [Go](./algorithms/golang/validSudoku/validSudoku.go)|Easy|
|35|[Search Insert Position](https://leetcode.com/problems/search-insert-position/)| [Solution](), [C++](./algorithms/cpp/searchInsertPosition/searchInsertPosition.cpp), [Java](./algorithms/java/searchInsertPosition/searchInsertPosition.java), [Java](./algorithms/java/src/searchInsertPosition/searchInsertPosition.java), [Go](./algorithms/golang/searchInsertPosition/searchInsertPosition.java), [Java](./algorithms/java/src/searchInsertPosition/searchInsertPosition.go)|Medium|
|34|[Search for a Range](https://leetcode.com/problems/search-for-a-range/)| [Solution](), [C++](./algorithms/cpp/searchForRange/searchForRange.cpp), [Java](./algorithms/java/searchForRange/searchForRange.java), [Java](./algorithms/java/src/searchForRange/searchForRange.java), [Go](./algorithms/golang/searchForRange/searchForRange.java), [Java](./algorithms/java/src/searchForRange/searchForRange.go)|Medium|
|33|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)| [Solution](), [C++](./algorithms/cpp/searchInRotatedSortedArray/searchInRotatedSortedArray.cpp), [Java](./algorithms/java/searchInRotatedSortedArray/searchInRotatedSortedArray.java), [Java](./algorithms/java/src/searchInRotatedSortedArray/searchInRotatedSortedArray.java), [Go](./algorithms/golang/searchInRotatedSortedArray/searchInRotatedSortedArray.java), [Java](./algorithms/java/src/searchInRotatedSortedArray/searchInRotatedSortedArray.go)|Hard|
|32|[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/)| [Solution](), [C++](./algorithms/cpp/longestValidParentheses/longestValidParentheses.cpp), [Java](./algorithms/java/longestValidParentheses/longestValidParentheses.java), [Go](./algorithms/golang/longestValidParentheses/longestValidParentheses.go)|Hard|
|31|[Next Permutation](https://leetcode.com/problems/next-permutation/)| [Solution](), [C++](./algorithms/cpp/nextPermutation/nextPermutation.cpp), [Java](./algorithms/java/nextPermutation/nextPermutation.java), [Go](./algorithms/golang/nextPermutation/nextPermutation.go)|Medium|
|30|[Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/)| [Solution](), [C++](./algorithms/cpp/substringWithConcatenationOfAllWords/substringWithConcatenationOfAllWords.cpp), [Java](./algorithms/java/substringWithConcatenationOfAllWords/substringWithConcatenationOfAllWords.java), [Go](./algorithms/golang/substringWithConcatenationOfAllWords/substringWithConcatenationOfAllWords.go)|Hard|
|29|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)| [Solution](), [C++](./algorithms/cpp/divideTwoInt/divideTwoInt.cpp), [Java](./algorithms/java/divideTwoInt/divideTwoInt.java), [Go](./algorithms/golang/divideTwoInt/divideTwoInt.go)|Medium|
|28|[Implement strStr()](https://leetcode.com/problems/implement-strstr/)| [Solution](), [C++](./algorithms/cpp/strStr/strStr.cpp), [Java](./algorithms/java/strStr/strStr.java), [Java](./algorithms/java/src/strStr/strStr.java), [Go](./algorithms/golang/strStr/strStr.java), [Java](./algorithms/java/src/strStr/strStr.go)|Easy|
|27|[Remove Element](https://leetcode.com/problems/remove-element/)| [Solution](), [C++](./algorithms/cpp/removeElement/removeElement.cpp), [Java](./algorithms/java/removeElement/removeElement.java), [Go](./algorithms/golang/removeElement/removeElement.go)|Easy|
|26|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)| [Solution](), [C++](./algorithms/cpp/removeDuplicatesFromSortedArray/removeDuplicatesFromSortedArray.cpp), [Java](./algorithms/java/removeDuplicatesFromSortedArray/removeDuplicatesFromSortedArray.java), [Java](./algorithms/java/src/removeDuplicatesFromSortedArray/RemoveDuplicatesFromSortedArray.java), [Go](./algorithms/golang/removeDuplicatesFromSortedArray/removeDuplicatesFromSortedArray.java), [Java](./algorithms/java/src/removeDuplicatesFromSortedArray/RemoveDuplicatesFromSortedArray.go)|Easy|
|25|[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/)| [Solution](), [C++](./algorithms/cpp/reverseNodesInKGroup/reverseNodesInKGroup.cpp), [Java](./algorithms/java/reverseNodesInKGroup/reverseNodesInKGroup.java), [Go](./algorithms/golang/reverseNodesInKGroup/reverseNodesInKGroup.go)|Hard|
|24|[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)| [Solution](), [C++](./algorithms/cpp/swapNodesInPairs/swapNodesInPairs.cpp), [Java](./algorithms/java/swapNodesInPairs/swapNodesInPairs.java), [Go](./algorithms/golang/swapNodesInPairs/swapNodesInPairs.go)|Medium|
|23|[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)| [Solution](), [C++](./algorithms/cpp/mergeKSortedLists/mergeKSortedLists.cpp), [Java](./algorithms/java/mergeKSortedLists/mergeKSortedLists.java), [Go](./algorithms/golang/mergeKSortedLists/mergeKSortedLists.go)|Hard|
|22|[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)| [Solution](), [C++](./algorithms/cpp/generateParentheses/generateParentheses.cpp), [Java](./algorithms/java/generateParentheses/generateParentheses.java), [Go](./algorithms/golang/generateParentheses/generateParentheses.go)|Medium|
|21|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)| [Solution](), [C++](./algorithms/cpp/mergeTwoSortedList/mergeTwoSortedList.cpp), [Java](./algorithms/java/mergeTwoSortedList/mergeTwoSortedList.java), [Go](./algorithms/golang/mergeTwoSortedList/mergeTwoSortedList.go)|Easy|
|20|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)| [Solution](), [C++](./algorithms/cpp/validParentheses/validParentheses.cpp), [Java](./algorithms/java/validParentheses/validParentheses.java), [Go](./algorithms/golang/validParentheses/validParentheses.go)|Easy|
|19|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [Solution](), [C++](./algorithms/cpp/removeNthNodeFromEndOfList/removeNthNodeFromEndOfList.cpp), [Java](./algorithms/java/removeNthNodeFromEndOfList/removeNthNodeFromEndOfList.java), [Python](./algorithms/python/RemoveNthNodeFromEndOfList/removeNthFromEnd.py), [Go](./algorithms/golang/removeNthNodeFromEndOfList/removeNthNodeFromEndOfList.go), [Python](./algorithms/python/RemoveNthNodeFromEndOfList/removeNthFromEnd.py)|Easy|
|18|[4Sum](https://leetcode.com/problems/4sum/)| [Solution](), [C++](./algorithms/cpp/4Sum/4Sum.cpp), [Java](./algorithms/java/4Sum/4Sum.java), [Go](./algorithms/golang/4Sum/4Sum.go)|Medium|
|17|[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)| [Solution](), [C++](./algorithms/cpp/letterCombinationsOfAPhoneNumber/letterCombinationsOfAPhoneNumber.cpp), [Java](./algorithms/java/letterCombinationsOfAPhoneNumber/letterCombinationsOfAPhoneNumber.java), [Go](./algorithms/golang/letterCombinationsOfAPhoneNumber/letterCombinationsOfAPhoneNumber.go)|Medium|
|16|[3Sum Closest](https://leetcode.com/problems/3sum-closest/)| [Solution](), [C++](./algorithms/cpp/3SumClosest/3SumClosest.cpp), [Java](./algorithms/java/3SumClosest/3SumClosest.java), [Go](./algorithms/golang/3SumClosest/3SumClosest.go)|Medium|
|15|[3Sum](https://leetcode.com/problems/3sum/)| [Solution](), [C++](./algorithms/cpp/3Sum/3Sum.cpp), [Java](./algorithms/java/3Sum/3Sum.java), [Go](./algorithms/golang/3Sum/3Sum.go)|Medium|
|14|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)| [Solution](), [C++](./algorithms/cpp/longestCommonPrefix/longestCommonPrefix.cpp), [Java](./algorithms/java/longestCommonPrefix/longestCommonPrefix.java), [Go](./algorithms/golang/longestCommonPrefix/longestCommonPrefix.go)|Easy|
|13|[Roman to Integer](https://leetcode.com/problems/roman-to-integer/)| [Solution](), [C++](./algorithms/cpp/romanToInteger/romanToInteger.cpp), [Java](./algorithms/java/romanToInteger/romanToInteger.java), [Go](./algorithms/golang/romanToInteger/romanToInteger.go)|Easy|
|12|[Integer to Roman](https://leetcode.com/problems/integer-to-roman/)| [Solution](), [C++](./algorithms/cpp/integerToRoman/integerToRoman.cpp), [Java](./algorithms/java/integerToRoman/integerToRoman.java), [Go](./algorithms/golang/integerToRoman/integerToRoman.go)|Medium|
|11|[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)| [Solution](), [C++](./algorithms/cpp/containerWithMostWater/containerWithMostWater.cpp), [Java](./algorithms/java/containerWithMostWater/containerWithMostWater.java), [Java](./algorithms/java/src/containerwithmostwater.java), [Go](./algorithms/golang/containerWithMostWater/containerWithMostWater.java), [Java](./algorithms/java/src/containerwithmostwater.go)|Medium|
|10|[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/)| [Solution](), [C++](./algorithms/cpp/regularExpressionMatching/regularExpressionMatching.cpp), [Java](./algorithms/java/regularExpressionMatching/regularExpressionMatching.java), [Go](./algorithms/golang/regularExpressionMatching/regularExpressionMatching.go)|Hard|
|9|[Palindrome Number](https://leetcode.com/problems/palindrome-number/)| [Solution](), [C++](./algorithms/cpp/palindromeNumber/palindromeNumber.cpp), [Java](./algorithms/java/palindromeNumber/palindromeNumber.java), [Java](./algorithms/java/src/palindromeNumber/PalindromeNumber.java), [Go](./algorithms/golang/palindromeNumber/palindromeNumber.java), [Java](./algorithms/java/src/palindromeNumber/PalindromeNumber.go)|Easy|
|8|[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/)| [Solution](), [C++](./algorithms/cpp/stringToIntegerAtoi/stringToIntegerAtoi.cpp), [Java](./algorithms/java/stringToIntegerAtoi/stringToIntegerAtoi.java), [Go](./algorithms/golang/stringToIntegerAtoi/stringToIntegerAtoi.go)|Easy|
|7|[Reverse Integer](https://leetcode.com/problems/reverse-integer/)| [Solution](), [C++](./algorithms/cpp/reverseInteger/reverseInteger.cpp), [Java](./algorithms/java/reverseInteger/reverseInteger.java), [Go](./algorithms/golang/reverseInteger/reverseInteger.go)|Easy|
|6|[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/)| [Solution](), [C++](./algorithms/cpp/zigZagConversion/zigZagConversion.cpp), [Java](./algorithms/java/zigZagConversion/zigZagConversion.java), [Go](./algorithms/golang/zigZagConversion/zigZagConversion.go)|Easy|
|5|[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)| [Solution](), [C++](./algorithms/cpp/longestPalindromicSubstring/longestPalindromicSubstring.cpp), [Java](./algorithms/java/longestPalindromicSubstring/longestPalindromicSubstring.java), [Go](./algorithms/golang/longestPalindromicSubstring/longestPalindromicSubstring.go)|Medium|
|4|[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)| [Solution](), [C++](./algorithms/cpp/medianOfTwoSortedArrays/medianOfTwoSortedArrays.cpp), [Java](./algorithms/java/medianOfTwoSortedArrays/medianOfTwoSortedArrays.java), [Go](./algorithms/golang/medianOfTwoSortedArrays/medianOfTwoSortedArrays.go)|Hard|
|3|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)| [Solution](), [C++](./algorithms/cpp/longestSubstringWithoutRepeatingCharacters/longestSubstringWithoutRepeatingCharacters.cpp), [Java](./algorithms/java/longestSubstringWithoutRepeatingCharacters/longestSubstringWithoutRepeatingCharacters.java), [Go](./algorithms/golang/longestSubstringWithoutRepeatingCharacters/longestSubstringWithoutRepeatingCharacters.go)|Medium|
|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)| [Solution](), [C++](./algorithms/cpp/addTwoNumbers/addTwoNumbers.cpp), [Java](./algorithms/java/addTwoNumbers/addTwoNumbers.java), [Go](./algorithms/golang/addTwoNumbers/addTwoNumbers.go)|Medium|
|1|[Two Sum](https://leetcode.com/problems/two-sum/)| [Solution](), [C++](./algorithms/cpp/twoSum/twoSum.cpp), [Java](./algorithms/java/twoSum/twoSum.java), [Go](./algorithms/golang/twoSum/twoSum.go)|Easy|


### LeetCode Shell


| # | Title | Solution | Difficulty |
|---| ----- | -------- | ---------- |
|4|[Tenth Line](https://leetcode.com/problems/tenth-line/)| [Bash](./shell/TenthLine.sh)|Easy|
|3|[Transpose File](https://leetcode.com/problems/transpose-file/)| [Bash](./shell/TransposeFile.sh)|Medium|
|2|[Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers/)| [Bash](./shell/ValidPhoneNumbers.sh)|Easy|
|1|[Word Frequency](https://leetcode.com/problems/word-frequency/)| [Bash](./shell/WordFrequency.sh)|Medium|

### LintCode    

| # | Title | Solution | Difficulty |
|---| ----- | -------- | ---------- |
|1|[Search in a big sorted array](http://www.lintcode.com/en/problem/search-in-a-big-sorted-array/)|[Java](./algorithms/java/src/searchInABigSortedArray/searchInABigSortedArray.java), [Go](./algorithms/golang/src/searchInABigSortedArray/searchInABigSortedArray.go)|Medium|
|2|[Search Range in Binary Search Tree](http://www.lintcode.com/en/problem/search-range-in-binary-search-tree/) | [Java](./algorithms/java/src/searchRangeInBinarySearchTree/searchRangeInBinarySearchTree.java), [Go](./algorithms/golang/src/searchRangeInBinarySearchTree/searchRangeInBinarySearchTree.go)|Medium|