A rough solution to Richard's most common phrase problem.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| (let [input (take 1000 (repeatedly #(rand-int 10))) | |
| n 3] | |
| (take 10 | |
| (reverse (sort-by second | |
| (frequencies (mapcat #(partition n (drop % input)) | |
| (range n))))))) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment