Get Time

   Problem Statement  

 Problem Statement for ServiceNames

Problem Statement

    I want a list of BioServices that are associated with each KindOfInput (such as "gene", "DNAFragment", "genome", etc.). What is available from my service provider is a list of strings, each containing the name of a service followed by all the KindsOfInput it requires.

Given a String[] services, return a String[] in which each element contains a KindOfInput followed by the names of all the services that use that kind of input.

Each KindOfInput should appear exactly once in the return. Within each element of the return, the service names should be in alphabetical order, and should be separated by the 2 characters ", " (comma space). The KindOfInput should be separated from the first service name by the 5 characters " ==> " (space eq eq gt space). The returned list should be in alphabetical order.

Note that all names are case-sensitive, and that "alphabetical order" refers to the ASCII ordering, where, for example, 'Z' precedes 'a'.



Method signature:String[] makeList(String[] services)
(be sure your method is public)


-services will contain between 1 and 50 elements, inclusive.
-Each element of services will contain between 1 and 50 characters, inclusive.
-Each element of services will contain tokens separated by a single space (' ').
-Each token will consist of 1 or more letters ('A'-'Z' or 'a'-'z').
-The first tokens of the elements in services will be distinct.
-Within each element of services the KindsOfInput will be distinct.


{"BLAST Genome Annotation Sensitivity","PING","X Annotation"}
Returns: {"Annotation ==> BLAST, X", "Genome ==> BLAST", "Sensitivity ==> BLAST" }
Returns: { }
There are no KindsOfInput so the return has 0 elements.
{"BLAST Genome annotation Sensitivity","PING","X Annotation","Apple X ample"}
{"Annotation ==> X",
"Genome ==> BLAST",
"Sensitivity ==> BLAST",
"X ==> Apple",
"ample ==> Apple",
"annotation ==> BLAST" }
annotation and Annotation are distinct kinds of input. annotation comes later alphabetically than any name that starts with an uppercase letter.

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2010, TopCoder, Inc. All rights reserved.

This problem was used for:
       Single Round Match 336 Round 1 - Division I, Level One
       Single Round Match 336 Round 1 - Division II, Level Two