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 vote134 views1 answer
Java unused import statement
Java
0 vote157 views1 answer
Remove activity from recent list android
Java
7 votes147 views1 answer
Java difference between array and list
Java
0 vote146 views1 answer
Log errors with stack traces spring
Java Spring
8 votes132 views3 answers
Leap year program in java
Java
0 vote150 views1 answer
How to easy get 240 fps in minecraft java
Java
49 votes135 views6 answers
Char array to string java
Java
6 votes136 views1 answer
Input double java
Java
0 vote92 views0 answer
Java
-1 vote153 views1 answer
Manager App
Java