/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

5 votes217 views3 answers
Intersection python
TypeScript
0 vote220 views1 answer
Avoid intertwining subplots in python
TypeScript
0 vote211 views1 answer
How to print code snippets wordpress
TypeScript
0 vote215 views1 answer
The eval() function
TypeScript
0 vote193 views1 answer
Object is possibly
TypeScript
0 vote217 views1 answer
Deleting a generated lib in nx
TypeScript
0 vote219 views1 answer
The method 'MultiHeaders.set' has fewer named arguments than those of overridden method 'HttpHeaders.set'.
TypeScript
0 vote211 views1 answer
Lifecycle components android dependency
TypeScript
0 vote262 views1 answer
Calling funcionts in bash
TypeScript
0 vote202 views1 answer
How to send alert notifications to multiple destinations
TypeScript