stuck at 477 / 987 test cases passed

SouvikDcoder · SouvikDcoder · commit d6c3f1d832a2 · 2022-10-10T18:50:20.000+05:30
diff --git a/leetcode_kuro_RnD.ipynb b/leetcode_kuro_RnD.ipynb
@@ -8191,9 +8191,24 @@
     },
     {
       "cell_type": "code",
-      "execution_count": null,
+      "execution_count": 45,
       "metadata": {},
-      "outputs": [],
+      "outputs": [
+        {
+          "name": "stdout",
+          "output_type": "stream",
+          "text": [
+            "anviaj\n",
+            "an\n",
+            "anv\n",
+            "anvi\n",
+            "iaj\n",
+            "iaj\n",
+            "['anvi', 'iaj']\n",
+            "4\n"
+          ]
+        }
+      ],
       "source": [
         "# https://leetcode.com/problems/longest-substring-without-repeating-characters/\n",
         "\n",
@@ -8204,10 +8219,34 @@
         "# s = \"\"\n",
         "# s = ' '\n",
         "# s = 'aab'\n",
-        "s = 'dvdf'\n",
+        "# s = 'dvdf'\n",
+        "s = 'anviaj'\n",
+        "\n",
+        "print(s)\n",
         "\n",
         "\n",
-        "\n"
+        "max_sub_str = s[0]\n",
+        "max_arr = []\n",
+        "\n",
+        "for i in range(1,len(s)):\n",
+        "    if max_sub_str[-1] != s[i] and s[i] not in max_sub_str:\n",
+        "        max_sub_str+=s[i]\n",
+        "        print(max_sub_str)\n",
+        "    else: \n",
+        "        max_arr.append(max_sub_str)\n",
+        "        if max_sub_str[-1]!=s[i] : \n",
+        "            max_sub_str = max_sub_str[-1]+s[i]\n",
+        "        else:\n",
+        "            max_sub_str = s[i]\n",
+        "if max_arr == [] or max_sub_str not in max_arr:\n",
+        "    max_arr.append(max_sub_str)\n",
+        "\n",
+        "print(max_sub_str)\n",
+        "print(max_arr)\n",
+        "print(len(max(max_arr, key=len)))\n",
+        "\n",
+        "\n",
+        "# current condition : not working \n"
       ]
     }
   ],
