SUDO PLACEMENT 2019

Author: keshavsingh4522

GeeksForGeeks/sudo placement 2019.ipynb

@@ -2927,12 +2927,84 @@
     "    print(r)"
    ]
   },
+  {
+   "cell_type": "code",
+   "execution_count": 1,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "a=[1,2,3,4,5,6,7,8,9]"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 2,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "b=[1,2,3,4,5,7,8,9]"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 11,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "6\n"
+     ]
+    }
+   ],
+   "source": [
+    "print(list(set(a)^set(b))[0])"
+   ]
+  },
   {
    "cell_type": "code",
    "execution_count": null,
    "metadata": {},
    "outputs": [],
-   "source": []
+   "source": [
+    "# Shortest path from 1 to n ---> Accolite, Cisco, Morgan Stanley, Samsung, Synopsys\n",
+    "# Difficulty: Basic   Marks: 1\n",
+    "'''\n",
+    "Consider a directed graph whose vertices are numbered from 1 to n. There is an edge from a vertex i to a vertex j iff either j = i + 1 or j = 3i. The task is to find the minimum number of edges in a path in G from vertex 1 to vertex n.\n",
+    "\n",
+    "Input: \n",
+    "The first line of input contains an integer T denoting the number of test cases. The description of T test cases follows.\n",
+    "\n",
+    "Each test case contains a value of n. \n",
+    "\n",
+    "Output: \n",
+    "Print the number of edges in the shortest path from 1 to n.\n",
+    "\n",
+    "Constraints:\n",
+    "1<=T<=30\n",
+    "1<=n <=1000\n",
+    "\n",
+    "Example:\n",
+    "Input:\n",
+    "2\n",
+    "9\n",
+    "4\n",
+    "\n",
+    "Output:\n",
+    "2\n",
+    "2\n",
+    "'''\n",
+    "def do(n):\n",
+    "    if n<2:\n",
+    "        return 0\n",
+    "    if n==2:\n",
+    "        return 1 \n",
+    "    return ((n%3)+1+do(n//3))\n",
+    "for _ in range(int(input())):\n",
+    "    n=int(input())\n",
+    "    print(int(do(n)))"
+   ]
   }
  ],
  "metadata": {