\
6:19 Menu Driven Program for Matrices
21:17 Menu Driven Program for Matrices using Functions
26:11 How to Write C Classes for All Matrices
Matrix and Polynomial Representation\
38:07 Sparse Matrix Representation
46:53 Addition of Sparse Matrices
56:11 Array Representation of Sparse Matrix
1:07:32 Let’s Code to Create Sparse Matrix
1:17:59 Program for Adding Sparse Matrix
1:33:19 Let’s Code to Add Sparse Matrix
1:46:51 Let’s Code Sparse Matrix using C
1:56:01 Let’s Code Sparse Matrix using C Continued
2:10:37 Polynomial Representation
2:21:03 Polynomial Evaluation
2:25:07 Polynomial Addition
2:34:06 Let’s Code Polynomial
List\
2:51:29 Why we need Dynamic Data Structure Linked List
3:00:46 About Linked List
3:10:44 More About Linked List
3:18:37 Display Linked List
3:24:18 Let’s Code Display for Linked List
3:34:37 Recursive Display of Linked List
3:48:24 Let’s Code Recursive Display for Linked List
3:52:15 Counting Nodes in a Linked List
4:02:49 Sum of All Elements in a Linked List
4:06:48 Let’s Code Count and Sum
4:14:08 Maximum Element in a Linked List
4:20:30 Let’s Code Max for Linked List
4:24:02 Searching in a Linked List
4:28:40 Improve Searching in Linked List
4:37:09 Let’s Code Searching in Linked List
4:45:07 Inserting in a Linked List
5:01:43 Let’s Code Insert for Linked List
5:08:17 Creating a Linked List using Insert
5:10:41 Creating a Linked List by Inserting at Last
5:17:45 Inserting in a Sorted Linked List
5:24:43 Let’s Code Insert in Sorted Linked List
5:30:30 Deleting from Linked List
5:42:34 Let’s Code Delete on Linked List
5:48:39 Check if a Linked List is Sorted
5:56:54 Let’s Code to check if Linked List is Sorted
5:59:33 Remove Duplicates from Sorted Linked List
6:05:33 Let’s Code to Remove Duplicates from Sorted Linked List
6:08:19 Reversing a Linked List
6:15:09 Reversing using Sliding Pointers
6:25:35 Recursive Reverse for Linked List
6:29:53 Let’s Code Reversing a Linked List
6:36:30 Concatenating 2 Linked Lists
6:39:34 Merging 2 Linked Lists
6:53:58 Let’s Code to Concatenate and Merge Linked Lists
7:02:35 Check for LOOP in Linked List
7:11:52 Let’s Code to Check LOOP
7:16:02 Let’s Code a C class for Linked List
7:22:44 Circular Linked List
7:29:39 Display Circular Linked List
7:38:09 Let8217s Code Circular Linked List
7:45:16 Inserting in a Circular Linked List
7:55:37 Let’s Code Insert for a Circular Linked List
8:01:34 Deleting From Circular Linked List
8:08:09 Let’s Code Delete for Circular Linked List
8:13:07 Doubly Linked List
8:17:20 Let’s Code Doubly Linked List
8:22:46 Insert in a Doubly Linked List
8:32:13 Let’s Code Insert for Doubly Linked List
8:36:27 Deleting from Doubly Linked List
8:44:37 Let’s Code Delete for Doubly Linked List
8:48:51 Reverse a Doubly Linked List
8:54:19 Let’s Code Reverse for Doubly Linked List
8:56:39 Circular Doubly Linked List
9:04:00 Comparison of Linked List
9:15:10 Comparison of Array with Linked List
9:26:04 Student Challenge _ Finding Middle Element of a Linked List
9:36:32 Student Challenge _ Finding Intersecting point of Two Linked List
Matrix and Polynomial using Linked List\
9:45:24 Student Challenge _ Sparse Matrix using Linked List
9:55:06 Student Challenge_ Polynomial Representation using Linked List
10:02:14 Let’s Code Polynomial
\
10:10:48 Introduction to Stack
10:22:59 Stack using Array
10:32:51 Implementation os Stack using Array
10:49:43 Let’s Code Stack using Array
11:02:25 Stack using Linked List
11:07:46 Stack Operations using Linked List
11:16:38 Let’s Code Stack using Linked List
11:24:00 Let’s Code C class for Stack using Linked List
11:30:10 Parenthesis Matching
11:36:50 Program for Parenthesis Matching
11:45:07 Let’s Code Parenthesis Matching
11:49:22 More on Parenthesis Matching
11:55:49 Infix to Postfix Conversion