# [🐉 Challenge ] The Code Festival Combinations

Teams of coders are coming to a CODE FESTIVAL: Each team stays united, of course (unless in some of BONUS 1 solutions) A big final event is organised : a code battle between 2 guilds. You have been assigned to build those guilds. Each team is given a letter, according to the number of coders in it: "a" is a coder who came alone. "b" is a team of two ... "z" is a big team of 26 coders. "z" will be the max team size allowed. When the registrations are closed, you receive the list of teams : a string of letters. Like "adlskeajb" this one would be representing 8 teams, with respectively: 1, 4, 12, 19, 11, 5, 1, 10, 2 coders in each team. You guessed it, the letter position in alphabet gives the number of coders in the team. And your TASK is: To organise the 2 guilds. The conditions : to get the smaller possible difference of size between the 2 guilds. Equal sizes is optimal. If you get two or more solutions, you'll prefer the one with the smallest difference of number of teams for each side. If there still are more than one respecting this condition, they are equivalent. Nothing is organised if only one team. The code has to work for a string of two letters and more. -- read next Instructions in comments --