3 ms·
Very neat. Would it be more efficient to start with every known pangram (~35k) and calculate the score from there instead of scoring every possible set of 7 let
by karagenit 3y ago
Very neat. Would it be more efficient to start with every known pangram (~35k) and calculate the score from there instead of scoring every possible set of 7 letters (~8B) and then filtering for pangrams?
- llimllib 3y agoThe problem is that if you do that, you have to test every word (~42k) against every pangram (~16k) to see if it's a subset. I just wrote two quick test programs to find the score of the set of words for every pangrams, and my approach takes 6s vs 15s for your proposed approach: https://gist.github.com/llimllib/cc01daa8be8ced13ddeb6c76cf115fcc https://gist.github.com/llimllib/cc01daa8be8ced13ddeb6c76cf1...