We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
How my algorithm works: Try putting the word at the front of your list in the board at all possible positions. (No, actually. i <- [0..9]; j <- [0..9]) For each successful placement, continue with the rest of the list of words. I ended up using do notation on lists and maybeToListing some information.
I'm super proud of it! On the other hand, I'm really glad we don't have hacking on ... uh, on HackerRank ... unlike some other platforms, like CodeForces ... hm.
Here it is! Sorry for the hiding, I'm lazier than Haskell.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Crosswords-101
You are viewing a single comment's thread. Return to all comments →
Wow I actually did it!
How my algorithm works: Try putting the word at the front of your list in the board at all possible positions. (No, actually.
i <- [0..9]; j <- [0..9]) For each successful placement, continue with the rest of the list of words. I ended up using do notation on lists andmaybeToListing some information.I'm super proud of it! On the other hand, I'm really glad we don't have hacking on ... uh, on HackerRank ... unlike some other platforms, like CodeForces ... hm.
Here it is! Sorry for the
hiding, I'm lazier than Haskell.