Can Kelly solve enough code challenges to catch up with Sam?
Sam and Kelly are programming buddies. Kelly resolves to practice more as Sam is ahead initially. They each solve a number of problems daily. Find the minimum number of days for Kelly to have solved more problems than Sam. If Kelly cannot surpass return -1.
samDaily = 3
kellyDaily = 5
difference = 5
Initially, Sam has solved difference problems more than Kelly. Each day, they solve samDaily and kellyDaily problems each.
Sam is 1 problem ahead of Kelly to begin. After 1 day passes, Kelly will have solved 5 problems while Sam will have also solved 1 + 4 = 5 problems. On the second day, Kelly will surpass Sam, 5 + 5 > 1 + 4 + 4.