Modified findVal function 🔥

ChandrashekharRobbi · ChandrashekharRobbi · commit 39ac8e01a76c · 2024-02-19T19:13:23.000+05:30
diff --git a/Most IMP Questions/Practice/Binary Search.ipynb b/Most IMP Questions/Practice/Binary Search.ipynb
@@ -1994,15 +1994,15 @@
   },
   {
    "cell_type": "markdown",
-   "id": "4b7e6c31",
+   "id": "06cc7eaa",
    "metadata": {},
    "source": [
     "## Allocate Books 📚"
    ]
   },
   {
    "cell_type": "markdown",
-   "id": "b0c0c709",
+   "id": "26a16ca7",
    "metadata": {},
    "source": [
     "**LInear Search**"
@@ -2011,7 +2011,7 @@
   {
    "cell_type": "code",
    "execution_count": 3,
-   "id": "573fc9c4",
+   "id": "d73cbbfe",
    "metadata": {
     "ExecuteTime": {
      "end_time": "2024-02-19T13:08:43.002323Z",
@@ -2056,7 +2056,7 @@
   },
   {
    "cell_type": "markdown",
-   "id": "a642c5d5",
+   "id": "9a8de498",
    "metadata": {},
    "source": [
     "**BInary Search**"
@@ -2065,7 +2065,7 @@
   {
    "cell_type": "code",
    "execution_count": 4,
-   "id": "d4a91a06",
+   "id": "b2041a1b",
    "metadata": {
     "ExecuteTime": {
      "end_time": "2024-02-19T13:08:59.215131Z",
@@ -2104,7 +2104,7 @@
   },
   {
    "cell_type": "markdown",
-   "id": "1424d0a1",
+   "id": "43ce8fa5",
    "metadata": {},
    "source": [
     "## Split Array Largest Sum\n",
@@ -2120,7 +2120,7 @@
   {
    "cell_type": "code",
    "execution_count": 12,
-   "id": "c1474b07",
+   "id": "798e0253",
    "metadata": {
     "ExecuteTime": {
      "end_time": "2024-02-19T13:33:56.817172Z",
@@ -2162,7 +2162,7 @@
   },
   {
    "cell_type": "markdown",
-   "id": "85f5b7b8",
+   "id": "a6a87fc7",
    "metadata": {},
    "source": [
     "**BInary Search**"
@@ -2171,7 +2171,7 @@
   {
    "cell_type": "code",
    "execution_count": 13,
-   "id": "1592309f",
+   "id": "84c1ec5a",
    "metadata": {
     "ExecuteTime": {
      "end_time": "2024-02-19T13:34:28.934121Z",
@@ -2207,23 +2207,26 @@
   },
   {
    "cell_type": "markdown",
-   "id": "02853b8b",
+   "id": "526797a7",
    "metadata": {},
    "source": [
-    "## Printers Partition 🎨"
+    "## Printers Partition 🎨\n",
+    "\n",
+    "> Same code as above  [Split Largest Sum](#Split-Array-Largest-Sum)"
    ]
   },
   {
    "cell_type": "code",
    "execution_count": null,
-   "id": "663cdea8",
+   "id": "80bb16c2",
    "metadata": {},
    "outputs": [],
    "source": [
     "def findLargestMinDistance(boards:list, k:int):\n",
     "    # Write your code here\n",
     "    # Return an integer\n",
     "    # Write Your Code Here\n",
+    "    \n",
     "    def findVal(arr, maxSum):\n",
     "        k = 1\n",
     "        val = 0\n",
