Skip to content

Commit 0051331

Browse files
gulabpatelgulabpatel
committed
Created using Colab
1 parent c863e6b commit 0051331

File tree

1 file changed

+70
-82
lines changed

1 file changed

+70
-82
lines changed

‎Competitive_Python_Coding/DSA_Competetive_Programing.ipynb

+70-82
Original file line numberDiff line numberDiff line change
@@ -5,9 +5,7 @@
55
"colab": {
66
"name": "DSA_Competetive Programing.ipynb",
77
"provenance": [],
8-
"collapsed_sections": [],
98
"toc_visible": true,
10-
"authorship_tag": "ABX9TyMbg9cNSjm5i/ecQ3Mr4TyT",
119
"include_colab_link": true
1210
},
1311
"kernelspec": {
@@ -96,20 +94,20 @@
9694
"# A biased function that returns TAILS with 80% probability and HEADS with 20% probability\n",
9795
"def biased():\n",
9896
" # generate a random number between 0–99, both inclusive\n",
99-
" r = randint(0, 99) \n",
97+
" r = randint(0, 99)\n",
10098
" # return TAILS if we got a number between [0–79]; otherwise, return HEADS\n",
10199
" # random.random()\n",
102100
" # A = [0]*8 + [1]*2 #return random.choice(A)\n",
103101
" return TAILS if (r <= 79) else HEADS\n",
104-
" \n",
102+
"\n",
105103
"# Return HEADS and TAILS with equal probability using the specified function\n",
106104
"def generate():\n",
107105
" while True:\n",
108106
" first = biased()\n",
109107
" second = biased()\n",
110108
" if first is not second:\n",
111109
" return first # or return second\n",
112-
" \n",
110+
"\n",
113111
"if __name__ == '__main__':\n",
114112
" x = y = 0\n",
115113
" for i in range(10000):\n",
@@ -180,13 +178,13 @@
180178
" x6 += 1\n",
181179
" else:\n",
182180
" x7 += 1\n",
183-
" print('X1 ~', x1 / 10000, '%') \n",
184-
" print('X2 ~', x2 / 10000, '%') \n",
185-
" print('X3 ~', x3 / 10000, '%') \n",
186-
" print('X4 ~', x4 / 10000, '%') \n",
187-
" print('X5 ~', x5 / 10000, '%') \n",
188-
" print('X6 ~', x6 / 10000, '%') \n",
189-
" print('X7 ~', x7 / 10000, '%') "
181+
" print('X1 ~', x1 / 10000, '%')\n",
182+
" print('X2 ~', x2 / 10000, '%')\n",
183+
" print('X3 ~', x3 / 10000, '%')\n",
184+
" print('X4 ~', x4 / 10000, '%')\n",
185+
" print('X5 ~', x5 / 10000, '%')\n",
186+
" print('X6 ~', x6 / 10000, '%')\n",
187+
" print('X7 ~', x7 / 10000, '%')"
190188
],
191189
"metadata": {
192190
"colab": {
@@ -245,11 +243,11 @@
245243
"# x4 += 1\n",
246244
"# else:\n",
247245
"# x5 += 1\n",
248-
"# print('X1 ~', x1 / 10000, '%') \n",
249-
"# print('X2 ~', x2 / 10000, '%') \n",
250-
"# print('X3 ~', x3 / 10000, '%') \n",
251-
"# print('X4 ~', x4 / 10000, '%') \n",
252-
"# print('X5 ~', x5 / 10000, '%') "
246+
"# print('X1 ~', x1 / 10000, '%')\n",
247+
"# print('X2 ~', x2 / 10000, '%')\n",
248+
"# print('X3 ~', x3 / 10000, '%')\n",
249+
"# print('X4 ~', x4 / 10000, '%')\n",
250+
"# print('X5 ~', x5 / 10000, '%')"
253251
],
254252
"metadata": {
255253
"colab": {
@@ -283,16 +281,16 @@
283281
{
284282
"cell_type": "code",
285283
"source": [
286-
"arr = [5, 2, 8, 7, 1]; \n",
287-
"temp = 0; \n",
288-
"#Sort the array in ascending order \n",
289-
"for i in range(0, len(arr)): \n",
290-
" for j in range(i+1, len(arr)): \n",
291-
" if(arr[i] > arr[j]): \n",
292-
" temp = arr[i]; \n",
293-
" arr[i] = arr[j]; \n",
294-
" arr[j] = temp; \n",
295-
"arr "
284+
"arr = [5, 2, 8, 7, 1];\n",
285+
"temp = 0;\n",
286+
"#Sort the array in ascending order\n",
287+
"for i in range(0, len(arr)):\n",
288+
" for j in range(i+1, len(arr)):\n",
289+
" if(arr[i] > arr[j]):\n",
290+
" temp = arr[i];\n",
291+
" arr[i] = arr[j];\n",
292+
" arr[j] = temp;\n",
293+
"arr"
296294
],
297295
"metadata": {
298296
"colab": {
@@ -332,7 +330,7 @@
332330
"L = len(numbers)\n",
333331
"# i goes from 0 to the middle\n",
334332
"for i in range(int(L/2)):\n",
335-
" # Swap each number with the number in \n",
333+
" # Swap each number with the number in\n",
336334
" # the mirror position for example first and last\n",
337335
" n = numbers[i]\n",
338336
" numbers[i] = numbers[L-i-1]\n",
@@ -956,9 +954,7 @@
956954
},
957955
{
958956
"cell_type": "code",
959-
"source": [
960-
""
961-
],
957+
"source": [],
962958
"metadata": {
963959
"id": "OVff6hmXEf7P"
964960
},
@@ -967,9 +963,7 @@
967963
},
968964
{
969965
"cell_type": "code",
970-
"source": [
971-
""
972-
],
966+
"source": [],
973967
"metadata": {
974968
"id": "WmpAeLcREf4H"
975969
},
@@ -1042,12 +1036,12 @@
10421036
" last_idx = {}\n",
10431037
" max_len = 0\n",
10441038
" start_idx = 0\n",
1045-
" for i in range(0, len(string)): \n",
1039+
" for i in range(0, len(string)):\n",
10461040
" if string[i] in last_idx:\n",
10471041
" start_idx = max(start_idx, last_idx[string[i]] + 1)\n",
10481042
" print(\"start_index \", start_idx)\n",
10491043
"\n",
1050-
" max_len = max(max_len, i-start_idx + 1) \n",
1044+
" max_len = max(max_len, i-start_idx + 1)\n",
10511045
" print(\"max_len \", max_len)\n",
10521046
" # Update last index of current char.\n",
10531047
" last_idx[string[i]] = i\n",
@@ -1151,7 +1145,7 @@
11511145
"\n",
11521146
" #return the value corresponding to the value of n\n",
11531147
" return lookup[n]\n",
1154-
" \n",
1148+
"\n",
11551149
"fib1(20)"
11561150
],
11571151
"metadata": {
@@ -1385,7 +1379,7 @@
13851379
" if seq1[idx1] == seq2[idx2]:\n",
13861380
" return 1 + lcq_recursive(seq1, seq2, idx1+1, idx2+1)\n",
13871381
" else:\n",
1388-
" return max(lcq_recursive(seq1, seq2, idx1+1, idx2), \n",
1382+
" return max(lcq_recursive(seq1, seq2, idx1+1, idx2),\n",
13891383
" lcq_recursive(seq1, seq2, idx1, idx2+1))\n",
13901384
"X = \"AGGTAB\"\n",
13911385
"Y = \"GXTXAYB\"\n",
@@ -1416,18 +1410,18 @@
14161410
" memo = {}\n",
14171411
" def recurse(idx1, idx2):\n",
14181412
" key = idx1, idx2\n",
1419-
" \n",
1413+
"\n",
14201414
" if key in memo:\n",
14211415
" return memo[key]\n",
1422-
" \n",
1416+
"\n",
14231417
" elif idx1 == len(seq1) or idx2 == len(seq2):\n",
14241418
" memo[key] = 0\n",
14251419
" elif seq1[idx1] == seq2[idx2]:\n",
14261420
" memo[key] = 1 + recurse(idx1+1, idx2+1)\n",
14271421
" else:\n",
1428-
" memo[key] = max(recurse(idx1+1, idx2), \n",
1422+
" memo[key] = max(recurse(idx1+1, idx2),\n",
14291423
" recurse(idx1, idx2+1))\n",
1430-
" return memo[key] \n",
1424+
" return memo[key]\n",
14311425
" return recurse(0, 0)\n",
14321426
"lcq_memoized(X, Y)"
14331427
],
@@ -1458,18 +1452,18 @@
14581452
"memo = {}\n",
14591453
"def recurse(seq1,seq2,idx1, idx2):\n",
14601454
" key = idx1, idx2\n",
1461-
" \n",
1455+
"\n",
14621456
" if key in memo:\n",
14631457
" return memo[key]\n",
1464-
" \n",
1458+
"\n",
14651459
" elif idx1 == len(seq1) or idx2 == len(seq2):\n",
14661460
" memo[key] = 0\n",
14671461
" elif seq1[idx1] == seq2[idx2]:\n",
14681462
" memo[key] = 1 + recurse(seq1,seq2,idx1+1, idx2+1)\n",
14691463
" else:\n",
1470-
" memo[key] = max(recurse(seq1,seq2,idx1+1, idx2), \n",
1464+
" memo[key] = max(recurse(seq1,seq2,idx1+1, idx2),\n",
14711465
" recurse(seq1,seq2,idx1, idx2+1))\n",
1472-
" return memo[key] "
1466+
" return memo[key]"
14731467
],
14741468
"metadata": {
14751469
"id": "-3AzqiwTdLIc"
@@ -1546,7 +1540,7 @@
15461540
"source": [
15471541
"#12 Anagrams\n",
15481542
"\n",
1549-
"Two strings are anagrams if they're made of the same characters with the same frequencies. \n",
1543+
"Two strings are anagrams if they're made of the same characters with the same frequencies.\n",
15501544
"\n",
15511545
"freq1 = frequencies of characters of s1<br>\n",
15521546
"freq2 = frequencies of characters of s2<br>\n",
@@ -1563,7 +1557,7 @@
15631557
"def are_anagrams(s1, s2):\n",
15641558
" if len(s1) != len(s2):\n",
15651559
" return False\n",
1566-
" \n",
1560+
"\n",
15671561
" freq1 = {}\n",
15681562
" freq2 = {}\n",
15691563
"\n",
@@ -1680,7 +1674,7 @@
16801674
" while i+1 < len(arr) and arr[i+1] == target:\n",
16811675
" i+=1\n",
16821676
" return [start, i]\n",
1683-
" return [-1, -1] \n",
1677+
" return [-1, -1]\n",
16841678
"\n",
16851679
"first_and_last([2,4,5,5,5,5,5,7,9,9], 3)\n",
16861680
"\n",
@@ -1900,7 +1894,7 @@
19001894
"cell_type": "code",
19011895
"source": [
19021896
"from collections import OrderedDict\n",
1903-
" \n",
1897+
"\n",
19041898
"dict = {'ravi':'10','rajnish':'9','sanjeev':'15','yash':'2','suraj':'32'}\n",
19051899
"dict1 = OrderedDict(sorted(dict.items()))\n",
19061900
"print(dict1)"
@@ -1970,7 +1964,7 @@
19701964
"#16.a Tiger Question\n",
19711965
"\n",
19721966
"inp = [1, 4, 5, 1, 1, 7, 8, 8, 4]<br>\n",
1973-
"out = [1, 1, 1, 8, 8, 4, 4, 7, 5] "
1967+
"out = [1, 1, 1, 8, 8, 4, 4, 7, 5]"
19741968
],
19751969
"metadata": {
19761970
"id": "_e1b6c_1YFlH"
@@ -1985,7 +1979,7 @@
19851979
"outputs": [],
19861980
"source": [
19871981
"inp = [1, 4, 5, 1, 1, 7, 8, 8, 4]\n",
1988-
"out = [1, 1, 1, 8, 8, 4, 4, 7, 5] "
1982+
"out = [1, 1, 1, 8, 8, 4, 4, 7, 5]"
19891983
]
19901984
},
19911985
{
@@ -2252,9 +2246,7 @@
22522246
},
22532247
{
22542248
"cell_type": "code",
2255-
"source": [
2256-
""
2257-
],
2249+
"source": [],
22582250
"metadata": {
22592251
"id": "W9GDb709oOKZ"
22602252
},
@@ -2264,17 +2256,15 @@
22642256
{
22652257
"cell_type": "markdown",
22662258
"source": [
2267-
"#TVS "
2259+
"#TVS"
22682260
],
22692261
"metadata": {
22702262
"id": "6i7CEGGJoY9A"
22712263
}
22722264
},
22732265
{
22742266
"cell_type": "markdown",
2275-
"source": [
2276-
""
2277-
],
2267+
"source": [],
22782268
"metadata": {
22792269
"id": "NPwgGYq7oY6h"
22802270
}
@@ -2323,10 +2313,10 @@
23232313
"cell_type": "code",
23242314
"source": [
23252315
"# C = [[0 for j in range(2)] for i in range(3)]\t#Matrix multiplication\n",
2326-
"# for m in range(len(A)): \n",
2327-
"# for n in range(len(B[0])): \n",
2328-
"# for o in range(len(B)): \n",
2329-
"# C[m][n] += A[m][o] * B[o][n] \n",
2316+
"# for m in range(len(A)):\n",
2317+
"# for n in range(len(B[0])):\n",
2318+
"# for o in range(len(B)):\n",
2319+
"# C[m][n] += A[m][o] * B[o][n]\n",
23302320
"# C"
23312321
],
23322322
"metadata": {
@@ -2339,12 +2329,12 @@
23392329
"cell_type": "code",
23402330
"source": [
23412331
"# def mergeMatrix(A, B):\n",
2342-
"C = [[0 for j in range(3+2)] for i in range(3)]\t\n",
2332+
"C = [[0 for j in range(3+2)] for i in range(3)]\n",
23432333
"for i in range(3):\n",
2344-
" for j in range(3):\t\t\t\n",
2345-
" C[i][j] = A[i][j]\t \n",
2334+
" for j in range(3):\n",
2335+
" C[i][j] = A[i][j]\n",
23462336
"for i in range(3):\n",
2347-
" for j in range(2):\t\t\t\n",
2337+
" for j in range(2):\n",
23482338
" C[i][j + 3] = B[i][j]\n",
23492339
"# return C\n",
23502340
"# C =\tmergeMatrix(A, B)\n",
@@ -2442,10 +2432,10 @@
24422432
"source": [
24432433
"F = [[0 for j in range(6)] for i in range(3)]\t## columnwise wise merging\n",
24442434
"for i in range(3):\n",
2445-
" for j in range(5):\t\t\t\n",
2446-
" F[i][j] = C[i][j]\t \n",
2435+
" for j in range(5):\n",
2436+
" F[i][j] = C[i][j]\n",
24472437
"for i in range(3):\n",
2448-
" for j in range(1):\t\t\t\n",
2438+
" for j in range(1):\n",
24492439
" F[i][j + 5] = E[i][j]"
24502440
],
24512441
"metadata": {
@@ -2486,10 +2476,10 @@
24862476
"source": [
24872477
"G = [[0 for j in range(5)] for i in range(4)]\t## Rowwise merging\n",
24882478
"for i in range(3):\n",
2489-
" for j in range(5):\t\t\t\n",
2490-
" G[i][j] = C[i][j]\t \n",
2479+
" for j in range(5):\n",
2480+
" G[i][j] = C[i][j]\n",
24912481
" # for i in range(5):\n",
2492-
"for j in range(5):\t\t\t\n",
2482+
"for j in range(5):\n",
24932483
" G[3][j] = E1[j][0]\n",
24942484
"G"
24952485
],
@@ -2518,11 +2508,11 @@
25182508
"cell_type": "code",
25192509
"source": [
25202510
"sumRow = []\n",
2521-
"for i in range(0, 6): \n",
2511+
"for i in range(0, 6):\n",
25222512
" sum = 0\n",
2523-
" for j in range(0, 3): \n",
2513+
" for j in range(0, 3):\n",
25242514
" sum = sum + F[j][i];\n",
2525-
" sumRow.append(sum) \n",
2515+
" sumRow.append(sum)\n",
25262516
"sumRow"
25272517
],
25282518
"metadata": {
@@ -2550,11 +2540,11 @@
25502540
"cell_type": "code",
25512541
"source": [
25522542
"sumCol = []\n",
2553-
"for i in range(3): \n",
2543+
"for i in range(3):\n",
25542544
" sum = 0\n",
2555-
" for j in range(6): \n",
2545+
" for j in range(6):\n",
25562546
" sum = sum + F[i][j];\n",
2557-
" sumCol.append(sum) \n",
2547+
" sumCol.append(sum)\n",
25582548
"sumCol"
25592549
],
25602550
"metadata": {
@@ -2580,9 +2570,7 @@
25802570
},
25812571
{
25822572
"cell_type": "code",
2583-
"source": [
2584-
""
2585-
],
2573+
"source": [],
25862574
"metadata": {
25872575
"id": "LWW9SnCOzp_Y"
25882576
},

0 commit comments

Comments
 (0)