Get Bonus Downloads Here.url

   001 What is Algorithm Runtime Analysis.en.srt

   002 Run time analysis.en.srt

   003 Time Complexity Analysis Example #2.html

   001 What is an array & why we need an array.en.srt

   002 Types of array.en.srt

   003 How is an array represented in RAM.en.srt

   004 Create a 1D Array.en.srt

   005 Traverse 1D Array.en.srt

   006 Get, Insert, Update & Delete Operations in 1D Array.en.srt

   007 Searching Algorithms (Linear Search + Binary Search).en.srt

   008 Create a 2D Array.en.srt

   009 Get, Insert & Update Operations in 2D Array.en.srt

   010 Traverse 2D Array.en.srt

   011 1D Array Problem_ Move Zeroes.en.srt

   012 1D Array Problem_ Remove Duplicates from Sorted Array.en.srt

   013 2D Array Problem_ Rotate Image.en.srt

   014 2D Array Problem_ Spiral Matrix.en.srt

   BinarySearch.java

   OperationsIn1DArray.java

   RemoveDuplicates.java

   SpiralMatrix.java

   001 What is Linked List.en.srt

   002 Different Types of Linked Lists.en.srt

   003 Creation & Insertion Operations in SLL (Singly Linked List).en.srt

   004 Insertion (At Index, At Begining & At End) Operations in SSL(Singly LInked List).en.srt

   005 Travering & Searching in SLL (Singly Linked List).en.srt

   006 Deleting Node & Deleting Entire Linked List (Singly Linked List).en.srt

   007 Source Code for Singly Linked List (SLL).html

   008 Creation & Insertion Operations in CSLL (Circular Singly Linked List).mp4

   009 Traversing & Searching in CSLL (Circular Singly Linked List).mp4

   010 Insertion in CSLL (Circular Singly Linked List).mp4

   011 Deleting Node & Deleting Entire Linked List (Circular Singly Linked List).mp4

   013 Creation & Insertion Operations in DLL (Doubly Linked List).en.srt

   014 Traversing & Searching in DLL (Doubly Linked List).en.srt

   015 Insertion in DLL (Doubly LInked List).en.srt

   016 Deleting Node & Deleting Enire Linked List (Doubly Linked List).en.srt

   017 Source Code for Doubly Linked List (DLL).html

   018 Creation & Insertion Operations in CDLL (Circular Doubly Linked LIst).mp4

   019 Traversing & Searching in CDLL (Circular Doubly Linked List).mp4

   020 Insertion in CDLL (Circular Doubly Linked List).mp4

   021 Deleting Node & Deleting Entire Linked List (Circular Doubly Linked List).mp4

   023 Linked List Problem_ Reverse a Singly Linked List -- Recursive Solution.en.srt

   024 Linked List Problem_ Reverse a Singly Linked List -- Iterative Solution.en.srt

   MyCircularDoublyLinkedList.java

   MyDoublyLinkedList.java

   001 What is Stack.en.srt

   002 Stack Implementation Options.en.srt

   003 Array - Create, Push & Pop.en.srt

   004 Array - Peek, isEmpty, isFull & deleteStack.en.srt

   005 Source Code -- Stack Using Array.html

   006 Linked List - Create, Push & Pop.mp4

   007 Linked List - Peek, isEmpty, & deleteStack.mp4

   009 Stack Problem_ Valid Parentheses.en.srt

   010 Stack Problem_ Decode String.en.srt

   StackUsingArray.java

   001 What is Queue.en.srt

   002 Queue Implementation Options.en.srt

   003 Array - Linear Queue.en.srt

   004 Source Code - Linear Queue Implementation using Array.html

   005 Array - Circular Queue.mp4

   007 Linked List - Linear Queue.en.srt

   008 Source Code - Linear Queue Implementation using LInked List.html

   LinearQueueUsingArray.java

   001 What is Tree & Why should we learn tree.en.srt

   002 Tree Terminologies __ Root, Leaf, Edge, Ancestor, ... Depth of Tree __.en.srt

   003 Tree Terminologies __ Predecessor & Successor __.en.srt

   004 What is Binary Tree.en.srt

   005 Types of Binary Tree.en.srt

   006 How is Tree Represented __ Linked List & Array Representation __.en.srt

   007 Create Binary Tree & Insert Value __ Linked List Implementation __.en.srt

   008 Search for a Value in Binary Tree.en.srt

   009 Delete Value from Binary Tree.en.srt

   010 Delete Binary Tree.en.srt

   011 Tree Traversal Techniques __ Inorder, Preorder & Postorder Traversal __.en.srt

   012 Preorder Traversal Details __ Recursive + Iterative __.en.srt

   013 Inorder Traversal Details __ Recursive + Iterative __.en.srt

   014 Postorder Traversal Details __ Recursive + Iterative __.en.srt

   015 Level Order Traversal Details __ Recursive + Iterative __.en.srt

   016 Source Code __ Implementation of Binary Tree Using Linked List __.html

   017 Create Binary Tree & Insert Value __ Array Implementation __.mp4

   018 Search for a Value in Binary Tree.mp4

   019 Delete Node from Binary Tree.mp4

   020 Delete Binary Tree.mp4

   021 Preorder Traversal.mp4

   022 Inorder Traversal.mp4

   023 Postorder Traversal.mp4

   024 Level order Traversal.mp4

   BinaryTreeUsingArray.java

   001 What & Why is BST.en.srt

   002 Creation & Insertion in BST.en.srt

   003 Traversing BST.en.srt

   004 Searching in BST.en.srt

   005 Deletion Node in BST.en.srt

   006 Deletion of BST.en.srt

   007 Source Code __ BST __.html

   001 What is Binary Heap & Why.en.srt

   002 Heap Implementation Options.en.srt

   003 Insert into Binary Heap.en.srt

   004 Size, IsEmpty & Peek Operation.en.srt

   005 Extract Operation.en.srt

   006 Delete Heap.en.srt

   007 Source Code __ Binary Heap__.html

   001 What & Why is AVL Tree.en.srt

   002 CreateAVLTree & Search Operation.en.srt

   003 Left-Left Condition (Insertion).en.srt

   004 Details of Rotation & Condition.en.srt

   005 Left-Right Condition (Insertion).en.srt

   006 Right-Right Condition (Insertion).en.srt

   007 Right-Left Condition (Insertion).en.srt

   008 Delete Node from AVL Tree (LL, LR, RL, RR Condition).en.srt

   009 Delete AVL Tree.en.srt

   010 Source Code __ AVL TREE __.html

   001 What & Why is Trie.en.srt

   002 Representation of Trie Data Structure.en.srt

   003 Create Trie & Insert Word.en.srt

   004 Prefix Search.en.srt

   005 Search Word.en.srt

   006 Delete Word.en.srt

   007 Trie -- Source Code.html

   001 Linear Search Algorithm.en.srt

   002 Code __ Linear Search Algorithm __.html

   003 Binary Search Algorithm.mp4

   BinarySearch.java

   001 Bubble Sort.en.srt

   002 Selection Sort.en.srt

   003 Insertion Sort.en.srt

   004 Bucket Sort.en.srt

   005 Merge Sort.en.srt

   006 Quick Sort.en.srt

   007 Heap Sort.en.srt

   BubbleSort.java

   HeapSort.java

   MergeSort.java

   SelectionSort.java

   001 What is recursion & Why we should use recursion.en.srt

   002 Format of recursion.en.srt

   003 How recursion works internally.en.srt

   004 Nth Fibonacci.en.srt

   005 Recursion vs Iteration.en.srt

   Factorial.java

   001 What is Dynamic Programming & Why.en.srt

   002 Top-Down Approach.en.srt

   003 Bottom Up Approach.en.srt

   004 Longest Increasing Subsequence.en.srt

   005 House Robber.en.srt

   006 Min Path Sum.en.srt

   007 Longest Common Subsequence.en.srt

   008 0_1 Knapsack Problem.en.srt

   009 Regular Expression Matching.en.srt

  Bonus Resources.txt