HackerRank Negative Lookbehind Solution

Hello Programmers, In this post, you will know how to solve the HackerRank Negative Lookbehind Solution. This problem is a part of the Regex HackerRank Series.

One more thing to add, don’t directly look for the solutions, first try to solve the problems of Hackerrank by yourself. If you find any difficulty after trying several times, then you can look for solutions.

HackerRank Negative Lookbehind Solution

(?<!regex_2)regex_1
The negative lookbehind (?<!) asserts regex_1 not to be immediately preceded by regex_2. Lookbehind is excluded from the match (do not consume matches of regex_2), but only assert whether a match is possible or not.

Task

You have a test String S.
Write a regex which can match all the occurences of characters which are not immediately preceded by vowels (a, e, i, u, o, A, E, I, O, U).

Note

This is a regex only challenge. You are not required to write a code.
You have to fill the regex pattern in the blank (_________).

_{JavaScript do not support lookbehind.}

report this adHackerRank Negative Lookbehind Solutions in Cpp

HackerRank Negative Lookbehind Solutions in Java

public class Solution {    
    public static void main(String[] args) {
        
        Regex_Test tester = new Regex_Test();
        tester.checker("(?<![aeiouAEIOU])."); //Use '\\' instead of '\'.
    
    }
}

HackerRank Negative Lookbehind Solutions in Python

Regex_Pattern = r"(?<!(a|e|i|u|o|A|E|I|O|U))."	# Do not delete 'r'.

report this ad

HackerRank Negative Lookbehind Solutions in JavaScript

HackerRank Negative Lookbehind Solutions in PHP

$Regex_Pattern = '/(?<![aeiuoAEIUO])./'; //Do not delete '/'. Replace __________ with your regex. 

Disclaimer: This problem (Negative Lookbehind) is generated by HackerRank but the Solution is Provided by BrokenProgrammers. This tutorial is only for Educational and Learning purposes.

Next: HackerRank Excluding Specific Characters Solution