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 vote228 views1 answer
Spring commandlinerunner example
Java Spring
1 vote183 views1 answer
No lwjgl in java.library.path
Java
3 votes236 views4 answers
String to int array
Java
1 vote198 views1 answer
Java lombok constructor inject guice
Java
0 vote232 views1 answer
Java run code at interval
Java
0 vote186 views1 answer
Get random word from xz file
Java
0 vote235 views1 answer
Open google maps cycling navigation
Java
0 vote260 views1 answer
Itext new page
Java
0 vote210 views1 answer
Predict the output of the given code: void method2(char c) { System.out.println( (int) c); } What will be the output of the given code snippet if i) if 'x' is passed to c i) if ‘0’ is passed to c
Java
-1 vote147 views1 answer
Biginteger modulo java
Java