Let's play a game called 'unscramble'. In this game, you are given a few letters, say LRIBLNAIT
and you have to rearrange it to form a dictionary word - in this case BRILLIANT
.
Say the biggest word in your dictionary is of size and there are words in your dictionary. If you were to write a program to play this game, how would you preprocess the dictionary to optimise the search? Comment on the space and time complexity of the process.
You will have to make some assumptions about and . Mention them explicitly and try to justify them in brief.
This problem is a part of Tessellate S.T.E.M.S.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.