mirror of
https://github.com/freeCodeCamp/freeCodeCamp.git
synced 2026-04-30 16:01:14 -04:00
feat(curriculum): release remaining python modules (#63494)
This commit is contained in:
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Build an Adjacency List to Matrix Converter",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lab-adjacency-list-to-matrix-converter",
|
||||
"helpCategory": "Python",
|
||||
"challengeOrder": [
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Implement the Bisection Method",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lab-bisection-method",
|
||||
"blockLayout": "link",
|
||||
"blockLabel": "lab",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Build a Budget App",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"usesMultifileEditor": true,
|
||||
"dashedName": "lab-budget-app",
|
||||
"challengeOrder": [
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Implement the Depth-First Search Algorithm",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lab-depth-first-search",
|
||||
"helpCategory": "Python",
|
||||
"blockLayout": "link",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Build a Game Character Stats Tracker",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lab-game-character-stats",
|
||||
"helpCategory": "Python",
|
||||
"blockLayout": "link",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Build a Hash Table",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lab-hash-table",
|
||||
"challengeOrder": [
|
||||
{ "id": "67ed03ac474c48692f41749e", "title": "Build a Hash Table" }
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Implement the Luhn Algorithm",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lab-luhn-algorithm",
|
||||
"helpCategory": "Python",
|
||||
"challengeOrder": [
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Implement the N-Queens Algorithm",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lab-n-queens-problem",
|
||||
"helpCategory": "Python",
|
||||
"blockLayout": "link",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Build an Nth Fibonacci Number Calculator",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lab-nth-fibonacci-number",
|
||||
"helpCategory": "Python",
|
||||
"blockLayout": "link",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Build a Planet Class",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lab-planet-class",
|
||||
"helpCategory": "Python",
|
||||
"blockLayout": "link",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Build a Player Interface",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lab-player-interface",
|
||||
"helpCategory": "Python",
|
||||
"blockLayout": "link",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Build a Polygon Area Calculator",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lab-polygon-area-calculator",
|
||||
"challengeOrder": [
|
||||
{
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Implement the Quicksort Algorithm",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"usesMultifileEditor": true,
|
||||
"dashedName": "lab-quicksort",
|
||||
"blockLayout": "link",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Selection Sort Lab",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lab-selection-sort",
|
||||
"challengeOrder": [
|
||||
{ "id": "680b3ef395479b0e449ecb6e", "title": "Build a Selection Sort" }
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Implement the Tower of Hanoi Algorithm",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lab-tower-of-hanoi",
|
||||
"blockLayout": "link",
|
||||
"blockLabel": "lab",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Classes and Objects",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lecture-classes-and-objects",
|
||||
"blockLabel": "lecture",
|
||||
"blockLayout": "challenge-list",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Searching and Sorting Algorithms",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lecture-searching-and-sorting-algorithms",
|
||||
"blockLabel": "lecture",
|
||||
"blockLayout": "challenge-list",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Understanding Abstraction",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lecture-understanding-abstraction",
|
||||
"blockLabel": "lecture",
|
||||
"blockLayout": "challenge-list",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Understanding Dynamic Programming",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lecture-understanding-dynamic-programming",
|
||||
"blockLabel": "lecture",
|
||||
"blockLayout": "challenge-list",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Understanding Graphs and Trees",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lecture-understanding-graphs-and-trees",
|
||||
"challengeOrder": [
|
||||
{
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Understanding Inheritance and Polymorphism",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lecture-understanding-inheritance-and-polymorphism",
|
||||
"blockLabel": "lecture",
|
||||
"blockLayout": "challenge-list",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Understanding Object Oriented Programming and Encapsulation",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lecture-understanding-object-oriented-programming-and-encapsulation",
|
||||
"blockLabel": "lecture",
|
||||
"blockLayout": "challenge-list",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Working with Common Data Structures",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "lecture-working-with-common-data-structures",
|
||||
"blockLabel": "lecture",
|
||||
"blockLayout": "challenge-list",
|
||||
|
||||
@@ -2,7 +2,7 @@
|
||||
"name": "Classes and Objects Quiz",
|
||||
"blockLabel": "quiz",
|
||||
"blockLayout": "link",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "quiz-classes-and-objects",
|
||||
"challengeOrder": [
|
||||
{ "id": "67f413038f0f8c452c660dc5", "title": "Classes and Objects Quiz" }
|
||||
|
||||
@@ -2,7 +2,7 @@
|
||||
"name": "Data Structures Quiz",
|
||||
"blockLabel": "quiz",
|
||||
"blockLayout": "link",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "quiz-data-structures",
|
||||
"challengeOrder": [
|
||||
{ "id": "67f41341453c2247fb2828f7", "title": "Data Structures Quiz" }
|
||||
|
||||
@@ -2,7 +2,7 @@
|
||||
"name": "Dynamic Programming Quiz",
|
||||
"blockLabel": "quiz",
|
||||
"blockLayout": "link",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "quiz-dynamic-programming",
|
||||
"challengeOrder": [
|
||||
{ "id": "67f413a2abe9894c52e15c6e", "title": "Dynamic Programming Quiz" }
|
||||
|
||||
@@ -2,7 +2,7 @@
|
||||
"name": "Graphs and Trees Quiz",
|
||||
"blockLabel": "quiz",
|
||||
"blockLayout": "link",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "quiz-graphs-and-trees",
|
||||
"challengeOrder": [
|
||||
{ "id": "67f4138c34cd9c4ac783ceef", "title": "Graphs and Trees Quiz" }
|
||||
|
||||
@@ -2,7 +2,7 @@
|
||||
"name": "Object Oriented Programming Quiz",
|
||||
"blockLabel": "quiz",
|
||||
"blockLayout": "link",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "quiz-object-oriented-programming",
|
||||
"challengeOrder": [
|
||||
{
|
||||
|
||||
@@ -2,7 +2,7 @@
|
||||
"name": "Searching and Sorting Algorithms Quiz",
|
||||
"blockLabel": "quiz",
|
||||
"blockLayout": "link",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "quiz-searching-and-sorting-algorithms",
|
||||
"challengeOrder": [
|
||||
{
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Classes and Objects Review",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "review-classes-and-objects",
|
||||
"challengeOrder": [
|
||||
{ "id": "67f39d848979082814c07d9c", "title": "Review Classes and Objects" }
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Data Structures Review",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "review-data-structures",
|
||||
"challengeOrder": [
|
||||
{ "id": "67f39dc7129b092b27099d8c", "title": "Data Structures Review" }
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Dynamic Programming Review",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "review-dynamic-programming",
|
||||
"challengeOrder": [
|
||||
{ "id": "67f39e2119042d2f2ca926ff", "title": "Dynamic Programming Review" }
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Graphs and Trees Review",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "review-graphs-and-trees",
|
||||
"challengeOrder": [
|
||||
{ "id": "67f39e06b8a11b2de9ccd361", "title": "Graphs and Trees Review" }
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Object Oriented Programming Review",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "review-object-oriented-programming",
|
||||
"challengeOrder": [
|
||||
{
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Python Review",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "review-python",
|
||||
"challengeOrder": [
|
||||
{ "id": "67f39e391c9b373069def02c", "title": "Python Review" }
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Searching and Sorting Algorithms Review",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "review-searching-and-sorting-algorithms",
|
||||
"challengeOrder": [
|
||||
{
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Implement the Binary Search Algorithm",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"usesMultifileEditor": true,
|
||||
"hasEditableBoundaries": true,
|
||||
"dashedName": "workshop-binary-search",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Implement the Breadth-First Search Algorithm",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "workshop-breadth-first-search",
|
||||
"helpCategory": "Python",
|
||||
"blockLayout": "challenge-grid",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Build a Discount Calculator",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "workshop-discount-calculator",
|
||||
"helpCategory": "Python",
|
||||
"blockLayout": "challenge-grid",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Build an Email Simulator",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "workshop-email-simulator",
|
||||
"helpCategory": "Python",
|
||||
"blockLayout": "challenge-grid",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Build a Linked List",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "workshop-linked-list-class",
|
||||
"helpCategory": "Python",
|
||||
"usesMultifileEditor": true,
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Build a Media Catalogue",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "workshop-media-catalogue",
|
||||
"helpCategory": "Python",
|
||||
"usesMultifileEditor": true,
|
||||
|
||||
@@ -2,7 +2,7 @@
|
||||
"name": "Implement the Merge Sort Algorithm",
|
||||
"blockLayout": "challenge-grid",
|
||||
"blockLabel": "workshop",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"usesMultifileEditor": true,
|
||||
"hasEditableBoundaries": true,
|
||||
"dashedName": "workshop-merge-sort",
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Build a Musical Instrument Inventory",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "workshop-musical-instrument-inventory",
|
||||
"helpCategory": "Python",
|
||||
"challengeOrder": [
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "Build a Salary Tracker",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "workshop-salary-tracker",
|
||||
"helpCategory": "Python",
|
||||
"blockLayout": "challenge-grid",
|
||||
|
||||
@@ -2,7 +2,7 @@
|
||||
"name": "Implement the Shortest Path Algorithm",
|
||||
"blockLayout": "challenge-grid",
|
||||
"blockLabel": "workshop",
|
||||
"isUpcomingChange": true,
|
||||
"isUpcomingChange": false,
|
||||
"dashedName": "workshop-shortest-path-algorithm",
|
||||
"helpCategory": "Python",
|
||||
"usesMultifileEditor": true,
|
||||
|
||||
@@ -724,7 +724,7 @@
|
||||
},
|
||||
{
|
||||
"dashedName": "python-classes-and-objects",
|
||||
"comingSoon": true,
|
||||
"comingSoon": false,
|
||||
"blocks": [
|
||||
"lecture-classes-and-objects",
|
||||
"workshop-musical-instrument-inventory",
|
||||
@@ -737,7 +737,7 @@
|
||||
},
|
||||
{
|
||||
"dashedName": "python-object-oriented-programming",
|
||||
"comingSoon": true,
|
||||
"comingSoon": false,
|
||||
"blocks": [
|
||||
"lecture-understanding-object-oriented-programming-and-encapsulation",
|
||||
"workshop-salary-tracker",
|
||||
@@ -754,7 +754,7 @@
|
||||
},
|
||||
{
|
||||
"dashedName": "python-linear-data-structures",
|
||||
"comingSoon": true,
|
||||
"comingSoon": false,
|
||||
"blocks": [
|
||||
"lecture-working-with-common-data-structures",
|
||||
"workshop-linked-list-class",
|
||||
@@ -765,7 +765,7 @@
|
||||
},
|
||||
{
|
||||
"dashedName": "python-algorithms",
|
||||
"comingSoon": true,
|
||||
"comingSoon": false,
|
||||
"blocks": [
|
||||
"lecture-searching-and-sorting-algorithms",
|
||||
"workshop-binary-search",
|
||||
@@ -781,7 +781,7 @@
|
||||
},
|
||||
{
|
||||
"dashedName": "python-graphs-and-trees",
|
||||
"comingSoon": true,
|
||||
"comingSoon": false,
|
||||
"blocks": [
|
||||
"lecture-understanding-graphs-and-trees",
|
||||
"workshop-shortest-path-algorithm",
|
||||
@@ -795,7 +795,7 @@
|
||||
},
|
||||
{
|
||||
"dashedName": "python-dynamic-programming",
|
||||
"comingSoon": true,
|
||||
"comingSoon": false,
|
||||
"blocks": [
|
||||
"lecture-understanding-dynamic-programming",
|
||||
"lab-nth-fibonacci-number",
|
||||
@@ -804,7 +804,7 @@
|
||||
]
|
||||
},
|
||||
{
|
||||
"comingSoon": true,
|
||||
"comingSoon": false,
|
||||
"moduleType": "review",
|
||||
"dashedName": "review-python",
|
||||
"blocks": ["review-python"]
|
||||
|
||||
Reference in New Issue
Block a user