Learn and master the most common data structures in this complete course from Google engineer William Fiset. This course teaches beginners data structures using high-quality animations to visually represent the data structures.

You'll learn how to code different data structures together with easy-to-follow step-by-step instructions. Each data structure presented will be accompanied by working source code (in Java) to enhance your understanding.

Code: https://github.com/williamfiset/data-structures

Course created by William Fiset. Check out his YouTube channel: https://www.youtube.com/channel/UCD8yeTczadqdARzQUp29PJw

️ Course content ️
⌨️ (0:00:00) Abstract data types
⌨️ (0:04:28) Introduction to Big-O
⌨️ (0:17:00) Dynamic and static arrays
⌨️ (0:27:40) Dynamic array code
⌨️ (0:35:03) Introducing linked lists
⌨️ (0:49:16) Double linked list code
⌨️ (0:58:26) Stack introduction
⌨️ (1:09:40) Stack implementation
⌨️ (1:12:49) Stack code
⌨️ (1:15:58) Queue introduction
⌨️ (1:22:03) Queue implementation
⌨️ (1:27:26) Queue code
⌨️ (1:31:32) Introducing priority queuing
⌨️ (1:44:16) Priority Queue Min. Heaps and Max. Heaps
⌨️ (1:49:55) Priority Queue Insert elements
⌨️ (1:59:27) Priority Queue Delete elements
⌨️ (2:13:00) Priority queue code
⌨️ (2:28:26) Union Find introduction
⌨️ (2:33:57) Union Find Kruskal's algorithm
⌨️ (2:40:04) Union Find – Union and search operations
⌨️ (2:50:30) Union Find Path compression
⌨️ (2:56:37) Union Search Code
⌨️ (3:03:54) Introducing the binary search tree
⌨️ (3:15:57) Insertion of binary search tree
⌨️ (3:21:20) Binary search tree removal
⌨️ (3:34:47) Traversals of binary search trees
⌨️ (3:46:17) Binary search tree code
⌨️ (3:59:26) Hash function of the hash table
⌨️ (4:16:25) Hash table separate chaining
⌨️ (4:24:10) Separate chain source code hash table
⌨️ (4:35:44) Hash table open addressing
⌨️ (4:46:36) Linear exploration of hash tables
⌨️ (5:00:21) Quadratic analysis of the hash table
⌨️ (5:09:32) Double hashing hash table
⌨️ (5:23:56) Remove hash table open addressing
⌨️ (5:31:02) Hash table open addressing code
⌨️ (5:45:36) Questions about the Fenwick Tree range
⌨️ (5:58:46) Fenwick Tree point updates
⌨️ (6:03:09) Fenwick Tree Construction
⌨️ (6:09:21) Source code of the Fenwick tree
⌨️ (6:14:47) Introducing suffix array
⌨️ (6:17:54) Longest Common Prefix (LCP) array
⌨️ (6:21:07) Suffix array for finding unique substrings
⌨️ (6:25:36) Suffix array containing the longest common substring
⌨️ (6:37:04) Longest common substring problem suffix array part 2
⌨️ (6:43:41) Longest repeated substring suffix array
⌨️ (6:48:13) Balanced binary search tree rotations
⌨️ (6:56:43) AVL tree insert
⌨️ (7:05:42) AVL tree removals
⌨️ (7:14:12) AVL tree source code
⌨️ (7:30:49) Indexed Priority Queue | Data structure
⌨️ (7:55:10) Indexed priority queue | Data structure | Source code

—

Learn to code for free and get a developer job: https://www.freecodecamp.org

Read hundreds of articles about programming: https://www.freecodecamp.org/news

Please take the opportunity to connect and share this video with your friends and family if you find it helpful.