ViewTube

ViewTube
Sign inSign up
Author thumbnail

Kantan Coding

Algorithmic Patterns for Coding Interview/Leetcode Problems

74,458 views
22 items
Last updated on Mar 22, 2024
public playlist
Kantan Coding
Algorithmic Patterns: Intro
3:08
Algorithmic Patterns: Intro

Kantan Coding
Sliding Window Pattern: 1/4 (Maximum Average Subarray I)
55:37
Sliding Window Pattern: 1/4 (Maximum Average Subarray I)

Kantan Coding
Sliding Window Pattern: 2/4 (Fruit Into Baskets)
39:38
Sliding Window Pattern: 2/4 (Fruit Into Baskets)

Kantan Coding
Sliding Window Pattern: 3/4 (Longest Substring Without Repeating Characters)
33:38
Sliding Window Pattern: 3/4 (Longest Substring Without Repeating Characters)

Kantan Coding
Sliding Window Pattern: 4/4 (Minimum Size Subarray Sum)
23:43
Sliding Window Pattern: 4/4 (Minimum Size Subarray Sum)

Kantan Coding
Two Pointers Pattern: 1/3 (Two Sum II - Input Array Is Sorted)
27:57
Two Pointers Pattern: 1/3 (Two Sum II - Input Array Is Sorted)

Kantan Coding
Two Pointers Pattern: 2/3 (Container With Most Water)
31:31
Two Pointers Pattern: 2/3 (Container With Most Water)

Kantan Coding
Two Pointers Pattern: 3/3 (Merge Two Sorted Lists)
42:35
Two Pointers Pattern: 3/3 (Merge Two Sorted Lists)

Kantan Coding
Breadth First Search (BFS) Pattern: 1/3 (Binary Tree Level Order Traversal)
25:40
Breadth First Search (BFS) Pattern: 1/3 (Binary Tree Level Order Traversal)

Kantan Coding
Breadth First Search (BFS) Pattern: 2/3 (Average of Levels in Binary Tree)
23:05
Breadth First Search (BFS) Pattern: 2/3 (Average of Levels in Binary Tree)

Kantan Coding
Breadth First Search (BFS) Pattern: 3/3 (Minimum Depth of Binary Tree)
15:46
Breadth First Search (BFS) Pattern: 3/3 (Minimum Depth of Binary Tree)

Kantan Coding
Depth First Search Gently Placed Into Your Brain (DFS)
9:23
Depth First Search Gently Placed Into Your Brain (DFS)

Kantan Coding
Binary Search Pattern: 1/2 (Binary Search)
36:36
Binary Search Pattern: 1/2 (Binary Search)

Kantan Coding
Binary Search Pattern: 2/2 (Peak Index in a Mountain Array)
26:40
Binary Search Pattern: 2/2 (Peak Index in a Mountain Array)

Kantan Coding
Dynamic Programming For Beginners
16:45
Dynamic Programming For Beginners

Kantan Coding
How Robbing Houses Can Make You Better At Dynamic Programming
18:04
How Robbing Houses Can Make You Better At Dynamic Programming

Kantan Coding
You Must Learn This Pattern | Topological Sort
10:12
You Must Learn This Pattern | Topological Sort

Kantan Coding
Divide & Conquer Algorithm In 3 Minutes
3:01
Divide & Conquer Algorithm In 3 Minutes

Kantan Coding
K Way Merge Using Divide & Conquer (In 3 Minutes)
3:11
K Way Merge Using Divide & Conquer (In 3 Minutes)

Kantan Coding
Repeat These Steps On One Hard Coding Interview Problem Per Day
4:24
Repeat These Steps On One Hard Coding Interview Problem Per Day

Kantan Coding
Top 7 Algorithms for Coding Interviews Visualized
33:45
Top 7 Algorithms for Coding Interviews Visualized

Kantan Coding
Merge Interval Algorithm In 4 Minutes
6:02
Merge Interval Algorithm In 4 Minutes