normalized[i] = parts[i].replaceFirst("^0+(?!$)", "");
            if (normalized[i].isEmpty()) {
                normalized[i] = "0";
            }
        }

        // Find longest sequence of consecutive zeros
        int longestStart = -1;
        int longestLength = 0;
        int currentStart = -1;
        int currentLength = 0;

        for (int i = 0; i < 8; i++) {

            // Leading zeros removed and consecutive zeros compressed
            assertEquals("2001:db8::1", method.invoke(null, "2001:0db8:0:0:0:0:0:1"));

            // Longest sequence of zeros compressed (3 zeros at end vs 1 zero at start)
            assertEquals("2001:db8:0:1::1", method.invoke(null, "2001:0db8:0:1:0:0:0:1"));