Professional Knowledge (IT)

Data Structures

📺 Main playlist (Gate Smashers)📺 Algorithms (DAA) playlist

📋 Syllabus topics (PDF ke order mein)

Array 7 video
Stack 4 video
Linked List 2 video
Queue 2 video
Tree 10 video
Graph 5 video
Time Complexity & Space Complexity (Sorting, Hashing) 14 video

🔴 Zaroor wale: 0Kul pass: 0

Free mode — lock hata do (sabhi videos khule)

Kaise chalega

Video dekho → 📝 MCQ kholo → 5 sawal karo. 3/5 sahi par ✅ pass aur agla video 🔓 unlock.
🔴 zaroor wale videos order mein khulte hain. 🟡 optional videos lock nahi karte.
Har video ke neeche uska asli YouTube title aur channel diya hai (sab URLs 30 Sep 2026 ko check kiye).

Topic 1Array

Lec 3ArraysYouTube: Lec-3: Arrays in Data Structure by #Naina Mam | Initialization, Declaration, Memory Representation — Gate Smashers▶ YouTube
Lec 41D & Multi-D ArrayYouTube: Lec-4: Types of Array | One dimensional & Multi-dimensional Array by #Naina Mam — Gate Smashers▶ YouTube
Lec 5Addressing in 1D ArrayYouTube: Lec-5: Addressing in One Dimensional Array by #Naina Mam | Data Structure — Gate Smashers▶ YouTube
Lec 62D Array, Row MajorYouTube: Lec-6: 2D Arrays | Addressing in 2D Arrays | Row Major Order — Gate Smashers▶ YouTube
Lec 14Linear SearchYouTube: Lec-14: Linear Search in Data Structure by #Naina Mam | Time Complexity — Gate Smashers▶ YouTube
Lec 15Binary SearchYouTube: Lec-15: Binary Search in Data Structure by #Naina Mam — Gate Smashers▶ YouTube
Lec 17Array vs Linked ListYouTube: Lec-17: Arrays vs Linked Lists | Data Structures — Gate Smashers▶ YouTube

Topic 2Stack

Lec 30Stack, PUSH/POPYouTube: Lec-30: Introduction to Stack | PUSH and POP operations | Data Structure — Gate Smashers▶ YouTube
Lec 36Infix, Prefix, PostfixYouTube: Lec-36: Infix, Prefix & Postfix👩‍🔧 with examples | Data Structure — Gate Smashers▶ YouTube
Lec 38Infix to PostfixYouTube: Lec-38: Infix to Postfix Conversion | Infix➡️Postfix Conversion with examples | Data Structure — Gate Smashers▶ YouTube
Lec 42Postfix EvaluationYouTube: Lec-42: Postfix Expression Evaluation | Stack Application | Data Structure — Gate Smashers▶ YouTube

Topic 3Linked List

Lec 16Intro to Linked ListYouTube: Lec-16: Introduction to Linked List | Types and Need of linked list | data structures — Gate Smashers▶ YouTube
Lec 28Doubly Linked ListYouTube: Lec-28: Introduction to Doubly Linked List | Data Structure — Gate Smashers▶ YouTube

Topic 4Queue

Lec 46Queue introYouTube: Lec-46: Introduction to Queue Data structure with real life example | Data Structure #queue — Gate Smashers▶ YouTube
Lec 47Queue OperationsYouTube: Lec-47: Enqueue(), Dequeue() & other Operations on Queue | Data Structure — Gate Smashers▶ YouTube

Topic 5Tree

Lec 52Trees & Types of Binary TreeYouTube: Lec-52: Introduction to Trees | Binary Tree, Almost Complete Binary Tree, Full BT, Complete — Gate Smashers▶ YouTube
Lec 53Binary Search TreeYouTube: Lec-53: Binary Search Tree in Data Structure | Insertion and Traversal in BST — Gate Smashers▶ YouTube
Lec 56Preorder, Inorder, PostorderYouTube: Lec-56: Preorder, Inorder and Postorder in 5 minute | Tree Traversal | Easiest and Shortest Trick — Gate Smashers▶ YouTube
Lec 58AVL TreeYouTube: Lec-58: Introduction to AVL Tree in Data Structure with Examples | All Imp Points of AVL — Gate Smashers▶ YouTube
Lec 61Time Complexity of all TreesYouTube: Lec-61: Time Complexities of All Trees | Binary Tree, Binary Search Tree, AVL Tree, Heap Tree — Gate Smashers▶ YouTube
Lec 3.13Heap (Max/Min)YouTube: L-3.13: Introduction to Heap Tree with examples | Max Min Heap — Gate Smashers▶ YouTube
Lec 3.18Heap SortYouTube: L-3.18: Heap sort with Example | Heapify Method — Gate Smashers▶ YouTube
DS 54BST DeletionYouTube: Lec-54: Deletion from Binary Search Tree(BST) with Example | Data Structure — Gate Smashers🟡 optional▶ YouTube
DS 59AVL RotationsYouTube: Lec-59: How to Create AVL tree | LL, RR, LR, RL Rotation in AVL | Data Structure — Gate Smashers🟡 optional▶ YouTube
DS 62Red-Black TreeYouTube: Lec-62: Introduction to Red-Black Tree | Data Structure for Beginners — Gate Smashers🟡 optional▶ YouTube

Topic 6Graph

Lec 4.15BFS & DFSYouTube: L-4.15: BFS & DFS | Breadth First Search | Depth First Search | Graph Traversing | DAA — Gate Smashers▶ YouTube
DAA 4.7Spanning TreeYouTube: L-4.7: What is Spanning Tree with Examples in Hindi | Algorithm — Gate Smashers🟡 optional▶ YouTube
DAA 4.8KruskalYouTube: L-4.8: Kruskal Algorithm for Minimum Spanning Tree in Hindi | Algorithm — Gate Smashers🟡 optional▶ YouTube
DAA 4.9Prim'sYouTube: L-4.9: Prim's Algorithm for Minimum Cost Spanning Tree | Prims vs Kruskal — Gate Smashers🟡 optional▶ YouTube
DAA 4.10DijkstraYouTube: L-4.10: Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method — Gate Smashers🟡 optional▶ YouTube

Topic 7Time Complexity & Space Complexity (Sorting, Hashing)

Lec 2Intro to Data StructureYouTube: Lec-2: Introduction to Data Structure with real life examples by #Naina Mam — Gate Smashers▶ YouTube
Lec 1.3Big O, Omega, ThetaYouTube: L-1.3: Asymptotic Notations | Big O | Big Omega | Theta Notations | Most Imp Topic Of Algorithm — Gate Smashers▶ YouTube
Lec 1.6All Searching & Sorting complexities in 10 minYouTube: L-1.6: Time Complexities of all Searching and Sorting Algorithms in 10 minute | GATE & other Exams — Gate Smashers▶ YouTube
Lec 3.1Quick SortYouTube: L-3.1: How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer — Gate Smashers▶ YouTube
Lec 3.3Merge SortYouTube: L-3.3: How Merge Sort Works?? Full explanation with example — Gate Smashers▶ YouTube
Lec 3.6Bubble SortYouTube: L-3.6: How Bubble Sort Works | Performance of Bubble Sort | All Imp Points with Example | Algorithm — Gate Smashers▶ YouTube
Lec 3.7Insertion SortYouTube: L-3.7: Insertion Sort | Time Complexity Analysis | Stable Sort | Inplace Sorting — Gate Smashers▶ YouTube
Lec 3.8Selection SortYouTube: L-3.8: Selection Sort | Time Complexity(Best, Avg & Worst) Analysis | Stable or Not | Inplace or Not — Gate Smashers▶ YouTube
Lec 6.1HashingYouTube: L-6.1: What is hashing with example | Hashing in data structure — Gate Smashers▶ YouTube
Lec 6.2Collision ResolutionYouTube: L-6.2: Collision Resolution Techniques in Hashing | What are the collision resolution techniques? — Gate Smashers▶ YouTube
Time Complexity of All Data StructuresYouTube: Time complexity and Comparison of All Data Structures — Gate Smashers▶ YouTube
DAA 3.9Radix SortYouTube: L-3.9: Radix Sort | Easiest explanation with example — Gate Smashers🟡 optional▶ YouTube
DAA 4.3Huffman CodingYouTube: L-4.3: Huffman Coding Algorithm in Hindi with Example | Greedy Techniques(Algorithm) — Gate Smashers🟡 optional▶ YouTube
DAA 5.1Dynamic Programming introYouTube: L-5.1: Introduction to Dynamic Programming | Greedy Vs Dynamic Programming | Algorithm(DAA) — Gate Smashers🟡 optional▶ YouTube

🟢 Skip kar sakte ho

Recurrence relations, Master theorem
Bellman-Ford, Floyd Warshall
Branch & Bound
DSA coding problems (sliding window, two pointer)

Progress isi browser mein save hota hai.