Swedish Postnummer Regex for Java

What this pattern does

This page provides a well-structured, multi-part regular expression for matching swedish postnummer, ported and verified for Java. A rigorously tested regex reduces debugging time and protects your application from edge-case failures. The snippet below is ready to drop into your Java project — whether you're validating in a Spring Boot controller, a Jakarta EE service, or a standalone utility class.

Java Implementation

// Swedish Postnummer
// ReDoS-safe | RegexVault — Localization > Postal Codes

import java.util.regex.Pattern;

public class SwedishPostnummerValidator {
    private static final Pattern PATTERN =
        Pattern.compile("^(1[0-9]|[2-9][0-9])[0-9]\\s?[0-9]{2}$");

    public static boolean validate(String input) {
        return PATTERN.matcher(input).matches();
    }

    // Example
    public static void main(String[] args) {
        System.out.println(validate("11122")); // true
    }
}

Test Cases

When to use this pattern

This pattern is drawn from the Localization > Postal Codes category and carries a ReDoS-safe certification. That matters for Java developers because critical in Java applications since the JVM regex engine uses backtracking and is susceptible to ReDoS without careful pattern design. RegexVault audits patterns against known backtracking attack vectors, ensuring you have the necessary context before using this regex in a high-stakes production environment.

Common Pitfalls

Technical Notes

Swedish postcodes run from 10005 (Stockholm) to 98499 (Kiruna). The first digit ranges 1-9. The space after position 3 is conventional in display but not used in machine-readable contexts.