/TypeScript/Typescript algorithm to find repeating number sequences over time

Typescript algorithm to find repeating number sequences over time

String arr[] = {"12341234abc", "1234foo1234", "12121212", "111111111", "1a1212b123123c12341234d1234512345"};
String regex = "(\\d+?)\\1";
Pattern p = Pattern.compile(regex);
for (String elem : arr) {
    boolean noMatchFound = true;
    Matcher matcher = p.matcher(elem);
    while (matcher.find()) {
        noMatchFound = false;
        System.out.println(elem + " got repeated: " + matcher.group(1));
    }
    if (noMatchFound) {
        System.out.println(elem + " has no repeation");
    }
}

Source: stackoverflow.com

Similar codes

1 vote321 views2 answers
Solitaire
TypeScript
0 vote262 views1 answer
Mongodb nest.js
TypeScript
2 votes287 views1 answer
Socketi io client disconnect
TypeScript
0 vote290 views1 answer
Prisma schema example
TypeScript
1 vote295 views1 answer
Swift code of paytm payments bank
TypeScript
1 vote280 views1 answer
Create an ordered list of the top 3 things cats hate the most.
TypeScript
0 vote246 views1 answer
What is the importance of testng xml file
TypeScript
0 vote260 views5 answers
AddObjects giving a fatal error when pushing data to algolia
TypeScript
3 votes274 views4 answers
Angular images
TypeScript
0 vote249 views1 answer
Positional arguments dart
TypeScript