Problem Statement

Maximum Signs from Catalogue Problem Description A sign-making workshop builds oversized letters out of wood and metal, the kind used for big rooftop displays. The workshop is closing down and wants to clear out its remaining stock of loose letters. Every letter still in inventory is listed, in no particular order, inside a single string S, and the closing sale promises that everything must go. Drawn in by the discounts, a customer wants to order letters to spell out the name of her new blog and mount copies of the sign around town. She hasn't picked a final name yet and is weighing K candidate names. What she wants to know is: for whichever name she ends up choosing, how many copies of that sign could she build from the workshop's remaining letters? Given the workshop's letter inventory S and the customer's list of candidate names L, find the largest number of copies of any single name in L that can be assembled from S. Write a function: class Solution { public int solution(String S,