The following regex validates international mobile numbers

This regex will help you to parse html tag. Example Title ...

Other patterns

Match any syllable based on javanese script unicode

Validate a given IP v4 address against all three defined Private IPv4 Subnets as statet in RFC1918 10.0.0.0/8 172.16.0.0/20 192.168.0.0/16 ...

Detects any Grabify IP tracker links

Detects any UUID 4 strings

Extract URL parts only named capturing groups

Select duplicate a.m. - p.m range

This is a simple regex for 30 characters limit excluding brackets

Click "open regex in editor" to open regex. Open a webpage containing Rapidgator Links - Either rg.to or rapidgator.net Right-click anywhere on the page and select "view page source" Copy the HTML markup containing the Rapidgator links to regex101.com Paste the HTML markup and set mode to match Loca...

JS function to convert RGB(A) to HEX color for single values: /** @param {string} color the RGB(A) color @return {string} the HEX color */ function rgba2hex(color)...

Finds a number that is 9 digits long. Can have spaces or hyphens in between the numbers and will still be found

You can express the required dice-throwing as usual: 1d10, 2d6, 3d8... The first part (dice number) is mandatory. So, notations like "D10" are not computed, and they must be written as 1d10 The dice number may be expressed as [number]o[number]. For example: 1o3d10. That will mark to implement a Gaus...

https://stackoverflow.com/questions/5312349/minifying-final-html-output-using-regular-expressions-with-codeigniter Thanks to @Alan Moore

https://conventionalcommits.org Parses commits like type(scope)!: subject

Regex of email with ability to add gmail's +example system example: root email = user@gmail.com gmail+ = user+extra@gmail.com

Matches subdomain, domain and top level in a field that contains a urls. https://www.whatever.you.want ---> whatever.you.want

Replace sub-strings in string

Matches palindromes: arbitrary length ignores non-significant characters (spaces, ponctuation) ignores accents, provided the text is NFD-normalized recursive palindromes (e.g. "a été à"): either match the longest one ("a été à") or the nested ones individually ("a", "été", "à") (see comment)