File size: 3,195 Bytes
8a2dcce | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 | [
{
"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
}
]
|