🤖 WALL ROBO – Coverage Algorithm Project
proteinCoder
🤖 WALL ROBO – Coverage Algorithm Project
19:38
CHECK SUBSEQUENCE SUM EQUAL TO K | DP ON SUBSEQUENCES | DP CONCEPTS |
proteinCoder
CHECK SUBSEQUENCE SUM EQUAL TO K | DP ON SUBSEQUENCES | DP CONCEPTS |
11:11
MAXIMUM NON NEGATIVE PRODUCT IN A MATRIX | LEETCODE : 1594 | DP ON GRIDS | DP CONCEPTS |
proteinCoder
MAXIMUM NON NEGATIVE PRODUCT IN A MATRIX | LEETCODE : 1594 | DP ON GRIDS | DP CONCEPTS |
10:05
MINIMUM PATH SUM 2 | LEETCODE : 1289 | DP ON GRIDS | DP CONCEPTS |
proteinCoder
MINIMUM PATH SUM 2 | LEETCODE : 1289 | DP ON GRIDS | DP CONCEPTS |
9:15
MINIMUM PATH SUM | LEETCODE : 64 | DP ON GRIDS | DP CONCEPTS |
proteinCoder
MINIMUM PATH SUM | LEETCODE : 64 | DP ON GRIDS | DP CONCEPTS |
8:44
UNIQUE PATHS | DP ON GRIDS | LEETCODE : 62 | DP CONCEPTS |
proteinCoder
UNIQUE PATHS | DP ON GRIDS | LEETCODE : 62 | DP CONCEPTS |
8:45
MAXIMUM ALTERNATING SUBSEQUENCE SUM | LEETCODE 1911 | 2D DP | DP CONCEPTS |
proteinCoder
MAXIMUM ALTERNATING SUBSEQUENCE SUM | LEETCODE 1911 | 2D DP | DP CONCEPTS |
11:05
FROG JUMP | 1D DP | MEMOIZATION | TABULATION | SPACE OPTIMIZED | DP CONCEPTS |
proteinCoder
FROG JUMP | 1D DP | MEMOIZATION | TABULATION | SPACE OPTIMIZED | DP CONCEPTS |
8:26
HOUSE ROBBER | LEETCODE : 198 | 1D - DP | DYNAMIC PROGRAMMING CONCEPTS |
proteinCoder
HOUSE ROBBER | LEETCODE : 198 | 1D - DP | DYNAMIC PROGRAMMING CONCEPTS |
8:36
INTRODUCTION TO DYNAMIC PROGRAMMING | FIBONACCI NUMBER | RECURSION | MEMOIZATION | TABULATION |
proteinCoder
INTRODUCTION TO DYNAMIC PROGRAMMING | FIBONACCI NUMBER | RECURSION | MEMOIZATION | TABULATION |
9:32
HANDLING SUM QUERIES AFTER UPDATE | Leetcode 2569 | LAZY PROPOGATION | SEGMENT TREE CONCEPTS |
proteinCoder
HANDLING SUM QUERIES AFTER UPDATE | Leetcode 2569 | LAZY PROPOGATION | SEGMENT TREE CONCEPTS |
10:47
LAZY PROPOGATION | RANGE UPDATE QUERY | SEGMENMT TREE CONCEPTS
proteinCoder
LAZY PROPOGATION | RANGE UPDATE QUERY | SEGMENMT TREE CONCEPTS
11:18
SUM OF QUERY 2 | RANGE MINIMUM QUERY | SEGMENT TREE CONCEPTS |
proteinCoder
SUM OF QUERY 2 | RANGE MINIMUM QUERY | SEGMENT TREE CONCEPTS |
8:07
RANGE SUM QUERY | SEGMENT TREE CONCEPTS |
proteinCoder
RANGE SUM QUERY | SEGMENT TREE CONCEPTS |
4:51
UPDATE QUERY | SEGMENT TREE CONCEPTS |
proteinCoder
UPDATE QUERY | SEGMENT TREE CONCEPTS |
6:45
BUILD SEGMENT TREE | INTRO | SEGMENT TREE |
proteinCoder
BUILD SEGMENT TREE | INTRO | SEGMENT TREE |
9:57
TARZAN'S ALGORITHM | STRONGLY CONNECTED COMPONENTS | GRAPH CONCEPTS |
proteinCoder
TARZAN'S ALGORITHM | STRONGLY CONNECTED COMPONENTS | GRAPH CONCEPTS |
8:58
KOSARAJU'S ALGORITHM | STRONGLY CONNECTED COMPONENTS | GRAPH CONCEPTS |
proteinCoder
KOSARAJU'S ALGORITHM | STRONGLY CONNECTED COMPONENTS | GRAPH CONCEPTS |
10:57
HAMILTONIAN PATH | HAMILTONIAN CYCLE | GRAPH CONCEPTS |
proteinCoder
HAMILTONIAN PATH | HAMILTONIAN CYCLE | GRAPH CONCEPTS |
5:13
ARTICULATION POINTS | TARZAN'S ALGO | GRAPH |
proteinCoder
ARTICULATION POINTS | TARZAN'S ALGO | GRAPH |
8:30
BRIDGES IN GRAPH | CRITICAL CONNECTIONS | TARZAN'S ALGORITHM |
proteinCoder
BRIDGES IN GRAPH | CRITICAL CONNECTIONS | TARZAN'S ALGORITHM |
8:53
KRUSKALS ALGORITHM | MINIMUM SPANNING TREE | DSU | GRAPH CONCEPTS |
proteinCoder
KRUSKALS ALGORITHM | MINIMUM SPANNING TREE | DSU | GRAPH CONCEPTS |
7:47
CYCLE-DETECTION | DSU | GRAPH CONCEPTS |
proteinCoder
CYCLE-DETECTION | DSU | GRAPH CONCEPTS |
4:17
DSU | DISJOINT SET UNION | UNION FIND | UNION BY RANK | PATH COMPRESSION |
proteinCoder
DSU | DISJOINT SET UNION | UNION FIND | UNION BY RANK | PATH COMPRESSION |
10:31
PRIMS ALGORITHM | MINIMUM SPANNING TREE |
proteinCoder
PRIMS ALGORITHM | MINIMUM SPANNING TREE |
8:14
EULER PATH | EULER CIRCUIT |
proteinCoder
EULER PATH | EULER CIRCUIT |
6:27
FLOYD - WARSHALL | MULTISOURCE SHORTEST PATH ALGORITHM |
proteinCoder
FLOYD - WARSHALL | MULTISOURCE SHORTEST PATH ALGORITHM |
6:51
BELLMAN-FORD | GRAPH | SINGLE POINT SHORTEST ALGORITHM |
proteinCoder
BELLMAN-FORD | GRAPH | SINGLE POINT SHORTEST ALGORITHM |
7:44
Minimum Cost to Reach Destination in Time | Leetcode 1928 | DIJKSTRA'S |
proteinCoder
Minimum Cost to Reach Destination in Time | Leetcode 1928 | DIJKSTRA'S |
6:28
DIJKSTRA'S | MIN-HEAP | PRIORITY QUEUE |
proteinCoder
DIJKSTRA'S | MIN-HEAP | PRIORITY QUEUE |
6:18
DIJKSTRA'S INTRO | INTUTION | BASIC LOGIC | WITHOUT PRIORITY QUEUE AND SET |
proteinCoder
DIJKSTRA'S INTRO | INTUTION | BASIC LOGIC | WITHOUT PRIORITY QUEUE AND SET |
11:40
SHORTEST PATH | DAG | Directed Acyclic Graph | Toposort |
proteinCoder
SHORTEST PATH | DAG | Directed Acyclic Graph | Toposort |
7:20
SHORTEST PATH | UNDIRECTED GRAPH | UNIT-WEIGHTS |
proteinCoder
SHORTEST PATH | UNDIRECTED GRAPH | UNIT-WEIGHTS |
4:21
Bipartite Graph | DFS | BFS |
proteinCoder
Bipartite Graph | DFS | BFS |
7:25
Topological Sorting | Topo Sort | Kahn's | BFS | Cycle in Directed Graph Via BFS |
proteinCoder
Topological Sorting | Topo Sort | Kahn's | BFS | Cycle in Directed Graph Via BFS |
11:41
Topological Sorting | Topo Sort | DFS
proteinCoder
Topological Sorting | Topo Sort | DFS
6:30
Cycle Detection | Directed-Graph | DFS
proteinCoder
Cycle Detection | Directed-Graph | DFS
5:09
Intro To Graph Data Structure
proteinCoder
Intro To Graph Data Structure
7:40
Cycle-Detection Undirected Graph | DFS | BFS
proteinCoder
Cycle-Detection Undirected Graph | DFS | BFS
9:31
ROTTEN ORANGES | Multi source BFS | Leetcode - 994
proteinCoder
ROTTEN ORANGES | Multi source BFS | Leetcode - 994
12:48
Number of Provinces | dfs | bfs
proteinCoder
Number of Provinces | dfs | bfs
5:12
DFS / BFS Graph Traversals
proteinCoder
DFS / BFS Graph Traversals
11:44