@@ -78,4 +78,207 @@ export const dummyData: Question[] = [
78
78
difficulty : 'Medium' ,
79
79
topic : [ 'Machine Learning' , 'Algorithms' ] ,
80
80
} ,
81
+ {
82
+ id : 12 ,
83
+ attempted : false ,
84
+ title : 'Linked Lists' ,
85
+ difficulty : 'Easy' ,
86
+ topic : [ 'Data Structures' , 'Linked List' ] ,
87
+ } ,
88
+ {
89
+ id : 13 ,
90
+ attempted : true ,
91
+ title : 'Binary Trees' ,
92
+ difficulty : 'Medium' ,
93
+ topic : [ 'Trees' , 'Binary Tree' ] ,
94
+ } ,
95
+ {
96
+ id : 14 ,
97
+ attempted : false ,
98
+ title : 'Advanced Recursion' ,
99
+ difficulty : 'Hard' ,
100
+ topic : [ 'Recursion' , 'Dynamic Programming' ] ,
101
+ } ,
102
+ {
103
+ id : 15 ,
104
+ attempted : true ,
105
+ title : 'Greedy Algorithms' ,
106
+ difficulty : 'Medium' ,
107
+ topic : [ 'Algorithms' , 'Greedy' ] ,
108
+ } ,
109
+ {
110
+ id : 16 ,
111
+ attempted : false ,
112
+ title : 'Backtracking' ,
113
+ difficulty : 'Hard' ,
114
+ topic : [ 'Algorithms' , 'Backtracking' ] ,
115
+ } ,
116
+ {
117
+ id : 17 ,
118
+ attempted : true ,
119
+ title : 'Stack and Queues' ,
120
+ difficulty : 'Easy' ,
121
+ topic : [ 'Data Structures' , 'Stack' , 'Queue' ] ,
122
+ } ,
123
+ {
124
+ id : 18 ,
125
+ attempted : false ,
126
+ title : 'Graph Theory Basics' ,
127
+ difficulty : 'Medium' ,
128
+ topic : [ 'Graphs' , 'Theory' ] ,
129
+ } ,
130
+ {
131
+ id : 19 ,
132
+ attempted : true ,
133
+ title : 'Advanced Sorting Techniques' ,
134
+ difficulty : 'Hard' ,
135
+ topic : [ 'Algorithms' , 'Sorting' ] ,
136
+ } ,
137
+ {
138
+ id : 20 ,
139
+ attempted : false ,
140
+ title : 'Binary Search' ,
141
+ difficulty : 'Easy' ,
142
+ topic : [ 'Algorithms' , 'Search' ] ,
143
+ } ,
144
+ {
145
+ id : 21 ,
146
+ attempted : true ,
147
+ title : 'KMP String Matching' ,
148
+ difficulty : 'Hard' ,
149
+ topic : [ 'Algorithms' , 'String Matching' ] ,
150
+ } ,
151
+ {
152
+ id : 22 ,
153
+ attempted : false ,
154
+ title : 'Divide and Conquer' ,
155
+ difficulty : 'Medium' ,
156
+ topic : [ 'Algorithms' , 'Divide and Conquer' ] ,
157
+ } ,
158
+ {
159
+ id : 23 ,
160
+ attempted : true ,
161
+ title : 'Trie Data Structure' ,
162
+ difficulty : 'Hard' ,
163
+ topic : [ 'Data Structures' , 'Trie' ] ,
164
+ } ,
165
+ {
166
+ id : 24 ,
167
+ attempted : false ,
168
+ title : 'Heap and Priority Queue' ,
169
+ difficulty : 'Medium' ,
170
+ topic : [ 'Data Structures' , 'Heap' ] ,
171
+ } ,
172
+ {
173
+ id : 25 ,
174
+ attempted : true ,
175
+ title : 'Dynamic Array' ,
176
+ difficulty : 'Easy' ,
177
+ topic : [ 'Arrays' , 'Data Structures' ] ,
178
+ } ,
179
+ {
180
+ id : 26 ,
181
+ attempted : false ,
182
+ title : 'Breadth-First Search' ,
183
+ difficulty : 'Medium' ,
184
+ topic : [ 'Graphs' , 'BFS' ] ,
185
+ } ,
186
+ {
187
+ id : 27 ,
188
+ attempted : true ,
189
+ title : 'Depth-First Search' ,
190
+ difficulty : 'Medium' ,
191
+ topic : [ 'Graphs' , 'DFS' ] ,
192
+ } ,
193
+ {
194
+ id : 28 ,
195
+ attempted : false ,
196
+ title : 'Floyd-Warshall Algorithm' ,
197
+ difficulty : 'Hard' ,
198
+ topic : [ 'Algorithms' , 'Graphs' ] ,
199
+ } ,
200
+ {
201
+ id : 29 ,
202
+ attempted : true ,
203
+ title : 'Binary Indexed Tree' ,
204
+ difficulty : 'Hard' ,
205
+ topic : [ 'Data Structures' , 'Fenwick Tree' ] ,
206
+ } ,
207
+ {
208
+ id : 30 ,
209
+ attempted : false ,
210
+ title : 'Knapsack Problem' ,
211
+ difficulty : 'Medium' ,
212
+ topic : [ 'Algorithms' , 'Dynamic Programming' ] ,
213
+ } ,
214
+ {
215
+ id : 31 ,
216
+ attempted : true ,
217
+ title : 'Segment Tree' ,
218
+ difficulty : 'Hard' ,
219
+ topic : [ 'Data Structures' , 'Segment Tree' ] ,
220
+ } ,
221
+ {
222
+ id : 32 ,
223
+ attempted : false ,
224
+ title : 'Linear Regression' ,
225
+ difficulty : 'Medium' ,
226
+ topic : [ 'Machine Learning' , 'Regression' ] ,
227
+ } ,
228
+ {
229
+ id : 33 ,
230
+ attempted : true ,
231
+ title : 'Polynomial Time Algorithms' ,
232
+ difficulty : 'Hard' ,
233
+ topic : [ 'Algorithms' , 'Complexity' ] ,
234
+ } ,
235
+ {
236
+ id : 34 ,
237
+ attempted : false ,
238
+ title : 'Monte Carlo Simulation' ,
239
+ difficulty : 'Medium' ,
240
+ topic : [ 'Algorithms' , 'Simulation' ] ,
241
+ } ,
242
+ {
243
+ id : 35 ,
244
+ attempted : true ,
245
+ title : 'Neural Networks' ,
246
+ difficulty : 'Hard' ,
247
+ topic : [ 'Machine Learning' , 'Neural Networks' ] ,
248
+ } ,
249
+ {
250
+ id : 36 ,
251
+ attempted : false ,
252
+ title : 'Reinforcement Learning Basics' ,
253
+ difficulty : 'Hard' ,
254
+ topic : [ 'Machine Learning' , 'Reinforcement Learning' ] ,
255
+ } ,
256
+ {
257
+ id : 37 ,
258
+ attempted : true ,
259
+ title : 'Bayesian Networks' ,
260
+ difficulty : 'Medium' ,
261
+ topic : [ 'Machine Learning' , 'Bayesian Networks' ] ,
262
+ } ,
263
+ {
264
+ id : 38 ,
265
+ attempted : false ,
266
+ title : 'Markov Chains' ,
267
+ difficulty : 'Hard' ,
268
+ topic : [ 'Machine Learning' , 'Markov Chains' ] ,
269
+ } ,
270
+ {
271
+ id : 39 ,
272
+ attempted : true ,
273
+ title : 'Quantum Algorithms' ,
274
+ difficulty : 'Hard' ,
275
+ topic : [ 'Algorithms' , 'Quantum Computing' ] ,
276
+ } ,
277
+ {
278
+ id : 40 ,
279
+ attempted : false ,
280
+ title : 'Cryptography Basics' ,
281
+ difficulty : 'Medium' ,
282
+ topic : [ 'Cryptography' , 'Security' ] ,
283
+ } ,
81
284
] ;
0 commit comments