293. Can You Build It
Foundation1000 ms256 MBSolved by 0%
Print Yes if the first string can be built using letters taken from the
second, using each available letter at most once. Print No otherwise.
aa aab -> Yes (two a's are available)
aa ab -> No (only one a is available)
Order does not matter, only how many of each letter there are. So count the supply, then check that every letter you need is available in at least that quantity.
Constraints - `1 ≤ length of each string ≤ 200000` - Both strings are lowercase letters.
Input
The first line contains the string you must build. The second line contains the string of available letters. Both consist of lowercase letters.
Output
Print Yes or No on one line.
Inputaa
aab
OutputYes
Notehas exactly enough of the needed letter with one spare
Inputaa
ab
OutputNo
Notehas the right letters and not enough of one
Hints
Four rungs, in order. The last two open once you have submitted an attempt. A wrong one counts.
Hint 1Where to start
Hint 2The approachOpen hint 1 first. This one carries on from it.
Hint 3PseudocodeOpen hint 2 first. This one carries on from it.
Hint 4Full solutionOpen hint 3 first. This one carries on from it.