Anybody else browsing by mobile try to do Level 1 by inspection?
Can you solve it? The Greplin programming challenge
11–20 of 167 posts
Re: Can you solve it? The Greplin programming challenge
#12Anybody else browsing by mobile try to do Level 1 by inspection?
After doing the obvious brute force algorithm, the correct answer is not a real word. So you'll have a tough time getting it on your own
Re: Can you solve it? The Greplin programming challenge
#13Anybody else browsing by mobile try to do Level 1 by inspection?
After doing the obvious brute force algorithm, the correct answer is not a real word. So you'll have a tough time getting it on your own
Well, I was suggesting looking for symmetrical triads (or repeating characters) and then working outward. I'd say the eye is pretty good at picking out symmetries.
Re: Can you solve it? The Greplin programming challenge
#14Done, as usual with these things using Python feels like cheating.
Re: Can you solve it? The Greplin programming challenge
#1530 minutes. Would have been less but the IVR response was a little confusing. Took about 40 lines Ruby code to solve.
Re: Can you solve it? The Greplin programming challenge
#16Done, as usual with these things using Python feels like cheating.
The last problem was really simple in Python. I was all psyched up for a big bad end-level boss! Still, it was fun to play.
Re: Can you solve it? The Greplin programming challenge
#17Earlier quoted context omitted.
After doing the obvious brute force algorithm, the correct answer is not a real word. So you'll have a tough time getting it on your own
Well, I was suggesting looking for symmetrical triads (or repeating characters) and then working outward. I'd say the eye is pretty good at picking out symmetries.
Why aren't you guys just searching for the palindromes?
There's more efficient ways than doing every character, or groups of them... What constitutes a palindrome? What does that mean to simplify what we're doing?
Re: Can you solve it? The Greplin programming challenge
#18There are only 31 known Fibonacci primes (plus a handful probable primes)...
Re: Can you solve it? The Greplin programming challenge
#19Anybody else browsing by mobile try to do Level 1 by inspection?
Brute works here because of bad test case. Author could have generated a smart test case and then optimal algorithm could be using suffix array which takes O(n), brute would take O(n!). However a bit smart brute gave the answer in approx 3-4 minutes ( computation + coding time). And yes, Python FTW.
Re: Can you solve it? The Greplin programming challenge
#20too easy. about 30mins and 100 lines of C#.