https://dmytros.blog/tags/find-k-closest-elements/ Recent content in Find K Closest Elements on Dmytro's Blog https://dmytros.blog/images/papermod-cover.png https://dmytros.blog/images/papermod-cover.png Hugo en Mon, 07 Sep 2026 16:04:28 +0300 https://dmytros.blog/posts/leetcode-find-k-closest-elements/ Mon, 07 Sep 2026 16:04:28 +0300 https://dmytros.blog/posts/leetcode-find-k-closest-elements/ <h3 id="the-problem">The problem</h3> <p>Given a <strong>sorted</strong> integer array <code>arr</code>, two integers <code>k</code> and <code>x</code>, return the <code>k</code> closest integers to <code>x</code> in the array. The result should also be sorted in ascending order.</p> <p>An integer <code>a</code> is closer to <code>x</code> than an integer <code>b</code> if:</p> <ul> <li><code>|a - x| &lt; |b - x|</code>, or</li> <li><code>|a - x| == |b - x|</code> and <code>a &lt; b</code></li> </ul> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> arr = (1,2,3,4,5), k = 4, x = 3</p>