Name countries of the world from the shortest substrings that uniquely identify each country. Example: Given apple, grape, and orange, substrings L, GR, and O uniquely identify each item.
The shortest substring was found by the following algorithm.
1. For each substring length n, starting from n=1, List all substrings of all countries ignoring spaces and diacritics (e.g. substrings of length 3 of Sri Lanka is SRI, RIL, ILA, LAN, etc.)
2. A substring is the shortest substring of a country if:
- The substring uniquely identifies a country and it has no shorter unique substring
- The substring is the entire country name, even if it's ambiguous (e.g. MALI, which is also a substring of Somalia)
1. For each substring length n, starting from n=1, List all substrings of all countries ignoring spaces and diacritics (e.g. substrings of length 3 of Sri Lanka is SRI, RIL, ILA, LAN, etc.)
2. A substring is the shortest substring of a country if:
- The substring uniquely identifies a country and it has no shorter unique substring
- The substring is the entire country name, even if it's ambiguous (e.g. MALI, which is also a substring of Somalia)