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

20 votes117 views4 answers
Java get current directory
Java
0 vote139 views1 answer
Fibonacci in java
Java
0 vote117 views1 answer
Get top 3 entries based on values map java
Java
2 votes123 views10 answers
Javascript
Java
0 vote119 views1 answer
Android java how to stop activity from opening twice programatically
Java
1 vote130 views2 answers
How to convert epoch time to date in java
Java
14 votes130 views2 answers
What method is use for getting the index position of a character of a string in java
Java
4 votes166 views2 answers
Java how to find the largest number in an arraylist
Java
0 vote121 views1 answer
How to set up basic java workspace
Java
3 votes129 views1 answer
Writing to a text file java
Java