Given a non-negative integer n, return whether it reads the same forwards and backwards. The full-reversalFull ReversalBuilding the completely reversed number (same technique as the Reverse a Number problem) and comparing it to the original. approach is the most direct way to think about it: reverse everything, then compare. The half-reversalHalf ReversalStopping the reversal loop halfway through, once n is no longer bigger than the reversed-so-far half, then comparing the two halves directly. approach does only as much work as is actually needed to answer the question — there's no point reversing the second half of the digits when they can just be compared against the first half directly as the loop goes.