gitadmin/freeCodeCamp
1
0
Fork 0
mirror of https://github.com/freeCodeCamp/freeCodeCamp.git synced 2026-05-28 18:26:54 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix(client): add note on JS support to interview prep blocks (#60509)

Browse Source
This commit is contained in:
Shinji Nobuhara
2025-05-27 23:14:32 +09:00
committed by GitHub
parent 63f6a5d61e
commit 90230f491d
1 changed files with 18 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files
client/i18n/locales/english/intro.json
+18 -8
View File
@@ -1167,14 +1167,16 @@
"title": "Algorithms",
"intro": [
"These free programming exercises will teach you about some common algorithms that you will likely encounter in real life. They are a great opportunity to improve your logic and programming skills.",
"These algorithms are frequently used in job interviews to test a candidate's skills. We'll give you clear and concise explanations of how these different algorithms work so you can implement a solution for each one."
"These algorithms are frequently used in job interviews to test a candidate's skills. We'll give you clear and concise explanations of how these different algorithms work so you can implement a solution for each one.",
"NOTE: These challenges support JavaScript only solutions."
]
},
"data-structures": {
"title": "Data Structures",
"intro": [
"These free programming courses are meant to help you deal with large and complex data structures that you may not yet be familiar with.",
"Working through the courses below, you will learn about each type of data structure, and implement algorithms to reinforce your understanding of them."
"Working through the courses below, you will learn about each type of data structure, and implement algorithms to reinforce your understanding of them.",
"NOTE: These challenges support JavaScript only solutions."
]
},
"take-home-projects": {
@@ -1305,31 +1307,36 @@
"project-euler-problems-1-to-100": {
"title": "Project Euler Problems 1 to 100",
"intro": [
"In this first set of challenges, you will use mathematical concepts like the Fibonacci sequence, prime number theory, and combinatorics to write efficient algorithms to solve these problems."
"In this first set of challenges, you will use mathematical concepts like the Fibonacci sequence, prime number theory, and combinatorics to write efficient algorithms to solve these problems.",
"NOTE: These challenges support JavaScript only solutions."
]
},
"project-euler-problems-101-to-200": {
"title": "Project Euler Problems 101 to 200",
"intro": [
"In this set of challenges, you'll build upon the skills you learned in the first part of the course and use more advanced concepts like vector computation, Pascal's pyramid, and the RSA algorithm to solve these problems efficiently."
"In this set of challenges, you'll build upon the skills you learned in the first part of the course and use more advanced concepts like vector computation, Pascal's pyramid, and the RSA algorithm to solve these problems efficiently.",
"NOTE: These challenges support JavaScript only solutions."
]
},
"project-euler-problems-201-to-300": {
"title": "Project Euler Problems 201 to 300",
"intro": [
"In this set of challenges, you'll continue to build upon the skills you learned earlier and use concepts like the binomial theorem, Hamming numbers, and the Collatz sequence to further develop your math and problem solving skills."
"In this set of challenges, you'll continue to build upon the skills you learned earlier and use concepts like the binomial theorem, Hamming numbers, and the Collatz sequence to further develop your math and problem solving skills.",
"NOTE: These challenges support JavaScript only solutions."
]
},
"project-euler-problems-301-to-400": {
"title": "Project Euler Problems 301 to 400",
"intro": [
"Here you will continue to flex your mathematical and algorithmic skills as you use concepts such as combinatorial game theory, bitwise operations, and Golomb's self-describing sequence to develop efficient solutions to these problems."
"Here you will continue to flex your mathematical and algorithmic skills as you use concepts such as combinatorial game theory, bitwise operations, and Golomb's self-describing sequence to develop efficient solutions to these problems.",
"NOTE: These challenges support JavaScript only solutions."
]
},
"project-euler-problems-401-to-480": {
"title": "Project Euler Problems 401 to 480",
"intro": [
"In this final set of challenges, you will need draw upon everything you learned up to this point and use advanced concepts like unitary divisors, the Kaprekar routine, and much more to solve these complex problems."
"In this final set of challenges, you will need draw upon everything you learned up to this point and use advanced concepts like unitary divisors, the Kaprekar routine, and much more to solve these complex problems.",
"NOTE: These challenges support JavaScript only solutions."
]
}
}
@@ -1731,7 +1738,10 @@
"blocks": {
"rosetta-code-challenges": {
"title": "Rosetta Code Challenges",
"intro": ["These are the challenges for Rosetta Code."]
"intro": [
"These are the challenges for Rosetta Code.",
"NOTE: These challenges support JavaScript only solutions."
]
}
}
},