Update docs/2023/puzzles/day17.md

Co-authored-by: Philippus Baalman <[email protected]>

Author: stewSquared

docs/2023/puzzles/day17.md

@@ -12,7 +12,7 @@ https://adventofcode.com/2023/day/17
 
 This is a classic search problem with an interesting restriction on state transformations.
 
-We will solve this using Djikstra's Algorithm to find a path through the grid, using the heat loss of each position as our node weights. However, the states in our priority queue will need to include more than just position and accumulated heat loss, since the streak of forward movements in a given direction affects which positions are accessible from a given state.
+We will solve this using Dijkstra's Algorithm to find a path through the grid, using the heat loss of each position as our node weights. However, the states in our priority queue will need to include more than just position and accumulated heat loss, since the streak of forward movements in a given direction affects which positions are accessible from a given state.
 
 Since the restrictions on state transformations differ in part 1 and part 2, we'll model them separately from the base state transformations.