Crappy Coder

LeetCode 542: 01 Matrix | JavaScript BFS Solution Explained

Crappy Coder

LeetCode 542: 01 Matrix | JavaScript BFS Solution Explained

14:05

LeetCode 733: Flood Fill BFS Solution | JavaScript Explained

Crappy Coder

LeetCode 733: Flood Fill BFS Solution | JavaScript Explained

11:33

LeetCode 733: Flood Fill | JavaScript DFS Solution Explained

Crappy Coder

LeetCode 733: Flood Fill | JavaScript DFS Solution Explained

7:23

LeetCode 142: Linked List Cycle II | Set Based Solution

Crappy Coder

LeetCode 142: Linked List Cycle II | Set Based Solution

4:07

LeetCode 380: Insert Delete GetRandom O(1) | Optimized JavaScript Solution Explained

Crappy Coder

LeetCode 380: Insert Delete GetRandom O(1) | Optimized JavaScript Solution Explained

10:21

LeetCode 451: Sort Characters by Frequency | JavaScript Solution

Crappy Coder

LeetCode 451: Sort Characters by Frequency | JavaScript Solution

7:17

LeetCode 198: House Robber | My Unique DP Solution (JavaScript)

Crappy Coder

LeetCode 198: House Robber | My Unique DP Solution (JavaScript)

7:09

LeetCode 657: Robot Return to Origin | JavaScript Explained

Crappy Coder

LeetCode 657: Robot Return to Origin | JavaScript Explained

5:27

LeetCode 322: Coin Change Explained | JavaScript DP Solution

Crappy Coder

LeetCode 322: Coin Change Explained | JavaScript DP Solution

11:54

LeetCode 54: Spiral Matrix | Clean JavaScript Solution

Crappy Coder

LeetCode 54: Spiral Matrix | Clean JavaScript Solution

13:14

LeetCode 289: Game of Life Explained | JavaScript Grid Solution

Crappy Coder

LeetCode 289: Game of Life Explained | JavaScript Grid Solution

15:04

LeetCode 283: Move Zeroes In-Place | JavaScript Trick

Crappy Coder

LeetCode 283: Move Zeroes In-Place | JavaScript Trick

6:44

LeetCode 231: Is It a Power of Two? | JavaScript Solution

Crappy Coder

LeetCode 231: Is It a Power of Two? | JavaScript Solution

4:13

LeetCode 350: Array Intersection II | JavaScript Solution

Crappy Coder

LeetCode 350: Array Intersection II | JavaScript Solution

5:47

LeetCode 349: Intersection of Two Arrays | JavaScript Solution

Crappy Coder

LeetCode 349: Intersection of Two Arrays | JavaScript Solution

4:39

LeetCode 66: Plus One | Clean JavaScript Solution

Crappy Coder

LeetCode 66: Plus One | Clean JavaScript Solution

5:37

LeetCode 101: Is the Tree Symmetric? | JavaScript Solution

Crappy Coder

LeetCode 101: Is the Tree Symmetric? | JavaScript Solution

5:36

LeetCode 146: LRU Cache Explained in JavaScript!

Crappy Coder

LeetCode 146: LRU Cache Explained in JavaScript!

10:00

LeetCode 17: Letter Combinations | JavaScript Clean Solution

Crappy Coder

LeetCode 17: Letter Combinations | JavaScript Clean Solution

10:33

LeetCode 16: 3Sum Closest | Clean JavaScript Solution

Crappy Coder

LeetCode 16: 3Sum Closest | Clean JavaScript Solution

9:56

LeetCode 13: Roman to Integer | Clean JavaScript Solution

Crappy Coder

LeetCode 13: Roman to Integer | Clean JavaScript Solution

9:11

LeetCode 8: ATOI Solved Simply in JavaScript

Crappy Coder

LeetCode 8: ATOI Solved Simply in JavaScript

4:41

LeetCode 7: Reverse Integer in JavaScript | String Trick ✅

Crappy Coder

LeetCode 7: Reverse Integer in JavaScript | String Trick ✅

6:23

LeetCode 141: Don’t Use Set Until You See This!

Crappy Coder

LeetCode 141: Don’t Use Set Until You See This!

5:57

LeetCode 2: Add Two Numbers | Linked List Walkthrough (JavaScript)

Crappy Coder

LeetCode 2: Add Two Numbers | Linked List Walkthrough (JavaScript)

10:49

LeetCode 1603: Design Parking System | JavaScript OOP Solution

Crappy Coder

LeetCode 1603: Design Parking System | JavaScript OOP Solution

6:25

LeetCode 1492: Kth Factor of N | JavaScript Brute Force Solution

Crappy Coder

LeetCode 1492: Kth Factor of N | JavaScript Brute Force Solution

6:12

LeetCode 1143: LCS with Dynamic Programming | JavaScript Tutorial

Crappy Coder

LeetCode 1143: LCS with Dynamic Programming | JavaScript Tutorial

10:09

LeetCode 704: Binary Search Step-by-Step (for Beginners)

Crappy Coder

LeetCode 704: Binary Search Step-by-Step (for Beginners)

7:47

LeetCode 605: Can Place Flowers | Clean JavaScript Logic

Crappy Coder

LeetCode 605: Can Place Flowers | Clean JavaScript Logic

7:39

LeetCode 15: 3Sum | Optimal Two-Pointer JavaScript Solution

Crappy Coder

LeetCode 15: 3Sum | Optimal Two-Pointer JavaScript Solution

10:13

LeetCode 412: FizzBuzz | Clean JavaScript Solution

Crappy Coder

LeetCode 412: FizzBuzz | Clean JavaScript Solution

8:47

LeetCode 389: Find the Difference | JavaScript Sort + Compare

Crappy Coder

LeetCode 389: Find the Difference | JavaScript Sort + Compare

6:02

LeetCode 347: Top K Frequent Elements | Clean JavaScript Solution

Crappy Coder

LeetCode 347: Top K Frequent Elements | Clean JavaScript Solution

7:40

LeetCode 344: Reverse String | In-Place Swap in JavaScript

Crappy Coder

LeetCode 344: Reverse String | In-Place Swap in JavaScript

5:32

LeetCode 9: Palindrome Number | Two-Pointer JavaScript Solution

Crappy Coder

LeetCode 9: Palindrome Number | Two-Pointer JavaScript Solution

4:10

LeetCode 169: Majority Element | JavaScript Map + Sort Solution

Crappy Coder

LeetCode 169: Majority Element | JavaScript Map + Sort Solution

5:37

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

Crappy Coder

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

5:16

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

Crappy Coder

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

7:15

LeetCode 56: Merge Intervals | JavaScript Clean Solution

Crappy Coder

LeetCode 56: Merge Intervals | JavaScript Clean Solution

10:42

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

Crappy Coder

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

9:30

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

Crappy Coder

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

11:50

LeetCode 543: Diameter of Binary Tree | Clean JavaScript Recursion

Crappy Coder

LeetCode 543: Diameter of Binary Tree | Clean JavaScript Recursion

5:56

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

Crappy Coder

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

10:29

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

Crappy Coder

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

4:45

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

Crappy Coder

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

6:31

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

Crappy Coder

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

6:20

LeetCode 226: Invert Binary Tree | Recursion in JavaScript

Crappy Coder

LeetCode 226: Invert Binary Tree | Recursion in JavaScript

5:55

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

Crappy Coder

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

6:49

LeetCode 208: Implement Trie | JavaScript Prefix Tree Solution

Crappy Coder

LeetCode 208: Implement Trie | JavaScript Prefix Tree Solution

8:45

LeetCode 206: Reverse Linked List | Iterative JavaScript Solution

Crappy Coder

LeetCode 206: Reverse Linked List | Iterative JavaScript Solution

7:44

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

Crappy Coder

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

11:43

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

Crappy Coder

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

7:18

LeetCode 162: Find Peak Element | Binary Search in JavaScript

Crappy Coder

LeetCode 162: Find Peak Element | Binary Search in JavaScript

7:17

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

Crappy Coder

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

7:56

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

Crappy Coder

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

9:06

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

Crappy Coder

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

7:48

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

Crappy Coder

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

5:52

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

Crappy Coder

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

8:44

LeetCode 102: Level Order Traversal | JavaScript BFS Solution

Crappy Coder

LeetCode 102: Level Order Traversal | JavaScript BFS Solution

9:28

LeetCode 100: Same Tree | Recursive JavaScript Solution

Crappy Coder

LeetCode 100: Same Tree | Recursive JavaScript Solution

4:36

LeetCode 98: Validate BST | JavaScript Recursive Solution

Crappy Coder

LeetCode 98: Validate BST | JavaScript Recursive Solution

6:08

LeetCode 94: Binary Tree Inorder Traversal | JavaScript Recursion

Crappy Coder

LeetCode 94: Binary Tree Inorder Traversal | JavaScript Recursion

6:37

LeetCode 88 JavaScript | Simple Merge & Sort Approach

Crappy Coder

LeetCode 88 JavaScript | Simple Merge & Sort Approach

4:22

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

Crappy Coder

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

7:13

LeetCode 45: Jump Game II | Greedy JavaScript Solution (Min Jumps)

Crappy Coder

LeetCode 45: Jump Game II | Greedy JavaScript Solution (Min Jumps)

7:44

LeetCode 55: Jump Game | Reverse Greedy JavaScript Solution

Crappy Coder

LeetCode 55: Jump Game | Reverse Greedy JavaScript Solution

8:25

LeetCode 49: Group Anagrams | Hash Map Trick in JavaScript

Crappy Coder

LeetCode 49: Group Anagrams | Hash Map Trick in JavaScript

6:16

LeetCode 33: Search in Rotated Sorted Array | Binary Search in JavaScript

Crappy Coder

LeetCode 33: Search in Rotated Sorted Array | Binary Search in JavaScript

9:21

LeetCode 27: Remove Element In-Place | JavaScript Two-Pointer Trick

Crappy Coder

LeetCode 27: Remove Element In-Place | JavaScript Two-Pointer Trick

5:57

LeetCode 26 Remove Duplicates From Sorted Array | In-Place Array Manipulation in JavaScript

Crappy Coder

LeetCode 26 Remove Duplicates From Sorted Array | In-Place Array Manipulation in JavaScript

7:00

LeetCode 23: Merge k Sorted Lists | JavaScript Walkthrough

Crappy Coder

LeetCode 23: Merge k Sorted Lists | JavaScript Walkthrough

10:39

LeetCode 21: Merge Two Sorted Lists | JavaScript Solution Explained

Crappy Coder

LeetCode 21: Merge Two Sorted Lists | JavaScript Solution Explained

7:18

LeetCode 20: Valid Parentheses | Stack-Based JavaScript Solution Explained

Crappy Coder

LeetCode 20: Valid Parentheses | Stack-Based JavaScript Solution Explained

7:38

LeetCode 11: Container With Most Water | Brute Force + Two Pointer Explained (JavaScript)

Crappy Coder

LeetCode 11: Container With Most Water | Brute Force + Two Pointer Explained (JavaScript)

14:11

LeetCode 5: Longest Palindromic Substring | Clear & Visual Explanation

Crappy Coder

LeetCode 5: Longest Palindromic Substring | Clear & Visual Explanation

9:38

LeetCode 3: Longest Substring || Full Walkthrough

Crappy Coder

LeetCode 3: Longest Substring || Full Walkthrough

14:03

LeetCode 1: Two Sum || Beginner Freindly Leetcode

Crappy Coder

LeetCode 1: Two Sum || Beginner Freindly Leetcode

9:28

次のページ