LeetCode DSA – Striver’s SDE SheetFree

Comprehensive LeetCode DSA problem-solving notes based on Striver’s SDE Sheet, covering important coding problems with handwritten explanations, approaches, examples, code, and time and space complexity analysis. The material includes problems on Arrays, Matrices, Sorting, Linked Lists, Searching, Hashing, Dynamic Programming, Two Pointers, Sliding Window, Prefix Sum, XOR, and Strings.

Problems covered include Set Matrix Zeroes, Pascal’s Triangle, Next Permutation, Maximum Subarray (Kadane’s Algorithm), Sort Colors, Rotate Image, Merge Intervals, Merge Sorted Array, Find Duplicate Number, Linked List Cycle, Find Missing & Repeating Numbers, Inversion of Array, Search in a Sorted 2D Matrix, Power(x,n), Majority Element, Majority Elements (>N/3), Unique Grid Paths, Count Reverse Pairs, Two Sum, 4-Sum, Longest Consecutive Sequence, Longest Subarray with Zero Sum, Subarrays with XOR K, and Longest Substring Without Repeating Characters.

The notes demonstrate brute-force, optimized, and most-optimized approaches for several problems, including hashing, binary search, two pointers, Moore’s Voting Algorithm, dynamic programming, merge sort, and sliding-window techniques, along with complexity analysis. Pages 2–58 contain the detailed handwritten problem-solving work and code implementations.