GlossaryAuto-generated index of key terms and which lesson covers them. Term Lesson adjacency list 14. Graphs Arrays 02. Arrays Strings and Slices Backtracking 13. Backtracking Bellman-Ford 15. Shortest Path and MST BFS 14. Graphs Big-O 01. How to Think About Complexity Big-O notation 01. How to Think About Complexity Binary search 09. Binary Search binary search trees 10. Trees and BSTs binary trees 10. Trees and BSTs Bit manipulation 17. Greedy and Bit Manipulation byte 02. Arrays Strings and Slices call stack 07. Recursion container/heap 11. Heaps and Priority Queues contiguous memory 02. Arrays Strings and Slices cycle detection 06. Linked Lists, 14. Graphs DFS 14. Graphs Dijkstra's algorithm 15. Shortest Path and MST divide-and-conquer 08. Sorting Algorithms Dynamic programming 16. Dynamic Programming edges 14. Graphs Floyd's algorithm 06. Linked Lists Graphs 14. Graphs Greedy algorithms 17. Greedy and Bit Manipulation Hash maps 04. Hash Maps and Sets heap 11. Heaps and Priority Queues immutable byte slices 02. Arrays Strings and Slices K largest 11. Heaps and Priority Queues Kruskal's algorithm 15. Shortest Path and MST Linked lists 06. Linked Lists max-heap 11. Heaps and Priority Queues Memoization 16. Dynamic Programming merge sort 08. Sorting Algorithms min-heap 11. Heaps and Priority Queues Minimum Spanning Tree 15. Shortest Path and MST monotonic stack 05. Stacks and Queues O(1) amortized 01. How to Think About Complexity overlapping subproblems 16. Dynamic Programming partitioning 08. Sorting Algorithms prefix search 12. Tries prefix sum 02. Arrays Strings and Slices priority queue 11. Heaps and Priority Queues prune 13. Backtracking queues 05. Stacks and Queues quicksort 08. Sorting Algorithms recurrence relation 16. Dynamic Programming Recursion 07. Recursion rune 02. Arrays Strings and Slices set 04. Hash Maps and Sets Slices 02. Arrays Strings and Slices sliding window 03. Two Pointers and Sliding Window Space complexity 01. How to Think About Complexity Stacks 05. Stacks and Queues strings.Builder 02. Arrays Strings and Slices Tabulation 16. Dynamic Programming Time complexity 01. How to Think About Complexity topological sort 14. Graphs Trees 10. Trees and BSTs trie 12. Tries Two pointers 02. Arrays Strings and Slices, 03. Two Pointers and Sliding Window Union-Find 15. Shortest Path and MST vertices 14. Graphs