Hanoi Tower Puzzle

hanoi_iterative.py: Iterative Approach.

hanoi_recursive.py: Recursive Approach.

Shortest Path Algo

Made with the help of freeCodeCamp: Learn Algorithm Design by Building a Shortest Path Algorithm.

shortest_path.py : has the hardcoded graph

to change the start node and target, function call should be changed:

if __name__ == '__main__':
    shortest_path(graph=my_graph, start='A', target='F')

for start in 'B' and end in 'D':

if __name__ == '__main__':
    shortest_path(graph=my_graph, start='B', target='D')

merge_short.py: simple recursive approach to Merge Sort Algorithm

sudoku_solver.py: like the name says. Maybe not optimal but focused on OOP and functional programming.