10:55

Non-overlapping Intervals | Sorting | GFG POTD | Dry Run & Explanation

19:33

Santa Banta | Graph | Sieve of Eratosthenes| GFG Practice | Dry Run & Explanation

30:23

2.Fundamentals (Part-1) | Javascript | Basics to Advance

06:56

1.Introduction | Javascript | Basics To Advance

08:22

Rotate Array | Array | GFG POTD | Dry Run & Explanation

29:18

Quick Sort on Linked List | Sorting | GFG POTD | Dry Run & Explanation

25:17

Sub-arrays with equal number of occurences | Hashmap | GFG POTD | Dry Run & Explanation

19:13

Subarray range with given sum | HashMap | GFG POTD | Dry Run & Explanation

28:59

Majority Vote | Boyer-Moore's Majority Voting Algorithm | GFG POTD | Dry Run & Explanation

09:16

Rotate and delete | Array | GFG POTD | Dry Run & Explanation

16:04

Bipartite Graph | Graph | GFG PRACTICE | Dry Run & Explanation

18:28

Merge two BST 's | Binary Search Tree | GFG POTD | Dry Run & Explanation

22:25

Minimal Cost | Recursion | Dynamic Programing | GFG POTD | Dry Run & Explanation

07:16

Palindrome Linked List | Linked List | GFG POTD | Dry Run & Explanation

20:18

Smallest window in a string containing all the characters of another string | GFG POTD | Dry Run

10:41

Missing And Repeating | Arrays | GFG POTD | Dry Run & Explanation

27:24

Longest Prefix Suffix | String Matching(KMP) | GFG POTD | Dry Run & Explanation

15:32

Clone a linked list with next and random pointer | Linked List | GFG POTD | Dry Run & Explanation

05:38

Facing the sun | Array | GFG POTD | Dry Run & Explanation

05:41

Reverse Words | Strings | GFG POTD | Dry Run & Explanation

07:33

Parenthesis Checker | Stack | GFG POTD | Dry Run & Explanation

08:14

Minimize the Heights II | Greedy | GFG POTD | Dry Run & Explanation

14:07

Longest valid Parentheses | Stack | GFG POTD | Dry Run & Explanation

20:08

Binary Tree to DLL(Doubly Linked List) | Binary Tree | GFG POTD | Dry Run & Explanation

14:11

Topological sort | Kahn's Algorithm(BFS) | Graph | GFG Practice | Dry Run & Explanation

04:49

Alternate positive and negative numbers | Arrays | GFG POTD | Dry Run & Explained

07:25

Mirror Tree | Tree | GFG POTD | Dry Run & Explanation

03:33

Middle of a Linked List | Linked List | GFG POTD | Dry Run & Explanation

06:40

Minimum Cost of ropes | Queue | Heap | GFG POTD | Dry Run & Explanation

22:58

Circle of strings | Graph | Eulerian Cycle | GFG POTD | Dry Run & Explanation

05:48

Sort 0s, 1s and 2s | Array | GFG POTD | Dry Run & Explanation

15:04

Topological Sort | DFS | Graph | Dry Run & Explanation

09:20

Minimum Jumps | Greedy | GFG POTD | Dry Run & Explaination

12:19

Nth Natural Number | Maths | GFG POTD | Dry Run & Explanation

14:21

Kadanes Algorithm | Maximum Sum Subarry | GFG POTD | Dry Run & Intution

04:38

Missing in Array | Array | GFG POTD | Dry Run & Explanation

15:10

Count ways to N'th Stair | Recursion + DP | GFG POTD | Dry Run & Explanation

23:04

Minimum number of deletions and insertions | Recursion + DP | GFG POTD | Dry Run & Explaination

07:13

1894. Find the Student that Will Replace the Chalk | Array | Leetcode POTD | Dry Run & Explanation

22:27

Minimum Cost Path | Dijkstra's Algorithm(Graph) | GFG POTD | Dry Run & Explained

06:27

Depth First Search [DFS] | Graph | GFG Practice

16:31

Max sum path in two arrays | Arrays | GFG POTD | Dry Run & Explained

12:49

Directed Graph Cycle | Graph | GFG Practice | Dry Run & Detailed Explaination

14:38

Sorted subsequence of size 3 | Stack | GFG POTD | Dry Run

18:40

N-Queen Problem | Backtracking | GFG POTD | Dry Run

11:38

Find Length of Loop | Linked List | GFG POTD

14:27

Sorting Elements of an Array by Frequecy | Sorting | Lambda Function | GFG POTD

13:36

Maximum Difference | Stack | GFG POTD | Easy Explained

11:55

N-ary Tree Postorder Traversal | Tree | Leetcode POTD

08:24

Breadth First Search | BFS | Graph | GFG Practice

13:17

Cycle Detection in Undirected Graph | DFS | Graph | GFG Practice