-
Notifications
You must be signed in to change notification settings - Fork 0
Home
rebeloper edited this page Jul 12, 2026
·
27 revisions
This tutorial walks through Data Structures & Algorithms in a carefully structured progression — entirely in Swift:
- Arrays & Strings
- Hash Maps & Hash Sets
- Linked Lists
- Stacks
- Queues & Deques
- Binary Trees
- Binary Search Trees
- Heaps & Priority Queues
- Tries
- Graphs
- Union-Find
- Segment & Fenwick Trees
- Two Pointers
- Sliding Window
- Fast and Slow Pointers
- Binary Search
- DFS and Backtracking
- BFS
- Topological Sort
- Union-Find Pattern
- Monotonic Stack
- Prefix Sum
- Merge Intervals
- Top-K and Heap Pattern
- 1D Dynamic Programming
- 2D Dynamic Programming
- Greedy
- Matrix Traversal
- Bit Manipulation Tricks
- Contains Duplicate
- Valid Anagram
- Two Sum
- Group Anagrams
- Top K Frequent Elements
- Product of Array Except Self
- Valid Sudoku
- Encode and Decode Strings
- Longest Consecutive Sequence
- Valid Palindrome
- Two Sum II - Input Array Is Sorted
- 3Sum
- Container With Most Water
- Trapping Rain Water
- Best Time to Buy and Sell Stock
- Longest Substring Without Repeating Characters
- Longest Repeating Character Replacement
- Permutation in String
- Minimum Window Substring
- Sliding Window Maximum
By following this path, you'll go from:
👉 "I memorized 150 answers 😵" to 👉 "I recognize the pattern before I finish reading the problem 💡"