PC97.com - Plus+ Channels for Creators and Shoppers

Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method

26k

PT0H0M0S

How she got Off-Campus Internship + PPO at JP Morgan& Chase | Tier 3 college to Dream company

Shradha KhapraNov 11, 2025

25k

PT18M47S

Topological Sorting using Kahn's Algorithm | Graph - DSA Lecture 121

Shradha KhapraNov 5, 2025

9.8k

PT17M54S

Course Schedule Problem | using Graph & Topological Sort

Shradha KhapraOct 25, 2025

10k

PT23M36S

From BTech to Software Engineer at Amdocs | Placement Journey & Learnings

Shradha KhapraOct 9, 2025

27k

PT15M58S

Topological Sorting in Graph | using DFS | Lecture 117

Shradha KhapraOct 2, 2025

23k

PT15M59S

Detect a Cycle in Directed Graph using DFS | Lecture 116

Shradha KhapraSep 29, 2025

13k

PT26M22S

Rotting Oranges | Multi-source BFS | Leetcode 994

Shradha KhapraSep 16, 2025

19k

PT18M23S

Detect a Cycle in Undirected Graph using BFS | Data Structure & Algorithms

Shradha KhapraSep 9, 2025

15k

PT19M45S

Detect a Cycle in Undirected Graph using DFS | Data Structure & Algorithms

Shradha KhapraSep 8, 2025

21k

PT14M3S

DFS Traversal in Graphs | Data Structure & Algorithms

Shradha KhapraAug 27, 2025

54k

PT18M31S

BFS Traversal in Graphs | Data Structure & Algorithms

Shradha KhapraAug 20, 2025

88k

PT17M16S

BST Iterator | DSA Series : L.107

Shradha KhapraJul 17, 2025

17k

PT11M12S

Populate Next Right Pointers in Each Node | DSA Series : L.106

Shradha KhapraJul 15, 2025

15k

PT24M56S

Largest BST in Binary Tree | DSA Series : L.105

Shradha KhapraJul 3, 2025

21k

PT24M3S

Recover BST | DSA Series : L.104

Shradha KhapraJun 27, 2025

18k

PT16M39S

Merge Two Binary Search Trees | DSA Series : L.103

Shradha KhapraJun 26, 2025

17k

PT19M10S

Construct BST from Preorder | DSA Series : L.102

Shradha KhapraJun 25, 2025

20k

PT12M29S

Lowest Common Ancestor in BST | DSA Series : L.101

Shradha KhapraJun 19, 2025

17k

PT43M16S

Binary Search Trees (BSTs) | DSA Series : L.96

Shradha KhapraMay 20, 2025

95k

PT15M47S

L79. Implement Queue using Stack & Stack using Queue

Shradha KhapraMar 10, 2025

69k

PT15M11S

L75. The Celebrity Problem | Stack & Queue

Shradha KhapraFeb 24, 2025

38k

PT20M4S

L73. Next Greater Element - II | Stack & Queue

Shradha KhapraFeb 13, 2025

39k

Featured Results

DSA Series Quick Update - 125 lectures | New DSA Sheet | DP, Heaps, Tries etc

Bellman Ford Algorithm - Single Source Shortest Path - Dynamic Programming

Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method

How she got Off-Campus Internship + PPO at JP Morgan& Chase | Tier 3 college to Dream company

Topological Sorting using Kahn's Algorithm | Graph - DSA Lecture 121

Course Schedule Problem | using Graph & Topological Sort

From BTech to Software Engineer at Amdocs | Placement Journey & Learnings

Topological Sorting in Graph | using DFS | Lecture 117

Detect a Cycle in Directed Graph using DFS | Lecture 116

Rotting Oranges | Multi-source BFS | Leetcode 994

Detect a Cycle in Undirected Graph using BFS | Data Structure & Algorithms

Detect a Cycle in Undirected Graph using DFS | Data Structure & Algorithms

DFS Traversal in Graphs | Data Structure & Algorithms

BFS Traversal in Graphs | Data Structure & Algorithms

BST Iterator | DSA Series : L.107

Populate Next Right Pointers in Each Node | DSA Series : L.106

Largest BST in Binary Tree | DSA Series : L.105

Recover BST | DSA Series : L.104

Merge Two Binary Search Trees | DSA Series : L.103

Construct BST from Preorder | DSA Series : L.102

Lowest Common Ancestor in BST | DSA Series : L.101

Binary Search Trees (BSTs) | DSA Series : L.96

L79. Implement Queue using Stack & Stack using Queue

L75. The Celebrity Problem | Stack & Queue

L73. Next Greater Element - II | Stack & Queue

You may also like:

Featured Results

DSA Series Quick Update - 125 lectures | New DSA Sheet | DP, Heaps, Tries etc

Bellman Ford Algorithm - Single Source Shortest Path - Dynamic Programming

Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method

How she got Off-Campus Internship + PPO at JP Morgan& Chase | Tier 3 college to Dream company

Topological Sorting using Kahn's Algorithm | Graph - DSA Lecture 121

Course Schedule Problem | using Graph & Topological Sort

From BTech to Software Engineer at Amdocs | Placement Journey & Learnings

Topological Sorting in Graph | using DFS | Lecture 117

Detect a Cycle in Directed Graph using DFS | Lecture 116

Rotting Oranges | Multi-source BFS | Leetcode 994

Detect a Cycle in Undirected Graph using BFS | Data Structure & Algorithms

Detect a Cycle in Undirected Graph using DFS | Data Structure & Algorithms

DFS Traversal in Graphs | Data Structure & Algorithms

BFS Traversal in Graphs | Data Structure & Algorithms

BST Iterator | DSA Series : L.107

Populate Next Right Pointers in Each Node | DSA Series : L.106

Largest BST in Binary Tree | DSA Series : L.105

Recover BST | DSA Series : L.104

Merge Two Binary Search Trees | DSA Series : L.103

Construct BST from Preorder | DSA Series : L.102

Lowest Common Ancestor in BST | DSA Series : L.101

Binary Search Trees (BSTs) | DSA Series : L.96

L79. Implement Queue using Stack & Stack using Queue

L75. The Celebrity Problem | Stack & Queue

L73. Next Greater Element - II | Stack & Queue

You may also like:

Loading...