Welcome to the heart of the Interview Forge. This curriculum is designed to take you from a basic understanding of code to mastering the advanced algorithms used by the top 1% of engineers.

1. 🏗️ Fundamentals

• Time Complexity
• Space Complexity
• Recursion Basics

2. 📊 Arrays

• Arrays: The Basics
• Kadane's Algorithm
• Prefix Sum
• Sliding Window
• Two Pointers

🔑 Hashing

• Hashing: Hashmaps
• Frequency Counting
• Set Usage

3. 🔤 Strings

• String Basics
• Palindrome Patterns
• Pattern Matching
• Hashing with Strings

4. 🔗 Linked Lists

• Singly Linked List
• Doubly Linked List
• Cycle Detection
• Fast & Slow Pointers

5. 📚 Stacks & Queues

• Stack Foundations
• Queue Foundations
• Monotonic Stack
• Priority Queue Intro

6. 🔎 Searching

• Binary Search
• Search in Rotated Array
• Lower & Upper Bound

⚡ Sorting

• Bubble/Selection/Insertion
• Merge Sort
• Quick Sort
• Heap Sort

7. 🌀 Recursion & Backtracking

• Recursion Deep Dive
• Subsets & Permutations
• N-Queens Problem

8. 🌳 Trees

• Tree Basics
• Tree Traversals (DFS/BFS)
• Binary Search Tree (BST)
• Self-Balancing Theory

🏔️ Heaps

• Heap Basics
• Priority Queue Patterns

9. 🕸️ Graphs

• Graph Representation
• BFS & DFS on Graphs
• Cycle Detection
• Dijkstra's Algorithm

10. 🤑 Greedy

• Greedy: The Basics
• Interval Scheduling

11. 🧠 Dynamic Programming

• Intro: Memoization vs Tabulation
• 0-1 Knapsack Problem
• Longest Increasing Subsequence

12. 🦾 Advanced

• Trie (Prefix Tree)
• Disjoint Set Union (DSU)

🔌 Bit Manipulation

• Bit Manipulation Basics

---

1. ELI5 First: Read the "ELI5" section of each note to get the intuition.
2. Deep Dive: Study the complexity and theory.
3. Code Forge: Port the code to your language of choice (Standard is JavaScript).
4. Interview Pulse: Review the common gotchas and interview variations.

Happy Forging. 🏗️