54:51

Dynamic Programming (2D DP + Bitmasks)

55:57

Dynamic Programming (Top Down Approach)

46:47

Dynamic Programming

47:34

Backtracking Algorithms

56:15

Recursion - Problem Solving

58:36

Building Blocks of Recursion

42:23

Building Robust Apps with Java Spring Boot

46:55

N-pointers

53:54

Two-Pointers Technique

01:00:23

Harder parts of Binary Search

53:39

Binary Search

56:46

Clean Coding Principles

58:48

Factors and Primality Tests

57:46

Maths: GCD and LCM

01:16:25

Constructive Algorithms

01:20:15

Bit Manipulation

01:03:51

Combinatorics

53:07

Learn Combination Techniques

57:18

Precomputation in 2D

54:58

Introduction to Precomputation

09:30

5 Design Patterns to Learn Before Your Interview

28:48

Dynamic Programming | Length of Longest Increasing Subsequence | L-111

19:03

Dynamic Programming | Coin Change Problem | L-110

29:05

Dynamic Programming | Rod Cutting Problem | L-109

08:28

SOLID Principles Explained With Examples- System Design

33:19

Dynamic Programming | Find Maximum Sum of Subsequence Such That No 2 Elements Are Adjacent | L-108

15:59

Chandigarh University to Amazon | Bhoomika Breaks The Code

08:51

Dynamic Programming | Stairs Case Problem | L-107

23:57

Understanding Dynamic Programming by Fibonacci Series | L-106

24:01

Dynamic Programming Introduction | Key Concepts and Techniques | L-105

09:27

Graph | Cycle Detection in Undirected Graph | L-104

17:42

Graph | BFS on Graph(Breadth-First Search) | L-103

07:01

Perfect Roadmap For Low Level Design Interviews

13:18

Graph | Count the No of Island | LeetCode - 200(Medium) | L-102

24:24

Graph | DFS On Graph (Depth First Search ) | Count connected node of Graph | L-101

15:53

Graph | Representation of Graph | Adjacency List | Adjacency Matrix | L-100

32:23

Graph | Introduction to Graph | Master Graph Terminology | L-99

34:56

Backtracking | N-Queen Problem | LeetCode -51 (Hard Problem) | L-98

33:38

Backtracking | Count Number of Different Path | Leet code - 980 (Hard Problem) | L-97

32:23

Backtracking | Rat in Maze Problem | L-96

15:52

Backtracking | Print all the Subset of Set | L-95

20:00

Backtracking | Generate All Unique Permutations of a String with Duplicate Characters | L-94

43:31

Unlock Success in Low Level Design Interviews with Vivekanand Vivek

45:17

Backtracking | Generate all Permutation of String | L-93

23:06

Tree Data Structure | Check if a Given Binary Tree is a BST or NOT | L-92

08:21

Binary Search Tree | Create BST of Smallest Height | L-91

02:29

Binary Search Tree | Print K-th Smallest Element in BST | LeetCode-230(Medium) | L-90

11:30

Binary Search Tree | Delete in BST | Trees Data Structure | L-89

12:24

Binary Search Tree (BST) | Search and Insert in BST | Trees Data Structure | L-88

13:15

From Accenture to Nutanix: How Sohail Cracked MTS Role with Programming Pathshala

15:34

Level Order Traversal | Binary Tree | Tree Data Structure | L-87

38:48

Tree Traversal Iterative Algorithm | Inorder | Preorder | Postorder | Binary Tree | L-86

20:21

From Non-CS, Service-based background to Product Company(THOUGHTSPOT) - Rachit's Inspiring Journey!

20:07

Tree Traversal Recursive Algorithm | Inorder | Preorder | Postorder | Binary Tree | L-85

12:47

Height Balance Tree | Tree Data Structure | L-84

34:29

Diameter of Binary Tree | Tree Data Structure | L-83

20:10

Height of Binary Tree | Trees Data Structure | L-82

08:20

Mirror Image of Binary Tree | Trees Data Structure | L-81

20:58

Count Nodes in a Binary Tree | Trees Data Structure | L-80

41:48

Tree Data Structure | Binary Tree | Complete DSA Course | L-79