Altered code in findKthPositive function 🙌

ChandrashekharRobbi · ChandrashekharRobbi · commit 9dff58004c0e · 2024-02-06T20:22:01.000+05:30
diff --git a/Most IMP Questions/Practice/Binary Search.ipynb b/Most IMP Questions/Practice/Binary Search.ipynb
@@ -1708,7 +1708,7 @@
   },
   {
    "cell_type": "markdown",
-   "id": "b49942bc",
+   "id": "93c30189",
    "metadata": {},
    "source": [
     "## Kth Missing Positive Number [Link](https://leetcode.com/problems/kth-missing-positive-number/description/)\n",
@@ -1721,7 +1721,7 @@
   },
   {
    "cell_type": "markdown",
-   "id": "59b9bfeb",
+   "id": "07501753",
    "metadata": {},
    "source": [
     "**Naive Approach 1**\n",
@@ -1737,7 +1737,7 @@
   {
    "cell_type": "code",
    "execution_count": 5,
-   "id": "8ea2ec69",
+   "id": "abc649da",
    "metadata": {
     "ExecuteTime": {
      "end_time": "2024-02-06T14:50:52.949619Z",
@@ -1765,7 +1765,7 @@
   },
   {
    "cell_type": "markdown",
-   "id": "2a0f72cf",
+   "id": "c17abbb5",
    "metadata": {},
    "source": [
     "**Naive Approach 2**\n",
@@ -1775,13 +1775,15 @@
     "<img src=\"img/KthPosInt1.png\"/>\n",
     "\n",
     "2. So if we get any number less than the arr[i] increment k until arr[i] > k\n",
-    "3. Return k because that is our answer"
+    "3. Return k because that is our answer\n",
+    "\n",
+    "*"
    ]
   },
   {
    "cell_type": "code",
    "execution_count": 6,
-   "id": "1abf9946",
+   "id": "ef6b4fe3",
    "metadata": {
     "ExecuteTime": {
      "end_time": "2024-02-06T14:51:37.237858Z",
@@ -1807,10 +1809,31 @@
   {
    "cell_type": "code",
    "execution_count": null,
-   "id": "9365306f",
+   "id": "d0cf4542",
    "metadata": {},
    "outputs": [],
    "source": []
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "id": "634a4236",
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "class Solution:\n",
+    "    def findKthPositive(self, arr: List[int], k: int) -> int:\n",
+    "        low = 0\n",
+    "        high = len(arr) - 1\n",
+    "        while low <= high:\n",
+    "            mid = (low + high) // 2\n",
+    "            missing = (arr[mid] - (mid + 1))\n",
+    "            if missing < k:\n",
+    "                low = mid + 1\n",
+    "            else:\n",
+    "                high = mid - 1\n",
+    "        return high + 1 + k"
+   ]
   }
  ],
  "metadata": {
