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 vote310 views1 answer
Java notnull returns null
Java
0 vote333 views1 answer
Spigot wolf death message
Java
0 vote328 views1 answer
Caused by: java.sql.sqlexception: no database selected
Java
0 vote332 views1 answer
Put arraylist in hashtable java
Java
2 votes312 views2 answers
Even Digits Leetcode
Java
0 vote306 views1 answer
File with line numbers inserted java
Java
0 vote330 views1 answer
Convert boolean list to primitive java
Java
0 vote320 views1 answer
Java running sum
Java
2 votes316 views2 answers
Java get enum by ordinal
Java
21 votes276 views6 answers
Convert char to string in java
Java