fix typo

Author: nemanjam

src/content/post/2025/07-31-maze-solver/index.mdx

@@ -324,11 +324,11 @@ If the heuristic function is well chosen it will make A\* more efficient than th
 
 ## Conclusion
 
-On this example we could see how algorithm analysis and design is a very sensitive and subtle discipline, that leaves no room for a low focus or lack of understanding of the domain. Although BFS, DFS, Dijkstra, and A* share a majority of the implementation, just a subtle change in the code can cause a dramatic change in the behavior.
+On this example we could see how algorithm analysis and design is a very sensitive and subtle discipline, that leaves no room for a low focus or lack of understanding of the domain. Although BFS, DFS, Dijkstra, and A* share the majority of the implementation, just a subtle change in the code can cause a dramatic change in the behavior.
 
 In the demo app you can tweak the predefined mazes in the `tests/fixtures/*.txt` files and try to make your own observations. You can also check the resources and the interactive playground listed in the [References](#references) section.
 
-Did you experiment with maze solving and pathfinding algorithms yourself before? Let me now in the comments.
+Did you experiment with maze solving and pathfinding algorithms yourself before? Let me know in the comments.
 
 ## References