Each test was on 100k strings of length [30..39] composed of random lowercase letters. The patterns were slices of increasing length from the beginning of the alphabet ('a', 'ab', 'abc', etc.). The same test cases were used for all data points.
If I have some time tomorrow, I may do some more tests with longer strings/placement of the required letters. I'll update you!
Maybe I'll add in a regex-less implementation for comparison too.
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Each test was on 100k strings of length [30..39] composed of random lowercase letters. The patterns were slices of increasing length from the beginning of the alphabet ('a', 'ab', 'abc', etc.). The same test cases were used for all data points.
If I have some time tomorrow, I may do some more tests with longer strings/placement of the required letters. I'll update you!
Maybe I'll add in a regex-less implementation for comparison too.