# Leaderboard climbers
In this kata you will be given a leaderboard of unique names for example:
```python
['John',
 'Brian',
 'Jim',
 'Dave',
 'Fred']
```
Then you will be given a list of strings for example:
```python
['Dave +1', 'Fred +4', 'Brian -1']
```
Then you sort the leaderboard.
The steps for our example would be:
```python
# Dave up 1
['John',
 'Brian',
 'Dave',
 'Jim',
 'Fred']
```
```python
# Fred up 4
['Fred',
 'John',
 'Brian',
 'Dave',
 'Jim']
```
```python
# Brian down 1
['Fred',
 'John',
 'Dave',
 'Brian',
 'Jim']
```
Then once you have done this you need to return the leaderboard.
All inputs will be valid. All strings in the second list will never ask to move a name up higher or lower than possible eg. `"John +3"` could not be added to the end of the second input list in the example above.
The strings in the second list will always be something in the leaderboard followed by a space and a `+` or `-` sign followed by a number.
def leaderboard_sort(leaderboard, changes):
    for change in changes:
        name, offset = change.split(' ')
        pos = leaderboard.index(name)
        del leaderboard[pos]
        leaderboard.insert(pos - int(offset), name)
    return leaderboard

def leaderboard_sort(leaderboard, changes):
    for change in changes:
        name, offset = change.split(' ')
        pos = leaderboard.index(name)
        del leaderboard[pos]
        leaderboard.insert(pos - int(offset), name)
    return leaderboard
