/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

0 vote181 views1 answer
How many arguments are in this function call? range(0, 100, 5) 20
TypeScript
0 vote167 views1 answer
Function that takes first & last name and then it greets the user using his full name.
TypeScript
0 vote197 views2 answers
Typescript cannot find namespace
TypeScript
0 vote147 views1 answer
What do you need local sccripts for
TypeScript
0 vote136 views1 answer
Common mistakes
TypeScript
0 vote152 views3 answers
SocketException: An attempt was made to access a socket in a way forbidden by its access permissions. in core 6.0
TypeScript
0 vote176 views1 answer
AFTER RESETTING ANGULAR FORM I AM GETTING RED INVALID FORM
TypeScript
0 vote201 views1 answer
Localhost magento 2 installation redirects to the live server
TypeScript
0 vote137 views1 answer
Socket.io typescript
TypeScript
1 vote155 views1 answer
Check if file.properties is exits android
TypeScript