71 lines
1.2 KiB
JSON
71 lines
1.2 KiB
JSON
|
{
|
||
|
|
"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": [
|
||
|
|
""
|
||
|
|
]
|
||
|
|
}
|
||
|
|
]
|
||
|
|
}
|