New answers tagged programming-challenge
0
votes
Finding a sequence of xors to change a to b
Here are some general coding style suggestions.
UX
When I run the code, it sits there waiting for input, but I have no idea what I should type at the prompt.
Instead of a bare ...
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.
...
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:
...
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(...
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)(...
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 ...
Top 50 recent answers are included
Related Tags
programming-challenge × 3400python × 1045
algorithm × 664
performance × 655
java × 636
time-limit-exceeded × 516
c++ × 492
python-3.x × 448
beginner × 429
c# × 298
javascript × 289
strings × 217
primes × 184
c × 161
functional-programming × 109
array × 105
haskell × 101
python-2.x × 93
interview-questions × 93
dynamic-programming × 87
ruby × 78
recursion × 77
palindrome × 76
object-oriented × 74
combinatorics × 71