{ "source": "https://neetcode.io/roadmap", "extracted": "2026-06-01", "nodes": [ { "id": "1", "name": "Arrays & Hashing" }, { "id": "2", "name": "Two Pointers" }, { "id": "3", "name": "Stack" }, { "id": "4", "name": "Sliding Window" }, { "id": "5", "name": "Linked List" }, { "id": "6", "name": "Binary Search" }, { "id": "7", "name": "Trees" }, { "id": "8", "name": "Tries" }, { "id": "9", "name": "Heap / Priority Queue" }, { "id": "10", "name": "Backtracking" }, { "id": "11", "name": "Graphs" }, { "id": "12", "name": "1-D Dynamic Programming" }, { "id": "13", "name": "Intervals" }, { "id": "14", "name": "2-D Dynamic Programming" }, { "id": "15", "name": "Bit Manipulation" }, { "id": "16", "name": "Greedy" }, { "id": "17", "name": "Advanced Graphs" }, { "id": "18", "name": "Math & Geometry" } ], "edges": [ { "from": "1", "to": "2", "meaning": "prerequisite" }, { "from": "1", "to": "3", "meaning": "prerequisite" }, { "from": "2", "to": "4", "meaning": "prerequisite" }, { "from": "2", "to": "5", "meaning": "prerequisite" }, { "from": "2", "to": "6", "meaning": "prerequisite" }, { "from": "5", "to": "7", "meaning": "prerequisite" }, { "from": "6", "to": "7", "meaning": "prerequisite" }, { "from": "7", "to": "8", "meaning": "prerequisite" }, { "from": "7", "to": "9", "meaning": "prerequisite" }, { "from": "7", "to": "10", "meaning": "prerequisite" }, { "from": "10", "to": "11", "meaning": "prerequisite" }, { "from": "10", "to": "12", "meaning": "prerequisite" }, { "from": "9", "to": "13", "meaning": "prerequisite" }, { "from": "9", "to": "16", "meaning": "prerequisite" }, { "from": "9", "to": "17", "meaning": "prerequisite" }, { "from": "11", "to": "14", "meaning": "prerequisite" }, { "from": "11", "to": "17", "meaning": "prerequisite" }, { "from": "11", "to": "18", "meaning": "prerequisite" }, { "from": "12", "to": "14", "meaning": "prerequisite" }, { "from": "12", "to": "15", "meaning": "prerequisite" }, { "from": "15", "to": "18", "meaning": "prerequisite" } ] }