diff options
| author | Santo Cariotti <santo@dcariotti.me> | 2024-05-28 10:29:13 +0200 |
|---|---|---|
| committer | Santo Cariotti <santo@dcariotti.me> | 2024-05-28 10:29:13 +0200 |
| commit | f05d888a0b621ca4e99e2b0fb6e23c097006fe41 (patch) | |
| tree | eebbb2489144112d3288393e354d19375a0aa088 /progs | |
Init
Diffstat (limited to 'progs')
979 files changed, 6648 insertions, 0 deletions
diff --git a/progs/a1.py b/progs/a1.py new file mode 100644 index 0000000..e229860 --- /dev/null +++ b/progs/a1.py @@ -0,0 +1,5 @@ +def first_repeated_char(str1):
+ for index,c in enumerate(str1):
+ if str1[:index+1].count(c) > 1:
+ return c
+ return "None"
\ No newline at end of file diff --git a/progs/a10.py b/progs/a10.py new file mode 100644 index 0000000..c0e28ad --- /dev/null +++ b/progs/a10.py @@ -0,0 +1,3 @@ +def max_of_nth(test_list, N):
+ res = max([sub[N] for sub in test_list])
+ return (res)
\ No newline at end of file diff --git a/progs/a100.py b/progs/a100.py new file mode 100644 index 0000000..9236c70 --- /dev/null +++ b/progs/a100.py @@ -0,0 +1,9 @@ +def equilibrium_index(arr):
+ total_sum = sum(arr)
+ left_sum=0
+ for i, num in enumerate(arr):
+ total_sum -= num
+ if left_sum == total_sum:
+ return i
+ left_sum += num
+ return -1
\ No newline at end of file diff --git a/progs/a101.py b/progs/a101.py new file mode 100644 index 0000000..bb73cd8 --- /dev/null +++ b/progs/a101.py @@ -0,0 +1,24 @@ +def find_ind(key, i, n,
+ k, arr):
+ ind = -1
+ start = i + 1
+ end = n - 1;
+ while (start < end):
+ mid = int(start +
+ (end - start) / 2)
+ if (arr[mid] - key <= k):
+ ind = mid
+ start = mid + 1
+ else:
+ end = mid
+ return ind
+def removals(arr, n, k):
+ ans = n - 1
+ arr.sort()
+ for i in range(0, n):
+ j = find_ind(arr[i], i,
+ n, k, arr)
+ if (j != -1):
+ ans = min(ans, n -
+ (j - i + 1))
+ return ans
\ No newline at end of file diff --git a/progs/a102.py b/progs/a102.py new file mode 100644 index 0000000..6c6d8b8 --- /dev/null +++ b/progs/a102.py @@ -0,0 +1,5 @@ +def is_key_present(d,x):
+ if x in d:
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a103.py b/progs/a103.py new file mode 100644 index 0000000..aaa3886 --- /dev/null +++ b/progs/a103.py @@ -0,0 +1,5 @@ +def harmonic_sum(n):
+ if n < 2:
+ return 1
+ else:
+ return 1 / n + (harmonic_sum(n - 1))
\ No newline at end of file diff --git a/progs/a104.py b/progs/a104.py new file mode 100644 index 0000000..ca6d321 --- /dev/null +++ b/progs/a104.py @@ -0,0 +1,4 @@ +def sort_sublists(list1):
+ list1.sort()
+ list1.sort(key=len)
+ return list1
\ No newline at end of file diff --git a/progs/a105.py b/progs/a105.py new file mode 100644 index 0000000..8bda3d4 --- /dev/null +++ b/progs/a105.py @@ -0,0 +1,10 @@ +def is_subset(arr1, m, arr2, n):
+ hashset = set()
+ for i in range(0, m):
+ hashset.add(arr1[i])
+ for i in range(0, n):
+ if arr2[i] in hashset:
+ continue
+ else:
+ return False
+ return True
\ No newline at end of file diff --git a/progs/a106.py b/progs/a106.py new file mode 100644 index 0000000..3a78c37 --- /dev/null +++ b/progs/a106.py @@ -0,0 +1,13 @@ +def count_Set_Bits(n) :
+ n += 1;
+ powerOf2 = 2;
+ cnt = n // 2;
+ while (powerOf2 <= n) :
+ totalPairs = n // powerOf2;
+ cnt += (totalPairs // 2) * powerOf2;
+ if (totalPairs & 1) :
+ cnt += (n % powerOf2)
+ else :
+ cnt += 0
+ powerOf2 <<= 1;
+ return cnt;
\ No newline at end of file diff --git a/progs/a107.py b/progs/a107.py new file mode 100644 index 0000000..3393151 --- /dev/null +++ b/progs/a107.py @@ -0,0 +1,3 @@ +def Convert(string):
+ li = list(string.split(" "))
+ return li
\ No newline at end of file diff --git a/progs/a108.py b/progs/a108.py new file mode 100644 index 0000000..2531306 --- /dev/null +++ b/progs/a108.py @@ -0,0 +1,10 @@ +from collections import defaultdict
+def get_unique(test_list):
+ res = defaultdict(list)
+ for sub in test_list:
+ res[sub[1]].append(sub[0])
+ res = dict(res)
+ res_dict = dict()
+ for key in res:
+ res_dict[key] = len(list(set(res[key])))
+ return (str(res_dict))
\ No newline at end of file diff --git a/progs/a109.py b/progs/a109.py new file mode 100644 index 0000000..b1b7c39 --- /dev/null +++ b/progs/a109.py @@ -0,0 +1,3 @@ +def front_and_rear(test_tup):
+ res = (test_tup[0], test_tup[-1])
+ return (res)
\ No newline at end of file diff --git a/progs/a110.py b/progs/a110.py new file mode 100644 index 0000000..09ad2d6 --- /dev/null +++ b/progs/a110.py @@ -0,0 +1,16 @@ +def product_Equal(n):
+ if n < 10:
+ return False
+ prodOdd = 1; prodEven = 1
+ while n > 0:
+ digit = n % 10
+ prodOdd *= digit
+ n = n//10
+ if n == 0:
+ break;
+ digit = n % 10
+ prodEven *= digit
+ n = n//10
+ if prodOdd == prodEven:
+ return True
+ return False
\ No newline at end of file diff --git a/progs/a113.py b/progs/a113.py new file mode 100644 index 0000000..39ed034 --- /dev/null +++ b/progs/a113.py @@ -0,0 +1,19 @@ +def count_Fac(n):
+ m = n
+ count = 0
+ i = 2
+ while((i * i) <= m):
+ total = 0
+ while (n % i == 0):
+ n /= i
+ total += 1
+ temp = 0
+ j = 1
+ while((temp + j) <= total):
+ temp += j
+ count += 1
+ j += 1
+ i += 1
+ if (n != 1):
+ count += 1
+ return count
\ No newline at end of file diff --git a/progs/a114.py b/progs/a114.py new file mode 100644 index 0000000..3b13bb4 --- /dev/null +++ b/progs/a114.py @@ -0,0 +1,3 @@ +def str_to_tuple(test_str):
+ res = tuple(map(int, test_str.split(', ')))
+ return (res)
\ No newline at end of file diff --git a/progs/a115.py b/progs/a115.py new file mode 100644 index 0000000..e4aed70 --- /dev/null +++ b/progs/a115.py @@ -0,0 +1,3 @@ +def rombus_perimeter(a):
+ perimeter=4*a
+ return perimeter
\ No newline at end of file diff --git a/progs/a116.py b/progs/a116.py new file mode 100644 index 0000000..f9da081 --- /dev/null +++ b/progs/a116.py @@ -0,0 +1,19 @@ +import math
+import sys
+def sd_calc(data):
+ n = len(data)
+ if n <= 1:
+ return 0.0
+ mean, sd = avg_calc(data), 0.0
+ for el in data:
+ sd += (float(el) - mean)**2
+ sd = math.sqrt(sd / float(n-1))
+ return sd
+def avg_calc(ls):
+ n, mean = len(ls), 0.0
+ if n <= 1:
+ return ls[0]
+ for el in ls:
+ mean = mean + float(el)
+ mean = mean / float(n)
+ return mean
\ No newline at end of file diff --git a/progs/a117.py b/progs/a117.py new file mode 100644 index 0000000..d6429ad --- /dev/null +++ b/progs/a117.py @@ -0,0 +1,5 @@ +def alternate_elements(list1):
+ result=[]
+ for item in list1[::2]:
+ result.append(item)
+ return result
\ No newline at end of file diff --git a/progs/a118.py b/progs/a118.py new file mode 100644 index 0000000..294bc98 --- /dev/null +++ b/progs/a118.py @@ -0,0 +1,7 @@ +import re
+def text_match(text):
+ patterns = 'ab*?'
+ if re.search(patterns, text):
+ return 'Found a match!'
+ else:
+ return('Not matched!')
\ No newline at end of file diff --git a/progs/a119.py b/progs/a119.py new file mode 100644 index 0000000..5825608 --- /dev/null +++ b/progs/a119.py @@ -0,0 +1,5 @@ +def add_dict_to_tuple(test_tup, test_dict):
+ test_tup = list(test_tup)
+ test_tup.append(test_dict)
+ test_tup = tuple(test_tup)
+ return (test_tup)
\ No newline at end of file diff --git a/progs/a12.py b/progs/a12.py new file mode 100644 index 0000000..8c18cbd --- /dev/null +++ b/progs/a12.py @@ -0,0 +1,3 @@ +def maximum_value(test_list):
+ res = [(key, max(lst)) for key, lst in test_list]
+ return (res)
\ No newline at end of file diff --git a/progs/a120.py b/progs/a120.py new file mode 100644 index 0000000..e094eb3 --- /dev/null +++ b/progs/a120.py @@ -0,0 +1,13 @@ +M = 100
+def maxAverageOfPath(cost, N):
+ dp = [[0 for i in range(N + 1)] for j in range(N + 1)]
+ dp[0][0] = cost[0][0]
+ for i in range(1, N):
+ dp[i][0] = dp[i - 1][0] + cost[i][0]
+ for j in range(1, N):
+ dp[0][j] = dp[0][j - 1] + cost[0][j]
+ for i in range(1, N):
+ for j in range(1, N):
+ dp[i][j] = max(dp[i - 1][j],
+ dp[i][j - 1]) + cost[i][j]
+ return dp[N - 1][N - 1] / (2 * N - 1)
\ No newline at end of file diff --git a/progs/a122.py b/progs/a122.py new file mode 100644 index 0000000..584cdc9 --- /dev/null +++ b/progs/a122.py @@ -0,0 +1,4 @@ +from operator import eq
+def count_same_pair(nums1, nums2):
+ result = sum(map(eq, nums1, nums2))
+ return result
\ No newline at end of file diff --git a/progs/a123.py b/progs/a123.py new file mode 100644 index 0000000..118c573 --- /dev/null +++ b/progs/a123.py @@ -0,0 +1,2 @@ +def power_base_sum(base, power):
+ return sum([int(i) for i in str(pow(base, power))])
\ No newline at end of file diff --git a/progs/a125.py b/progs/a125.py new file mode 100644 index 0000000..bd61056 --- /dev/null +++ b/progs/a125.py @@ -0,0 +1,3 @@ +def multiply_elements(test_tup):
+ res = tuple(i * j for i, j in zip(test_tup, test_tup[1:]))
+ return (res)
\ No newline at end of file diff --git a/progs/a126.py b/progs/a126.py new file mode 100644 index 0000000..f344bda --- /dev/null +++ b/progs/a126.py @@ -0,0 +1,4 @@ +import re
+def remove_char(S):
+ result = re.sub('[\W_]+', '', S)
+ return result
\ No newline at end of file diff --git a/progs/a127.py b/progs/a127.py new file mode 100644 index 0000000..ca33f09 --- /dev/null +++ b/progs/a127.py @@ -0,0 +1,3 @@ +def sum_list(lst1,lst2):
+ res_list = [lst1[i] + lst2[i] for i in range(len(lst1))]
+ return res_list
\ No newline at end of file diff --git a/progs/a129.py b/progs/a129.py new file mode 100644 index 0000000..3d0f600 --- /dev/null +++ b/progs/a129.py @@ -0,0 +1,3 @@ +from itertools import groupby
+def consecutive_duplicates(nums):
+ return [key for key, group in groupby(nums)]
\ No newline at end of file diff --git a/progs/a13.py b/progs/a13.py new file mode 100644 index 0000000..30a80e2 --- /dev/null +++ b/progs/a13.py @@ -0,0 +1,3 @@ +def cummulative_sum(test_list):
+ res = sum(map(sum, test_list))
+ return (res)
\ No newline at end of file diff --git a/progs/a130.py b/progs/a130.py new file mode 100644 index 0000000..4197e63 --- /dev/null +++ b/progs/a130.py @@ -0,0 +1,5 @@ +import math
+def lateralsurface_cone(r,h):
+ l = math.sqrt(r * r + h * h)
+ LSA = math.pi * r * l
+ return LSA
\ No newline at end of file diff --git a/progs/a131.py b/progs/a131.py new file mode 100644 index 0000000..5cebe72 --- /dev/null +++ b/progs/a131.py @@ -0,0 +1,3 @@ +import re
+def replace_specialchar(text):
+ return (re.sub("[ ,.]", ":", text))
\ No newline at end of file diff --git a/progs/a132.py b/progs/a132.py new file mode 100644 index 0000000..d179c8a --- /dev/null +++ b/progs/a132.py @@ -0,0 +1,13 @@ +def find_first_occurrence(A, x):
+ (left, right) = (0, len(A) - 1)
+ result = -1
+ while left <= right:
+ mid = (left + right) // 2
+ if x == A[mid]:
+ result = mid
+ right = mid - 1
+ elif x < A[mid]:
+ right = mid - 1
+ else:
+ left = mid + 1
+ return result
\ No newline at end of file diff --git a/progs/a133.py b/progs/a133.py new file mode 100644 index 0000000..d2ce961 --- /dev/null +++ b/progs/a133.py @@ -0,0 +1,10 @@ +def sum_Of_Subarray_Prod(arr,n):
+ ans = 0
+ res = 0
+ i = n - 1
+ while (i >= 0):
+ incr = arr[i]*(1 + res)
+ ans += incr
+ res = incr
+ i -= 1
+ return (ans)
\ No newline at end of file diff --git a/progs/a134.py b/progs/a134.py new file mode 100644 index 0000000..d2e1515 --- /dev/null +++ b/progs/a134.py @@ -0,0 +1,11 @@ +def set_middle_bits(n):
+ n |= n >> 1;
+ n |= n >> 2;
+ n |= n >> 4;
+ n |= n >> 8;
+ n |= n >> 16;
+ return (n >> 1) ^ 1
+def toggle_middle_bits(n):
+ if (n == 1):
+ return 1
+ return n ^ set_middle_bits(n)
\ No newline at end of file diff --git a/progs/a135.py b/progs/a135.py new file mode 100644 index 0000000..ee2fb40 --- /dev/null +++ b/progs/a135.py @@ -0,0 +1,4 @@ +import bisect
+def left_insertion(a, x):
+ i = bisect.bisect_left(a, x)
+ return i
\ No newline at end of file diff --git a/progs/a136.py b/progs/a136.py new file mode 100644 index 0000000..a1f4adb --- /dev/null +++ b/progs/a136.py @@ -0,0 +1,7 @@ +import re
+regex = '^[aeiouAEIOU][A-Za-z0-9_]*'
+def check_str(string):
+ if(re.search(regex, string)):
+ return ("Valid")
+ else:
+ return ("Invalid")
\ No newline at end of file diff --git a/progs/a137.py b/progs/a137.py new file mode 100644 index 0000000..ff0d667 --- /dev/null +++ b/progs/a137.py @@ -0,0 +1,5 @@ +def geometric_sum(n):
+ if n < 0:
+ return 0
+ else:
+ return 1 / (pow(2, n)) + geometric_sum(n - 1)
\ No newline at end of file diff --git a/progs/a138.py b/progs/a138.py new file mode 100644 index 0000000..d20a9bb --- /dev/null +++ b/progs/a138.py @@ -0,0 +1,4 @@ +import math
+def find_Index(n):
+ x = math.sqrt(2 * math.pow(10,(n - 1)));
+ return round(x);
\ No newline at end of file diff --git a/progs/a139.py b/progs/a139.py new file mode 100644 index 0000000..9c0e09c --- /dev/null +++ b/progs/a139.py @@ -0,0 +1,3 @@ +def tuple_to_dict(test_tup):
+ res = dict(test_tup[idx : idx + 2] for idx in range(0, len(test_tup), 2))
+ return (res)
\ No newline at end of file diff --git a/progs/a140.py b/progs/a140.py new file mode 100644 index 0000000..2bdcce2 --- /dev/null +++ b/progs/a140.py @@ -0,0 +1,6 @@ +def all_Characters_Same(s) :
+ n = len(s)
+ for i in range(1,n) :
+ if s[i] != s[0] :
+ return False
+ return True
\ No newline at end of file diff --git a/progs/a141.py b/progs/a141.py new file mode 100644 index 0000000..844ffd7 --- /dev/null +++ b/progs/a141.py @@ -0,0 +1,4 @@ +import math
+def area_tetrahedron(side):
+ area = math.sqrt(3)*(side*side)
+ return area
\ No newline at end of file diff --git a/progs/a142.py b/progs/a142.py new file mode 100644 index 0000000..a6ecb35 --- /dev/null +++ b/progs/a142.py @@ -0,0 +1,3 @@ +def rotate_right(list1,m,n):
+ result = list1[-(m):]+list1[:-(n)]
+ return result
\ No newline at end of file diff --git a/progs/a145.py b/progs/a145.py new file mode 100644 index 0000000..9f27291 --- /dev/null +++ b/progs/a145.py @@ -0,0 +1,6 @@ +def sector_area(r,a):
+ pi=22/7
+ if a >= 360:
+ return None
+ sectorarea = (pi*r**2) * (a/360)
+ return sectorarea
\ No newline at end of file diff --git a/progs/a146.py b/progs/a146.py new file mode 100644 index 0000000..2db2801 --- /dev/null +++ b/progs/a146.py @@ -0,0 +1,16 @@ +def lcs_of_three(X, Y, Z, m, n, o):
+ L = [[[0 for i in range(o+1)] for j in range(n+1)]
+ for k in range(m+1)]
+ for i in range(m+1):
+ for j in range(n+1):
+ for k in range(o+1):
+ if (i == 0 or j == 0 or k == 0):
+ L[i][j][k] = 0
+ elif (X[i-1] == Y[j-1] and
+ X[i-1] == Z[k-1]):
+ L[i][j][k] = L[i-1][j-1][k-1] + 1
+ else:
+ L[i][j][k] = max(max(L[i-1][j][k],
+ L[i][j-1][k]),
+ L[i][j][k-1])
+ return L[m][n][o]
\ No newline at end of file diff --git a/progs/a148.py b/progs/a148.py new file mode 100644 index 0000000..a4c489d --- /dev/null +++ b/progs/a148.py @@ -0,0 +1,4 @@ +def sort_numeric_strings(nums_str):
+ result = [int(x) for x in nums_str]
+ result.sort()
+ return result
\ No newline at end of file diff --git a/progs/a149.py b/progs/a149.py new file mode 100644 index 0000000..1aea7cd --- /dev/null +++ b/progs/a149.py @@ -0,0 +1,3 @@ +def add_tuple(test_list, test_tup):
+ test_list += test_tup
+ return (test_list)
\ No newline at end of file diff --git a/progs/a15.py b/progs/a15.py new file mode 100644 index 0000000..238c18f --- /dev/null +++ b/progs/a15.py @@ -0,0 +1,3 @@ +def tuple_modulo(test_tup1, test_tup2):
+ res = tuple(ele1 % ele2 for ele1, ele2 in zip(test_tup1, test_tup2))
+ return (res)
\ No newline at end of file diff --git a/progs/a150.py b/progs/a150.py new file mode 100644 index 0000000..de203fb --- /dev/null +++ b/progs/a150.py @@ -0,0 +1,7 @@ +def check_min_heap(arr, i):
+ if 2 * i + 2 > len(arr):
+ return True
+ left_child = (arr[i] <= arr[2 * i + 1]) and check_min_heap(arr, 2 * i + 1)
+ right_child = (2 * i + 2 == len(arr)) or (arr[i] <= arr[2 * i + 2]
+ and check_min_heap(arr, 2 * i + 2))
+ return left_child and right_child
\ No newline at end of file diff --git a/progs/a151.py b/progs/a151.py new file mode 100644 index 0000000..030c8b6 --- /dev/null +++ b/progs/a151.py @@ -0,0 +1,7 @@ +def jacobsthal_num(n):
+ dp = [0] * (n + 1)
+ dp[0] = 0
+ dp[1] = 1
+ for i in range(2, n+1):
+ dp[i] = dp[i - 1] + 2 * dp[i - 2]
+ return dp[n]
\ No newline at end of file diff --git a/progs/a153.py b/progs/a153.py new file mode 100644 index 0000000..08d190c --- /dev/null +++ b/progs/a153.py @@ -0,0 +1,6 @@ +def extract_index_list(l1, l2, l3):
+ result = []
+ for m, n, o in zip(l1, l2, l3):
+ if (m == n == o):
+ result.append(m)
+ return result
\ No newline at end of file diff --git a/progs/a154.py b/progs/a154.py new file mode 100644 index 0000000..38780bc --- /dev/null +++ b/progs/a154.py @@ -0,0 +1,13 @@ +def second_smallest(numbers):
+ if (len(numbers)<2):
+ return
+ if ((len(numbers)==2) and (numbers[0] == numbers[1]) ):
+ return
+ dup_items = set()
+ uniq_items = []
+ for x in numbers:
+ if x not in dup_items:
+ uniq_items.append(x)
+ dup_items.add(x)
+ uniq_items.sort()
+ return uniq_items[1]
\ No newline at end of file diff --git a/progs/a155.py b/progs/a155.py new file mode 100644 index 0000000..d9193e0 --- /dev/null +++ b/progs/a155.py @@ -0,0 +1,7 @@ +import re
+def text_match_zero_one(text):
+ patterns = 'ab?'
+ if re.search(patterns, text):
+ return 'Found a match!'
+ else:
+ return('Not matched!')
\ No newline at end of file diff --git a/progs/a156.py b/progs/a156.py new file mode 100644 index 0000000..babdcbe --- /dev/null +++ b/progs/a156.py @@ -0,0 +1,4 @@ +def count_reverse_pairs(test_list):
+ res = sum([1 for idx in range(0, len(test_list)) for idxn in range(idx, len(
+ test_list)) if test_list[idxn] == str(''.join(list(reversed(test_list[idx]))))])
+ return str(res)
\ No newline at end of file diff --git a/progs/a157.py b/progs/a157.py new file mode 100644 index 0000000..9b88c14 --- /dev/null +++ b/progs/a157.py @@ -0,0 +1,7 @@ +def unique_sublists(list1):
+ result ={}
+ for l in list1:
+ result.setdefault(tuple(l), list()).append(1)
+ for a, b in result.items():
+ result[a] = sum(b)
+ return result
\ No newline at end of file diff --git a/progs/a159.py b/progs/a159.py new file mode 100644 index 0000000..4a3b4c1 --- /dev/null +++ b/progs/a159.py @@ -0,0 +1,6 @@ +def unique_Element(arr,n):
+ s = set(arr)
+ if (len(s) == 1):
+ return ('YES')
+ else:
+ return ('NO')
\ No newline at end of file diff --git a/progs/a16.py b/progs/a16.py new file mode 100644 index 0000000..c458cce --- /dev/null +++ b/progs/a16.py @@ -0,0 +1,12 @@ +def min_Jumps(a, b, d):
+ temp = a
+ a = min(a, b)
+ b = max(temp, b)
+ if (d >= b):
+ return (d + b - 1) / b
+ if (d == 0):
+ return 0
+ if (d == a):
+ return 1
+ else:
+ return 2
\ No newline at end of file diff --git a/progs/a160.py b/progs/a160.py new file mode 100644 index 0000000..010935e --- /dev/null +++ b/progs/a160.py @@ -0,0 +1,6 @@ +def arc_length(d,a):
+ pi=22/7
+ if a >= 360:
+ return None
+ arclength = (pi*d) * (a/360)
+ return arclength
\ No newline at end of file diff --git a/progs/a161.py b/progs/a161.py new file mode 100644 index 0000000..b21de79 --- /dev/null +++ b/progs/a161.py @@ -0,0 +1,5 @@ +def check_monthnumber_number(monthnum3):
+ if(monthnum3==4 or monthnum3==6 or monthnum3==9 or monthnum3==11):
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a162.py b/progs/a162.py new file mode 100644 index 0000000..d35782b --- /dev/null +++ b/progs/a162.py @@ -0,0 +1,7 @@ +def find_Min_Diff(arr,n):
+ arr = sorted(arr)
+ diff = 10**20
+ for i in range(n-1):
+ if arr[i+1] - arr[i] < diff:
+ diff = arr[i+1] - arr[i]
+ return diff
\ No newline at end of file diff --git a/progs/a163.py b/progs/a163.py new file mode 100644 index 0000000..a624d5c --- /dev/null +++ b/progs/a163.py @@ -0,0 +1,5 @@ +def number_ctr(str):
+ number_ctr= 0
+ for i in range(len(str)):
+ if str[i] >= '0' and str[i] <= '9': number_ctr += 1
+ return number_ctr
\ No newline at end of file diff --git a/progs/a164.py b/progs/a164.py new file mode 100644 index 0000000..fae83d9 --- /dev/null +++ b/progs/a164.py @@ -0,0 +1,4 @@ +import math
+def is_polite(n):
+ n = n + 1
+ return (int)(n+(math.log((n + math.log(n, 2)), 2)))
\ No newline at end of file diff --git a/progs/a165.py b/progs/a165.py new file mode 100644 index 0000000..9de2d2f --- /dev/null +++ b/progs/a165.py @@ -0,0 +1,7 @@ +def pair_wise(l1):
+ temp = []
+ for i in range(len(l1) - 1):
+ current_element, next_element = l1[i], l1[i + 1]
+ x = (current_element, next_element)
+ temp.append(x)
+ return temp
\ No newline at end of file diff --git a/progs/a166.py b/progs/a166.py new file mode 100644 index 0000000..effe847 --- /dev/null +++ b/progs/a166.py @@ -0,0 +1,7 @@ +def get_Pairs_Count(arr,n,sum):
+ count = 0
+ for i in range(0,n):
+ for j in range(i + 1,n):
+ if arr[i] + arr[j] == sum:
+ count += 1
+ return count
\ No newline at end of file diff --git a/progs/a167.py b/progs/a167.py new file mode 100644 index 0000000..1392dac --- /dev/null +++ b/progs/a167.py @@ -0,0 +1,9 @@ +def check_Odd_Parity(x):
+ parity = 0
+ while (x != 0):
+ x = x & (x - 1)
+ parity += 1
+ if (parity % 2 == 1):
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a168.py b/progs/a168.py new file mode 100644 index 0000000..ae6939a --- /dev/null +++ b/progs/a168.py @@ -0,0 +1,3 @@ +def Diff(li1,li2):
+ return (list(list(set(li1)-set(li2)) + list(set(li2)-set(li1))))
+
\ No newline at end of file diff --git a/progs/a169.py b/progs/a169.py new file mode 100644 index 0000000..8b066d5 --- /dev/null +++ b/progs/a169.py @@ -0,0 +1,7 @@ +def odd_Num_Sum(n) :
+ j = 0
+ sm = 0
+ for i in range(1,n + 1) :
+ j = (2*i-1)
+ sm = sm + (j*j*j*j)
+ return sm
\ No newline at end of file diff --git a/progs/a170.py b/progs/a170.py new file mode 100644 index 0000000..2c39536 --- /dev/null +++ b/progs/a170.py @@ -0,0 +1,15 @@ +from collections import deque
+def check_expression(exp):
+ if len(exp) & 1:
+ return False
+ stack = deque()
+ for ch in exp:
+ if ch == '(' or ch == '{' or ch == '[':
+ stack.append(ch)
+ if ch == ')' or ch == '}' or ch == ']':
+ if not stack:
+ return False
+ top = stack.pop()
+ if (top == '(' and ch != ')') or (top == '{' and ch != '}' or (top == '[' and ch != ']')):
+ return False
+ return not stack
\ No newline at end of file diff --git a/progs/a171.py b/progs/a171.py new file mode 100644 index 0000000..64686f7 --- /dev/null +++ b/progs/a171.py @@ -0,0 +1,5 @@ +def remove_length(test_str, K):
+ temp = test_str.split()
+ res = [ele for ele in temp if len(ele) != K]
+ res = ' '.join(res)
+ return (res)
\ No newline at end of file diff --git a/progs/a172.py b/progs/a172.py new file mode 100644 index 0000000..aa99281 --- /dev/null +++ b/progs/a172.py @@ -0,0 +1,6 @@ +import re
+def occurance_substring(text,pattern):
+ for match in re.finditer(pattern, text):
+ s = match.start()
+ e = match.end()
+ return (text[s:e], s, e)
\ No newline at end of file diff --git a/progs/a173.py b/progs/a173.py new file mode 100644 index 0000000..c2e9205 --- /dev/null +++ b/progs/a173.py @@ -0,0 +1,7 @@ +import re
+regex = '^[a-z0-9]+[\._]?[a-z0-9]+[@]\w+[.]\w{2,3}$'
+def check_email(email):
+ if(re.search(regex,email)):
+ return ("Valid Email")
+ else:
+ return ("Invalid Email")
\ No newline at end of file diff --git a/progs/a174.py b/progs/a174.py new file mode 100644 index 0000000..4a8a265 --- /dev/null +++ b/progs/a174.py @@ -0,0 +1,2 @@ +def odd_position(nums):
+ return all(nums[i]%2==i%2 for i in range(len(nums)))
\ No newline at end of file diff --git a/progs/a175.py b/progs/a175.py new file mode 100644 index 0000000..7376fea --- /dev/null +++ b/progs/a175.py @@ -0,0 +1,11 @@ +def count_vowels(test_str):
+ res = 0
+ vow_list = ['a', 'e', 'i', 'o', 'u']
+ for idx in range(1, len(test_str) - 1):
+ if test_str[idx] not in vow_list and (test_str[idx - 1] in vow_list or test_str[idx + 1] in vow_list):
+ res += 1
+ if test_str[0] not in vow_list and test_str[1] in vow_list:
+ res += 1
+ if test_str[-1] not in vow_list and test_str[-2] in vow_list:
+ res += 1
+ return (res)
\ No newline at end of file diff --git a/progs/a176.py b/progs/a176.py new file mode 100644 index 0000000..52c13ad --- /dev/null +++ b/progs/a176.py @@ -0,0 +1,7 @@ +def find_Sum(arr,n):
+ arr.sort()
+ sum = arr[0]
+ for i in range(0,n-1):
+ if (arr[i] != arr[i+1]):
+ sum = sum + arr[i+1]
+ return sum
\ No newline at end of file diff --git a/progs/a177.py b/progs/a177.py new file mode 100644 index 0000000..8479a42 --- /dev/null +++ b/progs/a177.py @@ -0,0 +1,3 @@ +from itertools import groupby
+def pack_consecutive_duplicates(list1):
+ return [list(group) for key, group in groupby(list1)]
\ No newline at end of file diff --git a/progs/a178.py b/progs/a178.py new file mode 100644 index 0000000..6ae8528 --- /dev/null +++ b/progs/a178.py @@ -0,0 +1,7 @@ +def unique_sublists(list1):
+ result ={}
+ for l in list1:
+ result.setdefault(tuple(l), list()).append(1)
+ for a, b in result.items():
+ result[a] = sum(b)
+ return result
\ No newline at end of file diff --git a/progs/a179.py b/progs/a179.py new file mode 100644 index 0000000..223a67b --- /dev/null +++ b/progs/a179.py @@ -0,0 +1,4 @@ +from itertools import combinations
+def find_combinations(test_list):
+ res = [(b1 + a1, b2 + a2) for (a1, a2), (b1, b2) in combinations(test_list, 2)]
+ return (res)
\ No newline at end of file diff --git a/progs/a18.py b/progs/a18.py new file mode 100644 index 0000000..3b6d7ce --- /dev/null +++ b/progs/a18.py @@ -0,0 +1,10 @@ +def move_num(test_str):
+ res = ''
+ dig = ''
+ for ele in test_str:
+ if ele.isdigit():
+ dig += ele
+ else:
+ res += ele
+ res += dig
+ return (res)
\ No newline at end of file diff --git a/progs/a180.py b/progs/a180.py new file mode 100644 index 0000000..ea41d52 --- /dev/null +++ b/progs/a180.py @@ -0,0 +1,13 @@ +import math
+def count_Divisors(n) :
+ count = 0
+ for i in range(1, (int)(math.sqrt(n)) + 2) :
+ if (n % i == 0) :
+ if( n // i == i) :
+ count = count + 1
+ else :
+ count = count + 2
+ if (count % 2 == 0) :
+ return ("Even")
+ else :
+ return ("Odd")
\ No newline at end of file diff --git a/progs/a181.py b/progs/a181.py new file mode 100644 index 0000000..c03fcfa --- /dev/null +++ b/progs/a181.py @@ -0,0 +1,6 @@ +def Odd_Length_Sum(arr):
+ Sum = 0
+ l = len(arr)
+ for i in range(l):
+ Sum += ((((i + 1) *(l - i) + 1) // 2) * arr[i])
+ return Sum
\ No newline at end of file diff --git a/progs/a182.py b/progs/a182.py new file mode 100644 index 0000000..2e79b0d --- /dev/null +++ b/progs/a182.py @@ -0,0 +1,19 @@ +def rgb_to_hsv(r, g, b):
+ r, g, b = r/255.0, g/255.0, b/255.0
+ mx = max(r, g, b)
+ mn = min(r, g, b)
+ df = mx-mn
+ if mx == mn:
+ h = 0
+ elif mx == r:
+ h = (60 * ((g-b)/df) + 360) % 360
+ elif mx == g:
+ h = (60 * ((b-r)/df) + 120) % 360
+ elif mx == b:
+ h = (60 * ((r-g)/df) + 240) % 360
+ if mx == 0:
+ s = 0
+ else:
+ s = (df/mx)*100
+ v = mx*100
+ return h, s, v
\ No newline at end of file diff --git a/progs/a183.py b/progs/a183.py new file mode 100644 index 0000000..7086326 --- /dev/null +++ b/progs/a183.py @@ -0,0 +1,4 @@ +def mul_even_odd(list1):
+ first_even = next((el for el in list1 if el%2==0),-1)
+ first_odd = next((el for el in list1 if el%2!=0),-1)
+ return (first_even*first_odd)
\ No newline at end of file diff --git a/progs/a184.py b/progs/a184.py new file mode 100644 index 0000000..23c6568 --- /dev/null +++ b/progs/a184.py @@ -0,0 +1,3 @@ +def tuple_str_int(test_str):
+ res = tuple(int(num) for num in test_str.replace('(', '').replace(')', '').replace('...', '').split(', '))
+ return (res)
\ No newline at end of file diff --git a/progs/a185.py b/progs/a185.py new file mode 100644 index 0000000..c372b9e --- /dev/null +++ b/progs/a185.py @@ -0,0 +1,4 @@ +import bisect
+def right_insertion(a, x):
+ i = bisect.bisect_right(a, x)
+ return i
\ No newline at end of file diff --git a/progs/a186.py b/progs/a186.py new file mode 100644 index 0000000..3011e9a --- /dev/null +++ b/progs/a186.py @@ -0,0 +1,7 @@ +import re
+def text_match_three(text):
+ patterns = 'ab{3}?'
+ if re.search(patterns, text):
+ return 'Found a match!'
+ else:
+ return('Not matched!')
\ No newline at end of file diff --git a/progs/a187.py b/progs/a187.py new file mode 100644 index 0000000..04b8a88 --- /dev/null +++ b/progs/a187.py @@ -0,0 +1,3 @@ +def new_tuple(test_list, test_str):
+ res = tuple(test_list + [test_str])
+ return (res)
\ No newline at end of file diff --git a/progs/a188.py b/progs/a188.py new file mode 100644 index 0000000..aad0579 --- /dev/null +++ b/progs/a188.py @@ -0,0 +1,4 @@ +from math import tan, pi
+def perimeter_polygon(s,l):
+ perimeter = s*l
+ return perimeter
\ No newline at end of file diff --git a/progs/a189.py b/progs/a189.py new file mode 100644 index 0000000..80ca625 --- /dev/null +++ b/progs/a189.py @@ -0,0 +1,2 @@ +def even_position(nums):
+ return all(nums[i]%2==i%2 for i in range(len(nums)))
\ No newline at end of file diff --git a/progs/a19.py b/progs/a19.py new file mode 100644 index 0000000..25373c1 --- /dev/null +++ b/progs/a19.py @@ -0,0 +1,10 @@ +def largest_subset(a, n):
+ dp = [0 for i in range(n)]
+ dp[n - 1] = 1;
+ for i in range(n - 2, -1, -1):
+ mxm = 0;
+ for j in range(i + 1, n):
+ if a[j] % a[i] == 0 or a[i] % a[j] == 0:
+ mxm = max(mxm, dp[j])
+ dp[i] = 1 + mxm
+ return max(dp)
\ No newline at end of file diff --git a/progs/a190.py b/progs/a190.py new file mode 100644 index 0000000..ab9ad59 --- /dev/null +++ b/progs/a190.py @@ -0,0 +1,6 @@ +def remove_nested(test_tup):
+ res = tuple()
+ for count, ele in enumerate(test_tup):
+ if not isinstance(ele, tuple):
+ res = res + (ele, )
+ return (res)
\ No newline at end of file diff --git a/progs/a191.py b/progs/a191.py new file mode 100644 index 0000000..712d57c --- /dev/null +++ b/progs/a191.py @@ -0,0 +1,2 @@ +def count_list(input_list):
+ return len(input_list)
\ No newline at end of file diff --git a/progs/a192.py b/progs/a192.py new file mode 100644 index 0000000..a8927d6 --- /dev/null +++ b/progs/a192.py @@ -0,0 +1,14 @@ +def last(arr,x,n):
+ low = 0
+ high = n - 1
+ res = -1
+ while (low <= high):
+ mid = (low + high) // 2
+ if arr[mid] > x:
+ high = mid - 1
+ elif arr[mid] < x:
+ low = mid + 1
+ else:
+ res = mid
+ low = mid + 1
+ return res
\ No newline at end of file diff --git a/progs/a193.py b/progs/a193.py new file mode 100644 index 0000000..69fa75d --- /dev/null +++ b/progs/a193.py @@ -0,0 +1,7 @@ +import re
+def text_starta_endb(text):
+ patterns = 'a.*?b$'
+ if re.search(patterns, text):
+ return 'Found a match!'
+ else:
+ return('Not matched!')
\ No newline at end of file diff --git a/progs/a195.py b/progs/a195.py new file mode 100644 index 0000000..8b1e235 --- /dev/null +++ b/progs/a195.py @@ -0,0 +1,5 @@ +def return_sum(dict):
+ sum = 0
+ for i in dict.values():
+ sum = sum + i
+ return sum
\ No newline at end of file diff --git a/progs/a196.py b/progs/a196.py new file mode 100644 index 0000000..8787a9c --- /dev/null +++ b/progs/a196.py @@ -0,0 +1,6 @@ +def sum_Odd(n):
+ terms = (n + 1)//2
+ sum1 = terms * terms
+ return sum1
+def sum_in_Range(l,r):
+ return sum_Odd(r) - sum_Odd(l - 1)
\ No newline at end of file diff --git a/progs/a197.py b/progs/a197.py new file mode 100644 index 0000000..5618288 --- /dev/null +++ b/progs/a197.py @@ -0,0 +1,5 @@ +def _sum(arr):
+ sum=0
+ for i in arr:
+ sum = sum + i
+ return(sum)
\ No newline at end of file diff --git a/progs/a198.py b/progs/a198.py new file mode 100644 index 0000000..1cfd2a8 --- /dev/null +++ b/progs/a198.py @@ -0,0 +1,3 @@ +INT_BITS = 32
+def left_Rotate(n,d):
+ return (n << d)|(n >> (INT_BITS - d))
\ No newline at end of file diff --git a/progs/a2.py b/progs/a2.py new file mode 100644 index 0000000..e1620b1 --- /dev/null +++ b/progs/a2.py @@ -0,0 +1,13 @@ +def get_ludic(n):
+ ludics = []
+ for i in range(1, n + 1):
+ ludics.append(i)
+ index = 1
+ while(index != len(ludics)):
+ first_ludic = ludics[index]
+ remove_index = index + first_ludic
+ while(remove_index < len(ludics)):
+ ludics.remove(ludics[remove_index])
+ remove_index = remove_index + first_ludic - 1
+ index += 1
+ return ludics
\ No newline at end of file diff --git a/progs/a20.py b/progs/a20.py new file mode 100644 index 0000000..295d10f --- /dev/null +++ b/progs/a20.py @@ -0,0 +1,3 @@ +def increment_numerics(test_list, K):
+ res = [str(int(ele) + K) if ele.isdigit() else ele for ele in test_list]
+ return res
\ No newline at end of file diff --git a/progs/a200.py b/progs/a200.py new file mode 100644 index 0000000..cab3875 --- /dev/null +++ b/progs/a200.py @@ -0,0 +1,6 @@ +def test_three_equal(x,y,z):
+ result= set([x,y,z])
+ if len(result)==3:
+ return 0
+ else:
+ return (4-len(result))
\ No newline at end of file diff --git a/progs/a201.py b/progs/a201.py new file mode 100644 index 0000000..5bccf71 --- /dev/null +++ b/progs/a201.py @@ -0,0 +1,5 @@ +def count_Rotation(arr,n):
+ for i in range (1,n):
+ if (arr[i] < arr[i - 1]):
+ return i
+ return 0
\ No newline at end of file diff --git a/progs/a202.py b/progs/a202.py new file mode 100644 index 0000000..a6555a4 --- /dev/null +++ b/progs/a202.py @@ -0,0 +1,7 @@ +def is_Perfect_Square(n) :
+ i = 1
+ while (i * i<= n):
+ if ((n % i == 0) and (n / i == i)):
+ return True
+ i = i + 1
+ return False
\ No newline at end of file diff --git a/progs/a203.py b/progs/a203.py new file mode 100644 index 0000000..540c84c --- /dev/null +++ b/progs/a203.py @@ -0,0 +1,5 @@ +def is_Product_Even(arr,n):
+ for i in range(0,n):
+ if ((arr[i] & 1) == 0):
+ return True
+ return False
\ No newline at end of file diff --git a/progs/a204.py b/progs/a204.py new file mode 100644 index 0000000..bc068f3 --- /dev/null +++ b/progs/a204.py @@ -0,0 +1,2 @@ +def max_sum_list(lists):
+ return max(lists, key=sum)
\ No newline at end of file diff --git a/progs/a205.py b/progs/a205.py new file mode 100644 index 0000000..0042207 --- /dev/null +++ b/progs/a205.py @@ -0,0 +1,12 @@ +def max_run_uppercase(test_str):
+ cnt = 0
+ res = 0
+ for idx in range(0, len(test_str)):
+ if test_str[idx].isupper():
+ cnt += 1
+ else:
+ res = cnt
+ cnt = 0
+ if test_str[len(test_str) - 1].isupper():
+ res = cnt
+ return (res)
\ No newline at end of file diff --git a/progs/a206.py b/progs/a206.py new file mode 100644 index 0000000..16a664d --- /dev/null +++ b/progs/a206.py @@ -0,0 +1,3 @@ +def first_odd(nums):
+ first_odd = next((el for el in nums if el%2!=0),-1)
+ return first_odd
\ No newline at end of file diff --git a/progs/a207.py b/progs/a207.py new file mode 100644 index 0000000..5957ef9 --- /dev/null +++ b/progs/a207.py @@ -0,0 +1,7 @@ +def check_K(test_tup, K):
+ res = False
+ for ele in test_tup:
+ if ele == K:
+ res = True
+ break
+ return (res)
\ No newline at end of file diff --git a/progs/a208.py b/progs/a208.py new file mode 100644 index 0000000..37d428e --- /dev/null +++ b/progs/a208.py @@ -0,0 +1,3 @@ +def check_smaller(test_tup1, test_tup2):
+ res = all(x > y for x, y in zip(test_tup1, test_tup2))
+ return (res)
\ No newline at end of file diff --git a/progs/a209.py b/progs/a209.py new file mode 100644 index 0000000..c8c5e95 --- /dev/null +++ b/progs/a209.py @@ -0,0 +1,4 @@ +from collections import Counter
+def count_variable(a,b,c,d):
+ c = Counter(p=a, q=b, r=c, s=d)
+ return list(c.elements())
\ No newline at end of file diff --git a/progs/a21.py b/progs/a21.py new file mode 100644 index 0000000..b9019f5 --- /dev/null +++ b/progs/a21.py @@ -0,0 +1,25 @@ +def get_median(arr1, arr2, n):
+ i = 0
+ j = 0
+ m1 = -1
+ m2 = -1
+ count = 0
+ while count < n + 1:
+ count += 1
+ if i == n:
+ m1 = m2
+ m2 = arr2[0]
+ break
+ elif j == n:
+ m1 = m2
+ m2 = arr1[0]
+ break
+ if arr1[i] <= arr2[j]:
+ m1 = m2
+ m2 = arr1[i]
+ i += 1
+ else:
+ m1 = m2
+ m2 = arr2[j]
+ j += 1
+ return (m1 + m2)/2
\ No newline at end of file diff --git a/progs/a210.py b/progs/a210.py new file mode 100644 index 0000000..4ee2eda --- /dev/null +++ b/progs/a210.py @@ -0,0 +1,3 @@ +def check_identical(test_list1, test_list2):
+ res = test_list1 == test_list2
+ return (res)
\ No newline at end of file diff --git a/progs/a211.py b/progs/a211.py new file mode 100644 index 0000000..ad0906e --- /dev/null +++ b/progs/a211.py @@ -0,0 +1,3 @@ +import re
+def road_rd(street):
+ return (re.sub('Road$', 'Rd.', street))
\ No newline at end of file diff --git a/progs/a212.py b/progs/a212.py new file mode 100644 index 0000000..2435e85 --- /dev/null +++ b/progs/a212.py @@ -0,0 +1,5 @@ +def string_length(str1):
+ count = 0
+ for char in str1:
+ count += 1
+ return count
\ No newline at end of file diff --git a/progs/a213.py b/progs/a213.py new file mode 100644 index 0000000..4647273 --- /dev/null +++ b/progs/a213.py @@ -0,0 +1,3 @@ +def rombus_area(p,q):
+ area=(p*q)/2
+ return area
\ No newline at end of file diff --git a/progs/a214.py b/progs/a214.py new file mode 100644 index 0000000..5d645c3 --- /dev/null +++ b/progs/a214.py @@ -0,0 +1,15 @@ +def sort_by_dnf(arr, n):
+ low=0
+ mid=0
+ high=n-1
+ while mid <= high:
+ if arr[mid] == 0:
+ arr[low], arr[mid] = arr[mid], arr[low]
+ low = low + 1
+ mid = mid + 1
+ elif arr[mid] == 1:
+ mid = mid + 1
+ else:
+ arr[mid], arr[high] = arr[high], arr[mid]
+ high = high - 1
+ return arr
\ No newline at end of file diff --git a/progs/a215.py b/progs/a215.py new file mode 100644 index 0000000..faafb1d --- /dev/null +++ b/progs/a215.py @@ -0,0 +1,5 @@ +def clear_tuple(test_tup):
+ temp = list(test_tup)
+ temp.clear()
+ test_tup = tuple(temp)
+ return (test_tup)
\ No newline at end of file diff --git a/progs/a217.py b/progs/a217.py new file mode 100644 index 0000000..1fa8090 --- /dev/null +++ b/progs/a217.py @@ -0,0 +1,5 @@ +def lower_ctr(str):
+ lower_ctr= 0
+ for i in range(len(str)):
+ if str[i] >= 'a' and str[i] <= 'z': lower_ctr += 1
+ return lower_ctr
\ No newline at end of file diff --git a/progs/a218.py b/progs/a218.py new file mode 100644 index 0000000..96ebefa --- /dev/null +++ b/progs/a218.py @@ -0,0 +1,16 @@ +def count_duplic(lists):
+ element = []
+ frequency = []
+ if not lists:
+ return element
+ running_count = 1
+ for i in range(len(lists)-1):
+ if lists[i] == lists[i+1]:
+ running_count += 1
+ else:
+ frequency.append(running_count)
+ element.append(lists[i])
+ running_count = 1
+ frequency.append(running_count)
+ element.append(lists[i+1])
+ return element,frequency
diff --git a/progs/a219.py b/progs/a219.py new file mode 100644 index 0000000..86c3447 --- /dev/null +++ b/progs/a219.py @@ -0,0 +1,5 @@ +def check_monthnum_number(monthnum1):
+ if monthnum1 == 2:
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a220.py b/progs/a220.py new file mode 100644 index 0000000..6db4614 --- /dev/null +++ b/progs/a220.py @@ -0,0 +1,4 @@ +import collections as ct
+def merge_dictionaries(dict1,dict2):
+ merged_dict = dict(ct.ChainMap({}, dict1, dict2))
+ return merged_dict
\ No newline at end of file diff --git a/progs/a221.py b/progs/a221.py new file mode 100644 index 0000000..db89f03 --- /dev/null +++ b/progs/a221.py @@ -0,0 +1,23 @@ +import re
+def pass_validity(p):
+ x = True
+ while x:
+ if (len(p)<6 or len(p)>12):
+ break
+ elif not re.search("[a-z]",p):
+ break
+ elif not re.search("[0-9]",p):
+ break
+ elif not re.search("[A-Z]",p):
+ break
+ elif not re.search("[$#@]",p):
+ break
+ elif re.search("\s",p):
+ break
+ else:
+ return True
+ x=False
+ break
+
+ if x:
+ return False
\ No newline at end of file diff --git a/progs/a222.py b/progs/a222.py new file mode 100644 index 0000000..84fff5e --- /dev/null +++ b/progs/a222.py @@ -0,0 +1,11 @@ +import re
+def check_substring(string, sample) :
+ if (sample in string):
+ y = "\A" + sample
+ x = re.search(y, string)
+ if x :
+ return ("string starts with the given substring")
+ else :
+ return ("string doesnt start with the given substring")
+ else :
+ return ("entered string isnt a substring")
\ No newline at end of file diff --git a/progs/a223.py b/progs/a223.py new file mode 100644 index 0000000..2f01158 --- /dev/null +++ b/progs/a223.py @@ -0,0 +1,5 @@ +def remove_even(l):
+ for i in l:
+ if i % 2 == 0:
+ l.remove(i)
+ return l
\ No newline at end of file diff --git a/progs/a224.py b/progs/a224.py new file mode 100644 index 0000000..5b3dbe3 --- /dev/null +++ b/progs/a224.py @@ -0,0 +1,3 @@ +def access_elements(nums, list_index):
+ result = [nums[i] for i in list_index]
+ return result
\ No newline at end of file diff --git a/progs/a225.py b/progs/a225.py new file mode 100644 index 0000000..4578fb5 --- /dev/null +++ b/progs/a225.py @@ -0,0 +1,10 @@ +def check_Type_Of_Triangle(a,b,c):
+ sqa = pow(a,2)
+ sqb = pow(b,2)
+ sqc = pow(c,2)
+ if (sqa == sqa + sqb or sqb == sqa + sqc or sqc == sqa + sqb):
+ return ("Right-angled Triangle")
+ elif (sqa > sqc + sqb or sqb > sqa + sqc or sqc > sqa + sqb):
+ return ("Obtuse-angled Triangle")
+ else:
+ return ("Acute-angled Triangle")
\ No newline at end of file diff --git a/progs/a226.py b/progs/a226.py new file mode 100644 index 0000000..1e92931 --- /dev/null +++ b/progs/a226.py @@ -0,0 +1,3 @@ +def sum_column(list1, C):
+ result = sum(row[C] for row in list1)
+ return result
\ No newline at end of file diff --git a/progs/a228.py b/progs/a228.py new file mode 100644 index 0000000..cc8171d --- /dev/null +++ b/progs/a228.py @@ -0,0 +1,9 @@ +from collections import Counter
+
+def second_frequent(input):
+ dict = Counter(input)
+ value = sorted(dict.values(), reverse=True)
+ second_large = value[1]
+ for (key, val) in dict.items():
+ if val == second_large:
+ return (key)
\ No newline at end of file diff --git a/progs/a229.py b/progs/a229.py new file mode 100644 index 0000000..202324e --- /dev/null +++ b/progs/a229.py @@ -0,0 +1,4 @@ +import math
+def round_up(a, digits):
+ n = 10**-digits
+ return round(math.ceil(a / n) * n, digits)
\ No newline at end of file diff --git a/progs/a23.py b/progs/a23.py new file mode 100644 index 0000000..31d0446 --- /dev/null +++ b/progs/a23.py @@ -0,0 +1,2 @@ +def is_upper(string):
+ return (string.upper())
\ No newline at end of file diff --git a/progs/a230.py b/progs/a230.py new file mode 100644 index 0000000..507faee --- /dev/null +++ b/progs/a230.py @@ -0,0 +1,7 @@ +def count_Pairs(arr,n):
+ cnt = 0;
+ for i in range(n):
+ for j in range(i + 1,n):
+ if (arr[i] == arr[j]):
+ cnt += 1;
+ return cnt;
\ No newline at end of file diff --git a/progs/a231.py b/progs/a231.py new file mode 100644 index 0000000..76fd7fd --- /dev/null +++ b/progs/a231.py @@ -0,0 +1,5 @@ +import re
+def extract_max(input):
+ numbers = re.findall('\d+',input)
+ numbers = map(int,numbers)
+ return max(numbers)
\ No newline at end of file diff --git a/progs/a232.py b/progs/a232.py new file mode 100644 index 0000000..f7e4d3c --- /dev/null +++ b/progs/a232.py @@ -0,0 +1,5 @@ +def get_key(dict):
+ list = []
+ for key in dict.keys():
+ list.append(key)
+ return list
\ No newline at end of file diff --git a/progs/a233.py b/progs/a233.py new file mode 100644 index 0000000..92bbaa7 --- /dev/null +++ b/progs/a233.py @@ -0,0 +1,29 @@ +def generate_matrix(n):
+ if n<=0:
+ return []
+ matrix=[row[:] for row in [[0]*n]*n]
+ row_st=0
+ row_ed=n-1
+ col_st=0
+ col_ed=n-1
+ current=1
+ while (True):
+ if current>n*n:
+ break
+ for c in range (col_st, col_ed+1):
+ matrix[row_st][c]=current
+ current+=1
+ row_st+=1
+ for r in range (row_st, row_ed+1):
+ matrix[r][col_ed]=current
+ current+=1
+ col_ed-=1
+ for c in range (col_ed, col_st-1, -1):
+ matrix[row_ed][c]=current
+ current+=1
+ row_ed-=1
+ for r in range (row_ed, row_st-1, -1):
+ matrix[r][col_st]=current
+ current+=1
+ col_st+=1
+ return matrix
\ No newline at end of file diff --git a/progs/a234.py b/progs/a234.py new file mode 100644 index 0000000..eaa9fed --- /dev/null +++ b/progs/a234.py @@ -0,0 +1,2 @@ +def slope(x1,y1,x2,y2):
+ return (float)(y2-y1)/(x2-x1)
\ No newline at end of file diff --git a/progs/a235.py b/progs/a235.py new file mode 100644 index 0000000..7f1aeeb --- /dev/null +++ b/progs/a235.py @@ -0,0 +1,17 @@ +from sys import maxsize
+def max_sub_array_sum(a,size):
+ max_so_far = -maxsize - 1
+ max_ending_here = 0
+ start = 0
+ end = 0
+ s = 0
+ for i in range(0,size):
+ max_ending_here += a[i]
+ if max_so_far < max_ending_here:
+ max_so_far = max_ending_here
+ start = s
+ end = i
+ if max_ending_here < 0:
+ max_ending_here = 0
+ s = i+1
+ return (end - start + 1)
\ No newline at end of file diff --git a/progs/a236.py b/progs/a236.py new file mode 100644 index 0000000..c9e2c41 --- /dev/null +++ b/progs/a236.py @@ -0,0 +1,5 @@ +def cube_Sum(n):
+ sum = 0
+ for i in range(0,n) :
+ sum += (2*i+1)*(2*i+1)*(2*i+1)
+ return sum
\ No newline at end of file diff --git a/progs/a237.py b/progs/a237.py new file mode 100644 index 0000000..db0b435 --- /dev/null +++ b/progs/a237.py @@ -0,0 +1,14 @@ +def min_Swaps(s1,s2) :
+ c0 = 0; c1 = 0;
+ for i in range(len(s1)) :
+ if (s1[i] == '0' and s2[i] == '1') :
+ c0 += 1;
+ elif (s1[i] == '1' and s2[i] == '0') :
+ c1 += 1;
+ result = c0 // 2 + c1 // 2;
+ if (c0 % 2 == 0 and c1 % 2 == 0) :
+ return result;
+ elif ((c0 + c1) % 2 == 0) :
+ return result + 2;
+ else :
+ return -1;
\ No newline at end of file diff --git a/progs/a238.py b/progs/a238.py new file mode 100644 index 0000000..33773f6 --- /dev/null +++ b/progs/a238.py @@ -0,0 +1,7 @@ +def sort_tuple(tup):
+ n = len(tup)
+ for i in range(n):
+ for j in range(n-i-1):
+ if tup[j][0] > tup[j + 1][0]:
+ tup[j], tup[j + 1] = tup[j + 1], tup[j]
+ return tup
\ No newline at end of file diff --git a/progs/a239.py b/progs/a239.py new file mode 100644 index 0000000..0e69e4d --- /dev/null +++ b/progs/a239.py @@ -0,0 +1,5 @@ +def Check_Solution(a,b,c):
+ if b == 0:
+ return ("Yes")
+ else:
+ return ("No")
\ No newline at end of file diff --git a/progs/a24.py b/progs/a24.py new file mode 100644 index 0000000..5f8bae7 --- /dev/null +++ b/progs/a24.py @@ -0,0 +1,6 @@ +def swap_List(newList):
+ size = len(newList)
+ temp = newList[0]
+ newList[0] = newList[size - 1]
+ newList[size - 1] = temp
+ return newList
\ No newline at end of file diff --git a/progs/a240.py b/progs/a240.py new file mode 100644 index 0000000..a5696ee --- /dev/null +++ b/progs/a240.py @@ -0,0 +1,7 @@ +def get_inv_count(arr, n):
+ inv_count = 0
+ for i in range(n):
+ for j in range(i + 1, n):
+ if (arr[i] > arr[j]):
+ inv_count += 1
+ return inv_count
\ No newline at end of file diff --git a/progs/a241.py b/progs/a241.py new file mode 100644 index 0000000..87b4697 --- /dev/null +++ b/progs/a241.py @@ -0,0 +1,9 @@ +def get_odd_occurence(arr, arr_size):
+ for i in range(0, arr_size):
+ count = 0
+ for j in range(0, arr_size):
+ if arr[i] == arr[j]:
+ count += 1
+ if (count % 2 != 0):
+ return arr[i]
+ return -1
\ No newline at end of file diff --git a/progs/a243.py b/progs/a243.py new file mode 100644 index 0000000..c928da6 --- /dev/null +++ b/progs/a243.py @@ -0,0 +1,14 @@ +def get_Number(n, k):
+ arr = [0] * n;
+ i = 0;
+ odd = 1;
+ while (odd <= n):
+ arr[i] = odd;
+ i += 1;
+ odd += 2;
+ even = 2;
+ while (even <= n):
+ arr[i] = even;
+ i += 1;
+ even += 2;
+ return arr[k - 1];
\ No newline at end of file diff --git a/progs/a244.py b/progs/a244.py new file mode 100644 index 0000000..016971c --- /dev/null +++ b/progs/a244.py @@ -0,0 +1,8 @@ +import math
+def find_Digits(n):
+ if (n < 0):
+ return 0;
+ if (n <= 1):
+ return 1;
+ x = ((n * math.log10(n / math.e) + math.log10(2 * math.pi * n) /2.0));
+ return math.floor(x) + 1;
\ No newline at end of file diff --git a/progs/a245.py b/progs/a245.py new file mode 100644 index 0000000..ec3d8d0 --- /dev/null +++ b/progs/a245.py @@ -0,0 +1,17 @@ +def find_platform(arr, dep, n):
+ arr.sort()
+ dep.sort()
+ plat_needed = 1
+ result = 1
+ i = 1
+ j = 0
+ while (i < n and j < n):
+ if (arr[i] <= dep[j]):
+ plat_needed+= 1
+ i+= 1
+ elif (arr[i] > dep[j]):
+ plat_needed-= 1
+ j+= 1
+ if (plat_needed > result):
+ result = plat_needed
+ return result
\ No newline at end of file diff --git a/progs/a246.py b/progs/a246.py new file mode 100644 index 0000000..bcaf20c --- /dev/null +++ b/progs/a246.py @@ -0,0 +1,2 @@ +def lcopy(xs): + return xs[:] diff --git a/progs/a247.py b/progs/a247.py new file mode 100644 index 0000000..8b70c3c --- /dev/null +++ b/progs/a247.py @@ -0,0 +1,3 @@ +def area_trapezium(base1,base2,height):
+ area = 0.5 * (base1 + base2) * height
+ return area
\ No newline at end of file diff --git a/progs/a248.py b/progs/a248.py new file mode 100644 index 0000000..7044948 --- /dev/null +++ b/progs/a248.py @@ -0,0 +1,7 @@ +def Sum(N):
+ SumOfPrimeDivisors = [0]*(N + 1)
+ for i in range(2,N + 1) :
+ if (SumOfPrimeDivisors[i] == 0) :
+ for j in range(i,N + 1,i) :
+ SumOfPrimeDivisors[j] += i
+ return SumOfPrimeDivisors[N]
\ No newline at end of file diff --git a/progs/a249.py b/progs/a249.py new file mode 100644 index 0000000..2bb9109 --- /dev/null +++ b/progs/a249.py @@ -0,0 +1,8 @@ +def is_triangleexists(a,b,c):
+ if(a != 0 and b != 0 and c != 0 and (a + b + c)== 180):
+ if((a + b)>= c or (b + c)>= a or (a + c)>= b):
+ return True
+ else:
+ return False
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a25.py b/progs/a25.py new file mode 100644 index 0000000..30674f9 --- /dev/null +++ b/progs/a25.py @@ -0,0 +1,4 @@ +def triangle_area(r) :
+ if r < 0 :
+ return -1
+ return r * r
\ No newline at end of file diff --git a/progs/a250.py b/progs/a250.py new file mode 100644 index 0000000..3065be4 --- /dev/null +++ b/progs/a250.py @@ -0,0 +1,3 @@ +def Sum_of_Inverse_Divisors(N,Sum):
+ ans = float(Sum)*1.0 /float(N);
+ return round(ans,2);
\ No newline at end of file diff --git a/progs/a251.py b/progs/a251.py new file mode 100644 index 0000000..d1259bd --- /dev/null +++ b/progs/a251.py @@ -0,0 +1,5 @@ +def remove_negs(num_list):
+ for item in num_list:
+ if item < 0:
+ num_list.remove(item)
+ return num_list
\ No newline at end of file diff --git a/progs/a252.py b/progs/a252.py new file mode 100644 index 0000000..7631885 --- /dev/null +++ b/progs/a252.py @@ -0,0 +1,18 @@ +import math
+def sum_of_odd_Factors(n):
+ res = 1
+ while n % 2 == 0:
+ n = n // 2
+ for i in range(3,int(math.sqrt(n) + 1)):
+ count = 0
+ curr_sum = 1
+ curr_term = 1
+ while n % i == 0:
+ count+=1
+ n = n // i
+ curr_term *= i
+ curr_sum += curr_term
+ res *= curr_sum
+ if n >= 2:
+ res *= (1 + n)
+ return res
\ No newline at end of file diff --git a/progs/a253.py b/progs/a253.py new file mode 100644 index 0000000..8a3f4d6 --- /dev/null +++ b/progs/a253.py @@ -0,0 +1,4 @@ +import heapq as hq
+def raw_heap(rawheap):
+ hq.heapify(rawheap)
+ return rawheap
\ No newline at end of file diff --git a/progs/a254.py b/progs/a254.py new file mode 100644 index 0000000..0a18f68 --- /dev/null +++ b/progs/a254.py @@ -0,0 +1,9 @@ +def check_Even_Parity(x):
+ parity = 0
+ while (x != 0):
+ x = x & (x - 1)
+ parity += 1
+ if (parity % 2 == 0):
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a255.py b/progs/a255.py new file mode 100644 index 0000000..5b44c24 --- /dev/null +++ b/progs/a255.py @@ -0,0 +1,12 @@ +def find_Min_Swaps(arr,n) :
+ noOfZeroes = [0] * n
+ count = 0
+ noOfZeroes[n - 1] = 1 - arr[n - 1]
+ for i in range(n-2,-1,-1) :
+ noOfZeroes[i] = noOfZeroes[i + 1]
+ if (arr[i] == 0) :
+ noOfZeroes[i] = noOfZeroes[i] + 1
+ for i in range(0,n) :
+ if (arr[i] == 1) :
+ count = count + noOfZeroes[i]
+ return count
\ No newline at end of file diff --git a/progs/a256.py b/progs/a256.py new file mode 100644 index 0000000..14349d5 --- /dev/null +++ b/progs/a256.py @@ -0,0 +1,3 @@ +def listify_list(list1):
+ result = list(map(list,list1))
+ return result
\ No newline at end of file diff --git a/progs/a257.py b/progs/a257.py new file mode 100644 index 0000000..e8278cd --- /dev/null +++ b/progs/a257.py @@ -0,0 +1,2 @@ +def count_list(input_list):
+ return (len(input_list))**2
\ No newline at end of file diff --git a/progs/a258.py b/progs/a258.py new file mode 100644 index 0000000..991e8f6 --- /dev/null +++ b/progs/a258.py @@ -0,0 +1,8 @@ +from itertools import combinations
+def sub_lists(my_list):
+ subs = []
+ for i in range(0, len(my_list)+1):
+ temp = [list(x) for x in combinations(my_list, i)]
+ if len(temp)>0:
+ subs.extend(temp)
+ return subs
\ No newline at end of file diff --git a/progs/a259.py b/progs/a259.py new file mode 100644 index 0000000..1f54c7a --- /dev/null +++ b/progs/a259.py @@ -0,0 +1,7 @@ +import re
+regex = '[a-zA-z0-9]$'
+def check_alphanumeric(string):
+ if(re.search(regex, string)):
+ return ("Accept")
+ else:
+ return ("Discard")
\ No newline at end of file diff --git a/progs/a26.py b/progs/a26.py new file mode 100644 index 0000000..9a4a36f --- /dev/null +++ b/progs/a26.py @@ -0,0 +1,9 @@ +def find_First_Missing(array,start,end):
+ if (start > end):
+ return end + 1
+ if (start != array[start]):
+ return start;
+ mid = int((start + end) / 2)
+ if (array[mid] == mid):
+ return find_First_Missing(array,mid+1,end)
+ return find_First_Missing(array,start,mid)
\ No newline at end of file diff --git a/progs/a261.py b/progs/a261.py new file mode 100644 index 0000000..b5592b1 --- /dev/null +++ b/progs/a261.py @@ -0,0 +1,6 @@ +from collections import Counter
+import re
+def n_common_words(text,n):
+ words = re.findall('\w+',text)
+ n_common_words= Counter(words).most_common(n)
+ return list(n_common_words)
\ No newline at end of file diff --git a/progs/a262.py b/progs/a262.py new file mode 100644 index 0000000..dd4220b --- /dev/null +++ b/progs/a262.py @@ -0,0 +1,16 @@ +def find_longest_conseq_subseq(arr, n):
+ ans = 0
+ count = 0
+ arr.sort()
+ v = []
+ v.append(arr[0])
+ for i in range(1, n):
+ if (arr[i] != arr[i - 1]):
+ v.append(arr[i])
+ for i in range(len(v)):
+ if (i > 0 and v[i] == v[i - 1] + 1):
+ count += 1
+ else:
+ count = 1
+ ans = max(ans, count)
+ return ans
\ No newline at end of file diff --git a/progs/a265.py b/progs/a265.py new file mode 100644 index 0000000..51972ac --- /dev/null +++ b/progs/a265.py @@ -0,0 +1,5 @@ +def check_monthnumb(monthname2):
+ if(monthname2=="January" or monthname2=="March"or monthname2=="May" or monthname2=="July" or monthname2=="Augest" or monthname2=="October" or monthname2=="December"):
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a266.py b/progs/a266.py new file mode 100644 index 0000000..5712284 --- /dev/null +++ b/progs/a266.py @@ -0,0 +1,8 @@ +def min_Num(arr,n):
+ odd = 0
+ for i in range(n):
+ if (arr[i] % 2):
+ odd += 1
+ if (odd % 2):
+ return 1
+ return 2
\ No newline at end of file diff --git a/progs/a267.py b/progs/a267.py new file mode 100644 index 0000000..6ef029a --- /dev/null +++ b/progs/a267.py @@ -0,0 +1,9 @@ +def length_Of_Last_Word(a):
+ l = 0
+ x = a.strip()
+ for i in range(len(x)):
+ if x[i] == " ":
+ l = 0
+ else:
+ l += 1
+ return l
\ No newline at end of file diff --git a/progs/a268.py b/progs/a268.py new file mode 100644 index 0000000..8ef2850 --- /dev/null +++ b/progs/a268.py @@ -0,0 +1,3 @@ +def remove_list_range(list1, leftrange, rigthrange):
+ result = [i for i in list1 if (min(i)>=leftrange and max(i)<=rigthrange)]
+ return result
\ No newline at end of file diff --git a/progs/a27.py b/progs/a27.py new file mode 100644 index 0000000..9ebafac --- /dev/null +++ b/progs/a27.py @@ -0,0 +1,22 @@ +MAX=1000;
+def replace_spaces(string):
+ string=string.strip()
+ i=len(string)
+ space_count=string.count(' ')
+ new_length = i + space_count*2
+ if new_length > MAX:
+ return -1
+ index = new_length-1
+ string=list(string)
+ for f in range(i-2, new_length-2):
+ string.append('0')
+ for j in range(i-1, 0, -1):
+ if string[j] == ' ':
+ string[index] = '0'
+ string[index-1] = '2'
+ string[index-2] = '%'
+ index=index-3
+ else:
+ string[index] = string[j]
+ index -= 1
+ return ''.join(string)
\ No newline at end of file diff --git a/progs/a270.py b/progs/a270.py new file mode 100644 index 0000000..02c486c --- /dev/null +++ b/progs/a270.py @@ -0,0 +1,11 @@ +def are_Rotations(string1,string2):
+ size1 = len(string1)
+ size2 = len(string2)
+ temp = ''
+ if size1 != size2:
+ return False
+ temp = string1 + string1
+ if (temp.count(string2)> 0):
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a271.py b/progs/a271.py new file mode 100644 index 0000000..4d762f7 --- /dev/null +++ b/progs/a271.py @@ -0,0 +1,2 @@ +def check_subset(list1,list2):
+ return all(map(list1.__contains__,list2))
\ No newline at end of file diff --git a/progs/a272.py b/progs/a272.py new file mode 100644 index 0000000..1f59edd --- /dev/null +++ b/progs/a272.py @@ -0,0 +1,5 @@ +def fibonacci(n):
+ if n == 1 or n == 2:
+ return 1
+ else:
+ return (fibonacci(n - 1) + (fibonacci(n - 2)))
\ No newline at end of file diff --git a/progs/a273.py b/progs/a273.py new file mode 100644 index 0000000..e6682bd --- /dev/null +++ b/progs/a273.py @@ -0,0 +1,9 @@ +def check_Concat(str1,str2):
+ N = len(str1)
+ M = len(str2)
+ if (N % M != 0):
+ return False
+ for i in range(N):
+ if (str1[i] != str2[i % M]):
+ return False
+ return True
\ No newline at end of file diff --git a/progs/a274.py b/progs/a274.py new file mode 100644 index 0000000..bdfbc1d --- /dev/null +++ b/progs/a274.py @@ -0,0 +1,4 @@ +def min_difference(test_list):
+ temp = [abs(b - a) for a, b in test_list]
+ res = min(temp)
+ return (res)
\ No newline at end of file diff --git a/progs/a275.py b/progs/a275.py new file mode 100644 index 0000000..4d22303 --- /dev/null +++ b/progs/a275.py @@ -0,0 +1,11 @@ +def lcm(x, y):
+ if x > y:
+ z = x
+ else:
+ z = y
+ while(True):
+ if((z % x == 0) and (z % y == 0)):
+ lcm = z
+ break
+ z += 1
+ return lcm
\ No newline at end of file diff --git a/progs/a276.py b/progs/a276.py new file mode 100644 index 0000000..b0b9702 --- /dev/null +++ b/progs/a276.py @@ -0,0 +1,3 @@ +def sort_String(str) :
+ str = ''.join(sorted(str))
+ return (str)
\ No newline at end of file diff --git a/progs/a277.py b/progs/a277.py new file mode 100644 index 0000000..0f01baa --- /dev/null +++ b/progs/a277.py @@ -0,0 +1,3 @@ +def check_tuples(test_tuple, K):
+ res = all(ele in K for ele in test_tuple)
+ return (res)
\ No newline at end of file diff --git a/progs/a278.py b/progs/a278.py new file mode 100644 index 0000000..f527bc9 --- /dev/null +++ b/progs/a278.py @@ -0,0 +1,7 @@ +import re
+def text_match(text):
+ patterns = 'a.*?b$'
+ if re.search(patterns, text):
+ return ('Found a match!')
+ else:
+ return ('Not matched!')
\ No newline at end of file diff --git a/progs/a279.py b/progs/a279.py new file mode 100644 index 0000000..11ac149 --- /dev/null +++ b/progs/a279.py @@ -0,0 +1,7 @@ +def Check_Solution(a,b,c) :
+ if ((b*b) - (4*a*c)) > 0 :
+ return ("2 solutions")
+ elif ((b*b) - (4*a*c)) == 0 :
+ return ("1 solution")
+ else :
+ return ("No solutions")
\ No newline at end of file diff --git a/progs/a28.py b/progs/a28.py new file mode 100644 index 0000000..36453f9 --- /dev/null +++ b/progs/a28.py @@ -0,0 +1,6 @@ +def Split(list):
+ ev_li = []
+ for i in list:
+ if (i % 2 == 0):
+ ev_li.append(i)
+ return ev_li
\ No newline at end of file diff --git a/progs/a280.py b/progs/a280.py new file mode 100644 index 0000000..40eab81 --- /dev/null +++ b/progs/a280.py @@ -0,0 +1,4 @@ +def sum_even_odd(list1):
+ first_even = next((el for el in list1 if el%2==0),-1)
+ first_odd = next((el for el in list1 if el%2!=0),-1)
+ return (first_even+first_odd)
\ No newline at end of file diff --git a/progs/a281.py b/progs/a281.py new file mode 100644 index 0000000..123fbc8 --- /dev/null +++ b/progs/a281.py @@ -0,0 +1,3 @@ +def parallelogram_perimeter(b,h):
+ perimeter=2*(b*h)
+ return perimeter
\ No newline at end of file diff --git a/progs/a283.py b/progs/a283.py new file mode 100644 index 0000000..dc0e112 --- /dev/null +++ b/progs/a283.py @@ -0,0 +1,6 @@ +def all_Bits_Set_In_The_Given_Range(n,l,r):
+ num = ((1 << r) - 1) ^ ((1 << (l - 1)) - 1)
+ new_num = n & num
+ if (num == new_num):
+ return True
+ return False
\ No newline at end of file diff --git a/progs/a284.py b/progs/a284.py new file mode 100644 index 0000000..b69395b --- /dev/null +++ b/progs/a284.py @@ -0,0 +1,11 @@ +def is_Isomorphic(str1,str2):
+ dict_str1 = {}
+ dict_str2 = {}
+ for i, value in enumerate(str1):
+ dict_str1[value] = dict_str1.get(value,[]) + [i]
+ for j, value in enumerate(str2):
+ dict_str2[value] = dict_str2.get(value,[]) + [j]
+ if sorted(dict_str1.values()) == sorted(dict_str2.values()):
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a285.py b/progs/a285.py new file mode 100644 index 0000000..86ba91e --- /dev/null +++ b/progs/a285.py @@ -0,0 +1,5 @@ +def sum_num(numbers):
+ total = 0
+ for x in numbers:
+ total += x
+ return total/len(numbers)
\ No newline at end of file diff --git a/progs/a286.py b/progs/a286.py new file mode 100644 index 0000000..d16a073 --- /dev/null +++ b/progs/a286.py @@ -0,0 +1,5 @@ +def is_odd(n) :
+ if (n^1 == n-1) :
+ return True;
+ else :
+ return False;
\ No newline at end of file diff --git a/progs/a287.py b/progs/a287.py new file mode 100644 index 0000000..821e927 --- /dev/null +++ b/progs/a287.py @@ -0,0 +1,4 @@ +def substract_elements(test_tup1, test_tup2):
+ res = tuple(tuple(a - b for a, b in zip(tup1, tup2))
+ for tup1, tup2 in zip(test_tup1, test_tup2))
+ return (res)
\ No newline at end of file diff --git a/progs/a288.py b/progs/a288.py new file mode 100644 index 0000000..e0b3181 --- /dev/null +++ b/progs/a288.py @@ -0,0 +1,4 @@ +def reverse_list_lists(lists):
+ for l in lists:
+ l.sort(reverse = True)
+ return lists
\ No newline at end of file diff --git a/progs/a289.py b/progs/a289.py new file mode 100644 index 0000000..058cdca --- /dev/null +++ b/progs/a289.py @@ -0,0 +1,5 @@ +def find_Extra(arr1,arr2,n) :
+ for i in range(0, n) :
+ if (arr1[i] != arr2[i]) :
+ return i
+ return n
\ No newline at end of file diff --git a/progs/a290.py b/progs/a290.py new file mode 100644 index 0000000..98bab92 --- /dev/null +++ b/progs/a290.py @@ -0,0 +1,7 @@ +def same_Length(A,B):
+ while (A > 0 and B > 0):
+ A = A / 10;
+ B = B / 10;
+ if (A == 0 and B == 0):
+ return True;
+ return False;
\ No newline at end of file diff --git a/progs/a291.py b/progs/a291.py new file mode 100644 index 0000000..9bc037f --- /dev/null +++ b/progs/a291.py @@ -0,0 +1,3 @@ +import re
+def remove_spaces(text):
+ return (re.sub(' +',' ',text))
\ No newline at end of file diff --git a/progs/a292.py b/progs/a292.py new file mode 100644 index 0000000..3230284 --- /dev/null +++ b/progs/a292.py @@ -0,0 +1,2 @@ +def Extract(lst):
+ return [item[-1] for item in lst]
\ No newline at end of file diff --git a/progs/a293.py b/progs/a293.py new file mode 100644 index 0000000..406a267 --- /dev/null +++ b/progs/a293.py @@ -0,0 +1,3 @@ +def float_to_tuple(test_str):
+ res = tuple(map(float, test_str.split(', ')))
+ return (res)
\ No newline at end of file diff --git a/progs/a294.py b/progs/a294.py new file mode 100644 index 0000000..cafc3e7 --- /dev/null +++ b/progs/a294.py @@ -0,0 +1,11 @@ +def max_sum_subseq(A):
+ n = len(A)
+ if n == 1:
+ return A[0]
+ look_up = [None] * n
+ look_up[0] = A[0]
+ look_up[1] = max(A[0], A[1])
+ for i in range(2, n):
+ look_up[i] = max(look_up[i - 1], look_up[i - 2] + A[i])
+ look_up[i] = max(look_up[i], A[i])
+ return look_up[n - 1]
\ No newline at end of file diff --git a/progs/a295.py b/progs/a295.py new file mode 100644 index 0000000..7a18a0c --- /dev/null +++ b/progs/a295.py @@ -0,0 +1,4 @@ +def last(n):
+ return n[-1]
+def sort_list_last(tuples):
+ return sorted(tuples, key=last)
\ No newline at end of file diff --git a/progs/a296.py b/progs/a296.py new file mode 100644 index 0000000..b4da731 --- /dev/null +++ b/progs/a296.py @@ -0,0 +1,6 @@ +def is_Word_Present(sentence,word):
+ s = sentence.split(" ")
+ for i in s:
+ if (i == word):
+ return True
+ return False
\ No newline at end of file diff --git a/progs/a297.py b/progs/a297.py new file mode 100644 index 0000000..8fc6032 --- /dev/null +++ b/progs/a297.py @@ -0,0 +1,4 @@ +from itertools import groupby
+def extract_elements(numbers, n):
+ result = [i for i, j in groupby(numbers) if len(list(j)) == n]
+ return result
\ No newline at end of file diff --git a/progs/a298.py b/progs/a298.py new file mode 100644 index 0000000..a42caf4 --- /dev/null +++ b/progs/a298.py @@ -0,0 +1,8 @@ +def check(arr,n):
+ g = 0
+ for i in range(1,n):
+ if (arr[i] - arr[i - 1] > 0 and g == 1):
+ return False
+ if (arr[i] - arr[i] < 0):
+ g = 1
+ return True
\ No newline at end of file diff --git a/progs/a3.py b/progs/a3.py new file mode 100644 index 0000000..3938b7a --- /dev/null +++ b/progs/a3.py @@ -0,0 +1,2 @@ +def reverse_words(s):
+ return ' '.join(reversed(s.split()))
\ No newline at end of file diff --git a/progs/a30.py b/progs/a30.py new file mode 100644 index 0000000..f67ff9e --- /dev/null +++ b/progs/a30.py @@ -0,0 +1,7 @@ +import re
+text = 'Python Exercises'
+def replace_spaces(text):
+ text =text.replace (" ", "_")
+ return (text)
+ text =text.replace ("_", " ")
+ return (text)
\ No newline at end of file diff --git a/progs/a300.py b/progs/a300.py new file mode 100644 index 0000000..46b0b05 --- /dev/null +++ b/progs/a300.py @@ -0,0 +1,12 @@ +def smallest_multiple(n):
+ if (n<=2):
+ return n
+ i = n * 2
+ factors = [number for number in range(n, 1, -1) if number * 2 > n]
+ while True:
+ for a in factors:
+ if i % a != 0:
+ i += n
+ break
+ if (a == factors[-1] and i % a == 0):
+ return i
\ No newline at end of file diff --git a/progs/a301.py b/progs/a301.py new file mode 100644 index 0000000..8585627 --- /dev/null +++ b/progs/a301.py @@ -0,0 +1,4 @@ +from collections import Counter
+def add_dict(d1,d2):
+ add_dict = Counter(d1) + Counter(d2)
+ return add_dict
\ No newline at end of file diff --git a/progs/a302.py b/progs/a302.py new file mode 100644 index 0000000..b8c8c7c --- /dev/null +++ b/progs/a302.py @@ -0,0 +1,9 @@ +def count_Unset_Bits(n) :
+ cnt = 0;
+ for i in range(1,n + 1) :
+ temp = i;
+ while (temp) :
+ if (temp % 2 == 0) :
+ cnt += 1;
+ temp = temp // 2;
+ return cnt;
\ No newline at end of file diff --git a/progs/a303.py b/progs/a303.py new file mode 100644 index 0000000..5a68147 --- /dev/null +++ b/progs/a303.py @@ -0,0 +1,5 @@ +def even_num(x):
+ if x%2==0:
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a304.py b/progs/a304.py new file mode 100644 index 0000000..06d4c9b --- /dev/null +++ b/progs/a304.py @@ -0,0 +1,7 @@ +def factorial(start,end):
+ res = 1
+ for i in range(start,end + 1):
+ res *= i
+ return res
+def sum_of_square(n):
+ return int(factorial(n + 1, 2 * n) /factorial(1, n))
\ No newline at end of file diff --git a/progs/a306.py b/progs/a306.py new file mode 100644 index 0000000..bd19290 --- /dev/null +++ b/progs/a306.py @@ -0,0 +1,5 @@ +def lucky_num(n):
+ List=range(-1,n*n+9,2)
+ i=2
+ while List[i:]:List=sorted(set(List)-set(List[List[i]::List[i]]));i+=1
+ return List[1:n+1]
\ No newline at end of file diff --git a/progs/a307.py b/progs/a307.py new file mode 100644 index 0000000..98e7e7e --- /dev/null +++ b/progs/a307.py @@ -0,0 +1,5 @@ +def find_fixed_point(arr, n):
+ for i in range(n):
+ if arr[i] is i:
+ return i
+ return -1
\ No newline at end of file diff --git a/progs/a308.py b/progs/a308.py new file mode 100644 index 0000000..dfb3630 --- /dev/null +++ b/progs/a308.py @@ -0,0 +1,4 @@ +def previous_palindrome(num):
+ for x in range(num-1,0,-1):
+ if str(x) == str(x)[::-1]:
+ return x
\ No newline at end of file diff --git a/progs/a31.py b/progs/a31.py new file mode 100644 index 0000000..85a4db1 --- /dev/null +++ b/progs/a31.py @@ -0,0 +1,5 @@ +def move_zero(num_list):
+ a = [0 for i in range(num_list.count(0))]
+ x = [ i for i in num_list if i != 0]
+ x.extend(a)
+ return (x)
\ No newline at end of file diff --git a/progs/a310.py b/progs/a310.py new file mode 100644 index 0000000..09962eb --- /dev/null +++ b/progs/a310.py @@ -0,0 +1,4 @@ +def maximum_product(nums):
+ import heapq
+ a, b = heapq.nlargest(3, nums), heapq.nsmallest(2, nums)
+ return max(a[0] * a[1] * a[2], a[0] * b[0] * b[1])
\ No newline at end of file diff --git a/progs/a311.py b/progs/a311.py new file mode 100644 index 0000000..aafdf9c --- /dev/null +++ b/progs/a311.py @@ -0,0 +1,15 @@ +def binomial_coeff(n, k):
+ C = [[0 for j in range(k + 1)]
+ for i in range(n + 1)]
+ for i in range(0, n + 1):
+ for j in range(0, min(i, k) + 1):
+ if (j == 0 or j == i):
+ C[i][j] = 1
+ else:
+ C[i][j] = (C[i - 1][j - 1]
+ + C[i - 1][j])
+ return C[n][k]
+def lobb_num(n, m):
+ return (((2 * m + 1) *
+ binomial_coeff(2 * n, m + n))
+ / (m + n + 1))
\ No newline at end of file diff --git a/progs/a313.py b/progs/a313.py new file mode 100644 index 0000000..a97767d --- /dev/null +++ b/progs/a313.py @@ -0,0 +1,7 @@ +def is_Two_Alter(s):
+ for i in range (len( s) - 2) :
+ if (s[i] != s[i + 2]) :
+ return False
+ if (s[0] == s[1]):
+ return False
+ return True
\ No newline at end of file diff --git a/progs/a315.py b/progs/a315.py new file mode 100644 index 0000000..6a79458 --- /dev/null +++ b/progs/a315.py @@ -0,0 +1,8 @@ +def find_triplet_array(A, arr_size, sum):
+ for i in range( 0, arr_size-2):
+ for j in range(i + 1, arr_size-1):
+ for k in range(j + 1, arr_size):
+ if A[i] + A[j] + A[k] == sum:
+ return A[i],A[j],A[k]
+ return True
+ return False
\ No newline at end of file diff --git a/progs/a316.py b/progs/a316.py new file mode 100644 index 0000000..728423f --- /dev/null +++ b/progs/a316.py @@ -0,0 +1,7 @@ +import re
+def text_uppercase_lowercase(text):
+ patterns = '[A-Z]+[a-z]+$'
+ if re.search(patterns, text):
+ return 'Found a match!'
+ else:
+ return ('Not matched!')
\ No newline at end of file diff --git a/progs/a317.py b/progs/a317.py new file mode 100644 index 0000000..fd8b236 --- /dev/null +++ b/progs/a317.py @@ -0,0 +1,10 @@ +def coin_change(S, m, n):
+ table = [[0 for x in range(m)] for x in range(n+1)]
+ for i in range(m):
+ table[0][i] = 1
+ for i in range(1, n+1):
+ for j in range(m):
+ x = table[i - S[j]][j] if i-S[j] >= 0 else 0
+ y = table[i][j-1] if j >= 1 else 0
+ table[i][j] = x + y
+ return table[n][m-1]
\ No newline at end of file diff --git a/progs/a318.py b/progs/a318.py new file mode 100644 index 0000000..1af0324 --- /dev/null +++ b/progs/a318.py @@ -0,0 +1,5 @@ +def multiply_list(items):
+ tot = 1
+ for x in items:
+ tot *= x
+ return tot
\ No newline at end of file diff --git a/progs/a319.py b/progs/a319.py new file mode 100644 index 0000000..670d11a --- /dev/null +++ b/progs/a319.py @@ -0,0 +1,3 @@ +def remove_tuple(test_list):
+ res = [sub for sub in test_list if not all(ele == None for ele in sub)]
+ return (str(res))
\ No newline at end of file diff --git a/progs/a32.py b/progs/a32.py new file mode 100644 index 0000000..a29e4da --- /dev/null +++ b/progs/a32.py @@ -0,0 +1,6 @@ +def pair_OR_Sum(arr,n) :
+ ans = 0
+ for i in range(0,n) :
+ for j in range(i + 1,n) :
+ ans = ans + (arr[i] ^ arr[j])
+ return ans
\ No newline at end of file diff --git a/progs/a320.py b/progs/a320.py new file mode 100644 index 0000000..b89f995 --- /dev/null +++ b/progs/a320.py @@ -0,0 +1,3 @@ +def chunk_tuples(test_tup, N):
+ res = [test_tup[i : i + N] for i in range(0, len(test_tup), N)]
+ return (res)
\ No newline at end of file diff --git a/progs/a321.py b/progs/a321.py new file mode 100644 index 0000000..35bcf86 --- /dev/null +++ b/progs/a321.py @@ -0,0 +1,10 @@ +def max_product(arr):
+ arr_len = len(arr)
+ if (arr_len < 2):
+ return None
+ x = arr[0]; y = arr[1]
+ for i in range(0, arr_len):
+ for j in range(i + 1, arr_len):
+ if (arr[i] * arr[j] > x * y):
+ x = arr[i]; y = arr[j]
+ return x,y
\ No newline at end of file diff --git a/progs/a322.py b/progs/a322.py new file mode 100644 index 0000000..9e70169 --- /dev/null +++ b/progs/a322.py @@ -0,0 +1,8 @@ +def super_seq(X, Y, m, n):
+ if (not m):
+ return n
+ if (not n):
+ return m
+ if (X[m - 1] == Y[n - 1]):
+ return 1 + super_seq(X, Y, m - 1, n - 1)
+ return 1 + min(super_seq(X, Y, m - 1, n), super_seq(X, Y, m, n - 1))
\ No newline at end of file diff --git a/progs/a323.py b/progs/a323.py new file mode 100644 index 0000000..d2f04c7 --- /dev/null +++ b/progs/a323.py @@ -0,0 +1,4 @@ +def max_of_two( x, y ):
+ if x > y:
+ return x
+ return y
\ No newline at end of file diff --git a/progs/a324.py b/progs/a324.py new file mode 100644 index 0000000..6c73af4 --- /dev/null +++ b/progs/a324.py @@ -0,0 +1,6 @@ +def mutiple_tuple(nums):
+ temp = list(nums)
+ product = 1
+ for x in temp:
+ product *= x
+ return product
\ No newline at end of file diff --git a/progs/a325.py b/progs/a325.py new file mode 100644 index 0000000..aaf56a5 --- /dev/null +++ b/progs/a325.py @@ -0,0 +1,13 @@ +def binomial_coeffi(n, k):
+ if (k == 0 or k == n):
+ return 1
+ return (binomial_coeffi(n - 1, k - 1)
+ + binomial_coeffi(n - 1, k))
+def rencontres_number(n, m):
+ if (n == 0 and m == 0):
+ return 1
+ if (n == 1 and m == 0):
+ return 0
+ if (m == 0):
+ return ((n - 1) * (rencontres_number(n - 1, 0)+ rencontres_number(n - 2, 0)))
+ return (binomial_coeffi(n, m) * rencontres_number(n - m, 0))
\ No newline at end of file diff --git a/progs/a328.py b/progs/a328.py new file mode 100644 index 0000000..1092955 --- /dev/null +++ b/progs/a328.py @@ -0,0 +1,3 @@ +def count_tuplex(tuplex,value):
+ count = tuplex.count(value)
+ return count
\ No newline at end of file diff --git a/progs/a329.py b/progs/a329.py new file mode 100644 index 0000000..52e24d9 --- /dev/null +++ b/progs/a329.py @@ -0,0 +1,7 @@ +import re
+def text_match(text):
+ patterns = 'ab*?'
+ if re.search(patterns, text):
+ return ('Found a match!')
+ else:
+ return ('Not matched!')
\ No newline at end of file diff --git a/progs/a33.py b/progs/a33.py new file mode 100644 index 0000000..77b4c3e --- /dev/null +++ b/progs/a33.py @@ -0,0 +1,6 @@ +def even_Power_Sum(n):
+ sum = 0;
+ for i in range(1,n + 1):
+ j = 2*i;
+ sum = sum + (j*j*j*j);
+ return sum;
\ No newline at end of file diff --git a/progs/a330.py b/progs/a330.py new file mode 100644 index 0000000..049a415 --- /dev/null +++ b/progs/a330.py @@ -0,0 +1,5 @@ +import math
+def sum_series(number):
+ total = 0
+ total = math.pow((number * (number + 1)) /2, 2)
+ return total
\ No newline at end of file diff --git a/progs/a331.py b/progs/a331.py new file mode 100644 index 0000000..1a150e4 --- /dev/null +++ b/progs/a331.py @@ -0,0 +1,6 @@ +def remove_duplic_list(l):
+ temp = []
+ for x in l:
+ if x not in temp:
+ temp.append(x)
+ return temp
\ No newline at end of file diff --git a/progs/a333.py b/progs/a333.py new file mode 100644 index 0000000..aa38d2b --- /dev/null +++ b/progs/a333.py @@ -0,0 +1,4 @@ +def dealnnoy_num(n, m):
+ if (m == 0 or n == 0) :
+ return 1
+ return dealnnoy_num(m - 1, n) + dealnnoy_num(m - 1, n - 1) + dealnnoy_num(m, n - 1)
\ No newline at end of file diff --git a/progs/a334.py b/progs/a334.py new file mode 100644 index 0000000..b481a67 --- /dev/null +++ b/progs/a334.py @@ -0,0 +1,4 @@ +def series_sum(number):
+ total = 0
+ total = (number * (number + 1) * (2 * number + 1)) / 6
+ return total
\ No newline at end of file diff --git a/progs/a335.py b/progs/a335.py new file mode 100644 index 0000000..d6baf7d --- /dev/null +++ b/progs/a335.py @@ -0,0 +1,4 @@ +def re_arrange_tuples(test_list, ord_list):
+ temp = dict(test_list)
+ res = [(key, temp[key]) for key in ord_list]
+ return (res)
\ No newline at end of file diff --git a/progs/a336.py b/progs/a336.py new file mode 100644 index 0000000..7735d02 --- /dev/null +++ b/progs/a336.py @@ -0,0 +1,5 @@ +from collections import Counter
+def max_char(str1):
+ temp = Counter(str1)
+ max_char = max(temp, key = temp.get)
+ return max_char
\ No newline at end of file diff --git a/progs/a337.py b/progs/a337.py new file mode 100644 index 0000000..ca3e3bd --- /dev/null +++ b/progs/a337.py @@ -0,0 +1,27 @@ +import sys
+
+def find_closet(A, B, C, p, q, r):
+ diff = sys.maxsize
+ res_i = 0
+ res_j = 0
+ res_k = 0
+ i = 0
+ j = 0
+ k = 0
+ while(i < p and j < q and k < r):
+ minimum = min(A[i], min(B[j], C[k]))
+ maximum = max(A[i], max(B[j], C[k]));
+ if maximum-minimum < diff:
+ res_i = i
+ res_j = j
+ res_k = k
+ diff = maximum - minimum;
+ if diff == 0:
+ break
+ if A[i] == minimum:
+ i = i+1
+ elif B[j] == minimum:
+ j = j+1
+ else:
+ k = k+1
+ return A[res_i],B[res_j],C[res_k]
\ No newline at end of file diff --git a/progs/a339.py b/progs/a339.py new file mode 100644 index 0000000..9a57403 --- /dev/null +++ b/progs/a339.py @@ -0,0 +1,25 @@ +def heap_sort(arr):
+ heapify(arr)
+ end = len(arr) - 1
+ while end > 0:
+ arr[end], arr[0] = arr[0], arr[end]
+ shift_down(arr, 0, end - 1)
+ end -= 1
+ return arr
+
+def heapify(arr):
+ start = len(arr) // 2
+ while start >= 0:
+ shift_down(arr, start, len(arr) - 1)
+ start -= 1
+def shift_down(arr, start, end):
+ root = start
+ while root * 2 + 1 <= end:
+ child = root * 2 + 1
+ if child + 1 <= end and arr[child] < arr[child + 1]:
+ child += 1
+ if child <= end and arr[root] < arr[child]:
+ arr[root], arr[child] = arr[child], arr[root]
+ root = child
+ else:
+ return
diff --git a/progs/a34.py b/progs/a34.py new file mode 100644 index 0000000..b3b4db3 --- /dev/null +++ b/progs/a34.py @@ -0,0 +1,6 @@ +import heapq as hq
+def heap_sort(iterable):
+ h = []
+ for value in iterable:
+ hq.heappush(h, value)
+ return [hq.heappop(h) for i in range(len(h))]
\ No newline at end of file diff --git a/progs/a340.py b/progs/a340.py new file mode 100644 index 0000000..1bde7c2 --- /dev/null +++ b/progs/a340.py @@ -0,0 +1,7 @@ +def count_elim(num):
+ count_elim = 0
+ for n in num:
+ if isinstance(n, tuple):
+ break
+ count_elim += 1
+ return count_elim
\ No newline at end of file diff --git a/progs/a341.py b/progs/a341.py new file mode 100644 index 0000000..ab12ee3 --- /dev/null +++ b/progs/a341.py @@ -0,0 +1,7 @@ +def check_element(test_tup, check_list):
+ res = False
+ for ele in check_list:
+ if ele in test_tup:
+ res = True
+ break
+ return (res)
\ No newline at end of file diff --git a/progs/a342.py b/progs/a342.py new file mode 100644 index 0000000..0d2e9eb --- /dev/null +++ b/progs/a342.py @@ -0,0 +1,4 @@ +from heapq import merge
+def combine_lists(num1,num2):
+ combine_lists=list(merge(num1, num2))
+ return combine_lists
\ No newline at end of file diff --git a/progs/a343.py b/progs/a343.py new file mode 100644 index 0000000..fef1d4f --- /dev/null +++ b/progs/a343.py @@ -0,0 +1,4 @@ +import re
+def num_position(text):
+ for m in re.finditer("\d+", text):
+ return m.start()
\ No newline at end of file diff --git a/progs/a344.py b/progs/a344.py new file mode 100644 index 0000000..fdc0102 --- /dev/null +++ b/progs/a344.py @@ -0,0 +1,3 @@ +def tuple_to_set(t):
+ s = set(t)
+ return (s)
\ No newline at end of file diff --git a/progs/a345.py b/progs/a345.py new file mode 100644 index 0000000..97c90fc --- /dev/null +++ b/progs/a345.py @@ -0,0 +1,4 @@ +from collections import Counter
+def most_common_elem(s,a):
+ most_common_elem=Counter(s).most_common(a)
+ return most_common_elem
\ No newline at end of file diff --git a/progs/a346.py b/progs/a346.py new file mode 100644 index 0000000..d7e0e19 --- /dev/null +++ b/progs/a346.py @@ -0,0 +1,6 @@ +def len_log(list1):
+ min=len(list1[0])
+ for i in list1:
+ if len(i)<min:
+ min=len(i)
+ return min
\ No newline at end of file diff --git a/progs/a347.py b/progs/a347.py new file mode 100644 index 0000000..11398c4 --- /dev/null +++ b/progs/a347.py @@ -0,0 +1,3 @@ +def get_item(tup1,index):
+ item = tup1[index]
+ return item
\ No newline at end of file diff --git a/progs/a348.py b/progs/a348.py new file mode 100644 index 0000000..8d1cbe4 --- /dev/null +++ b/progs/a348.py @@ -0,0 +1,5 @@ +def count_digs(tup):
+ return sum([len(str(ele)) for ele in tup ])
+def sort_list(test_list):
+ test_list.sort(key = count_digs)
+ return (str(test_list))
\ No newline at end of file diff --git a/progs/a349.py b/progs/a349.py new file mode 100644 index 0000000..a53b049 --- /dev/null +++ b/progs/a349.py @@ -0,0 +1,26 @@ +def chinese_zodiac(year):
+ if (year - 2000) % 12 == 0:
+ sign = 'Dragon'
+ elif (year - 2000) % 12 == 1:
+ sign = 'Snake'
+ elif (year - 2000) % 12 == 2:
+ sign = 'Horse'
+ elif (year - 2000) % 12 == 3:
+ sign = 'sheep'
+ elif (year - 2000) % 12 == 4:
+ sign = 'Monkey'
+ elif (year - 2000) % 12 == 5:
+ sign = 'Rooster'
+ elif (year - 2000) % 12 == 6:
+ sign = 'Dog'
+ elif (year - 2000) % 12 == 7:
+ sign = 'Pig'
+ elif (year - 2000) % 12 == 8:
+ sign = 'Rat'
+ elif (year - 2000) % 12 == 9:
+ sign = 'Ox'
+ elif (year - 2000) % 12 == 10:
+ sign = 'Tiger'
+ else:
+ sign = 'Hare'
+ return sign
\ No newline at end of file diff --git a/progs/a35.py b/progs/a35.py new file mode 100644 index 0000000..582eeb0 --- /dev/null +++ b/progs/a35.py @@ -0,0 +1,5 @@ +def Check_Solution(a,b,c):
+ if (a == c):
+ return ("Yes");
+ else:
+ return ("No");
\ No newline at end of file diff --git a/progs/a350.py b/progs/a350.py new file mode 100644 index 0000000..8fec186 --- /dev/null +++ b/progs/a350.py @@ -0,0 +1,4 @@ +def max_similar_indices(test_list1, test_list2):
+ res = [(max(x[0], y[0]), max(x[1], y[1]))
+ for x, y in zip(test_list1, test_list2)]
+ return (res)
\ No newline at end of file diff --git a/progs/a351.py b/progs/a351.py new file mode 100644 index 0000000..ada06e6 --- /dev/null +++ b/progs/a351.py @@ -0,0 +1,9 @@ +def nCr_mod_p(n, r, p):
+ if (r > n- r):
+ r = n - r
+ C = [0 for i in range(r + 1)]
+ C[0] = 1
+ for i in range(1, n + 1):
+ for j in range(min(i, r), 0, -1):
+ C[j] = (C[j] + C[j-1]) % p
+ return C[r]
\ No newline at end of file diff --git a/progs/a352.py b/progs/a352.py new file mode 100644 index 0000000..93b6c11 --- /dev/null +++ b/progs/a352.py @@ -0,0 +1,12 @@ +def subset(ar, n):
+ res = 0
+ ar.sort()
+ for i in range(0, n) :
+ count = 1
+ for i in range(n - 1):
+ if ar[i] == ar[i + 1]:
+ count+=1
+ else:
+ break
+ res = max(res, count)
+ return res
\ No newline at end of file diff --git a/progs/a353.py b/progs/a353.py new file mode 100644 index 0000000..4bda5b5 --- /dev/null +++ b/progs/a353.py @@ -0,0 +1,6 @@ +def profit_amount(actual_cost,sale_amount):
+ if(actual_cost > sale_amount):
+ amount = actual_cost - sale_amount
+ return amount
+ else:
+ return None
\ No newline at end of file diff --git a/progs/a354.py b/progs/a354.py new file mode 100644 index 0000000..e7555e0 --- /dev/null +++ b/progs/a354.py @@ -0,0 +1,3 @@ +def is_abundant(n):
+ fctrsum = sum([fctr for fctr in range(1, n) if n % fctr == 0])
+ return fctrsum > n
\ No newline at end of file diff --git a/progs/a355.py b/progs/a355.py new file mode 100644 index 0000000..17669e0 --- /dev/null +++ b/progs/a355.py @@ -0,0 +1,3 @@ +import re
+def split_list(text):
+ return (re.findall('[A-Z][^A-Z]*', text))
\ No newline at end of file diff --git a/progs/a356.py b/progs/a356.py new file mode 100644 index 0000000..52071f4 --- /dev/null +++ b/progs/a356.py @@ -0,0 +1,3 @@ +import math
+def get_First_Set_Bit_Pos(n):
+ return math.log2(n&-n)+1
\ No newline at end of file diff --git a/progs/a358.py b/progs/a358.py new file mode 100644 index 0000000..9da0de3 --- /dev/null +++ b/progs/a358.py @@ -0,0 +1,2 @@ +def Average(lst):
+ return sum(lst) / len(lst)
\ No newline at end of file diff --git a/progs/a359.py b/progs/a359.py new file mode 100644 index 0000000..e984df9 --- /dev/null +++ b/progs/a359.py @@ -0,0 +1,6 @@ +def get_noOfways(n):
+ if (n == 0):
+ return 0;
+ if (n == 1):
+ return 1;
+ return get_noOfways(n - 1) + get_noOfways(n - 2);
\ No newline at end of file diff --git a/progs/a36.py b/progs/a36.py new file mode 100644 index 0000000..79bef31 --- /dev/null +++ b/progs/a36.py @@ -0,0 +1,5 @@ +def noprofit_noloss(actual_cost,sale_amount):
+ if(sale_amount == actual_cost):
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a361.py b/progs/a361.py new file mode 100644 index 0000000..e15b5df --- /dev/null +++ b/progs/a361.py @@ -0,0 +1,5 @@ +def sum_Natural(n):
+ sum = (n * (n + 1))
+ return int(sum)
+def sum_Even(l,r):
+ return (sum_Natural(int(r / 2)) - sum_Natural(int((l - 1) / 2)))
\ No newline at end of file diff --git a/progs/a362.py b/progs/a362.py new file mode 100644 index 0000000..1dec489 --- /dev/null +++ b/progs/a362.py @@ -0,0 +1,8 @@ +def discriminant_value(x,y,z):
+ discriminant = (y**2) - (4*x*z)
+ if discriminant > 0:
+ return ("Two solutions",discriminant)
+ elif discriminant == 0:
+ return ("one solution",discriminant)
+ elif discriminant < 0:
+ return ("no real solution",discriminant)
\ No newline at end of file diff --git a/progs/a363.py b/progs/a363.py new file mode 100644 index 0000000..e1cd792 --- /dev/null +++ b/progs/a363.py @@ -0,0 +1,7 @@ +def word_len(s):
+ s = s.split(' ')
+ for word in s:
+ if len(word)%2==0:
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a365.py b/progs/a365.py new file mode 100644 index 0000000..b7866e8 --- /dev/null +++ b/progs/a365.py @@ -0,0 +1,3 @@ +def remove_empty(tuple1): #L = [(), (), ('',), ('a', 'b'), ('a', 'b', 'c'), ('d')]
+ tuple1 = [t for t in tuple1 if t]
+ return tuple1
\ No newline at end of file diff --git a/progs/a366.py b/progs/a366.py new file mode 100644 index 0000000..4d08103 --- /dev/null +++ b/progs/a366.py @@ -0,0 +1,5 @@ +def check(string):
+ if len(set(string).intersection("AEIOUaeiou"))>=5:
+ return ('accepted')
+ else:
+ return ("not accepted")
\ No newline at end of file diff --git a/progs/a367.py b/progs/a367.py new file mode 100644 index 0000000..242a737 --- /dev/null +++ b/progs/a367.py @@ -0,0 +1,3 @@ +def floor_Max(A,B,N):
+ x = min(B - 1,N)
+ return (A*x) // B
\ No newline at end of file diff --git a/progs/a368.py b/progs/a368.py new file mode 100644 index 0000000..d3171fd --- /dev/null +++ b/progs/a368.py @@ -0,0 +1,9 @@ +def join_tuples(test_list):
+ res = []
+ for sub in test_list:
+ if res and res[-1][0] == sub[0]:
+ res[-1].extend(sub[1:])
+ else:
+ res.append([ele for ele in sub])
+ res = list(map(tuple, res))
+ return (res)
\ No newline at end of file diff --git a/progs/a369.py b/progs/a369.py new file mode 100644 index 0000000..840be06 --- /dev/null +++ b/progs/a369.py @@ -0,0 +1,4 @@ +def min_of_two( x, y ):
+ if x < y:
+ return x
+ return y
\ No newline at end of file diff --git a/progs/a37.py b/progs/a37.py new file mode 100644 index 0000000..384f34a --- /dev/null +++ b/progs/a37.py @@ -0,0 +1,4 @@ +import math
+def wind_chill(v,t):
+ windchill = 13.12 + 0.6215*t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)
+ return int(round(windchill, 0))
\ No newline at end of file diff --git a/progs/a370.py b/progs/a370.py new file mode 100644 index 0000000..9747783 --- /dev/null +++ b/progs/a370.py @@ -0,0 +1,15 @@ +def maximum_segments(n, a, b, c) :
+ dp = [-1] * (n + 10)
+ dp[0] = 0
+ for i in range(0, n) :
+ if (dp[i] != -1) :
+ if(i + a <= n ):
+ dp[i + a] = max(dp[i] + 1,
+ dp[i + a])
+ if(i + b <= n ):
+ dp[i + b] = max(dp[i] + 1,
+ dp[i + b])
+ if(i + c <= n ):
+ dp[i + c] = max(dp[i] + 1,
+ dp[i + c])
+ return dp[n]
\ No newline at end of file diff --git a/progs/a371.py b/progs/a371.py new file mode 100644 index 0000000..9b6b257 --- /dev/null +++ b/progs/a371.py @@ -0,0 +1,3 @@ +def concatenate_nested(test_tup1, test_tup2):
+ res = test_tup1 + test_tup2
+ return (res)
\ No newline at end of file diff --git a/progs/a372.py b/progs/a372.py new file mode 100644 index 0000000..c5d6326 --- /dev/null +++ b/progs/a372.py @@ -0,0 +1,3 @@ +def left_rotate(s,d):
+ tmp = s[d : ] + s[0 : d]
+ return tmp
\ No newline at end of file diff --git a/progs/a373.py b/progs/a373.py new file mode 100644 index 0000000..fcf09d1 --- /dev/null +++ b/progs/a373.py @@ -0,0 +1,10 @@ +def min_sum_path(A):
+ memo = [None] * len(A)
+ n = len(A) - 1
+ for i in range(len(A[n])):
+ memo[i] = A[n][i]
+ for i in range(len(A) - 2, -1,-1):
+ for j in range( len(A[i])):
+ memo[j] = A[i][j] + min(memo[j],
+ memo[j + 1])
+ return memo[0]
\ No newline at end of file diff --git a/progs/a374.py b/progs/a374.py new file mode 100644 index 0000000..3b3eabb --- /dev/null +++ b/progs/a374.py @@ -0,0 +1,10 @@ +def remove_Occ(s,ch):
+ for i in range(len(s)):
+ if (s[i] == ch):
+ s = s[0 : i] + s[i + 1:]
+ break
+ for i in range(len(s) - 1,-1,-1):
+ if (s[i] == ch):
+ s = s[0 : i] + s[i + 1:]
+ break
+ return s
\ No newline at end of file diff --git a/progs/a375.py b/progs/a375.py new file mode 100644 index 0000000..0323fd4 --- /dev/null +++ b/progs/a375.py @@ -0,0 +1,3 @@ +def sort_matrix(M):
+ result = sorted(M, key=sum)
+ return result
\ No newline at end of file diff --git a/progs/a376.py b/progs/a376.py new file mode 100644 index 0000000..f6a1f4e --- /dev/null +++ b/progs/a376.py @@ -0,0 +1,5 @@ +from collections import Counter
+def count_common(words):
+ word_counts = Counter(words)
+ top_four = word_counts.most_common(4)
+ return (top_four)
diff --git a/progs/a377.py b/progs/a377.py new file mode 100644 index 0000000..64c506a --- /dev/null +++ b/progs/a377.py @@ -0,0 +1,2 @@ +def find_Volume(l,b,h) :
+ return ((l * b * h) / 2)
\ No newline at end of file diff --git a/progs/a378.py b/progs/a378.py new file mode 100644 index 0000000..7f7dfba --- /dev/null +++ b/progs/a378.py @@ -0,0 +1,3 @@ +import re
+def split_lowerstring(text):
+ return (re.findall('[a-z][^a-z]*', text))
\ No newline at end of file diff --git a/progs/a379.py b/progs/a379.py new file mode 100644 index 0000000..ebce8a5 --- /dev/null +++ b/progs/a379.py @@ -0,0 +1,7 @@ +import re
+def text_lowercase_underscore(text):
+ patterns = '^[a-z]+_[a-z]+$'
+ if re.search(patterns, text):
+ return 'Found a match!'
+ else:
+ return('Not matched!')
\ No newline at end of file diff --git a/progs/a380.py b/progs/a380.py new file mode 100644 index 0000000..4b7a5f0 --- /dev/null +++ b/progs/a380.py @@ -0,0 +1,3 @@ +def square_perimeter(a):
+ perimeter=4*a
+ return perimeter
\ No newline at end of file diff --git a/progs/a381.py b/progs/a381.py new file mode 100644 index 0000000..40a9fae --- /dev/null +++ b/progs/a381.py @@ -0,0 +1,26 @@ +NO_OF_CHARS = 256
+def str_to_list(string):
+ temp = []
+ for x in string:
+ temp.append(x)
+ return temp
+def lst_to_string(List):
+ return ''.join(List)
+def get_char_count_array(string):
+ count = [0] * NO_OF_CHARS
+ for i in string:
+ count[ord(i)] += 1
+ return count
+def remove_dirty_chars(string, second_string):
+ count = get_char_count_array(second_string)
+ ip_ind = 0
+ res_ind = 0
+ temp = ''
+ str_list = str_to_list(string)
+ while ip_ind != len(str_list):
+ temp = str_list[ip_ind]
+ if count[ord(temp)] == 0:
+ str_list[res_ind] = str_list[ip_ind]
+ res_ind += 1
+ ip_ind+=1
+ return lst_to_string(str_list[0:res_ind])
\ No newline at end of file diff --git a/progs/a382.py b/progs/a382.py new file mode 100644 index 0000000..f67bc9c --- /dev/null +++ b/progs/a382.py @@ -0,0 +1,3 @@ +def test_duplicate(arraynums):
+ nums_set = set(arraynums)
+ return len(arraynums) != len(nums_set)
\ No newline at end of file diff --git a/progs/a383.py b/progs/a383.py new file mode 100644 index 0000000..ce92ee2 --- /dev/null +++ b/progs/a383.py @@ -0,0 +1,13 @@ +def is_woodall(x):
+ if (x % 2 == 0):
+ return False
+ if (x == 1):
+ return True
+ x = x + 1
+ p = 0
+ while (x % 2 == 0):
+ x = x/2
+ p = p + 1
+ if (p == x):
+ return True
+ return False
\ No newline at end of file diff --git a/progs/a384.py b/progs/a384.py new file mode 100644 index 0000000..2d39a92 --- /dev/null +++ b/progs/a384.py @@ -0,0 +1,3 @@ +def multiples_of_num(m,n):
+ multiples_of_num= list(range(n,(m+1)*n, n))
+ return list(multiples_of_num)
\ No newline at end of file diff --git a/progs/a385.py b/progs/a385.py new file mode 100644 index 0000000..eed88cc --- /dev/null +++ b/progs/a385.py @@ -0,0 +1,12 @@ +def find_first_duplicate(nums):
+ num_set = set()
+ no_duplicate = -1
+
+ for i in range(len(nums)):
+
+ if nums[i] in num_set:
+ return nums[i]
+ else:
+ num_set.add(nums[i])
+
+ return no_duplicate
\ No newline at end of file diff --git a/progs/a386.py b/progs/a386.py new file mode 100644 index 0000000..b04ae1f --- /dev/null +++ b/progs/a386.py @@ -0,0 +1,8 @@ +def maximum_Sum(list1):
+ maxi = -100000
+ for x in list1:
+ sum = 0
+ for y in x:
+ sum+= y
+ maxi = max(sum,maxi)
+ return maxi
\ No newline at end of file diff --git a/progs/a387.py b/progs/a387.py new file mode 100644 index 0000000..1d36bf4 --- /dev/null +++ b/progs/a387.py @@ -0,0 +1,9 @@ +def binary_to_decimal(binary):
+ binary1 = binary
+ decimal, i, n = 0, 0, 0
+ while(binary != 0):
+ dec = binary % 10
+ decimal = decimal + dec * pow(2, i)
+ binary = binary//10
+ i += 1
+ return (decimal)
\ No newline at end of file diff --git a/progs/a388.py b/progs/a388.py new file mode 100644 index 0000000..e1d9298 --- /dev/null +++ b/progs/a388.py @@ -0,0 +1,7 @@ +def find_Product(arr,n):
+ arr.sort()
+ prod = 1
+ for i in range(0,n,1):
+ if (arr[i - 1] != arr[i]):
+ prod = prod * arr[i]
+ return prod;
\ No newline at end of file diff --git a/progs/a389.py b/progs/a389.py new file mode 100644 index 0000000..2cfa22e --- /dev/null +++ b/progs/a389.py @@ -0,0 +1,7 @@ +def check_k_elements(test_list, K):
+ res = True
+ for tup in test_list:
+ for ele in tup:
+ if ele != K:
+ res = False
+ return (res)
\ No newline at end of file diff --git a/progs/a390.py b/progs/a390.py new file mode 100644 index 0000000..75e1bfa --- /dev/null +++ b/progs/a390.py @@ -0,0 +1,5 @@ +import re
+def remove(list):
+ pattern = '[0-9]'
+ list = [re.sub(pattern, '', i) for i in list]
+ return list
\ No newline at end of file diff --git a/progs/a391.py b/progs/a391.py new file mode 100644 index 0000000..997ab6c --- /dev/null +++ b/progs/a391.py @@ -0,0 +1,6 @@ +def binomial_Coeff(n,k):
+ if k > n :
+ return 0
+ if k==0 or k ==n :
+ return 1
+ return binomial_Coeff(n-1,k-1) + binomial_Coeff(n-1,k)
\ No newline at end of file diff --git a/progs/a392.py b/progs/a392.py new file mode 100644 index 0000000..0c8da47 --- /dev/null +++ b/progs/a392.py @@ -0,0 +1,9 @@ +def get_Odd_Occurrence(arr,arr_size):
+ for i in range(0,arr_size):
+ count = 0
+ for j in range(0,arr_size):
+ if arr[i] == arr[j]:
+ count+=1
+ if (count % 2 != 0):
+ return arr[i]
+ return -1
\ No newline at end of file diff --git a/progs/a393.py b/progs/a393.py new file mode 100644 index 0000000..721bc6e --- /dev/null +++ b/progs/a393.py @@ -0,0 +1,10 @@ +def check_Equality(s):
+ return (ord(s[0]) == ord(s[len(s) - 1]));
+def count_Substring_With_Equal_Ends(s):
+ result = 0;
+ n = len(s);
+ for i in range(n):
+ for j in range(1,n-i+1):
+ if (check_Equality(s[i:i+j])):
+ result+=1;
+ return result;
\ No newline at end of file diff --git a/progs/a394.py b/progs/a394.py new file mode 100644 index 0000000..4fe6e47 --- /dev/null +++ b/progs/a394.py @@ -0,0 +1,22 @@ +def func(nums, k):
+ import collections
+ d = collections.defaultdict(int)
+ for row in nums:
+ for i in row:
+ d[i] += 1
+ temp = []
+ import heapq
+ for key, v in d.items():
+ if len(temp) < k:
+ temp.append((v, key))
+ if len(temp) == k:
+ heapq.heapify(temp)
+ else:
+ if v > temp[0][0]:
+ heapq.heappop(temp)
+ heapq.heappush(temp, (v, key))
+ result = []
+ while temp:
+ v, key = heapq.heappop(temp)
+ result.append(key)
+ return result
\ No newline at end of file diff --git a/progs/a395.py b/progs/a395.py new file mode 100644 index 0000000..1ca6298 --- /dev/null +++ b/progs/a395.py @@ -0,0 +1,13 @@ +import math
+def max_Prime_Factors (n):
+ maxPrime = -1
+ while n%2 == 0:
+ maxPrime = 2
+ n >>= 1
+ for i in range(3,int(math.sqrt(n))+1,2):
+ while n % i == 0:
+ maxPrime = i
+ n = n / i
+ if n > 2:
+ maxPrime = n
+ return int(maxPrime)
\ No newline at end of file diff --git a/progs/a396.py b/progs/a396.py new file mode 100644 index 0000000..0d03f17 --- /dev/null +++ b/progs/a396.py @@ -0,0 +1,10 @@ +def decimal_To_Binary(N):
+ B_Number = 0
+ cnt = 0
+ while (N != 0):
+ rem = N % 2
+ c = pow(10,cnt)
+ B_Number += rem*c
+ N //= 2
+ cnt += 1
+ return B_Number
\ No newline at end of file diff --git a/progs/a397.py b/progs/a397.py new file mode 100644 index 0000000..34f81a5 --- /dev/null +++ b/progs/a397.py @@ -0,0 +1,13 @@ +def find_missing(ar,N):
+ l = 0
+ r = N - 1
+ while (l <= r):
+ mid = (l + r) / 2
+ mid= int (mid)
+ if (ar[mid] != mid + 1 and ar[mid - 1] == mid):
+ return (mid + 1)
+ elif (ar[mid] != mid + 1):
+ r = mid - 1
+ else:
+ l = mid + 1
+ return (-1)
\ No newline at end of file diff --git a/progs/a398.py b/progs/a398.py new file mode 100644 index 0000000..7e9dd85 --- /dev/null +++ b/progs/a398.py @@ -0,0 +1,2 @@ +def find_rect_num(n):
+ return n*(n + 1)
\ No newline at end of file diff --git a/progs/a399.py b/progs/a399.py new file mode 100644 index 0000000..c15f0ed --- /dev/null +++ b/progs/a399.py @@ -0,0 +1,7 @@ +def find_Nth_Digit(p,q,N) :
+ while (N > 0) :
+ N -= 1;
+ p *= 10;
+ res = p // q;
+ p %= q;
+ return res;
\ No newline at end of file diff --git a/progs/a4.py b/progs/a4.py new file mode 100644 index 0000000..7d5f1e2 --- /dev/null +++ b/progs/a4.py @@ -0,0 +1,9 @@ +def prime_num(num):
+ if num >=1:
+ for i in range(2, num//2):
+ if (num % i) == 0:
+ return False
+ else:
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a40.py b/progs/a40.py new file mode 100644 index 0000000..3cbfc16 --- /dev/null +++ b/progs/a40.py @@ -0,0 +1,2 @@ +def is_nonagonal(n):
+ return int(n * (7 * n - 5) / 2)
\ No newline at end of file diff --git a/progs/a400.py b/progs/a400.py new file mode 100644 index 0000000..164e635 --- /dev/null +++ b/progs/a400.py @@ -0,0 +1,4 @@ +def sort_mixed_list(mixed_list):
+ int_part = sorted([i for i in mixed_list if type(i) is int])
+ str_part = sorted([i for i in mixed_list if type(i) is str])
+ return int_part + str_part
\ No newline at end of file diff --git a/progs/a401.py b/progs/a401.py new file mode 100644 index 0000000..7c2f8f0 --- /dev/null +++ b/progs/a401.py @@ -0,0 +1,4 @@ +def div_even_odd(list1):
+ first_even = next((el for el in list1 if el%2==0),-1)
+ first_odd = next((el for el in list1 if el%2!=0),-1)
+ return (first_even/first_odd)
\ No newline at end of file diff --git a/progs/a402.py b/progs/a402.py new file mode 100644 index 0000000..c45fd00 --- /dev/null +++ b/progs/a402.py @@ -0,0 +1,16 @@ +import heapq
+from collections import Counter
+def rearange_string(S):
+ ctr = Counter(S)
+ heap = [(-value, key) for key, value in ctr.items()]
+ heapq.heapify(heap)
+ if (-heap[0][0]) * 2 > len(S) + 1:
+ return ""
+ ans = []
+ while len(heap) >= 2:
+ nct1, char1 = heapq.heappop(heap)
+ nct2, char2 = heapq.heappop(heap)
+ ans.extend([char1, char2])
+ if nct1 + 1: heapq.heappush(heap, (nct1 + 1, char1))
+ if nct2 + 1: heapq.heappush(heap, (nct2 + 1, char2))
+ return "".join(ans) + (heap[0][1] if heap else "")
\ No newline at end of file diff --git a/progs/a403.py b/progs/a403.py new file mode 100644 index 0000000..18c84b2 --- /dev/null +++ b/progs/a403.py @@ -0,0 +1,5 @@ +from collections import Counter
+from itertools import chain
+def freq_element(nums):
+ result = Counter(chain.from_iterable(nums))
+ return result
\ No newline at end of file diff --git a/progs/a405.py b/progs/a405.py new file mode 100644 index 0000000..bec4015 --- /dev/null +++ b/progs/a405.py @@ -0,0 +1,2 @@ +def find_Sum(arr,n):
+ return sum([x for x in arr if arr.count(x) > 1])
\ No newline at end of file diff --git a/progs/a406.py b/progs/a406.py new file mode 100644 index 0000000..4ae612e --- /dev/null +++ b/progs/a406.py @@ -0,0 +1,7 @@ +import re
+def text_match(text):
+ patterns = '^[a-z]+_[a-z]+$'
+ if re.search(patterns, text):
+ return ('Found a match!')
+ else:
+ return ('Not matched!')
\ No newline at end of file diff --git a/progs/a407.py b/progs/a407.py new file mode 100644 index 0000000..9ebe1a9 --- /dev/null +++ b/progs/a407.py @@ -0,0 +1,7 @@ +import re
+def text_match_string(text):
+ patterns = '^\w+'
+ if re.search(patterns, text):
+ return 'Found a match!'
+ else:
+ return 'Not matched!'
\ No newline at end of file diff --git a/progs/a408.py b/progs/a408.py new file mode 100644 index 0000000..69e579a --- /dev/null +++ b/progs/a408.py @@ -0,0 +1,11 @@ +def find_gcd(x, y):
+ while(y):
+ x, y = y, x % y
+ return x
+def get_gcd(l):
+ num1 = l[0]
+ num2 = l[1]
+ gcd = find_gcd(num1, num2)
+ for i in range(2, len(l)):
+ gcd = find_gcd(gcd, l[i])
+ return gcd
\ No newline at end of file diff --git a/progs/a409.py b/progs/a409.py new file mode 100644 index 0000000..5a821b3 --- /dev/null +++ b/progs/a409.py @@ -0,0 +1,5 @@ +def test_distinct(data):
+ if len(data) == len(set(data)):
+ return True
+ else:
+ return False;
\ No newline at end of file diff --git a/progs/a41.py b/progs/a41.py new file mode 100644 index 0000000..fc3c61b --- /dev/null +++ b/progs/a41.py @@ -0,0 +1,3 @@ +def remove_similar_row(test_list):
+ res = set(sorted([tuple(sorted(set(sub))) for sub in test_list]))
+ return (res)
\ No newline at end of file diff --git a/progs/a410.py b/progs/a410.py new file mode 100644 index 0000000..b6dd166 --- /dev/null +++ b/progs/a410.py @@ -0,0 +1,10 @@ +def compute_Last_Digit(A,B):
+ variable = 1
+ if (A == B):
+ return 1
+ elif ((B - A) >= 5):
+ return 0
+ else:
+ for i in range(A + 1,B + 1):
+ variable = (variable * (i % 10)) % 10
+ return variable % 10
\ No newline at end of file diff --git a/progs/a411.py b/progs/a411.py new file mode 100644 index 0000000..d854594 --- /dev/null +++ b/progs/a411.py @@ -0,0 +1,8 @@ +def odd_bit_set_number(n):
+ count = 0;res = 0;temp = n
+ while temp > 0:
+ if count % 2 == 0:
+ res |= (1 << count)
+ count += 1
+ temp >>= 1
+ return (n | res)
\ No newline at end of file diff --git a/progs/a412_mod.py b/progs/a412_mod.py new file mode 100644 index 0000000..8b35459 --- /dev/null +++ b/progs/a412_mod.py @@ -0,0 +1,3 @@ +def specified_element(nums, N):
+ result = [i[N] for i in nums]
+ return result
diff --git a/progs/a414.py b/progs/a414.py new file mode 100644 index 0000000..13dedc3 --- /dev/null +++ b/progs/a414.py @@ -0,0 +1,5 @@ +def check_equilateral(x,y,z):
+ if x == y == z:
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a415.py b/progs/a415.py new file mode 100644 index 0000000..1e6e9bd --- /dev/null +++ b/progs/a415.py @@ -0,0 +1,3 @@ +def parallelogram_area(b,h):
+ area=b*h
+ return area
\ No newline at end of file diff --git a/progs/a416.py b/progs/a416.py new file mode 100644 index 0000000..a3cd347 --- /dev/null +++ b/progs/a416.py @@ -0,0 +1,5 @@ +def check_Equality(str):
+ if (str[0] == str[-1]):
+ return ("Equal")
+ else:
+ return ("Not Equal")
\ No newline at end of file diff --git a/progs/a417.py b/progs/a417.py new file mode 100644 index 0000000..fa68691 --- /dev/null +++ b/progs/a417.py @@ -0,0 +1,14 @@ +def counting_sort(my_list):
+ max_value = 0
+ for i in range(len(my_list)):
+ if my_list[i] > max_value:
+ max_value = my_list[i]
+ buckets = [0] * (max_value + 1)
+ for i in my_list:
+ buckets[i] += 1
+ i = 0
+ for j in range(max_value + 1):
+ for a in range(buckets[j]):
+ my_list[i] = j
+ i += 1
+ return my_list
\ No newline at end of file diff --git a/progs/a418.py b/progs/a418.py new file mode 100644 index 0000000..233dcc1 --- /dev/null +++ b/progs/a418.py @@ -0,0 +1,4 @@ +import math
+def tn_gp(a,n,r):
+ tn = a * (math.pow(r, n - 1))
+ return tn
\ No newline at end of file diff --git a/progs/a419.py b/progs/a419.py new file mode 100644 index 0000000..1af5189 --- /dev/null +++ b/progs/a419.py @@ -0,0 +1,8 @@ +def rev(num):
+ rev_num = 0
+ while (num > 0):
+ rev_num = (rev_num * 10 + num % 10)
+ num = num // 10
+ return rev_num
+def check(n):
+ return (2 * rev(n) == n + 1)
\ No newline at end of file diff --git a/progs/a42.py b/progs/a42.py new file mode 100644 index 0000000..1bc88f2 --- /dev/null +++ b/progs/a42.py @@ -0,0 +1,7 @@ +import re
+def text_match_wordz_middle(text):
+ patterns = '\Bz\B'
+ if re.search(patterns, text):
+ return 'Found a match!'
+ else:
+ return('Not matched!')
\ No newline at end of file diff --git a/progs/a420.py b/progs/a420.py new file mode 100644 index 0000000..1c47c83 --- /dev/null +++ b/progs/a420.py @@ -0,0 +1,6 @@ +def find_Max_Num(arr,n) :
+ arr.sort(reverse = True)
+ num = arr[0]
+ for i in range(1,n) :
+ num = num * 10 + arr[i]
+ return num
\ No newline at end of file diff --git a/progs/a421.py b/progs/a421.py new file mode 100644 index 0000000..481c5db --- /dev/null +++ b/progs/a421.py @@ -0,0 +1,2 @@ +def opposite_Signs(x,y):
+ return ((x ^ y) < 0);
\ No newline at end of file diff --git a/progs/a422.py b/progs/a422.py new file mode 100644 index 0000000..d1db25f --- /dev/null +++ b/progs/a422.py @@ -0,0 +1,2 @@ +def is_octagonal(n):
+ return 3 * n * n - 2 * n
\ No newline at end of file diff --git a/progs/a423.py b/progs/a423.py new file mode 100644 index 0000000..4bd6530 --- /dev/null +++ b/progs/a423.py @@ -0,0 +1,13 @@ +def max_len_sub( arr, n):
+ mls=[]
+ max = 0
+ for i in range(n):
+ mls.append(1)
+ for i in range(n):
+ for j in range(i):
+ if (abs(arr[i] - arr[j]) <= 1 and mls[i] < mls[j] + 1):
+ mls[i] = mls[j] + 1
+ for i in range(n):
+ if (max < mls[i]):
+ max = mls[i]
+ return max
\ No newline at end of file diff --git a/progs/a425.py b/progs/a425.py new file mode 100644 index 0000000..00c5c34 --- /dev/null +++ b/progs/a425.py @@ -0,0 +1,2 @@ +def smallest_num(xs): + return min(xs) diff --git a/progs/a426.py b/progs/a426.py new file mode 100644 index 0000000..8e88ba9 --- /dev/null +++ b/progs/a426.py @@ -0,0 +1,4 @@ +def max_difference(test_list):
+ temp = [abs(b - a) for a, b in test_list]
+ res = max(temp)
+ return (res)
\ No newline at end of file diff --git a/progs/a428.py b/progs/a428.py new file mode 100644 index 0000000..191b908 --- /dev/null +++ b/progs/a428.py @@ -0,0 +1,8 @@ +def recursive_list_sum(data_list):
+ total = 0
+ for element in data_list:
+ if type(element) == type([]):
+ total = total + recursive_list_sum(element)
+ else:
+ total = total + element
+ return total
\ No newline at end of file diff --git a/progs/a429.py b/progs/a429.py new file mode 100644 index 0000000..3fad1cc --- /dev/null +++ b/progs/a429.py @@ -0,0 +1,6 @@ +def pos_count(list):
+ pos_count= 0
+ for num in list:
+ if num >= 0:
+ pos_count += 1
+ return pos_count
\ No newline at end of file diff --git a/progs/a43.py b/progs/a43.py new file mode 100644 index 0000000..0205358 --- /dev/null +++ b/progs/a43.py @@ -0,0 +1,2 @@ +def reverse_Array_Upto_K(input, k):
+ return (input[k-1::-1] + input[k:])
\ No newline at end of file diff --git a/progs/a430.py b/progs/a430.py new file mode 100644 index 0000000..2a69036 --- /dev/null +++ b/progs/a430.py @@ -0,0 +1,8 @@ +def bell_number(n):
+ bell = [[0 for i in range(n+1)] for j in range(n+1)]
+ bell[0][0] = 1
+ for i in range(1, n+1):
+ bell[i][0] = bell[i-1][i-1]
+ for j in range(1, i+1):
+ bell[i][j] = bell[i-1][j-1] + bell[i][j-1]
+ return bell[n][0]
\ No newline at end of file diff --git a/progs/a431.py b/progs/a431.py new file mode 100644 index 0000000..9a8a7de --- /dev/null +++ b/progs/a431.py @@ -0,0 +1,3 @@ +def is_Monotonic(A):
+ return (all(A[i] <= A[i + 1] for i in range(len(A) - 1)) or
+ all(A[i] >= A[i + 1] for i in range(len(A) - 1)))
\ No newline at end of file diff --git a/progs/a432.py b/progs/a432.py new file mode 100644 index 0000000..9a05310 --- /dev/null +++ b/progs/a432.py @@ -0,0 +1,17 @@ +def is_sublist(l, s):
+ sub_set = False
+ if s == []:
+ sub_set = True
+ elif s == l:
+ sub_set = True
+ elif len(s) > len(l):
+ sub_set = False
+ else:
+ for i in range(len(l)):
+ if l[i] == s[0]:
+ n = 1
+ while (n < len(s)) and (l[i+n] == s[n]):
+ n += 1
+ if n == len(s):
+ sub_set = True
+ return sub_set
\ No newline at end of file diff --git a/progs/a433.py b/progs/a433.py new file mode 100644 index 0000000..7fa3f4f --- /dev/null +++ b/progs/a433.py @@ -0,0 +1,12 @@ +def find_equal_tuple(Input, k):
+ flag = 1
+ for tuple in Input:
+ if len(tuple) != k:
+ flag = 0
+ break
+ return flag
+def get_equal(Input, k):
+ if find_equal_tuple(Input, k) == 1:
+ return ("All tuples have same length")
+ else:
+ return ("All tuples do not have same length")
\ No newline at end of file diff --git a/progs/a434.py b/progs/a434.py new file mode 100644 index 0000000..6cb4081 --- /dev/null +++ b/progs/a434.py @@ -0,0 +1,15 @@ +def comb_sort(nums):
+ shrink_fact = 1.3
+ gaps = len(nums)
+ swapped = True
+ i = 0
+ while gaps > 1 or swapped:
+ gaps = int(float(gaps) / shrink_fact)
+ swapped = False
+ i = 0
+ while gaps + i < len(nums):
+ if nums[i] > nums[i+gaps]:
+ nums[i], nums[i+gaps] = nums[i+gaps], nums[i]
+ swapped = True
+ i += 1
+ return nums
\ No newline at end of file diff --git a/progs/a435.py b/progs/a435.py new file mode 100644 index 0000000..d24665b --- /dev/null +++ b/progs/a435.py @@ -0,0 +1,4 @@ +def dif_Square(n):
+ if (n % 4 != 2):
+ return True
+ return False
\ No newline at end of file diff --git a/progs/a436.py b/progs/a436.py new file mode 100644 index 0000000..28ae1ca --- /dev/null +++ b/progs/a436.py @@ -0,0 +1,3 @@ +import re
+def multiple_split(text):
+ return (re.split('; |, |\*|\n',text))
\ No newline at end of file diff --git a/progs/a437.py b/progs/a437.py new file mode 100644 index 0000000..764cde7 --- /dev/null +++ b/progs/a437.py @@ -0,0 +1,26 @@ +def is_samepatterns(colors, patterns):
+ if len(colors) != len(patterns):
+ return False
+ sdict = {}
+ pset = set()
+ sset = set()
+ for i in range(len(patterns)):
+ pset.add(patterns[i])
+ sset.add(colors[i])
+ if patterns[i] not in sdict.keys():
+ sdict[patterns[i]] = []
+
+ keys = sdict[patterns[i]]
+ keys.append(colors[i])
+ sdict[patterns[i]] = keys
+
+ if len(pset) != len(sset):
+ return False
+
+ for values in sdict.values():
+
+ for i in range(len(values) - 1):
+ if values[i] != values[i+1]:
+ return False
+
+ return True
\ No newline at end of file diff --git a/progs/a438.py b/progs/a438.py new file mode 100644 index 0000000..05fe371 --- /dev/null +++ b/progs/a438.py @@ -0,0 +1,3 @@ +def find_tuples(test_list, K):
+ res = [sub for sub in test_list if all(ele % K == 0 for ele in sub)]
+ return (str(res))
\ No newline at end of file diff --git a/progs/a439.py b/progs/a439.py new file mode 100644 index 0000000..2ed5b62 --- /dev/null +++ b/progs/a439.py @@ -0,0 +1,6 @@ +def count_Squares(m,n):
+ if(n < m):
+ temp = m
+ m = n
+ n = temp
+ return ((m * (m + 1) * (2 * m + 1) / 6 + (n - m) * m * (m + 1) / 2))
\ No newline at end of file diff --git a/progs/a44.py b/progs/a44.py new file mode 100644 index 0000000..60eb2f5 --- /dev/null +++ b/progs/a44.py @@ -0,0 +1,8 @@ +def get_product(val) :
+ res = 1
+ for ele in val:
+ res *= ele
+ return res
+def find_k_product(test_list, K):
+ res = get_product([sub[K] for sub in test_list])
+ return (res)
\ No newline at end of file diff --git a/progs/a440.py b/progs/a440.py new file mode 100644 index 0000000..c62731c --- /dev/null +++ b/progs/a440.py @@ -0,0 +1,2 @@ +def is_Diff(n):
+ return (n % 11 == 0)
\ No newline at end of file diff --git a/progs/a441.py b/progs/a441.py new file mode 100644 index 0000000..59eaae8 --- /dev/null +++ b/progs/a441.py @@ -0,0 +1,8 @@ +def count_With_Odd_SetBits(n):
+ if (n % 2 != 0):
+ return (n + 1) / 2
+ count = bin(n).count('1')
+ ans = n / 2
+ if (count % 2 != 0):
+ ans += 1
+ return ans
\ No newline at end of file diff --git a/progs/a442.py b/progs/a442.py new file mode 100644 index 0000000..67eda76 --- /dev/null +++ b/progs/a442.py @@ -0,0 +1,7 @@ +def word_len(s):
+ s = s.split(' ')
+ for word in s:
+ if len(word)%2!=0:
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a443.py b/progs/a443.py new file mode 100644 index 0000000..5daabfe --- /dev/null +++ b/progs/a443.py @@ -0,0 +1,2 @@ +def tetrahedral_number(n):
+ return (n * (n + 1) * (n + 2)) / 6
\ No newline at end of file diff --git a/progs/a444.py b/progs/a444.py new file mode 100644 index 0000000..0e6873c --- /dev/null +++ b/progs/a444.py @@ -0,0 +1,5 @@ +def zip_tuples(test_tup1, test_tup2):
+ res = []
+ for i, j in enumerate(test_tup1):
+ res.append((j, test_tup2[i % len(test_tup2)]))
+ return (res)
\ No newline at end of file diff --git a/progs/a445.py b/progs/a445.py new file mode 100644 index 0000000..c59c605 --- /dev/null +++ b/progs/a445.py @@ -0,0 +1,4 @@ +import math
+def volume_sphere(r):
+ volume=(4/3)*math.pi*r*r*r
+ return volume
\ No newline at end of file diff --git a/progs/a446.py b/progs/a446.py new file mode 100644 index 0000000..249ddb3 --- /dev/null +++ b/progs/a446.py @@ -0,0 +1,9 @@ +def get_Char(strr):
+ summ = 0
+ for i in range(len(strr)):
+ summ += (ord(strr[i]) - ord('a') + 1)
+ if (summ % 26 == 0):
+ return ord('z')
+ else:
+ summ = summ % 26
+ return chr(ord('a') + summ - 1)
\ No newline at end of file diff --git a/progs/a447.py b/progs/a447.py new file mode 100644 index 0000000..3ccb78f --- /dev/null +++ b/progs/a447.py @@ -0,0 +1,5 @@ +def sequence(n):
+ if n == 1 or n == 2:
+ return 1
+ else:
+ return sequence(sequence(n-1)) + sequence(n-sequence(n-1))
\ No newline at end of file diff --git a/progs/a448.py b/progs/a448.py new file mode 100644 index 0000000..fe5f19a --- /dev/null +++ b/progs/a448.py @@ -0,0 +1,4 @@ +import math
+def surfacearea_sphere(r):
+ surfacearea=4*math.pi*r*r
+ return surfacearea
\ No newline at end of file diff --git a/progs/a449.py b/progs/a449.py new file mode 100644 index 0000000..3b5e7a2 --- /dev/null +++ b/progs/a449.py @@ -0,0 +1,2 @@ +def centered_hexagonal_number(n):
+ return 3 * n * (n - 1) + 1
\ No newline at end of file diff --git a/progs/a45.py b/progs/a45.py new file mode 100644 index 0000000..ec3200b --- /dev/null +++ b/progs/a45.py @@ -0,0 +1,5 @@ +def No_of_cubes(N,K):
+ No = 0
+ No = (N - K + 1)
+ No = pow(No, 3)
+ return No
\ No newline at end of file diff --git a/progs/a450.py b/progs/a450.py new file mode 100644 index 0000000..21ab356 --- /dev/null +++ b/progs/a450.py @@ -0,0 +1,4 @@ +import collections as ct
+def merge_dictionaries_three(dict1,dict2, dict3):
+ merged_dict = dict(ct.ChainMap({},dict1,dict2,dict3))
+ return merged_dict
\ No newline at end of file diff --git a/progs/a451.py b/progs/a451.py new file mode 100644 index 0000000..9c8d310 --- /dev/null +++ b/progs/a451.py @@ -0,0 +1,4 @@ +import collections
+def freq_count(list1):
+ freq_count= collections.Counter(list1)
+ return freq_count
\ No newline at end of file diff --git a/progs/a452.py b/progs/a452.py new file mode 100644 index 0000000..75efc4f --- /dev/null +++ b/progs/a452.py @@ -0,0 +1,2 @@ +def closest_num(N):
+ return (N - 1)
\ No newline at end of file diff --git a/progs/a453.py b/progs/a453.py new file mode 100644 index 0000000..ddef225 --- /dev/null +++ b/progs/a453.py @@ -0,0 +1,6 @@ +def len_log(list1):
+ max=len(list1[0])
+ for i in list1:
+ if len(i)>max:
+ max=len(i)
+ return max
\ No newline at end of file diff --git a/progs/a454.py b/progs/a454.py new file mode 100644 index 0000000..45ac7c8 --- /dev/null +++ b/progs/a454.py @@ -0,0 +1,4 @@ +def find_substring(str1, sub_str):
+ if any(sub_str in s for s in str1):
+ return True
+ return False
\ No newline at end of file diff --git a/progs/a455.py b/progs/a455.py new file mode 100644 index 0000000..45278b7 --- /dev/null +++ b/progs/a455.py @@ -0,0 +1,7 @@ +def is_undulating(n):
+ if (len(n) <= 2):
+ return False
+ for i in range(2, len(n)):
+ if (n[i - 2] != n[i]):
+ return False
+ return True
\ No newline at end of file diff --git a/progs/a456.py b/progs/a456.py new file mode 100644 index 0000000..bb16096 --- /dev/null +++ b/progs/a456.py @@ -0,0 +1,9 @@ +def power(a,b):
+ if b==0:
+ return 1
+ elif a==0:
+ return 0
+ elif b==1:
+ return a
+ else:
+ return a*power(a,b-1)
\ No newline at end of file diff --git a/progs/a457.py b/progs/a457.py new file mode 100644 index 0000000..c2e58db --- /dev/null +++ b/progs/a457.py @@ -0,0 +1,4 @@ +from operator import itemgetter
+def index_minimum(test_list):
+ res = min(test_list, key = itemgetter(1))[0]
+ return (res)
\ No newline at end of file diff --git a/progs/a458.py b/progs/a458.py new file mode 100644 index 0000000..a0e1d24 --- /dev/null +++ b/progs/a458.py @@ -0,0 +1,3 @@ +def Find_Min_Length(lst):
+ minLength = min(len(x) for x in lst )
+ return minLength
\ No newline at end of file diff --git a/progs/a459.py b/progs/a459.py new file mode 100644 index 0000000..0ea51a8 --- /dev/null +++ b/progs/a459.py @@ -0,0 +1,4 @@ +def divisor(n):
+ for i in range(n):
+ x = len([i for i in range(1,n+1) if not n % i])
+ return x
\ No newline at end of file diff --git a/progs/a46.py b/progs/a46.py new file mode 100644 index 0000000..82c0f10 --- /dev/null +++ b/progs/a46.py @@ -0,0 +1,3 @@ +import re
+def split_upperstring(text):
+ return (re.findall('[A-Z][^A-Z]*', text))
\ No newline at end of file diff --git a/progs/a460.py b/progs/a460.py new file mode 100644 index 0000000..35bb40d --- /dev/null +++ b/progs/a460.py @@ -0,0 +1,11 @@ +def frequency_lists(list1):
+ list1 = [item for sublist in list1 for item in sublist]
+ dic_data = {}
+ for num in list1:
+ if num in dic_data.keys():
+ dic_data[num] += 1
+ else:
+ key = num
+ value = 1
+ dic_data[key] = value
+ return dic_data
diff --git a/progs/a461.py b/progs/a461.py new file mode 100644 index 0000000..7ca6e42 --- /dev/null +++ b/progs/a461.py @@ -0,0 +1,5 @@ +def multiply_num(numbers):
+ total = 1
+ for x in numbers:
+ total *= x
+ return total/len(numbers)
\ No newline at end of file diff --git a/progs/a462.py b/progs/a462.py new file mode 100644 index 0000000..6cdb173 --- /dev/null +++ b/progs/a462.py @@ -0,0 +1,2 @@ +def decimal_to_binary(n):
+ return bin(n).replace("0b","")
\ No newline at end of file diff --git a/progs/a463.py b/progs/a463.py new file mode 100644 index 0000000..3cb6533 --- /dev/null +++ b/progs/a463.py @@ -0,0 +1,6 @@ +import sys
+def next_smallest_palindrome(num):
+ numstr = str(num)
+ for i in range(num+1,sys.maxsize):
+ if str(i) == str(i)[::-1]:
+ return i
\ No newline at end of file diff --git a/progs/a465.py b/progs/a465.py new file mode 100644 index 0000000..cfd850d --- /dev/null +++ b/progs/a465.py @@ -0,0 +1,3 @@ +def snake_to_camel(word):
+ import re
+ return ''.join(x.capitalize() or '_' for x in word.split('_'))
\ No newline at end of file diff --git a/progs/a466.py b/progs/a466.py new file mode 100644 index 0000000..5206c2a --- /dev/null +++ b/progs/a466.py @@ -0,0 +1,6 @@ +def eulerian_num(n, m):
+ if (m >= n or n == 0):
+ return 0
+ if (m == 0):
+ return 1
+ return ((n - m) * eulerian_num(n - 1, m - 1) +(m + 1) * eulerian_num(n - 1, m))
\ No newline at end of file diff --git a/progs/a468.py b/progs/a468.py new file mode 100644 index 0000000..d01e068 --- /dev/null +++ b/progs/a468.py @@ -0,0 +1,2 @@ +def count(lst):
+ return sum(lst)
\ No newline at end of file diff --git a/progs/a469.py b/progs/a469.py new file mode 100644 index 0000000..c6ed4a5 --- /dev/null +++ b/progs/a469.py @@ -0,0 +1,3 @@ +def add_lists(test_list, test_tup):
+ res = tuple(list(test_tup) + test_list)
+ return (res)
\ No newline at end of file diff --git a/progs/a47.py b/progs/a47.py new file mode 100644 index 0000000..94c3374 --- /dev/null +++ b/progs/a47.py @@ -0,0 +1,4 @@ +from itertools import zip_longest, chain, tee
+def exchange_elements(lst):
+ lst1, lst2 = tee(iter(lst), 2)
+ return list(chain.from_iterable(zip_longest(lst[1::2], lst[::2])))
\ No newline at end of file diff --git a/progs/a470.py b/progs/a470.py new file mode 100644 index 0000000..54ca055 --- /dev/null +++ b/progs/a470.py @@ -0,0 +1,12 @@ +def count_Hexadecimal(L,R) :
+ count = 0;
+ for i in range(L,R + 1) :
+ if (i >= 10 and i <= 15) :
+ count += 1;
+ elif (i > 15) :
+ k = i;
+ while (k != 0) :
+ if (k % 16 >= 10) :
+ count += 1;
+ k = k // 16;
+ return count;
\ No newline at end of file diff --git a/progs/a471.py b/progs/a471.py new file mode 100644 index 0000000..f15b77d --- /dev/null +++ b/progs/a471.py @@ -0,0 +1,7 @@ +import heapq
+def merge_sorted_list(num1,num2,num3):
+ num1=sorted(num1)
+ num2=sorted(num2)
+ num3=sorted(num3)
+ result = heapq.merge(num1,num2,num3)
+ return list(result)
\ No newline at end of file diff --git a/progs/a472.py b/progs/a472.py new file mode 100644 index 0000000..625f1c5 --- /dev/null +++ b/progs/a472.py @@ -0,0 +1,6 @@ +def odd_Equivalent(s,n):
+ count=0
+ for i in range(0,n):
+ if (s[i] == '1'):
+ count = count + 1
+ return count
\ No newline at end of file diff --git a/progs/a473.py b/progs/a473.py new file mode 100644 index 0000000..d82695d --- /dev/null +++ b/progs/a473.py @@ -0,0 +1,9 @@ +def extract_missing(test_list, strt_val, stop_val):
+ res = []
+ for sub in test_list:
+ if sub[0] > strt_val:
+ res.append((strt_val, sub[0]))
+ strt_val = sub[1]
+ if strt_val < stop_val:
+ res.append((strt_val, stop_val))
+ return (res)
\ No newline at end of file diff --git a/progs/a475.py b/progs/a475.py new file mode 100644 index 0000000..c4df169 --- /dev/null +++ b/progs/a475.py @@ -0,0 +1,2 @@ +def perimeter(diameter,height) :
+ return 2*(diameter+height)
\ No newline at end of file diff --git a/progs/a476.py b/progs/a476.py new file mode 100644 index 0000000..7c1b0b6 --- /dev/null +++ b/progs/a476.py @@ -0,0 +1,12 @@ +def check_integer(text):
+ text = text.strip()
+ if len(text) < 1:
+ return None
+ else:
+ if all(text[i] in "0123456789" for i in range(len(text))):
+ return True
+ elif (text[0] in "+-") and \
+ all(text[i] in "0123456789" for i in range(1,len(text))):
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a478.py b/progs/a478.py new file mode 100644 index 0000000..3315dc2 --- /dev/null +++ b/progs/a478.py @@ -0,0 +1,3 @@ +def empty_dit(list1):
+ empty_dit=all(not d for d in list1)
+ return empty_dit
\ No newline at end of file diff --git a/progs/a479.py b/progs/a479.py new file mode 100644 index 0000000..d6bc98e --- /dev/null +++ b/progs/a479.py @@ -0,0 +1,3 @@ +def tuple_to_int(nums):
+ result = int(''.join(map(str,nums)))
+ return result
\ No newline at end of file diff --git a/progs/a48.py b/progs/a48.py new file mode 100644 index 0000000..736523b --- /dev/null +++ b/progs/a48.py @@ -0,0 +1,5 @@ +def sum_Range_list(nums, m, n):
+ sum_range = 0
+ for i in range(m, n+1, 1):
+ sum_range += nums[i]
+ return sum_range
\ No newline at end of file diff --git a/progs/a480.py b/progs/a480.py new file mode 100644 index 0000000..7d8db7d --- /dev/null +++ b/progs/a480.py @@ -0,0 +1,11 @@ +def list_to_float(test_list):
+ res = []
+ for tup in test_list:
+ temp = []
+ for ele in tup:
+ if ele.isalpha():
+ temp.append(ele)
+ else:
+ temp.append(float(ele))
+ res.append((temp[0],temp[1]))
+ return (str(res))
\ No newline at end of file diff --git a/progs/a481.py b/progs/a481.py new file mode 100644 index 0000000..7d9cf51 --- /dev/null +++ b/progs/a481.py @@ -0,0 +1,3 @@ +def string_to_list(string):
+ lst = list(string.split(" "))
+ return lst
\ No newline at end of file diff --git a/progs/a482.py b/progs/a482.py new file mode 100644 index 0000000..da6fe1f --- /dev/null +++ b/progs/a482.py @@ -0,0 +1,5 @@ +def search(arr,n) :
+ XOR = 0
+ for i in range(n) :
+ XOR = XOR ^ arr[i]
+ return (XOR)
\ No newline at end of file diff --git a/progs/a483.py b/progs/a483.py new file mode 100644 index 0000000..16fd15d --- /dev/null +++ b/progs/a483.py @@ -0,0 +1,3 @@ +def max_product_tuple(list1):
+ result_max = max([abs(x * y) for x, y in list1] )
+ return result_max
\ No newline at end of file diff --git a/progs/a484.py b/progs/a484.py new file mode 100644 index 0000000..00ed320 --- /dev/null +++ b/progs/a484.py @@ -0,0 +1,7 @@ +def check_triplet(A, n, sum, count):
+ if count == 3 and sum == 0:
+ return True
+ if count == 3 or n == 0 or sum < 0:
+ return False
+ return check_triplet(A, n - 1, sum - A[n - 1], count + 1) or\
+ check_triplet(A, n - 1, sum, count)
\ No newline at end of file diff --git a/progs/a485.py b/progs/a485.py new file mode 100644 index 0000000..20165f4 --- /dev/null +++ b/progs/a485.py @@ -0,0 +1,15 @@ +MAX = 3000
+def smartNumber(n):
+ primes = [0] * MAX
+ result = []
+ for i in range(2, MAX):
+ if (primes[i] == 0):
+ primes[i] = 1
+ j = i * 2
+ while (j < MAX):
+ primes[j] -= 1
+ if ( (primes[j] + 3) == 0):
+ result.append(j)
+ j = j + i
+ result.sort()
+ return result[n - 1]
\ No newline at end of file diff --git a/progs/a486.py b/progs/a486.py new file mode 100644 index 0000000..e0ef697 --- /dev/null +++ b/progs/a486.py @@ -0,0 +1,15 @@ +def amicable_numbers_sum(limit):
+ if not isinstance(limit, int):
+ return "Input is not an integer!"
+ if limit < 1:
+ return "Input must be bigger than 0!"
+ amicables = set()
+ for num in range(2, limit+1):
+ if num in amicables:
+ continue
+ sum_fact = sum([fact for fact in range(1, num) if num % fact == 0])
+ sum_fact2 = sum([fact for fact in range(1, sum_fact) if sum_fact % fact == 0])
+ if num == sum_fact2 and num != sum_fact:
+ amicables.add(num)
+ amicables.add(sum_fact2)
+ return sum(amicables)
\ No newline at end of file diff --git a/progs/a487.py b/progs/a487.py new file mode 100644 index 0000000..01efda1 --- /dev/null +++ b/progs/a487.py @@ -0,0 +1,5 @@ +import cmath
+def angle_complex(a,b):
+ cn=complex(a,b)
+ angle=cmath.phase(a+b)
+ return angle
\ No newline at end of file diff --git a/progs/a488.py b/progs/a488.py new file mode 100644 index 0000000..c5865d6 --- /dev/null +++ b/progs/a488.py @@ -0,0 +1,9 @@ +def find_length(string, n):
+ current_sum = 0
+ max_sum = 0
+ for i in range(n):
+ current_sum += (1 if string[i] == '0' else -1)
+ if current_sum < 0:
+ current_sum = 0
+ max_sum = max(current_sum, max_sum)
+ return max_sum if max_sum else 0
\ No newline at end of file diff --git a/progs/a489.py b/progs/a489.py new file mode 100644 index 0000000..ac17fc0 --- /dev/null +++ b/progs/a489.py @@ -0,0 +1,6 @@ +def sum(a,b):
+ sum = 0
+ for i in range (1,min(a,b)):
+ if (a % i == 0 and b % i == 0):
+ sum += i
+ return sum
\ No newline at end of file diff --git a/progs/a49.py b/progs/a49.py new file mode 100644 index 0000000..4039ae5 --- /dev/null +++ b/progs/a49.py @@ -0,0 +1,9 @@ +def are_Equal(arr1,arr2,n,m):
+ if (n != m):
+ return False
+ arr1.sort()
+ arr2.sort()
+ for i in range(0,n - 1):
+ if (arr1[i] != arr2[i]):
+ return False
+ return True
\ No newline at end of file diff --git a/progs/a490.py b/progs/a490.py new file mode 100644 index 0000000..c802fcc --- /dev/null +++ b/progs/a490.py @@ -0,0 +1,9 @@ +def multiply_int(x, y):
+ if y < 0:
+ return -multiply_int(x, -y)
+ elif y == 0:
+ return 0
+ elif y == 1:
+ return x
+ else:
+ return x + multiply_int(x, y - 1)
\ No newline at end of file diff --git a/progs/a491.py b/progs/a491.py new file mode 100644 index 0000000..d4be952 --- /dev/null +++ b/progs/a491.py @@ -0,0 +1,7 @@ +def long_words(n, str):
+ word_len = []
+ txt = str.split(" ")
+ for x in txt:
+ if len(x) > n:
+ word_len.append(x)
+ return word_len
\ No newline at end of file diff --git a/progs/a492.py b/progs/a492.py new file mode 100644 index 0000000..3e1b9c3 --- /dev/null +++ b/progs/a492.py @@ -0,0 +1,17 @@ +def magic_square_test(my_matrix):
+ iSize = len(my_matrix[0])
+ sum_list = []
+ sum_list.extend([sum (lines) for lines in my_matrix])
+ for col in range(iSize):
+ sum_list.append(sum(row[col] for row in my_matrix))
+ result1 = 0
+ for i in range(0,iSize):
+ result1 +=my_matrix[i][i]
+ sum_list.append(result1)
+ result2 = 0
+ for i in range(iSize-1,-1,-1):
+ result2 +=my_matrix[i][i]
+ sum_list.append(result2)
+ if len(set(sum_list))>1:
+ return False
+ return True
\ No newline at end of file diff --git a/progs/a494.py b/progs/a494.py new file mode 100644 index 0000000..a37dd5f --- /dev/null +++ b/progs/a494.py @@ -0,0 +1,13 @@ +def reverse_vowels(str1):
+ vowels = ""
+ for char in str1:
+ if char in "aeiouAEIOU":
+ vowels += char
+ result_string = ""
+ for char in str1:
+ if char in "aeiouAEIOU":
+ result_string += vowels[-1]
+ vowels = vowels[:-1]
+ else:
+ result_string += char
+ return result_string
\ No newline at end of file diff --git a/progs/a495.py b/progs/a495.py new file mode 100644 index 0000000..0fd80d1 --- /dev/null +++ b/progs/a495.py @@ -0,0 +1,3 @@ +def tup_string(tup1):
+ str = ''.join(tup1)
+ return str
\ No newline at end of file diff --git a/progs/a497.py b/progs/a497.py new file mode 100644 index 0000000..c268e81 --- /dev/null +++ b/progs/a497.py @@ -0,0 +1,11 @@ +def check_last (arr,n,p):
+ _sum = 0
+ for i in range(n):
+ _sum = _sum + arr[i]
+ if p == 1:
+ if _sum % 2 == 0:
+ return "ODD"
+ else:
+ return "EVEN"
+ return "EVEN"
+
diff --git a/progs/a498.py b/progs/a498.py new file mode 100644 index 0000000..728f1cb --- /dev/null +++ b/progs/a498.py @@ -0,0 +1,2 @@ +def hexagonal_num(n):
+ return n*(2*n - 1)
\ No newline at end of file diff --git a/progs/a499.py b/progs/a499.py new file mode 100644 index 0000000..8d1a2cb --- /dev/null +++ b/progs/a499.py @@ -0,0 +1,15 @@ +def cal_electbill(units):
+ if(units < 50):
+ amount = units * 2.60
+ surcharge = 25
+ elif(units <= 100):
+ amount = 130 + ((units - 50) * 3.25)
+ surcharge = 35
+ elif(units <= 200):
+ amount = 130 + 162.50 + ((units - 100) * 5.26)
+ surcharge = 45
+ else:
+ amount = 130 + 162.50 + 526 + ((units - 200) * 8.45)
+ surcharge = 75
+ total = amount + surcharge
+ return total
\ No newline at end of file diff --git a/progs/a5.py b/progs/a5.py new file mode 100644 index 0000000..f34be68 --- /dev/null +++ b/progs/a5.py @@ -0,0 +1,4 @@ +import math
+def radian_degree(degree):
+ radian = degree*(math.pi/180)
+ return radian
\ No newline at end of file diff --git a/progs/a50.py b/progs/a50.py new file mode 100644 index 0000000..89cc540 --- /dev/null +++ b/progs/a50.py @@ -0,0 +1,3 @@ +def check_subset(test_tup1, test_tup2):
+ res = set(test_tup2).issubset(test_tup1)
+ return (res)
\ No newline at end of file diff --git a/progs/a500.py b/progs/a500.py new file mode 100644 index 0000000..3c60a5d --- /dev/null +++ b/progs/a500.py @@ -0,0 +1,10 @@ +from array import array
+def zero_count(nums):
+ n = len(nums)
+ n1 = 0
+ for x in nums:
+ if x == 0:
+ n1 += 1
+ else:
+ None
+ return round(n1/n,2)
\ No newline at end of file diff --git a/progs/a501.py b/progs/a501.py new file mode 100644 index 0000000..bbcc4db --- /dev/null +++ b/progs/a501.py @@ -0,0 +1,5 @@ +def is_Sum_Of_Powers_Of_Two(n):
+ if (n % 2 == 1):
+ return False
+ else:
+ return True
\ No newline at end of file diff --git a/progs/a502.py b/progs/a502.py new file mode 100644 index 0000000..6c17031 --- /dev/null +++ b/progs/a502.py @@ -0,0 +1,3 @@ +def circle_circumference(r):
+ perimeter=2*3.1415*r
+ return perimeter
\ No newline at end of file diff --git a/progs/a503.py b/progs/a503.py new file mode 100644 index 0000000..5046f85 --- /dev/null +++ b/progs/a503.py @@ -0,0 +1,9 @@ +def extract_singly(test_list):
+ res = []
+ temp = set()
+ for inner in test_list:
+ for ele in inner:
+ if not ele in temp:
+ temp.add(ele)
+ res.append(ele)
+ return (res)
\ No newline at end of file diff --git a/progs/a504.py b/progs/a504.py new file mode 100644 index 0000000..fac440a --- /dev/null +++ b/progs/a504.py @@ -0,0 +1,8 @@ +def pancake_sort(nums):
+ arr_len = len(nums)
+ while arr_len > 1:
+ mi = nums.index(max(nums[0:arr_len]))
+ nums = nums[mi::-1] + nums[mi+1:len(nums)]
+ nums = nums[arr_len-1::-1] + nums[arr_len:len(nums)]
+ arr_len -= 1
+ return nums
\ No newline at end of file diff --git a/progs/a505.py b/progs/a505.py new file mode 100644 index 0000000..60cf63e --- /dev/null +++ b/progs/a505.py @@ -0,0 +1,3 @@ +def count_samepair(list1,list2,list3):
+ result = sum(m == n == o for m, n, o in zip(list1,list2,list3))
+ return result
\ No newline at end of file diff --git a/progs/a506.py b/progs/a506.py new file mode 100644 index 0000000..4104ad8 --- /dev/null +++ b/progs/a506.py @@ -0,0 +1,5 @@ +def find_lists(Input):
+ if isinstance(Input, list):
+ return 1
+ else:
+ return len(Input)
\ No newline at end of file diff --git a/progs/a507.py b/progs/a507.py new file mode 100644 index 0000000..ac38919 --- /dev/null +++ b/progs/a507.py @@ -0,0 +1,5 @@ +def sum_Pairs(arr,n):
+ sum = 0
+ for i in range(n - 1,-1,-1):
+ sum += i*arr[i] - (n-1-i) * arr[i]
+ return sum
\ No newline at end of file diff --git a/progs/a508.py b/progs/a508.py new file mode 100644 index 0000000..646d681 --- /dev/null +++ b/progs/a508.py @@ -0,0 +1,7 @@ +def max_Abs_Diff(arr,n):
+ minEle = arr[0]
+ maxEle = arr[0]
+ for i in range(1, n):
+ minEle = min(minEle,arr[i])
+ maxEle = max(maxEle,arr[i])
+ return (maxEle - minEle)
\ No newline at end of file diff --git a/progs/a509.py b/progs/a509.py new file mode 100644 index 0000000..f90181a --- /dev/null +++ b/progs/a509.py @@ -0,0 +1,3 @@ +def ascii_value_string(str1):
+ for i in range(len(str1)):
+ return ord(str1[i])
\ No newline at end of file diff --git a/progs/a510.py b/progs/a510.py new file mode 100644 index 0000000..ca69f29 --- /dev/null +++ b/progs/a510.py @@ -0,0 +1,8 @@ +def max_path_sum(tri, m, n):
+ for i in range(m-1, -1, -1):
+ for j in range(i+1):
+ if (tri[i+1][j] > tri[i+1][j+1]):
+ tri[i][j] += tri[i+1][j]
+ else:
+ tri[i][j] += tri[i+1][j+1]
+ return tri[0][0]
\ No newline at end of file diff --git a/progs/a511.py b/progs/a511.py new file mode 100644 index 0000000..8855ae1 --- /dev/null +++ b/progs/a511.py @@ -0,0 +1,14 @@ +def sum_digits_single(x) :
+ ans = 0
+ while x :
+ ans += x % 10
+ x //= 10
+ return ans
+def closest(x) :
+ ans = 0
+ while (ans * 10 + 9 <= x) :
+ ans = ans * 10 + 9
+ return ans
+def sum_digits_twoparts(N) :
+ A = closest(N)
+ return sum_digits_single(A) + sum_digits_single(N - A)
\ No newline at end of file diff --git a/progs/a512.py b/progs/a512.py new file mode 100644 index 0000000..d2be437 --- /dev/null +++ b/progs/a512.py @@ -0,0 +1,11 @@ +def longest_subseq_with_diff_one(arr, n):
+ dp = [1 for i in range(n)]
+ for i in range(n):
+ for j in range(i):
+ if ((arr[i] == arr[j]+1) or (arr[i] == arr[j]-1)):
+ dp[i] = max(dp[i], dp[j]+1)
+ result = 1
+ for i in range(n):
+ if (result < dp[i]):
+ result = dp[i]
+ return result
\ No newline at end of file diff --git a/progs/a513.py b/progs/a513.py new file mode 100644 index 0000000..6d316ab --- /dev/null +++ b/progs/a513.py @@ -0,0 +1,6 @@ +def does_Contain_B(a,b,c):
+ if (a == b):
+ return True
+ if ((b - a) * c > 0 and (b - a) % c == 0):
+ return True
+ return False
\ No newline at end of file diff --git a/progs/a514.py b/progs/a514.py new file mode 100644 index 0000000..9e850e6 --- /dev/null +++ b/progs/a514.py @@ -0,0 +1,6 @@ +def gcd(p,q):
+ while q != 0:
+ p, q = q,p%q
+ return p
+def is_coprime(x,y):
+ return gcd(x,y) == 1
\ No newline at end of file diff --git a/progs/a515.py b/progs/a515.py new file mode 100644 index 0000000..b57466d --- /dev/null +++ b/progs/a515.py @@ -0,0 +1,22 @@ +def merge(a,b):
+ c = []
+ while len(a) != 0 and len(b) != 0:
+ if a[0] < b[0]:
+ c.append(a[0])
+ a.remove(a[0])
+ else:
+ c.append(b[0])
+ b.remove(b[0])
+ if len(a) == 0:
+ c += b
+ else:
+ c += a
+ return c
+def merge_sort(x):
+ if len(x) == 0 or len(x) == 1:
+ return x
+ else:
+ middle = len(x)//2
+ a = merge_sort(x[:middle])
+ b = merge_sort(x[middle:])
+ return merge(a,b)
diff --git a/progs/a516.py b/progs/a516.py new file mode 100644 index 0000000..c3be567 --- /dev/null +++ b/progs/a516.py @@ -0,0 +1,3 @@ +def parabola_vertex(a, b, c):
+ vertex=(((-b / (2 * a)),(((4 * a * c) - (b * b)) / (4 * a))))
+ return vertex
\ No newline at end of file diff --git a/progs/a517.py b/progs/a517.py new file mode 100644 index 0000000..3fa6364 --- /dev/null +++ b/progs/a517.py @@ -0,0 +1,3 @@ +def specified_element(nums, N):
+ result = [i[N] for i in nums]
+ return result
\ No newline at end of file diff --git a/progs/a518.py b/progs/a518.py new file mode 100644 index 0000000..0eda7da --- /dev/null +++ b/progs/a518.py @@ -0,0 +1,8 @@ +def even_bit_toggle_number(n) :
+ res = 0; count = 0; temp = n
+ while (temp > 0) :
+ if (count % 2 == 1) :
+ res = res | (1 << count)
+ count = count + 1
+ temp >>= 1
+ return n ^ res
\ No newline at end of file diff --git a/progs/a519.py b/progs/a519.py new file mode 100644 index 0000000..04b5055 --- /dev/null +++ b/progs/a519.py @@ -0,0 +1,3 @@ +def tuple_int_str(tuple_str):
+ result = tuple((int(x[0]), int(x[1])) for x in tuple_str)
+ return result
\ No newline at end of file diff --git a/progs/a52.py b/progs/a52.py new file mode 100644 index 0000000..4a0b33a --- /dev/null +++ b/progs/a52.py @@ -0,0 +1,6 @@ +from collections import defaultdict
+def grouping_dictionary(l):
+ d = defaultdict(list)
+ for k, v in l:
+ d[k].append(v)
+ return d
\ No newline at end of file diff --git a/progs/a520.py b/progs/a520.py new file mode 100644 index 0000000..6ec2c1f --- /dev/null +++ b/progs/a520.py @@ -0,0 +1,3 @@ +from itertools import groupby
+def encode_list(list1):
+ return [[len(list(group)), key] for key, group in groupby(list1)]
\ No newline at end of file diff --git a/progs/a521.py b/progs/a521.py new file mode 100644 index 0000000..3e59623 --- /dev/null +++ b/progs/a521.py @@ -0,0 +1,9 @@ +def min_Ops(arr,n,k):
+ max1 = max(arr)
+ res = 0
+ for i in range(0,n):
+ if ((max1 - arr[i]) % k != 0):
+ return -1
+ else:
+ res += (max1 - arr[i]) / k
+ return int(res)
\ No newline at end of file diff --git a/progs/a522.py b/progs/a522.py new file mode 100644 index 0000000..031a5db --- /dev/null +++ b/progs/a522.py @@ -0,0 +1,22 @@ +def month_season(month,days):
+ if month in ('January', 'February', 'March'):
+ season = 'winter'
+ elif month in ('April', 'May', 'June'):
+ season = 'spring'
+ elif month in ('July', 'August', 'September'):
+ season = 'summer'
+ else:
+ season = 'autumn'
+ if (month == 'March') and (days > 19):
+ season = 'spring'
+ elif (month == 'June') and (days > 20):
+ season = 'summer'
+ elif (month == 'September') and (days > 21):
+ season = 'autumn'
+ elif (month == 'October') and (days > 21):
+ season = 'autumn'
+ elif (month == 'November') and (days > 21):
+ season = 'autumn'
+ elif (month == 'December') and (days > 20):
+ season = 'winter'
+ return season
\ No newline at end of file diff --git a/progs/a523.py b/progs/a523.py new file mode 100644 index 0000000..d83e1fc --- /dev/null +++ b/progs/a523.py @@ -0,0 +1,9 @@ +def solution (a, b, n):
+ i = 0
+ while i * a <= n:
+ if (n - (i * a)) % b == 0:
+ return ("x = ",i ,", y = ",
+ int((n - (i * a)) / b))
+ return 0
+ i = i + 1
+ return ("No solution")
\ No newline at end of file diff --git a/progs/a524.py b/progs/a524.py new file mode 100644 index 0000000..8b32314 --- /dev/null +++ b/progs/a524.py @@ -0,0 +1,3 @@ +def remove_elements(list1, list2):
+ result = [x for x in list1 if x not in list2]
+ return result
\ No newline at end of file diff --git a/progs/a525.py b/progs/a525.py new file mode 100644 index 0000000..06cd0a5 --- /dev/null +++ b/progs/a525.py @@ -0,0 +1,5 @@ +def sum_series(n):
+ if n < 1:
+ return 0
+ else:
+ return n + sum_series(n - 2)
\ No newline at end of file diff --git a/progs/a526.py b/progs/a526.py new file mode 100644 index 0000000..acf2c66 --- /dev/null +++ b/progs/a526.py @@ -0,0 +1,4 @@ +from math import tan, pi
+def area_polygon(s,l):
+ area = s * (l ** 2) / (4 * tan(pi / s))
+ return area
\ No newline at end of file diff --git a/progs/a527.py b/progs/a527.py new file mode 100644 index 0000000..1096645 --- /dev/null +++ b/progs/a527.py @@ -0,0 +1,11 @@ +import math
+def divSum(n):
+ sum = 1;
+ i = 2;
+ while(i * i <= n):
+ if (n % i == 0):
+ sum = (sum + i +math.floor(n / i));
+ i += 1;
+ return sum;
+def areEquivalent(num1,num2):
+ return divSum(num1) == divSum(num2);
\ No newline at end of file diff --git a/progs/a528.py b/progs/a528.py new file mode 100644 index 0000000..e6f7c73 --- /dev/null +++ b/progs/a528.py @@ -0,0 +1,7 @@ +def count_char_position(str1):
+ count_chars = 0
+ for i in range(len(str1)):
+ if ((i == ord(str1[i]) - ord('A')) or
+ (i == ord(str1[i]) - ord('a'))):
+ count_chars += 1
+ return count_chars
\ No newline at end of file diff --git a/progs/a529.py b/progs/a529.py new file mode 100644 index 0000000..b4acdbc --- /dev/null +++ b/progs/a529.py @@ -0,0 +1,7 @@ +def find_even_Pair(A,N):
+ evenPair = 0
+ for i in range(0,N):
+ for j in range(i+1,N):
+ if ((A[i] ^ A[j]) % 2 == 0):
+ evenPair+=1
+ return evenPair;
\ No newline at end of file diff --git a/progs/a53.py b/progs/a53.py new file mode 100644 index 0000000..e27892f --- /dev/null +++ b/progs/a53.py @@ -0,0 +1,3 @@ +def rectangle_perimeter(l,b):
+ perimeter=2*(l+b)
+ return perimeter
\ No newline at end of file diff --git a/progs/a530.py b/progs/a530.py new file mode 100644 index 0000000..fb9221a --- /dev/null +++ b/progs/a530.py @@ -0,0 +1,8 @@ +def next_Power_Of_2(n):
+ count = 0;
+ if (n and not(n & (n - 1))):
+ return n
+ while( n != 0):
+ n >>= 1
+ count += 1
+ return 1 << count;
\ No newline at end of file diff --git a/progs/a531.py b/progs/a531.py new file mode 100644 index 0000000..b87291e --- /dev/null +++ b/progs/a531.py @@ -0,0 +1,5 @@ +def frequency(a,x):
+ count = 0
+ for i in a:
+ if i == x: count += 1
+ return count
\ No newline at end of file diff --git a/progs/a532.py b/progs/a532.py new file mode 100644 index 0000000..dc8e817 --- /dev/null +++ b/progs/a532.py @@ -0,0 +1,10 @@ +def get_pell(n):
+ if (n <= 2):
+ return n
+ a = 1
+ b = 2
+ for i in range(3, n+1):
+ c = 2 * b + a
+ a = b
+ b = c
+ return b
\ No newline at end of file diff --git a/progs/a533.py b/progs/a533.py new file mode 100644 index 0000000..968f72d --- /dev/null +++ b/progs/a533.py @@ -0,0 +1,5 @@ +def sum_range_list(list1, m, n):
+ sum_range = 0
+ for i in range(m, n+1, 1):
+ sum_range += list1[i]
+ return sum_range
\ No newline at end of file diff --git a/progs/a534.py b/progs/a534.py new file mode 100644 index 0000000..5ce269b --- /dev/null +++ b/progs/a534.py @@ -0,0 +1,4 @@ +import math
+def perimeter_pentagon(a):
+ perimeter=(5*a)
+ return perimeter
\ No newline at end of file diff --git a/progs/a535.py b/progs/a535.py new file mode 100644 index 0000000..f72fd65 --- /dev/null +++ b/progs/a535.py @@ -0,0 +1,6 @@ +def count_occurance(s):
+ count=0
+ for i in range(len(s)):
+ if (s[i]== 's' and s[i+1]=='t' and s[i+2]== 'd'):
+ count = count + 1
+ return count
\ No newline at end of file diff --git a/progs/a536.py b/progs/a536.py new file mode 100644 index 0000000..84f7628 --- /dev/null +++ b/progs/a536.py @@ -0,0 +1,4 @@ +import re
+def remove_splchar(text):
+ pattern = re.compile('[\W_]+')
+ return (pattern.sub('', text))
\ No newline at end of file diff --git a/progs/a537.py b/progs/a537.py new file mode 100644 index 0000000..f1b2e6a --- /dev/null +++ b/progs/a537.py @@ -0,0 +1,5 @@ +def group_keyvalue(l):
+ result = {}
+ for k, v in l:
+ result.setdefault(k, []).append(v)
+ return result
\ No newline at end of file diff --git a/progs/a539.py b/progs/a539.py new file mode 100644 index 0000000..f497de7 --- /dev/null +++ b/progs/a539.py @@ -0,0 +1,3 @@ +def perimeter_triangle(a,b,c):
+ perimeter=a+b+c
+ return perimeter
\ No newline at end of file diff --git a/progs/a54.py b/progs/a54.py new file mode 100644 index 0000000..e6dbb1e --- /dev/null +++ b/progs/a54.py @@ -0,0 +1,5 @@ +def fifth_Power_Sum(n) :
+ sm = 0
+ for i in range(1,n+1) :
+ sm = sm + (i*i*i*i*i)
+ return sm
\ No newline at end of file diff --git a/progs/a540.py b/progs/a540.py new file mode 100644 index 0000000..ebc10f0 --- /dev/null +++ b/progs/a540.py @@ -0,0 +1,5 @@ +def answer(L,R):
+ if (2 * L <= R):
+ return (L ,2*L)
+ else:
+ return (-1)
\ No newline at end of file diff --git a/progs/a541.py b/progs/a541.py new file mode 100644 index 0000000..c814a57 --- /dev/null +++ b/progs/a541.py @@ -0,0 +1,7 @@ +import re
+def string_literals(patterns,text):
+ for pattern in patterns:
+ if re.search(pattern, text):
+ return ('Matched!')
+ else:
+ return ('Not Matched!')
\ No newline at end of file diff --git a/progs/a542.py b/progs/a542.py new file mode 100644 index 0000000..a254bee --- /dev/null +++ b/progs/a542.py @@ -0,0 +1,18 @@ +def is_num_keith(x):
+ terms = []
+ temp = x
+ n = 0
+ while (temp > 0):
+ terms.append(temp % 10)
+ temp = int(temp / 10)
+ n+=1
+ terms.reverse()
+ next_term = 0
+ i = n
+ while (next_term < x):
+ next_term = 0
+ for j in range(1,n+1):
+ next_term += terms[i - j]
+ terms.append(next_term)
+ i+=1
+ return (next_term == x)
\ No newline at end of file diff --git a/progs/a543.py b/progs/a543.py new file mode 100644 index 0000000..d8b8305 --- /dev/null +++ b/progs/a543.py @@ -0,0 +1,4 @@ +from math import radians, sin, cos, acos
+def distance_lat_long(slat,slon,elat,elon):
+ dist = 6371.01 * acos(sin(slat)*sin(elat) + cos(slat)*cos(elat)*cos(slon - elon))
+ return dist
\ No newline at end of file diff --git a/progs/a544.py b/progs/a544.py new file mode 100644 index 0000000..aaa2438 --- /dev/null +++ b/progs/a544.py @@ -0,0 +1,18 @@ +def common_prefix_util(str1, str2):
+ result = "";
+ n1 = len(str1)
+ n2 = len(str2)
+ i = 0
+ j = 0
+ while i <= n1 - 1 and j <= n2 - 1:
+ if (str1[i] != str2[j]):
+ break
+ result += str1[i]
+ i += 1
+ j += 1
+ return (result)
+def common_prefix (arr, n):
+ prefix = arr[0]
+ for i in range (1, n):
+ prefix = common_prefix_util(prefix, arr[i])
+ return (prefix)
\ No newline at end of file diff --git a/progs/a546.py b/progs/a546.py new file mode 100644 index 0000000..4b9bbc9 --- /dev/null +++ b/progs/a546.py @@ -0,0 +1,7 @@ +def count_pairs(arr, n, k):
+ count=0;
+ for i in range(0,n):
+ for j in range(i+1, n):
+ if arr[i] - arr[j] == k or arr[j] - arr[i] == k:
+ count += 1
+ return count
\ No newline at end of file diff --git a/progs/a547.py b/progs/a547.py new file mode 100644 index 0000000..e22fcb5 --- /dev/null +++ b/progs/a547.py @@ -0,0 +1,3 @@ +def greater_specificnum(list,num):
+ greater_specificnum=all(x >= num for x in list)
+ return greater_specificnum
\ No newline at end of file diff --git a/progs/a548.py b/progs/a548.py new file mode 100644 index 0000000..0345db2 --- /dev/null +++ b/progs/a548.py @@ -0,0 +1,3 @@ +def parabola_focus(a, b, c):
+ focus= (((-b / (2 * a)),(((4 * a * c) - (b * b) + 1) / (4 * a))))
+ return focus
\ No newline at end of file diff --git a/progs/a549.py b/progs/a549.py new file mode 100644 index 0000000..4bc1643 --- /dev/null +++ b/progs/a549.py @@ -0,0 +1,7 @@ +import re
+def check_literals(text, patterns):
+ for pattern in patterns:
+ if re.search(pattern, text):
+ return ('Matched!')
+ else:
+ return ('Not Matched!')
\ No newline at end of file diff --git a/progs/a55.py b/progs/a55.py new file mode 100644 index 0000000..219b207 --- /dev/null +++ b/progs/a55.py @@ -0,0 +1,7 @@ +def find_Min_Sum(a,b,n):
+ a.sort()
+ b.sort()
+ sum = 0
+ for i in range(n):
+ sum = sum + abs(a[i] - b[i])
+ return sum
\ No newline at end of file diff --git a/progs/a550.py b/progs/a550.py new file mode 100644 index 0000000..222f51e --- /dev/null +++ b/progs/a550.py @@ -0,0 +1,7 @@ +def longest_common_subsequence(X, Y, m, n):
+ if m == 0 or n == 0:
+ return 0
+ elif X[m-1] == Y[n-1]:
+ return 1 + longest_common_subsequence(X, Y, m-1, n-1)
+ else:
+ return max(longest_common_subsequence(X, Y, m, n-1), longest_common_subsequence(X, Y, m-1, n))
\ No newline at end of file diff --git a/progs/a551.py b/progs/a551.py new file mode 100644 index 0000000..6a39745 --- /dev/null +++ b/progs/a551.py @@ -0,0 +1,7 @@ +def prod_Square(n):
+ for i in range(2,(n) + 1):
+ if (i*i < (n+1)):
+ for j in range(2,n + 1):
+ if ((i*i*j*j) == n):
+ return True;
+ return False;
\ No newline at end of file diff --git a/progs/a552.py b/progs/a552.py new file mode 100644 index 0000000..5d11019 --- /dev/null +++ b/progs/a552.py @@ -0,0 +1,17 @@ +def first_Missing_Positive(arr,n):
+ ptr = 0
+ for i in range(n):
+ if arr[i] == 1:
+ ptr = 1
+ break
+ if ptr == 0:
+ return(1)
+ for i in range(n):
+ if arr[i] <= 0 or arr[i] > n:
+ arr[i] = 1
+ for i in range(n):
+ arr[(arr[i] - 1) % n] += n
+ for i in range(n):
+ if arr[i] <= n:
+ return(i + 1)
+ return(n + 1)
\ No newline at end of file diff --git a/progs/a553.py b/progs/a553.py new file mode 100644 index 0000000..ab5fbc4 --- /dev/null +++ b/progs/a553.py @@ -0,0 +1,2 @@ +def count_Intgral_Points(x1,y1,x2,y2):
+ return ((y2 - y1 - 1) * (x2 - x1 - 1))
\ No newline at end of file diff --git a/progs/a554.py b/progs/a554.py new file mode 100644 index 0000000..bc6feab --- /dev/null +++ b/progs/a554.py @@ -0,0 +1,5 @@ +def check_monthnumber(monthname3):
+ if monthname3 =="April" or monthname3== "June" or monthname3== "September" or monthname3== "November":
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a555.py b/progs/a555.py new file mode 100644 index 0000000..449ca5d --- /dev/null +++ b/progs/a555.py @@ -0,0 +1,9 @@ +def check_String(str):
+ flag_l = False
+ flag_n = False
+ for i in str:
+ if i.isalpha():
+ flag_l = True
+ if i.isdigit():
+ flag_n = True
+ return flag_l and flag_n
\ No newline at end of file diff --git a/progs/a556.py b/progs/a556.py new file mode 100644 index 0000000..1ae9d58 --- /dev/null +++ b/progs/a556.py @@ -0,0 +1,3 @@ +def remove_tuple(test_tup):
+ res = tuple(set(test_tup))
+ return (res)
\ No newline at end of file diff --git a/progs/a557.py b/progs/a557.py new file mode 100644 index 0000000..47ccf9d --- /dev/null +++ b/progs/a557.py @@ -0,0 +1,11 @@ +def octal_To_Decimal(n):
+ num = n;
+ dec_value = 0;
+ base = 1;
+ temp = num;
+ while (temp):
+ last_digit = temp % 10;
+ temp = int(temp / 10);
+ dec_value += last_digit*base;
+ base = base * 8;
+ return dec_value;
\ No newline at end of file diff --git a/progs/a558.py b/progs/a558.py new file mode 100644 index 0000000..804d9d5 --- /dev/null +++ b/progs/a558.py @@ -0,0 +1,14 @@ +def first(arr,x,n):
+ low = 0
+ high = n - 1
+ res = -1
+ while (low <= high):
+ mid = (low + high) // 2
+ if arr[mid] > x:
+ high = mid - 1
+ elif arr[mid] < x:
+ low = mid + 1
+ else:
+ res = mid
+ high = mid - 1
+ return res
\ No newline at end of file diff --git a/progs/a559.py b/progs/a559.py new file mode 100644 index 0000000..c782fab --- /dev/null +++ b/progs/a559.py @@ -0,0 +1,3 @@ +def remove_tuples(test_list, K):
+ res = [ele for ele in test_list if len(ele) != K]
+ return (res)
\ No newline at end of file diff --git a/progs/a56.py b/progs/a56.py new file mode 100644 index 0000000..2594f60 --- /dev/null +++ b/progs/a56.py @@ -0,0 +1,10 @@ +import math
+def first_Digit(n) :
+ fact = 1
+ for i in range(2,n + 1) :
+ fact = fact * i
+ while (fact % 10 == 0) :
+ fact = int(fact / 10)
+ while (fact >= 10) :
+ fact = int(fact / 10)
+ return math.floor(fact)
\ No newline at end of file diff --git a/progs/a560.py b/progs/a560.py new file mode 100644 index 0000000..8b1b46e --- /dev/null +++ b/progs/a560.py @@ -0,0 +1,3 @@ +def find_exponentio(test_tup1, test_tup2):
+ res = tuple(ele1 ** ele2 for ele1, ele2 in zip(test_tup1, test_tup2))
+ return (res)
diff --git a/progs/a561.py b/progs/a561.py new file mode 100644 index 0000000..72aba95 --- /dev/null +++ b/progs/a561.py @@ -0,0 +1,6 @@ +import math
+def largest_triangle(a,b):
+ if (a < 0 or b < 0):
+ return -1
+ area = (3 * math.sqrt(3) * pow(a, 2)) / (4 * b);
+ return area
\ No newline at end of file diff --git a/progs/a562.py b/progs/a562.py new file mode 100644 index 0000000..9cf91d4 --- /dev/null +++ b/progs/a562.py @@ -0,0 +1,7 @@ +def highest_Power_of_2(n):
+ res = 0;
+ for i in range(n, 0, -1):
+ if ((i & (i - 1)) == 0):
+ res = i;
+ break;
+ return res;
\ No newline at end of file diff --git a/progs/a563.py b/progs/a563.py new file mode 100644 index 0000000..a8fd5d1 --- /dev/null +++ b/progs/a563.py @@ -0,0 +1,4 @@ +def position_max(list1):
+ max_val = max(list1)
+ max_result = [i for i, j in enumerate(list1) if j == max_val]
+ return max_result
\ No newline at end of file diff --git a/progs/a564.py b/progs/a564.py new file mode 100644 index 0000000..4a5b5c3 --- /dev/null +++ b/progs/a564.py @@ -0,0 +1,2 @@ +def chkList(lst):
+ return len(set(lst)) == 1
\ No newline at end of file diff --git a/progs/a565.py b/progs/a565.py new file mode 100644 index 0000000..2322588 --- /dev/null +++ b/progs/a565.py @@ -0,0 +1,6 @@ +def remove_even(str1):
+ str2 = ''
+ for i in range(1, len(str1) + 1):
+ if(i % 2 != 0):
+ str2 = str2 + str1[i - 1]
+ return str2
\ No newline at end of file diff --git a/progs/a566.py b/progs/a566.py new file mode 100644 index 0000000..4ff8329 --- /dev/null +++ b/progs/a566.py @@ -0,0 +1,7 @@ +def hamming_Distance(n1,n2) :
+ x = n1 ^ n2
+ setBits = 0
+ while (x > 0) :
+ setBits += x & 1
+ x >>= 1
+ return setBits
\ No newline at end of file diff --git a/progs/a567.py b/progs/a567.py new file mode 100644 index 0000000..5caf29d --- /dev/null +++ b/progs/a567.py @@ -0,0 +1,6 @@ +def count(s,c) :
+ res = 0
+ for i in range(len(s)) :
+ if (s[i] == c):
+ res = res + 1
+ return res
\ No newline at end of file diff --git a/progs/a569.py b/progs/a569.py new file mode 100644 index 0000000..226ffd8 --- /dev/null +++ b/progs/a569.py @@ -0,0 +1,3 @@ +def concatenate_elements(test_tup):
+ res = tuple(i + j for i, j in zip(test_tup, test_tup[1:]))
+ return (res)
\ No newline at end of file diff --git a/progs/a57.py b/progs/a57.py new file mode 100644 index 0000000..92aa257 --- /dev/null +++ b/progs/a57.py @@ -0,0 +1,9 @@ +def max_occurrences(list1):
+ max_val = 0
+ result = list1[0]
+ for i in list1:
+ occu = list1.count(i)
+ if occu > max_val:
+ max_val = occu
+ result = i
+ return result
\ No newline at end of file diff --git a/progs/a570.py b/progs/a570.py new file mode 100644 index 0000000..40d8888 --- /dev/null +++ b/progs/a570.py @@ -0,0 +1,10 @@ +def find_longest_repeating_subseq(str):
+ n = len(str)
+ dp = [[0 for k in range(n+1)] for l in range(n+1)]
+ for i in range(1, n+1):
+ for j in range(1, n+1):
+ if (str[i-1] == str[j-1] and i != j):
+ dp[i][j] = 1 + dp[i-1][j-1]
+ else:
+ dp[i][j] = max(dp[i][j-1], dp[i-1][j])
+ return dp[n][n]
\ No newline at end of file diff --git a/progs/a572.py b/progs/a572.py new file mode 100644 index 0000000..d8b4fb6 --- /dev/null +++ b/progs/a572.py @@ -0,0 +1,5 @@ +import heapq as hq
+def heap_replace(heap,a):
+ hq.heapify(heap)
+ hq.heapreplace(heap, a)
+ return heap
\ No newline at end of file diff --git a/progs/a574.py b/progs/a574.py new file mode 100644 index 0000000..9d385a3 --- /dev/null +++ b/progs/a574.py @@ -0,0 +1,5 @@ +def count_Num(n):
+ if (n == 1):
+ return 1
+ count = pow(2,n - 2)
+ return count
\ No newline at end of file diff --git a/progs/a575.py b/progs/a575.py new file mode 100644 index 0000000..9fa7638 --- /dev/null +++ b/progs/a575.py @@ -0,0 +1,6 @@ +import math
+def fourth_Power_Sum(n):
+ sum = 0
+ for i in range(1,n+1) :
+ sum = sum + (i*i*i*i)
+ return sum
\ No newline at end of file diff --git a/progs/a576.py b/progs/a576.py new file mode 100644 index 0000000..c7c8e19 --- /dev/null +++ b/progs/a576.py @@ -0,0 +1,3 @@ +def concatenate_strings(test_tup1, test_tup2):
+ res = tuple(ele1 + ele2 for ele1, ele2 in zip(test_tup1, test_tup2))
+ return (res)
\ No newline at end of file diff --git a/progs/a577.py b/progs/a577.py new file mode 100644 index 0000000..3c79047 --- /dev/null +++ b/progs/a577.py @@ -0,0 +1,4 @@ +import math
+def degree_radian(radian):
+ degree = radian*(180/math.pi)
+ return degree
\ No newline at end of file diff --git a/progs/a578.py b/progs/a578.py new file mode 100644 index 0000000..f8802cf --- /dev/null +++ b/progs/a578.py @@ -0,0 +1,7 @@ +def decode_list(alist):
+ def aux(g):
+ if isinstance(g, list):
+ return [(g[1], range(g[0]))]
+ else:
+ return [(g, [0])]
+ return [x for g in alist for x, R in aux(g) for i in R]
\ No newline at end of file diff --git a/progs/a579.py b/progs/a579.py new file mode 100644 index 0000000..675ecc1 --- /dev/null +++ b/progs/a579.py @@ -0,0 +1,7 @@ +def check_subset_list(list1, list2):
+ l1, l2 = list1[0], list2[0]
+ exist = True
+ for i in list2:
+ if i not in list1:
+ exist = False
+ return exist
\ No newline at end of file diff --git a/progs/a58.py b/progs/a58.py new file mode 100644 index 0000000..fa05089 --- /dev/null +++ b/progs/a58.py @@ -0,0 +1,9 @@ +def Repeat(x):
+ _size = len(x)
+ repeated = []
+ for i in range(_size):
+ k = i + 1
+ for j in range(k, _size):
+ if x[i] == x[j] and x[i] not in repeated:
+ repeated.append(x[i])
+ return repeated
\ No newline at end of file diff --git a/progs/a580.py b/progs/a580.py new file mode 100644 index 0000000..3bc645a --- /dev/null +++ b/progs/a580.py @@ -0,0 +1,8 @@ +def first_Repeated_Char(str):
+ h = {}
+ for ch in str:
+ if ch in h:
+ return ch;
+ else:
+ h[ch] = 0
+ return '\0'
\ No newline at end of file diff --git a/progs/a581.py b/progs/a581.py new file mode 100644 index 0000000..e6a3359 --- /dev/null +++ b/progs/a581.py @@ -0,0 +1,6 @@ +import math
+def min_Operations(A,B):
+ if (A > B):
+ swap(A,B)
+ B = B // math.gcd(A,B);
+ return B - 1
\ No newline at end of file diff --git a/progs/a582.py b/progs/a582.py new file mode 100644 index 0000000..ac44fae --- /dev/null +++ b/progs/a582.py @@ -0,0 +1,10 @@ +
+def extract_min_max(test_tup, K):
+ res = []
+ test_tup = list(test_tup)
+ temp = sorted(test_tup)
+ for idx, val in enumerate(temp):
+ if idx < K or idx >= len(temp) - K:
+ res.append(val)
+ res = tuple(res)
+ return (res)
\ No newline at end of file diff --git a/progs/a583.py b/progs/a583.py new file mode 100644 index 0000000..d9f40c7 --- /dev/null +++ b/progs/a583.py @@ -0,0 +1,3 @@ +import re
+def replace_max_specialchar(text,n):
+ return (re.sub("[ ,.]", ":", text, n))
\ No newline at end of file diff --git a/progs/a584.py b/progs/a584.py new file mode 100644 index 0000000..0833cd2 --- /dev/null +++ b/progs/a584.py @@ -0,0 +1,3 @@ +def first_even(nums):
+ first_even = next((el for el in nums if el%2==0),-1)
+ return first_even
\ No newline at end of file diff --git a/progs/a585.py b/progs/a585.py new file mode 100644 index 0000000..64aa5b2 --- /dev/null +++ b/progs/a585.py @@ -0,0 +1,7 @@ +def check_type(test_tuple):
+ res = True
+ for ele in test_tuple:
+ if not isinstance(ele, type(test_tuple[0])):
+ res = False
+ break
+ return (res)
\ No newline at end of file diff --git a/progs/a586.py b/progs/a586.py new file mode 100644 index 0000000..d22252b --- /dev/null +++ b/progs/a586.py @@ -0,0 +1,18 @@ +def is_majority(arr, n, x):
+ i = binary_search(arr, 0, n-1, x)
+ if i == -1:
+ return False
+ if ((i + n//2) <= (n -1)) and arr[i + n//2] == x:
+ return True
+ else:
+ return False
+def binary_search(arr, low, high, x):
+ if high >= low:
+ mid = (low + high)//2
+ if (mid == 0 or x > arr[mid-1]) and (arr[mid] == x):
+ return mid
+ elif x > arr[mid]:
+ return binary_search(arr, (mid + 1), high, x)
+ else:
+ return binary_search(arr, low, (mid -1), x)
+ return -1
\ No newline at end of file diff --git a/progs/a587.py b/progs/a587.py new file mode 100644 index 0000000..090067e --- /dev/null +++ b/progs/a587.py @@ -0,0 +1,6 @@ +def count_Set_Bits(n):
+ count = 0
+ while (n):
+ count += n & 1
+ n >>= 1
+ return count
\ No newline at end of file diff --git a/progs/a588.py b/progs/a588.py new file mode 100644 index 0000000..2f7f299 --- /dev/null +++ b/progs/a588.py @@ -0,0 +1,10 @@ +def find_Min(arr,low,high):
+ while (low < high):
+ mid = low + (high - low) // 2;
+ if (arr[mid] == arr[high]):
+ high -= 1;
+ elif (arr[mid] > arr[high]):
+ low = mid + 1;
+ else:
+ high = mid;
+ return arr[high];
\ No newline at end of file diff --git a/progs/a589.py b/progs/a589.py new file mode 100644 index 0000000..7d008d2 --- /dev/null +++ b/progs/a589.py @@ -0,0 +1,6 @@ +def odd_values_string(str):
+ result = ""
+ for i in range(len(str)):
+ if i % 2 == 0:
+ result = result + str[i]
+ return result
\ No newline at end of file diff --git a/progs/a59.py b/progs/a59.py new file mode 100644 index 0000000..c0c172b --- /dev/null +++ b/progs/a59.py @@ -0,0 +1,4 @@ +def find_Points(l1,r1,l2,r2):
+ x = min(l1,l2) if (l1 != l2) else -1
+ y = max(r1,r2) if (r1 != r2) else -1
+ return (x,y)
\ No newline at end of file diff --git a/progs/a590.py b/progs/a590.py new file mode 100644 index 0000000..dbca6c1 --- /dev/null +++ b/progs/a590.py @@ -0,0 +1,8 @@ +def min_of_three(a,b,c):
+ if (a <= b) and (a <= c):
+ smallest = a
+ elif (b <= a) and (b <= c):
+ smallest = b
+ else:
+ smallest = c
+ return smallest
\ No newline at end of file diff --git a/progs/a591.py b/progs/a591.py new file mode 100644 index 0000000..3ddb9b2 --- /dev/null +++ b/progs/a591.py @@ -0,0 +1,6 @@ +def all_Bits_Set_In_The_Given_Range(n,l,r):
+ num = (((1 << r) - 1) ^ ((1 << (l - 1)) - 1))
+ new_num = n & num
+ if (new_num == 0):
+ return True
+ return False
\ No newline at end of file diff --git a/progs/a592.py b/progs/a592.py new file mode 100644 index 0000000..b8d4ed9 --- /dev/null +++ b/progs/a592.py @@ -0,0 +1,9 @@ +def re_arrange_array(arr, n):
+ j=0
+ for i in range(0, n):
+ if (arr[i] < 0):
+ temp = arr[i]
+ arr[i] = arr[j]
+ arr[j] = temp
+ j = j + 1
+ return arr
\ No newline at end of file diff --git a/progs/a593.py b/progs/a593.py new file mode 100644 index 0000000..121a170 --- /dev/null +++ b/progs/a593.py @@ -0,0 +1,3 @@ +def replace_blank(str1,char):
+ str2 = str1.replace(' ', char)
+ return str2
\ No newline at end of file diff --git a/progs/a594.py b/progs/a594.py new file mode 100644 index 0000000..3ab2be7 --- /dev/null +++ b/progs/a594.py @@ -0,0 +1,13 @@ +def max_sum(tri, n):
+ if n > 1:
+ tri[1][1] = tri[1][1]+tri[0][0]
+ tri[1][0] = tri[1][0]+tri[0][0]
+ for i in range(2, n):
+ tri[i][0] = tri[i][0] + tri[i-1][0]
+ tri[i][i] = tri[i][i] + tri[i-1][i-1]
+ for j in range(1, i):
+ if tri[i][j]+tri[i-1][j-1] >= tri[i][j]+tri[i-1][j]:
+ tri[i][j] = tri[i][j] + tri[i-1][j-1]
+ else:
+ tri[i][j] = tri[i][j]+tri[i-1][j]
+ return (max(tri[n-1]))
\ No newline at end of file diff --git a/progs/a595.py b/progs/a595.py new file mode 100644 index 0000000..e4ede5e --- /dev/null +++ b/progs/a595.py @@ -0,0 +1,4 @@ +import heapq
+def larg_nnum(list1,n):
+ largest=heapq.nlargest(n,list1)
+ return largest
\ No newline at end of file diff --git a/progs/a596.py b/progs/a596.py new file mode 100644 index 0000000..ac17e20 --- /dev/null +++ b/progs/a596.py @@ -0,0 +1,3 @@ +def lateralsuface_cylinder(r,h):
+ lateralsurface= 2*3.1415*r*h
+ return lateralsurface
\ No newline at end of file diff --git a/progs/a597.py b/progs/a597.py new file mode 100644 index 0000000..29bb3ea --- /dev/null +++ b/progs/a597.py @@ -0,0 +1,3 @@ +def volume_cube(l):
+ volume = l * l * l
+ return volume
\ No newline at end of file diff --git a/progs/a598.py b/progs/a598.py new file mode 100644 index 0000000..e9ed033 --- /dev/null +++ b/progs/a598.py @@ -0,0 +1,8 @@ +def even_bit_set_number(n):
+ count = 0;res = 0;temp = n
+ while(temp > 0):
+ if (count % 2 == 1):
+ res |= (1 << count)
+ count+=1
+ temp >>= 1
+ return (n | res)
\ No newline at end of file diff --git a/progs/a599.py b/progs/a599.py new file mode 100644 index 0000000..789a533 --- /dev/null +++ b/progs/a599.py @@ -0,0 +1,9 @@ +def No_of_Triangle(N,K):
+ if (N < K):
+ return -1;
+ else:
+ Tri_up = 0;
+ Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
+ Tri_down = 0;
+ Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
+ return Tri_up + Tri_down;
\ No newline at end of file diff --git a/progs/a6.py b/progs/a6.py new file mode 100644 index 0000000..466e560 --- /dev/null +++ b/progs/a6.py @@ -0,0 +1,8 @@ +import re
+pattern = 'fox'
+text = 'The quick brown fox jumps over the lazy dog.'
+def find_literals(text, pattern):
+ match = re.search(pattern, text)
+ s = match.start()
+ e = match.end()
+ return (match.re.pattern, s, e)
\ No newline at end of file diff --git a/progs/a60.py b/progs/a60.py new file mode 100644 index 0000000..2118c35 --- /dev/null +++ b/progs/a60.py @@ -0,0 +1,11 @@ +def max_sum_of_three_consecutive(arr, n):
+ sum = [0 for k in range(n)]
+ if n >= 1:
+ sum[0] = arr[0]
+ if n >= 2:
+ sum[1] = arr[0] + arr[1]
+ if n > 2:
+ sum[2] = max(sum[1], max(arr[1] + arr[2], arr[0] + arr[2]))
+ for i in range(3, n):
+ sum[i] = max(max(sum[i-1], sum[i-2] + arr[i]), arr[i] + arr[i-1] + sum[i-3])
+ return sum[n-1]
\ No newline at end of file diff --git a/progs/a600.py b/progs/a600.py new file mode 100644 index 0000000..b495ef6 --- /dev/null +++ b/progs/a600.py @@ -0,0 +1,4 @@ +from collections import Counter
+def check_occurences(test_list):
+ res = dict(Counter(tuple(ele) for ele in map(sorted, test_list)))
+ return (res)
\ No newline at end of file diff --git a/progs/a601.py b/progs/a601.py new file mode 100644 index 0000000..e519c4b --- /dev/null +++ b/progs/a601.py @@ -0,0 +1,3 @@ +def number_of_substrings(str):
+ str_len = len(str);
+ return int(str_len * (str_len + 1) / 2);
\ No newline at end of file diff --git a/progs/a602.py b/progs/a602.py new file mode 100644 index 0000000..1bc248f --- /dev/null +++ b/progs/a602.py @@ -0,0 +1,13 @@ +def get_total_number_of_sequences(m,n):
+ T=[[0 for i in range(n+1)] for i in range(m+1)]
+ for i in range(m+1):
+ for j in range(n+1):
+ if i==0 or j==0:
+ T[i][j]=0
+ elif i<j:
+ T[i][j]=0
+ elif j==1:
+ T[i][j]=i
+ else:
+ T[i][j]=T[i-1][j]+T[i//2][j-1]
+ return T[m][n]
\ No newline at end of file diff --git a/progs/a603.py b/progs/a603.py new file mode 100644 index 0000000..beb649c --- /dev/null +++ b/progs/a603.py @@ -0,0 +1,4 @@ +def replace_list(list1,list2):
+ list1[-1:] = list2
+ replace_list=list1
+ return replace_list
diff --git a/progs/a604.py b/progs/a604.py new file mode 100644 index 0000000..313d424 --- /dev/null +++ b/progs/a604.py @@ -0,0 +1,3 @@ +def array_3d(m,n,o):
+ array_3d = [[ ['*' for col in range(m)] for col in range(n)] for row in range(o)]
+ return array_3d
\ No newline at end of file diff --git a/progs/a605.py b/progs/a605.py new file mode 100644 index 0000000..d820c8d --- /dev/null +++ b/progs/a605.py @@ -0,0 +1,5 @@ +def count_charac(str1):
+ total = 0
+ for i in str1:
+ total = total + 1
+ return total
\ No newline at end of file diff --git a/progs/a607.py b/progs/a607.py new file mode 100644 index 0000000..8015c13 --- /dev/null +++ b/progs/a607.py @@ -0,0 +1,4 @@ +import math
+def next_Perfect_Square(N):
+ nextN = math.floor(math.sqrt(N)) + 1
+ return nextN * nextN
\ No newline at end of file diff --git a/progs/a608.py b/progs/a608.py new file mode 100644 index 0000000..3d66438 --- /dev/null +++ b/progs/a608.py @@ -0,0 +1,15 @@ +def max_sum(arr, n):
+ MSIBS = arr[:]
+ for i in range(n):
+ for j in range(0, i):
+ if arr[i] > arr[j] and MSIBS[i] < MSIBS[j] + arr[i]:
+ MSIBS[i] = MSIBS[j] + arr[i]
+ MSDBS = arr[:]
+ for i in range(1, n + 1):
+ for j in range(1, i):
+ if arr[-i] > arr[-j] and MSDBS[-i] < MSDBS[-j] + arr[-i]:
+ MSDBS[-i] = MSDBS[-j] + arr[-i]
+ max_sum = float("-Inf")
+ for i, j, k in zip(MSIBS, MSDBS, arr):
+ max_sum = max(max_sum, i + j - k)
+ return max_sum
\ No newline at end of file diff --git a/progs/a609.py b/progs/a609.py new file mode 100644 index 0000000..e45607f --- /dev/null +++ b/progs/a609.py @@ -0,0 +1,10 @@ +def babylonian_squareroot(number):
+ if(number == 0):
+ return 0;
+ g = number/2.0;
+ g2 = g + 1;
+ while(g != g2):
+ n = number/ g;
+ g2 = g;
+ g = (g + n)/2;
+ return g;
\ No newline at end of file diff --git a/progs/a610.py b/progs/a610.py new file mode 100644 index 0000000..0d349ee --- /dev/null +++ b/progs/a610.py @@ -0,0 +1,15 @@ +def lps(str):
+ n = len(str)
+ L = [[0 for x in range(n)] for x in range(n)]
+ for i in range(n):
+ L[i][i] = 1
+ for cl in range(2, n+1):
+ for i in range(n-cl+1):
+ j = i+cl-1
+ if str[i] == str[j] and cl == 2:
+ L[i][j] = 2
+ elif str[i] == str[j]:
+ L[i][j] = L[i+1][j-1] + 2
+ else:
+ L[i][j] = max(L[i][j-1], L[i+1][j]);
+ return L[0][n-1]
\ No newline at end of file diff --git a/progs/a611.py b/progs/a611.py new file mode 100644 index 0000000..ed26fe4 --- /dev/null +++ b/progs/a611.py @@ -0,0 +1,5 @@ +def harmonic_sum(n):
+ if n < 2:
+ return 1
+ else:
+ return 1 / n + (harmonic_sum(n - 1))
\ No newline at end of file diff --git a/progs/a613.py b/progs/a613.py new file mode 100644 index 0000000..8577279 --- /dev/null +++ b/progs/a613.py @@ -0,0 +1,6 @@ +def count_X(tup, x):
+ count = 0
+ for ele in tup:
+ if (ele == x):
+ count = count + 1
+ return count
\ No newline at end of file diff --git a/progs/a614.py b/progs/a614.py new file mode 100644 index 0000000..457133b --- /dev/null +++ b/progs/a614.py @@ -0,0 +1,3 @@ +def insert_element(list,element):
+ list = [v for elt in list for v in (element, elt)]
+ return list
\ No newline at end of file diff --git a/progs/a615.py b/progs/a615.py new file mode 100644 index 0000000..36cd1c1 --- /dev/null +++ b/progs/a615.py @@ -0,0 +1,4 @@ +import cmath
+def convert(numbers):
+ num = cmath.polar(numbers)
+ return (num)
\ No newline at end of file diff --git a/progs/a616.py b/progs/a616.py new file mode 100644 index 0000000..0db9470 --- /dev/null +++ b/progs/a616.py @@ -0,0 +1,6 @@ +def count_integer(list1):
+ ctr = 0
+ for i in list1:
+ if isinstance(i, int):
+ ctr = ctr + 1
+ return ctr
\ No newline at end of file diff --git a/progs/a617.py b/progs/a617.py new file mode 100644 index 0000000..5271766 --- /dev/null +++ b/progs/a617.py @@ -0,0 +1,4 @@ +import re
+def words_ae(text):
+ list = re.findall("[ae]\w+", text)
+ return list
\ No newline at end of file diff --git a/progs/a618.py b/progs/a618.py new file mode 100644 index 0000000..c231942 --- /dev/null +++ b/progs/a618.py @@ -0,0 +1,3 @@ +from itertools import combinations_with_replacement
+def combinations_colors(l, n):
+ return list(combinations_with_replacement(l,n))
\ No newline at end of file diff --git a/progs/a619.py b/progs/a619.py new file mode 100644 index 0000000..f756769 --- /dev/null +++ b/progs/a619.py @@ -0,0 +1,11 @@ +def count_Primes_nums(n):
+ ctr = 0
+ for num in range(n):
+ if num <= 1:
+ continue
+ for i in range(2,num):
+ if (num % i) == 0:
+ break
+ else:
+ ctr += 1
+ return ctr
\ No newline at end of file diff --git a/progs/a62.py b/progs/a62.py new file mode 100644 index 0000000..771e781 --- /dev/null +++ b/progs/a62.py @@ -0,0 +1,8 @@ +import sys
+def find_max_val(n, x, y):
+ ans = -sys.maxsize
+ for k in range(n + 1):
+ if (k % x == y):
+ ans = max(ans, k)
+ return (ans if (ans >= 0 and
+ ans <= n) else -1)
\ No newline at end of file diff --git a/progs/a620.py b/progs/a620.py new file mode 100644 index 0000000..0e4513a --- /dev/null +++ b/progs/a620.py @@ -0,0 +1,5 @@ +def swap_numbers(a,b):
+ temp = a
+ a = b
+ b = temp
+ return (a,b)
\ No newline at end of file diff --git a/progs/a622.py b/progs/a622.py new file mode 100644 index 0000000..fa80778 --- /dev/null +++ b/progs/a622.py @@ -0,0 +1,4 @@ +def maximize_elements(test_tup1, test_tup2):
+ res = tuple(tuple(max(a, b) for a, b in zip(tup1, tup2))
+ for tup1, tup2 in zip(test_tup1, test_tup2))
+ return (res)
\ No newline at end of file diff --git a/progs/a623.py b/progs/a623.py new file mode 100644 index 0000000..3e4ade4 --- /dev/null +++ b/progs/a623.py @@ -0,0 +1,4 @@ +def newman_prime(n):
+ if n == 0 or n == 1:
+ return 1
+ return 2 * newman_prime(n - 1) + newman_prime(n - 2)
\ No newline at end of file diff --git a/progs/a624.py b/progs/a624.py new file mode 100644 index 0000000..d7125cc --- /dev/null +++ b/progs/a624.py @@ -0,0 +1,3 @@ +def division_elements(test_tup1, test_tup2):
+ res = tuple(ele1 // ele2 for ele1, ele2 in zip(test_tup1, test_tup2))
+ return (res)
\ No newline at end of file diff --git a/progs/a625.py b/progs/a625.py new file mode 100644 index 0000000..72a246e --- /dev/null +++ b/progs/a625.py @@ -0,0 +1,2 @@ +def split_two_parts(list1, L):
+ return list1[:L], list1[L:]
\ No newline at end of file diff --git a/progs/a626.py b/progs/a626.py new file mode 100644 index 0000000..b131c33 --- /dev/null +++ b/progs/a626.py @@ -0,0 +1,4 @@ +def merge_dict(d1,d2):
+ d = d1.copy()
+ d.update(d2)
+ return d
\ No newline at end of file diff --git a/progs/a627.py b/progs/a627.py new file mode 100644 index 0000000..a96e17c --- /dev/null +++ b/progs/a627.py @@ -0,0 +1,8 @@ +def dog_age(h_age):
+ if h_age < 0:
+ exit()
+ elif h_age <= 2:
+ d_age = h_age * 10.5
+ else:
+ d_age = 21 + (h_age - 2)*4
+ return d_age
\ No newline at end of file diff --git a/progs/a628.py b/progs/a628.py new file mode 100644 index 0000000..69f1961 --- /dev/null +++ b/progs/a628.py @@ -0,0 +1,2 @@ +def list_split(S, step):
+ return [S[i::step] for i in range(step)]
\ No newline at end of file diff --git a/progs/a629.py b/progs/a629.py new file mode 100644 index 0000000..8c2982f --- /dev/null +++ b/progs/a629.py @@ -0,0 +1,3 @@ +def lateralsurface_cube(l):
+ LSA = 4 * (l * l)
+ return LSA
\ No newline at end of file diff --git a/progs/a63.py b/progs/a63.py new file mode 100644 index 0000000..5f9586b --- /dev/null +++ b/progs/a63.py @@ -0,0 +1,11 @@ +def average_Even(n) :
+ if (n% 2!= 0) :
+ return ("Invalid Input")
+ return -1
+ sm = 0
+ count = 0
+ while (n>= 2) :
+ count = count+1
+ sm = sm+n
+ n = n-2
+ return sm // count
\ No newline at end of file diff --git a/progs/a630.py b/progs/a630.py new file mode 100644 index 0000000..9de4ca6 --- /dev/null +++ b/progs/a630.py @@ -0,0 +1,2 @@ +def square_Sum(n):
+ return int(n*(4*n*n-1)/3)
\ No newline at end of file diff --git a/progs/a631.py b/progs/a631.py new file mode 100644 index 0000000..0790cd1 --- /dev/null +++ b/progs/a631.py @@ -0,0 +1,2 @@ +def find_star_num(n):
+ return (6 * n * (n - 1) + 1)
\ No newline at end of file diff --git a/progs/a632.py b/progs/a632.py new file mode 100644 index 0000000..a0e5c26 --- /dev/null +++ b/progs/a632.py @@ -0,0 +1,3 @@ +def ascii_value(k):
+ ch=k
+ return ord(ch)
\ No newline at end of file diff --git a/progs/a633.py b/progs/a633.py new file mode 100644 index 0000000..beb07c0 --- /dev/null +++ b/progs/a633.py @@ -0,0 +1,7 @@ +def sum_even_and_even_index(arr,n):
+ i = 0
+ sum = 0
+ for i in range(0,n,2):
+ if (arr[i] % 2 == 0) :
+ sum += arr[i]
+ return sum
\ No newline at end of file diff --git a/progs/a634.py b/progs/a634.py new file mode 100644 index 0000000..d3bcf99 --- /dev/null +++ b/progs/a634.py @@ -0,0 +1,6 @@ +def even_Power_Sum(n):
+ sum = 0;
+ for i in range(1,n+1):
+ j = 2*i;
+ sum = sum + (j*j*j*j*j);
+ return sum;
\ No newline at end of file diff --git a/progs/a635.py b/progs/a635.py new file mode 100644 index 0000000..cd09d1e --- /dev/null +++ b/progs/a635.py @@ -0,0 +1,3 @@ +def rear_extract(test_list):
+ res = [lis[-1] for lis in test_list]
+ return (res)
\ No newline at end of file diff --git a/progs/a637.py b/progs/a637.py new file mode 100644 index 0000000..93f1fa8 --- /dev/null +++ b/progs/a637.py @@ -0,0 +1,3 @@ +import math
+def even_binomial_Coeff_Sum( n):
+ return (1 << (n - 1))
\ No newline at end of file diff --git a/progs/a638.py b/progs/a638.py new file mode 100644 index 0000000..8d21121 --- /dev/null +++ b/progs/a638.py @@ -0,0 +1,10 @@ +import math as mt
+def get_Position(a,n,m):
+ for i in range(n):
+ a[i] = (a[i] // m + (a[i] % m != 0))
+ result,maxx = -1,-1
+ for i in range(n - 1,-1,-1):
+ if (maxx < a[i]):
+ maxx = a[i]
+ result = i
+ return result + 1
\ No newline at end of file diff --git a/progs/a639.py b/progs/a639.py new file mode 100644 index 0000000..b3acab6 --- /dev/null +++ b/progs/a639.py @@ -0,0 +1,3 @@ +def volume_cylinder(r,h):
+ volume=3.1415*r*r*h
+ return volume
\ No newline at end of file diff --git a/progs/a64.py b/progs/a64.py new file mode 100644 index 0000000..73b23fd --- /dev/null +++ b/progs/a64.py @@ -0,0 +1,5 @@ +def move_last(num_list):
+ a = [num_list[0] for i in range(num_list.count(num_list[0]))]
+ x = [ i for i in num_list if i != num_list[0]]
+ x.extend(a)
+ return (x)
\ No newline at end of file diff --git a/progs/a641.py b/progs/a641.py new file mode 100644 index 0000000..51393cd --- /dev/null +++ b/progs/a641.py @@ -0,0 +1,5 @@ +def count_first_elements(test_tup):
+ for count, ele in enumerate(test_tup):
+ if isinstance(ele, tuple):
+ break
+ return (count)
\ No newline at end of file diff --git a/progs/a642.py b/progs/a642.py new file mode 100644 index 0000000..eebcf33 --- /dev/null +++ b/progs/a642.py @@ -0,0 +1,2 @@ +def is_num_decagonal(n):
+ return 4 * n * n - 3 * n
\ No newline at end of file diff --git a/progs/a643.py b/progs/a643.py new file mode 100644 index 0000000..f1d5b59 --- /dev/null +++ b/progs/a643.py @@ -0,0 +1,9 @@ +def sequential_search(dlist, item):
+ pos = 0
+ found = False
+ while pos < len(dlist) and not found:
+ if dlist[pos] == item:
+ found = True
+ else:
+ pos = pos + 1
+ return found, pos
\ No newline at end of file diff --git a/progs/a644.py b/progs/a644.py new file mode 100644 index 0000000..e7386b8 --- /dev/null +++ b/progs/a644.py @@ -0,0 +1,4 @@ +def all_unique(test_list):
+ if len(test_list) > len(set(test_list)):
+ return False
+ return True
\ No newline at end of file diff --git a/progs/a646.py b/progs/a646.py new file mode 100644 index 0000000..450cbd7 --- /dev/null +++ b/progs/a646.py @@ -0,0 +1,11 @@ +def validate(n):
+ for i in range(10):
+ temp = n;
+ count = 0;
+ while (temp):
+ if (temp % 10 == i):
+ count+=1;
+ if (count > i):
+ return False
+ temp //= 10;
+ return True
\ No newline at end of file diff --git a/progs/a647.py b/progs/a647.py new file mode 100644 index 0000000..fe4d34b --- /dev/null +++ b/progs/a647.py @@ -0,0 +1,3 @@ +def check_element(list,element):
+ check_element=all(v== element for v in list)
+ return check_element
\ No newline at end of file diff --git a/progs/a648.py b/progs/a648.py new file mode 100644 index 0000000..d71fe11 --- /dev/null +++ b/progs/a648.py @@ -0,0 +1,7 @@ +import re
+def text_match_two_three(text):
+ patterns = 'ab{2,3}'
+ if re.search(patterns, text):
+ return 'Found a match!'
+ else:
+ return('Not matched!')
\ No newline at end of file diff --git a/progs/a649.py b/progs/a649.py new file mode 100644 index 0000000..f1b903b --- /dev/null +++ b/progs/a649.py @@ -0,0 +1,10 @@ +def max_sub_array_sum_repeated(a, n, k):
+ max_so_far = -2147483648
+ max_ending_here = 0
+ for i in range(n*k):
+ max_ending_here = max_ending_here + a[i%n]
+ if (max_so_far < max_ending_here):
+ max_so_far = max_ending_here
+ if (max_ending_here < 0):
+ max_ending_here = 0
+ return max_so_far
\ No newline at end of file diff --git a/progs/a65.py b/progs/a65.py new file mode 100644 index 0000000..8b3e0fb --- /dev/null +++ b/progs/a65.py @@ -0,0 +1,6 @@ +def count_char(string,char):
+ count = 0
+ for i in range(len(string)):
+ if(string[i] == char):
+ count = count + 1
+ return count
\ No newline at end of file diff --git a/progs/a650.py b/progs/a650.py new file mode 100644 index 0000000..4516aad --- /dev/null +++ b/progs/a650.py @@ -0,0 +1,2 @@ +def square_Sum(n):
+ return int(2*n*(n+1)*(2*n+1)/3)
\ No newline at end of file diff --git a/progs/a651.py b/progs/a651.py new file mode 100644 index 0000000..e2c1852 --- /dev/null +++ b/progs/a651.py @@ -0,0 +1,6 @@ +def modular_inverse(arr, N, P):
+ current_element = 0
+ for i in range(0, N):
+ if ((arr[i] * arr[i]) % P == 1):
+ current_element = current_element + 1
+ return current_element
\ No newline at end of file diff --git a/progs/a652.py b/progs/a652.py new file mode 100644 index 0000000..52a274b --- /dev/null +++ b/progs/a652.py @@ -0,0 +1,14 @@ +def odd_Days(N):
+ hund1 = N // 100
+ hund4 = N // 400
+ leap = N >> 2
+ ordd = N - leap
+ if (hund1):
+ ordd += hund1
+ leap -= hund1
+ if (hund4):
+ ordd -= hund4
+ leap += hund4
+ days = ordd + leap * 2
+ odd = days % 7
+ return odd
\ No newline at end of file diff --git a/progs/a653.py b/progs/a653.py new file mode 100644 index 0000000..c553010 --- /dev/null +++ b/progs/a653.py @@ -0,0 +1,4 @@ +def max_length(list1):
+ max_length = max(len(x) for x in list1 )
+ max_list = max((x) for x in list1)
+ return(max_length, max_list)
\ No newline at end of file diff --git a/progs/a654.py b/progs/a654.py new file mode 100644 index 0000000..8b15e73 --- /dev/null +++ b/progs/a654.py @@ -0,0 +1,9 @@ +def count_no_of_ways(n, k):
+ dp = [0] * (n + 1)
+ total = k
+ mod = 1000000007
+ dp[1] = k
+ dp[2] = k * k
+ for i in range(3,n+1):
+ dp[i] = ((k - 1) * (dp[i - 1] + dp[i - 2])) % mod
+ return dp[n]
\ No newline at end of file diff --git a/progs/a655.py b/progs/a655.py new file mode 100644 index 0000000..e723d9c --- /dev/null +++ b/progs/a655.py @@ -0,0 +1,3 @@ +def find(n,m):
+ q = n//m
+ return (q)
\ No newline at end of file diff --git a/progs/a656.py b/progs/a656.py new file mode 100644 index 0000000..acb01e2 --- /dev/null +++ b/progs/a656.py @@ -0,0 +1,4 @@ +import math
+def otherside_rightangle(w,h):
+ s=math.sqrt((w*w)+(h*h))
+ return s
\ No newline at end of file diff --git a/progs/a657.py b/progs/a657.py new file mode 100644 index 0000000..db7ed67 --- /dev/null +++ b/progs/a657.py @@ -0,0 +1,3 @@ +def max_val(listval):
+ max_val = max(i for i in listval if isinstance(i, int))
+ return(max_val)
\ No newline at end of file diff --git a/progs/a658.py b/progs/a658.py new file mode 100644 index 0000000..790155b --- /dev/null +++ b/progs/a658.py @@ -0,0 +1,6 @@ +def sum_div(number):
+ divisors = [1]
+ for i in range(2, number):
+ if (number % i)==0:
+ divisors.append(i)
+ return sum(divisors)
\ No newline at end of file diff --git a/progs/a659.py b/progs/a659.py new file mode 100644 index 0000000..b38ab53 --- /dev/null +++ b/progs/a659.py @@ -0,0 +1,7 @@ +def get_Inv_Count(arr,n):
+ inv_count = 0
+ for i in range(n):
+ for j in range(i + 1,n):
+ if (arr[i] > arr[j]):
+ inv_count += 1
+ return inv_count
\ No newline at end of file diff --git a/progs/a66.py b/progs/a66.py new file mode 100644 index 0000000..3a452a2 --- /dev/null +++ b/progs/a66.py @@ -0,0 +1,3 @@ +def Check_Vow(string, vowels):
+ final = [each for each in string if each in vowels]
+ return(len(final))
diff --git a/progs/a660.py b/progs/a660.py new file mode 100644 index 0000000..341c0fc --- /dev/null +++ b/progs/a660.py @@ -0,0 +1,13 @@ +def flatten_list(list1):
+ result_list = []
+ if not list1: return result_list
+ stack = [list(list1)]
+ while stack:
+ c_num = stack.pop()
+ next = c_num.pop()
+ if c_num: stack.append(c_num)
+ if isinstance(next, list):
+ if next: stack.append(list(next))
+ else: result_list.append(next)
+ result_list.reverse()
+ return result_list
\ No newline at end of file diff --git a/progs/a661.py b/progs/a661.py new file mode 100644 index 0000000..124d3f8 --- /dev/null +++ b/progs/a661.py @@ -0,0 +1,3 @@ +def intersection_nested_lists(l1, l2):
+ result = [[n for n in lst if n in l1] for lst in l2]
+ return result
\ No newline at end of file diff --git a/progs/a663.py b/progs/a663.py new file mode 100644 index 0000000..7130b51 --- /dev/null +++ b/progs/a663.py @@ -0,0 +1,7 @@ +def count_binary_seq(n):
+ nCr = 1
+ res = 1
+ for r in range(1, n + 1):
+ nCr = (nCr * (n + 1 - r)) / r
+ res += nCr * nCr
+ return res
\ No newline at end of file diff --git a/progs/a664.py b/progs/a664.py new file mode 100644 index 0000000..60aa164 --- /dev/null +++ b/progs/a664.py @@ -0,0 +1,4 @@ +def dict_depth(d):
+ if isinstance(d, dict):
+ return 1 + (max(map(dict_depth, d.values())) if d else 0)
+ return 0
\ No newline at end of file diff --git a/progs/a665.py b/progs/a665.py new file mode 100644 index 0000000..0a0047e --- /dev/null +++ b/progs/a665.py @@ -0,0 +1,9 @@ +def set_Bit_Number(n):
+ if (n == 0):
+ return 0;
+ msb = 0;
+ n = int(n / 2);
+ while (n > 0):
+ n = int(n / 2);
+ msb += 1;
+ return (1 << msb)
\ No newline at end of file diff --git a/progs/a666.py b/progs/a666.py new file mode 100644 index 0000000..be8c1d9 --- /dev/null +++ b/progs/a666.py @@ -0,0 +1,8 @@ +import sys
+def solve(a,n):
+ mx = -sys.maxsize - 1
+ for j in range(1,n):
+ if (mx > a[j]):
+ return False
+ mx = max(mx,a[j - 1])
+ return True
\ No newline at end of file diff --git a/progs/a667.py b/progs/a667.py new file mode 100644 index 0000000..9360352 --- /dev/null +++ b/progs/a667.py @@ -0,0 +1,10 @@ +def find_Element(arr,ranges,rotations,index) :
+ for i in range(rotations - 1,-1,-1 ) :
+ left = ranges[i][0]
+ right = ranges[i][1]
+ if (left <= index and right >= index) :
+ if (index == left) :
+ index = right
+ else :
+ index = index - 1
+ return arr[index]
\ No newline at end of file diff --git a/progs/a668.py b/progs/a668.py new file mode 100644 index 0000000..49dd545 --- /dev/null +++ b/progs/a668.py @@ -0,0 +1,6 @@ +import re
+def start_withp(words):
+ for w in words:
+ m = re.match("(P\w+)\W(P\w+)", w)
+ if m:
+ return m.groups()
\ No newline at end of file diff --git a/progs/a669.py b/progs/a669.py new file mode 100644 index 0000000..8c0d2da --- /dev/null +++ b/progs/a669.py @@ -0,0 +1,18 @@ +def max_sum_increasing_subseq(a, n, index, k):
+ dp = [[0 for i in range(n)]
+ for i in range(n)]
+ for i in range(n):
+ if a[i] > a[0]:
+ dp[0][i] = a[i] + a[0]
+ else:
+ dp[0][i] = a[i]
+ for i in range(1, n):
+ for j in range(n):
+ if a[j] > a[i] and j > i:
+ if dp[i - 1][i] + a[j] > dp[i - 1][j]:
+ dp[i][j] = dp[i - 1][i] + a[j]
+ else:
+ dp[i][j] = dp[i - 1][j]
+ else:
+ dp[i][j] = dp[i - 1][j]
+ return dp[index][k]
\ No newline at end of file diff --git a/progs/a67.py b/progs/a67.py new file mode 100644 index 0000000..842e41b --- /dev/null +++ b/progs/a67.py @@ -0,0 +1,5 @@ +import re
+def replace(string, char):
+ pattern = char + '{2,}'
+ string = re.sub(pattern, char, string)
+ return string
\ No newline at end of file diff --git a/progs/a670.py b/progs/a670.py new file mode 100644 index 0000000..4fba8b0 --- /dev/null +++ b/progs/a670.py @@ -0,0 +1,5 @@ +from copy import deepcopy
+def colon_tuplex(tuplex,m,n):
+ tuplex_colon = deepcopy(tuplex)
+ tuplex_colon[m].append(n)
+ return tuplex_colon
\ No newline at end of file diff --git a/progs/a671.py b/progs/a671.py new file mode 100644 index 0000000..1aee272 --- /dev/null +++ b/progs/a671.py @@ -0,0 +1,3 @@ +def large_product(nums1, nums2, N):
+ result = sorted([x*y for x in nums1 for y in nums2], reverse=True)[:N]
+ return result
\ No newline at end of file diff --git a/progs/a672.py b/progs/a672.py new file mode 100644 index 0000000..3fbd4ef --- /dev/null +++ b/progs/a672.py @@ -0,0 +1,5 @@ +def maximum(a,b):
+ if a >= b:
+ return a
+ else:
+ return b
\ No newline at end of file diff --git a/progs/a673.py b/progs/a673.py new file mode 100644 index 0000000..5b99fc8 --- /dev/null +++ b/progs/a673.py @@ -0,0 +1,3 @@ +def string_to_tuple(str1):
+ result = tuple(x for x in str1 if not x.isspace())
+ return result
\ No newline at end of file diff --git a/progs/a674.py b/progs/a674.py new file mode 100644 index 0000000..cf8e36a --- /dev/null +++ b/progs/a674.py @@ -0,0 +1,9 @@ +def set_left_most_unset_bit(n):
+ if not (n & (n + 1)):
+ return n
+ pos, temp, count = 0, n, 0
+ while temp:
+ if not (temp & 1):
+ pos = count
+ count += 1; temp>>=1
+ return (n | (1 << (pos)))
\ No newline at end of file diff --git a/progs/a675.py b/progs/a675.py new file mode 100644 index 0000000..1de8c7a --- /dev/null +++ b/progs/a675.py @@ -0,0 +1,4 @@ +import math
+def volume_cone(r,h):
+ volume = (1.0/3) * math.pi * r * r * h
+ return volume
\ No newline at end of file diff --git a/progs/a676.py b/progs/a676.py new file mode 100644 index 0000000..9cd0bb5 --- /dev/null +++ b/progs/a676.py @@ -0,0 +1,4 @@ +def pos_nos(list1):
+ for num in list1:
+ if num >= 0:
+ return num
\ No newline at end of file diff --git a/progs/a677.py b/progs/a677.py new file mode 100644 index 0000000..73a09b9 --- /dev/null +++ b/progs/a677.py @@ -0,0 +1,8 @@ +def max_sum_rectangular_grid(grid, n) :
+ incl = max(grid[0][0], grid[1][0])
+ excl = 0
+ for i in range(1, n) :
+ excl_new = max(excl, incl)
+ incl = excl + max(grid[0][i], grid[1][i])
+ excl = excl_new
+ return max(excl, incl)
\ No newline at end of file diff --git a/progs/a678.py b/progs/a678.py new file mode 100644 index 0000000..2b3d4a0 --- /dev/null +++ b/progs/a678.py @@ -0,0 +1,23 @@ +def find_Max_Len_Even(str):
+ n = len(str)
+ i = 0
+ currlen = 0
+ maxlen = 0
+ st = -1
+ while (i < n):
+ if (str[i] == ' '):
+ if (currlen % 2 == 0):
+ if (maxlen < currlen):
+ maxlen = currlen
+ st = i - currlen
+ currlen = 0
+ else :
+ currlen += 1
+ i += 1
+ if (currlen % 2 == 0):
+ if (maxlen < currlen):
+ maxlen = currlen
+ st = i - currlen
+ if (st == -1):
+ return "-1"
+ return str[st: st + maxlen]
\ No newline at end of file diff --git a/progs/a679.py b/progs/a679.py new file mode 100644 index 0000000..97472a6 --- /dev/null +++ b/progs/a679.py @@ -0,0 +1,13 @@ +def find_last_occurrence(A, x):
+ (left, right) = (0, len(A) - 1)
+ result = -1
+ while left <= right:
+ mid = (left + right) // 2
+ if x == A[mid]:
+ result = mid
+ left = mid + 1
+ elif x < A[mid]:
+ right = mid - 1
+ else:
+ left = mid + 1
+ return result
\ No newline at end of file diff --git a/progs/a680.py b/progs/a680.py new file mode 100644 index 0000000..03f4da8 --- /dev/null +++ b/progs/a680.py @@ -0,0 +1,6 @@ +from itertools import groupby
+def modified_encode(alist):
+ def ctr_ele(el):
+ if len(el)>1: return [len(el), el[0]]
+ else: return el[0]
+ return [ctr_ele(list(group)) for key, group in groupby(alist)]
\ No newline at end of file diff --git a/progs/a681.py b/progs/a681.py new file mode 100644 index 0000000..2282fac --- /dev/null +++ b/progs/a681.py @@ -0,0 +1,9 @@ +def max_volume (s):
+ maxvalue = 0
+ i = 1
+ for i in range(s - 1):
+ j = 1
+ for j in range(s):
+ k = s - i - j
+ maxvalue = max(maxvalue, i * j * k)
+ return maxvalue
\ No newline at end of file diff --git a/progs/a683.py b/progs/a683.py new file mode 100644 index 0000000..90cb153 --- /dev/null +++ b/progs/a683.py @@ -0,0 +1,8 @@ +def sum_difference(n):
+ sumofsquares = 0
+ squareofsum = 0
+ for num in range(1, n+1):
+ sumofsquares += num * num
+ squareofsum += num
+ squareofsum = squareofsum ** 2
+ return squareofsum - sumofsquares
\ No newline at end of file diff --git a/progs/a684.py b/progs/a684.py new file mode 100644 index 0000000..03db71e --- /dev/null +++ b/progs/a684.py @@ -0,0 +1,8 @@ +def find_demlo(s):
+ l = len(s)
+ res = ""
+ for i in range(1,l+1):
+ res = res + str(i)
+ for i in range(l-1,0,-1):
+ res = res + str(i)
+ return res
\ No newline at end of file diff --git a/progs/a685.py b/progs/a685.py new file mode 100644 index 0000000..b0ffc4f --- /dev/null +++ b/progs/a685.py @@ -0,0 +1,4 @@ +def position_min(list1):
+ min_val = min(list1)
+ min_result = [i for i, j in enumerate(list1) if j == min_val]
+ return min_result
\ No newline at end of file diff --git a/progs/a686.py b/progs/a686.py new file mode 100644 index 0000000..960f706 --- /dev/null +++ b/progs/a686.py @@ -0,0 +1,22 @@ +def right_rotate(arr, n, out_of_place, cur):
+ temp = arr[cur]
+ for i in range(cur, out_of_place, -1):
+ arr[i] = arr[i - 1]
+ arr[out_of_place] = temp
+ return arr
+def re_arrange(arr, n):
+ out_of_place = -1
+ for index in range(n):
+ if (out_of_place >= 0):
+ if ((arr[index] >= 0 and arr[out_of_place] < 0) or
+ (arr[index] < 0 and arr[out_of_place] >= 0)):
+ arr = right_rotate(arr, n, out_of_place, index)
+ if (index-out_of_place > 2):
+ out_of_place += 2
+ else:
+ out_of_place = - 1
+ if (out_of_place == -1):
+ if ((arr[index] >= 0 and index % 2 == 0) or
+ (arr[index] < 0 and index % 2 == 1)):
+ out_of_place = index
+ return arr
\ No newline at end of file diff --git a/progs/a687.py b/progs/a687.py new file mode 100644 index 0000000..b189d16 --- /dev/null +++ b/progs/a687.py @@ -0,0 +1,9 @@ +def sum_of_alternates(test_tuple):
+ sum1 = 0
+ sum2 = 0
+ for idx, ele in enumerate(test_tuple):
+ if idx % 2:
+ sum1 += ele
+ else:
+ sum2 += ele
+ return ((sum1),(sum2))
\ No newline at end of file diff --git a/progs/a688.py b/progs/a688.py new file mode 100644 index 0000000..ddfc18e --- /dev/null +++ b/progs/a688.py @@ -0,0 +1,11 @@ +def get_Min_Squares(n):
+ if n <= 3:
+ return n;
+ res = n
+ for x in range(1,n + 1):
+ temp = x * x;
+ if temp > n:
+ break
+ else:
+ res = min(res,1 + get_Min_Squares(n - temp))
+ return res;
\ No newline at end of file diff --git a/progs/a689.py b/progs/a689.py new file mode 100644 index 0000000..5dd684d --- /dev/null +++ b/progs/a689.py @@ -0,0 +1,9 @@ +from collections import defaultdict
+
+def most_occurrences(test_list):
+ temp = defaultdict(int)
+ for sub in test_list:
+ for wrd in sub.split():
+ temp[wrd] += 1
+ res = max(temp, key=temp.get)
+ return (str(res))
\ No newline at end of file diff --git a/progs/a69.py b/progs/a69.py new file mode 100644 index 0000000..0d2a517 --- /dev/null +++ b/progs/a69.py @@ -0,0 +1,5 @@ +def decreasing_trend(nums):
+ if (sorted(nums)== nums):
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a690.py b/progs/a690.py new file mode 100644 index 0000000..118be49 --- /dev/null +++ b/progs/a690.py @@ -0,0 +1,5 @@ +def check_isosceles(x,y,z):
+ if x==y or y==z or z==x:
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a691.py b/progs/a691.py new file mode 100644 index 0000000..03d58df --- /dev/null +++ b/progs/a691.py @@ -0,0 +1,3 @@ +def rotate_left(list1,m,n):
+ result = list1[m:]+list1[:n]
+ return result
\ No newline at end of file diff --git a/progs/a692.py b/progs/a692.py new file mode 100644 index 0000000..201442d --- /dev/null +++ b/progs/a692.py @@ -0,0 +1,6 @@ +def neg_count(list):
+ neg_count= 0
+ for num in list:
+ if num <= 0:
+ neg_count += 1
+ return neg_count
\ No newline at end of file diff --git a/progs/a694.py b/progs/a694.py new file mode 100644 index 0000000..5a670ce --- /dev/null +++ b/progs/a694.py @@ -0,0 +1,8 @@ +def count_unset_bits(n):
+ count = 0
+ x = 1
+ while(x < n + 1):
+ if ((x & n) == 0):
+ count += 1
+ x = x << 1
+ return count
\ No newline at end of file diff --git a/progs/a695.py b/progs/a695.py new file mode 100644 index 0000000..826651d --- /dev/null +++ b/progs/a695.py @@ -0,0 +1,9 @@ +def char_frequency(str1):
+ dict = {}
+ for n in str1:
+ keys = dict.keys()
+ if n in keys:
+ dict[n] += 1
+ else:
+ dict[n] = 1
+ return dict
\ No newline at end of file diff --git a/progs/a697.py b/progs/a697.py new file mode 100644 index 0000000..d139561 --- /dev/null +++ b/progs/a697.py @@ -0,0 +1,5 @@ +def check_Validity(a,b,c):
+ if (a + b <= c) or (a + c <= b) or (b + c <= a) :
+ return False
+ else:
+ return True
\ No newline at end of file diff --git a/progs/a698.py b/progs/a698.py new file mode 100644 index 0000000..47b03c5 --- /dev/null +++ b/progs/a698.py @@ -0,0 +1,3 @@ +def ap_sum(a,n,d):
+ total = (n * (2 * a + (n - 1) * d)) / 2
+ return total
\ No newline at end of file diff --git a/progs/a699.py b/progs/a699.py new file mode 100644 index 0000000..252f8ed --- /dev/null +++ b/progs/a699.py @@ -0,0 +1,5 @@ +def check_monthnum(monthname1):
+ if monthname1 == "February":
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a7.py b/progs/a7.py new file mode 100644 index 0000000..4d08386 --- /dev/null +++ b/progs/a7.py @@ -0,0 +1,8 @@ +def bell_Number(n):
+ bell = [[0 for i in range(n+1)] for j in range(n+1)]
+ bell[0][0] = 1
+ for i in range(1, n+1):
+ bell[i][0] = bell[i-1][i-1]
+ for j in range(1, i+1):
+ bell[i][j] = bell[i-1][j-1] + bell[i][j-1]
+ return bell[n][0]
\ No newline at end of file diff --git a/progs/a70.py b/progs/a70.py new file mode 100644 index 0000000..6e61717 --- /dev/null +++ b/progs/a70.py @@ -0,0 +1,10 @@ +import math
+def get_Pos_Of_Right_most_Set_Bit(n):
+ return int(math.log2(n&-n)+1)
+def set_Right_most_Unset_Bit(n):
+ if (n == 0):
+ return 1
+ if ((n & (n + 1)) == 0):
+ return n
+ pos = get_Pos_Of_Right_most_Set_Bit(~n)
+ return ((1 << (pos - 1)) | n)
\ No newline at end of file diff --git a/progs/a700.py b/progs/a700.py new file mode 100644 index 0000000..474cfb5 --- /dev/null +++ b/progs/a700.py @@ -0,0 +1,7 @@ +import re
+def text_match_word(text):
+ patterns = '\w+\S*$'
+ if re.search(patterns, text):
+ return 'Found a match!'
+ else:
+ return 'Not matched!'
\ No newline at end of file diff --git a/progs/a701.py b/progs/a701.py new file mode 100644 index 0000000..7b8c0fe --- /dev/null +++ b/progs/a701.py @@ -0,0 +1,10 @@ +def check_Equality(s):
+ return (ord(s[0]) == ord(s[len(s) - 1]));
+def count_Substring_With_Equal_Ends(s):
+ result = 0;
+ n = len(s);
+ for i in range(n):
+ for j in range(1,n-i+1):
+ if (check_Equality(s[i:i+j])):
+ result+=1;
+ return result;
\ No newline at end of file diff --git a/progs/a702.py b/progs/a702.py new file mode 100644 index 0000000..05bfd42 --- /dev/null +++ b/progs/a702.py @@ -0,0 +1,4 @@ +def find_Divisor(x,y):
+ if (x==y):
+ return y
+ return 2
\ No newline at end of file diff --git a/progs/a703.py b/progs/a703.py new file mode 100644 index 0000000..d0b9171 --- /dev/null +++ b/progs/a703.py @@ -0,0 +1,2 @@ +def sum_three_smallest_nums(lst):
+ return sum(sorted([x for x in lst if x > 0])[:3])
\ No newline at end of file diff --git a/progs/a704.py b/progs/a704.py new file mode 100644 index 0000000..e4b492f --- /dev/null +++ b/progs/a704.py @@ -0,0 +1,3 @@ +def set_to_tuple(s):
+ t = tuple(sorted(s))
+ return (t)
\ No newline at end of file diff --git a/progs/a707.py b/progs/a707.py new file mode 100644 index 0000000..e78244d --- /dev/null +++ b/progs/a707.py @@ -0,0 +1,2 @@ +def count_Odd_Squares(n,m):
+ return int(m**0.5) - int((n-1)**0.5)
\ No newline at end of file diff --git a/progs/a708.py b/progs/a708.py new file mode 100644 index 0000000..84dda65 --- /dev/null +++ b/progs/a708.py @@ -0,0 +1,3 @@ +def diff_consecutivenums(nums):
+ result = [b-a for a, b in zip(nums[:-1], nums[1:])]
+ return result
\ No newline at end of file diff --git a/progs/a709.py b/progs/a709.py new file mode 100644 index 0000000..7a8d089 --- /dev/null +++ b/progs/a709.py @@ -0,0 +1,6 @@ +def zigzag(n, k):
+ if (n == 0 and k == 0):
+ return 1
+ if (k == 0):
+ return 0
+ return zigzag(n, k - 1) + zigzag(n - 1, n - k)
\ No newline at end of file diff --git a/progs/a71.py b/progs/a71.py new file mode 100644 index 0000000..d77ef0b --- /dev/null +++ b/progs/a71.py @@ -0,0 +1,8 @@ +def max_of_three(num1,num2,num3):
+ if (num1 >= num2) and (num1 >= num3):
+ lnum = num1
+ elif (num2 >= num1) and (num2 >= num3):
+ lnum = num2
+ else:
+ lnum = num3
+ return lnum
\ No newline at end of file diff --git a/progs/a710.py b/progs/a710.py new file mode 100644 index 0000000..53ba065 --- /dev/null +++ b/progs/a710.py @@ -0,0 +1,6 @@ +def count_Squares(m,n):
+ if (n < m):
+ temp = m
+ m = n
+ n = temp
+ return n * (n + 1) * (3 * m - n + 1) // 6
\ No newline at end of file diff --git a/progs/a711.py b/progs/a711.py new file mode 100644 index 0000000..860a306 --- /dev/null +++ b/progs/a711.py @@ -0,0 +1,13 @@ +def bin_coff(n, r):
+ val = 1
+ if (r > (n - r)):
+ r = (n - r)
+ for i in range(0, r):
+ val *= (n - i)
+ val //= (i + 1)
+ return val
+def find_ways(M):
+ n = M // 2
+ a = bin_coff(2 * n, n)
+ b = a // (n + 1)
+ return (b)
\ No newline at end of file diff --git a/progs/a712.py b/progs/a712.py new file mode 100644 index 0000000..72c3bfc --- /dev/null +++ b/progs/a712.py @@ -0,0 +1,7 @@ +def check(string) :
+ p = set(string)
+ s = {'0', '1'}
+ if s == p or p == {'0'} or p == {'1'}:
+ return ("Yes")
+ else :
+ return ("No")
\ No newline at end of file diff --git a/progs/a713.py b/progs/a713.py new file mode 100644 index 0000000..772766f --- /dev/null +++ b/progs/a713.py @@ -0,0 +1,10 @@ +def minimum_Length(s) :
+ maxOcc = 0
+ n = len(s)
+ arr = [0]*26
+ for i in range(n) :
+ arr[ord(s[i]) -ord('a')] += 1
+ for i in range(26) :
+ if arr[i] > maxOcc :
+ maxOcc = arr[i]
+ return n - maxOcc
\ No newline at end of file diff --git a/progs/a714.py b/progs/a714.py new file mode 100644 index 0000000..a4ab447 --- /dev/null +++ b/progs/a714.py @@ -0,0 +1,13 @@ +def first_Element(arr,n,k):
+ count_map = {};
+ for i in range(0, n):
+ if(arr[i] in count_map.keys()):
+ count_map[arr[i]] += 1
+ else:
+ count_map[arr[i]] = 1
+ i += 1
+ for i in range(0, n):
+ if (count_map[arr[i]] == k):
+ return arr[i]
+ i += 1
+ return -1
\ No newline at end of file diff --git a/progs/a715.py b/progs/a715.py new file mode 100644 index 0000000..13c696b --- /dev/null +++ b/progs/a715.py @@ -0,0 +1,6 @@ +def unique_Characters(str):
+ for i in range(len(str)):
+ for j in range(i + 1,len(str)):
+ if (str[i] == str[j]):
+ return False;
+ return True;
\ No newline at end of file diff --git a/progs/a717.py b/progs/a717.py new file mode 100644 index 0000000..427cd29 --- /dev/null +++ b/progs/a717.py @@ -0,0 +1,3 @@ +def tn_ap(a,n,d):
+ tn = a + (n - 1) * d
+ return tn
\ No newline at end of file diff --git a/progs/a718.py b/progs/a718.py new file mode 100644 index 0000000..c0d535b --- /dev/null +++ b/progs/a718.py @@ -0,0 +1,10 @@ +def count_Rectangles(radius):
+ rectangles = 0
+ diameter = 2 * radius
+ diameterSquare = diameter * diameter
+ for a in range(1, 2 * radius):
+ for b in range(1, 2 * radius):
+ diagnalLengthSquare = (a * a + b * b)
+ if (diagnalLengthSquare <= diameterSquare) :
+ rectangles += 1
+ return rectangles
\ No newline at end of file diff --git a/progs/a719.py b/progs/a719.py new file mode 100644 index 0000000..28a11fc --- /dev/null +++ b/progs/a719.py @@ -0,0 +1,3 @@ +def find_angle(a,b):
+ c = 180 - (a + b)
+ return c
diff --git a/progs/a72.py b/progs/a72.py new file mode 100644 index 0000000..0fec899 --- /dev/null +++ b/progs/a72.py @@ -0,0 +1,4 @@ +def convert(list):
+ s = [str(i) for i in list]
+ res = int("".join(s))
+ return (res)
\ No newline at end of file diff --git a/progs/a720.py b/progs/a720.py new file mode 100644 index 0000000..c5ce3e0 --- /dev/null +++ b/progs/a720.py @@ -0,0 +1,3 @@ +def find_max(test_list):
+ res = max(int(j) for i in test_list for j in i)
+ return (res)
\ No newline at end of file diff --git a/progs/a722.py b/progs/a722.py new file mode 100644 index 0000000..6fff9ea --- /dev/null +++ b/progs/a722.py @@ -0,0 +1,5 @@ +def Check_Solution(a,b,c):
+ if (2*b*b == 9*a*c):
+ return ("Yes");
+ else:
+ return ("No");
\ No newline at end of file diff --git a/progs/a723.py b/progs/a723.py new file mode 100644 index 0000000..231ef5e --- /dev/null +++ b/progs/a723.py @@ -0,0 +1,3 @@ +def get_carol(n):
+ result = (2**n) - 1
+ return result * result - 2
\ No newline at end of file diff --git a/progs/a724.py b/progs/a724.py new file mode 100644 index 0000000..6881793 --- /dev/null +++ b/progs/a724.py @@ -0,0 +1,3 @@ +def remove_empty(list1):
+ remove_empty = [x for x in list1 if x]
+ return remove_empty
\ No newline at end of file diff --git a/progs/a725.py b/progs/a725.py new file mode 100644 index 0000000..b542e99 --- /dev/null +++ b/progs/a725.py @@ -0,0 +1,9 @@ +def max_occurrences(nums):
+ max_val = 0
+ result = nums[0]
+ for i in nums:
+ occu = nums.count(i)
+ if occu > max_val:
+ max_val = occu
+ result = i
+ return result
\ No newline at end of file diff --git a/progs/a726.py b/progs/a726.py new file mode 100644 index 0000000..2a96bbf --- /dev/null +++ b/progs/a726.py @@ -0,0 +1,3 @@ +def add_K_element(test_list, K):
+ res = [tuple(j + K for j in sub ) for sub in test_list]
+ return (res)
\ No newline at end of file diff --git a/progs/a727.py b/progs/a727.py new file mode 100644 index 0000000..404a989 --- /dev/null +++ b/progs/a727.py @@ -0,0 +1,11 @@ +def make_flip(ch):
+ return '1' if (ch == '0') else '0'
+def get_flip_with_starting_charcter(str, expected):
+ flip_count = 0
+ for i in range(len( str)):
+ if (str[i] != expected):
+ flip_count += 1
+ expected = make_flip(expected)
+ return flip_count
+def min_flip_to_make_string_alternate(str):
+ return min(get_flip_with_starting_charcter(str, '0'),get_flip_with_starting_charcter(str, '1'))
\ No newline at end of file diff --git a/progs/a728.py b/progs/a728.py new file mode 100644 index 0000000..1d1bf45 --- /dev/null +++ b/progs/a728.py @@ -0,0 +1,6 @@ +def count_Digit(n):
+ count = 0
+ while n != 0:
+ n //= 10
+ count += 1
+ return count
\ No newline at end of file diff --git a/progs/a729.py b/progs/a729.py new file mode 100644 index 0000000..339c5d3 --- /dev/null +++ b/progs/a729.py @@ -0,0 +1,2 @@ +def adjacent_num_product(list_nums):
+ return max(a*b for a, b in zip(list_nums, list_nums[1:]))
\ No newline at end of file diff --git a/progs/a73.py b/progs/a73.py new file mode 100644 index 0000000..3273244 --- /dev/null +++ b/progs/a73.py @@ -0,0 +1,4 @@ +from collections import OrderedDict
+def remove_duplicate(string):
+ result = ' '.join(OrderedDict((w,w) for w in string.split()).keys())
+ return result
\ No newline at end of file diff --git a/progs/a731.py b/progs/a731.py new file mode 100644 index 0000000..14bf68d --- /dev/null +++ b/progs/a731.py @@ -0,0 +1,3 @@ +def repeat_tuples(test_tup, N):
+ res = ((test_tup, ) * N)
+ return (res)
\ No newline at end of file diff --git a/progs/a732.py b/progs/a732.py new file mode 100644 index 0000000..e3f1ec0 --- /dev/null +++ b/progs/a732.py @@ -0,0 +1,3 @@ +def lateralsurface_cuboid(l,w,h):
+ LSA = 2*h*(l+w)
+ return LSA
\ No newline at end of file diff --git a/progs/a734.py b/progs/a734.py new file mode 100644 index 0000000..87acf69 --- /dev/null +++ b/progs/a734.py @@ -0,0 +1,8 @@ +def smallest_missing(A, left_element, right_element):
+ if left_element > right_element:
+ return left_element
+ mid = left_element + (right_element - left_element) // 2
+ if A[mid] == mid:
+ return smallest_missing(A, mid + 1, right_element)
+ else:
+ return smallest_missing(A, left_element, mid - 1)
\ No newline at end of file diff --git a/progs/a735.py b/progs/a735.py new file mode 100644 index 0000000..03a488e --- /dev/null +++ b/progs/a735.py @@ -0,0 +1,5 @@ +import heapq as hq
+def heap_assending(nums):
+ hq.heapify(nums)
+ s_result = [hq.heappop(nums) for i in range(len(nums))]
+ return s_result
\ No newline at end of file diff --git a/progs/a736.py b/progs/a736.py new file mode 100644 index 0000000..884935f --- /dev/null +++ b/progs/a736.py @@ -0,0 +1,3 @@ +def volume_cuboid(l,w,h):
+ volume=l*w*h
+ return volume
\ No newline at end of file diff --git a/progs/a737.py b/progs/a737.py new file mode 100644 index 0000000..80925dc --- /dev/null +++ b/progs/a737.py @@ -0,0 +1,11 @@ +def permute_string(str):
+ if len(str) == 0:
+ return ['']
+ prev_list = permute_string(str[1:len(str)])
+ next_list = []
+ for i in range(0,len(prev_list)):
+ for j in range(0,len(str)):
+ new_str = prev_list[i][0:j]+str[0]+prev_list[i][j:len(str)-1]
+ if new_str not in next_list:
+ next_list.append(new_str)
+ return next_list
\ No newline at end of file diff --git a/progs/a738.py b/progs/a738.py new file mode 100644 index 0000000..27191c1 --- /dev/null +++ b/progs/a738.py @@ -0,0 +1,4 @@ +def round_num(n,m):
+ a = (n //m) * m
+ b = a + m
+ return (b if n - a > b - n else a)
\ No newline at end of file diff --git a/progs/a739.py b/progs/a739.py new file mode 100644 index 0000000..0bffccc --- /dev/null +++ b/progs/a739.py @@ -0,0 +1,5 @@ +def remove_replica(test_tup):
+ temp = set()
+ res = tuple(ele if ele not in temp and not temp.add(ele)
+ else 'MSP' for ele in test_tup)
+ return (res)
\ No newline at end of file diff --git a/progs/a74.py b/progs/a74.py new file mode 100644 index 0000000..394014e --- /dev/null +++ b/progs/a74.py @@ -0,0 +1,6 @@ +def sum_nums(x, y,m,n):
+ sum_nums= x + y
+ if sum_nums in range(m, n):
+ return 20
+ else:
+ return sum_nums
\ No newline at end of file diff --git a/progs/a740.py b/progs/a740.py new file mode 100644 index 0000000..a0f32cf --- /dev/null +++ b/progs/a740.py @@ -0,0 +1,8 @@ +def remove_Char(s,c) :
+ counts = s.count(c)
+ s = list(s)
+ while counts :
+ s.remove(c)
+ counts -= 1
+ s = '' . join(s)
+ return (s)
\ No newline at end of file diff --git a/progs/a741.py b/progs/a741.py new file mode 100644 index 0000000..c7510f5 --- /dev/null +++ b/progs/a741.py @@ -0,0 +1,3 @@ +def move_first(test_list):
+ test_list = test_list[-1:] + test_list[:-1]
+ return test_list
\ No newline at end of file diff --git a/progs/a742.py b/progs/a742.py new file mode 100644 index 0000000..907c58b --- /dev/null +++ b/progs/a742.py @@ -0,0 +1,3 @@ +def surfacearea_cuboid(l,w,h):
+ SA = 2*(l*w + l * h + w * h)
+ return SA
\ No newline at end of file diff --git a/progs/a743.py b/progs/a743.py new file mode 100644 index 0000000..76bd95b --- /dev/null +++ b/progs/a743.py @@ -0,0 +1,6 @@ +def multi_list(rownum,colnum):
+ multi_list = [[0 for col in range(colnum)] for row in range(rownum)]
+ for row in range(rownum):
+ for col in range(colnum):
+ multi_list[row][col]= row*col
+ return multi_list
diff --git a/progs/a744.py b/progs/a744.py new file mode 100644 index 0000000..7299c64 --- /dev/null +++ b/progs/a744.py @@ -0,0 +1,4 @@ +from operator import itemgetter
+def index_on_inner_list(list_data, index_no):
+ result = sorted(list_data, key=itemgetter(index_no))
+ return result
\ No newline at end of file diff --git a/progs/a745.py b/progs/a745.py new file mode 100644 index 0000000..9a21dfa --- /dev/null +++ b/progs/a745.py @@ -0,0 +1,15 @@ +def find_rotation_count(A):
+ (left, right) = (0, len(A) - 1)
+ while left <= right:
+ if A[left] <= A[right]:
+ return left
+ mid = (left + right) // 2
+ next = (mid + 1) % len(A)
+ prev = (mid - 1 + len(A)) % len(A)
+ if A[mid] <= A[next] and A[mid] <= A[prev]:
+ return mid
+ elif A[mid] <= A[right]:
+ right = mid - 1
+ elif A[mid] >= A[left]:
+ left = mid + 1
+ return -1
\ No newline at end of file diff --git a/progs/a746.py b/progs/a746.py new file mode 100644 index 0000000..938c495 --- /dev/null +++ b/progs/a746.py @@ -0,0 +1,8 @@ +def even_bit_toggle_number(n) :
+ res = 0; count = 0; temp = n
+ while(temp > 0 ) :
+ if (count % 2 == 0) :
+ res = res | (1 << count)
+ count = count + 1
+ temp >>= 1
+ return n ^ res
\ No newline at end of file diff --git a/progs/a747.py b/progs/a747.py new file mode 100644 index 0000000..f4ea228 --- /dev/null +++ b/progs/a747.py @@ -0,0 +1,10 @@ +def frequency_Of_Smallest(n,arr):
+ mn = arr[0]
+ freq = 1
+ for i in range(1,n):
+ if (arr[i] < mn):
+ mn = arr[i]
+ freq = 1
+ elif (arr[i] == mn):
+ freq += 1
+ return freq
\ No newline at end of file diff --git a/progs/a748.py b/progs/a748.py new file mode 100644 index 0000000..2378f61 --- /dev/null +++ b/progs/a748.py @@ -0,0 +1,8 @@ +def get_perrin(n):
+ if (n == 0):
+ return 3
+ if (n == 1):
+ return 0
+ if (n == 2):
+ return 2
+ return get_perrin(n - 2) + get_perrin(n - 3)
\ No newline at end of file diff --git a/progs/a749.py b/progs/a749.py new file mode 100644 index 0000000..9c4c559 --- /dev/null +++ b/progs/a749.py @@ -0,0 +1,16 @@ +def swap_count(s):
+ chars = s
+ count_left = 0
+ count_right = 0
+ swap = 0
+ imbalance = 0;
+ for i in range(len(chars)):
+ if chars[i] == '[':
+ count_left += 1
+ if imbalance > 0:
+ swap += imbalance
+ imbalance -= 1
+ elif chars[i] == ']':
+ count_right += 1
+ imbalance = (count_right - count_left)
+ return swap
\ No newline at end of file diff --git a/progs/a75.py b/progs/a75.py new file mode 100644 index 0000000..7092017 --- /dev/null +++ b/progs/a75.py @@ -0,0 +1,4 @@ +import re
+def remove_extra_char(text1):
+ pattern = re.compile('[\W_]+')
+ return (pattern.sub('', text1))
\ No newline at end of file diff --git a/progs/a750.py b/progs/a750.py new file mode 100644 index 0000000..ca69d06 --- /dev/null +++ b/progs/a750.py @@ -0,0 +1,9 @@ +def even_or_odd(N):
+ l = len(N)
+ if (N[l-1] =='0'or N[l-1] =='2'or
+ N[l-1] =='4'or N[l-1] =='6'or
+ N[l-1] =='8'or N[l-1] =='A'or
+ N[l-1] =='C'or N[l-1] =='E'):
+ return ("Even")
+ else:
+ return ("Odd")
\ No newline at end of file diff --git a/progs/a751.py b/progs/a751.py new file mode 100644 index 0000000..1f37c66 --- /dev/null +++ b/progs/a751.py @@ -0,0 +1,7 @@ +def highest_Power_of_2(n):
+ res = 0;
+ for i in range(n, 0, -1):
+ if ((i & (i - 1)) == 0):
+ res = i;
+ break;
+ return res;
\ No newline at end of file diff --git a/progs/a752.py b/progs/a752.py new file mode 100644 index 0000000..fe4d162 --- /dev/null +++ b/progs/a752.py @@ -0,0 +1,6 @@ +def find_lucas(n):
+ if (n == 0):
+ return 2
+ if (n == 1):
+ return 1
+ return find_lucas(n - 1) + find_lucas(n - 2)
\ No newline at end of file diff --git a/progs/a753.py b/progs/a753.py new file mode 100644 index 0000000..c747eba --- /dev/null +++ b/progs/a753.py @@ -0,0 +1,3 @@ +def add_string(list,string):
+ add_string=[string.format(i) for i in list]
+ return add_string
\ No newline at end of file diff --git a/progs/a755.py b/progs/a755.py new file mode 100644 index 0000000..e338956 --- /dev/null +++ b/progs/a755.py @@ -0,0 +1,12 @@ +def get_max_sum (n):
+ res = list()
+ res.append(0)
+ res.append(1)
+ i = 2
+ while i<n + 1:
+ res.append(max(i, (res[int(i / 2)]
+ + res[int(i / 3)] +
+ res[int(i / 4)]
+ + res[int(i / 5)])))
+ i = i + 1
+ return res[n]
\ No newline at end of file diff --git a/progs/a757.py b/progs/a757.py new file mode 100644 index 0000000..0058994 --- /dev/null +++ b/progs/a757.py @@ -0,0 +1,9 @@ +def check_distinct(test_tup):
+ res = True
+ temp = set()
+ for ele in test_tup:
+ if ele in temp:
+ res = False
+ break
+ temp.add(ele)
+ return (res)
\ No newline at end of file diff --git a/progs/a758.py b/progs/a758.py new file mode 100644 index 0000000..eed8169 --- /dev/null +++ b/progs/a758.py @@ -0,0 +1,13 @@ +def first_non_repeating_character(str1):
+ char_order = []
+ ctr = {}
+ for c in str1:
+ if c in ctr:
+ ctr[c] += 1
+ else:
+ ctr[c] = 1
+ char_order.append(c)
+ for c in char_order:
+ if ctr[c] == 1:
+ return c
+ return None
\ No newline at end of file diff --git a/progs/a76.py b/progs/a76.py new file mode 100644 index 0000000..f0231e4 --- /dev/null +++ b/progs/a76.py @@ -0,0 +1,6 @@ +def validity_triangle(a,b,c):
+ total = a + b + c
+ if total == 180:
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a760.py b/progs/a760.py new file mode 100644 index 0000000..2689e93 --- /dev/null +++ b/progs/a760.py @@ -0,0 +1,16 @@ +def median_numbers(a,b,c):
+ if a > b:
+ if a < c:
+ median = a
+ elif b > c:
+ median = b
+ else:
+ median = c
+ else:
+ if a > c:
+ median = a
+ elif b < c:
+ median = b
+ else:
+ median = c
+ return median
\ No newline at end of file diff --git a/progs/a761.py b/progs/a761.py new file mode 100644 index 0000000..664f653 --- /dev/null +++ b/progs/a761.py @@ -0,0 +1,2 @@ +def sum_of_digits(nums):
+ return sum(int(el) for n in nums for el in str(n) if el.isdigit())
\ No newline at end of file diff --git a/progs/a762.py b/progs/a762.py new file mode 100644 index 0000000..6ea034b --- /dev/null +++ b/progs/a762.py @@ -0,0 +1,3 @@ +def bitwise_xor(test_tup1, test_tup2):
+ res = tuple(ele1 ^ ele2 for ele1, ele2 in zip(test_tup1, test_tup2))
+ return (res)
\ No newline at end of file diff --git a/progs/a763.py b/progs/a763.py new file mode 100644 index 0000000..6f2fc59 --- /dev/null +++ b/progs/a763.py @@ -0,0 +1,3 @@ +def extract_freq(test_list):
+ res = len(list(set(tuple(sorted(sub)) for sub in test_list)))
+ return (res)
\ No newline at end of file diff --git a/progs/a764.py b/progs/a764.py new file mode 100644 index 0000000..fdbfe3b --- /dev/null +++ b/progs/a764.py @@ -0,0 +1,4 @@ +def add_nested_tuples(test_tup1, test_tup2):
+ res = tuple(tuple(a + b for a, b in zip(tup1, tup2))
+ for tup1, tup2 in zip(test_tup1, test_tup2))
+ return (res)
\ No newline at end of file diff --git a/progs/a765.py b/progs/a765.py new file mode 100644 index 0000000..0c2e314 --- /dev/null +++ b/progs/a765.py @@ -0,0 +1,7 @@ +def ncr_modp(n, r, p):
+ C = [0 for i in range(r+1)]
+ C[0] = 1
+ for i in range(1, n+1):
+ for j in range(min(i, r), 0, -1):
+ C[j] = (C[j] + C[j-1]) % p
+ return C[r]
\ No newline at end of file diff --git a/progs/a766.py b/progs/a766.py new file mode 100644 index 0000000..cd09339 --- /dev/null +++ b/progs/a766.py @@ -0,0 +1,14 @@ +import re
+def is_valid_URL(str):
+ regex = ("((http|https)://)(www.)?" +
+ "[a-zA-Z0-9@:%._\\+~#?&//=]" +
+ "{2,256}\\.[a-z]" +
+ "{2,6}\\b([-a-zA-Z0-9@:%" +
+ "._\\+~#?&//=]*)")
+ p = re.compile(regex)
+ if (str == None):
+ return False
+ if(re.search(p, str)):
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a767.py b/progs/a767.py new file mode 100644 index 0000000..f50e422 --- /dev/null +++ b/progs/a767.py @@ -0,0 +1,5 @@ +def minimum(a,b):
+ if a <= b:
+ return a
+ else:
+ return b
\ No newline at end of file diff --git a/progs/a768.py b/progs/a768.py new file mode 100644 index 0000000..ab1612a --- /dev/null +++ b/progs/a768.py @@ -0,0 +1,5 @@ +def check_tuplex(tuplex,tuple1):
+ if tuple1 in tuplex:
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a769.py b/progs/a769.py new file mode 100644 index 0000000..416b907 --- /dev/null +++ b/progs/a769.py @@ -0,0 +1,9 @@ +def find_Parity(x):
+ y = x ^ (x >> 1);
+ y = y ^ (y >> 2);
+ y = y ^ (y >> 4);
+ y = y ^ (y >> 8);
+ y = y ^ (y >> 16);
+ if (y & 1):
+ return ("Odd Parity");
+ return ("Even Parity");
\ No newline at end of file diff --git a/progs/a77.py b/progs/a77.py new file mode 100644 index 0000000..f62aab2 --- /dev/null +++ b/progs/a77.py @@ -0,0 +1,3 @@ +def remove_spaces(str1):
+ str1 = str1.replace(' ','')
+ return str1
\ No newline at end of file diff --git a/progs/a772.py b/progs/a772.py new file mode 100644 index 0000000..5b664ff --- /dev/null +++ b/progs/a772.py @@ -0,0 +1,3 @@ +def min_product_tuple(list1):
+ result_min = min([abs(x * y) for x, y in list1] )
+ return result_min
\ No newline at end of file diff --git a/progs/a773.py b/progs/a773.py new file mode 100644 index 0000000..fc85ac4 --- /dev/null +++ b/progs/a773.py @@ -0,0 +1,3 @@ +def min_val(listval):
+ min_val = min(i for i in listval if isinstance(i, int))
+ return min_val
\ No newline at end of file diff --git a/progs/a774.py b/progs/a774.py new file mode 100644 index 0000000..5140495 --- /dev/null +++ b/progs/a774.py @@ -0,0 +1,3 @@ +import re
+def snake_to_camel(word):
+ return ''.join(x.capitalize() or '_' for x in word.split('_'))
\ No newline at end of file diff --git a/progs/a775.py b/progs/a775.py new file mode 100644 index 0000000..011edf9 --- /dev/null +++ b/progs/a775.py @@ -0,0 +1,5 @@ +def remove_odd(l):
+ for i in l:
+ if i % 2 != 0:
+ l.remove(i)
+ return l
\ No newline at end of file diff --git a/progs/a776.py b/progs/a776.py new file mode 100644 index 0000000..8a4206d --- /dev/null +++ b/progs/a776.py @@ -0,0 +1,3 @@ +def extract_nth_element(list1, n):
+ result = [x[n] for x in list1]
+ return result
\ No newline at end of file diff --git a/progs/a777.py b/progs/a777.py new file mode 100644 index 0000000..290a05f --- /dev/null +++ b/progs/a777.py @@ -0,0 +1,12 @@ +def overlapping(list1,list2):
+ c=0
+ d=0
+ for i in list1:
+ c+=1
+ for i in list2:
+ d+=1
+ for i in range(0,c):
+ for j in range(0,d):
+ if(list1[i]==list2[j]):
+ return 1
+ return 0
\ No newline at end of file diff --git a/progs/a778.py b/progs/a778.py new file mode 100644 index 0000000..ad21966 --- /dev/null +++ b/progs/a778.py @@ -0,0 +1,10 @@ +def max_Product(arr):
+ arr_len = len(arr)
+ if (arr_len < 2):
+ return ("No pairs exists")
+ x = arr[0]; y = arr[1]
+ for i in range(0,arr_len):
+ for j in range(i + 1,arr_len):
+ if (arr[i] * arr[j] > x * y):
+ x = arr[i]; y = arr[j]
+ return x,y
\ No newline at end of file diff --git a/progs/a779.py b/progs/a779.py new file mode 100644 index 0000000..6c95c23 --- /dev/null +++ b/progs/a779.py @@ -0,0 +1,8 @@ +MAX = 1000000
+def breakSum(n):
+ dp = [0]*(n+1)
+ dp[0] = 0
+ dp[1] = 1
+ for i in range(2, n+1):
+ dp[i] = max(dp[int(i/2)] + dp[int(i/3)] + dp[int(i/4)], i);
+ return dp[n]
\ No newline at end of file diff --git a/progs/a78.py b/progs/a78.py new file mode 100644 index 0000000..d02c2fd --- /dev/null +++ b/progs/a78.py @@ -0,0 +1,2 @@ +def access_key(ditionary,key):
+ return list(ditionary)[key]
\ No newline at end of file diff --git a/progs/a781.py b/progs/a781.py new file mode 100644 index 0000000..d70c0c8 --- /dev/null +++ b/progs/a781.py @@ -0,0 +1,3 @@ +def Find_Max(lst):
+ maxList = max((x) for x in lst)
+ return maxList
\ No newline at end of file diff --git a/progs/a782.py b/progs/a782.py new file mode 100644 index 0000000..eaaeb95 --- /dev/null +++ b/progs/a782.py @@ -0,0 +1,4 @@ +def round_and_sum(list1):
+ lenght=len(list1)
+ round_and_sum=sum(list(map(round,list1))* lenght)
+ return round_and_sum
\ No newline at end of file diff --git a/progs/a783.py b/progs/a783.py new file mode 100644 index 0000000..34b7aa4 --- /dev/null +++ b/progs/a783.py @@ -0,0 +1,5 @@ +def cube_Sum(n):
+ sum = 0
+ for i in range(1,n + 1):
+ sum += (2*i)*(2*i)*(2*i)
+ return sum
\ No newline at end of file diff --git a/progs/a784.py b/progs/a784.py new file mode 100644 index 0000000..73045af --- /dev/null +++ b/progs/a784.py @@ -0,0 +1,5 @@ +def concatenate_tuple(test_tup):
+ delim = "-"
+ res = ''.join([str(ele) + delim for ele in test_tup])
+ res = res[ : len(res) - len(delim)]
+ return (str(res))
\ No newline at end of file diff --git a/progs/a785.py b/progs/a785.py new file mode 100644 index 0000000..9db1add --- /dev/null +++ b/progs/a785.py @@ -0,0 +1,5 @@ +def find_Average_Of_Cube(n):
+ sum = 0
+ for i in range(1, n + 1):
+ sum += i * i * i
+ return round(sum / n, 6)
\ No newline at end of file diff --git a/progs/a786.py b/progs/a786.py new file mode 100644 index 0000000..f389b2d --- /dev/null +++ b/progs/a786.py @@ -0,0 +1,22 @@ +def get_maxgold(gold, m, n):
+ goldTable = [[0 for i in range(n)]
+ for j in range(m)]
+ for col in range(n-1, -1, -1):
+ for row in range(m):
+ if (col == n-1):
+ right = 0
+ else:
+ right = goldTable[row][col+1]
+ if (row == 0 or col == n-1):
+ right_up = 0
+ else:
+ right_up = goldTable[row-1][col+1]
+ if (row == m-1 or col == n-1):
+ right_down = 0
+ else:
+ right_down = goldTable[row+1][col+1]
+ goldTable[row][col] = gold[row][col] + max(right, right_up, right_down)
+ res = goldTable[0][0]
+ for i in range(1, m):
+ res = max(res, goldTable[i][0])
+ return res
\ No newline at end of file diff --git a/progs/a787.py b/progs/a787.py new file mode 100644 index 0000000..511864b --- /dev/null +++ b/progs/a787.py @@ -0,0 +1,3 @@ +def extract_rear(test_tuple):
+ res = list(sub[len(sub) - 1] for sub in test_tuple)
+ return (res)
\ No newline at end of file diff --git a/progs/a788.py b/progs/a788.py new file mode 100644 index 0000000..7e95056 --- /dev/null +++ b/progs/a788.py @@ -0,0 +1,6 @@ +def count_element_in_list(list1, x):
+ ctr = 0
+ for i in range(len(list1)):
+ if x in list1[i]:
+ ctr+= 1
+ return ctr
\ No newline at end of file diff --git a/progs/a79.py b/progs/a79.py new file mode 100644 index 0000000..20b8646 --- /dev/null +++ b/progs/a79.py @@ -0,0 +1,5 @@ +def increasing_trend(nums):
+ if (sorted(nums)== nums):
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a791.py b/progs/a791.py new file mode 100644 index 0000000..d92ed2e --- /dev/null +++ b/progs/a791.py @@ -0,0 +1,13 @@ +def shell_sort(my_list):
+ gap = len(my_list) // 2
+ while gap > 0:
+ for i in range(gap, len(my_list)):
+ current_item = my_list[i]
+ j = i
+ while j >= gap and my_list[j - gap] > current_item:
+ my_list[j] = my_list[j - gap]
+ j -= gap
+ my_list[j] = current_item
+ gap //= 2
+
+ return my_list
\ No newline at end of file diff --git a/progs/a792.py b/progs/a792.py new file mode 100644 index 0000000..627f870 --- /dev/null +++ b/progs/a792.py @@ -0,0 +1,3 @@ +def and_tuples(test_tup1, test_tup2):
+ res = tuple(ele1 & ele2 for ele1, ele2 in zip(test_tup1, test_tup2))
+ return (res)
\ No newline at end of file diff --git a/progs/a793.py b/progs/a793.py new file mode 100644 index 0000000..de20ece --- /dev/null +++ b/progs/a793.py @@ -0,0 +1,3 @@ +def parabola_directrix(a, b, c):
+ directrix=((int)(c - ((b * b) + 1) * 4 * a ))
+ return directrix
\ No newline at end of file diff --git a/progs/a794.py b/progs/a794.py new file mode 100644 index 0000000..564ce23 --- /dev/null +++ b/progs/a794.py @@ -0,0 +1,7 @@ +def common_element(list1, list2):
+ result = False
+ for x in list1:
+ for y in list2:
+ if x == y:
+ result = True
+ return result
\ No newline at end of file diff --git a/progs/a795.py b/progs/a795.py new file mode 100644 index 0000000..0321581 --- /dev/null +++ b/progs/a795.py @@ -0,0 +1,3 @@ +def median_trapezium(base1,base2,height):
+ median = 0.5 * (base1+ base2)
+ return median
\ No newline at end of file diff --git a/progs/a796.py b/progs/a796.py new file mode 100644 index 0000000..037d6cb --- /dev/null +++ b/progs/a796.py @@ -0,0 +1,6 @@ +def check_greater(arr, number):
+ arr.sort()
+ if number > arr[-1]:
+ return ('Yes, the entered number is greater than those in the array')
+ else:
+ return ('No, entered number is less than those in the array')
\ No newline at end of file diff --git a/progs/a797.py b/progs/a797.py new file mode 100644 index 0000000..da7ac90 --- /dev/null +++ b/progs/a797.py @@ -0,0 +1,7 @@ +import re
+def text_match_one(text):
+ patterns = 'ab+?'
+ if re.search(patterns, text):
+ return 'Found a match!'
+ else:
+ return('Not matched!')
diff --git a/progs/a798.py b/progs/a798.py new file mode 100644 index 0000000..e028b53 --- /dev/null +++ b/progs/a798.py @@ -0,0 +1,2 @@ +def last_Digit(n) :
+ return (n % 10)
\ No newline at end of file diff --git a/progs/a799.py b/progs/a799.py new file mode 100644 index 0000000..5195a90 --- /dev/null +++ b/progs/a799.py @@ -0,0 +1,4 @@ +def neg_nos(list1):
+ for num in list1:
+ if num < 0:
+ return num
\ No newline at end of file diff --git a/progs/a8.py b/progs/a8.py new file mode 100644 index 0000000..b4bf744 --- /dev/null +++ b/progs/a8.py @@ -0,0 +1,3 @@ +def floor_Min(A,B,N):
+ x = max(B - 1,N)
+ return (A*x) // B
\ No newline at end of file diff --git a/progs/a80.py b/progs/a80.py new file mode 100644 index 0000000..799d51a --- /dev/null +++ b/progs/a80.py @@ -0,0 +1,9 @@ +def smallest_Divisor(n):
+ if (n % 2 == 0):
+ return 2;
+ i = 3;
+ while (i*i <= n):
+ if (n % i == 0):
+ return i;
+ i += 2;
+ return n;
\ No newline at end of file diff --git a/progs/a800.py b/progs/a800.py new file mode 100644 index 0000000..a0b3a08 --- /dev/null +++ b/progs/a800.py @@ -0,0 +1,6 @@ +def remove_odd(str1):
+ str2 = ''
+ for i in range(1, len(str1) + 1):
+ if(i % 2 == 0):
+ str2 = str2 + str1[i - 1]
+ return str2
\ No newline at end of file diff --git a/progs/a801.py b/progs/a801.py new file mode 100644 index 0000000..5b0c931 --- /dev/null +++ b/progs/a801.py @@ -0,0 +1,7 @@ +def count_bidirectional(test_list):
+ res = 0
+ for idx in range(0, len(test_list)):
+ for iidx in range(idx + 1, len(test_list)):
+ if test_list[iidx][0] == test_list[idx][1] and test_list[idx][1] == test_list[iidx][0]:
+ res += 1
+ return (str(res))
\ No newline at end of file diff --git a/progs/a802.py b/progs/a802.py new file mode 100644 index 0000000..d1c92cd --- /dev/null +++ b/progs/a802.py @@ -0,0 +1,3 @@ +def multiple_to_single(L):
+ x = int("".join(map(str, L)))
+ return x
\ No newline at end of file diff --git a/progs/a804.py b/progs/a804.py new file mode 100644 index 0000000..a007024 --- /dev/null +++ b/progs/a804.py @@ -0,0 +1,3 @@ +def surfacearea_cube(l):
+ surfacearea= 6*l*l
+ return surfacearea
\ No newline at end of file diff --git a/progs/a805.py b/progs/a805.py new file mode 100644 index 0000000..aeb949e --- /dev/null +++ b/progs/a805.py @@ -0,0 +1,10 @@ +from array import array
+def positive_count(nums):
+ n = len(nums)
+ n1 = 0
+ for x in nums:
+ if x > 0:
+ n1 += 1
+ else:
+ None
+ return round(n1/n,2)
\ No newline at end of file diff --git a/progs/a806.py b/progs/a806.py new file mode 100644 index 0000000..bccb853 --- /dev/null +++ b/progs/a806.py @@ -0,0 +1,6 @@ +def largest_neg(list1):
+ max = list1[0]
+ for x in list1:
+ if x < max :
+ max = x
+ return max
\ No newline at end of file diff --git a/progs/a807.py b/progs/a807.py new file mode 100644 index 0000000..2ee98f6 --- /dev/null +++ b/progs/a807.py @@ -0,0 +1,6 @@ +def trim_tuple(test_list, K):
+ res = []
+ for ele in test_list:
+ N = len(ele)
+ res.append(tuple(list(ele)[K: N - K]))
+ return (str(res))
\ No newline at end of file diff --git a/progs/a808.py b/progs/a808.py new file mode 100644 index 0000000..2d8bef1 --- /dev/null +++ b/progs/a808.py @@ -0,0 +1,4 @@ +def index_multiplication(test_tup1, test_tup2):
+ res = tuple(tuple(a * b for a, b in zip(tup1, tup2))
+ for tup1, tup2 in zip(test_tup1, test_tup2))
+ return (res)
\ No newline at end of file diff --git a/progs/a809.py b/progs/a809.py new file mode 100644 index 0000000..936cd5e --- /dev/null +++ b/progs/a809.py @@ -0,0 +1,7 @@ +from collections import Counter
+def count_Occurrence(tup, lst):
+ count = 0
+ for item in tup:
+ if item in lst:
+ count+= 1
+ return count
\ No newline at end of file diff --git a/progs/a811.py b/progs/a811.py new file mode 100644 index 0000000..2788477 --- /dev/null +++ b/progs/a811.py @@ -0,0 +1,19 @@ +def cal_sum(n):
+ a = 3
+ b = 0
+ c = 2
+ if (n == 0):
+ return 3
+ if (n == 1):
+ return 3
+ if (n == 2):
+ return 5
+ sum = 5
+ while (n > 2):
+ d = a + b
+ sum = sum + d
+ a = b
+ b = c
+ c = d
+ n = n-1
+ return sum
\ No newline at end of file diff --git a/progs/a812.py b/progs/a812.py new file mode 100644 index 0000000..5db5018 --- /dev/null +++ b/progs/a812.py @@ -0,0 +1,6 @@ +def check_Triangle(x1,y1,x2,y2,x3,y3):
+ a = (x1*(y2-y3)+x2*(y3-y1)+x3*(y1-y2))
+ if a == 0:
+ return ('No')
+ else:
+ return ('Yes')
\ No newline at end of file diff --git a/progs/a813.py b/progs/a813.py new file mode 100644 index 0000000..67d4eec --- /dev/null +++ b/progs/a813.py @@ -0,0 +1,3 @@ +def extract_string(str, l):
+ result = [e for e in str if len(e) == l]
+ return result
\ No newline at end of file diff --git a/progs/a815.py b/progs/a815.py new file mode 100644 index 0000000..1c6dbb1 --- /dev/null +++ b/progs/a815.py @@ -0,0 +1,6 @@ +def loss_amount(actual_cost,sale_amount):
+ if(sale_amount > actual_cost):
+ amount = sale_amount - actual_cost
+ return amount
+ else:
+ return None
\ No newline at end of file diff --git a/progs/a816.py b/progs/a816.py new file mode 100644 index 0000000..2809b86 --- /dev/null +++ b/progs/a816.py @@ -0,0 +1,20 @@ +import math
+def sumofFactors(n) :
+ if (n % 2 != 0) :
+ return 0
+ res = 1
+ for i in range(2, (int)(math.sqrt(n)) + 1) :
+ count = 0
+ curr_sum = 1
+ curr_term = 1
+ while (n % i == 0) :
+ count= count + 1
+ n = n // i
+ if (i == 2 and count == 1) :
+ curr_sum = 0
+ curr_term = curr_term * i
+ curr_sum = curr_sum + curr_term
+ res = res * curr_sum
+ if (n >= 2) :
+ res = res * (1 + n)
+ return res
\ No newline at end of file diff --git a/progs/a817.py b/progs/a817.py new file mode 100644 index 0000000..472dac9 --- /dev/null +++ b/progs/a817.py @@ -0,0 +1,7 @@ +import re
+def text_match_wordz(text):
+ patterns = '\w*z.\w*'
+ if re.search(patterns, text):
+ return 'Found a match!'
+ else:
+ return('Not matched!')
\ No newline at end of file diff --git a/progs/a818.py b/progs/a818.py new file mode 100644 index 0000000..377a6e9 --- /dev/null +++ b/progs/a818.py @@ -0,0 +1,5 @@ +def check_monthnumb_number(monthnum2):
+ if(monthnum2==1 or monthnum2==3 or monthnum2==5 or monthnum2==7 or monthnum2==8 or monthnum2==10 or monthnum2==12):
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a819.py b/progs/a819.py new file mode 100644 index 0000000..f6b1e08 --- /dev/null +++ b/progs/a819.py @@ -0,0 +1,3 @@ +def reverse_string_list(stringlist):
+ result = [x[::-1] for x in stringlist]
+ return result
\ No newline at end of file diff --git a/progs/a82.py b/progs/a82.py new file mode 100644 index 0000000..cbd8881 --- /dev/null +++ b/progs/a82.py @@ -0,0 +1,10 @@ +def sum_Square(n) :
+ i = 1
+ while i*i <= n :
+ j = 1
+ while (j*j <= n) :
+ if (i*i+j*j == n) :
+ return True
+ j = j+1
+ i = i+1
+ return False
\ No newline at end of file diff --git a/progs/a820.py b/progs/a820.py new file mode 100644 index 0000000..ffdec8e --- /dev/null +++ b/progs/a820.py @@ -0,0 +1,3 @@ +def Find_Min(lst):
+ minList = min((x) for x in lst)
+ return minList
\ No newline at end of file diff --git a/progs/a821.py b/progs/a821.py new file mode 100644 index 0000000..427df42 --- /dev/null +++ b/progs/a821.py @@ -0,0 +1,3 @@ +def rectangle_area(l,b):
+ area=l*b
+ return area
\ No newline at end of file diff --git a/progs/a823.py b/progs/a823.py new file mode 100644 index 0000000..2c3eea4 --- /dev/null +++ b/progs/a823.py @@ -0,0 +1,2 @@ +def Extract(lst):
+ return [item[0] for item in lst]
\ No newline at end of file diff --git a/progs/a824.py b/progs/a824.py new file mode 100644 index 0000000..5c8fcbd --- /dev/null +++ b/progs/a824.py @@ -0,0 +1,5 @@ +def upper_ctr(str):
+ upper_ctr = 0
+ for i in range(len(str)):
+ if str[i] >= 'A' and str[i] <= 'Z': upper_ctr += 1
+ return upper_ctr
\ No newline at end of file diff --git a/progs/a825.py b/progs/a825.py new file mode 100644 index 0000000..24d9abe --- /dev/null +++ b/progs/a825.py @@ -0,0 +1,7 @@ +def combinations_list(list1):
+ if len(list1) == 0:
+ return [[]]
+ result = []
+ for el in combinations_list(list1[1:]):
+ result += [el, el+[list1[0]]]
+ return result
\ No newline at end of file diff --git a/progs/a826.py b/progs/a826.py new file mode 100644 index 0000000..ce273aa --- /dev/null +++ b/progs/a826.py @@ -0,0 +1,23 @@ +def max_subarray_product(arr):
+ n = len(arr)
+ max_ending_here = 1
+ min_ending_here = 1
+ max_so_far = 0
+ flag = 0
+ for i in range(0, n):
+ if arr[i] > 0:
+ max_ending_here = max_ending_here * arr[i]
+ min_ending_here = min (min_ending_here * arr[i], 1)
+ flag = 1
+ elif arr[i] == 0:
+ max_ending_here = 1
+ min_ending_here = 1
+ else:
+ temp = max_ending_here
+ max_ending_here = max (min_ending_here * arr[i], 1)
+ min_ending_here = temp * arr[i]
+ if (max_so_far < max_ending_here):
+ max_so_far = max_ending_here
+ if flag == 0 and max_so_far == 0:
+ return 0
+ return max_so_far
\ No newline at end of file diff --git a/progs/a827.py b/progs/a827.py new file mode 100644 index 0000000..1d9e61d --- /dev/null +++ b/progs/a827.py @@ -0,0 +1,3 @@ +def check_value(dict, n):
+ result = all(x == n for x in dict.values())
+ return result
\ No newline at end of file diff --git a/progs/a829.py b/progs/a829.py new file mode 100644 index 0000000..6bc62b9 --- /dev/null +++ b/progs/a829.py @@ -0,0 +1,12 @@ +def find_peak_util(arr, low, high, n):
+ mid = low + (high - low)/2
+ mid = int(mid)
+ if ((mid == 0 or arr[mid - 1] <= arr[mid]) and
+ (mid == n - 1 or arr[mid + 1] <= arr[mid])):
+ return mid
+ elif (mid > 0 and arr[mid - 1] > arr[mid]):
+ return find_peak_util(arr, low, (mid - 1), n)
+ else:
+ return find_peak_util(arr, (mid + 1), high, n)
+def find_peak(arr, n):
+ return find_peak_util(arr, 0, n - 1, n)
\ No newline at end of file diff --git a/progs/a83.py b/progs/a83.py new file mode 100644 index 0000000..213440b --- /dev/null +++ b/progs/a83.py @@ -0,0 +1,13 @@ +def count_Char(str,x):
+ count = 0
+ for i in range(len(str)):
+ if (str[i] == x) :
+ count += 1
+ n = 10
+ repititions = n // len(str)
+ count = count * repititions
+ l = n % len(str)
+ for i in range(l):
+ if (str[i] == x):
+ count += 1
+ return count
\ No newline at end of file diff --git a/progs/a830.py b/progs/a830.py new file mode 100644 index 0000000..1541288 --- /dev/null +++ b/progs/a830.py @@ -0,0 +1,10 @@ +def decimal_to_Octal(deciNum):
+ octalNum = 0
+ countval = 1;
+ dNo = deciNum;
+ while (deciNum!= 0):
+ remainder= deciNum % 8;
+ octalNum+= remainder*countval;
+ countval= countval*10;
+ deciNum //= 8;
+ return (octalNum)
\ No newline at end of file diff --git a/progs/a831.py b/progs/a831.py new file mode 100644 index 0000000..117ceeb --- /dev/null +++ b/progs/a831.py @@ -0,0 +1,10 @@ +def max_product(arr, n ):
+ mpis =[0] * (n)
+ for i in range(n):
+ mpis[i] = arr[i]
+ for i in range(1, n):
+ for j in range(i):
+ if (arr[i] > arr[j] and
+ mpis[i] < (mpis[j] * arr[i])):
+ mpis[i] = mpis[j] * arr[i]
+ return max(mpis)
\ No newline at end of file diff --git a/progs/a832.py b/progs/a832.py new file mode 100644 index 0000000..5e11874 --- /dev/null +++ b/progs/a832.py @@ -0,0 +1,15 @@ +def max_profit(price, k):
+ n = len(price)
+ final_profit = [[None for x in range(n)] for y in range(k + 1)]
+ for i in range(k + 1):
+ for j in range(n):
+ if i == 0 or j == 0:
+ final_profit[i][j] = 0
+ else:
+ max_so_far = 0
+ for x in range(j):
+ curr_price = price[j] - price[x] + final_profit[i-1][x]
+ if max_so_far < curr_price:
+ max_so_far = curr_price
+ final_profit[i][j] = max(final_profit[i][j-1], max_so_far)
+ return final_profit[k][n-1]
\ No newline at end of file diff --git a/progs/a833.py b/progs/a833.py new file mode 100644 index 0000000..36c43d1 --- /dev/null +++ b/progs/a833.py @@ -0,0 +1,3 @@ +def add_pairwise(test_tup):
+ res = tuple(i + j for i, j in zip(test_tup, test_tup[1:]))
+ return (res)
\ No newline at end of file diff --git a/progs/a834.py b/progs/a834.py new file mode 100644 index 0000000..3948f46 --- /dev/null +++ b/progs/a834.py @@ -0,0 +1,5 @@ +def find_remainder(arr, lens, n):
+ mul = 1
+ for i in range(lens):
+ mul = (mul * (arr[i] % n)) % n
+ return mul % n
\ No newline at end of file diff --git a/progs/a835.py b/progs/a835.py new file mode 100644 index 0000000..f407838 --- /dev/null +++ b/progs/a835.py @@ -0,0 +1,2 @@ +def check_Consecutive(l):
+ return sorted(l) == list(range(min(l),max(l)+1))
\ No newline at end of file diff --git a/progs/a836.py b/progs/a836.py new file mode 100644 index 0000000..319fd86 --- /dev/null +++ b/progs/a836.py @@ -0,0 +1,3 @@ +def tuple_intersection(test_list1, test_list2):
+ res = set([tuple(sorted(ele)) for ele in test_list1]) & set([tuple(sorted(ele)) for ele in test_list2])
+ return (res)
\ No newline at end of file diff --git a/progs/a837.py b/progs/a837.py new file mode 100644 index 0000000..38c9d68 --- /dev/null +++ b/progs/a837.py @@ -0,0 +1,3 @@ +def replace_char(str1,ch,newch):
+ str2 = str1.replace(ch, newch)
+ return str2
\ No newline at end of file diff --git a/progs/a838.py b/progs/a838.py new file mode 100644 index 0000000..9dfef53 --- /dev/null +++ b/progs/a838.py @@ -0,0 +1,5 @@ +from collections import Counter
+def sort_counter(dict1):
+ x = Counter(dict1)
+ sort_counter=x.most_common()
+ return sort_counter
\ No newline at end of file diff --git a/progs/a839.py b/progs/a839.py new file mode 100644 index 0000000..1aeeb64 --- /dev/null +++ b/progs/a839.py @@ -0,0 +1,3 @@ +def big_sum(nums):
+ sum= max(nums)+min(nums)
+ return sum
\ No newline at end of file diff --git a/progs/a84.py b/progs/a84.py new file mode 100644 index 0000000..f7e6c29 --- /dev/null +++ b/progs/a84.py @@ -0,0 +1,15 @@ +def sum_Of_Primes(n):
+ prime = [True] * (n + 1)
+ p = 2
+ while p * p <= n:
+ if prime[p] == True:
+ i = p * 2
+ while i <= n:
+ prime[i] = False
+ i += p
+ p += 1
+ sum = 0
+ for i in range (2,n + 1):
+ if(prime[i]):
+ sum += i
+ return sum
\ No newline at end of file diff --git a/progs/a840.py b/progs/a840.py new file mode 100644 index 0000000..58cf076 --- /dev/null +++ b/progs/a840.py @@ -0,0 +1,2 @@ +def is_lower(string):
+ return (string.lower())
\ No newline at end of file diff --git a/progs/a842.py b/progs/a842.py new file mode 100644 index 0000000..6759e3e --- /dev/null +++ b/progs/a842.py @@ -0,0 +1,4 @@ +def first_Digit(n) :
+ while n >= 10:
+ n = n / 10;
+ return int(n)
\ No newline at end of file diff --git a/progs/a843.py b/progs/a843.py new file mode 100644 index 0000000..0f192b7 --- /dev/null +++ b/progs/a843.py @@ -0,0 +1,12 @@ +def get_max_occuring_char(str1):
+ ASCII_SIZE = 256
+ ctr = [0] * ASCII_SIZE
+ max = -1
+ ch = ''
+ for i in str1:
+ ctr[ord(i)]+=1;
+ for i in str1:
+ if max < ctr[ord(i)]:
+ max = ctr[ord(i)]
+ ch = i
+ return ch
\ No newline at end of file diff --git a/progs/a844.py b/progs/a844.py new file mode 100644 index 0000000..069b713 --- /dev/null +++ b/progs/a844.py @@ -0,0 +1,8 @@ +def is_subset_sum(set, n, sum):
+ if (sum == 0):
+ return True
+ if (n == 0):
+ return False
+ if (set[n - 1] > sum):
+ return is_subset_sum(set, n - 1, sum)
+ return is_subset_sum(set, n-1, sum) or is_subset_sum(set, n-1, sum-set[n-1])
\ No newline at end of file diff --git a/progs/a845.py b/progs/a845.py new file mode 100644 index 0000000..d263407 --- /dev/null +++ b/progs/a845.py @@ -0,0 +1,7 @@ +import re
+def match(text):
+ pattern = '[A-Z]+[a-z]+$'
+ if re.search(pattern, text):
+ return('Yes')
+ else:
+ return('No')
\ No newline at end of file diff --git a/progs/a846.py b/progs/a846.py new file mode 100644 index 0000000..d77c2e2 --- /dev/null +++ b/progs/a846.py @@ -0,0 +1,8 @@ +def first_Factorial_Divisible_Number(x):
+ i = 1;
+ fact = 1;
+ for i in range(1,x):
+ fact = fact * i
+ if (fact % x == 0):
+ break
+ return i
\ No newline at end of file diff --git a/progs/a847.py b/progs/a847.py new file mode 100644 index 0000000..2de4852 --- /dev/null +++ b/progs/a847.py @@ -0,0 +1,3 @@ +def remove_matching_tuple(test_list1, test_list2):
+ res = [sub for sub in test_list1 if sub not in test_list2]
+ return (res)
\ No newline at end of file diff --git a/progs/a848.py b/progs/a848.py new file mode 100644 index 0000000..594d29b --- /dev/null +++ b/progs/a848.py @@ -0,0 +1,18 @@ +def is_palindrome(n) :
+ divisor = 1
+ while (n / divisor >= 10) :
+ divisor *= 10
+ while (n != 0) :
+ leading = n // divisor
+ trailing = n % 10
+ if (leading != trailing) :
+ return False
+ n = (n % divisor) // 10
+ divisor = divisor // 100
+ return True
+def largest_palindrome(A, n) :
+ A.sort()
+ for i in range(n - 1, -1, -1) :
+ if (is_palindrome(A[i])) :
+ return A[i]
+ return -1
\ No newline at end of file diff --git a/progs/a849.py b/progs/a849.py new file mode 100644 index 0000000..b35a0d0 --- /dev/null +++ b/progs/a849.py @@ -0,0 +1,10 @@ +def nCr(n, r):
+ if (r > n / 2):
+ r = n - r
+ answer = 1
+ for i in range(1, r + 1):
+ answer *= (n - r + i)
+ answer /= i
+ return answer
+def binomial_probability(n, k, p):
+ return (nCr(n, k) * pow(p, k) * pow(1 - p, n - k))
\ No newline at end of file diff --git a/progs/a85.py b/progs/a85.py new file mode 100644 index 0000000..f07b1fe --- /dev/null +++ b/progs/a85.py @@ -0,0 +1,6 @@ +from collections import defaultdict
+def freq_element(test_tup):
+ res = defaultdict(int)
+ for ele in test_tup:
+ res[ele] += 1
+ return (str(dict(res)))
\ No newline at end of file diff --git a/progs/a850.py b/progs/a850.py new file mode 100644 index 0000000..1a39421 --- /dev/null +++ b/progs/a850.py @@ -0,0 +1,9 @@ +def sort_tuple(tup):
+ lst = len(tup)
+ for i in range(0, lst):
+ for j in range(0, lst-i-1):
+ if (tup[j][-1] > tup[j + 1][-1]):
+ temp = tup[j]
+ tup[j]= tup[j + 1]
+ tup[j + 1]= temp
+ return tup
\ No newline at end of file diff --git a/progs/a851.py b/progs/a851.py new file mode 100644 index 0000000..4fd1a4b --- /dev/null +++ b/progs/a851.py @@ -0,0 +1,4 @@ +import math
+def area_pentagon(a):
+ area=(math.sqrt(5*(5+2*math.sqrt(5)))*pow(a,2))/4.0
+ return area
\ No newline at end of file diff --git a/progs/a852.py b/progs/a852.py new file mode 100644 index 0000000..1b0f727 --- /dev/null +++ b/progs/a852.py @@ -0,0 +1,10 @@ +def frequency_Of_Largest(n,arr):
+ mn = arr[0]
+ freq = 1
+ for i in range(1,n):
+ if (arr[i] >mn):
+ mn = arr[i]
+ freq = 1
+ elif (arr[i] == mn):
+ freq += 1
+ return freq
\ No newline at end of file diff --git a/progs/a853.py b/progs/a853.py new file mode 100644 index 0000000..df558ce --- /dev/null +++ b/progs/a853.py @@ -0,0 +1,4 @@ +def extract_symmetric(test_list):
+ temp = set(test_list) & {(b, a) for a, b in test_list}
+ res = {(a, b) for a, b in temp if a < b}
+ return (res)
\ No newline at end of file diff --git a/progs/a854.py b/progs/a854.py new file mode 100644 index 0000000..6c39844 --- /dev/null +++ b/progs/a854.py @@ -0,0 +1,4 @@ +import math
+def sum_gp(a,n,r):
+ total = (a * (1 - math.pow(r, n ))) / (1- r)
+ return total
\ No newline at end of file diff --git a/progs/a855.py b/progs/a855.py new file mode 100644 index 0000000..370a4d9 --- /dev/null +++ b/progs/a855.py @@ -0,0 +1,14 @@ +def binary_search(item_list,item):
+ first = 0
+ last = len(item_list)-1
+ found = False
+ while( first<=last and not found):
+ mid = (first + last)//2
+ if item_list[mid] == item :
+ found = True
+ else:
+ if item < item_list[mid]:
+ last = mid - 1
+ else:
+ first = mid + 1
+ return found
\ No newline at end of file diff --git a/progs/a856.py b/progs/a856.py new file mode 100644 index 0000000..aa5a8e0 --- /dev/null +++ b/progs/a856.py @@ -0,0 +1,50 @@ +import math
+def calculate_polygons(startx, starty, endx, endy, radius):
+ sl = (2 * radius) * math.tan(math.pi / 6)
+ p = sl * 0.5
+ b = sl * math.cos(math.radians(30))
+ w = b * 2
+ h = 2 * sl
+ startx = startx - w
+ starty = starty - h
+ endx = endx + w
+ endy = endy + h
+ origx = startx
+ origy = starty
+ xoffset = b
+ yoffset = 3 * p
+ polygons = []
+ row = 1
+ counter = 0
+ while starty < endy:
+ if row % 2 == 0:
+ startx = origx + xoffset
+ else:
+ startx = origx
+ while startx < endx:
+ p1x = startx
+ p1y = starty + p
+ p2x = startx
+ p2y = starty + (3 * p)
+ p3x = startx + b
+ p3y = starty + h
+ p4x = startx + w
+ p4y = starty + (3 * p)
+ p5x = startx + w
+ p5y = starty + p
+ p6x = startx + b
+ p6y = starty
+ poly = [
+ (p1x, p1y),
+ (p2x, p2y),
+ (p3x, p3y),
+ (p4x, p4y),
+ (p5x, p5y),
+ (p6x, p6y),
+ (p1x, p1y)]
+ polygons.append(poly)
+ counter += 1
+ startx += w
+ starty += yoffset
+ row += 1
+ return polygons
\ No newline at end of file diff --git a/progs/a857.py b/progs/a857.py new file mode 100644 index 0000000..39fba8c --- /dev/null +++ b/progs/a857.py @@ -0,0 +1,3 @@ +def binary_to_integer(test_tup):
+ res = int("".join(str(ele) for ele in test_tup), 2)
+ return (str(res))
\ No newline at end of file diff --git a/progs/a859.py b/progs/a859.py new file mode 100644 index 0000000..2718025 --- /dev/null +++ b/progs/a859.py @@ -0,0 +1,4 @@ +import heapq as hq
+def heap_queue_smallest(nums,n):
+ smallest_nums = hq.nsmallest(n, nums)
+ return smallest_nums
\ No newline at end of file diff --git a/progs/a86.py b/progs/a86.py new file mode 100644 index 0000000..7dedf3c --- /dev/null +++ b/progs/a86.py @@ -0,0 +1,9 @@ +def recur_gcd(a, b):
+ low = min(a, b)
+ high = max(a, b)
+ if low == 0:
+ return high
+ elif low == 1:
+ return 1
+ else:
+ return recur_gcd(low, high%low)
\ No newline at end of file diff --git a/progs/a860.py b/progs/a860.py new file mode 100644 index 0000000..bce4d9e --- /dev/null +++ b/progs/a860.py @@ -0,0 +1,5 @@ +import math
+def surfacearea_cone(r,h):
+ l = math.sqrt(r * r + h * h)
+ SA = math.pi * r * (r + l)
+ return SA
\ No newline at end of file diff --git a/progs/a861.py b/progs/a861.py new file mode 100644 index 0000000..3d50955 --- /dev/null +++ b/progs/a861.py @@ -0,0 +1,9 @@ +def gcd(x, y):
+ gcd = 1
+ if x % y == 0:
+ return y
+ for k in range(int(y / 2), 0, -1):
+ if x % k == 0 and y % k == 0:
+ gcd = k
+ break
+ return gcd
\ No newline at end of file diff --git a/progs/a862.py b/progs/a862.py new file mode 100644 index 0000000..3867b26 --- /dev/null +++ b/progs/a862.py @@ -0,0 +1,3 @@ +def diameter_circle(r):
+ diameter=2*r
+ return diameter
\ No newline at end of file diff --git a/progs/a863.py b/progs/a863.py new file mode 100644 index 0000000..f4d8c79 --- /dev/null +++ b/progs/a863.py @@ -0,0 +1,5 @@ +def concatenate_elements(list):
+ ans = ' '
+ for i in list:
+ ans = ans+ ' '+i
+ return (ans)
\ No newline at end of file diff --git a/progs/a864.py b/progs/a864.py new file mode 100644 index 0000000..b9ce38d --- /dev/null +++ b/progs/a864.py @@ -0,0 +1,19 @@ +def ngcd(x,y):
+ i=1
+ while(i<=x and i<=y):
+ if(x%i==0 and y%i == 0):
+ gcd=i;
+ i+=1
+ return gcd;
+def num_comm_div(x,y):
+ n = ngcd(x,y)
+ result = 0
+ z = int(n**0.5)
+ i = 1
+ while(i <= z):
+ if(n % i == 0):
+ result += 2
+ if(i == n/i):
+ result-=1
+ i+=1
+ return result
\ No newline at end of file diff --git a/progs/a865.py b/progs/a865.py new file mode 100644 index 0000000..59d630b --- /dev/null +++ b/progs/a865.py @@ -0,0 +1,3 @@ +def find(n,m):
+ r = n%m
+ return (r)
\ No newline at end of file diff --git a/progs/a866.py b/progs/a866.py new file mode 100644 index 0000000..651da78 --- /dev/null +++ b/progs/a866.py @@ -0,0 +1,3 @@ +def add_consecutive_nums(nums):
+ result = [b+a for a, b in zip(nums[:-1], nums[1:])]
+ return result
\ No newline at end of file diff --git a/progs/a867.py b/progs/a867.py new file mode 100644 index 0000000..c8fc7bf --- /dev/null +++ b/progs/a867.py @@ -0,0 +1,5 @@ +def sum_Of_Series(n):
+ sum = 0
+ for i in range(1,n + 1):
+ sum += i * i*i
+ return sum
\ No newline at end of file diff --git a/progs/a868.py b/progs/a868.py new file mode 100644 index 0000000..fa2a9d2 --- /dev/null +++ b/progs/a868.py @@ -0,0 +1,9 @@ +def re_order(A):
+ k = 0
+ for i in A:
+ if i:
+ A[k] = i
+ k = k + 1
+ for i in range(k, len(A)):
+ A[i] = 0
+ return A
\ No newline at end of file diff --git a/progs/a869.py b/progs/a869.py new file mode 100644 index 0000000..4c6a66f --- /dev/null +++ b/progs/a869.py @@ -0,0 +1,13 @@ +def permutation_coefficient(n, k):
+ P = [[0 for i in range(k + 1)]
+ for j in range(n + 1)]
+ for i in range(n + 1):
+ for j in range(min(i, k) + 1):
+ if (j == 0):
+ P[i][j] = 1
+ else:
+ P[i][j] = P[i - 1][j] + (
+ j * P[i - 1][j - 1])
+ if (j < k):
+ P[i][j + 1] = 0
+ return P[n][k]
\ No newline at end of file diff --git a/progs/a87.py b/progs/a87.py new file mode 100644 index 0000000..d41eb77 --- /dev/null +++ b/progs/a87.py @@ -0,0 +1,5 @@ +import cmath
+def len_complex(a,b):
+ cn=complex(a,b)
+ length=abs(cn)
+ return length
\ No newline at end of file diff --git a/progs/a870.py b/progs/a870.py new file mode 100644 index 0000000..ed9bae7 --- /dev/null +++ b/progs/a870.py @@ -0,0 +1,5 @@ +def remove_words(list1, removewords):
+ for word in list(list1):
+ if word in removewords:
+ list1.remove(word)
+ return list1
\ No newline at end of file diff --git a/progs/a871.py b/progs/a871.py new file mode 100644 index 0000000..1a0e562 --- /dev/null +++ b/progs/a871.py @@ -0,0 +1,5 @@ +def same_order(l1, l2):
+ common_elements = set(l1) & set(l2)
+ l1 = [e for e in l1 if e in common_elements]
+ l2 = [e for e in l2 if e in common_elements]
+ return l1 == l2
\ No newline at end of file diff --git a/progs/a872.py b/progs/a872.py new file mode 100644 index 0000000..ee96b9c --- /dev/null +++ b/progs/a872.py @@ -0,0 +1,11 @@ +def average_Odd(n) :
+ if (n%2==0) :
+ return ("Invalid Input")
+ return -1
+ sm =0
+ count =0
+ while (n>=1) :
+ count=count+1
+ sm = sm + n
+ n = n-2
+ return sm//count
\ No newline at end of file diff --git a/progs/a873.py b/progs/a873.py new file mode 100644 index 0000000..dbde9d2 --- /dev/null +++ b/progs/a873.py @@ -0,0 +1,10 @@ +def no_of_subsequences(arr, k):
+ n = len(arr)
+ dp = [[0 for i in range(n + 1)]
+ for j in range(k + 1)]
+ for i in range(1, k + 1):
+ for j in range(1, n + 1):
+ dp[i][j] = dp[i][j - 1]
+ if arr[j - 1] <= i and arr[j - 1] > 0:
+ dp[i][j] += dp[i // arr[j - 1]][j - 1] + 1
+ return dp[k][n]
\ No newline at end of file diff --git a/progs/a874.py b/progs/a874.py new file mode 100644 index 0000000..82ae592 --- /dev/null +++ b/progs/a874.py @@ -0,0 +1,10 @@ +def find_Min_Sum(num):
+ sum = 0
+ i = 2
+ while(i * i <= num):
+ while(num % i == 0):
+ sum += i
+ num /= i
+ i += 1
+ sum += num
+ return sum
\ No newline at end of file diff --git a/progs/a876.py b/progs/a876.py new file mode 100644 index 0000000..234a1f7 --- /dev/null +++ b/progs/a876.py @@ -0,0 +1,3 @@ +def add_str(test_tup, K):
+ res = [ele for sub in test_tup for ele in (sub, K)]
+ return (res)
\ No newline at end of file diff --git a/progs/a877.py b/progs/a877.py new file mode 100644 index 0000000..4d874f4 --- /dev/null +++ b/progs/a877.py @@ -0,0 +1,3 @@ +def sum_elements(test_tup):
+ res = sum(list(test_tup))
+ return (res)
\ No newline at end of file diff --git a/progs/a878.py b/progs/a878.py new file mode 100644 index 0000000..a67f30a --- /dev/null +++ b/progs/a878.py @@ -0,0 +1,17 @@ +def modular_sum(arr, n, m):
+ if (n > m):
+ return True
+ DP = [False for i in range(m)]
+ for i in range(n):
+ if (DP[0]):
+ return True
+ temp = [False for i in range(m)]
+ for j in range(m):
+ if (DP[j] == True):
+ if (DP[(j + arr[i]) % m] == False):
+ temp[(j + arr[i]) % m] = True
+ for j in range(m):
+ if (temp[j]):
+ DP[j] = True
+ DP[arr[i] % m] = True
+ return DP[0]
\ No newline at end of file diff --git a/progs/a88.py b/progs/a88.py new file mode 100644 index 0000000..bb791fd --- /dev/null +++ b/progs/a88.py @@ -0,0 +1,12 @@ +def min_jumps(arr, n):
+ jumps = [0 for i in range(n)]
+ if (n == 0) or (arr[0] == 0):
+ return float('inf')
+ jumps[0] = 0
+ for i in range(1, n):
+ jumps[i] = float('inf')
+ for j in range(i):
+ if (i <= j + arr[j]) and (jumps[j] != float('inf')):
+ jumps[i] = min(jumps[i], jumps[j] + 1)
+ break
+ return jumps[n-1]
\ No newline at end of file diff --git a/progs/a880.py b/progs/a880.py new file mode 100644 index 0000000..a2fa0b7 --- /dev/null +++ b/progs/a880.py @@ -0,0 +1,6 @@ +def largest_pos(list1):
+ max = list1[0]
+ for x in list1:
+ if x > max :
+ max = x
+ return max
\ No newline at end of file diff --git a/progs/a881.py b/progs/a881.py new file mode 100644 index 0000000..5fae891 --- /dev/null +++ b/progs/a881.py @@ -0,0 +1,4 @@ +import math
+def sqrt_root(num):
+ sqrt_root = math.pow(num, 0.5)
+ return sqrt_root
\ No newline at end of file diff --git a/progs/a882.py b/progs/a882.py new file mode 100644 index 0000000..ba27baa --- /dev/null +++ b/progs/a882.py @@ -0,0 +1,4 @@ +import math
+def volume_tetrahedron(num):
+ volume = (num ** 3 / (6 * math.sqrt(2)))
+ return round(volume, 2)
\ No newline at end of file diff --git a/progs/a883.py b/progs/a883.py new file mode 100644 index 0000000..a72df99 --- /dev/null +++ b/progs/a883.py @@ -0,0 +1,22 @@ +def find_lcm(num1, num2):
+ if(num1>num2):
+ num = num1
+ den = num2
+ else:
+ num = num2
+ den = num1
+ rem = num % den
+ while (rem != 0):
+ num = den
+ den = rem
+ rem = num % den
+ gcd = den
+ lcm = int(int(num1 * num2)/int(gcd))
+ return lcm
+def get_lcm(l):
+ num1 = l[0]
+ num2 = l[1]
+ lcm = find_lcm(num1, num2)
+ for i in range(2, len(l)):
+ lcm = find_lcm(lcm, l[i])
+ return lcm
\ No newline at end of file diff --git a/progs/a884.py b/progs/a884.py new file mode 100644 index 0000000..39e90e1 --- /dev/null +++ b/progs/a884.py @@ -0,0 +1,5 @@ +def check_isosceles(x,y,z):
+ if x!=y & y!=z & z!=x:
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a885.py b/progs/a885.py new file mode 100644 index 0000000..578b517 --- /dev/null +++ b/progs/a885.py @@ -0,0 +1,16 @@ +def lbs(arr):
+ n = len(arr)
+ lis = [1 for i in range(n+1)]
+ for i in range(1 , n):
+ for j in range(0 , i):
+ if ((arr[i] > arr[j]) and (lis[i] < lis[j] +1)):
+ lis[i] = lis[j] + 1
+ lds = [1 for i in range(n+1)]
+ for i in reversed(range(n-1)):
+ for j in reversed(range(i-1 ,n)):
+ if(arr[i] > arr[j] and lds[i] < lds[j] + 1):
+ lds[i] = lds[j] + 1
+ maximum = lis[0] + lds[0] - 1
+ for i in range(1 , n):
+ maximum = max((lis[i] + lds[i]-1), maximum)
+ return maximum
\ No newline at end of file diff --git a/progs/a887.py b/progs/a887.py new file mode 100644 index 0000000..9d4965d --- /dev/null +++ b/progs/a887.py @@ -0,0 +1,14 @@ +def max_sum_increasing_subsequence(arr, n):
+ max = 0
+ msis = [0 for x in range(n)]
+ for i in range(n):
+ msis[i] = arr[i]
+ for i in range(1, n):
+ for j in range(i):
+ if (arr[i] > arr[j] and
+ msis[i] < msis[j] + arr[i]):
+ msis[i] = msis[j] + arr[i]
+ for i in range(n):
+ if max < msis[i]:
+ max = msis[i]
+ return max
\ No newline at end of file diff --git a/progs/a888.py b/progs/a888.py new file mode 100644 index 0000000..6332695 --- /dev/null +++ b/progs/a888.py @@ -0,0 +1,2 @@ +def parallel_lines(line1, line2):
+ return line1[0]/line1[1] == line2[0]/line2[1]
\ No newline at end of file diff --git a/progs/a89.py b/progs/a89.py new file mode 100644 index 0000000..d1cff1d --- /dev/null +++ b/progs/a89.py @@ -0,0 +1,3 @@ +def mul_consecutive_nums(nums):
+ result = [b*a for a, b in zip(nums[:-1], nums[1:])]
+ return result
\ No newline at end of file diff --git a/progs/a890.py b/progs/a890.py new file mode 100644 index 0000000..2e9a35a --- /dev/null +++ b/progs/a890.py @@ -0,0 +1,7 @@ +def get_pairs_count(arr, n, sum):
+ count = 0
+ for i in range(0, n):
+ for j in range(i + 1, n):
+ if arr[i] + arr[j] == sum:
+ count += 1
+ return count
\ No newline at end of file diff --git a/progs/a891.py b/progs/a891.py new file mode 100644 index 0000000..87ca1a8 --- /dev/null +++ b/progs/a891.py @@ -0,0 +1,4 @@ +def min_length(list1):
+ min_length = min(len(x) for x in list1 )
+ min_list = min((x) for x in list1)
+ return(min_length, min_list)
\ No newline at end of file diff --git a/progs/a892.py b/progs/a892.py new file mode 100644 index 0000000..85d0cd6 --- /dev/null +++ b/progs/a892.py @@ -0,0 +1,7 @@ +def jacobsthal_lucas(n):
+ dp=[0] * (n + 1)
+ dp[0] = 2
+ dp[1] = 1
+ for i in range(2, n+1):
+ dp[i] = dp[i - 1] + 2 * dp[i - 2];
+ return dp[n]
\ No newline at end of file diff --git a/progs/a893.py b/progs/a893.py new file mode 100644 index 0000000..701f532 --- /dev/null +++ b/progs/a893.py @@ -0,0 +1,10 @@ +from array import array
+def negative_count(nums):
+ n = len(nums)
+ n1 = 0
+ for x in nums:
+ if x < 0:
+ n1 += 1
+ else:
+ None
+ return round(n1/n,2)
\ No newline at end of file diff --git a/progs/a894.py b/progs/a894.py new file mode 100644 index 0000000..b9ddf1d --- /dev/null +++ b/progs/a894.py @@ -0,0 +1,11 @@ +import sys
+def min_coins(coins, m, V):
+ if (V == 0):
+ return 0
+ res = sys.maxsize
+ for i in range(0, m):
+ if (coins[i] <= V):
+ sub_res = min_coins(coins, m, V-coins[i])
+ if (sub_res != sys.maxsize and sub_res + 1 < res):
+ res = sub_res + 1
+ return res
\ No newline at end of file diff --git a/progs/a895.py b/progs/a895.py new file mode 100644 index 0000000..828ccad --- /dev/null +++ b/progs/a895.py @@ -0,0 +1,13 @@ +def check_permutation(str1, str2):
+ n1=len(str1)
+ n2=len(str2)
+ if(n1!=n2):
+ return False
+ a=sorted(str1)
+ str1=" ".join(a)
+ b=sorted(str2)
+ str2=" ".join(b)
+ for i in range(0, n1, 1):
+ if(str1[i] != str2[i]):
+ return False
+ return True
\ No newline at end of file diff --git a/progs/a896.py b/progs/a896.py new file mode 100644 index 0000000..e4022a7 --- /dev/null +++ b/progs/a896.py @@ -0,0 +1,6 @@ +def remove_datatype(test_tuple, data_type):
+ res = []
+ for ele in test_tuple:
+ if not isinstance(ele, data_type):
+ res.append(ele)
+ return (res)
\ No newline at end of file diff --git a/progs/a897.py b/progs/a897.py new file mode 100644 index 0000000..22107cf --- /dev/null +++ b/progs/a897.py @@ -0,0 +1,6 @@ +import re
+def search_literal(pattern,text):
+ match = re.search(pattern, text)
+ s = match.start()
+ e = match.end()
+ return (s, e)
\ No newline at end of file diff --git a/progs/a898.py b/progs/a898.py new file mode 100644 index 0000000..82d8bbd --- /dev/null +++ b/progs/a898.py @@ -0,0 +1,3 @@ +def topbottom_surfacearea(r):
+ toporbottomarea=3.1415*r*r
+ return toporbottomarea
\ No newline at end of file diff --git a/progs/a899.py b/progs/a899.py new file mode 100644 index 0000000..d6a633b --- /dev/null +++ b/progs/a899.py @@ -0,0 +1,2 @@ +def nth_items(list,n):
+ return list[::n]
\ No newline at end of file diff --git a/progs/a9.py b/progs/a9.py new file mode 100644 index 0000000..369c24d --- /dev/null +++ b/progs/a9.py @@ -0,0 +1,2 @@ +def remove_kth_element(list1, L):
+ return list1[:L-1] + list1[L:]
\ No newline at end of file diff --git a/progs/a900.py b/progs/a900.py new file mode 100644 index 0000000..8cda224 --- /dev/null +++ b/progs/a900.py @@ -0,0 +1,8 @@ +def first_repeated_word(str1):
+ temp = set()
+ for word in str1.split():
+ if word in temp:
+ return word;
+ else:
+ temp.add(word)
+ return 'None'
\ No newline at end of file diff --git a/progs/a901.py b/progs/a901.py new file mode 100644 index 0000000..6d1dea5 --- /dev/null +++ b/progs/a901.py @@ -0,0 +1,3 @@ +def string_list_to_tuple(str1):
+ result = tuple(x for x in str1 if not x.isspace())
+ return result
\ No newline at end of file diff --git a/progs/a902.py b/progs/a902.py new file mode 100644 index 0000000..281b07e --- /dev/null +++ b/progs/a902.py @@ -0,0 +1,3 @@ +def basesnum_coresspondingnum(bases_num,index):
+ result = list(map(pow, bases_num, index))
+ return result
\ No newline at end of file diff --git a/progs/a903.py b/progs/a903.py new file mode 100644 index 0000000..c1b164e --- /dev/null +++ b/progs/a903.py @@ -0,0 +1,12 @@ +def find_Diff(arr,n):
+ arr.sort()
+ count = 0; max_count = 0; min_count = n
+ for i in range(0,(n-1)):
+ if arr[i] == arr[i + 1]:
+ count += 1
+ continue
+ else:
+ max_count = max(max_count,count)
+ min_count = min(min_count,count)
+ count = 0
+ return max_count - min_count
\ No newline at end of file diff --git a/progs/a904.py b/progs/a904.py new file mode 100644 index 0000000..9c41b60 --- /dev/null +++ b/progs/a904.py @@ -0,0 +1,19 @@ +import math
+def get_sum(n):
+ sum = 0
+ i = 1
+ while i <= (math.sqrt(n)):
+ if n%i == 0:
+ if n/i == i :
+ sum = sum + i
+ else:
+ sum = sum + i
+ sum = sum + (n / i )
+ i = i + 1
+ sum = sum - n
+ return sum
+def check_abundant(n):
+ if (get_sum(n) > n):
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a905.py b/progs/a905.py new file mode 100644 index 0000000..05efd0f --- /dev/null +++ b/progs/a905.py @@ -0,0 +1,3 @@ +import re
+def fill_spaces(text):
+ return (re.sub("[ ,.]", ":", text))
\ No newline at end of file diff --git a/progs/a906.py b/progs/a906.py new file mode 100644 index 0000000..e25ab0c --- /dev/null +++ b/progs/a906.py @@ -0,0 +1,7 @@ +def count_digits(num1,num2):
+ number=num1+num2
+ count = 0
+ while(number > 0):
+ number = number // 10
+ count = count + 1
+ return count
\ No newline at end of file diff --git a/progs/a907.py b/progs/a907.py new file mode 100644 index 0000000..636bfb9 --- /dev/null +++ b/progs/a907.py @@ -0,0 +1,3 @@ +def flatten_tuple(test_list):
+ res = ' '.join([idx for tup in test_list for idx in tup])
+ return (res)
\ No newline at end of file diff --git a/progs/a908.py b/progs/a908.py new file mode 100644 index 0000000..1e3125c --- /dev/null +++ b/progs/a908.py @@ -0,0 +1,11 @@ +def take_L_and_F_set_bits(n) :
+ n = n | n >> 1
+ n = n | n >> 2
+ n = n | n >> 4
+ n = n | n >> 8
+ n = n | n >> 16
+ return ((n + 1) >> 1) + 1
+def toggle_F_and_L_bits(n) :
+ if (n == 1) :
+ return 0
+ return n ^ take_L_and_F_set_bits(n)
\ No newline at end of file diff --git a/progs/a909.py b/progs/a909.py new file mode 100644 index 0000000..4eb1d5b --- /dev/null +++ b/progs/a909.py @@ -0,0 +1,9 @@ +def last_occurence_char(string,char):
+ flag = -1
+ for i in range(len(string)):
+ if(string[i] == char):
+ flag = i
+ if(flag == -1):
+ return None
+ else:
+ return flag + 1
\ No newline at end of file diff --git a/progs/a91.py b/progs/a91.py new file mode 100644 index 0000000..126f04e --- /dev/null +++ b/progs/a91.py @@ -0,0 +1,7 @@ +def last_Two_Digits(N):
+ if (N >= 10):
+ return
+ fac = 1
+ for i in range(1,N + 1):
+ fac = (fac * i) % 100
+ return (fac)
\ No newline at end of file diff --git a/progs/a910.py b/progs/a910.py new file mode 100644 index 0000000..8485252 --- /dev/null +++ b/progs/a910.py @@ -0,0 +1,7 @@ +def Total_Hamming_Distance(n):
+ i = 1
+ sum = 0
+ while (n // i > 0):
+ sum = sum + n // i
+ i = i * 2
+ return sum
\ No newline at end of file diff --git a/progs/a911.py b/progs/a911.py new file mode 100644 index 0000000..86552f2 --- /dev/null +++ b/progs/a911.py @@ -0,0 +1,11 @@ +def longest_increasing_subsequence(arr):
+ n = len(arr)
+ longest_increasing_subsequence = [1]*n
+ for i in range (1 , n):
+ for j in range(0 , i):
+ if arr[i] > arr[j] and longest_increasing_subsequence[i]< longest_increasing_subsequence[j] + 1 :
+ longest_increasing_subsequence[i] = longest_increasing_subsequence[j]+1
+ maximum = 0
+ for i in range(n):
+ maximum = max(maximum , longest_increasing_subsequence[i])
+ return maximum
\ No newline at end of file diff --git a/progs/a912.py b/progs/a912.py new file mode 100644 index 0000000..7484aba --- /dev/null +++ b/progs/a912.py @@ -0,0 +1,7 @@ +def odd_Num_Sum(n) :
+ j = 0
+ sm = 0
+ for i in range(1,n+1) :
+ j = (2*i-1)
+ sm = sm + (j*j*j*j*j)
+ return sm
\ No newline at end of file diff --git a/progs/a913.py b/progs/a913.py new file mode 100644 index 0000000..cfa860b --- /dev/null +++ b/progs/a913.py @@ -0,0 +1,14 @@ +def find_Max(arr,low,high):
+ if (high < low):
+ return arr[0]
+ if (high == low):
+ return arr[low]
+ mid = low + (high - low) // 2
+ if (mid < high and arr[mid + 1] < arr[mid]):
+ return arr[mid]
+ if (mid > low and arr[mid] < arr[mid - 1]):
+ return arr[mid - 1]
+ if (arr[low] > arr[mid]):
+ return find_Max(arr,low,mid - 1)
+ else:
+ return find_Max(arr,mid + 1,high)
\ No newline at end of file diff --git a/progs/a914.py b/progs/a914.py new file mode 100644 index 0000000..06b323a --- /dev/null +++ b/progs/a914.py @@ -0,0 +1,3 @@ +def extract_column(list1, n):
+ result = [i.pop(n) for i in list1]
+ return result
\ No newline at end of file diff --git a/progs/a915.py b/progs/a915.py new file mode 100644 index 0000000..6298b31 --- /dev/null +++ b/progs/a915.py @@ -0,0 +1,6 @@ +def Seq_Linear(seq_nums):
+ seq_nums = [seq_nums[x] - seq_nums[x-1] for x in range(1, len(seq_nums))]
+ if len(set(seq_nums)) == 1:
+ return "Linear Sequence"
+ else:
+ return "Non Linear Sequence"
\ No newline at end of file diff --git a/progs/a916.py b/progs/a916.py new file mode 100644 index 0000000..a827408 --- /dev/null +++ b/progs/a916.py @@ -0,0 +1,3 @@ +def tuple_to_float(test_tup):
+ res = float('.'.join(str(ele) for ele in test_tup))
+ return (res)
\ No newline at end of file diff --git a/progs/a917.py b/progs/a917.py new file mode 100644 index 0000000..55abb3b --- /dev/null +++ b/progs/a917.py @@ -0,0 +1,6 @@ +def Split(list):
+ od_li = []
+ for i in list:
+ if (i % 2 != 0):
+ od_li.append(i)
+ return od_li
\ No newline at end of file diff --git a/progs/a918.py b/progs/a918.py new file mode 100644 index 0000000..642d76d --- /dev/null +++ b/progs/a918.py @@ -0,0 +1,4 @@ +def difference(n) :
+ S = (n*(n + 1))//2;
+ res = S*(S-1);
+ return res;
\ No newline at end of file diff --git a/progs/a919.py b/progs/a919.py new file mode 100644 index 0000000..73e1240 --- /dev/null +++ b/progs/a919.py @@ -0,0 +1,7 @@ +def find_Odd_Pair(A,N) :
+ oddPair = 0
+ for i in range(0,N) :
+ for j in range(i+1,N) :
+ if ((A[i] ^ A[j]) % 2 != 0):
+ oddPair+=1
+ return oddPair
\ No newline at end of file diff --git a/progs/a92.py b/progs/a92.py new file mode 100644 index 0000000..bd1ef2f --- /dev/null +++ b/progs/a92.py @@ -0,0 +1,3 @@ +import re
+def remove_multiple_spaces(text1):
+ return (re.sub(' +',' ',text1))
\ No newline at end of file diff --git a/progs/a920.py b/progs/a920.py new file mode 100644 index 0000000..514c1fe --- /dev/null +++ b/progs/a920.py @@ -0,0 +1,3 @@ +def toggle_string(string):
+ string1 = string.swapcase()
+ return string1
\ No newline at end of file diff --git a/progs/a921.py b/progs/a921.py new file mode 100644 index 0000000..59ceb7d --- /dev/null +++ b/progs/a921.py @@ -0,0 +1,2 @@ +def digit_distance_nums(n1, n2):
+ return sum(map(int,str(abs(n1-n2))))
\ No newline at end of file diff --git a/progs/a922.py b/progs/a922.py new file mode 100644 index 0000000..be47e86 --- /dev/null +++ b/progs/a922.py @@ -0,0 +1,10 @@ +def max_sub_array_sum(a, size):
+ max_so_far = 0
+ max_ending_here = 0
+ for i in range(0, size):
+ max_ending_here = max_ending_here + a[i]
+ if max_ending_here < 0:
+ max_ending_here = 0
+ elif (max_so_far < max_ending_here):
+ max_so_far = max_ending_here
+ return max_so_far
\ No newline at end of file diff --git a/progs/a923.py b/progs/a923.py new file mode 100644 index 0000000..51e4841 --- /dev/null +++ b/progs/a923.py @@ -0,0 +1,3 @@ +def union_elements(test_tup1, test_tup2):
+ res = tuple(set(test_tup1 + test_tup2))
+ return (res)
\ No newline at end of file diff --git a/progs/a924.py b/progs/a924.py new file mode 100644 index 0000000..01596f3 --- /dev/null +++ b/progs/a924.py @@ -0,0 +1,6 @@ +def assign_elements(test_list):
+ res = dict()
+ for key, val in test_list:
+ res.setdefault(val, [])
+ res.setdefault(key, []).append(val)
+ return (res)
\ No newline at end of file diff --git a/progs/a925.py b/progs/a925.py new file mode 100644 index 0000000..bf57154 --- /dev/null +++ b/progs/a925.py @@ -0,0 +1,3 @@ +def Find_Max_Length(lst):
+ maxLength = max(len(x) for x in lst )
+ return maxLength
\ No newline at end of file diff --git a/progs/a927.py b/progs/a927.py new file mode 100644 index 0000000..062abe0 --- /dev/null +++ b/progs/a927.py @@ -0,0 +1,7 @@ +def count_Pairs(arr,n):
+ cnt = 0;
+ for i in range(n):
+ for j in range(i + 1,n):
+ if (arr[i] != arr[j]):
+ cnt += 1;
+ return cnt;
\ No newline at end of file diff --git a/progs/a928.py b/progs/a928.py new file mode 100644 index 0000000..0f0980d --- /dev/null +++ b/progs/a928.py @@ -0,0 +1,2 @@ +def split(word):
+ return [char for char in word]
\ No newline at end of file diff --git a/progs/a929.py b/progs/a929.py new file mode 100644 index 0000000..1ae5aa1 --- /dev/null +++ b/progs/a929.py @@ -0,0 +1,5 @@ +def sum_digits(n):
+ if n == 0:
+ return 0
+ else:
+ return n % 10 + sum_digits(int(n / 10))
\ No newline at end of file diff --git a/progs/a93.py b/progs/a93.py new file mode 100644 index 0000000..5e61a69 --- /dev/null +++ b/progs/a93.py @@ -0,0 +1,3 @@ +def extract_unique(test_dict):
+ res = list(sorted({ele for val in test_dict.values() for ele in val}))
+ return res
\ No newline at end of file diff --git a/progs/a930.py b/progs/a930.py new file mode 100644 index 0000000..aa16b87 --- /dev/null +++ b/progs/a930.py @@ -0,0 +1,3 @@ +def issort_list(list1):
+ result = all(list1[i] <= list1[i+1] for i in range(len(list1)-1))
+ return result
\ No newline at end of file diff --git a/progs/a932.py b/progs/a932.py new file mode 100644 index 0000000..f6d49b4 --- /dev/null +++ b/progs/a932.py @@ -0,0 +1,3 @@ +def sort_sublists(list1):
+ result = list(map(sorted,list1))
+ return result
\ No newline at end of file diff --git a/progs/a933.py b/progs/a933.py new file mode 100644 index 0000000..930e0ad --- /dev/null +++ b/progs/a933.py @@ -0,0 +1,6 @@ +def remove_words(list1, charlist):
+ new_list = []
+ for line in list1:
+ new_words = ' '.join([word for word in line.split() if not any([phrase in word for phrase in charlist])])
+ new_list.append(new_words)
+ return new_list
\ No newline at end of file diff --git a/progs/a934.py b/progs/a934.py new file mode 100644 index 0000000..8dc5f52 --- /dev/null +++ b/progs/a934.py @@ -0,0 +1,12 @@ +def max_sum_pair_diff_lessthan_K(arr, N, K):
+ arr.sort()
+ dp = [0] * N
+ dp[0] = 0
+ for i in range(1, N):
+ dp[i] = dp[i-1]
+ if (arr[i] - arr[i-1] < K):
+ if (i >= 2):
+ dp[i] = max(dp[i], dp[i-2] + arr[i] + arr[i-1]);
+ else:
+ dp[i] = max(dp[i], arr[i] + arr[i-1]);
+ return dp[N - 1]
\ No newline at end of file diff --git a/progs/a935.py b/progs/a935.py new file mode 100644 index 0000000..d39cc29 --- /dev/null +++ b/progs/a935.py @@ -0,0 +1,2 @@ +def two_unique_nums(nums):
+ return [i for i in nums if nums.count(i)==1]
\ No newline at end of file diff --git a/progs/a936.py b/progs/a936.py new file mode 100644 index 0000000..1ea3d53 --- /dev/null +++ b/progs/a936.py @@ -0,0 +1,6 @@ +def unique_product(list_data):
+ temp = list(set(list_data))
+ p = 1
+ for i in temp:
+ p *= i
+ return p
\ No newline at end of file diff --git a/progs/a937.py b/progs/a937.py new file mode 100644 index 0000000..21c64d0 --- /dev/null +++ b/progs/a937.py @@ -0,0 +1,3 @@ +def surfacearea_cylinder(r,h):
+ surfacearea=((2*3.1415*r*r) +(2*3.1415*r*h))
+ return surfacearea
\ No newline at end of file diff --git a/progs/a938.py b/progs/a938.py new file mode 100644 index 0000000..823cea3 --- /dev/null +++ b/progs/a938.py @@ -0,0 +1,8 @@ +def count_no (A,N,L,R):
+ count = 0
+ for i in range (L,R + 1):
+ if (i % A != 0):
+ count += 1
+ if (count == N):
+ break
+ return (i)
\ No newline at end of file diff --git a/progs/a939.py b/progs/a939.py new file mode 100644 index 0000000..74c3463 --- /dev/null +++ b/progs/a939.py @@ -0,0 +1,12 @@ +def is_Sub_Array(A,B,n,m):
+ i = 0; j = 0;
+ while (i < n and j < m):
+ if (A[i] == B[j]):
+ i += 1;
+ j += 1;
+ if (j == m):
+ return True;
+ else:
+ i = i - j + 1;
+ j = 0;
+ return False;
\ No newline at end of file diff --git a/progs/a94.py b/progs/a94.py new file mode 100644 index 0000000..60ac0b2 --- /dev/null +++ b/progs/a94.py @@ -0,0 +1,3 @@ +def check_greater(test_tup1, test_tup2):
+ res = all(x < y for x, y in zip(test_tup1, test_tup2))
+ return (res)
\ No newline at end of file diff --git a/progs/a940.py b/progs/a940.py new file mode 100644 index 0000000..622b2e3 --- /dev/null +++ b/progs/a940.py @@ -0,0 +1,7 @@ +def last_Digit_Factorial(n):
+ if (n == 0): return 1
+ elif (n <= 2): return n
+ elif (n == 3): return 6
+ elif (n == 4): return 4
+ else:
+ return 0
\ No newline at end of file diff --git a/progs/a941.py b/progs/a941.py new file mode 100644 index 0000000..5e4799d --- /dev/null +++ b/progs/a941.py @@ -0,0 +1,3 @@ +def interleave_lists(list1,list2,list3):
+ result = [el for pair in zip(list1, list2, list3) for el in pair]
+ return result
\ No newline at end of file diff --git a/progs/a942.py b/progs/a942.py new file mode 100644 index 0000000..ce686f4 --- /dev/null +++ b/progs/a942.py @@ -0,0 +1,3 @@ +def find_dissimilar(test_tup1, test_tup2):
+ res = tuple(set(test_tup1) ^ set(test_tup2))
+ return (res)
\ No newline at end of file diff --git a/progs/a944.py b/progs/a944.py new file mode 100644 index 0000000..d3bb480 --- /dev/null +++ b/progs/a944.py @@ -0,0 +1,2 @@ +def surface_Area(b,s):
+ return 2 * b * s + pow(b,2)
\ No newline at end of file diff --git a/progs/a945.py b/progs/a945.py new file mode 100644 index 0000000..e57c4b3 --- /dev/null +++ b/progs/a945.py @@ -0,0 +1,5 @@ +def my_dict(dict1):
+ if bool(dict1):
+ return False
+ else:
+ return True
\ No newline at end of file diff --git a/progs/a946.py b/progs/a946.py new file mode 100644 index 0000000..cbfdb82 --- /dev/null +++ b/progs/a946.py @@ -0,0 +1,7 @@ +def catalan_number(num):
+ if num <=1:
+ return 1
+ res_num = 0
+ for i in range(num):
+ res_num += catalan_number(i) * catalan_number(num-i-1)
+ return res_num
\ No newline at end of file diff --git a/progs/a949.py b/progs/a949.py new file mode 100644 index 0000000..b6df617 --- /dev/null +++ b/progs/a949.py @@ -0,0 +1,3 @@ +def split_Arr(a,n,k):
+ b = a[:k]
+ return (a[k::]+b[::])
\ No newline at end of file diff --git a/progs/a95.py b/progs/a95.py new file mode 100644 index 0000000..c8f3c14 --- /dev/null +++ b/progs/a95.py @@ -0,0 +1,3 @@ +def zip_list(list1,list2):
+ result = list(map(list.__add__, list1, list2))
+ return result
\ No newline at end of file diff --git a/progs/a950.py b/progs/a950.py new file mode 100644 index 0000000..a91b10e --- /dev/null +++ b/progs/a950.py @@ -0,0 +1,3 @@ +def list_tuple(listx):
+ tuplex = tuple(listx)
+ return tuplex
\ No newline at end of file diff --git a/progs/a951.py b/progs/a951.py new file mode 100644 index 0000000..ab1e4c9 --- /dev/null +++ b/progs/a951.py @@ -0,0 +1,3 @@ +def big_diff(nums):
+ diff= max(nums)-min(nums)
+ return diff
\ No newline at end of file diff --git a/progs/a952.py b/progs/a952.py new file mode 100644 index 0000000..b2fcd03 --- /dev/null +++ b/progs/a952.py @@ -0,0 +1,10 @@ +def perfect_squares(a, b):
+ lists=[]
+ for i in range (a,b+1):
+ j = 1;
+ while j*j <= i:
+ if j*j == i:
+ lists.append(i)
+ j = j+1
+ i = i+1
+ return lists
\ No newline at end of file diff --git a/progs/a953.py b/progs/a953.py new file mode 100644 index 0000000..fd6c8bd --- /dev/null +++ b/progs/a953.py @@ -0,0 +1,6 @@ +import cmath
+def polar_rect(x,y):
+ cn = complex(x,y)
+ cn=cmath.polar(cn)
+ cn1 = cmath.rect(2, cmath.pi)
+ return (cn,cn1)
\ No newline at end of file diff --git a/progs/a954.py b/progs/a954.py new file mode 100644 index 0000000..78b3aa1 --- /dev/null +++ b/progs/a954.py @@ -0,0 +1,6 @@ +def swap_List(newList):
+ size = len(newList)
+ temp = newList[0]
+ newList[0] = newList[size - 1]
+ newList[size - 1] = temp
+ return newList
\ No newline at end of file diff --git a/progs/a955.py b/progs/a955.py new file mode 100644 index 0000000..ac920a1 --- /dev/null +++ b/progs/a955.py @@ -0,0 +1,9 @@ +def binomial_Coeff(n,k):
+ C = [0] * (k + 1);
+ C[0] = 1; # nC0 is 1
+ for i in range(1,n + 1):
+ for j in range(min(i, k),0,-1):
+ C[j] = C[j] + C[j - 1];
+ return C[k];
+def sum_Of_product(n):
+ return binomial_Coeff(2 * n,n - 1);
\ No newline at end of file diff --git a/progs/a956.py b/progs/a956.py new file mode 100644 index 0000000..dc88b37 --- /dev/null +++ b/progs/a956.py @@ -0,0 +1,4 @@ +import re
+def removezero_ip(ip):
+ string = re.sub('\.[0]*', '.', ip)
+ return string
\ No newline at end of file diff --git a/progs/a957.py b/progs/a957.py new file mode 100644 index 0000000..0ef3c43 --- /dev/null +++ b/progs/a957.py @@ -0,0 +1,4 @@ +def diff_even_odd(list1):
+ first_even = next((el for el in list1 if el%2==0),-1)
+ first_odd = next((el for el in list1 if el%2!=0),-1)
+ return (first_even-first_odd)
\ No newline at end of file diff --git a/progs/a958.py b/progs/a958.py new file mode 100644 index 0000000..5982297 --- /dev/null +++ b/progs/a958.py @@ -0,0 +1,9 @@ +def min_Swaps(str1,str2) :
+ count = 0
+ for i in range(len(str1)) :
+ if str1[i] != str2[i] :
+ count += 1
+ if count % 2 == 0 :
+ return (count // 2)
+ else :
+ return ("Not Possible")
\ No newline at end of file diff --git a/progs/a959.py b/progs/a959.py new file mode 100644 index 0000000..909ef0a --- /dev/null +++ b/progs/a959.py @@ -0,0 +1,3 @@ +import sys
+def tuple_size(tuple_list):
+ return (sys.getsizeof(tuple_list))
\ No newline at end of file diff --git a/progs/a960.py b/progs/a960.py new file mode 100644 index 0000000..1e4960e --- /dev/null +++ b/progs/a960.py @@ -0,0 +1,22 @@ +def find_kth(arr1, arr2, m, n, k):
+ sorted1 = [0] * (m + n)
+ i = 0
+ j = 0
+ d = 0
+ while (i < m and j < n):
+ if (arr1[i] < arr2[j]):
+ sorted1[d] = arr1[i]
+ i += 1
+ else:
+ sorted1[d] = arr2[j]
+ j += 1
+ d += 1
+ while (i < m):
+ sorted1[d] = arr1[i]
+ d += 1
+ i += 1
+ while (j < n):
+ sorted1[d] = arr2[j]
+ d += 1
+ j += 1
+ return sorted1[k - 1]
\ No newline at end of file diff --git a/progs/a961.py b/progs/a961.py new file mode 100644 index 0000000..9ad773a --- /dev/null +++ b/progs/a961.py @@ -0,0 +1,16 @@ +def armstrong_number(number):
+ sum = 0
+ times = 0
+ temp = number
+ while temp > 0:
+ times = times + 1
+ temp = temp // 10
+ temp = number
+ while temp > 0:
+ reminder = temp % 10
+ sum = sum + (reminder ** times)
+ temp //= 10
+ if number == sum:
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/a962.py b/progs/a962.py new file mode 100644 index 0000000..42c3f53 --- /dev/null +++ b/progs/a962.py @@ -0,0 +1,6 @@ +def sum_average(number):
+ total = 0
+ for value in range(1, number + 1):
+ total = total + value
+ average = total / number
+ return (total,average)
\ No newline at end of file diff --git a/progs/a963.py b/progs/a963.py new file mode 100644 index 0000000..fe68ad4 --- /dev/null +++ b/progs/a963.py @@ -0,0 +1,5 @@ +def is_Even(n) :
+ if (n^1 == n+1) :
+ return True;
+ else :
+ return False;
\ No newline at end of file diff --git a/progs/a964.py b/progs/a964.py new file mode 100644 index 0000000..0fbe808 --- /dev/null +++ b/progs/a964.py @@ -0,0 +1,13 @@ +R = 3
+C = 3
+def min_cost(cost, m, n):
+ tc = [[0 for x in range(C)] for x in range(R)]
+ tc[0][0] = cost[0][0]
+ for i in range(1, m+1):
+ tc[i][0] = tc[i-1][0] + cost[i][0]
+ for j in range(1, n+1):
+ tc[0][j] = tc[0][j-1] + cost[0][j]
+ for i in range(1, m+1):
+ for j in range(1, n+1):
+ tc[i][j] = min(tc[i-1][j-1], tc[i-1][j], tc[i][j-1]) + cost[i][j]
+ return tc[m][n]
\ No newline at end of file diff --git a/progs/a965.py b/progs/a965.py new file mode 100644 index 0000000..7c79c26 --- /dev/null +++ b/progs/a965.py @@ -0,0 +1,3 @@ +def similar_elements(test_tup1, test_tup2):
+ res = tuple(set(test_tup1) & set(test_tup2))
+ return (res)
\ No newline at end of file diff --git a/progs/a966.py b/progs/a966.py new file mode 100644 index 0000000..2e036ee --- /dev/null +++ b/progs/a966.py @@ -0,0 +1,7 @@ +import math
+def is_not_prime(n):
+ result = False
+ for i in range(2,int(math.sqrt(n)) + 1):
+ if n % i == 0:
+ result = True
+ return result
\ No newline at end of file diff --git a/progs/a967.py b/progs/a967.py new file mode 100644 index 0000000..e5909eb --- /dev/null +++ b/progs/a967.py @@ -0,0 +1,4 @@ +import heapq as hq
+def heap_queue_largest(nums,n):
+ largest_nums = hq.nlargest(n, nums)
+ return largest_nums
\ No newline at end of file diff --git a/progs/a968.py b/progs/a968.py new file mode 100644 index 0000000..5a0b8f1 --- /dev/null +++ b/progs/a968.py @@ -0,0 +1,11 @@ +def count_ways(n):
+ A = [0] * (n + 1)
+ B = [0] * (n + 1)
+ A[0] = 1
+ A[1] = 0
+ B[0] = 0
+ B[1] = 1
+ for i in range(2, n+1):
+ A[i] = A[i - 2] + 2 * B[i - 1]
+ B[i] = A[i - 1] + B[i - 2]
+ return A[n]
\ No newline at end of file diff --git a/progs/a969.py b/progs/a969.py new file mode 100644 index 0000000..5bbd674 --- /dev/null +++ b/progs/a969.py @@ -0,0 +1,4 @@ +def is_Power_Of_Two (x):
+ return x and (not(x & (x - 1)))
+def differ_At_One_Bit_Pos(a,b):
+ return is_Power_Of_Two(a ^ b)
\ No newline at end of file diff --git a/progs/a972.py b/progs/a972.py new file mode 100644 index 0000000..b158656 --- /dev/null +++ b/progs/a972.py @@ -0,0 +1,8 @@ +def find_Rotations(str):
+ tmp = str + str
+ n = len(str)
+ for i in range(1,n + 1):
+ substring = tmp[i: i+n]
+ if (str == substring):
+ return i
+ return n
\ No newline at end of file diff --git a/progs/a973.py b/progs/a973.py new file mode 100644 index 0000000..bc45bf4 --- /dev/null +++ b/progs/a973.py @@ -0,0 +1,4 @@ +import heapq
+def small_nnum(list1,n):
+ smallest=heapq.nsmallest(n,list1)
+ return smallest
\ No newline at end of file diff --git a/progs/a98.py b/progs/a98.py new file mode 100644 index 0000000..96d6db0 --- /dev/null +++ b/progs/a98.py @@ -0,0 +1,9 @@ +def min_Swaps(str1,str2) :
+ count = 0
+ for i in range(len(str1)) :
+ if str1[i] != str2[i] :
+ count += 1
+ if count % 2 == 0 :
+ return (count // 2)
+ else :
+ return ("Not Possible")
\ No newline at end of file diff --git a/progs/a99.py b/progs/a99.py new file mode 100644 index 0000000..9a4585f --- /dev/null +++ b/progs/a99.py @@ -0,0 +1,6 @@ +def count_range_in_list(li, min, max):
+ ctr = 0
+ for x in li:
+ if min <= x <= max:
+ ctr += 1
+ return ctr
\ No newline at end of file diff --git a/progs/bunch_of_tests b/progs/bunch_of_tests new file mode 100644 index 0000000..b001761 --- /dev/null +++ b/progs/bunch_of_tests @@ -0,0 +1,101 @@ +def coin_change(S, m, n): + table = [[0 for x in range(m)] for x in range(n+1)] + for i in range(m): + table[0][i] = 1 + for i in range(1, n+1): + for j in range(m): + x = table[i - S[j]][j] if i-S[j] >= 0 else 0 + y = table[i][j-1] if j >= 1 else 0 + table[i][j] = x + y + return table[n][m-1] + +================ +import re +def text_match_wordz_middle(text): + patterns = '\Bz\B' + if re.search(patterns, text): + return 'Found a match!' + else: + return('Not matched!') +text_match_wordz_middle('ciao') + +============== + +def max_occurrences(list1): + max_val = 0 + result = list1[0] + for i in list1: + occu = list1.count(i) + if occu > max_val: + max_val = occu + result = i + return result + +================ + +def sort_matrix(M): + result = sorted(M, key=sum) + return result + +================= + +def get_ludic(n): + ludics = [] + for i in range(1, n + 1): + ludics.append(i) + return ludics +print(get_ludic(a*a)) + +================= + +def adjac(ele, sub = []): + if not ele: + yield sub + else: + yield from [ idx for j in range(ele[0] - 1, ele[0] + 2) + for idx in adjac(ele[1:], sub + [j]) + ] + +def get_coordinates(test_tup): + res = list(adjac(test_tup)) + return (res) + +=================== + +import heapq +def heap_sort(iterable): + h = [] + for value in iterable: + heapq.heappush(h, value) + return [hq.heappop(h) for i in range(len(h))] + + +====================== + +def get_ludic(n): + ludics = [] + for i in range(1, n + 1): + ludics.append(i) + index = 1 + while(index != len(ludics)): + first_ludic = ludics[index] + remove_index = index + first_ludic + while(remove_index < len(ludics)): + ludics.remove(ludics[remove_index]) + remove_index = remove_index + first_ludic - 1 + index += 1 + return ludics +print(get_ludic(a*a)) + +============================ + +from collections import defaultdict +def get_unique(test_list): + res = defaultdict(list) + for sub in test_list: + res[sub[1]].append(sub[0]) + res = dict(res) + res_dict = dict() + for key in res: + res_dict[key] = len(list(set(res[key]))) + return (str(res_dict))
\ No newline at end of file diff --git a/progs/dont_care/a0.py b/progs/dont_care/a0.py new file mode 100644 index 0000000..623045c --- /dev/null +++ b/progs/dont_care/a0.py @@ -0,0 +1,16 @@ +class Pair(object):
+ def __init__(self, a, b):
+ self.a = a
+ self.b = b
+def max_chain_length(arr, n):
+ max = 0
+ mcl = [1 for i in range(n)]
+ for i in range(1, n):
+ for j in range(0, i):
+ if (arr[i].a > arr[j].b and
+ mcl[i] < mcl[j] + 1):
+ mcl[i] = mcl[j] + 1
+ for i in range(n):
+ if (max < mcl[i]):
+ max = mcl[i]
+ return max
\ No newline at end of file diff --git a/progs/dont_care/a242.py b/progs/dont_care/a242.py new file mode 100644 index 0000000..dc0ceec --- /dev/null +++ b/progs/dont_care/a242.py @@ -0,0 +1,12 @@ +import heapq
+def nth_super_ugly_number(n, primes):
+ uglies = [1]
+ def gen(prime):
+ for ugly in uglies:
+ yield ugly * prime
+ merged = heapq.merge(*map(gen, primes))
+ while len(uglies) < n:
+ ugly = next(merged)
+ if ugly != uglies[-1]:
+ uglies.append(ugly)
+ return uglies[-1]
\ No newline at end of file diff --git a/progs/dont_care/a29.py b/progs/dont_care/a29.py new file mode 100644 index 0000000..c5f976c --- /dev/null +++ b/progs/dont_care/a29.py @@ -0,0 +1,9 @@ +def adjac(ele, sub = []):
+ if not ele:
+ yield sub
+ else:
+ yield from [idx for j in range(ele[0] - 1, ele[0] + 2)
+ for idx in adjac(ele[1:], sub + [j])]
+def get_coordinates(test_tup):
+ res = list(adjac(test_tup))
+ return (res)
\ No newline at end of file diff --git a/progs/dont_care/a309.py b/progs/dont_care/a309.py new file mode 100644 index 0000000..84b0ac2 --- /dev/null +++ b/progs/dont_care/a309.py @@ -0,0 +1,8 @@ +import datetime
+def check_date(m, d, y):
+ try:
+ m, d, y = map(int, (m, d, y))
+ datetime.date(y, m, d)
+ return True
+ except ValueError:
+ return False
\ No newline at end of file diff --git a/progs/dont_care/a326.py b/progs/dont_care/a326.py new file mode 100644 index 0000000..8eeddd2 --- /dev/null +++ b/progs/dont_care/a326.py @@ -0,0 +1,15 @@ +class Node:
+ def __init__(self, data):
+ self.data = data
+ self.left = None
+ self.right = None
+def max_height(node):
+ if node is None:
+ return 0 ;
+ else :
+ left_height = max_height(node.left)
+ right_height = max_height(node.right)
+ if (left_height > right_height):
+ return left_height+1
+ else:
+ return right_height+1
\ No newline at end of file diff --git a/progs/dont_care/a730.py b/progs/dont_care/a730.py new file mode 100644 index 0000000..ba741d2 --- /dev/null +++ b/progs/dont_care/a730.py @@ -0,0 +1,18 @@ +class Node:
+ def __init__(self, data):
+ self.data = data
+ self.left = None
+ self.right = None
+def get_height(root):
+ if root is None:
+ return 0
+ return max(get_height(root.left), get_height(root.right)) + 1
+def is_tree_balanced(root):
+ if root is None:
+ return True
+ lh = get_height(root.left)
+ rh = get_height(root.right)
+ if (abs(lh - rh) <= 1) and is_tree_balanced(
+ root.left) is True and is_tree_balanced( root.right) is True:
+ return True
+ return False
\ No newline at end of file diff --git a/progs/dont_care/a780.py b/progs/dont_care/a780.py new file mode 100644 index 0000000..e84f8ee --- /dev/null +++ b/progs/dont_care/a780.py @@ -0,0 +1,8 @@ +def group_tuples(Input):
+ out = {}
+ for elem in Input:
+ try:
+ out[elem[0]].extend(elem[1:])
+ except KeyError:
+ out[elem[0]] = list(elem)
+ return [tuple(values) for values in out.values()]
\ No newline at end of file diff --git a/progs/dont_care/a789.py b/progs/dont_care/a789.py new file mode 100644 index 0000000..06bda85 --- /dev/null +++ b/progs/dont_care/a789.py @@ -0,0 +1,3 @@ +def filter_oddnumbers(nums):
+ odd_nums = list(filter(lambda x: x%2 != 0, nums))
+ return odd_nums
\ No newline at end of file diff --git a/progs/dont_care/a875.py b/progs/dont_care/a875.py new file mode 100644 index 0000000..9bf97cf --- /dev/null +++ b/progs/dont_care/a875.py @@ -0,0 +1,13 @@ +def flatten(test_tuple):
+ for tup in test_tuple:
+ if isinstance(tup, tuple):
+ yield from flatten(tup)
+ else:
+ yield tup
+def count_element_freq(test_tuple):
+ res = {}
+ for ele in flatten(test_tuple):
+ if ele not in res:
+ res[ele] = 0
+ res[ele] += 1
+ return (res)
\ No newline at end of file diff --git a/progs/ludic.py b/progs/ludic.py new file mode 100644 index 0000000..b5c7373 --- /dev/null +++ b/progs/ludic.py @@ -0,0 +1,6 @@ +def get_ludic(n): + ludics = [] + for i in range(1, n + 1): + ludics.append(i) + return ludics +print(get_ludic(a*a)) diff --git a/progs/test.py b/progs/test.py new file mode 100644 index 0000000..f168c9b --- /dev/null +++ b/progs/test.py @@ -0,0 +1,12 @@ +def find_first_duplicate(nums): + num_set = set() + no_duplicate = -1 + + for i in range(len(nums)): + + if nums[i] in num_set: + return nums[i] + else: + num_set.add(nums[i]) + + return no_duplicate
\ No newline at end of file diff --git a/progs/unparsable_programs/a11.py b/progs/unparsable_programs/a11.py new file mode 100644 index 0000000..722957f --- /dev/null +++ b/progs/unparsable_programs/a11.py @@ -0,0 +1,2 @@ +def merge(lst):
+ return [list(ele) for ele in list(zip(*lst))]
\ No newline at end of file diff --git a/progs/unparsable_programs/a111.py b/progs/unparsable_programs/a111.py new file mode 100644 index 0000000..1123d7e --- /dev/null +++ b/progs/unparsable_programs/a111.py @@ -0,0 +1,5 @@ +import itertools
+def remove_duplicate(list1):
+ list.sort(list1)
+ remove_duplicate = list(list1 for list1,_ in itertools.groupby(list1))
+ return remove_duplicate
\ No newline at end of file diff --git a/progs/unparsable_programs/a112.py b/progs/unparsable_programs/a112.py new file mode 100644 index 0000000..bb98f8e --- /dev/null +++ b/progs/unparsable_programs/a112.py @@ -0,0 +1,3 @@ +def check_valid(test_tup):
+ res = not any(map(lambda ele: not ele, test_tup))
+ return (res)
\ No newline at end of file diff --git a/progs/unparsable_programs/a121.py b/progs/unparsable_programs/a121.py new file mode 100644 index 0000000..e4cd66d --- /dev/null +++ b/progs/unparsable_programs/a121.py @@ -0,0 +1,3 @@ +def filter_data(students,h,w):
+ result = {k: s for k, s in students.items() if s[0] >=h and s[1] >=w}
+ return result
\ No newline at end of file diff --git a/progs/unparsable_programs/a124.py b/progs/unparsable_programs/a124.py new file mode 100644 index 0000000..594eef8 --- /dev/null +++ b/progs/unparsable_programs/a124.py @@ -0,0 +1,3 @@ +import re
+def extract_quotation(text1):
+ return (re.findall(r'"(.*?)"', text1))
\ No newline at end of file diff --git a/progs/unparsable_programs/a128.py b/progs/unparsable_programs/a128.py new file mode 100644 index 0000000..92e302f --- /dev/null +++ b/progs/unparsable_programs/a128.py @@ -0,0 +1,3 @@ +def add_list(nums1,nums2):
+ result = map(lambda x, y: x + y, nums1, nums2)
+ return list(result)
\ No newline at end of file diff --git a/progs/unparsable_programs/a14.py b/progs/unparsable_programs/a14.py new file mode 100644 index 0000000..c55f031 --- /dev/null +++ b/progs/unparsable_programs/a14.py @@ -0,0 +1,3 @@ +def average_tuple(nums):
+ result = [sum(x) / len(x) for x in zip(*nums)]
+ return result
\ No newline at end of file diff --git a/progs/unparsable_programs/a143.py b/progs/unparsable_programs/a143.py new file mode 100644 index 0000000..530261a --- /dev/null +++ b/progs/unparsable_programs/a143.py @@ -0,0 +1,3 @@ +def check_none(test_tup):
+ res = any(map(lambda ele: ele is None, test_tup))
+ return (res)
\ No newline at end of file diff --git a/progs/unparsable_programs/a144.py b/progs/unparsable_programs/a144.py new file mode 100644 index 0000000..7342998 --- /dev/null +++ b/progs/unparsable_programs/a144.py @@ -0,0 +1,3 @@ +def divisible_by_digits(startnum, endnum):
+ return [n for n in range(startnum, endnum+1) \
+ if not any(map(lambda x: int(x) == 0 or n%int(x) != 0, str(n)))]
\ No newline at end of file diff --git a/progs/unparsable_programs/a147.py b/progs/unparsable_programs/a147.py new file mode 100644 index 0000000..1645073 --- /dev/null +++ b/progs/unparsable_programs/a147.py @@ -0,0 +1,3 @@ +import re
+def capital_words_spaces(str1):
+ return re.sub(r"(\w)([A-Z])", r"\1 \2", str1)
\ No newline at end of file diff --git a/progs/unparsable_programs/a152.py b/progs/unparsable_programs/a152.py new file mode 100644 index 0000000..a7a582a --- /dev/null +++ b/progs/unparsable_programs/a152.py @@ -0,0 +1,3 @@ +def min_k(test_list, K):
+ res = sorted(test_list, key = lambda x: x[1])[:K]
+ return (res)
\ No newline at end of file diff --git a/progs/unparsable_programs/a158.py b/progs/unparsable_programs/a158.py new file mode 100644 index 0000000..6e5fda0 --- /dev/null +++ b/progs/unparsable_programs/a158.py @@ -0,0 +1,5 @@ +def is_decimal(num):
+ import re
+ dnumre = re.compile(r"""^[0-9]+(\.[0-9]{1,2})?$""")
+ result = dnumre.search(num)
+ return bool(result)
\ No newline at end of file diff --git a/progs/unparsable_programs/a17.py b/progs/unparsable_programs/a17.py new file mode 100644 index 0000000..47b8e06 --- /dev/null +++ b/progs/unparsable_programs/a17.py @@ -0,0 +1,3 @@ +def div_list(nums1,nums2):
+ result = map(lambda x, y: x / y, nums1, nums2)
+ return list(result)
\ No newline at end of file diff --git a/progs/unparsable_programs/a194.py b/progs/unparsable_programs/a194.py new file mode 100644 index 0000000..7574268 --- /dev/null +++ b/progs/unparsable_programs/a194.py @@ -0,0 +1,4 @@ +import heapq
+def cheap_items(items,n):
+ cheap_items = heapq.nsmallest(n, items, key=lambda s: s['price'])
+ return cheap_items
\ No newline at end of file diff --git a/progs/unparsable_programs/a199.py b/progs/unparsable_programs/a199.py new file mode 100644 index 0000000..6cf5bd1 --- /dev/null +++ b/progs/unparsable_programs/a199.py @@ -0,0 +1,3 @@ +import re
+def remove_all_spaces(text):
+ return (re.sub(r'\s+', '',text))
\ No newline at end of file diff --git a/progs/unparsable_programs/a216.py b/progs/unparsable_programs/a216.py new file mode 100644 index 0000000..658d48f --- /dev/null +++ b/progs/unparsable_programs/a216.py @@ -0,0 +1,3 @@ +def div_of_nums(nums,m,n):
+ result = list(filter(lambda x: (x % m == 0 or x % n == 0), nums))
+ return result
\ No newline at end of file diff --git a/progs/unparsable_programs/a22.py b/progs/unparsable_programs/a22.py new file mode 100644 index 0000000..9209e85 --- /dev/null +++ b/progs/unparsable_programs/a22.py @@ -0,0 +1,3 @@ +def nth_nums(nums,n):
+ nth_nums = list(map(lambda x: x ** n, nums))
+ return nth_nums
\ No newline at end of file diff --git a/progs/unparsable_programs/a227.py b/progs/unparsable_programs/a227.py new file mode 100644 index 0000000..0143995 --- /dev/null +++ b/progs/unparsable_programs/a227.py @@ -0,0 +1,10 @@ +def count_alpha_dig_spl(string):
+ alphabets=digits = special = 0
+ for i in range(len(string)):
+ if(string[i].isalpha()):
+ alphabets = alphabets + 1
+ elif(string[i].isdigit()):
+ digits = digits + 1
+ else:
+ special = special + 1
+ return (alphabets,digits,special)
\ No newline at end of file diff --git a/progs/unparsable_programs/a260.py b/progs/unparsable_programs/a260.py new file mode 100644 index 0000000..cc6721a --- /dev/null +++ b/progs/unparsable_programs/a260.py @@ -0,0 +1,4 @@ +from collections import Counter
+def anagram_lambda(texts,str):
+ result = list(filter(lambda x: (Counter(str) == Counter(x)), texts))
+ return result
\ No newline at end of file diff --git a/progs/unparsable_programs/a263.py b/progs/unparsable_programs/a263.py new file mode 100644 index 0000000..0f71a0c --- /dev/null +++ b/progs/unparsable_programs/a263.py @@ -0,0 +1,3 @@ +def palindrome_lambda(texts):
+ result = list(filter(lambda x: (x == "".join(reversed(x))), texts))
+ return result
\ No newline at end of file diff --git a/progs/unparsable_programs/a264.py b/progs/unparsable_programs/a264.py new file mode 100644 index 0000000..e8036ea --- /dev/null +++ b/progs/unparsable_programs/a264.py @@ -0,0 +1,3 @@ +def ntimes_list(nums,n):
+ result = map(lambda x:n*x, nums)
+ return list(result)
\ No newline at end of file diff --git a/progs/unparsable_programs/a269.py b/progs/unparsable_programs/a269.py new file mode 100644 index 0000000..cf1e2f5 --- /dev/null +++ b/progs/unparsable_programs/a269.py @@ -0,0 +1,3 @@ +def sum_positivenum(nums):
+ sum_positivenum = list(filter(lambda nums:nums>0,nums))
+ return sum(sum_positivenum)
\ No newline at end of file diff --git a/progs/unparsable_programs/a282.py b/progs/unparsable_programs/a282.py new file mode 100644 index 0000000..d336e30 --- /dev/null +++ b/progs/unparsable_programs/a282.py @@ -0,0 +1,3 @@ +def div_of_nums(nums,m,n):
+ result = list(filter(lambda x: (x % m == 0 and x % n == 0), nums))
+ return result
\ No newline at end of file diff --git a/progs/unparsable_programs/a299.py b/progs/unparsable_programs/a299.py new file mode 100644 index 0000000..a217c0d --- /dev/null +++ b/progs/unparsable_programs/a299.py @@ -0,0 +1,7 @@ +import re
+def match_num(string):
+ text = re.compile(r"^5")
+ if text.match(string):
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/unparsable_programs/a305.py b/progs/unparsable_programs/a305.py new file mode 100644 index 0000000..a438797 --- /dev/null +++ b/progs/unparsable_programs/a305.py @@ -0,0 +1,3 @@ +import re
+def extract_date(url):
+ return re.findall(r'/(\d{4})/(\d{1,2})/(\d{1,2})/', url)
\ No newline at end of file diff --git a/progs/unparsable_programs/a312.py b/progs/unparsable_programs/a312.py new file mode 100644 index 0000000..daf00bc --- /dev/null +++ b/progs/unparsable_programs/a312.py @@ -0,0 +1,7 @@ +import re
+def end_num(string):
+ text = re.compile(r".*[0-9]$")
+ if text.match(string):
+ return True
+ else:
+ return False
\ No newline at end of file diff --git a/progs/unparsable_programs/a314.py b/progs/unparsable_programs/a314.py new file mode 100644 index 0000000..db3d448 --- /dev/null +++ b/progs/unparsable_programs/a314.py @@ -0,0 +1,3 @@ +def rearrange_numbs(array_nums):
+ result = sorted(array_nums, key = lambda i: 0 if i == 0 else -1 / i)
+ return result
\ No newline at end of file diff --git a/progs/unparsable_programs/a327.py b/progs/unparsable_programs/a327.py new file mode 100644 index 0000000..f3946d3 --- /dev/null +++ b/progs/unparsable_programs/a327.py @@ -0,0 +1,4 @@ +import re
+def change_date_format(dt):
+ return re.sub(r'(\d{4})-(\d{1,2})-(\d{1,2})', '\\3-\\2-\\1', dt)
+ return change_date_format(dt)
\ No newline at end of file diff --git a/progs/unparsable_programs/a332.py b/progs/unparsable_programs/a332.py new file mode 100644 index 0000000..dffadb2 --- /dev/null +++ b/progs/unparsable_programs/a332.py @@ -0,0 +1,4 @@ +import re
+def camel_to_snake(text):
+ str1 = re.sub('(.)([A-Z][a-z]+)', r'\1_\2', text)
+ return re.sub('([a-z0-9])([A-Z])', r'\1_\2', str1).lower()
\ No newline at end of file diff --git a/progs/unparsable_programs/a338.py b/progs/unparsable_programs/a338.py new file mode 100644 index 0000000..cf007ed --- /dev/null +++ b/progs/unparsable_programs/a338.py @@ -0,0 +1,3 @@ +def sorted_models(models):
+ sorted_models = sorted(models, key = lambda x: x['color'])
+ return sorted_models
\ No newline at end of file diff --git a/progs/unparsable_programs/a357.py b/progs/unparsable_programs/a357.py new file mode 100644 index 0000000..54444b2 --- /dev/null +++ b/progs/unparsable_programs/a357.py @@ -0,0 +1,11 @@ +def int_to_roman( num):
+ val = [1000, 900, 500, 400,100, 90, 50, 40,10, 9, 5, 4,1]
+ syb = ["M", "CM", "D", "CD","C", "XC", "L", "XL","X", "IX", "V", "IV","I"]
+ roman_num = ''
+ i = 0
+ while num > 0:
+ for _ in range(num // val[i]):
+ roman_num += syb[i]
+ num -= val[i]
+ i += 1
+ return roman_num
\ No newline at end of file diff --git a/progs/unparsable_programs/a360.py b/progs/unparsable_programs/a360.py new file mode 100644 index 0000000..f1ee86e --- /dev/null +++ b/progs/unparsable_programs/a360.py @@ -0,0 +1,9 @@ +def roman_to_int(s):
+ rom_val = {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}
+ int_val = 0
+ for i in range(len(s)):
+ if i > 0 and rom_val[s[i]] > rom_val[s[i - 1]]:
+ int_val += rom_val[s[i]] - 2 * rom_val[s[i - 1]]
+ else:
+ int_val += rom_val[s[i]]
+ return int_val
\ No newline at end of file diff --git a/progs/unparsable_programs/a364.py b/progs/unparsable_programs/a364.py new file mode 100644 index 0000000..42188d1 --- /dev/null +++ b/progs/unparsable_programs/a364.py @@ -0,0 +1,4 @@ +def camel_to_snake(text):
+ import re
+ str1 = re.sub('(.)([A-Z][a-z]+)', r'\1_\2', text)
+ return re.sub('([a-z0-9])([A-Z])', r'\1_\2', str1).lower()
\ No newline at end of file diff --git a/progs/unparsable_programs/a38.py b/progs/unparsable_programs/a38.py new file mode 100644 index 0000000..40a99f5 --- /dev/null +++ b/progs/unparsable_programs/a38.py @@ -0,0 +1,3 @@ +def sample_nam(sample_names):
+ sample_names=list(filter(lambda el:el[0].isupper() and el[1:].islower(),sample_names))
+ return len(''.join(sample_names))
\ No newline at end of file diff --git a/progs/unparsable_programs/a39.py b/progs/unparsable_programs/a39.py new file mode 100644 index 0000000..36fc17a --- /dev/null +++ b/progs/unparsable_programs/a39.py @@ -0,0 +1,4 @@ +import re
+def remove_parenthesis(items):
+ for item in items:
+ return (re.sub(r" ?\([^)]+\)", "", item))
\ No newline at end of file diff --git a/progs/unparsable_programs/a404.py b/progs/unparsable_programs/a404.py new file mode 100644 index 0000000..ef8b757 --- /dev/null +++ b/progs/unparsable_programs/a404.py @@ -0,0 +1,3 @@ +def filter_evennumbers(nums):
+ even_nums = list(filter(lambda x: x%2 == 0, nums))
+ return even_nums
\ No newline at end of file diff --git a/progs/unparsable_programs/a412.py b/progs/unparsable_programs/a412.py new file mode 100644 index 0000000..0c94e06 --- /dev/null +++ b/progs/unparsable_programs/a412.py @@ -0,0 +1,4 @@ +def specified_element(nums, N):
+ result = [i[N] for i in nums]
+ return result
+
\ No newline at end of file diff --git a/progs/unparsable_programs/a413.py b/progs/unparsable_programs/a413.py new file mode 100644 index 0000000..2c2214e --- /dev/null +++ b/progs/unparsable_programs/a413.py @@ -0,0 +1,4 @@ +def min_length_list(input_list):
+ min_length = min(len(x) for x in input_list )
+ min_list = min(input_list, key = lambda i: len(i))
+ return(min_length, min_list)
\ No newline at end of file diff --git a/progs/unparsable_programs/a424.py b/progs/unparsable_programs/a424.py new file mode 100644 index 0000000..fb15cae --- /dev/null +++ b/progs/unparsable_programs/a424.py @@ -0,0 +1,10 @@ +from collections import defaultdict
+def count_Substrings(s,n):
+ count,sum = 0,0
+ mp = defaultdict(lambda : 0)
+ mp[0] += 1
+ for i in range(n):
+ sum += ord(s[i]) - ord('0')
+ count += mp[sum - (i + 1)]
+ mp[sum - (i + 1)] += 1
+ return count
\ No newline at end of file diff --git a/progs/unparsable_programs/a427.py b/progs/unparsable_programs/a427.py new file mode 100644 index 0000000..07f0dc5 --- /dev/null +++ b/progs/unparsable_programs/a427.py @@ -0,0 +1,4 @@ +def subject_marks(subjectmarks):
+#subject_marks = [('English', 88), ('Science', 90), ('Maths', 97), ('Social sciences', 82)])
+ subjectmarks.sort(key = lambda x: x[1])
+ return subjectmarks
\ No newline at end of file diff --git a/progs/unparsable_programs/a464.py b/progs/unparsable_programs/a464.py new file mode 100644 index 0000000..19a3c54 --- /dev/null +++ b/progs/unparsable_programs/a464.py @@ -0,0 +1,6 @@ +def kth_element(arr, n, k):
+ for i in range(n):
+ for j in range(0, n-i-1):
+ if arr[j] > arr[j+1]:
+ arr[j], arr[j+1] == arr[j+1], arr[j]
+ return arr[k-1]
\ No newline at end of file diff --git a/progs/unparsable_programs/a467.py b/progs/unparsable_programs/a467.py new file mode 100644 index 0000000..8d50f1a --- /dev/null +++ b/progs/unparsable_programs/a467.py @@ -0,0 +1,3 @@ +def sort_sublists(input_list):
+ result = [sorted(x, key = lambda x:x[0]) for x in input_list]
+ return result
\ No newline at end of file diff --git a/progs/unparsable_programs/a474.py b/progs/unparsable_programs/a474.py new file mode 100644 index 0000000..8834f07 --- /dev/null +++ b/progs/unparsable_programs/a474.py @@ -0,0 +1,3 @@ +def common_in_nested_lists(nestedlist):
+ result = list(set.intersection(*map(set, nestedlist)))
+ return result
\ No newline at end of file diff --git a/progs/unparsable_programs/a477.py b/progs/unparsable_programs/a477.py new file mode 100644 index 0000000..ffe95ed --- /dev/null +++ b/progs/unparsable_programs/a477.py @@ -0,0 +1,4 @@ +from collections import Counter
+def assign_freq(test_list):
+ res = [(*key, val) for key, val in Counter(test_list).items()]
+ return (str(res))
\ No newline at end of file diff --git a/progs/unparsable_programs/a493.py b/progs/unparsable_programs/a493.py new file mode 100644 index 0000000..430263c --- /dev/null +++ b/progs/unparsable_programs/a493.py @@ -0,0 +1,7 @@ +from collections import defaultdict
+def max_occurrences(nums):
+ dict = defaultdict(int)
+ for i in nums:
+ dict[i] += 1
+ result = max(dict.items(), key=lambda x: x[1])
+ return result
\ No newline at end of file diff --git a/progs/unparsable_programs/a496.py b/progs/unparsable_programs/a496.py new file mode 100644 index 0000000..e34381b --- /dev/null +++ b/progs/unparsable_programs/a496.py @@ -0,0 +1,3 @@ +def sum_negativenum(nums):
+ sum_negativenum = list(filter(lambda nums:nums<0,nums))
+ return sum(sum_negativenum)
\ No newline at end of file diff --git a/progs/unparsable_programs/a51.py b/progs/unparsable_programs/a51.py new file mode 100644 index 0000000..5c5fc6f --- /dev/null +++ b/progs/unparsable_programs/a51.py @@ -0,0 +1,4 @@ +def matrix_to_list(test_list):
+ temp = [ele for sub in test_list for ele in sub]
+ res = list(zip(*temp))
+ return (str(res))
\ No newline at end of file diff --git a/progs/unparsable_programs/a538.py b/progs/unparsable_programs/a538.py new file mode 100644 index 0000000..7ae9d78 --- /dev/null +++ b/progs/unparsable_programs/a538.py @@ -0,0 +1,8 @@ +def is_valid_parenthese( str1):
+ stack, pchar = [], {"(": ")", "{": "}", "[": "]"}
+ for parenthese in str1:
+ if parenthese in pchar:
+ stack.append(parenthese)
+ elif len(stack) == 0 or pchar[stack.pop()] != parenthese:
+ return False
+ return len(stack) == 0
\ No newline at end of file diff --git a/progs/unparsable_programs/a545.py b/progs/unparsable_programs/a545.py new file mode 100644 index 0000000..1f2f494 --- /dev/null +++ b/progs/unparsable_programs/a545.py @@ -0,0 +1,7 @@ +import re
+def find_character(string):
+ uppercase_characters = re.findall(r"[A-Z]", string)
+ lowercase_characters = re.findall(r"[a-z]", string)
+ numerical_characters = re.findall(r"[0-9]", string)
+ special_characters = re.findall(r"[, .!?]", string)
+ return uppercase_characters, lowercase_characters, numerical_characters, special_characters
\ No newline at end of file diff --git a/progs/unparsable_programs/a568.py b/progs/unparsable_programs/a568.py new file mode 100644 index 0000000..817b96b --- /dev/null +++ b/progs/unparsable_programs/a568.py @@ -0,0 +1,3 @@ +def inversion_elements(test_tup):
+ res = tuple(list(map(lambda x: ~x, list(test_tup))))
+ return (res)
\ No newline at end of file diff --git a/progs/unparsable_programs/a571.py b/progs/unparsable_programs/a571.py new file mode 100644 index 0000000..4f882e6 --- /dev/null +++ b/progs/unparsable_programs/a571.py @@ -0,0 +1,5 @@ +import re
+def is_decimal(num):
+ num_fetch = re.compile(r"""^[0-9]+(\.[0-9]{1,2})?$""")
+ result = num_fetch.search(num)
+ return bool(result)
\ No newline at end of file diff --git a/progs/unparsable_programs/a573.py b/progs/unparsable_programs/a573.py new file mode 100644 index 0000000..a07ff11 --- /dev/null +++ b/progs/unparsable_programs/a573.py @@ -0,0 +1,5 @@ +import re
+def is_allowed_specific_char(string):
+ get_char = re.compile(r'[^a-zA-Z0-9.]')
+ string = get_char.search(string)
+ return not bool(string)
\ No newline at end of file diff --git a/progs/unparsable_programs/a606.py b/progs/unparsable_programs/a606.py new file mode 100644 index 0000000..b5699a7 --- /dev/null +++ b/progs/unparsable_programs/a606.py @@ -0,0 +1,6 @@ +def sort_on_occurence(lst):
+ dct = {}
+ for i, j in lst:
+ dct.setdefault(i, []).append(j)
+ return ([(i, *dict.fromkeys(j), len(j))
+ for i, j in dct.items()])
\ No newline at end of file diff --git a/progs/unparsable_programs/a61.py b/progs/unparsable_programs/a61.py new file mode 100644 index 0000000..86e124b --- /dev/null +++ b/progs/unparsable_programs/a61.py @@ -0,0 +1,3 @@ +def sorted_dict(dict1):
+ sorted_dict = {x: sorted(y) for x, y in dict1.items()}
+ return sorted_dict
\ No newline at end of file diff --git a/progs/unparsable_programs/a612.py b/progs/unparsable_programs/a612.py new file mode 100644 index 0000000..558350e --- /dev/null +++ b/progs/unparsable_programs/a612.py @@ -0,0 +1,3 @@ +def intersection_array(array_nums1,array_nums2):
+ result = list(filter(lambda x: x in array_nums1, array_nums2))
+ return result
\ No newline at end of file diff --git a/progs/unparsable_programs/a621.py b/progs/unparsable_programs/a621.py new file mode 100644 index 0000000..5db06b7 --- /dev/null +++ b/progs/unparsable_programs/a621.py @@ -0,0 +1,3 @@ +def count_odd(array_nums):
+ count_odd = len(list(filter(lambda x: (x%2 != 0) , array_nums)))
+ return count_odd
\ No newline at end of file diff --git a/progs/unparsable_programs/a636.py b/progs/unparsable_programs/a636.py new file mode 100644 index 0000000..ab2de45 --- /dev/null +++ b/progs/unparsable_programs/a636.py @@ -0,0 +1,3 @@ +def substract_elements(test_tup1, test_tup2):
+ res = tuple(map(lambda i, j: i - j, test_tup1, test_tup2))
+ return (res)
\ No newline at end of file diff --git a/progs/unparsable_programs/a640.py b/progs/unparsable_programs/a640.py new file mode 100644 index 0000000..6070126 --- /dev/null +++ b/progs/unparsable_programs/a640.py @@ -0,0 +1,3 @@ +def dict_filter(dict,n):
+ result = {key:value for (key, value) in dict.items() if value >=n}
+ return result
\ No newline at end of file diff --git a/progs/unparsable_programs/a645.py b/progs/unparsable_programs/a645.py new file mode 100644 index 0000000..140687a --- /dev/null +++ b/progs/unparsable_programs/a645.py @@ -0,0 +1,3 @@ +def sub_list(nums1,nums2):
+ result = map(lambda x, y: x - y, nums1, nums2)
+ return list(result)
\ No newline at end of file diff --git a/progs/unparsable_programs/a662.py b/progs/unparsable_programs/a662.py new file mode 100644 index 0000000..0ab4afb --- /dev/null +++ b/progs/unparsable_programs/a662.py @@ -0,0 +1,6 @@ +from collections import defaultdict
+def max_aggregate(stdata):
+ temp = defaultdict(int)
+ for name, marks in stdata:
+ temp[name] += marks
+ return max(temp.items(), key=lambda x: x[1])
\ No newline at end of file diff --git a/progs/unparsable_programs/a68.py b/progs/unparsable_programs/a68.py new file mode 100644 index 0000000..f0c967a --- /dev/null +++ b/progs/unparsable_programs/a68.py @@ -0,0 +1,10 @@ +import re
+regex = '''^(25[0-5]|2[0-4][0-9]|[0-1]?[0-9][0-9]?)\.(
+ 25[0-5]|2[0-4][0-9]|[0-1]?[0-9][0-9]?)\.(
+ 25[0-5]|2[0-4][0-9]|[0-1]?[0-9][0-9]?)\.(
+ 25[0-5]|2[0-4][0-9]|[0-1]?[0-9][0-9]?)$'''
+def check_IP(Ip):
+ if(re.search(regex, Ip)):
+ return ("Valid IP address")
+ else:
+ return ("Invalid IP address")
\ No newline at end of file diff --git a/progs/unparsable_programs/a682.py b/progs/unparsable_programs/a682.py new file mode 100644 index 0000000..5c65e09 --- /dev/null +++ b/progs/unparsable_programs/a682.py @@ -0,0 +1,3 @@ +import re
+def find_long_word(text):
+ return (re.findall(r"\b\w{5}\b", text))
\ No newline at end of file diff --git a/progs/unparsable_programs/a693.py b/progs/unparsable_programs/a693.py new file mode 100644 index 0000000..a77dd15 --- /dev/null +++ b/progs/unparsable_programs/a693.py @@ -0,0 +1,3 @@ +import re
+def find_char(text):
+ return (re.findall(r"\b\w{3,5}\b", text))
\ No newline at end of file diff --git a/progs/unparsable_programs/a696.py b/progs/unparsable_programs/a696.py new file mode 100644 index 0000000..9ed1b12 --- /dev/null +++ b/progs/unparsable_programs/a696.py @@ -0,0 +1,3 @@ +def Sort(sub_li):
+ sub_li.sort(key = lambda x: x[1])
+ return sub_li
\ No newline at end of file diff --git a/progs/unparsable_programs/a705.py b/progs/unparsable_programs/a705.py new file mode 100644 index 0000000..a0b26fe --- /dev/null +++ b/progs/unparsable_programs/a705.py @@ -0,0 +1,26 @@ +from heapq import heappop, heappush
+class Node:
+ def __init__(self, value, list_num, index):
+ self.value = value
+ self.list_num = list_num
+ self.index = index
+ def __lt__(self, other):
+ return self.value < other.value
+def find_minimum_range(list):
+ high = float('-inf')
+ p = (0, float('inf'))
+ pq = []
+ for i in range(len(list)):
+ heappush(pq, Node(list[i][0], i, 0))
+ high = max(high, list[i][0])
+ while True:
+ top = heappop(pq)
+ low = top.value
+ i = top.list_num
+ j = top.index
+ if high - low < p[1] - p[0]:
+ p = (low, high)
+ if j == len(list[i]) - 1:
+ return p
+ heappush(pq, Node(list[i][j + 1], i, j + 1))
+ high = max(high, list[i][j + 1])
\ No newline at end of file diff --git a/progs/unparsable_programs/a706.py b/progs/unparsable_programs/a706.py new file mode 100644 index 0000000..dcb86aa --- /dev/null +++ b/progs/unparsable_programs/a706.py @@ -0,0 +1,10 @@ +def dig_let(s):
+ d=l=0
+ for c in s:
+ if c.isdigit():
+ d=d+1
+ elif c.isalpha():
+ l=l+1
+ else:
+ pass
+ return (l,d)
\ No newline at end of file diff --git a/progs/unparsable_programs/a716.py b/progs/unparsable_programs/a716.py new file mode 100644 index 0000000..f37a36c --- /dev/null +++ b/progs/unparsable_programs/a716.py @@ -0,0 +1,4 @@ +def remove_column(list1, n):
+ for i in list1:
+ del i[n]
+ return list1
\ No newline at end of file diff --git a/progs/unparsable_programs/a721.py b/progs/unparsable_programs/a721.py new file mode 100644 index 0000000..6822cbb --- /dev/null +++ b/progs/unparsable_programs/a721.py @@ -0,0 +1,3 @@ +def moddiv_list(nums1,nums2):
+ result = map(lambda x, y: x % y, nums1, nums2)
+ return list(result)
\ No newline at end of file diff --git a/progs/unparsable_programs/a733.py b/progs/unparsable_programs/a733.py new file mode 100644 index 0000000..ce0150e --- /dev/null +++ b/progs/unparsable_programs/a733.py @@ -0,0 +1,3 @@ +def float_sort(price):
+ float_sort=sorted(price, key=lambda x: float(x[1]), reverse=True)
+ return float_sort
\ No newline at end of file diff --git a/progs/unparsable_programs/a754.py b/progs/unparsable_programs/a754.py new file mode 100644 index 0000000..c453802 --- /dev/null +++ b/progs/unparsable_programs/a754.py @@ -0,0 +1,3 @@ +def convert_list_dictionary(l1, l2, l3):
+ result = [{x: {y: z}} for (x, y, z) in zip(l1, l2, l3)]
+ return result
\ No newline at end of file diff --git a/progs/unparsable_programs/a756.py b/progs/unparsable_programs/a756.py new file mode 100644 index 0000000..159b73d --- /dev/null +++ b/progs/unparsable_programs/a756.py @@ -0,0 +1,4 @@ +def max_length_list(input_list):
+ max_length = max(len(x) for x in input_list )
+ max_list = max(input_list, key = lambda i: len(i))
+ return(max_length, max_list)
\ No newline at end of file diff --git a/progs/unparsable_programs/a759.py b/progs/unparsable_programs/a759.py new file mode 100644 index 0000000..25684b9 --- /dev/null +++ b/progs/unparsable_programs/a759.py @@ -0,0 +1,7 @@ +import re
+regex = r'^[a-z]$|^([a-z]).*\1$'
+def check_char(string):
+ if(re.search(regex, string)):
+ return "Valid"
+ else:
+ return "Invalid"
\ No newline at end of file diff --git a/progs/unparsable_programs/a770.py b/progs/unparsable_programs/a770.py new file mode 100644 index 0000000..01aa0da --- /dev/null +++ b/progs/unparsable_programs/a770.py @@ -0,0 +1,11 @@ +def rearrange_bigger(n):
+ nums = list(str(n))
+ for i in range(len(nums)-2,-1,-1):
+ if nums[i] < nums[i+1]:
+ z = nums[i:]
+ y = min(filter(lambda x: x > z[0], z))
+ z.remove(y)
+ z.sort()
+ nums[i:] = [y] + z
+ return int("".join(nums))
+ return False
\ No newline at end of file diff --git a/progs/unparsable_programs/a771.py b/progs/unparsable_programs/a771.py new file mode 100644 index 0000000..6343c44 --- /dev/null +++ b/progs/unparsable_programs/a771.py @@ -0,0 +1,15 @@ +import heapq
+def k_smallest_pairs(nums1, nums2, k):
+ queue = []
+ def push(i, j):
+ if i < len(nums1) and j < len(nums2):
+ heapq.heappush(queue, [nums1[i] + nums2[j], i, j])
+ push(0, 0)
+ pairs = []
+ while queue and len(pairs) < k:
+ _, i, j = heapq.heappop(queue)
+ pairs.append([nums1[i], nums2[j]])
+ push(i, j + 1)
+ if j == 0:
+ push(i + 1, 0)
+ return pairs
\ No newline at end of file diff --git a/progs/unparsable_programs/a790.py b/progs/unparsable_programs/a790.py new file mode 100644 index 0000000..a164a22 --- /dev/null +++ b/progs/unparsable_programs/a790.py @@ -0,0 +1,3 @@ +import re
+def change_date_format(dt):
+ return re.sub(r'(\d{4})-(\d{1,2})-(\d{1,2})', '\\3-\\2-\\1', dt)
\ No newline at end of file diff --git a/progs/unparsable_programs/a803.py b/progs/unparsable_programs/a803.py new file mode 100644 index 0000000..e0ddfe1 --- /dev/null +++ b/progs/unparsable_programs/a803.py @@ -0,0 +1,4 @@ +import re
+def find_adverb_position(text):
+ for m in re.finditer(r"\w+ly", text):
+ return (m.start(), m.end(), m.group(0))
\ No newline at end of file diff --git a/progs/unparsable_programs/a81.py b/progs/unparsable_programs/a81.py new file mode 100644 index 0000000..b9ae819 --- /dev/null +++ b/progs/unparsable_programs/a81.py @@ -0,0 +1,3 @@ +def mul_list(nums1,nums2):
+ result = map(lambda x, y: x * y, nums1, nums2)
+ return list(result)
\ No newline at end of file diff --git a/progs/unparsable_programs/a810.py b/progs/unparsable_programs/a810.py new file mode 100644 index 0000000..3fff4aa --- /dev/null +++ b/progs/unparsable_programs/a810.py @@ -0,0 +1,3 @@ +def cube_nums(nums):
+ cube_nums = list(map(lambda x: x ** 3, nums))
+ return cube_nums
\ No newline at end of file diff --git a/progs/unparsable_programs/a814.py b/progs/unparsable_programs/a814.py new file mode 100644 index 0000000..2f895d0 --- /dev/null +++ b/progs/unparsable_programs/a814.py @@ -0,0 +1,3 @@ +import re
+def remove_whitespaces(text1):
+ return (re.sub(r'\s+', '',text1))
\ No newline at end of file diff --git a/progs/unparsable_programs/a822.py b/progs/unparsable_programs/a822.py new file mode 100644 index 0000000..246129f --- /dev/null +++ b/progs/unparsable_programs/a822.py @@ -0,0 +1,5 @@ +import re
+def remove_uppercase(str1):
+ remove_upper = lambda text: re.sub('[A-Z]', '', text)
+ result = remove_upper(str1)
+ return (result)
\ No newline at end of file diff --git a/progs/unparsable_programs/a828.py b/progs/unparsable_programs/a828.py new file mode 100644 index 0000000..16ad291 --- /dev/null +++ b/progs/unparsable_programs/a828.py @@ -0,0 +1,3 @@ +def drop_empty(dict1):
+ dict1 = {key:value for (key, value) in dict1.items() if value is not None}
+ return dict1
\ No newline at end of file diff --git a/progs/unparsable_programs/a841.py b/progs/unparsable_programs/a841.py new file mode 100644 index 0000000..34e9fe1 --- /dev/null +++ b/progs/unparsable_programs/a841.py @@ -0,0 +1,5 @@ +import re
+def remove_lowercase(str1):
+ remove_lower = lambda text: re.sub('[a-z]', '', text)
+ result = remove_lower(str1)
+ return result
\ No newline at end of file diff --git a/progs/unparsable_programs/a858.py b/progs/unparsable_programs/a858.py new file mode 100644 index 0000000..1dcc6e1 --- /dev/null +++ b/progs/unparsable_programs/a858.py @@ -0,0 +1,5 @@ +import re
+def remove_lowercase(str1):
+ remove_lower = lambda text: re.sub('[a-z]', '', text)
+ result = remove_lower(str1)
+ return (result)
\ No newline at end of file diff --git a/progs/unparsable_programs/a879.py b/progs/unparsable_programs/a879.py new file mode 100644 index 0000000..791dd76 --- /dev/null +++ b/progs/unparsable_programs/a879.py @@ -0,0 +1,18 @@ +def radix_sort(nums):
+ RADIX = 10
+ placement = 1
+ max_digit = max(nums)
+
+ while placement < max_digit:
+ buckets = [list() for _ in range( RADIX )]
+ for i in nums:
+ tmp = int((i / placement) % RADIX)
+ buckets[tmp].append(i)
+ a = 0
+ for b in range( RADIX ):
+ buck = buckets[b]
+ for i in buck:
+ nums[a] = i
+ a += 1
+ placement *= RADIX
+ return nums
\ No newline at end of file diff --git a/progs/unparsable_programs/a886.py b/progs/unparsable_programs/a886.py new file mode 100644 index 0000000..9573668 --- /dev/null +++ b/progs/unparsable_programs/a886.py @@ -0,0 +1,10 @@ +def check_string(str1):
+ messg = [
+ lambda str1: any(x.isupper() for x in str1) or 'String must have 1 upper case character.',
+ lambda str1: any(x.islower() for x in str1) or 'String must have 1 lower case character.',
+ lambda str1: any(x.isdigit() for x in str1) or 'String must have 1 number.',
+ lambda str1: len(str1) >= 7 or 'String length should be atleast 8.',]
+ result = [x for x in [i(str1) for i in messg] if x != True]
+ if not result:
+ result.append('Valid string.')
+ return result
\ No newline at end of file diff --git a/progs/unparsable_programs/a889.py b/progs/unparsable_programs/a889.py new file mode 100644 index 0000000..e9c0151 --- /dev/null +++ b/progs/unparsable_programs/a889.py @@ -0,0 +1,6 @@ +def capitalize_first_last_letters(str1):
+ str1 = result = str1.title()
+ result = ""
+ for word in str1.split():
+ result += word[:-1] + word[-1].upper() + " "
+ return result[:-1]
\ No newline at end of file diff --git a/progs/unparsable_programs/a90.py b/progs/unparsable_programs/a90.py new file mode 100644 index 0000000..6ef8340 --- /dev/null +++ b/progs/unparsable_programs/a90.py @@ -0,0 +1,6 @@ +from itertools import groupby
+def group_element(test_list):
+ res = dict()
+ for key, val in groupby(sorted(test_list, key = lambda ele: ele[1]), key = lambda ele: ele[1]):
+ res[key] = [ele[0] for ele in val]
+ return (res)
diff --git a/progs/unparsable_programs/a926.py b/progs/unparsable_programs/a926.py new file mode 100644 index 0000000..f5a9cc8 --- /dev/null +++ b/progs/unparsable_programs/a926.py @@ -0,0 +1,3 @@ +import re
+def extract_values(text):
+ return (re.findall(r'"(.*?)"', text))
\ No newline at end of file diff --git a/progs/unparsable_programs/a931.py b/progs/unparsable_programs/a931.py new file mode 100644 index 0000000..fc9e5a8 --- /dev/null +++ b/progs/unparsable_programs/a931.py @@ -0,0 +1,3 @@ +def empty_list(length):
+ empty_list = [{} for _ in range(length)]
+ return empty_list
\ No newline at end of file diff --git a/progs/unparsable_programs/a943.py b/progs/unparsable_programs/a943.py new file mode 100644 index 0000000..ddad129 --- /dev/null +++ b/progs/unparsable_programs/a943.py @@ -0,0 +1,11 @@ +def even_ele(test_tuple, even_fnc):
+ res = tuple()
+ for ele in test_tuple:
+ if isinstance(ele, tuple):
+ res += (even_ele(ele, even_fnc), )
+ elif even_fnc(ele):
+ res += (ele, )
+ return res
+def extract_even(test_tuple):
+ res = even_ele(test_tuple, lambda x: x % 2 == 0)
+ return (res)
\ No newline at end of file diff --git a/progs/unparsable_programs/a947.py b/progs/unparsable_programs/a947.py new file mode 100644 index 0000000..9ef0cf1 --- /dev/null +++ b/progs/unparsable_programs/a947.py @@ -0,0 +1,4 @@ +import re
+def find_adverbs(text):
+ for m in re.finditer(r"\w+ly", text):
+ return ('%d-%d: %s' % (m.start(), m.end(), m.group(0)))
\ No newline at end of file diff --git a/progs/unparsable_programs/a948.py b/progs/unparsable_programs/a948.py new file mode 100644 index 0000000..f42212f --- /dev/null +++ b/progs/unparsable_programs/a948.py @@ -0,0 +1,4 @@ +import heapq
+def expensive_items(items,n):
+ expensive_items = heapq.nlargest(n, items, key=lambda s: s['price'])
+ return expensive_items
\ No newline at end of file diff --git a/progs/unparsable_programs/a96.py b/progs/unparsable_programs/a96.py new file mode 100644 index 0000000..b135674 --- /dev/null +++ b/progs/unparsable_programs/a96.py @@ -0,0 +1,3 @@ +def count_even(array_nums):
+ count_even = len(list(filter(lambda x: (x%2 == 0) , array_nums)))
+ return count_even
\ No newline at end of file diff --git a/progs/unparsable_programs/a97.py b/progs/unparsable_programs/a97.py new file mode 100644 index 0000000..3aabcc9 --- /dev/null +++ b/progs/unparsable_programs/a97.py @@ -0,0 +1,3 @@ +def sort_dict_item(test_dict):
+ res = {key: test_dict[key] for key in sorted(test_dict.keys(), key = lambda ele: ele[1] * ele[0])}
+ return (res)
diff --git a/progs/unparsable_programs/a970.py b/progs/unparsable_programs/a970.py new file mode 100644 index 0000000..1fdbebb --- /dev/null +++ b/progs/unparsable_programs/a970.py @@ -0,0 +1,3 @@ +import re
+def find_char_long(text):
+ return (re.findall(r"\b\w{4,}\b", text))
\ No newline at end of file diff --git a/progs/unparsable_programs/a971.py b/progs/unparsable_programs/a971.py new file mode 100644 index 0000000..490613c --- /dev/null +++ b/progs/unparsable_programs/a971.py @@ -0,0 +1,3 @@ +def square_nums(nums):
+ square_nums = list(map(lambda x: x ** 2, nums))
+ return square_nums
\ No newline at end of file diff --git a/progs/wrong.py b/progs/wrong.py new file mode 100644 index 0000000..1bcd821 --- /dev/null +++ b/progs/wrong.py @@ -0,0 +1,4 @@ +fa dkfjd;slkjfdslakjf +jfsdj <<>>>><><><> + +klwsd |