const dsaTrackerList = [
{
title:
"Arrays"
,
progress: 0,
subsections: [
{ subtitle:
"Introduction to Arrays"
, completed:
false
},
{ subtitle:
"Array Operations"
, completed:
false
},
{ subtitle:
"Common Array Problems"
, completed:
false
},
],
},
{
title:
"Linked Lists"
,
progress: 0,
subsections: [
{ subtitle:
"Singly Linked Lists"
, completed:
false
},
{ subtitle:
"Doubly Linked Lists"
, completed:
false
},
{ subtitle:
"Linked List Operations"
, completed:
false
},
],
},
{
title:
"Stacks"
,
progress: 0,
subsections: [
{ subtitle:
"Introduction to Stacks"
, completed:
false
},
{ subtitle:
"Stack Operations"
, completed:
false
},
{ subtitle:
"Applications of Stacks"
, completed:
false
},
],
},
{
title:
"Queues"
,
progress: 0,
subsections: [
{ subtitle:
"Introduction to Queues"
, completed:
false
},
{ subtitle:
"Queue Operations"
, completed:
false
},
{ subtitle:
"Applications of Queues"
, completed:
false
},
],
},
{
title:
"Trees"
,
progress: 0,
subsections: [
{ subtitle:
"Binary Trees"
, completed:
false
},
{ subtitle:
"Binary Search Trees"
, completed:
false
},
{ subtitle:
"Tree Traversal"
, completed:
false
},
{ subtitle:
"Balanced Trees"
, completed:
false
},
],
},
{
title:
"Sorting Algorithms"
,
progress: 0,
subsections: [
{ subtitle:
"Bubble Sort"
, completed:
false
},
{ subtitle:
"Insertion Sort"
, completed:
false
},
{ subtitle:
"Merge Sort"
, completed:
false
},
{ subtitle:
"Quick Sort"
, completed:
false
},
],
},
{
title:
"Graphs"
,
progress: 0,
subsections: [
{ subtitle:
"Graph Representation"
, completed:
false
},
{ subtitle:
"Graph Traversal"
, completed:
false
},
{ subtitle:
"Shortest Path Algorithms"
, completed:
false
},
{ subtitle:
"Minimum Spanning Tree"
, completed:
false
},
],
},
];
export
default
dsaTrackerList;