Found 15 results for "tag:data_structures"
-
Data Structures and Algorithms Full Course
https://www.youtube.com/watch?v=0W9sY9Uf8JM
Welcome to our course! Dive into computational complexity, Big O, and P vs. NP. Learn numerical algorithms, data structures like linked lists and arrays, and master sorting and searching. Explore hash tables, recursion, trees, and graphs. Finish prepared for advanced studies or a tech career. Embrace programming's power! *Chapters and Timestamps:* 00:00:00 - **Chapter 1 - Course Introduction** 00:00:00 - Introduction And Course Overview 00:03:16 - **Chapter 2 - Understanding Complexity** 00:03:16 - Complexity Theory 00:07:12 - Big O Notation 00:14:15 - Typical Runtime Functions 00:18:52 - Comparing Runtime Functions 00:24:19 - P And NP 00:28:23 - **Chapter 3 - Exploring Numerical Algorithms** 00:28:23 - Random Numbers 00:30:42 - Linear Congruential Generators 00:35:46 - Randomizing Arrays - Part 1 00:39:33 - Randomizing Arrays - Part 2 00:44:04 - GCD (Greatest Common Divisor) 00:48:13 - LCM (Least Common Multiple) 00:51:42 - Prime Factorization - Part 1 00:56:41 - Prime Factorization - Part 2 00:59:24 - Finding Primes 01:02:48 - Testing Primality 01:06:34 - Numerical Integration 01:11:45 - **Chapter 4 - Mastering Linked Lists** 01:11:45 - Singly Linked Lists - Part 1 01:18:33 - Singly Linked Lists - Part 2 01:20:56 - Sorted Linked Lists 01:24:19 - Data Break 01:24:34 - Sorting With Linked Lists 01:28:42 - Doubly Linked Lists 01:32:34 - **Chapter 5 - Working with Arrays** 01:32:34 - One-Dimensional Arrays 01:37:44 - Triangular Arrays - Part 1 01:41:57 - Triangular Arrays - Part 2 01:45:15 - Sparse Arrays - Part 1 01:50:43 - Sparse Arrays - Part 2 01:54:03 - **Chapter 6 - Stacks And Queues In-Depth** 01:54:03 - Stacks 01:56:36 - Stack Algorithms 02:00:03 - Double Stacks 02:02:12 - Queues 02:08:01 - **Chapter 7 - Advanced Sorting Techniques** 02:08:01 - Sorting Algorithms 02:11:05 - Insertionsort 02:17:33 - Selectionsort 02:22:20 - Quicksort - Part 1 02:28:00 - Quicksort - Part 2 02:35:55 - Heapsort - Part 1 02:42:12 - Heapsort - Part 2 02:47:33 - Heapsort - Part 3 02:53:13 - Mergesort - Part 1 02:57:09 - Mergesort - Part 2 03:00:50 - Bubblesort - Part 1 03:05:41 - Bubblesort - Part 2 03:10:09 - Countingsort - Part 1 03:14:55 - Countingsort - Part 2 03:18:30 - Sorting Summary 03:21:21 - **Chapter 8 - Searching Techniques** 03:21:21 - Linear Search 03:23:33 - Binary Search 03:28:48 - Interpolation Search 03:34:15 - **Chapter 9 - Fundamentals of Hash Tables** 03:34:15 - Hash Tables 03:38:48 - Chaining 03:44:12 - Open Addressing - Basics 03:51:38 - Open Addressing - Linear Probing 03:56:26 - Open Addressing - Quadratic Probing 04:00:49 - Open Addressing - Double Hashing 04:06:45 - Data Structures Break 04:07:00 - **Chapter 10 - Recursive Algorithms Explained** 04:07:00 - Recursion Basics 04:12:37 - Fibonacci Numbers 04:18:45 - Tower Of Hanoi 04:24:53 - Koch Curves 04:29:25 - Hilbert Curves 04:34:57 - Gaskets 04:39:49 - Removing Tail Recursion 04:43:45 - Removing Recursion With Stacks 04:47:41 - Fixing Fibonacci 04:55:06 - Selections 04:59:22 - Permutations 05:03:34 - **Chapter 11 - Backtracking Techniques** 05:03:34 - Backtracking 05:09:38 - The Eight Queens Problem - Part 1 05:15:39 - The Eight Queens Problem - Part 2 05:19:43 - The Eight Queens Problem - Part 3 05:23:32 - The Knights Tour 05:27:53 - **Chapter 12 - Exploring Tree Structures** 05:27:53 - Tree Terms 05:32:59 - Binary Tree Properties 05:39:24 - Traversals - Preorder 05:43:19 - Traversals - Postorder 05:46:16 - Traversals - Inorder 05:49:04 - Traversals - Breadth-First 05:52:02 - Building Sorted Trees 05:55:58 - Editing Sorted Trees 06:00:34 - **Chapter 13 - Balancing Tree Structures** 06:00:34 - Why Do You Need Balanced Trees? 06:04:38 - Data Structures Break 06:04:46 - B-Trees - B-Tree Basics 06:12:05 - B-Trees - Adding Items 06:17:21 - B-Trees - Removing Items 06:21:37 - **Chapter 14 - Navigating Decision Trees** 06:21:37 - Definition 06:27:14 - Exhaustive Search 06:33:41 - Branch And Bound 06:42:07 - Heuristics 06:49:45 - **Chapter 15 - Network Algorithm Basics** 06:49:45 - Network Terminology 06:53:17 - Network Classes 06:58:10 - Depth-First Traversal 07:03:31 - Breadth-First Traversal 07:06:15 - Spanning Trees - Part 1 07:10:28 - Spanning Trees - Part 2 07:14:26 - Shortest Paths - Part 1 07:21:53 - Shortest Paths - Part 2 07:30:35 - **Chapter 16 - Course Conclusion** 07:30:35 - Wrap-Up Show your Love & Support: https://www.patreon.com/alphabrains βοΈ [Buy me a coffee!] (https://www.buymeacoffee.com/alphabrains) Would Help me make more content like this one :) ``` If you are involved in ANY form of online collaboration, then have I got the all-in-one solution for you! Try it here *(it's completely free)* - https://www.taskade.com/?via=taskade π*Join Our Brainers Community! *π π π§ *Telegram*: https://t.me/+pIXV6rmfKbU5YmRk β¨ *WhatsApp Channel:* https://whatsapp.Com/channel/0029V51YH9p05MUXZRubWa35 π₯*Discord Channel:* https://discord.gg/fbsKcU7mp5 π*YouTube Channel:* https://www.youtube.com/@alphabrainscourses
-
Every Data Structure on 1 Page - DeriveIt
https://deriveit.org/coding/every-data-structure-on-1-page-87
Array An Array is an ordered list of elements. Each element lives at an index 0, 1, 2, and so on. Arrays are also called "lists" in Python. ``` arr = [1, 3, 3, 7] for val in arr: 1,3,3,7 7 in arr True, takes O(n) arr[3] read O(1) arr[3] = 8 write O(1) arr.insert(1, 9) insert O(n) del arr[1] delete O(n) arr.append(9) insert last element O(1) arr.pop() delete last element O(1) ``` Read/Write Time O(1) . Insert/Delete Time O(n) . Stack A Stack is an Array, but where you only Insert/Delete the last
-
Introduction β Data Structures and Information Retrieval in Python
https://allendowney.github.io/DSIRP/
-
Kurs e-learningowy
http://books.icse.us.edu.pl/runestone/default/user/login
Kurs e-learningowy na potrzeby kierunku Informatyka Stosowana, prowadzonego na Wydziale Matematyki, Fizyki i Chemii Uniwersytetu ΕlΔ skiego.
-
NeetCode
https://neetcode.io/
A better way to prepare for coding interviews.
-
Problem Solving with Algorithms and Data Structures using Python β Problem Solving with Algorithms and Data Structures 3rd edition
https://runestone.academy/ns/books/published/pythonds3/index.html
An interactive version of Problem Solving with Algorithms and Data Structures using Python.
-
Python list implementation β Laurent Luce's Blog
http://www.laurentluce.com/posts/python-list-implementation/
-
Python β Laurent Luce's Blog
http://www.laurentluce.com/posts/tag/python/
-
The Interactive Handbook on Data Structures and Algorithms
https://cartesian.app/?utm_source=hackernewsletter&utm_medium=email&utm_term=books
This one-of-a-kind interactive book offers a hands-on approach to learning data structures and algorithms, featuring rich visualizations, code execution playback, an assortment of problems and an embedded Python environment. Itβs designed to support both beginners and more experienced learners through active exploration and interactivity.
-
The Ultimate DSA Course for 2025 (with 100% less vibe coding)
https://www.youtube.com/watch?v=DMeD8trbj6A
Build data structures from scratch and learn how to think through complex algorithms in Python. Practice your hard problem-solving skills and write faster co...
-
a-picture-is-worth-a-1000-words/algorithms at main Β· girliemac/a-picture-is-worth-a-1000-words
https://github.com/girliemac/a-picture-is-worth-a-1000-words/tree/main/algorithms
I am trying to describe complex matters in simple doodles! - girliemac/a-picture-is-worth-a-1000-words
-
https://danielchasehooper.com/posts/typechecked-generic-c-data-structures
https://danielchasehooper.com/posts/typechecked-generic-c-data-structures
-
https://dynomight.net/lists
https://dynomight.net/lists
-
https://mrsuh.com/articles/2024/sqlite-index-visualization-structure
https://mrsuh.com/articles/2024/sqlite-index-visualization-structure
-
https://www.justorgdesign.com
https://www.justorgdesign.com