`Easy`	`Codewriting` 	`300`

Given a string, find out if its characters can be rearranged to form a palindrome.

## Example

- For `inputString = "aabb"`, the output should be
`palindromeRearranging(inputString) = true`.

We can rearrange `"aabb"` to make `"abba"`, which is a palindrome.

## Input/Output

- [execution time limit] 4 seconds (go)

- [input] string inputString

    A string consisting of lowercase English letters.

    Guaranteed constraints:
    `1 ≤ inputString.length ≤ 50`.

- [output] boolean

    `true` if the characters of the `inputString` can be rearranged to form a palindrome, `false` otherwise.

## [Go] Syntax Tips

``` go
// Prints help message to the console
// Returns a string
func helloWorld(name string) string {
    fmt.Printf("This prints to the console when you Run Tests");
    return "Hello, " + name;
}
```
