[
  {
    "id": "q01",
    "query": "Explain how binary search works",
    "expected_route": "single_topic",
    "expected_topics": ["Binary Search"]
  },
  {
    "id": "q02",
    "query": "What is the time complexity of merge sort?",
    "expected_route": "single_topic",
    "expected_topics": ["Merge Sort"]
  },
  {
    "id": "q03",
    "query": "Explain quick sort with an example",
    "expected_route": "single_topic",
    "expected_topics": ["Quick Sort"]
  },
  {
    "id": "q04",
    "query": "What is a Trie used for?",
    "expected_route": "single_topic",
    "expected_topics": ["Trie"]
  },
  {
    "id": "q05",
    "query": "What is a doubly linked list?",
    "expected_route": "single_topic",
    "expected_topics": ["Doubly Linked List"]
  },
  {
    "id": "q06",
    "query": "Explain how a stack works",
    "expected_route": "single_topic",
    "expected_topics": ["Stack"]
  },
  {
    "id": "q07",
    "query": "What is topological sort used for?",
    "expected_route": "single_topic",
    "expected_topics": ["Topological Sort"]
  },
  {
    "id": "q08",
    "query": "Explain Dijkstra's Algorithm",
    "expected_route": "single_topic",
    "expected_topics": ["Dijkstra's Algorithm"]
  },
  {
    "id": "q09",
    "query": "What is a segment tree?",
    "expected_route": "single_topic",
    "expected_topics": ["Segment Tree"]
  },
  {
    "id": "q10",
    "query": "Explain the sliding window technique",
    "expected_route": "single_topic",
    "expected_topics": ["Sliding Window Technique"]
  },
  {
    "id": "q11",
    "query": "What is the difference between BFS and DFS?",
    "expected_route": "comparison",
    "expected_topics": ["Breadth-First Search", "Depth-First Search"]
  },
  {
    "id": "q12",
    "query": "Compare merge sort vs quick sort",
    "expected_route": "comparison",
    "expected_topics": ["Merge Sort", "Quick Sort"]
  },
  {
    "id": "q13",
    "query": "Difference between a stack and a queue",
    "expected_route": "comparison",
    "expected_topics": ["Stack", "Queue"]
  },
  {
    "id": "q14",
    "query": "Which one is better, Prim's Algorithm or Kruskal's Algorithm, for MST?",
    "expected_route": "comparison",
    "expected_topics": ["Prim's Algorithm (MST)", "Kruskal's Algorithm (MST)"]
  },
  {
    "id": "q15",
    "query": "Compare AVL Tree and Binary Search Tree",
    "expected_route": "comparison",
    "expected_topics": ["AVL Tree", "Binary Search Tree"]
  },
  {
    "id": "q16",
    "query": "Who won the football World Cup in 2022?",
    "expected_route": "out_of_scope",
    "expected_topics": []
  },
  {
    "id": "q17",
    "query": "What's a good recipe for chocolate cake?",
    "expected_route": "out_of_scope",
    "expected_topics": []
  },
  {
    "id": "q18",
    "query": "What is the capital of France?",
    "expected_route": "out_of_scope",
    "expected_topics": []
  },
  {
    "id": "q19",
    "query": "Can you explain that again?",
    "expected_route": "followup",
    "expected_topics": [],
    "requires_history": true
  },
  {
    "id": "q20",
    "query": "Give me another example",
    "expected_route": "followup",
    "expected_topics": [],
    "requires_history": true
  }
]