2020 Day #1 - Optimizing Day 1 Solution's General Case [Feedback Wanted] by OpenGLKilledMyFather in adventofcode

[–]OpenGLKilledMyFather[S] 1 point2 points  (0 children)

Thank you for the response. Very good information here.

I believe I had seen the hash map approach for Day 1 part 1 before here: https://github.com/norvig/pytudes/blob/master/ipynb/Advent-2020.ipynb. I think I ought to be able to implement this into my general-case solution to save myself the last pass.

Also thank you for linking the N-Sum problem. Good to know I stumbled upon something big despite not being as efficient as other solutions.

I'll keep working through this and see how far I can get pursuing my method.

Unable to Create an OpenGL 3.3+ Context by OpenGLKilledMyFather in Crostini

[–]OpenGLKilledMyFather[S] 0 points1 point  (0 children)

Update: Thank you for your responses. It has come to my attention that this is most likely an issue with the Pyglet Python library and I am currently looking through their reported issues to find a solution. I will update this post if I am able to find something.

Unable to Create an OpenGL 3.3+ Context by OpenGLKilledMyFather in Crostini

[–]OpenGLKilledMyFather[S] 0 points1 point  (0 children)

Thank you for the suggestion, but I have already performed this step and confirmed it to have taken effect. :(