TopCoder problem "FourSubstrings" used in TCO07 Round 4 (Division I Level Three)

Problem Statement


You are given a String[] text. Concatenate all elements of text to make one string. You are also given four Strings a, b, c and d, all of which are substrings of the concatenated text. Find exactly one occurrence of each of these four strings in the text (they are allowed to overlap). Each character in the text that belongs to one or more of these substring occurrences is called covered. For example, if the text is "foursubstrings", and a = "our", b = "s", c = "ring", and d = "sub", one possible configuration is:

foursubstrings - text
 our           - a
    s          - b
         ring  - c
    sub        - d
 ++++++  ++++  - covered letters

The letters marked by '+' are covered.

Return a int[] containing exactly two elements. The first element should be the minimum possible number of covered characters in a configuration, and the second element should be the maximum possible number of covered characters.



Parameters:String[], String, String, String, String
Method signature:int[] getCoverageCount(String[] text, String a, String b, String c, String d)
(be sure your method is public)


-text will contain between 1 and 50 elements, inclusive.
-Each element of text will contain between 1 and 50 characters, inclusive.
-text will contain only lowercase letters ('a'-'z').
-a, b, c and d will each contain between 1 and 50 characters, inclusive.
-a, b, c and d will contain only lowercase letters ('a'-'z').
-a, b, c and d will each be a substring of the concatenation of text.


Returns: {4, 6 }
The minimal number of covered characters corresponds to "ABACaba", and the maximal corresponds to "ABACaBA" (the covered characters are shown in uppercase).
Returns: {4, 5 }
Occurrences of substrings may overlap.
{"ababababa", "baba"}
Returns: {9, 13 }
Returns: {10, 11 }

Problem url:

Problem stats url:


Mike Mirzayanov


PabloGilberto , brett1479 , radeye , Olexiy

Problem categories:

Simple Search, Iteration