This problem is killing me: My solution is very straight forward and doesnt seem to exceed time limit: it simply goes through every number bigger than K and checks if its a palindrome, but I keep on getting wrong answers. Every test case ive thrown at it has worked. Please help.
asked 28 Jul '17, 04:02

So the problem is asking for the first number bigger than $K$ that is a palindrome. What is the constraint on $K$? For me, your code TLE on where $K \geq 10^{13}$. You can use your brute force and come up with a greedy solution :) answered 28 Jul '17, 04:47
