Foundations
Episode 0 The Visual Dictionary
Episode 0The Visual Dictionary
▶ This video is coming to YouTube soon.
Before we solve a single interview problem, we agree on a language. Every data structure in this course has one shape and one colour: arrays, strings, counters, matrices, hash maps, hash sets, stacks, queues, linked lists and heaps. For each one you'll see what the shape means, how to declare it in Java, and what its operations cost.
What you'll learn
- How to read pointers, windows and the four highlight colours
- Arrays, Strings, int[26] counters and 2D matrices, and why indexing is O(1)
- HashMap vs HashSet: key → value vs membership only
- Stacks, queues and deques: which end you can touch
- Linked lists and heaps (PriorityQueue), and what makes them different
Chapters
- 0:00Intro
- 0:18How to read the pictures
- 0:59Variable
- 1:20Array
- 1:51String
- 2:24Counter: int[26]
- 3:01Matrix
- 3:36HashMap
- 4:14HashSet
- 4:50Stack
- 5:18Queue and deque
- 5:48Linked list
- 6:22Heap (PriorityQueue)
- 7:00The whole dictionary