admin/developer-roadmap
1
0 Fork 0
Code Issues Pull Requests Actions 2 Packages Projects Releases Wiki Activity

chore: update roadmap content json (#8742)

Browse Source 
Co-authored-by: kamranahmedse <4921183+kamranahmedse@users.noreply.github.com>
This commit is contained in:
github-actions[bot]andkamranahmedse authored and GitHub committed 2025-06-07 20:39:04 +06:00
1 parent fda439f0e9
commit e4b475cd78
16 files changed
+550 -384
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

public/roadmap-content/python.json
+90 -120
View File
@@ -1,8 +1,44 @@
{
"GISOFMKvnBys0O0IMpz2J": {
"title": "Learn the Basics",
"description": "",
"links": []
"description": "Python is a high-level, interpreted, general-purpose programming language. Its design philosophy emphasizes code readability with the use of significant indentation. Python is dynamically-typed and garbage-collected.\n\nVisit the following resources to learn more:",
"links": [
{
"title": "Python Website",
"url": "https://www.python.org/",
"type": "article"
},
{
"title": "Python - Wiki",
"url": "https://en.wikipedia.org/wiki/Python_(programming_language)",
"type": "article"
},
{
"title": "Tutorial Series: How to Code in Python",
"url": "https://www.digitalocean.com/community/tutorials/how-to-write-your-first-python-3-program",
"type": "article"
},
{
"title": "Google's Python Class",
"url": "https://developers.google.com/edu/python",
"type": "article"
},
{
"title": "W3Schools - Python Tutorial",
"url": "https://www.w3schools.com/python",
"type": "article"
},
{
"title": "Explore top posts about Python",
"url": "https://app.daily.dev/tags/python?ref=roadmapsh",
"type": "article"
},
{
"title": "Learn Python - Full Course",
"url": "https://www.youtube.com/watch?v=4M87qBgpafk",
"type": "video"
}
]
},
"6xRncUs3_vxVbDur567QA": {
"title": "Basic Syntax",
@@ -261,119 +297,6 @@
]
},
"OPD4WdMO7q4gRZMcRCQh1": {
"title": "Arrays and Linked Lists",
"description": "",
"links": []
},
"0NlRczh6ZEaFLlT6LORWz": {
"title": "Heaps, Stacks and Queues",
"description": "",
"links": []
},
"DG4fi1e5ec2BVckPLsTJS": {
"title": "Hash Tables",
"description": "",
"links": []
},
"uJIqgsqUbE62Tyo3K75Qx": {
"title": "Binary Search Tree",
"description": "",
"links": []
},
"kLBgy_nxxjE8SxdVi04bq": {
"title": "Recursion",
"description": "",
"links": []
},
"vvTmjcWCVclOPY4f_5uB0": {
"title": "Sorting Algorithms",
"description": "",
"links": []
},
"274uk28wzxn6EKWQzLpHs": {
"title": "Modules",
"description": "Modules refer to a file containing Python statements and definitions. A file containing Python code, for example: `example.py`, is called a module, and its module name would be example. We use modules to break down large programs into small manageable and organized files. Furthermore, modules provide reusability of code.\n\nVisit the following resources to learn more:",
"links": [
{
"title": "Python Modules",
"url": "https://docs.python.org/3/tutorial/modules.html",
"type": "article"
},
{
"title": "Modules in Python",
"url": "https://www.programiz.com/python-programming/modules",
"type": "article"
}
]
},
"JDDG4KfhtIlw1rkNCzUli": {
"title": "Learn the Basics",
"description": "Python is a high-level, interpreted, general-purpose programming language. Its design philosophy emphasizes code readability with the use of significant indentation. Python is dynamically-typed and garbage-collected.\n\nVisit the following resources to learn more:",
"links": [
{
"title": "Python Website",
"url": "https://www.python.org/",
"type": "article"
},
{
"title": "Python - Wiki",
"url": "https://en.wikipedia.org/wiki/Python_(programming_language)",
"type": "article"
},
{
"title": "Tutorial Series: How to Code in Python",
"url": "https://www.digitalocean.com/community/tutorials/how-to-write-your-first-python-3-program",
"type": "article"
},
{
"title": "Google's Python Class",
"url": "https://developers.google.com/edu/python",
"type": "article"
},
{
"title": "W3Schools - Python Tutorial",
"url": "https://www.w3schools.com/python",
"type": "article"
},
{
"title": "Explore top posts about Python",
"url": "https://app.daily.dev/tags/python?ref=roadmapsh",
"type": "article"
},
{
"title": "Learn Python - Full Course",
"url": "https://www.youtube.com/watch?v=4M87qBgpafk",
"type": "video"
}
]
},
"VJSIbYJcy2MC6MOFBrqXi": {
"title": "Data Structures & Algorithms",
"description": "A data structure is a named location that can be used to store and organize data. And, an algorithm is a collection of steps to solve a particular problem. Learning data structures and algorithms allow us to write efficient and optimized computer programs.\n\nVisit the following resources to learn more:",
"links": [
{
"title": "Visit Dedicated DSA Roadmap",
"url": "https://roadmap.sh/datastructures-and-algorithms",
"type": "article"
},
{
"title": "Learn DS & Algorithms",
"url": "https://www.programiz.com/dsa",
"type": "article"
},
{
"title": "Explore top posts about Algorithms",
"url": "https://app.daily.dev/tags/algorithms?ref=roadmapsh",
"type": "article"
},
{
"title": "Data Structures Illustrated",
"url": "https://www.youtube.com/playlist?list=PLkZYeFmDuaN2-KUIv-mvbjfKszIGJ4FaY",
"type": "video"
}
]
},
"kIuns7FOwapwtFLKo1phQ": {
"title": "Arrays and Linked Lists",
"description": "Arrays store elements in contiguous memory locations, resulting in easily calculable addresses for the elements stored and this allows faster access to an element at a specific index. Linked lists are less rigid in their storage structure and elements are usually not stored in contiguous locations, hence they need to be stored with additional tags giving a reference to the next element. This difference in the data storage scheme decides which data structure would be more suitable for a given situation.\n\nVisit the following resources to learn more:",
"links": [
@@ -399,7 +322,7 @@
}
]
},
"rSfg5M65LyZldhrdWOr90": {
"0NlRczh6ZEaFLlT6LORWz": {
"title": "Heaps, Stacks and Queues",
"description": "**Stacks:** Operations are performed LIFO (last in, first out), which means that the last element added will be the first one removed. A stack can be implemented using an array or a linked list. If the stack runs out of memory, it’s called a stack overflow.\n\n**Queue:** Operations are performed FIFO (first in, first out), which means that the first element added will be the first one removed. A queue can be implemented using an array.\n\n**Heap:** A tree-based data structure in which the value of a parent node is ordered in a certain way with respect to the value of its child node(s). A heap can be either a min heap (the value of a parent node is less than or equal to the value of its children) or a max heap (the value of a parent node is greater than or equal to the value of its children).\n\nVisit the following resources to learn more:",
"links": [
@@ -435,7 +358,7 @@
}
]
},
"0-m8jVuDKE8hX1QorKGTM": {
"DG4fi1e5ec2BVckPLsTJS": {
"title": "Hash Tables",
"description": "Hash Table, Map, HashMap, Dictionary or Associative are all the names of the same data structure. It is a data structure that implements a set abstract data type, a structure that can map keys to values.\n\nVisit the following resources to learn more:",
"links": [
@@ -456,7 +379,7 @@
}
]
},
"7NZlydjm4432vLY1InBS7": {
"uJIqgsqUbE62Tyo3K75Qx": {
"title": "Binary Search Tree",
"description": "A binary search tree, also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree\n\nVisit the following resources to learn more:",
"links": [
@@ -477,7 +400,7 @@
}
]
},
"94KnPMQdNTOwQkUv37tAk": {
"kLBgy_nxxjE8SxdVi04bq": {
"title": "Recursion",
"description": "Recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same problem. Recursion solves such recursive problems by using functions that call themselves from within their own code.\n\nVisit the following resources to learn more:",
"links": [
@@ -493,7 +416,7 @@
}
]
},
"YNptpfK9qv2ovmkUXLkJT": {
"vvTmjcWCVclOPY4f_5uB0": {
"title": "Sorting Algorithms",
"description": "Sorting refers to arranging data in a particular format. Sorting algorithm specifies the way to arrange data in a particular order. Most common orders are in numerical or lexicographical order. The importance of sorting lies in the fact that data searching can be optimized to a very high level, if data is stored in a sorted manner.\n\nVisit the following resources to learn more:",
"links": [
@@ -514,6 +437,48 @@
}
]
},
"274uk28wzxn6EKWQzLpHs": {
"title": "Modules",
"description": "Modules refer to a file containing Python statements and definitions. A file containing Python code, for example: `example.py`, is called a module, and its module name would be example. We use modules to break down large programs into small manageable and organized files. Furthermore, modules provide reusability of code.\n\nVisit the following resources to learn more:",
"links": [
{
"title": "Python Modules",
"url": "https://docs.python.org/3/tutorial/modules.html",
"type": "article"
},
{
"title": "Modules in Python",
"url": "https://www.programiz.com/python-programming/modules",
"type": "article"
}
]
},
"VJSIbYJcy2MC6MOFBrqXi": {
"title": "Data Structures & Algorithms",
"description": "A data structure is a named location that can be used to store and organize data. And, an algorithm is a collection of steps to solve a particular problem. Learning data structures and algorithms allow us to write efficient and optimized computer programs.\n\nVisit the following resources to learn more:",
"links": [
{
"title": "Visit Dedicated DSA Roadmap",
"url": "https://roadmap.sh/datastructures-and-algorithms",
"type": "article"
},
{
"title": "Learn DS & Algorithms",
"url": "https://www.programiz.com/dsa",
"type": "article"
},
{
"title": "Explore top posts about Algorithms",
"url": "https://app.daily.dev/tags/algorithms?ref=roadmapsh",
"type": "article"
},
{
"title": "Data Structures Illustrated",
"url": "https://www.youtube.com/playlist?list=PLkZYeFmDuaN2-KUIv-mvbjfKszIGJ4FaY",
"type": "video"
}
]
},
"08XifLQ20c4FKI_4AWNBQ": {
"title": "Builtin",
"description": "Python has a rich standard library of built-in modules that provide a wide range of functionality. Some of the most commonly used built-in modules include: sys, os, math, datetime, random, re, itertools, etc.\n\nVisit the following resources to learn more:",
@@ -806,6 +771,11 @@
"title": "Poetry Docs",
"url": "https://python-poetry.org/docs/",
"type": "article"
},
{
"title": "Python Poetry - Basics",
"url": "https://www.youtube.com/watch?v=Ji2XDxmXSOM",
"type": "video"
}
]
},