fix(curriculum): Update description in Shortest Path Algorithm Step 20 (#64614)

curriculum/challenges/english/blocks/workshop-shortest-path-algorithm/687b3ef0c2fe185b2abc4654.md

@@ -11,7 +11,7 @@ Once the algorithm has finished running, you need to decide which node(s) to dis
 
 If a specific `target_node` was provided, you'll only show the distance and path to that node. Otherwise, you'll show results for all nodes.
 
-After the outer `for _ in range(n):` loop ends, create a variable named `targets`. Use a conditional expression to assign it `[target_node]` if `target_node` is not `None`, otherwise assign it `list(range(n))`.
+After the outer `for _ in range(n):` loop ends, create a variable named `targets`. Use a conditional expression to assign it `[target_node]` if `target_node` is not `None`, otherwise assign it `range(n)`.
 
 # --hints--