8
votes
Finding a sequence of xors to change a to b
You can improve the performance by using an \$O(1)\$ algorithm.
Turn all the bits on.
...
- 44.6k
4
votes
Project Euler #909: L-Expressions I
Analyze looking for intelligence
One answer already mentioned that your approach is basically brute force.
This is due to simply iterating through all.
Looking at the possible steps:
A(u) → u+1
Z(u)(...
- 4,656
3
votes
Prime factorization for integers with up to 9-digit long prime factors
I would look up the pollard-rho algorithm. It doesn’t involve any higher mathematics, so you can implement it yourself. If a number n has a prime factor p, that prime factor can be found in about sqrt(...
- 2,970
3
votes
Project Euler #909: L-Expressions I
I don't spend a lot of time on Code Review, but I noticed this question in HNQ and let it stew in the background for a month or so before I found a solution. This answer isn't a review of the code in ...
- 296
2
votes
1
vote
Two solutions to LeetCode 127 Word Ladder
Here are some general coding style suggestions.
Comments
Remove all commented-out code to reduce clutter:
...
- 15.8k
Only top scored, non community-wiki answers of a minimum length are eligible