Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Peer Review by s298885 #3

Open
yurnero14 opened this issue Oct 23, 2022 · 0 comments
Open

Peer Review by s298885 #3

yurnero14 opened this issue Oct 23, 2022 · 0 comments

Comments

@yurnero14
Copy link

Hello,
I have reviewed your code and tried to run it. I have a few things to say. First of all your code has some good organization, and it was very easier for me to understand and keep track of things. Secondly, I believe that you have surely tried to find optimum solution, but I believe the BFS here is not a very optimal choice since you did not go for a higher N (i tried it too and it didn't work as I believed it would). I believe DFS or some other approach can give you better results for a higher N. The results are nevertheless very optimal. Good work. :)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant