Skip to content

Latest commit

 

History

History
24 lines (15 loc) · 1.48 KB

README.md

File metadata and controls

24 lines (15 loc) · 1.48 KB

Google’s longest running global coding competition, Code Jam, calls on programmers around the world to solve challenging, algorithmic puzzles against the clock. Contestants advance through four online-hosted rounds to compete at the annual Code Jam World Finals that is held at a different international Google office each year. Each round brings new challenges and in the end 25 contestants will have the ultimate chance to put their skills to the test, vying for cash prizes and the coveted championship title at the World Finals.

Qualified with 41pts. I had work so I only had time to do these 2.

My solution: Treat it as a string and replace all 4 with 3 to get first number. Then subtract num - first to get the second number.

Test Set 1 6pts/6pts
Test Set 2 10pts/10pts
Hidden Set 1pts/1pts

I used a swap function, you change all the S to 1, then all the E to S, sthen all the 1 to S. You basically get a mirror of the first string.

SESESE would become

ESESES

Test Set 1 5pts/5pts
Test Set 2 9pts/9pts
Hidden Set 10pts/10pts