CamelCase Pattern finding

// Java to find CamelCase Pattern // matching import java.util.*;    class GFG{     // Function that prints the camel // case pattern matching static void CamelCase(ArrayList words,                String pattern) {         // Map to store the hashing     // of each words with every     // uppercase letter found     Map> map = new HashMap>();         // Traverse the words array     // that contains all the     // String     for (int i = 0; i < words.size(); i++) {             // Intialise str as         // empty         String str = "";             // length of String words[i]         int l = words.get(i).length();         for (int j = 0; j < l; j++) {                 // For every uppercase             // letter found map             // that uppercase to             // original words             if (words.get(i).charAt(j) >= 'A'                 && words.get(i).charAt(j) <= 'Z') {                 str += words.get(i).charAt(j);                 map.put(str,list(map.get(str),words.get(i)));             }         }     }         boolean wordFound = false;         // Traverse the map for pattern     // matching     for (Map.Entry> it : map.entrySet()) {             // If pattern matches then         // print the corresponding         // mapped words         if (it.getKey().equals(pattern)) {             wordFound = true;             for(String s : it.getValue())             System.out.print(s +"\n");                        }     }         // If word not found print     // "No match found"     if (!wordFound) {         System.out.print("No match found");     } }     private static List list(List list, String str) {     List temp = new ArrayList();     if(list != null)         temp.addAll(list);     temp.add(str);     return temp; }    // Driver's Code public static void main(String[] args) {     String arr[] = {"Hi", "Hello", "HelloWorld",             "HiTech", "HiGeek", "HiTechWorld",             "HiTechCity", "HiTechLab"         };        ArrayList words = new ArrayList(Arrays.asList(arr));         // Pattern to be found     String pattern = "HT";         // Function call to find the     // words that match to the     // given pattern     CamelCase(words, pattern);     } }

Source : https://www.geeksforgeeks.org/camelcase-pattern-matching/?ref=leftbar-rightbar