Regular expression for an alphanumeric word

Question

I have a requirement to find and return the first occurrence of a pattern from a string.

Example: hello my SNO is 05FK3NEK900058V please add it

expected output: 05FK3NEK900058V

Condition for the pattern to match

Combination of digits and alphabets
Character length between 12 to 16

Can I do it using regular expression or do I need to loop thought the words?

What I tried but it didn't work

const regex = /\b^(?!\d*$|[a-zA-Z]*$)[a-zA-Z\d]{12,16}$\b/gm; const str = `hello my SNO is 05FK3NEK900058V please add it `; let m; while ((m = regex.exec(str)) !== null) { // This is necessary to avoid infinite loops with zero-width matches if (m.index === regex.lastIndex) { regex.lastIndex++; } // The result can be accessed through the `m`-variable. m.forEach((match, groupIndex) => { console.log(`Found match, group ${groupIndex}: ${match}`); }); }

Pablo · Accepted Answer · 2019-06-17 17:37:02Z

After @bobble buble comment

I think this will works:

\w{12,16}

Demo

Also you can use words boundaries if you match required to be a word.

\b\w{12,16}\b

Demo:

Updated after @PeterM Comment:

The last version more verbose but more accurate:

string=`Johannsonoff 111111111111111 05FK3NEK900058Vf 05FK3NEK900058Vfaf48 hello my SNO is fFK3NEK9000515 05FK3NEK9000515 please add it 05FK3NEK900058Vfaf48 faf fasf1654 EK90058Vs11 EK9005f8Vs12 05FK3NE90058Vs16 05FK3NEK90058Vs17`; // Returns an Array in which elements are strings between 12 and 16 characters. const groupMathed = string.match(/\b\w{12,16}\b/g) // Returns the first element that have a digit [0-9] follow by a alphabetic character or a alphabetic character followed by a digit. const alphanumericWord = groupMathed.find(e => /[0-9]+[a-zA-z]+|[a-zA-z]+[0-9]+/.test(e)) console.log(alphanumericWord)

Another approach can be use this regex which is more verbose but reduce the code:

(?=(\b\d+[a-zA-Z]|\b[a-zA-Z]\d+))[a-zA-Z0-9]{12,16}\b

Demo: https://regex101.com/r/0lMyoV/11/

string=`asdfghjlqerut hello my SNO is 1234567891234 05FK3NEK900058V 0FK3NEK900058V asdfasfd25fasfaa please add it 05FK3NEK900058Vfaf48 faf fasf1654 F0K3NEK900058V Johannsonoff 111111111111111 05FK3NEK900058Vf 05FK3NEK900058Vfaf48 hello my SNO is fFK3NEK9000515 05FK3NEK9000515 please add it 05FK3NEK900058Vfaf48 faf fasf1654 EK90058Vs11 EK9005f8Vs12 05FK3NE90058Vs16 05FK3NEK90058Vs17 05FK3NEK900058Vfaf48`; const regex = /(?=(\b\d+[a-zA-Z]|\b[a-zA-Z]\d+))[a-zA-Z0-9]{12,16}\b/g const groupMathed = string.match(regex) console.log(groupMathed)

It is fine, but will also match long names, eg: hello my name is Johannsonoff, my SNO is 05FK3NEK900058V please add it
You were right @PeterM. I updated my answer. Thanks for detect the issue.
@Pablo Thanks for your answer, a small issue its matching numbers only string ie string='111111111111111' instead of alphanumeric
@Dibish I updated the code in "The last version more verbose but more accurate: " to fix that problem. Thanks for detect and report the issue.

Wiktor Stribiżew · Accepted Answer · 2019-05-30 11:28:10Z

You may use a single regex like

/\b(?=[a-zA-Z\d]{12,16}\b)(?:[a-zA-Z]*\d|\d*[a-zA-Z])[a-zA-Z\d]*\b/

See the regex demo.

Details

\b - word boundary
(?=[a-zA-Z\d]{12,16}\b) - up to the next word boundary, there must be 12 through 16 alphanumeric chars
(?:[a-zA-Z]*\d|\d*[a-zA-Z]) - either 0+ letters and a digit or 0+ digits and then a letter
[a-zA-Z\d]* - 0+ alphanumeric chars
\b - word boundary.

See a JS demo below:

var str = "hello my SNO is 05FK3NEK900058V please add it "; var reg = /\b(?=[a-zA-Z\d]{12,16}\b)(?:[a-zA-Z]*\d|\d*[a-zA-Z])[a-zA-Z\d]*\b/; var m = str.match(reg) || [""]; console.log(m[0]);

A. Denis · Accepted Answer · 2019-05-30 11:54:52Z

let str = "hello (plus SomeLongWord) my SNO is 05FK3NEK900058V please add it "; const reg = /\b[\w\d]{12,16}\b/g; let m = str.match(reg); if (typeof m === "object" && m.length) { for (var indexM = 0; indexM < m.length; indexM++) { // You can add more checks to filter long words console.log(m[indexM]); } } else { console.log("Not found any SNO here"); } // results: // SomeLongWord // 05FK3NEK900058V

That will help you to handle long words but probably more check will be needed.

Collectives™ on Stack Overflow

Regular expression for an alphanumeric word

3 Answers 3

5 Comments

Comments

Comments

Linked

Hot Network Questions

Collectives™ on Stack Overflow

3 Answers 3

5 Comments

Comments

Comments

Linked

Related