• Introduction

• Types of Data Structures Preview

• Introduction Preview

• Terminology

• Syntax

• Constructor

• Self Keyword

• Let's Dive In

• Time Complexity Intuition

• Space Complexity Intuition

• Quiz:Guess Best Case

• Introduction Preview

• Stacks Part 1

• Stacks Part 2

• Methods on Stacks

• Applications

• Solved Problem on stack

• Introduction Preview

• Queue Part 1

• Queue Part 2

• Applications of Queue

• Applications

• Solved Question on queue's

• Introduction Preview

• Coding Up Linked Lists Preview

• Traverse Linked Lists Intuition

• Traverse Linked List Code

• Adding Node in the Beginning Intuition

• Adding Node in Beginning Code

• Adding Node in the Middle Intuition Preview

• Adding Node in the Middle Code

• Adding Node in the End Intuition

• Adding Node in the End Code

• Delete a Node Intuition

• Applications of LL

• Delete a Node Code

• Introduction Preview

• Coding Up DLL

• Traverse DLL Code

• Appending a node Intuition

• Appending a node Code

• Prepend Node Intuition

• Prepend Node Code

• Delete a Node Intuition

• Delete a Node Code

• Applications of DLL

• Introduction Preview

• Coding Up CLL

• Traverse CLL Intuition

• Traverse CLL Code

• Appending a node Intuition

• Appending a node Code

• Prepend Node Intuition

• Prepend Node Code

• Split Lists Intuition

• Split Lists Code

• Applications of CLL

• Introduction Preview

• Methods On Deque

• Coding Part 1

• Coding Part 2

• Applications

• Introduction Preview

• Trees Terminology

• Types of Trees

• Applications of Trees

• Intro Code

• Appending a node Code

• Count Nodes in a Tree

• Height of a Tree

• BT Intuition Preview

• Proper BT

• Perfect BT

• Complete BT

• Degenerate Trees

• Introduction Preview

• Initial Code

• Search Function Intuition

• Search Function Code

• Insert Function Institution

• Insert Function Code

• Delete Function Intuition

• Prepend Node Code

• Time and Space Complexity of BST

• Introduction Preview

• InOrder Traversal Intuition

• InOrder Traversal Code

• PreOrder Traversal Intuition

• PreOrder Traversal Code

• PostOrder Traversal Intuition

• PostOrder Traversal Code

• Level Order Traversal

• Introduction Preview

• Rotation Intro

• Left-Left Rotation Intuition

• Right-Right Rotation Intuition

• Left-Right Rotation Intuition

• Right-Left Rotation Intuition

• AVL Intro Code

• Height and Balance Factor Code

• Insertion of Node Intuition

• Insertion of Node Code

• Left Rotation Code

• Right Rotation Code

• Deletion of Node intuition

• Deletion of Node Code

• Introduction Preview

• Types of Heaps

• Heap Insert node Intuition

• Heapify Intuition

• Heaps Insert Node Code

• Heapify Code

• Delete Node Intuition

• Delete Node Code

• Relate Array with Heap

• Heap Sort Intuition

• Heap Sort Code

• Heap Sort Applications

• Introduction Preview

• Operations on Priority Queue

• Insert Node Intuition

• Delete Node Intuition

• Insert and Delete Code

• Peek Function

• Applications and Time Complexity

• Introduction Preview

• Intro to Hash Function

• Intro Code

• Operations on Hashmap

• Operations Code

• What is Collison Handling?

• How to handle Collisions?

• Collison Handling Code

• Hashing

• Time Complexity of Operations

• Introduction Preview

• Graph Terminology

• Graph Representation

• Graph Operations

• Types of Graphs

• Adjacency Matrix Code

• Operations on Graphs

• BFS Intuition

• BFS Code

• Time Complexity of BFS

• DFS Intuition

• DFS Code

• Time Complexity of DFS

• Sub-graph Intuition Preview

• Connected Graph

• Weighted Graph Intuition

• Spanning Trees Intuition

• MST Intuition

• Prims Algo Intuition

• Prims Algo Code

• Prims Algo Time Complexity

• Kruskals Algo Intuition

• Kruskals Algo Code

• Kruskals Algo Time Complexity

• Prims Vs Kruskals

• Tries Intuition Preview

• Intro Code

• Insert Node into Trie

• Insert Node Code

• Search Node Code

• Applications and Time Complexity

• What is Lambda Function? Preview

• Coding Up Lambda Function Preview

• Sub-Array Intuition

• Sub-Array Code

• Sub-String Intuition

• Sub-String Code

• Subsequence Intuition

• Subsequence Code

• Comparison

• Sorting a Primitive DS

• Default Dictionary Intuition

• Default Dict Code

• Deque Intuition

• Deque Code

• HeapQ Module

• HeapQ Functions

• Let's Code HeapQ

• Download Code