leetcode.com Solution

This repository contains all the solved solutions for coding problems on LeetCode. All solutions have an acceptable runtime and memory usage.

Programming Languages:

C# - denoted by [C#]
Java - denoted by [J]
Python - denoted by [Py]
SQL - denoted by [SQL]
Bash Script - denoted by [B]
TypeScript - denoted by [T]

Naming Format:

[Difficulty][Programming Language].question number.question title

Difficulty:

E: Easy M: Medium H: Hard

Name		Name	Last commit message	Last commit date
Latest commit History 173 Commits
README.md		README.md
[C#].[E].643.MaximumAverageSubarrayI		[C#].[E].643.MaximumAverageSubarrayI
[E].[C#].2114.MaximumNumberOfWordsFoundInSentences		[E].[C#].2114.MaximumNumberOfWordsFoundInSentences
[E].[J].100.SameTree		[E].[J].100.SameTree
[E].[J].101.SymmetricTree		[E].[J].101.SymmetricTree
[E].[J].1071.GreatestCommonDivisorOfStrings		[E].[J].1071.GreatestCommonDivisorOfStrings
[E].[J].108.ConvertSortedArrayToBinarySearchTree		[E].[J].108.ConvertSortedArrayToBinarySearchTree
[E].[J].110.BalancedBinaryTree		[E].[J].110.BalancedBinaryTree
[E].[J].111.MinimumDepthOfBinaryTree		[E].[J].111.MinimumDepthOfBinaryTree
[E].[J].112.PathSum		[E].[J].112.PathSum
[E].[J].1137.N-thTribonacciNumber		[E].[J].1137.N-thTribonacciNumber
[E].[J].141.LinkedListCycle		[E].[J].141.LinkedListCycle
[E].[J].144.BinaryTreePreorderTraversal		[E].[J].144.BinaryTreePreorderTraversal
[E].[J].145.BinaryTreePostorderTraversal		[E].[J].145.BinaryTreePostorderTraversal
[E].[J].160.IntersectionOfTwoLinkedList		[E].[J].160.IntersectionOfTwoLinkedList
[E].[J].169.MajorityElement		[E].[J].169.MajorityElement
[E].[J].1768.MergeStringsAlternately		[E].[J].1768.MergeStringsAlternately
[E].[J].191.Numberof1Bits		[E].[J].191.Numberof1Bits
[E].[J].1913.MaxProductDifferenceBtwTwoPairs		[E].[J].1913.MaxProductDifferenceBtwTwoPairs
[E].[J].1979.FindGreatestCommonDivisorOfArray		[E].[J].1979.FindGreatestCommonDivisorOfArray
[E].[J].203.RemoveLinkedListElements		[E].[J].203.RemoveLinkedListElements
[E].[J].206.ReverseLinkedList		[E].[J].206.ReverseLinkedList
[E].[J].21.MergeTwoSortedLists		[E].[J].21.MergeTwoSortedLists
[E].[J].219.ContainsDuplicateII		[E].[J].219.ContainsDuplicateII
[E].[J].222.CountCompleteTreeNodes		[E].[J].222.CountCompleteTreeNodes
[E].[J].226.InvertBinaryTree		[E].[J].226.InvertBinaryTree
[E].[J].228.SummaryRanges		[E].[J].228.SummaryRanges
[E].[J].234.PalindromeLinkedList		[E].[J].234.PalindromeLinkedList
[E].[J].2413.SmallestEvenMultiple		[E].[J].2413.SmallestEvenMultiple
[E].[J].257.BinaryTreePaths		[E].[J].257.BinaryTreePaths
[E].[J].258.AddDigits		[E].[J].258.AddDigits
[E].[J].263.UglyNumber		[E].[J].263.UglyNumber
[E].[J].278.FirstBadVersion		[E].[J].278.FirstBadVersion
[E].[J].283.MoveZeroes		[E].[J].283.MoveZeroes
[E].[J].326.PowerOfThree		[E].[J].326.PowerOfThree
[E].[J].342.PowerOfFour		[E].[J].342.PowerOfFour
[E].[J].349.IntersectionOfTwoArrays		[E].[J].349.IntersectionOfTwoArrays
[E].[J].35.SearchInsertPosition		[E].[J].35.SearchInsertPosition
[E].[J].374.GuessNumberHigherOrLower		[E].[J].374.GuessNumberHigherOrLower
[E].[J].389.FindTheDifference		[E].[J].389.FindTheDifference
[E].[J].441.ArrangingCoins		[E].[J].441.ArrangingCoins
[E].[J].66.PlusOne		[E].[J].66.PlusOne
[E].[J].70.ClimbingStairs		[E].[J].70.ClimbingStairs
[E].[J].728.SelfDividingNumbers		[E].[J].728.SelfDividingNumbers
[E].[J].83.RemoveDuplicatesFromSortedList		[E].[J].83.RemoveDuplicatesFromSortedList
[E].[J].88.MergeSortedArray		[E].[J].88.MergeSortedArray
[E].[J].94.BinaryTreeInorderTraversal		[E].[J].94.BinaryTreeInorderTraversal
[E].[Py].1037.ValidBoomerang		[E].[Py].1037.ValidBoomerang
[E].[Py].118.PascalTriangle		[E].[Py].118.PascalTriangle
[E].[Py].119.PascalTriangleII		[E].[Py].119.PascalTriangleII
[E].[Py].136.SingleNumber		[E].[Py].136.SingleNumber
[E].[Py].1431.KidsWithTheGreatestNumberOfCandies		[E].[Py].1431.KidsWithTheGreatestNumberOfCandies
[E].[Py].205.IsomorphicStrings		[E].[Py].205.IsomorphicStrings
[E].[Py].217.ContainsDuplicate		[E].[Py].217.ContainsDuplicate
[E].[Py].231.PowerOfTwo		[E].[Py].231.PowerOfTwo
[E].[Py].232.ImplementQueueUsingStacks		[E].[Py].232.ImplementQueueUsingStacks
[E].[Py].2441.LargestPositiveIntegerThatExistsWithItsNegative		[E].[Py].2441.LargestPositiveIntegerThatExistsWithItsNegative
[E].[Py].290.WordPattern		[E].[Py].290.WordPattern
[E].[Py].3131.FindTheIntegerAddedToArrayI		[E].[Py].3131.FindTheIntegerAddedToArrayI
[E].[Py].507.PerfectNumber		[E].[Py].507.PerfectNumber
[E].[Py].509.FibonacciNumber		[E].[Py].509.FibonacciNumber
[E].[SQL].1068.ProductSalesAnalysisI		[E].[SQL].1068.ProductSalesAnalysisI
[E].[SQL].1148.ArticleViewsI		[E].[SQL].1148.ArticleViewsI
[E].[SQL].1378.ReplaceEmployeeIDWithTheUniqueIdentifier		[E].[SQL].1378.ReplaceEmployeeIDWithTheUniqueIdentifier
[E].[SQL].1407.TopTravellers		[E].[SQL].1407.TopTravellers
[E].[SQL].1581.CustomerWhoVisitedButDidNotMakeAnyTransactions		[E].[SQL].1581.CustomerWhoVisitedButDidNotMakeAnyTransactions
[E].[SQL].1661.AverageTimeOfProcessPerMachine		[E].[SQL].1661.AverageTimeOfProcessPerMachine
[E].[SQL].1683.InvalidTweets		[E].[SQL].1683.InvalidTweets
[E].[SQL].175.CombineTwoTables		[E].[SQL].175.CombineTwoTables
[E].[SQL].181.EmployeesEarningMoreThanTheirManagers		[E].[SQL].181.EmployeesEarningMoreThanTheirManagers
[E].[SQL].182.DuplicateEmails		[E].[SQL].182.DuplicateEmails
[E].[SQL].183.CustomersWhoNeverOrder		[E].[SQL].183.CustomersWhoNeverOrder
[E].[SQL].1890.TheLatestLoginIn2020		[E].[SQL].1890.TheLatestLoginIn2020
[E].[SQL].196.DeleteDuplicateEmails		[E].[SQL].196.DeleteDuplicateEmails
[E].[SQL].197.RisingTemperature		[E].[SQL].197.RisingTemperature
[E].[SQL].511.GamePlayAnalysisI		[E].[SQL].511.GamePlayAnalysisI
[E].[SQL].577.EmployeeBonus		[E].[SQL].577.EmployeeBonus
[E].[SQL].584.FindCustomerReferee		[E].[SQL].584.FindCustomerReferee
[E].[SQL].586.CustomerPlacingTheLargestNumberOfOrders		[E].[SQL].586.CustomerPlacingTheLargestNumberOfOrders
[E].[SQL].595.BigCountries		[E].[SQL].595.BigCountries
[E].[SQL].596.ClassesMoreThan5Students		[E].[SQL].596.ClassesMoreThan5Students
[E].[SQL].607.SalesPerson		[E].[SQL].607.SalesPerson
[E].[SQL].610.TriangleJudgement		[E].[SQL].610.TriangleJudgement
[E].[SQL].619.BiggestSingleNumber		[E].[SQL].619.BiggestSingleNumber
[E].[SQL].627.SwapSalary		[E].[SQL].627.SwapSalary
[E][C#].1.Two Sum		[E][C#].1.Two Sum
[E][C#].1051.HeightChecker		[E][C#].1051.HeightChecker
[E][C#].1160.FindWordsThatCanBeFormedByCharacters		[E][C#].1160.FindWordsThatCanBeFormedByCharacters
[E][C#].13.RomanToInt		[E][C#].13.RomanToInt
[E][C#].1360.NumberOfDaysBetweenTwoDates		[E][C#].1360.NumberOfDaysBetweenTwoDates
[E][C#].1832.CheckIfTheSentenceIsPangram		[E][C#].1832.CheckIfTheSentenceIsPangram
[E][C#].1909.RemoveOneElementToMakeTheArrayStrictlyIncreasing		[E][C#].1909.RemoveOneElementToMakeTheArrayStrictlyIncreasing
[E][C#].202.HappyNumber		[E][C#].202.HappyNumber
[E][C#].2194.CellsInARangeOnAnExcelSheet		[E][C#].2194.CellsInARangeOnAnExcelSheet
[E][C#].509.Fibonacci Number		[E][C#].509.Fibonacci Number
[E][J].125.ValidPalindrome		[E][J].125.ValidPalindrome
[E][J].14.LongestCommonPrefix		[E][J].14.LongestCommonPrefix
[E][J].26.RemoveDuplicatesFromSortedArray		[E][J].26.RemoveDuplicatesFromSortedArray
[E][J].344.ReverseString		[E][J].344.ReverseString
[E][J].392.IsSubsequence		[E][J].392.IsSubsequence

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

leetcode.com Solution

Programming Languages:

Naming Format:

Difficulty:

About

Releases

Packages

haydenpham/leetcode

Folders and files

Latest commit

History

Repository files navigation

leetcode.com Solution

Programming Languages:

Naming Format:

Difficulty:

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Packages