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/unparsable_programs | |
Init
Diffstat (limited to 'progs/unparsable_programs')
96 files changed, 472 insertions, 0 deletions
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 |