Find the Closest Palindrome, is a LeetCode problem from String subdomain. In this post we will see how we can solve this challenge in Swift

Problem Description

You can find the full details of the problem Find the Closest Palindrome at LeetCode


the numbers with same digits' number but replication of the mutation

             (+1 or -1 if the original number itself is palindrome) of the first half.

Time Complexity: O(n), Space Complexity: O(1)

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu