71 lines
No EOL
1 KiB
JavaScript
71 lines
No EOL
1 KiB
JavaScript
const ModuleOrdering = {
|
|
"intro": [
|
|
"about-this",
|
|
"getting-started",
|
|
"prerequisites",
|
|
"running-cpp",
|
|
"problems",
|
|
"syllabus",
|
|
],
|
|
"general": [
|
|
"resources",
|
|
"contests",
|
|
"why-cpp",
|
|
"practicing",
|
|
"strategy",
|
|
"debugging",
|
|
"macros",
|
|
"proposing",
|
|
],
|
|
"bronze": [
|
|
"overview",
|
|
"rectangle-geometry",
|
|
"collections",
|
|
"containers",
|
|
"ds",
|
|
"pairs",
|
|
"simulation",
|
|
"complete-search",
|
|
],
|
|
"silver": [
|
|
"complexity",
|
|
"greedy",
|
|
"sorting",
|
|
"binary-search",
|
|
"two-pointers",
|
|
"prefix-sums",
|
|
"data-structures",
|
|
"dfs"
|
|
],
|
|
"gold": [
|
|
"dp",
|
|
"bfs",
|
|
"toposort",
|
|
"sp",
|
|
"mst",
|
|
"bit",
|
|
"introductory-number-theory",
|
|
"dp-trees"
|
|
],
|
|
"plat": [
|
|
"oly",
|
|
"trees",
|
|
"1DRQ",
|
|
"2DRQ",
|
|
"geo",
|
|
"graphs",
|
|
"hashing",
|
|
"bitset",
|
|
"fracture",
|
|
"slope",
|
|
{
|
|
name: "Dynamic Programming",
|
|
items: [
|
|
"dp-bitmasks",
|
|
"dp-ranges"
|
|
]
|
|
}
|
|
]
|
|
};
|
|
|
|
export default ModuleOrdering; |