Crappy Coder

LeetCode 9: Palindrome Number | Two-Pointer JavaScript Solution

LeetCode 169: Majority Element | JavaScript Map + Sort Solution

LeetCode 268: Missing Number | Clean O(n) Solution in JavaScript

LeetCode 53: Maximum Subarray | Kadane’s Algorithm in JavaScript

LeetCode 56: Merge Intervals | JavaScript Clean Solution

LeetCode 35: Search Insert Position | Binary Search Explained (JavaScript)

LeetCode 560: Subarray Sum Equals K | Brute Force vs Optimized (JavaScript)

LeetCode 543: Diameter of Binary Tree | Clean JavaScript Recursion

LeetCode 242: Valid Anagram | Brute Force vs Optimized (JavaScript)

LeetCode 236: Lowest Common Ancestor in a Binary Tree | JavaScript Solution

LeetCode 235: Lowest Common Ancestor in BST | Clean JavaScript Solution

LeetCode 230: Kth Smallest Element in BST | JavaScript In-Order DFS

LeetCode 226: Invert Binary Tree | Recursion in JavaScript

LeetCode 217: Contains Duplicate | Brute Force vs Set in JavaScript

LeetCode 208: Implement Trie | JavaScript Prefix Tree Solution

LeetCode 206: Reverse Linked List | Iterative JavaScript Solution

LeetCode 200: Number of Islands | DFS Flood Fill in JavaScript

LeetCode 167: Two Sum II | Brute Force vs Hash Map in JavaScript

LeetCode 162: Find Peak Element | Binary Search in JavaScript

LeetCode 155: Min Stack | O(1) getMin() in JavaScript

LeetCode 133: Clone Graph | DFS with Hash Map in JavaScript

LeetCode 125: Valid Palindrome | Clean JavaScript Two-Pointer Solution

LeetCode 121: Best Time to Buy and Sell Stock | JavaScript Greedy Solution

LeetCode 104: Max Depth of Binary Tree | BFS + DFS in JavaScript

LeetCode 102: Level Order Traversal | JavaScript BFS Solution

LeetCode 100: Same Tree | Recursive JavaScript Solution

LeetCode 98: Validate BST | JavaScript Recursive Solution

LeetCode 94: Binary Tree Inorder Traversal | JavaScript Recursion

LeetCode 88 JavaScript | Simple Merge & Sort Approach

LeetCode 70: Climbing Stairs | Bottom-Up DP in JavaScript