/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 vote270 views1 answer
Using log how can we find number of digits for a number in java
TypeScript
0 vote190 views1 answer
How to save plots into raster format from r
TypeScript
0 vote221 views1 answer
Selenium components
TypeScript
0 vote186 views1 answer
Check schema exists postgresql
TypeScript
3 votes208 views2 answers
What is typescript
TypeScript
0 vote189 views3 answers
Babel typescript
TypeScript
2 votes223 views1 answer
Loaded because running scripts is disabled on this s
TypeScript
1 vote203 views2 answers
Show all posts from category
TypeScript
1 vote205 views1 answer
Angular 8 set cookie to string
TypeScript
0 vote201 views1 answer
Hackerrank between two sets solution in python
TypeScript