Redex 2 solution matcher

import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

public class DuplicateWords {

    public static void main(String[] args) {

        String regex = "\\b(\\w+)(?:\\W+\\1\\b)+";
        Pattern p = Pattern.compile(regex, Pattern.CASE_INSENSITIVE);

        Scanner in = new Scanner(System.in);
        int numSentences = Integer.parseInt(in.nextLine());
        
        while (numSentences-- > 0) {
            String input = in.nextLine();
            
            Matcher m = p.matcher(input);
            
            // Check for subsequences of input that match the compiled pattern
            while (m.find()) {
                input = input.replaceAll(m.group(), m.group(1));
            }
            
            // Prints the modified sentence.
            System.out.println(input);
        }
        
        in.close();
    }
}

Source: hackerrank.com

Similar codes

0 vote407 views1 answer
How to put array in array list stack overflow
Java
1 vote353 views1 answer
The system cannot find the file specified in java
Java
-2 votes352 views1 answer
How to implements interface in java
Java
1 vote371 views2 answers
Games
Java
1 vote359 views1 answer
Dreamworks studio recent movies
Java
1 vote349 views1 answer
Protobuf java gradle
Java
1 vote377 views1 answer
Java take screenshot
Java
0 vote387 views1 answer
Program to calculate and return the sum of distance between the adjacent numbers in an array of positive integer java
Java
0 vote374 views1 answer
What does .hasNext() do in java
Java
0 vote361 views1 answer
Assign multiple variables to empty string java
Java