CodeCow/freeCodeCamp
1
0
Fork 0
mirror of https://github.com/freeCodeCamp/freeCodeCamp.git synced 2026-06-13 21:02:08 +08:00
Code Issues Actions 3 Packages Projects Releases Wiki Activity

fix(curriculum): correct typo in depth first search lesson (#65649)

Browse Source 
Co-authored-by: Krzysztof G. <60067306+gikf@users.noreply.github.com>
This commit is contained in:
Shashikant jadhav 2026-02-02 18:05:36 +05:30 committed by GitHub
parent 904dd9b871
commit f1a8fe12bc
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
curriculum/challenges/english/blocks/lecture-understanding-graphs-and-trees/68baa5e4f0e07f079245ca08.md
View File

@ -150,7 +150,7 @@ Depth-first search (DFS) is commonly used to solve puzzles with a single solutio
This algorithm can be implemented using recursion or a stack data structure to keep track of the visited nodes.
Stacks follow the LIFO (last in, first out) method, where the last node that was added to the stack is the first one to the removed from the stack.
Stacks follow the LIFO (last in, first out) method, where the last node that was added to the stack is the first one to be removed from the stack.
The algorithm works like this: