This notebook was prepared by Donne Martin. Source and license info is on GitHub.

# Solution Notebook¶

See the LeetCode problem page.

Now you are given a string S, which represents a software license key which we would like to format. The string S is composed of alphanumerical characters and dashes. The dashes split the alphanumerical characters within the string into groups. (i.e. if there are M dashes, the string is split into M+1 groups). The dashes in the given string are possibly misplaced.

We want each group of characters to be of length K (except for possibly the first group, which could be shorter, but still must contain at least one character). To satisfy this requirement, we will reinsert dashes. Additionally, all the lower case letters in the string must be converted to upper case.

So, you are given a non-empty string S, representing a license key to format, and an integer K. And you need to return the license key formatted according to the description above.

Example 1:
Input: S = "2-4A0r7-4k", K = 4

Output: "24A0-R74K"

Explanation: The string S has been split into two parts, each part has 4 characters.
Example 2:
Input: S = "2-4A0r7-4k", K = 3

Output: "24-A0R-74K"

Explanation: The string S has been split into three parts, each part has 3 characters except the first part as it could be shorter as said above.

Note:
The length of string S will not exceed 12,000, and K is a positive integer.
String S consists only of alphanumerical characters (a-z and/or A-Z and/or 0-9) and dashes(-).
String S is non-empty.


## Constraints¶

• Is the output a string?
• Yes
• Can we change the input string?
• No, you can't modify the input string
• Can we assume the inputs are valid?
• No
• Can we assume this fits memory?
• Yes

## Test Cases¶

• None -> TypeError
• '---', k=3 -> ''
• '2-4A0r7-4k', k=3 -> '24-A0R-74K'
• '2-4A0r7-4k', k=4 -> '24A0-R74K'

## Algorithm¶

• Loop through each character in the license key backwards, keeping a count of the number of chars we've reached so far, while inserting each character into a result list (convert to upper case)
• If we reach a '-', skip it
• Whenever we reach a char count of k, append a '-' character to the result list, reset the char count
• Careful that we don't have a leading '-', which we might hit with test case: '2-4A0r7-4k', k=4 -> '24A0-R74K'
• Reverse the result list and return it

Complexity:

• Time: O(n)
• Space: O(n)

## Code¶

In :
class Solution(object):

raise TypeError('license_key must be a str')
raise ValueError('license_key must not be empty')
num_chars = 0
if char == '-':
continue
num_chars += 1
if num_chars >= k:
num_chars = 0


## Unit Test¶

In :
%%writefile test_format_license_key.py
import unittest

class TestSolution(unittest.TestCase):

solution = Solution()
k = 3
expected = ''
k = 3
expected = '24-A0R-74K'
k = 4
expected = '24A0-R74K'

def main():
test = TestSolution()

Overwriting test_format_license_key.py

%run -i test_format_license_key.py

Success: test_format_license_key