Gamified challenge · Hash maps
You want to glue together a note from letters cut out of a magazine. Each letter in the magazine can be cut out only once, and the note needs every one of its letters, repeats included. Both strings hold lowercase letters only.
Write canBuild(note, magazine) (Python: can_build(note, magazine)) that returns true if the note can be made, else false. An empty note can always be made.
Example: canBuild("gold", "bigoldlad") is true, but canBuild("freedom", "dormfedxo") is false: the note needs two es and the magazine has only one.
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google