Test

data.json

{
  "categories": [
    {
      "id": 1,
      "name": "Two-Pointer Patterns",
      "chronology": 1,
      "subcategories": [
        {
          "id": 101,
          "name": "Meeting in the Middle (Sorted Arrays)",
          "focusAreas": [
            { "id": 10101, "name": "Pair Sum (Two Sum Sorted Variant)" },
            { "id": 10102, "name": "Three Sum, Four Sum" },
            { "id": 10103, "name": "Container with Most Water (Max Area)" },
            { "id": 10104, "name": "Valid Palindrome" }
          ]
        }
      ]
    },
    {
      "id": 2,
      "name": "Traversal Patterns",
      "chronology": 2,
      "subcategories": [
        {
          "id": 201,
          "name": "Basic Iterative Traversal",
          "focusAreas": [
            { "id": 20101, "name": "Traversing an Array (Forward/Backward)" },
            { "id": 20102, "name": "Traversing a Linked List" },
            { "id": 20103, "name": "Circular Traversal (Wrap-Around)" }
          ]
        }
      ]
    },
    {
      "id": 3,
      "name": "In-Place Modification Patterns",
      "chronology": 3,
      "subcategories": [
        {
          "id": 301,
          "name": "Basic Array Modifications",
          "focusAreas": [
            { "id": 30101, "name": "Remove Duplicates from a Sorted Array" },
            { "id": 30102, "name": "Move Zeros to End" },
            { "id": 30103, "name": "Remove Element In-Place" }
          ]
        }
      ]
    },
    {
      "id": 4,
      "name": "Stack-Based Patterns",
      "chronology": 4,
      "subcategories": [
        {
          "id": 401,
          "name": "Basic Stack Operations",
          "focusAreas": [
            { "id": 40101, "name": "Implement Stack Using Array or Linked List" },
            { "id": 40102, "name": "Valid Parentheses" },
            { "id": 40103, "name": "Reverse a String Using Stack" }
          ]
        }
      ]
    },
    {
      "id": 5,
      "name": "Queue-Based Patterns",
      "chronology": 5,
      "subcategories": [
        {
          "id": 501,
          "name": "Basic Queue Operations",
          "focusAreas": [
            { "id": 50101, "name": "Implement Queue Using Stack" },
            { "id": 50102, "name": "Implement Stack Using Queue" },
            { "id": 50103, "name": "Circular Queue Implementation" }
          ]
        },
        {
          "id": 502,
          "name": "Buffer/Window Processing",
          "focusAreas": [
            { "id": 50201, "name": "Sliding Window Maximum" },
            { "id": 50202, "name": "First Negative Number in Every Window" },
            { "id": 50203, "name": "Number of Recent Calls (Rate Limiter)" }
          ]
        },
        {
          "id": 503,
          "name": "Level-Based Processing (Prepares for Trees/Graphs)",
          "focusAreas": [
            { "id": 50301, "name": "Rotten Oranges (Multi-Source BFS)" },
            { "id": 50302, "name": "Jump Game (Multi-Level BFS)" },
            { "id": 50303, "name": "Shortest Path in a Binary Matrix" },
            { "id": 50304, "name": "Topological Sorting (BFS Intro)" }
          ]
        }
      ]
    }
  ]
}