Our great sponsors
-
That's certainly not necessary though and really not what makes most of the speed, especially for problems like today's. I don't really look at other leaderboard competitor's solutions much but at least my solutions (ranked ~20 today) are almost always completely vanilla Python (the only exception is networkx for the occasional graph problem but even that isn't really that much of a speedup if you know the common graph algorithms) and always self-contained.
-
AdventOfCode
My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA (by jonathanpaulson)
And e.g. Jonathan Paulson never uses any libraries and always starts basically from scratch.
-
SonarQube
Static code analysis for 29 languages.. Your projects are multi-language. So is SonarQube analysis. Find Bugs, Vulnerabilities, Security Hotspots, and Code Smells so you can release quality code every time. Get started analyzing your projects today for free.
-
Re it turning into an infinite loop: Are you sure it was the reduction? Because I ran into the problem of recursing too deep in the explosion/splitting step when I tried disabling intermediate reductions. But it should not result in any nonbinary trees as intermediaries since all operations should retain this "binarity" which we start with. Which input made these problems for you? Then I can check my intermediaries for it (or you can check it via my code here https://github.com/SV-97/AdventOfCode2021/blob/main/Day_18_2/main.py)