Visualized DSA Strategies

Episode 0 The Visual Dictionary

9 min · Go

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 Go, and what its operations cost.

What you'll learn

  • How to read pointers, windows and the four highlight colours
  • Slices, strings, [26]int counters and slices of slices, and why indexing is O(1)
  • Maps vs sets (map[int]bool): key → value vs membership only
  • Stacks, queues and deques: slices, container/list, and which end you can touch
  • Linked lists and heaps (container/heap), and what makes them different

Chapters

  1. 0:00Intro
  2. 0:18How to read the pictures
  3. 0:59Variable
  4. 1:34Array: slice
  5. 2:07String
  6. 2:55Counter: [26]int
  7. 3:36Matrix: slice of slices
  8. 4:15Map
  9. 5:00Set: map[int]bool
  10. 5:44Stack
  11. 6:18Queue and deque
  12. 6:58Linked list
  13. 7:32Heap (container/heap)
  14. 8:14The whole dictionary