Learn fundamental algorithms and data structures through 17 comprehensive programming tutorials covering arrays, primitives, and strings. Master essential techniques including Karatsuba's multiplication algorithm, bit manipulation for addition without operators, and the two-pointer approach for minimum window substring problems. Explore advanced string processing with KMP pattern matching, palindromic decompositions, and IP address validation. Develop proficiency in dynamic programming through edit distance calculations and maximum subarray problems using Kadane's algorithm. Practice backtracking algorithms for generating parentheses combinations, string permutations, and partitioning arrays into equal sum subsets. Study heap-based solutions for merging sorted arrays and finding second largest elements. Understand classic algorithmic problems including the Dutch National Flag problem for array partitioning, next permutation generation through case analysis, and integer digit reversal techniques. Each tutorial provides detailed explanations of time complexity optimizations, from cubic time brute force approaches to efficient linear and logarithmic solutions, with direct connections to popular LeetCode problems for practical coding interview preparation.

Syllabus

Fast Multiplication: From Grade-School Multiplication To Karatsuba's Algorithm
Add Two Numbers Without The "+" Sign (Bit Shifting Basics)
Minimum Window Substring: Utilizing Two Pointers & Tracking Character Mappings With A Hashtable
Max Contiguous Subarray Sum - Cubic Time To Kadane's Algorithm ("Maximum Subarray" on LeetCode)
Increment An Integer Represented As An Array ("Plus One" on LeetCode)
Find The Second Largest Item - Heap & Tracking Approach (Beginner Big N Interview Question)
Generate All Strings With n Matched Parentheses - Backtracking ("Generate Parentheses" on LeetCode)
Compute The Next Permutation of A Numeric Sequence - Case Analysis ("Next Permutation" on Leetcode)
Edit Distance Between 2 Strings - The Levenshtein Distance ("Edit Distance" on LeetCode)
Partition To K Equal Sum Subsets From An Array of Integers - The Backtracking Approach
Merge K Sorted Arrays - Min Heap Algorithm ("Merge K Sorted Lists" on LeetCode)
Generate All Palindromic Decompositions Of A String ("Palindrome Partitioning" on Leetcode)
Knuth–Morris–Pratt (KMP) Pattern Matching Substring Search - First Occurrence Of Substring
How To Permute A String - Generate All Permutations Of A String
The IP Address Decomposition Problem - Compute All Valid IP Addresses From Raw IP String
The Dutch National Flag Problem (The Quicksort "Band-Aid")
Reverse The Digits of An Integer | Programming Interview Question (Primitives)