LeetCode Solutions using Algorithms and Data Structure in C#

Course Curriculum

Chapter 1: LeetCode Problems 1 – 300

Lecture 1: LeetCode 2: Add Two Numbers

Lecture 2: LeetCode 19: Remove Nth Node From End of List

Lecture 3: LeetCode 23: Merge k Sorted Lists

Lecture 4: LeetCode 36: Valid Sudoku

Lecture 5: LeetCode 37: Sudoku Solver

Lecture 6: LeetCode 39: Combination Sum

Lecture 7: LeetCode 40: Combination Sum II

Lecture 8: LeetCode 53: Maximum Subarray

Lecture 9: LeetCode 54: Spiral Matrix

Lecture 10: LeetCode 56: https://leetcode.com/problems/merge-intervals/

Lecture 11: LeetCode 78: Subsets

Lecture 12: LeetCode 80: Remove Duplicates from Sorted Array II

Lecture 13: LeetCode 84: Largest Rectangle in Histogram

Lecture 14: LeetCode 91: Decode Ways

Lecture 15: LeetCode 95: Unique Binary Search Trees II

Lecture 16: LeetCode 104: Maximum Depth of Binary Tree

Lecture 17: LeetCode 106: Construct Binary Tree from Inorder and Postorder Traversal

Lecture 18: LeetCode 121: Best Time to Buy and Sell Stock

Lecture 19: LeetCode 132: Palindrome Partitioning II

Lecture 20: LeetCode 134 Gas Station

Lecture 21: LeetCode 136: Single Number

Lecture 22: LeetCode 142 Linked List Cycle ||

Lecture 23: LeetCode 143: Reorder List

Lecture 24: LeetCode 153: Find Minimum in Rotated Sorted Array

Lecture 25: LeetCode 189: Rotate Array

Lecture 26: LeetCode 206: Reverse Linked List

Lecture 27: LeetCode 211: Design Add and Search Words Data Structure

Lecture 28: LeetCode 276: Paint Fence

Lecture 29: LeetCode 290: Word Pattern

Chapter 2: LeetCode Problems 301 – 600

Lecture 1: LeetCode 331: Verify Preorder Serialization of a Binary Tree

Lecture 2: LeetCode 376: Wiggle Subsequence

Lecture 3: LeetCode 380: Insert Delete GetRandom O(1)

Lecture 4: LeetCode 402: Remove K Digits

Lecture 5: LeetCode 438: Find All Anagrams in a String

Lecture 6: LeetCode 452 Minimum Number of Arrows to Burst Balloons

Lecture 7: LeetCode 454: 4Sum II

Lecture 8: LeetCode 520: Detect Capitals

Lecture 9: LeetCode 525: Contiguous Array

Lecture 10: LeetCode 532: K-diff Pairs in an Array

Lecture 11: LeetCode 536: Construct Binary tree from string

Lecture 12: LeetCode 560: Subarray Sum Equals K

Lecture 13: LeetCode 565: Array Nesting

Lecture 14: LeetCode 567: Permutations of String

Chapter 3: LeetCode Problems 601 – 900

Lecture 1: LeetCode 633: Sum of Square Numbers

Lecture 2: LeetCode 653: Sum of Square Numbers

Lecture 3: LeetCode 703: Kth largest element in the stream

Lecture 4: LeetCode 714: Best Time to Buy and Sell Stock with Transaction Fee

Lecture 5: LeetCode 764: Largest Plus Sign

Lecture 6: LeetCode 823: Binary Trees With Factors

Lecture 7: LeetCode 841: Keys and Rooms

Lecture 8: LeetCode 848: Shifting Letters

Lecture 9: LeetCode 875 Koko eating bananas

Lecture 10: LeetCode 876: Middle of the Linked List

Chapter 4: LeetCode Problems 901 – 1200

Lecture 1: LeetCode 917: Reverse Only Letters

Lecture 2: LeetCode 941: Valid Mountain Array

Lecture 3: LeetCode 952: Largest Component Size by Common Factor

Lecture 4: LeetCode 959: Regions cut by slashes

Lecture 5: LeetCode 986: Interval List Intersections

Lecture 6: LeetCode 1010: Pairs of Songs With Total Durations Divisible by 60

Lecture 7: LeetCode 1026: Maximum Difference Between Node and Ancestor

Lecture 8: LeetCode 1094: Car Pooling

Lecture 9: LeetCode 1120: Maximum Average Subtree

Lecture 10: LeetCode 1137: N-th Tribonacci Number

Lecture 11: LeetCode 1189: Maximum Number of Balloons

Chapter 5: LeetCode problems 1201 – 1500

Lecture 1: LeetCode 1239: Maximum Length of a Concatenated String with Unique Characters

Lecture 2: LeetCode 1275: Find Winner on a Tic Tac Toe Game

Lecture 3: LeetCode 1291 Sequential Digits

Lecture 4: LeetCode 1295: Find Numbers with Even Number of Digits

Lecture 5: LeetCode 1305: All Elements in Two Binary Search Trees

Lecture 6: LeetCode 1328: Break a Palindrome

Lecture 7: LeetCode 1335: Minimum Difficulty of a Job Schedule

Lecture 8: LeetCode 1339: Maximum Product of Splitted Binary Tree

Lecture 9: LeetCode 1396: Design Underground System

Lecture 10: LeetCode 1448: Count Good Nodes in Binary Tree

Chapter 6: LeetCode Problems 1501 – 1800

Lecture 1: LeetCode 1510 Stone Age IV

Lecture 2: LeetCode 1629: Slowest Key

Lecture 3: LeetCode 1653: Minimum deletions to make String Balanced

Lecture 4: LeetCode 1672 : Richest Customer Wealth

Lecture 5: LeetCode 1704: Determine if String Halves Are Alike

Lecture 6: LeetCode 1721: Swapping Nodes in a Linked List

Lecture 7: LeetCode 1790: Check if One String Swap Can Make Strings Equal