Data Structures Easy to Advanced Course - Full Tutorial from a Google Engineer
video description
Date: 2022-03-14
Related videos
Comments and reviews: 10
NANI
- (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) Linked Lists Introduction-
- (0:49:16) Doubly 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) Priority Queue Introduction-
- (1:44:16) Priority Queue Min Heaps and Max Heaps-
- (1:49:55) Priority Queue Inserting Elements-
- (1:59:27) Priority Queue Removing 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 Find Operations-
- (2:50:30) Union Find Path Compression-
- (2:56:37) Union Find Code-
- (3:03:54) Binary Search Tree Introduction-
- (3:15:57) Binary Search Tree Insertion-
- (3:21:20) Binary Search Tree Removal-
- (3:34:47) Binary Search Tree Traversals-
- (3:46:17) Binary Search Tree Code-
- (3:59:26) Hash table hash function-
- (4:16:25) Hash table separate chaining-
- (4:24:10) Hash table separate chaining source code-
- (4:35:44) Hash table open addressing-
- (4:46:36) Hash table linear probing-
- (5:00:21) Hash table quadratic probing-
- (5:09:32) Hash table double hashing-
- (5:23:56) Hash table open addressing removing-
- (5:31:02) Hash table open addressing code-
- (5:45:36) Fenwick Tree range queries-
- (5:58:46) Fenwick Tree point updates-
- (6:03:09) Fenwick Tree construction-
- (6:09:21) Fenwick tree source code-
- (6:14:47) Suffix Array introduction-
- (6:17:54) Longest Common Prefix (LCP) array-
- (6:21:07) Suffix array finding unique substrings-
- (6:25:36) Longest common substring problem suffix array-
- (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 insertion-
- (7:05:42) AVL tree removals-
- (7:14:12) AVL tree source code
reply
- (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) Linked Lists Introduction-
- (0:49:16) Doubly 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) Priority Queue Introduction-
- (1:44:16) Priority Queue Min Heaps and Max Heaps-
- (1:49:55) Priority Queue Inserting Elements-
- (1:59:27) Priority Queue Removing 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 Find Operations-
- (2:50:30) Union Find Path Compression-
- (2:56:37) Union Find Code-
- (3:03:54) Binary Search Tree Introduction-
- (3:15:57) Binary Search Tree Insertion-
- (3:21:20) Binary Search Tree Removal-
- (3:34:47) Binary Search Tree Traversals-
- (3:46:17) Binary Search Tree Code-
- (3:59:26) Hash table hash function-
- (4:16:25) Hash table separate chaining-
- (4:24:10) Hash table separate chaining source code-
- (4:35:44) Hash table open addressing-
- (4:46:36) Hash table linear probing-
- (5:00:21) Hash table quadratic probing-
- (5:09:32) Hash table double hashing-
- (5:23:56) Hash table open addressing removing-
- (5:31:02) Hash table open addressing code-
- (5:45:36) Fenwick Tree range queries-
- (5:58:46) Fenwick Tree point updates-
- (6:03:09) Fenwick Tree construction-
- (6:09:21) Fenwick tree source code-
- (6:14:47) Suffix Array introduction-
- (6:17:54) Longest Common Prefix (LCP) array-
- (6:21:07) Suffix array finding unique substrings-
- (6:25:36) Longest common substring problem suffix array-
- (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 insertion-
- (7:05:42) AVL tree removals-
- (7:14:12) AVL tree source code
reply
Joey
I'm about to start an OOP/Data Structures course at my university. I started by looking at the linked/doubly linked list portion which are great and I understand. However, the second the source code came up to review it I feel overwhelmed and intimidated. My programming 1 teacher didn't prepare us OOP wise for this. Can anyone recommend the main priority topics I need in order to understand DS? Thank you.
reply
I'm about to start an OOP/Data Structures course at my university. I started by looking at the linked/doubly linked list portion which are great and I understand. However, the second the source code came up to review it I feel overwhelmed and intimidated. My programming 1 teacher didn't prepare us OOP wise for this. Can anyone recommend the main priority topics I need in order to understand DS? Thank you.
reply
Drone
finally finished watching this video after 4 days with distracted mind. am not sure if i got everything taught here since, i more like skimmed the whole video. but am sure that i learnt some and now i have idea of what DS is. Awesome tutorial BTW.
will revisit after few weeks and gonna learn this again and again until it sticks.
reply
finally finished watching this video after 4 days with distracted mind. am not sure if i got everything taught here since, i more like skimmed the whole video. but am sure that i learnt some and now i have idea of what DS is. Awesome tutorial BTW.
will revisit after few weeks and gonna learn this again and again until it sticks.
reply
DBO
when shrinking the dynamic array (26:15) in the example -A. remove [4]- does it mean we're removing the 4th value/index created? I get that we added -7 in the 2nd index and then 34 in the 4th, but wouldn't it make more sense to -remove[34]- if we're following the syntax established?-
reply
when shrinking the dynamic array (26:15) in the example -A. remove [4]- does it mean we're removing the 4th value/index created? I get that we added -7 in the 2nd index and then 34 in the 4th, but wouldn't it make more sense to -remove[34]- if we're following the syntax established?-
reply
mubashir
i have recently done introductory course in java, so i couldnt get a lot of code starting from dynamic arrays. Is there any suggestion on how i should improvise. Does this require higher level of java to be studied. Please assist.
reply
i have recently done introductory course in java, so i couldnt get a lot of code starting from dynamic arrays. Is there any suggestion on how i should improvise. Does this require higher level of java to be studied. Please assist.
reply
Akshit
sir
In the dynamicArray implementation for the clear() method can't we use arr = (T[]) new Object[capacity]; length=0; instead of clearing every single value , wouldn't it be fast and also is there any flaw if I do this way.
reply
sir
In the dynamicArray implementation for the clear() method can't we use arr = (T[]) new Object[capacity]; length=0; instead of clearing every single value , wouldn't it be fast and also is there any flaw if I do this way.
reply
Venkatesh
-12.48 shouldn't that be O(n-3) , the inner loop is (n-2) + n and the outer loop, loops for n times, so, n((n-2) + n), results in (n-3) + (n-2), so O(f(n)) is n-3 , just a doubt, if wrong, kindly explain. Thanks in advcance
reply
-12.48 shouldn't that be O(n-3) , the inner loop is (n-2) + n and the outer loop, loops for n times, so, n((n-2) + n), results in (n-3) + (n-2), so O(f(n)) is n-3 , just a doubt, if wrong, kindly explain. Thanks in advcance
reply
Илья
32:14 Hi, could someone explain why there is '&&' in if statement of 'removeAt' method? Doesn't that mean logic 'and', if so, the value can't be both under zero and larger than 'len' variable
reply
32:14 Hi, could someone explain why there is '&&' in if statement of 'removeAt' method? Doesn't that mean logic 'and', if so, the value can't be both under zero and larger than 'len' variable
reply
Rapid
-15:18 The Big O Notation for O(n-4) is slightly wrong, but the final result is correct. The distribution of 3N should yield 120N which is 3N - 40.
reply
-15:18 The Big O Notation for O(n-4) is slightly wrong, but the final result is correct. The distribution of 3N should yield 120N which is 3N - 40.
reply
charuka
You can't just learn a hole subject in just 8 hours. It's impossible unless you're a robot. Following these tutorials is just a waste of time.
reply
You can't just learn a hole subject in just 8 hours. It's impossible unless you're a robot. Following these tutorials is just a waste of time.
reply
Add a review, comment
Other channel videos
