Check out the third one. Now I just maybe practice the 4 other and I can get any job. Though my fibs skills are so impressive, so that's probably enough alone.
Oh and... CHECK OUT MY FIBS!
Name:
Anonymous2015-05-08 16:27
Fuck yea op, you got not only 1 but two fibs with one post.
check muh fibs also!
Name:
Anonymous2015-05-08 17:22
check muh fibs also!
Name:
Anonymous2015-05-08 19:17
I solved the last one but I think it might have taken about hour. Should I just kill myself?
I wouldn't know if it was on reddit because I don't fucking go there.
Name:
Anonymous2015-05-09 22:13
(define (problem-2 a b) (apply append (map list a b)))
Name:
Anonymous2015-05-11 12:49
>>14 I've written something similar in Haskell before, that joins two lists respecting order. I.e. join [1, 3, 2, 6] [4, 5, 7] ==== [1, 3, 2, 4, 5, 6, 7]
-- join two lists, respecting order. join :: (Ord a) => [a] -> [a] -> [a] join [] y = y join x [] = x join a@(x:xs) b@(y:ys) = if (x < y) then x : join xs b else y : join a ys
Name:
Anonymous2015-05-11 16:43
Maybe my boss should stop with his little tree traversal problems and ask people to implement fibs.
The following problems are ridiculously simple, but you'd be surprise to discover how many people struggle with them.
He says this, but if you look at his solution to problem 4 he says how people pointed out how his solution was wrong. Looks like he's not fit to be a Software Engineer!
Name:
Anonymous2015-05-14 1:53
>>17 "one, one, and then it's just whatever plus whatever... up to whatever."
>>26 APL is alien shit. Like actual bioluminiscent alien defecation. The keyboard layout for APL looks like a controller for a stargate. But it's syntactically more sensible than Perl.