Data Structures in Tamil | A Complete Course For Beginners - Python!

insimpletermz · Beginner ·⚡ Algorithms & Data Structures ·1y ago

Key Takeaways

This video teaches data structures in Python, covering time and space complexity, stacks, queues, linked lists, doubly linked lists, trees, heaps, recursion, tree traversals, graphs, hash tables, and dynamic programming

Original Description

Timestamps: 0:00 - 20:09 - Time and Space Complexity. 20:10 - 47:51 - Python Introduction 47:52 - 1:30:06 - Stack 1:30:07 - 1:33:04 - Queue Introduction 1:33:05 - 2:50:25 - Linked List 2:50:26 - 2:53:22 - Queue Implementation 2:53:23 - 3:12:37 - Doubly Linked List 3:12:38 - 3:59:53 - Tree 3:59:54 - 4:30:04 - Heap 4:30:05 - 4:43:04 - Recursion 4:43:05 - 5:10:34 - Tree Traversals 5:10:35 - 5:33:32 - Graph 5:33:33 - 5:47:16 - Hash Table 5:47:17 - 5:59:03 - Dynamic Programming 5:59:04 - 6:47:18 - Sorting (Few Algorithms) GitHub: https://github.com/InSimpleTermz/DSA 📚 Welcome to an exciting journey through Data Structures & Algorithms in Python! In this video, I explain the fundamentals of Big O notation and give a comprehensive introduction to Python. We dive deep into important data structures and algorithms that every programmer should know, including: 🧮 Stacks & Queues 🔗 Linked Lists 🌳 Trees & Graphs 📚 Heaps & Hash Tables 💡 Dynamic Programming 🌀 Merge Sort, Quick Sort, Insertion Sort & Bubble Sort Whether you're a beginner or looking to refresh your knowledge, this video covers it all! Stay tuned as we break down complex topics into simple, easy-to-understand terms. 🎯 Make sure to like, subscribe, and hit the bell icon so you don’t miss future videos on Python, algorithms, and more! #DataStructures #Algorithms #PythonProgramming #BigONotation #StacksAndQueues #LinkedLists #TreesAndGraphs #Heaps #HashTables #DynamicProgramming #SortingAlgorithms #LearnPython #CodingForBeginners #PythonTutorial #DSAExplained #InSimpleTermz #ProgrammingBasics #timecomplexity #spacecomplexity #techtamilan #tamiltech #tamil #python

Watch on YouTube ↗ (saves to browser)

Sign in to unlock AI tutor explanation · ⚡30

Related AI Lessons

Bloom Filters, Explained Properly

Learn how Bloom filters work and their benefits, including tiny memory and blazing speed, in exchange for potential false positives.

Dev.to · Daksh Gargas

Prefix Sums: The Preprocessing Trick That Makes Range Queries Instant

Learn how prefix sums enable instant range queries in arrays, boosting performance in various applications

Medium · Programming

I Thought I Was Ready for the Interview — Then One Simple Math Question Destroyed Me

A simple math question can destroy a developer's interview, highlighting the importance of being prepared for unexpected questions

Medium · Programming

Week 2(Day 10): LeetCode Two Pointers(slow & fast): Remove Duplicates from Sorted Array (Brute…

Learn to remove duplicates from a sorted array using the two pointers technique, improving from brute force to optimized solutions

Medium · Python

Chapters (15)

20:09 - Time and Space Complexity.

20:10 47:51 - Python Introduction

47:52 1:30:06 - Stack

1:30:07 1:33:04 - Queue Introduction

1:33:05 2:50:25 - Linked List

2:50:26 2:53:22 - Queue Implementation

2:53:23 3:12:37 - Doubly Linked List

3:12:38 3:59:53 - Tree

3:59:54 4:30:04 - Heap

4:30:05 4:43:04 - Recursion

4:43:05 5:10:34 - Tree Traversals

5:10:35 5:33:32 - Graph

5:33:33 5:47:16 - Hash Table

5:47:17 5:59:03 - Dynamic Programming

5:59:04 6:47:18 - Sorting (Few Algorithms)

Stump Grinder Carbide Wheel Grinds Hardwood To Chips

Innoforge Studio