Create README - LeetHub

Author: Deepak5113

0564-find-the-closest-palindrome/README.md

@@ -0,0 +1,29 @@
+<h2><a href="https://leetcode.com/problems/find-the-closest-palindrome">564. Find the Closest Palindrome</a></h2><h3>Hard</h3><hr><p>Given a string <code>n</code> representing an integer, return <em>the closest integer (not including itself), which is a palindrome</em>. If there is a tie, return <em><strong>the smaller one</strong></em>.</p>
+
+<p>The closest is defined as the absolute difference minimized between two integers.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> n = &quot;123&quot;
+<strong>Output:</strong> &quot;121&quot;
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> n = &quot;1&quot;
+<strong>Output:</strong> &quot;0&quot;
+<strong>Explanation:</strong> 0 and 2 are the closest palindromes but we return the smallest which is 0.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= n.length &lt;= 18</code></li>
+	<li><code>n</code> consists of only digits.</li>
+	<li><code>n</code> does not have leading zeros.</li>
+	<li><code>n</code> is representing an integer in the range <code>[1, 10<sup>18</sup> - 1]</code>.</li>
+</ul>