Data Structures and Algorithms in Python - Full Course for Beginners

Beschreibung:

The course provides a beginner-friendly introduction to common data structures such as linked lists, stacks, queues, and graphs, and algorithms including search, sorting, recursion, and dynamic programming, all implemented in Python to prepare students for coding interviews and assessments. It begins with an introduction at 00:00:00, then covers binary search, linked lists, and complexity at 00:01:43, followed by an introduction at 00:03:43, a problem at 00:08:35, the method at 00:12:17, and the solution at 00:13:55; complexity and Big O notation are discussed at 00:50:52; binary search versus linear search at 01:24:57; generic binary search at 01:31:40; a summary and conclusion at 01:40:08; an assignment walkthrough at 01:44:30; another introduction at 01:45:05; a problem on rotated lists at 01:50:01; the method at 01:53:02; the solution at 01:54:03; a summary and conclusion at 02:30:47; binary search trees at 02:33:29; an introduction at 02:34:41; a problem at 02:37:36; the method at 02:38:40; a binary tree at 03:13:58; traversing a binary tree at 03:27:16; a binary search tree at 03:36:10; self-balancing binary trees and AVL trees at 04:22:37; a summary and conclusion at 04:26:27; hash tables and Python dictionaries at 04:30:33; an introduction at 04:31:09; a problem at 04:34:00; a data list at 04:40:28; a hash function at 04:42:52; a basic hash table implementation at 04:54:52; handling collisions with linear probing at 05:03:07; a summary and conclusion at 05:09:24; sorting algorithms and divide & conquer at 05:16:47; an introduction at 05:17:48; a problem at 05:20:19; the method at 05:21:27; custom comparison functions at 06:40:49; a summary and conclusion at 06:48:53; recursion memoization and dynamic programming at 06:54:57; an introduction at 06:56:37; a problem at 07:00:04; the method at 07:04:28; the solution at 07:06:21; knapsack problems at 08:06:13; the method at 08:08:48; the solution at 08:09:24; a summary and conclusion at 08:43:26; graph algorithms including BFS, DFS, and shortest paths at 08:44:05; an introduction at 08:45:02; a graph data structure at 08:51:00; breadth-first search at 09:15:57; depth-first search at 09:37:28; shortest paths at 10:08:26; a summary and conclusion at 10:40:39; Python interview questions, tips, and advice at 10:42:21; an introduction at 10:43:09; the method at 10:44:08; the solution at 10:47:10; and a final summary at 12:30:51.