Skip to main content

Questions tagged [regular-expression]

Code challenges that involve the use of regular expressions.

Filter by
Sorted by
Tagged with
11 votes
17 answers
916 views

A redundant regular expression (regex) is defined here as a regex which has some amount of characters which can be removed while not affecting its functionality -- i.e. it matches the exact same set ...
97.100.97.109's user avatar
14 votes
10 answers
1k views

related For this challenge, we'll be using a simplified dialect of regular expressions, where: A lowercase letter from a to z ...
emanresu A's user avatar
  • 46.2k
8 votes
5 answers
2k views

What is the shortest regular expression equivilant to the following? ...
Samuel Muldoon's user avatar
15 votes
3 answers
439 views

You are given two regexes and your task is to determine if the strings matched by the first regex are a subset of the strings matched by the second regex. For this we are going to use a limited ...
AnttiP's user avatar
  • 8,048
14 votes
9 answers
2k views

From my CMC. Given a regex and a non-empty printable ASCII text, return one bit per character in the text, indicating the positions of beginnings of non-overlapping matches, and also the positions of ...
Adám's user avatar
  • 31.8k
5 votes
2 answers
1k views

Challenge Given two lists of strings where each string is of length 50 and each list is also of length 50 generate the shortest regex you can that fully matches all the strings in the first list and ...
user197974's user avatar
  • 1,161
9 votes
1 answer
241 views

There are currently nine feature length films in the core Fast & Furious/The Fast and the Furious media franchise, a series of films about bald men scowling and driving cars very fast. The names ...
lowercasename's user avatar
11 votes
2 answers
2k views

The task is to to compete for the shortest regex (in bytes) in your preferred programming language which can distinguish between English and Spanish with minimum 60%...
GirkovArpa's user avatar
7 votes
4 answers
3k views

Your task Given a simple regular expression, you have to count how many strings of length n have a match of length n with the ...
RGS's user avatar
  • 14.2k
13 votes
1 answer
479 views

Your task is to create a program that determines whether a given string is a valid regular expression or not using code snippets sourced from sites on the StackExchange network. For the purposes of ...
Beefster's user avatar
  • 10k
1 vote
0 answers
80 views

Modern regular expressions (regexes) have many features (\d, {n,m}, \1, etc.), but to define ...
pommicket's user avatar
  • 3,187
-4 votes
1 answer
885 views

Write a regular expression substitution string which can base64 decode a string using only a regular expression engine built into the language. Eg: ...
Paradoxis's user avatar
17 votes
6 answers
1k views

Input: An integer n in the range 2 <= n <= 10 A list of positive integers Output: Convert the integers to their binary ...
Kevin Cruijssen's user avatar
20 votes
2 answers
2k views

For the purposes of this challenge, we define a postfix regex dialect with alphabet {1, 0} and the following operations: 1 and <...
Esolanging Fruit's user avatar
6 votes
3 answers
382 views

Task Write a program/function that, given three integers n,a,b prints a regular expression which matches all of the base-n integers from ...
Josh Withee's user avatar
19 votes
2 answers
742 views

Introduction I don't see many regex challenges on here, so I would like to offer up this deceptively simple one which can be done in a number of ways using a number of regex flavours. I hope it ...
jaytea's user avatar
  • 507
6 votes
4 answers
589 views

This is the robbers' post. The cops' is here. Your challenge is to take a cop's post and find an input that the regex matches but the program returns a falsey value. Once you have cracked a cop's ...
user avatar
7 votes
1 answer
2k views

This task is a classic programming task: Implement a regular expression parser. That is, write a program or function which takes a string describing a regular expression and a candidate string, and ...
celtschk's user avatar
  • 4,716
22 votes
41 answers
4k views

This is the robber's thread. The cop's thread is here. A snake matrix is a square matrix that follows this pattern: 3-by-3: 1 2 3 6 5 4 7 8 9 and 4-by-4: ...
Stewie Griffin's user avatar
2 votes
0 answers
156 views

(I am not sure that this is the best place to put this question, but I will give it a shot. Forgive me if it is improper. This is just a fun project with which I am tinkering and I am looking for ...
user173897's user avatar
15 votes
9 answers
2k views

Imagine this, we have an environment with a global scope containing just a single object, called codegolf. This object has a single child called ...
Bassdrop Cumberwubwubwub's user avatar
-4 votes
1 answer
546 views

We've all been burned by the grammar police on the internet. What we need is a regex that can be used in place of "there", "their", and "they're". This would shift burden of grammar parsing from the ...
Michael Whatcott's user avatar
37 votes
3 answers
1k views

Martin Ender recently hit 100K, and has come up with some pretty awesome languages. We're going to have a bit of fun with one of them, Hexagony (and a bit of regex for Retina) As a brief overview, ...
Nathan Merrill's user avatar
2 votes
2 answers
752 views

In a project I am working on, I am checking to see if certain DNA sequences appear in certain genes in E. coli. I have written a program in Java that performs the below features. However, since I ...
Arcturus's user avatar
  • 7,405
10 votes
3 answers
528 views

Your task is to write a RegEx that matches everything inside strings. A string is defined as everything surrounded by (but not including) two unescaped ". A ...
Leaky Nun's user avatar
  • 50.6k