Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 4038384
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 20, 20262026-05-20T12:27:58+00:00 2026-05-20T12:27:58+00:00

I need a regex to match this pattern: A string 13 characters long The

  • 0

I need a regex to match this pattern:

  • A string 13 characters long
  • The first letter must be a L, H, or B (not case sensitive)
  • The next 12 characters must be in the range 0-9

e.g. L109878762013 will match while L10/987876/2013 won’t

If the pattern doesn’t match any of the above criteria, and isn’t 13 characters long then it shouldn’t be picked up.

What do I need to modify in the regex [LHB][0-9]{12} to make it work?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-20T12:27:59+00:00Added an answer on May 20, 2026 at 12:27 pm

    Should work if you expand the {12}, which SQL server does not support:

    LIKE '[LHB][0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9]'
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I need to build a regex. the string i want to match always starts
I need a regex pattern which will accommodate for the following. I get a
I need to find, process and remove (one by one) any substrings that match
I've been at this for hours -- I think I need sleep... but no
This is my second attempt to get this answer since I messed it up
i want to to validate a string if contains only a-z, 0-9, and the
I got a contact form, I need to filter some words. I'm doing it
I've seen two approaches to building parsers in Scala. The first is to extends
I have a text file patterned like this : 1 textA == this is
I have the following sample template code. {# @T('core.layout:Logged in as {0} {1}', @user('firstname'),

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.