Regular Expressions Made Easy with Java - 2019 Tutorials

This is one of the Beginner to Expert series of Tutorials in 2019. It covers regular expressions in Java.

This tutorial covers the Pattern class and the Matcher class .

[pradyumn]

You are doing a service to humanity sir. Love from India.

[jeevansaimanikanta]

Thank you so much Sir. The tutorial is very informative and easy to understand. Your explanation is very good.

[kfcronin]

This tutorial was so helpful to me. Thank you so much!

[zechariahhounwanou]

This was insightful, came all the way from your Fleetms v2 just to get your thoughts on Regular Expression.

[expansivegymnast]

This is what a real pro looks like. Thanks so much!

[pythonsalone]

It's really an amazing tutorial. I have problem with string Builder as well.

[DurgaShiva]

hi this was an awesome and amazing video...want to learn more from you..can you please give me the NEXT video link of THIS SERIES, where you have taught REGEX in JAVA...hoping to hear from you soon

[biswajitsahoo]

this man literally got confused for half a min straight 3.35 to 4.10 :)) btw nice teaching there :) love it

[monishhs]

Thank you so much for explaining this in a simple manner

[bereketyisehak]

Thank you. Needed quick regex intro for my homework.

[javlontursunov]

Bro thank you so much for the turorial. Please make other videos related to other clasess of the Java Regex

[Juan-Hdez]

Could you please share the link to the follow-up video?

[zumujec]

Thanks a lot for the video! It was super helpful

[mohamedmohidiin]

this vedio is very helped me for your claer explannation, due to i have presentation, thanks sir

[jeppygurubat]

Hi Can you Help me with this one.
Thank you!
Create a Java program that determines if two (2) words rhyme.

1. Write the import statements to be able to use Scanner, Pattern, and Matcher.

2. Enable user input.

3. Create three (3) String variables.

• word1 shall store the first word.

• word2 shall store the second word.

• sub shall store the last two (2) letters of word1.

4. Initialize a Pattern as defined by the regular expression "L {}"+ sub+"" For the first blank, allow uppercase and lowercase letters. For the second blank, allow either 1 or 2 letters before sub (contains the last two (2) letters of word1).

5. Initialize a Matcher to store a possible match between your pattern and word2.

6. Use the matches() method to check if the two (2) words rhyme.

[Lyosha.]

This is awesome but I don't see the continuation of this lesson anywhere on your videos. How can I find it ?

[cosmnick]

easy to understand explanation, very usefull

[anilsuyal]

Really Easy Explanation, thanks a lot for this😙

[rahulmaan]

Good explanation and very informative document attached to the description. Thanks!!!

[mohindrasingh]

Thanks Sir, You teach me regex easily