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

feat(curriculum): adding review JS content to prep exam review page (#57427)

Browse Source 
Co-authored-by: Zaira <33151350+zairahira@users.noreply.github.com>
Co-authored-by: Dario-DC <105294544+Dario-DC@users.noreply.github.com>
This commit is contained in:
Jessica Wilkins
2024-12-09 09:08:11 -08:00
committed by GitHub
parent 2c8041f2e2
commit d524fb52f8
3 changed files with 2850 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files
client/i18n/locales/english/intro.json
+2 -1
View File
@@ -3279,7 +3279,8 @@
"review-javascript": {
"title": "JavaScript Review",
"intro": [
"Review the JavaScript concepts to prepare for the upcoming quiz."
"Before you take the JavaScript prep exam, you will need to review first.",
"Open up this page, to review all of the concepts taught including variables, strings, booleans, functions, objects, arrays, debugging, working with the DOM and more."
]
},
"kagw": { "title": "258", "intro": [] },
curriculum/challenges/english/25-front-end-development/review-javascript/6723d3cfdd0717d3f1bf27e3.md
+2847 -1
View File
File diff suppressed because it is too large Load Diff
curriculum/challenges/english/25-front-end-development/review-recursion/6723d1f0568292cd394d6fb6.md
+1 -1
View File
@@ -26,7 +26,7 @@ In the above example, the `findFactorial` function is called recursively until `
- Recursion allows you to handle something with an unknown depth, such as deeply nested objects/arrays, or a file tree.
- A call stack is used to keep track of the function calls in a recursive function. Each time a function is called, it is added to the call stack. When the base case is reached, the function calls are removed off the stack.
- - You should carefully define the base case as calling it indefinitely can cause your code to crash. This is because the recursion keeps piling more and more function calls till the system runs out of memory.
- You should carefully define the base case as calling it indefinitely can cause your code to crash. This is because the recursion keeps piling more and more function calls till the system runs out of memory.
- Recursions find their uses in solving mathematical problems like factorial and Fibonacci, traversing trees and graphs, generating permutations and combinations and much more.
# --assignment--