Lecture-01 [Graph Traversal ( BFT, DFT ) Part-1]
Lecture-02 [Graph Traversal ( BFT, DFT ) Part-2]
Lecture-03 [Graph Traversal ( BFT, DFT ) Part-3]
Lecture-04 [Graph Traversal ( BFT, DFT ) Part-4]
Lecture-05 [Hashing Part-1]
Lecture-06 [Hashing Part-2]
Lecture-07 [Hashing Part-3]
Lecture-07 [Hashing Part-3]
Lecture-08 [Hashing Part - 4]
Lecture-09 [Arrays Part -1]
Lecture-10 [Arrays Part - 2]
Lecture-11 [Arrays Part - 3]
Lecture-12 [Arrays Part - 4]
Lecture-13 [Linked List Part - 1]
Lecture-14 [Linked List Part - 2]
Lecture-15 [Linked List Part - 3]
Lecture-16 [Linked List Part - 4]
Lecture-17 [Linked List Part - 5]
Lecture-18 [Linked List Part - 6]
Lecture-19 [Linked List Part - 7]
Lecture-20 [Linked List Part - 8]
Lecture-21 [Linked List Part - 9]
Lecture-22 [Binary Search Tree Part-1]
Lecture-23 [Binary Search Tree Part-2]
Lecture-24 [Binary Search Tree Part-3]
Lecture-25 [Binary Search Tree Part-4]
Lecture-26 [Binary Search Tree Part-5]
Lecture-27 [Binary Search Tree Part-6]
Lecture-28 [Binary Search Tree Part-7]
Lecture-29 [Binary Search Tree Part-8]
Lecture-30 [Binary Search Tree Part-9]
Lecture-31 [AVL tree Part-1]
Lecture-32 [AVL tree Part-2]
Lecture-33 [AVL tree Part-3]
Lecture-34 [AVL tree Part-4]
Lecture-35 [Stack Part-1]
Lecture-36 [Stack Part-2]
Lecture-37 [Stack Part-3]
Lecture-38 [Stack Part-4]
Lecture-39 [Application Of Stack Part-1]
Lecture-40 [Application Of Stack Part-2]
Lecture-41 [Application Of Stack Part-3]
Lecture-42 [Application Of Stack (Infix to postfix conversion)]
Lecture-43 [Fibonacci Sequence-1]
Lecture-44 [Fibonacci Sequence-2]
Lecture-45 [Tower of Hanoi]
Lecture-46 [Queue Part-1]
Lecture-47 [Queue Part-2]
RIC-PDS-2 [12 TOUGH AND TRICKY PROBLEMS COVERED]
RIC-PDS-4 [Few more good and tricky problems covered]
RIC-PDS-5 [FEW MORE GOOD & TRICKY PROBLEMS ARE COVERED]