LeetCode Solutions and Explanations

Here is a list of LeetCode problems solved by Goodtecher. Goodtecher will keep updating solutions and explains to LeetCode problems. You can also watch GoodTecher LeetCode Video Tutorial on Youtube.

LeetCode Problems Table

#TitleCategoryDifficultyFrequency
1Two SumTwo PointersEasy★★★★★
2Add Two NumbersLinked ListMedium★★★★
3Longest Substring Without Repeating CharactersTwo PointersMedium★★★★
4Median of Two Sorted ArraysArrayHard★★★
5Longest Palindromic SubstringDynamic ProgrammingMedium★★★★
6ZigZag ConversionMathMedium★
7Reverse IntegerMathEasy★★★★
8String to Integer (atoi)StringMedium★★
9Palindrome NumberMathEasy★★★★
11Container With Most WaterTwo PointersMedium★★
12Integer to RomanStringMedium★
13Roman to IntegerStringEasy★
14Longest Common PrefixStringEasy★★★
153SumTwo PointersMedium★★★
163Sum ClosestTwo PointersMedium★★★
17Letter Combinations of a Phone NumberDepth First SearchMedium★★★
184SumTwo PointersMedium★★
19Remove Nth Node From End of ListLinked ListMedium★★★
20Valid ParenthesesStackEasy★★★★
21Merge Two Sorted ListsLinked ListEasy★★★
26Remove Duplicates from Sorted ArrayTwo PointersEasy★★
28Implement strStr()StringEasy★★
34Search for a RangeBinary SearchMedium★★
35Search Insert Position Binary SearchEasy★★
39Combination SumDepth First SearchMedium★★★★
40Combination Sum IIDepth First SearchMedium★★★
42Trapping Rain WaterTwo PointersHard★★★
62Unique PathsDynamic ProgrammingMedium★★★
63Unique Paths IIDynamic ProgrammingMedium★★
69Sqrt(x)Binary SearchEasy★★★
70Climbing StairsDynamic ProgrammingEasy★★★
78SubsetsDepth First SearchMedium★★★★
90Subsets IIDepth First SearchMedium★★
100Same TreeBinary TreeEasy★★★
101Symmetric TreeBinary TreeEasy★★★
102Binary Tree Level Order TraversalBinary TreeMedium★★★★
104Maximum Depth of Binary TreeBinary TreeEasy★★★
110Balanced Binary TreeBinary TreeEasy★★★
111Minimum Depth of Binary TreeBinary TreeEasy★★★
121Best Time to Buy and Sell StockArrayEasy★★
122Best Time to Buy and Sell Stock IIArrayEasy★★
138Copy List with Random PointerLinked ListMedium★★
139Word BreakDynamic ProgrammingMedium★★★★
144Binary Tree Preorder TraversalBinary TreeEasy★★
155Min StackStackEasy★★★
278First Bad VersionBinary SearchEasy★★
412Fizz BuzzMathEasy★★★
547Friend CirclesUnion FindMedium★★★

35 Thoughts to “LeetCode Solutions and Explanations”

  2. HI GoodTecher,

    Your lessons are really amazing and you give really good explanation . Can you please create more videos for leetcode interview questions pleaseee.

    Thank You

    Reply

  4. Hello Good Techer,

    Really appreciate your tutorials.
    Would you please teach this problem?

    Given a collection
    * of candidate numbers (C) and a target number (T), find all unique
    * combinations in C where the candidate numbers sums to T. Each number in C
    * may only be used once in the combination. eg. Given candidate set
    * [10,1,6,7,2,1,5] and target 8, [ [1,7], [1,2,5], [2,6], [1,1,6] ]

    Thank you so much.

    Reply

Leave a Reply

Your email address will not be published. Required fields are marked *