Regular Expressions a(?=[^a-z]) episode artwork

EPISODE · Feb 2, 2020 · 22 MIN

Regular Expressions a(?=[^a-z])

from Programmers · host Software Engineering

A regular expression, regex or regexp is a sequence of characters that define a search pattern. Usually such patterns are used by string searching algorithms for "find" or "find and replace" operations on strings, or for input validation. It is a technique developed in theoretical computer science and formal language theory

Episode metadata supplied by the publisher feed · Published Feb 2, 2020

Embed this episode

Ready to play

Regular Expressions a(?=[^a-z])

0:00 22:46

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

Frequently Asked Questions

How long is this episode of Programmers?

This episode is 22 minutes long.

When was this Programmers episode published?

This episode was published on February 2, 2020.

Can I download this Programmers episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!