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 vote165 views1 answer
Map - counting with map
Java
5 votes159 views2 answers
Why main method is public static void in java
Java
2 votes177 views1 answer
Java betrag
Java
0 vote172 views1 answer
Deserialize date java
Java
0 vote165 views1 answer
Mobile number validation to edittext in android
Java
0 vote183 views1 answer
Random numeros negativos java
Java
5 votes173 views1 answer
Declare function in java
Java
1 vote166 views1 answer
Java reverse a word
Java
0 vote159 views1 answer
Plot vector field in java
Java
0 vote173 views1 answer
Convert two bytes to int java
Java