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 vote150 views2 answers
Find First and Last Position of Element in Sorted Array
Java
10 votes151 views3 answers
Android studio start activity
Java
1 vote220 views1 answer
Java product 1 to n
Java
1 vote164 views3 answers
How to sort array java
Java
0 vote165 views3 answers
Resttemplate get rest api call in java
Java
8 votes145 views4 answers
What is method in java
Java
22 votes193 views2 answers
Java quit application
Java
0 vote145 views1 answer
Qr code generator in java
Java
0 vote157 views1 answer
How to check if a string is in alphabetical order in java
Java
1 vote174 views1 answer
How do i print text in java
Java