gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore: preparing for the move

Browse Source
This commit is contained in:
Mrugesh Mohapatra
2018-09-27 12:36:41 +05:30
parent 5272862733
commit 67929d80ff
402 changed files with 0 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

58
curriculum/math-challenges/42-combinatorics/covering-circuits-and-graph-coloring.json Normal file
View File

@ -0,0 +1,58 @@
{
"name": "Covering circuits and graph coloring",
"order": 2,
"challenges": [
{
"id": "59a5801209a6acac5983b612",
"title": "Euler cycles",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a954",
"title": "Hamilton circuits",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a955",
"title": "Graph coloring",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a956",
"title": "Coloring theorems",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
}
]
}

58
curriculum/math-challenges/42-combinatorics/elements-of-graph-theory.json Normal file
View File

@ -0,0 +1,58 @@
{
"name": "Elements of Graph Theory",
"order": 1,
"challenges": [
{
"id": "59a5801209a6acac5983b611",
"title": "Graph Models",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a950",
"title": "Isomorphism",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a951",
"title": "Edge Counting",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a952",
"title": "Planar graphcs",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
}
]
}

32
curriculum/math-challenges/42-combinatorics/games-with-graphs.json Normal file
View File

@ -0,0 +1,32 @@
{
"name": "Games with graphs",
"order": 10,
"challenges": [
{
"id": "59a5801209a6acac5983b620",
"title": "Progressively finite games",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a988",
"title": "Nim-type games",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
}
]
}

71
curriculum/math-challenges/42-combinatorics/general-enumeration.json Normal file
View File

@ -0,0 +1,71 @@
{
"name": "General Enumeration",
"order": 5,
"challenges": [
{
"id": "59a5801209a6acac5983b615",
"title": "Basic counting principles",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a967",
"title": "Simple arrangements and selections",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a968",
"title": "Arrangements and selections with repetitions",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a969",
"title": "Distributions",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a970",
"title": "Binomial identities",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
}
]
}

58
curriculum/math-challenges/42-combinatorics/generating-functions.json Normal file
View File

@ -0,0 +1,58 @@
{
"name": "Generating Functions",
"order": 6,
"challenges": [
{
"id": "59a5801209a6acac5983b616",
"title": "Generating function models",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a972",
"title": "Calculating coefficients of generating functions",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a973",
"title": "Partitions",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a974",
"title": "Exponential generating functions",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
}
]
}

45
curriculum/math-challenges/42-combinatorics/inclusion-exclusion.json Normal file
View File

@ -0,0 +1,45 @@
{
"name": "Inclusion-Exclusion",
"order": 8,
"challenges": [
{
"id": "59a5801209a6acac5983b618",
"title": "Counting with Venn Diagrams",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a981",
"title": "Inclusion-Exclusion Formula",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a982",
"title": "Restricted positions and rook polynomials",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
}
]
}

71
curriculum/math-challenges/42-combinatorics/network-algorithms.json Normal file
View File

@ -0,0 +1,71 @@
{
"name": "Network algorithms",
"order": 4,
"challenges": [
{
"id": "59a5801209a6acac5983b614",
"title": "Shortest paths",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a962",
"title": "Minimum spanning trees",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a963",
"title": "Network flows",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a964",
"title": "Algorithmic matching",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a965",
"title": "The Transportation problem",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
}
]
}

58
curriculum/math-challenges/42-combinatorics/polya-enumeration-formula.json Normal file
View File

@ -0,0 +1,58 @@
{
"name": "Polya's Enumeration Formula",
"order": 9,
"challenges": [
{
"id": "59a5801209a6acac5983b619",
"title": "Equivalence and symmetry groups",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a984",
"title": "Burnside's theorems",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a985",
"title": "Cycle index",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a986",
"title": "Polya's formula",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
}
]
}

71
curriculum/math-challenges/42-combinatorics/recurrence-relations.json Normal file
View File

@ -0,0 +1,71 @@
{
"name": "Recurrence Relations",
"order": 7,
"challenges": [
{
"id": "59a5801209a6acac5983b617",
"title": "Recurrence relation models",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a976",
"title": "Divide-and-conquer relations",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a977",
"title": "Solution of linear recurrence relations",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a978",
"title": "Solution of inhomogeneous recurrence relations",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a979",
"title": "Solutions with generating functions",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
}
]
}

58
curriculum/math-challenges/42-combinatorics/trees-and-searching.json Normal file
View File

@ -0,0 +1,58 @@
{
"name": "Trees and searching",
"order": 3,
"challenges": [
{
"id": "59a5801209a6acac5983b613",
"title": "Properties of trees",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a958",
"title": "Search trees and spanning trees",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a959",
"title": "Traveling salesperson problem",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
},
{
"id": "59a5801209a6acac5983a960",
"title": "Tree analysis of sorting algorithms",
"description": [
""
],
"challengeSeed": [
""
],
"tests": [
""
]
}
]
}