From f1a8fe12bc7fd79687428c710fa93b2eada84cba Mon Sep 17 00:00:00 2001 From: Shashikant jadhav <149423729+Shashikant2005@users.noreply.github.com> Date: Mon, 2 Feb 2026 18:05:36 +0530 Subject: [PATCH] fix(curriculum): correct typo in depth first search lesson (#65649) Co-authored-by: Krzysztof G. <60067306+gikf@users.noreply.github.com> --- .../68baa5e4f0e07f079245ca08.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/curriculum/challenges/english/blocks/lecture-understanding-graphs-and-trees/68baa5e4f0e07f079245ca08.md b/curriculum/challenges/english/blocks/lecture-understanding-graphs-and-trees/68baa5e4f0e07f079245ca08.md index 1b8fb96fd07..c45a173edcd 100644 --- a/curriculum/challenges/english/blocks/lecture-understanding-graphs-and-trees/68baa5e4f0e07f079245ca08.md +++ b/curriculum/challenges/english/blocks/lecture-understanding-graphs-and-trees/68baa5e4f0e07f079245ca08.md @@ -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: