prompt,prompt_tokens,compression_time,compressed_tokens,compression_ratio,compressed_text,gpt_o1_saving,compression_ratio_normalized
"Prompt: Write a function to find the minimum cost path to reach (m, n) from (0, 0) for the given cost matrix cost[][] and a position (m, n) in cost[][]. Assesments: assert min_cost([[1, 2, 3], [4, 8, 2], [1, 5, 3]], 2, 2) == 8, assert min_cost([[2, 3, 4], [5, 9, 3], [2, 6, 4]], 2, 2) == 12, assert min_cost([[3, 4, 5], [6, 10, 4], [3, 7, 5]], 2, 2) == 16",167,0.043,96,1.7395833333333333,"Prompt: Write a function to find the minimum cost path to reach (m, n from (0 0) for the given cost matrix cost[][] and a position (m in cost[]. Assesments: assert min_cost([[1 2 [4 8 21 5 3] 2, 2) == 8, assert 3 9 32 6 4] 2 12 4 10 43 7 16",0.0,0.06133764230237258
"Prompt: Write a function to find the similar elements from the given two tuple lists. Assesments: assert similar_elements((3, 4, 5, 6),(5, 7, 4, 10)) == (4, 5), assert similar_elements((1, 2, 3, 4),(5, 4, 3, 7)) == (3, 4), assert similar_elements((11, 12, 14, 13),(17, 15, 14, 13)) == (13, 14)",120,0.037,69,1.7391304347826086,"Prompt: Write a function to find the similar elements from the given two tuple lists Assesments: assert similar_elements((3 4,, 6),(5 7 4 10 == (4 5), assert 4 3 73 12 14 13),(17 15 14 1313 14)",0.0,0.06129144173524472
"Prompt: Write a python function to identify non-prime numbers. Assesments: assert is_not_prime(2) == False, assert is_not_prime(10) == True, assert is_not_prime(35) == True",46,0.031,25,1.84,"Prompt: Write a python function identify non-prime numbers. Assesments: assert is_not_prime(2 == False,",0.0,0.07158123204596234
"Prompt: Write a function to find the largest integers from a given list of numbers using heap queue algorithm. Assesments: assert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],3)==[85, 75, 65] , assert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],2)==[85, 75] , assert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],5)==[85, 75, 65, 58, 35]",162,0.044,89,1.8202247191011236,"Prompt: Write a function to find the largest integers from a given list of numbers using heap queue algorithm. Assesments: assert heap_queue_largest( [25, 35, 22, 85, 14, 65 75 22 58],3)==[85 75 65] , assert25 58],2)==[85] 58],5)==[85,, 58, 35]",0.0,0.06956393878861127
"Prompt: Write a function to find the number of ways to fill it with 2 x 1 dominoes for the given 3 x n board. Assesments: assert count_ways(2) == 3, assert count_ways(8) == 153, assert count_ways(12) == 2131",68,0.034,44,1.5454545454545454,"Prompt: Write a function find the number ways fill it 2 x 1 dominoes for the given 3 x n board Assesments: assert count_ways(2 3, 153 2131",0.0,0.04153439921074775
"Prompt: Write a python function to check whether the two numbers differ at one bit position only or not. Assesments: assert differ_At_One_Bit_Pos(13,9) == True, assert differ_At_One_Bit_Pos(15,8) == False, assert differ_At_One_Bit_Pos(2,4) == False",75,0.033,38,1.9736842105263157,"Prompt: Write a python function check whether the two numbers differ at one bit position only or not Assesments: assert differ_At_One_Bit_Pos(13,9 True,",0.0,0.08521847228988524
"Prompt: Write a function to find all words which are at least 4 characters long in a string by using regex. Assesments: assert find_char_long('Please move back to stream') == ['Please', 'move', 'back', 'stream'], assert find_char_long('Jing Eco and Tech') == ['Jing', 'Tech'], assert find_char_long('Jhingai wulu road Zone 3') == ['Jhingai', 'wulu', 'road', 'Zone']",102,0.038,71,1.4366197183098592,"Prompt: Write a function find all words which at least 4 characters in a string by regex. Assesments: assert find_char_long('Please move back stream == ['Please',moveback 'stream' assert find_char_long('Jing Eco and TechTech' find_char_long('Jhingai wulu road Zone 3wuluZone']",0.0,0.030432065742684648
"Prompt: Write a function to find squares of individual elements in a list using lambda function. Assesments: assert square_nums([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[1, 4, 9, 16, 25, 36, 49, 64, 81, 100], assert square_nums([10,20,30])==([100,400,900]), assert square_nums([12,15])==([144,225])",118,0.034,79,1.4936708860759493,"Prompt: Write a function find squares of individual elements in using lambda function Assesments: assert square_nums([1 10])==[1 4 9 16 25 36 49 64 81 100], assert square_nums([10,20,30])==([100,400,900]), square_nums([12,15])==([144,225])",0.0,0.03625190398655391
"Prompt: Write a python function to find the minimum number of rotations required to get the same string. Assesments: assert find_Rotations(""aaaa"") == 1, assert find_Rotations(""ab"") == 2, assert find_Rotations(""abc"") == 3",59,0.031,33,1.7878787878787878,"Prompt: Write a python function find the minimum number rotations required get the same string Assesments: assert find_Rotations(""aaaa"") == 1, assert",0.0,0.0662643027788256
"Prompt: Write a function to get the n smallest items from a dataset. Assesments: assert small_nnum([10, 20, 50, 70, 90, 20, 50, 40, 60, 80, 100],2)==[10,20], assert small_nnum([10, 20, 50, 70, 90, 20, 50, 40, 60, 80, 100],5)==[10,20,20,40,50], assert small_nnum([10, 20, 50, 70, 90, 20, 50, 40, 60, 80, 100],3)==[10,20,20]",159,0.036,83,1.9156626506024097,"Prompt: Write a function to get the n smallest items from a dataset. Assesments: assert small_nnum([10, 20, 50, 70, 90, 20, 50, 40 60, 80, 100],2)==[10,20], assert 20 100],5)==[10,20,20,40,50], assert]",0.0,0.07929964351501122
"Prompt: Write a python function to remove first and last occurrence of a given character from the string. Assesments: assert remove_Occ(""hello"",""l"") == ""heo"", assert remove_Occ(""abcda"",""a"") == ""bcd"", assert remove_Occ(""PHP"",""P"") == ""H""",65,0.03,49,1.3265306122448979,"Prompt: Write a python function remove first and last occurrence a given character from the string Assesments: assert remove_Occ(""hello"",""l ==heo remove_Occ(""abcda"",""abcd remove_Occ(""PHP"",""P ""H""",0.0,0.019201782213044798
"Prompt: Write a function to sort a given matrix in ascending order according to the sum of its rows. Assesments: assert sort_matrix([[1, 2, 3], [2, 4, 5], [1, 1, 1]])==[[1, 1, 1], [1, 2, 3], [2, 4, 5]], assert sort_matrix([[1, 2, 3], [-2, 4, -5], [1, -1, 1]])==[[-2, 4, -5], [1, -1, 1], [1, 2, 3]], assert sort_matrix([[5,8,9],[6,4,3],[2,1,4]])==[[2, 1, 4], [6, 4, 3], [5, 8, 9]]",192,0.048,117,1.641025641025641,"Prompt: Write a function to sort a given matrix in ascending according the sum its rows. Assesments: assert sort_matrix([[1, 2], [2 41 1 1]])==[[1 1 1],1 2 32]], assert [-2 4, -5 [1 -1 1]])==[[-2 4 [],1 2] sort_matrix([[5,8,9],[6,4,3],[2,1,4]])==[[2 1 46 4 35 8 9]]",0.0,0.05128368811739382
"Prompt: Write a function to count the most common words in a dictionary. Assesments: assert count_common(['red','green','black','pink','black','white','black','eyes','white','black','orange','pink','pink','red','red','white','orange','white',""black"",'pink','green','green','pink','green','pink','white','orange',""orange"",'red']) == [('pink', 6), ('black', 5), ('white', 5), ('red', 4)], assert count_common(['one', 'two', 'three', 'four', 'five', 'one', 'two', 'one', 'three', 'one']) == [('one', 4), ('two', 2), ('three', 2), ('four', 1)], assert count_common(['Facebook', 'Apple', 'Amazon', 'Netflix', 'Google', 'Apple', 'Netflix', 'Amazon']) == [('Apple', 2), ('Amazon', 2), ('Netflix', 2), ('Facebook', 1)]",216,0.054,162,1.3333333333333333,"Prompt: Write a function to count the most common words in a dictionary. Assesments: assert count_common(['red','green','black','pink','black','white','black','eyes','white','black','orange','pink','pink','red','red','white','orange','white',""black"",'pink','green','green','pink','green','pink','white','orange',""orange"",'red']) == [('pink', 6), ('black', 5),white', 5red 4)], assert count_common(['one', 'twoonetwoone',threeone' [one 4two 2three 2four 1) count_common(['Facebook', 'Apple',AmazonNetflix',Google',Apple 'NetflixAmazon'])Apple 2Amazon 2Netflix 2Facebook 1)]",0.0,0.019895733588679635
"Prompt: Write a python function to find the volume of a triangular prism. Assesments: assert find_Volume(10,8,6) == 240, assert find_Volume(3,2,2) == 6, assert find_Volume(1,2,1) == 1",66,0.033,35,1.8857142857142857,"Prompt: Write a python function find the volume of a triangular prism Assesments: assert find_Volume(10,8,6 240, 6 1",0.0,0.07624458529022844
"Prompt: Write a function to split a string at lowercase letters. Assesments: assert split_lowerstring(""AbCd"")==['bC','d'], assert split_lowerstring(""Python"")==['y', 't', 'h', 'o', 'n'], assert split_lowerstring(""Programming"")==['r', 'o', 'g', 'r', 'a', 'm', 'm', 'i', 'n', 'g']",90,0.035,55,1.6363636363636365,"Prompt: Write a function to split a string at lowercase letters. Assesments: assert split_lowerstring(""AbCd"")==['bC','d'], assert split_lowerstring(""Python"")==['y',t',hon' split_lowerstring(""Programming"")==['rogramming']",0.0,0.05080811304877696
"Prompt: Write a function to find sequences of lowercase letters joined with an underscore. Assesments: assert text_lowercase_underscore(""aab_cbbbc"")==('Found a match!'), assert text_lowercase_underscore(""aab_Abbbc"")==('Not matched!'), assert text_lowercase_underscore(""Aaab_abbbc"")==('Not matched!')",74,0.033,37,2.0,"Prompt: Write a function find sequences lowercase letters joined with an underscore Assesments: assert text_lowercase_underscore(""aab_cbbbc"")==('Found a match!' matched!",0.0,0.0879029684008937
"Prompt: Write a function to find the perimeter of a square. Assesments: assert square_perimeter(10)==40, assert square_perimeter(5)==20, assert square_perimeter(4)==16",43,0.026,21,2.0476190476190474,Prompt: Write a function find the perimeter a square Assesments assert square_perimeter(10)==40,0.0,0.09276062803033755
"Prompt: Write a function to remove characters from the first string which are present in the second string. Assesments: assert remove_dirty_chars(""probasscurve"", ""pros"") == 'bacuve', assert remove_dirty_chars(""digitalindia"", ""talent"") == 'digiidi', assert remove_dirty_chars(""exoticmiles"", ""toxic"") == 'emles'",78,0.033,59,1.3220338983050848,"Prompt: Write a function to remove characters the first string which are present the second string Assesments: assert remove_dirty_chars(""probasscurvepros == 'bacuve assert remove_dirty_chars(""digitalindia ""talentdigiidi remove_dirty_chars(""exoticmilestoxicemles'",0.0,0.01874306859186246
"Prompt: Write a function to find whether a given array of integers contains any duplicate element. Assesments: assert test_duplicate(([1,2,3,4,5]))==False, assert test_duplicate(([1,2,3,4, 4]))==True, assert test_duplicate([1,1,2,2,3,3,4,4,5])==True",81,0.03,24,3.375,Prompt: Write a function find whether a given array contains any duplicate element Assesments: assert 4]))==True,0.0,0.22816789020108524
"Prompt: Write a function to check if the given number is woodball or not. Assesments: assert is_woodall(383) == True, assert is_woodall(254) == False, assert is_woodall(200) == False",53,0.027,28,1.8928571428571428,"Prompt: Write a function to check the given number woodball or not Assesments: assert is_woodall(383 == True,",0.0,0.07697323423464501
"Prompt: Write a function to find m number of multiples of n. Assesments: assert multiples_of_num(4,3)== [3,6,9,12], assert multiples_of_num(2,5)== [5,10], assert multiples_of_num(9,2)== [2,4,6,8,10,12,14,16,18]",78,0.029,27,2.888888888888889,"Prompt: Write a function find m number multiples n. Assesments: assert multiples_of_num(4,3)== [ assert],",0.0,0.17857928148384578
"Prompt: Write a function to find the first duplicate element in a given array of integers. Assesments: assert find_first_duplicate(([1, 2, 3, 4, 4, 5]))==4, assert find_first_duplicate([1, 2, 3, 4])==-1, assert find_first_duplicate([1, 1, 2, 3, 3, 2, 2])==1",93,0.03,53,1.7547169811320755,"Prompt: Write a function to find the first duplicate element in a given array of integers Assesments: assert find_first_duplicate(([1 4 5]))==4, assert 4])==-1 1 3, 2 2])==1",0.0,0.0628814386114942
"Prompt: Write a python function to find the maximum sum of elements of list in a list of lists. Assesments: assert maximum_Sum([[1,2,3],[4,5,6],[10,11,12],[7,8,9]]) == 33, assert maximum_Sum([[0,1,1],[1,1,2],[3,2,1]]) == 6, assert maximum_Sum([[0,1,3],[1,2,1],[9,8,2],[0,1,0],[6,4,8]]) == 19",123,0.031,56,2.1964285714285716,"Prompt: Write a python function find the maximum sum elements list in of lists Assesments: assert maximum_Sum([[1,2,3],[4,5,6],[10,11,12],[7,8,9) == 33, 6 19",0.0,0.10794081437234966
"Prompt: Write a function to convert the given binary number to its decimal equivalent. Assesments: assert binary_to_decimal(100) == 4, assert binary_to_decimal(1011) == 11, assert binary_to_decimal(1101101) == 109",55,0.03,31,1.7741935483870968,"Prompt: Write a function convert the given binary number its decimal equivalent Assesments: assert binary_to_decimal(100 4, 11) 109",0.0,0.06486825983546636
"Prompt: Write a python function to find the product of non-repeated elements in a given array. Assesments: assert find_Product([1,1,2,3],4) == 6, assert find_Product([1,2,3,1,1],5) == 6, assert find_Product([1,1,4,5,6],5) == 120",81,0.029,40,2.025,"Prompt: Write a python function find the product of non-repeated elements a given array Assesments: assert find_Product([1,1,2,3],4 == 6, 120",0.0,0.09045323970635173
"Prompt: Write a function to check if the given tuple list has all k elements. Assesments: assert check_k_elements([(4, 4), (4, 4, 4), (4, 4), (4, 4, 4, 4), (4, )], 4) == True, assert check_k_elements([(7, 7, 7), (7, 7)], 7) == True, assert check_k_elements([(9, 9), (9, 9, 9, 9)], 7) == False",121,0.036,63,1.9206349206349207,"Prompt: Write a function to check if the given tuple list has all k elements. Assesments: assert check_k_elements([(4, 4), (4, (),,, ) 4) == True, assert check_k_elements([(7 7,7) 7 True),,,) 7 False",0.0,0.07980686901848728
"Prompt: Write a python function to remove all digits from a list of strings. Assesments: assert remove(['4words', '3letters', '4digits']) == ['words', 'letters', 'digits'], assert remove(['28Jan','12Jan','11Jan']) == ['Jan','Jan','Jan'], assert remove(['wonder1','wonder2','wonder3']) == ['wonder','wonder','wonder']",84,0.038,67,1.2537313432835822,"Prompt: Write a python function to remove all digits a list of strings. Assesments: assert remove(['4words3letters4digits' == ['wordsletters'], assert remove(['28Jan','12Jan','11Jan'Jan','Jan','Jan' remove(['wonder1','wonder2','wonder3wonder','wonder','wonder",0.0,0.011775466745430209
"Prompt: Write a python function to find binomial co-efficient. Assesments: assert binomial_Coeff(5,2) == 10, assert binomial_Coeff(4,3) == 4, assert binomial_Coeff(3,2) == 3",61,0.031,31,1.967741935483871,"Prompt: Write a python function find binomial co-efficient. Assesments: assert binomial_Coeff(5,2 10, 4",0.0,0.08461229574868981
"Prompt: Write a python function to find the element occurring odd number of times. Assesments: assert get_Odd_Occurrence([1,2,3,1,2,3,1],7) == 1, assert get_Odd_Occurrence([1,2,3,2,3,1,3],7) == 3, assert get_Odd_Occurrence([2,3,5,4,5,2,4,3,5,2,4,4,2],13) == 5",115,0.031,45,2.5555555555555554,"Prompt: Write a python function find the element occurring odd number Assesments: assert get_Odd_Occurrence([1,2,3,1,2,3,1],7 == 1, 3",0.0,0.14457566407773875
"Prompt: Write a python function to count all the substrings starting and ending with same characters. Assesments: assert count_Substring_With_Equal_Ends(""abc"") == 3, assert count_Substring_With_Equal_Ends(""abcda"") == 6, assert count_Substring_With_Equal_Ends(""ab"") == 2",71,0.032,38,1.868421052631579,"Prompt: Write a python function count all the substrings starting and same characters Assesments: assert count_Substring_With_Equal_Ends(""abc == 3, 6 2",0.0,0.07448048784585146
"Prompt: Write a function to find the top k integers that occur most frequently from given lists of sorted and distinct integers using heap queue algorithm. Assesments: assert func([[1, 2, 6], [1, 3, 4, 5, 7, 8], [1, 3, 5, 6, 8, 9], [2, 5, 7, 11], [1, 4, 7, 8, 12]],3)==[5, 7, 1], assert func([[1, 2, 6], [1, 3, 4, 5, 7, 8], [1, 3, 5, 6, 8, 9], [2, 5, 7, 11], [1, 4, 7, 8, 12]],1)==[1], assert func([[1, 2, 6], [1, 3, 4, 5, 7, 8], [1, 3, 5, 6, 8, 9], [2, 5, 7, 11], [1, 4, 7, 8, 12]],5)==[6, 5, 7, 8, 1]",287,0.056,161,1.7826086956521738,"Prompt: Write a function to find the top k integers that occur most frequently from given lists of sorted and distinct integers using heap queue algorithm. Assesments: assert func([[1, 2, 6], [1 3, 4, 5, 7, 8], [1 3, 5, 6, 8, 9],2 5, 7, 11],1 4 7, 8, 12]],3)==[5, 7, 1], assert func([[1 2, 6],1 7,1 3 52 4 12]],1)==[1], assert func([[1 12]],5)==[6, 5 7 8, 1]",0.0,0.06572669617951955
"Prompt: Write a python function to find the largest prime factor of a given number. Assesments: assert max_Prime_Factors(15) == 5, assert max_Prime_Factors(6) == 3, assert max_Prime_Factors(2) == 2",59,0.032,33,1.7878787878787878,"Prompt: Write a python function find the largest prime factor of a given number Assesments: assert max_Prime_Factors(15) 5, 3",0.0,0.0662643027788256
"Prompt: Write a python function to convert a decimal number to binary number. Assesments: assert decimal_To_Binary(10) == 1010, assert decimal_To_Binary(1) == 1, assert decimal_To_Binary(20) == 10100",56,0.028,33,1.696969696969697,"Prompt: Write a python function convert a decimal number binary number Assesments: assert decimal_To_Binary(10) 1010, 1 10100",0.0,0.05699058894079641
"Prompt: Write a python function to find the missing number in a sorted array. Assesments: assert find_missing([1,2,3,5],4) == 4, assert find_missing([1,3,4,5],4) == 2, assert find_missing([1,2,3,5,6,7],5) == 4",77,0.028,37,2.081081081081081,"Prompt: Write a python function find the missing number in a sorted array Assesments: assert find_missing([1,2,3,5],4 == 4, 2",0.0,0.09617411858075758
"Prompt: Write a function to find the n-th rectangular number. Assesments: assert find_rect_num(4) == 20, assert find_rect_num(5) == 30, assert find_rect_num(6) == 42",49,0.028,30,1.6333333333333333,"Prompt: Write a function to find the n-th rectangular number. Assesments: assert find_rect_num(4 20, 30 42",0.0,0.050498989254175966
"Prompt: Write a python function to find the nth digit in the proper fraction of two given numbers. Assesments: assert find_Nth_Digit(1,2,1) == 5, assert find_Nth_Digit(3,5,1) == 6, assert find_Nth_Digit(5,6,5) == 3",74,0.029,40,1.85,"Prompt: Write a python function find the nth digit the proper fraction two given numbers Assesments: assert find_Nth_Digit(1,2,1 5, assert 6 3",0.0,0.07260134056814556
"Prompt: Write a function to sort a given mixed list of integers and strings. Assesments: assert sort_mixed_list([19,'red',12,'green','blue', 10,'white','green',1])==[1, 10, 12, 19, 'blue', 'green', 'green', 'red', 'white'], assert sort_mixed_list([19,'red',12,'green','blue', 10,'white','green',1])==[1, 10, 12, 19, 'blue', 'green', 'green', 'red', 'white'], assert sort_mixed_list([19,'red',12,'green','blue', 10,'white','green',1])==[1, 10, 12, 19, 'blue', 'green', 'green', 'red', 'white']",179,0.042,106,1.6886792452830188,"Prompt: Write a function to sort a given mixed list of integers and strings. Assesments: assert sort_mixed_list([19,'red',12,'green','blue', 10,'white','green',1])==[1, 10, 12, 19, 'blue', 'green', 'green', 'red', 'white'], assert sort_mixed_list([19,'red',12,'green','blue', 10,'white','green',1])==[1 19red assert']",0.0,0.05614487289896355
"Prompt: Write a function to find the division of first even and odd number of a given list. Assesments: assert div_even_odd([1,3,5,7,4,1,6,8])==4, assert div_even_odd([1,2,3,4,5,6,7,8,9,10])==2, assert div_even_odd([1,5,7,9,10])==10",96,0.031,44,2.1818181818181817,"Prompt: Write a function find the division first even and odd number of a given list Assesments assert div_even_odd([1,3,5,7,4,1,6,8])==4",0.0,0.10645039607695207
"Prompt: Write a function to check if the letters of a given string can be rearranged so that two characters that are adjacent to each other are different. Assesments: assert rearange_string(""aab"")==('aba'), assert rearange_string(""aabb"")==('abab'), assert rearange_string(""abccdd"")==('cdabcd')",70,0.03,47,1.4893617021276595,"Prompt: Write a function to check the letters of a given string can rearranged so two characters that adjacent different Assesments: assert rearange_string(""aab"")==('aba rearange_string(""abccdd"")==('cdabcd",0.0,0.035812320459623355
"Prompt: Write a function to find frequency of the elements in a given list of lists using collections module. Assesments: assert freq_element([[1, 2, 3, 2], [4, 5, 6, 2], [7, 1, 9, 5]])==({2: 3, 1: 2, 5: 2, 3: 1, 4: 1, 6: 1, 7: 1, 9: 1}), assert freq_element([[1,2,3,4],[5,6,7,8],[9,10,11,12]])==({1: 1, 2: 1, 3: 1, 4: 1, 5: 1, 6: 1, 7: 1, 8: 1, 9: 1, 10: 1, 11: 1, 12: 1}), assert freq_element([[15,20,30,40],[80,90,100,110],[30,30,80,90]])==({30: 3, 80: 2, 90: 2, 15: 1, 20: 1, 40: 1, 100: 1, 110: 1})",291,0.051,187,1.5561497326203209,"Prompt: Write a function to find frequency of the elements in a given list of lists using collections module. Assesments: assert freq_element([[1 2, 2], [4 27 1 9 5]])==({2: 3 1: 2, 5 2, 3 1, 4 1, 6 1, 7 1, 9 1}), assert freq_element([[1,2,3,4],[5,6,7,8],[9,10,11,12]])==({1 1 2 1 1 8,} freq_element([[15,20,30,40],[80,90,100,110],[30,30,80,90]])==({30 3 80 2 90 2 15 1 20 1 40 100 110})",0.0,0.042625424368162954
"Prompt: Write a function to filter even numbers using lambda function. Assesments: assert filter_evennumbers([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[2, 4, 6, 8, 10], assert filter_evennumbers([10,20,45,67,84,93])==[10,20,84], assert filter_evennumbers([5,7,9,8,6,4,3])==[8,6,4]",119,0.033,62,1.9193548387096775,"Prompt: Write a function to filter even numbers using lambda function. Assesments: assert filter_evennumbers([1 10])==[2 4 6 10], assert filter_evennumbers([10,20,45,67,84,93])==[10,20,84],]",0.0,0.07967628677038395
"Prompt: Write a python function to find the sum of repeated elements in a given array. Assesments: assert find_Sum([1,2,3,1,1,4,5,6],8) == 3, assert find_Sum([1,2,3,1,1],5) == 3, assert find_Sum([1,1,2],3) == 2",86,0.029,47,1.8297872340425532,"Prompt: Write a python function find the sum repeated elements a given array Assesments: assert find_Sum([1,2,3,1,1,4,5,6],8 == 3, assert 2",0.0,0.07053941908713693
"Prompt: Write a function to find sequences of lowercase letters joined with an underscore using regex. Assesments: assert text_match(""aab_cbbbc"") == 'Found a match!', assert text_match(""aab_Abbbc"") == 'Not matched!', assert text_match(""Aaab_abbbc"") == 'Not matched!'",67,0.039,52,1.2884615384615385,"Prompt: Write a function find sequences lowercase letters joined with an underscore using regex. Assesments: assert text_match(""aab_cbbbc 'Found a match! assert text_match(""aab_AbbbcNot matched text_match(""Aaab_abbbc",0.0,0.015318323553242167
"Prompt: Write a function that matches a word at the beginning of a string. Assesments: assert text_match_string("" python"")==('Not matched!'), assert text_match_string(""python"")==('Found a match!'), assert text_match_string(""  lang"")==('Not matched!')",58,0.032,30,1.9333333333333333,"Prompt: Write a function matches a word at Assesments: assert text_match_string("" python"")==('Not matched!' lang"")==('Not matched!",0.0,0.0811022449196723
"Prompt: Write a function to find the gcd of the given array elements. Assesments: assert get_gcd([2, 4, 6, 8, 16]) == 2, assert get_gcd([1, 2, 3]) == 1, assert get_gcd([2, 4, 6, 8]) == 2",78,0.031,43,1.813953488372093,"Prompt: Write a function to find the gcd of the given array elements. Assesments: assert get_gcd([2 4, 6, 8 16 == 2, assert 1])",0.0,0.06892420519748511
"Prompt: Write a python function to determine whether all the numbers are different from each other are not. Assesments: assert test_distinct([1,5,7,9]) == True, assert test_distinct([2,4,5,5,7,9]) == False, assert test_distinct([1,2,3]) == True",73,0.029,36,2.0277777777777777,"Prompt: Write a python function determine whether all the numbers different from are not. Assesments: assert test_distinct([1,5,7,9 == True,])",0.0,0.09073660318473595
"Prompt: Write a python function to find the last digit when factorial of a divides factorial of b. Assesments: assert compute_Last_Digit(2,4) == 2, assert compute_Last_Digit(6,8) == 6, assert compute_Last_Digit(1,2) == 2",65,0.034,35,1.8571428571428572,"Prompt: Write a python function find the last digit when factorial of a divides factorial b. Assesments: assert compute_Last_Digit(2,4, assert 2",0.0,0.07332998951256213
"Prompt: Write a python function to set all odd bits of a given number. Assesments: assert odd_bit_set_number(10) == 15, assert odd_bit_set_number(20) == 21, assert odd_bit_set_number(30) == 31",55,0.028,31,1.7741935483870968,"Prompt: Write a python function set all odd bits a given number. Assesments: assert odd_bit_set_number(10) 15, 21",0.0,0.06486825983546636
"Prompt: Write a function to extract every first or specified element from a given two-dimensional list. Assesments: assert specified_element([[1, 2, 3, 2], [4, 5, 6, 2], [7, 1, 9, 5]],0)==[1, 4, 7], assert specified_element([[1, 2, 3, 2], [4, 5, 6, 2], [7, 1, 9, 5]],2)==[3, 6, 9], assert specified_element([[1, 2, 3, 2], [4, 5, 6, 2], [7, 1, 9, 5]],1)==[2,5,1]",171,0.038,101,1.693069306930693,"Prompt: Write a function to extract every first or specified element from a given two-dimensional list. Assesments: assert specified_element([[1, 2,, 2], [4 5, 6, 2],7 1 9, 5]],0)==[1, 4, 7], assert specified_element([[1 2 24 5]],2)==[3 6, 9], assert 5]],1)==[2,5,1]",0.0,0.05659270682893376
"Prompt: Write a function to find the list with minimum length using lambda function. Assesments: assert min_length_list([[0], [1, 3], [5, 7], [9, 11], [13, 15, 17]])==(1, [0]), assert min_length_list([[1,2,3,4,5],[1,2,3,4],[1,2,3],[1,2],[1]])==(1,[1]), assert min_length_list([[3,4,5],[6,7,8,9],[10,11,12],[1,2]])==(2,[1,2])",136,0.033,42,3.238095238095238,"Prompt: Write a function find the list with minimum length using lambda function Assesments: assert min_length_list([[0, 35 79 1113, 17]])==(1 []), assert]),",0.0,0.21420211876643414
"Prompt: Write a function to print check if the triangle is equilateral or not. Assesments: assert check_equilateral(6,8,12)==False , assert check_equilateral(6,6,12)==False, assert check_equilateral(6,6,6)==True",59,0.03,25,2.36,"Prompt: Write print check the triangle equilateral Assesments assert check_equilateral(6,8,12)==False ,,",0.0,0.12462687519948928
"Prompt: Write a function to caluclate area of a parallelogram. Assesments: assert parallelogram_area(10,20)==200, assert parallelogram_area(15,20)==300, assert parallelogram_area(8,9)==72",55,0.027,24,2.2916666666666665,"Prompt: Write a function caluclate area Assesments: assert parallelogram_area(10,20)==200",0.0,0.11765613363123735
"Prompt: Write a python function to check whether the first and last characters of a given string are equal or not. Assesments: assert check_Equality(""abcda"") == ""Equal"", assert check_Equality(""ab"") == ""Not Equal"", assert check_Equality(""mad"") == ""Not Equal""",63,0.032,41,1.5365853658536586,"Prompt: Write a python function check whether the first and last characters a given string equal or Assesments: assert check_Equality(""abcda"") ""Equal"","")Not Equal check_Equality(""mad",0.0,0.04062964664118394
"Prompt: Write a function to sort the given array by using counting sort. Assesments: assert counting_sort([1,23,4,5,6,7,8]) == [1, 4, 5, 6, 7, 8, 23], assert counting_sort([12, 9, 28, 33, 69, 45]) == [9, 12, 28, 33, 45, 69], assert counting_sort([8, 4, 14, 3, 2, 1]) == [1, 2, 3, 4, 8, 14]",139,0.039,89,1.5617977528089888,"Prompt: Write a function to sort the given array by using counting sort. Assesments: assert counting_sort([1,23,4,5,6,7,8]) [ 4 5 23], assert counting_sort([12 9 28 33 69 459 12 28 45 69 4 14 3 2 11 2 3 4 8 14]",0.0,0.043201583720955256
"Prompt: Write a function to find t-nth term of geometric series. Assesments: assert tn_gp(1,5,2)==16, assert tn_gp(1,5,4)==256, assert tn_gp(2,6,3)==486",54,0.029,26,2.076923076923077,"Prompt: Write a function find t-nth term geometric series Assesments assert tn_gp(1,5,2)==16",0.0,0.09574995703307226
"Prompt: Write a python function to check if a given number is one less than twice its reverse. Assesments: assert check(70) == False, assert check(23) == False, assert check(73) == True",47,0.029,34,1.3823529411764706,"Prompt: Write a python function check a given number one less than twice its reverse. Assesments: assert check(70 False, assert check(23 check(73",0.0,0.02489626556016597
"Prompt: Write a python function to find the largest number that can be formed with the given digits. Assesments: assert find_Max_Num([1,2,3],3) == 321, assert find_Max_Num([4,5,6,1],4) == 6541, assert find_Max_Num([1,2,3,9],4) == 9321",80,0.033,41,1.951219512195122,"Prompt: Write a python function find the largest number that formed with the given digits Assesments: assert find_Max_Num([1,2,3],3 321, 6541 9321",0.0,0.08292682926829267
"Prompt: Write a python function to check whether the given two integers have opposite sign or not. Assesments: assert opposite_Signs(1,-2) == True, assert opposite_Signs(3,2) == False, assert opposite_Signs(-10,-10) == False",58,0.03,38,1.5263157894736843,"Prompt: Write a python function check whether the given two integers have opposite sign or not Assesments: assert opposite_Signs(1,-2 True, opposite_Signs(-10,-10",0.0,0.03958203840274162
"Prompt: Write a function to find the nth octagonal number. Assesments: assert is_octagonal(5) == 65, assert is_octagonal(10) == 280, assert is_octagonal(15) == 645",49,0.031,29,1.6896551724137931,"Prompt: Write a function find the nth octagonal number. Assesments: assert is_octagonal(5 65, 280 645",0.0,0.05624442805727682
"Prompt: Write a function to find the maximum length of the subsequence with difference between adjacent elements for the given array. Assesments: assert max_len_sub([2, 5, 6, 3, 7, 6, 5, 8], 8) == 5, assert max_len_sub([-2, -1, 5, -1, 4, 0, 3], 7) == 4, assert max_len_sub([9, 11, 13, 15, 18], 5) == 1",120,0.036,75,1.6,"Prompt: Write a function find the maximum length the subsequence with difference between adjacent elements for the given array Assesments: assert max_len_sub([2 5, 6 3 7 6 5 8 8) == 5, 5 4 0 3 7 11 13 15 18 5 1",0.0,0.04709862751356528
"Prompt: Write a python function to count number of substrings with the sum of digits equal to their length. Assesments: assert count_Substrings('112112',6) == 6, assert count_Substrings('111',3) == 6, assert count_Substrings('1101112',7) == 12",67,0.029,36,1.8611111111111112,"Prompt: Write a python function count number substrings with the sum digits equal their length Assesments: assert count_Substrings('112112',6 == 6, 12",0.0,0.07373479448168245
"Prompt: Write a python function to find smallest number in a list. Assesments: assert smallest_num([10, 20, 1, 45, 99]) == 1, assert smallest_num([1, 2, 3]) == 1, assert smallest_num([45, 46, 50, 60]) == 45",74,0.029,44,1.6818181818181819,"Prompt: Write a python function find smallest number in a list. Assesments: assert smallest_num([10 20, 1 45 99 == 1,]) 46 50 60 45",0.0,0.055444969967791545
"Prompt: Write a function to find the maximum difference between available pairs in the given tuple list. Assesments: assert max_difference([(3, 5), (1, 7), (10, 3), (1, 2)]) == 7, assert max_difference([(4, 6), (2, 17), (9, 13), (11, 12)]) == 15, assert max_difference([(12, 35), (21, 27), (13, 23), (41, 22)]) == 23",115,0.035,74,1.554054054054054,"Prompt: Write a function to find the maximum difference available pairs in the given tuple list. Assesments: assert max_difference([(3, 5),1 710 31 2) == 7, assert 62 179 1311 12) 15, max_difference([(12 3521 2713 2341 22 23",0.0,0.04241164241164239
"Prompt: Write a function to sort a list of tuples using lambda. Assesments: assert subject_marks([('English', 88), ('Science', 90), ('Maths', 97), ('Social sciences', 82)])==[('Social sciences', 82), ('English', 88), ('Science', 90), ('Maths', 97)], assert subject_marks([('Telugu',49),('Hindhi',54),('Social',33)])==([('Social',33),('Telugu',49),('Hindhi',54)]), assert subject_marks([('Physics',96),('Chemistry',97),('Biology',45)])==([('Biology',45),('Physics',96),('Chemistry',97)])",159,0.04,134,1.1865671641791045,"Prompt: Write a function to sort a list of tuples using lambda. Assesments: assert subject_marks([('English 88Science 90Maths 97Social sciences', 82)])==[('Social sciences 82),English 88Science)], assert subject_marks([('Telugu',49),('Hindhi',54),('Social',33)])==([('Social',33),('Telugu',49),('Hindhi',54)]), subject_marks([('Physics',96),('Chemistry',97),('Biology',45)])==([('Biology',45),('Physics',96),('Chemistry',97)])",0.0,0.004923991596438485
"Prompt: Write a function of recursion list sum. Assesments: assert recursive_list_sum(([1, 2, [3,4],[5,6]]))==21, assert recursive_list_sum(([7, 10, [15,14],[19,41]]))==106, assert recursive_list_sum(([10, 20, [30,40],[50,60]]))==210",82,0.03,45,1.8222222222222222,"Prompt: Write a function of recursion list sum. Assesments: assert recursive_list_sum(([1 [3,4],[5,6]]))==21, [15,14],[19,41]]))==106",0.0,0.06976770578430329
"Prompt: Write a python function to count positive numbers in a list. Assesments: assert pos_count([1,-2,3,-4]) == 2, assert pos_count([3,4,5,-1]) == 3, assert pos_count([1,2,3,4]) == 4",65,0.031,33,1.9696969696969697,"Prompt: Write a python function to count positive numbers in a list. Assesments: assert pos_count([1,-2,3,-4 == 2,",0.0,0.08481173045488398
"Prompt: Write a function to find the number of ways to partition a set of bell numbers. Assesments: assert bell_number(2)==2, assert bell_number(10)==115975, assert bell_number(56)==6775685320645824322581483068371419745979053216268760300",65,0.03,46,1.4130434782608696,Prompt: Write a function find ways partition a set bell numbers Assesments assert bell_number(2)==2 bell_number(56)==6775685320645824322581483068371419745979053216268760300,0.0,0.028027033403183504
"Prompt: Write a python function to check whether the given array is monotonic or not. Assesments: assert is_Monotonic([6, 5, 4, 4]) == True, assert is_Monotonic([1, 2, 2, 3]) == True, assert is_Monotonic([1, 3, 2]) == False",81,0.03,44,1.8409090909090908,"Prompt: Write a python function check whether the given array monotonic or not Assesments: assert is_Monotonic([6 5 4 4 == True, 2 3 2]) False",0.0,0.07167396918434261
"Prompt: Write a function to check whether a list contains the given sublist or not. Assesments: assert is_sublist([2,4,3,5,7],[3,7])==False, assert is_sublist([2,4,3,5,7],[4,3])==True, assert is_sublist([2,4,3,5,7],[1,6])==False",87,0.027,38,2.289473684210526,"Prompt: Write a function check a list the given sublist Assesments: assert is_sublist([2,4,3,5,7],[3,7])==False,",0.0,0.11743242562198664
"Prompt: Write a function to find whether all the given tuples have equal length or not. Assesments: assert get_equal([(11, 22, 33), (44, 55, 66)], 3) == 'All tuples have same length', assert get_equal([(1, 2, 3), (4, 5, 6, 7)], 3) == 'All tuples do not have same length', assert get_equal([(1, 2), (3, 4)], 2) == 'All tuples have same length'",117,0.035,63,1.8571428571428572,"Prompt: Write a function to find whether all the given tuples have equal length or not Assesments: assert get_equal([(11 22 33), (44 55 66) 3) == 'All tuples have same length', assert get_equal([(14,) do),3) 2 have'",0.0,0.07332998951256213
"Prompt: Write a function to sort a list of elements using comb sort. Assesments: assert comb_sort([5, 15, 37, 25, 79]) == [5, 15, 25, 37, 79], assert comb_sort([41, 32, 15, 19, 22]) == [15, 19, 22, 32, 41], assert comb_sort([99, 15, 13, 47]) == [13, 15, 47, 99]",115,0.035,73,1.5753424657534247,"Prompt: Write a function to sort a list elements using comb sort Assesments: assert comb_sort([5 15 37, 25 79 == [5 25 37 79], assert comb_sort([41 32 15 19 2215 32 41 comb_sort([99 15 13 4713 15]",0.0,0.04458329143146969
"Prompt: Write a python function to check whether the given number can be represented as difference of two squares or not. Assesments: assert dif_Square(5) == True, assert dif_Square(10) == False, assert dif_Square(15) == True",56,0.028,31,1.8064516129032258,"Prompt: Write a python function check whether the given number can represented difference of two squares or not Assesments: assert dif_Square(5 True,",0.0,0.06815893248767027
"Prompt: Write a function to split the given string with multiple delimiters by using regex. Assesments: assert multiple_split('Forces of the \ndarkness*are coming into the play.') == ['Forces of the ', 'darkness', 'are coming into the play.'], assert multiple_split('Mi Box runs on the \n Latest android*which has google assistance and chromecast.') == ['Mi Box runs on the ', ' Latest android', 'which has google assistance and chromecast.'], assert multiple_split('Certain services\nare subjected to change*over the seperate subscriptions.') == ['Certain services', 'are subjected to change', 'over the seperate subscriptions.']",139,0.046,94,1.4787234042553192,"Prompt: Write a function split the given string with multiple delimiters by using regex. Assesments: assert multiple_split('Forces of the \ndarkness*are coming into the play.' == [' the ', 'darknessare coming assert multiple_split('Mi Box runs on the \n Latest android*which has google assistance and chromecast the ', ' Latest android',which multiple_split('Certain services\nare subjected change*over the seperate subscriptionsareover]",0.0,0.03472709862751357
"Prompt: Write a function to check whether it follows the sequence given in the patterns array. Assesments: assert is_samepatterns([""red"",""green"",""green""], [""a"", ""b"", ""b""])==True , assert is_samepatterns([""red"",""green"",""greenn""], [""a"",""b"",""b""])==False , assert is_samepatterns([""red"",""green"",""greenn""], [""a"",""b""])==False",86,0.035,40,2.15,"Prompt: Write a function to check whether it follows the sequence given in the patterns array Assesments: assert is_samepatterns([""red"",""green"",""green""], [""a"",b""])==True ,",0.0,0.10320459623364187
"Prompt: Write a function to find tuples which have all elements divisible by k from the given list of tuples. Assesments: assert find_tuples([(6, 24, 12), (7, 9, 6), (12, 18, 21)], 6) == '[(6, 24, 12)]', assert find_tuples([(5, 25, 30), (4, 2, 3), (7, 8, 9)], 5) == '[(5, 25, 30)]', assert find_tuples([(7, 9, 16), (8, 16, 4), (19, 17, 18)], 4) == '[(8, 16, 4)]'",164,0.04,93,1.7634408602150538,"Prompt: Write a function to find tuples which have all elements divisible k from the given list of tuples. Assesments: assert find_tuples([(6 24, 12), (7 9 612 18 21)], 6) == '[(6)]', assert find_tuples([(5 25 304 2 37 8 9) 5 9 168 16 419 17 18 48'",0.0,0.0637713689513984
"Prompt: Write a python function to count the number of squares in a rectangle. Assesments: assert count_Squares(4,3) == 20, assert count_Squares(2,2) == 5, assert count_Squares(1,1) == 1",58,0.028,31,1.8709677419354838,"Prompt: Write a python function count squares in a rectangle Assesments: assert count_Squares(4,3 20, assert 5 1",0.0,0.07474027779207808
"Prompt: Write a python function to find the difference between sum of even and odd digits. Assesments: assert is_Diff (12345) == False, assert is_Diff(1212112) == True, assert is_Diff(1212) == False",55,0.029,35,1.5714285714285714,"Prompt: Write a python function find the difference sum of even and odd digits Assesments assert is_Diff (12345 False, is_Diff(1212112)",0.0,0.04418403173589895
"Prompt: Write a python function to find number of integers with odd number of set bits. Assesments: assert count_With_Odd_SetBits(5) == 3, assert count_With_Odd_SetBits(10) == 5, assert count_With_Odd_SetBits(15) == 8",63,0.029,34,1.8529411764705883,"Prompt: Write a python function find number integers with odd number set bits Assesments: assert count_With_Odd_SetBits(5 3, 5 8",0.0,0.07290137248643473
"Prompt: Write a python function to check whether the length of the word is odd or not. Assesments: assert word_len(""Hadoop"") == False, assert word_len(""great"") == True, assert word_len(""structure"") == True",50,0.028,36,1.3888888888888888,"Prompt: Write a python function to check whether the length the word odd or not Assesments: assert word_len(""Hadoop False, word_len(""great word_len(""structure",0.0,0.025563003156364145
"Prompt: Write a function to find the nth tetrahedral number. Assesments: assert tetrahedral_number(5) == 35.0, assert tetrahedral_number(6) == 56.0, assert tetrahedral_number(7) == 84.0",55,0.027,32,1.71875,"Prompt: Write a function find the nth tetrahedral number. Assesments: assert tetrahedral_number(5 35.0, assert 56.0",0.0,0.0592124162144909
"Prompt: Write a function to zip the two given tuples. Assesments: assert zip_tuples((7, 8, 4, 5, 9, 10),(1, 5, 6) ) == [(7, 1), (8, 5), (4, 6), (5, 1), (9, 5), (10, 6)], assert zip_tuples((8, 9, 5, 6, 10, 11),(2, 6, 7) ) == [(8, 2), (9, 6), (5, 7), (6, 2), (10, 6), (11, 7)], assert zip_tuples((9, 10, 6, 7, 11, 12),(3, 7, 8) ) == [(9, 3), (10, 7), (6, 8), (7, 3), (11, 7), (12, 8)]",220,0.049,128,1.71875,"Prompt: Write a function to zip the two given tuples. Assesments: assert zip_tuples((7 8, 4, 5, 9, 10),(1 5 6) ) == [(7 1), (8 54 65 19 510 6)], assert zip_tuples((8 9 5, 6, 10, 11),(2 6, 78 29 65 76 210 611 7) 10 6 7 11, 7 3 76 8)7 311 712 8)]",0.0,0.0592124162144909
"Prompt: Write a function to find the volume of a sphere. Assesments: assert volume_sphere(10)==4188.790204786391, assert volume_sphere(25)==65449.84694978735, assert volume_sphere(20)==33510.32163829113",61,0.03,27,2.259259259259259,Prompt: Write a function find the volume a sphere Assesments assert volume_sphere(10)==4188.790204786391,0.0,0.11435022638342138
"Prompt: Write a python function to find the character made by adding all the characters of the given string. Assesments: assert get_Char(""abc"") == ""f"", assert get_Char(""gfg"") == ""t"", assert get_Char(""ab"") == ""c""",59,0.029,40,1.475,"Prompt: Write a python function find the character made adding all the characters of the given string. Assesments: assert get_Char(""abcf"", get_Char(""gfg ""tc""",0.0,0.034347270986275144
"Prompt: Write a function to find the n-th number in newman conway sequence. Assesments: assert sequence(10) == 6, assert sequence(2) == 1, assert sequence(3) == 2",48,0.027,30,1.6,"Prompt: Write a function to find the n-th number newman conway sequence Assesments: assert sequence(10) 6, 1",0.0,0.04709862751356528
"Prompt: Write a function to find the surface area of a sphere. Assesments: assert surfacearea_sphere(10)==1256.6370614359173, assert surfacearea_sphere(15)==2827.4333882308138, assert surfacearea_sphere(20)==5026.548245743669",67,0.027,29,2.310344827586207,Prompt: Write a function find the surface area Assesments: assert surfacearea_sphere(10)==1256.6370614359173,0.0,0.11956150874451059
"Prompt: Write a function to find nth centered hexagonal number. Assesments: assert centered_hexagonal_number(10) == 271, assert centered_hexagonal_number(2) == 7, assert centered_hexagonal_number(9) == 217",52,0.028,30,1.7333333333333334,"Prompt: Write a function find nth centered hexagonal number Assesments: assert centered_hexagonal_number(10 == 271, 7 217",0.0,0.06070007447600809
"Prompt: Write a function to merge three dictionaries into a single expression. Assesments: assert merge_dictionaries_three({ ""R"": ""Red"", ""B"": ""Black"", ""P"": ""Pink"" }, { ""G"": ""Green"", ""W"": ""White"" },{ ""O"": ""Orange"", ""W"": ""White"", ""B"": ""Black"" })=={'B': 'Black', 'R': 'Red', 'P': 'Pink', 'G': 'Green', 'W': 'White', 'O': 'Orange'}, assert merge_dictionaries_three({ ""R"": ""Red"", ""B"": ""Black"", ""P"": ""Pink"" }, { ""G"": ""Green"", ""W"": ""White"" },{""L"":""lavender"",""B"":""Blue""})=={'W': 'White', 'P': 'Pink', 'B': 'Black', 'R': 'Red', 'G': 'Green', 'L': 'lavender'}, assert merge_dictionaries_three({ ""R"": ""Red"", ""B"": ""Black"", ""P"": ""Pink"" },{""L"":""lavender"",""B"":""Blue""},{ ""G"": ""Green"", ""W"": ""White"" })=={'B': 'Black', 'P': 'Pink', 'R': 'Red', 'G': 'Green', 'L': 'lavender', 'W': 'White'}",288,0.075,158,1.8227848101265822,"Prompt: Write a function to merge three dictionaries into a single expression. Assesments: assert merge_dictionaries_three({ ""R"": ""Red"", ""B ""Black ""PPink"" }, { ""G ""GreenW ""White"" },{OOrangeWWhite"", ""BBlack"" })=={'B': 'Black',RRedPPink',G 'Green',W 'White',OOrange'}, assert merge_dictionaries_three({ ""R ""Red""""{""L"":""lavender"",""B"":""Blue""})=={'W 'WhiteP':PinkB': 'Black',R':RedG': 'GreenL': 'lavender'}, assertRed""{""""},{ ""G ""Green"" })BBlackP':R': 'G':L':',W': 'White'}",0.0,0.06982509585587478
"Prompt: Write a function to get the frequency of the elements in a list. Assesments: assert freq_count([10,10,10,10,20,20,20,20,40,40,50,50,30])==({10: 4, 20: 4, 40: 2, 50: 2, 30: 1}) , assert freq_count([1,2,3,4,3,2,4,1,3,1,4])==({1:3, 2:2,3:3,4:3}) , assert freq_count([5,6,7,4,9,10,4,5,6,7,9,5])==({10:1,5:3,6:2,7:2,4:2,9:2})",182,0.036,68,2.676470588235294,"Prompt: Write a function to get the frequency the elements in a list Assesments: assert freq_count([10,10,10,10,20,20,20,20,40,40,50,50,30])==({10: 4 20 4 40 2 30 1 , assert",0.0,0.156910309607405
"Prompt: Write a function to find the closest smaller number than n. Assesments: assert closest_num(11) == 10, assert closest_num(7) == 6, assert closest_num(12) == 11",47,0.032,29,1.6206896551724137,"Prompt: Write a function find the closest smaller number than n. Assesments: assert closest_num(11 10, 6 11",0.0,0.04920919686980638
"Prompt: Write a python function to find the length of the longest word. Assesments: assert len_log([""python"",""PHP"",""bigdata""]) == 7, assert len_log([""a"",""ab"",""abc""]) == 3, assert len_log([""small"",""big"",""tall""]) == 5",62,0.033,52,1.1923076923076923,"Prompt: Write a python function find the length the longest word. Assesments: assert len_log([""python"",""PHP"",""bigdata) 7, len_log([""a"",""ab"",""abc 3 len_log([""small"",""big"",""tall 5",0.0,0.005509587763018974
"Prompt: Write a function to check if a substring is present in a given list of string values. Assesments: assert find_substring([""red"", ""black"", ""white"", ""green"", ""orange""],""ack"")==True, assert find_substring([""red"", ""black"", ""white"", ""green"", ""orange""],""abc"")==False, assert find_substring([""red"", ""black"", ""white"", ""green"", ""orange""],""ange"")==True",95,0.034,63,1.507936507936508,"Prompt: Write a function to check if a substring is present in a given list of string values. Assesments: assert find_substring([""red"",black"",white"",green"",orange""],""ack"")==True, assert find_substring([""redorange""],""abc"")==False,orange""],""ange"")==True",0.0,0.0377071522299738
"Prompt: Write a function to check whether the given number is undulating or not. Assesments: assert is_undulating(""1212121"") == True, assert is_undulating(""1991"") == False, assert is_undulating(""121"") == True",56,0.035,37,1.5135135135135136,"Prompt: Write a function check whether the given number undulating or Assesments: assert is_undulating(""1212121 == True, is_undulating(""1991 False",0.0,0.03827606732171048
"Prompt: Write a function to calculate the value of 'a' to the power 'b'. Assesments: assert power(3,4) == 81, assert power(2,3) == 8, assert power(5,5) == 3125",56,0.032,33,1.696969696969697,"Prompt: Write a function calculate the value 'a to the power 'b Assesments: assert power(3,4 81, 8 3125",0.0,0.05699058894079641
"Prompt: Write a function to extract the index minimum value record from the given tuples. Assesments: assert index_minimum([('Rash', 143), ('Manjeet', 200), ('Varsha', 100)]) == 'Varsha', assert index_minimum([('Yash', 185), ('Dawood', 125), ('Sanya', 175)]) == 'Dawood', assert index_minimum([('Sai', 345), ('Salman', 145), ('Ayesha', 96)]) == 'Ayesha'",116,0.04,87,1.3333333333333333,"Prompt: Write a function to extract the index minimum value record from the given tuples. Assesments: assert index_minimum([('Rash', 143), ('Manjeet 200Varsha 100) == 'Varsha', assert index_minimum([('Yash', 185'Dawood 125Sanya 175) index_minimum([('Sai 345Salman 145Ayesha 96)'",0.0,0.019895733588679635
"Prompt: Write a python function to find the minimum length of sublist. Assesments: assert Find_Min_Length([[1],[1,2]]) == 1, assert Find_Min_Length([[1,2],[1,2,3],[1,2,3,4]]) == 2, assert Find_Min_Length([[3,3,3],[4,4,4,4]]) == 3",83,0.032,35,2.3714285714285714,"Prompt: Write a python function find the minimum length sublist. Assesments: assert Find_Min_Length([[1],[1,2) == 1, assert 2",0.0,0.12579271351055582
"Prompt: Write a python function to find the number of divisors of a given integer. Assesments: assert divisor(15) == 4 , assert divisor(12) == 6, assert divisor(9) == 3",48,0.036,29,1.6551724137931034,"Prompt: Write a python function find the number divisors of a given integer Assesments: assert divisor(15 4 , 6,",0.0,0.052726812463541606
"Prompt: Write a function to find frequency count of list of lists. Assesments: assert frequency_lists([[1, 2, 3, 2], [4, 5, 6, 2], [7, 8, 9, 5]])=={1: 1, 2: 3, 3: 1, 4: 1, 5: 2, 6: 1, 7: 1, 8: 1, 9: 1}, assert frequency_lists([[1,2,3,4],[5,6,7,8],[9,10,11,12]])=={1: 1, 2: 1, 3: 1, 4: 1, 5: 1, 6: 1, 7: 1, 8: 1, 9: 1,10:1,11:1,12:1}, assert frequency_lists([[20,30,40,17],[18,16,14,13],[10,20,30,40]])=={20:2,30:2,40:2,17: 1,18:1, 16: 1,14: 1,13: 1, 10: 1}",280,0.046,190,1.4736842105263157,"Prompt: Write a function to find frequency count of list of lists. Assesments: assert frequency_lists([[1, 2,, 2], [4 5, 27, 5]])=={1: 1, 2: 3, 3 1 4 1 2, 1 1 1 1}, assert frequency_lists([[1,2,3,4],[5,6,7,8],[9,10,11,12]])=={1 1 1 1 1 1,10:1,11:1,12:1}, assert frequency_lists([[20,30,40,17],[18,16,14,13],[10,20,30,40]])=={20:2,30:2,40:2,17 1,18:1 16 1,14 1,13 10}",0.0,0.0342130461807247
"Prompt: Write a function to multiply all the numbers in a list and divide with the length of the list. Assesments: assert multiply_num((8, 2, 3, -1, 7))==-67.2, assert multiply_num((-10,-20,-30))==-2000.0, assert multiply_num((19,15,18))==1710.0",80,0.032,33,2.4242424242424243,"Prompt: Write a function multiply all the numbers and divide with the length Assesments: assert multiply_num((8 2 7))==-67.2,",0.0,0.13118029964502995
"Prompt: Write a function to convert the given decimal number to its binary equivalent. Assesments: assert decimal_to_binary(8) == '1000', assert decimal_to_binary(18) == '10010', assert decimal_to_binary(7) == '111'",55,0.029,33,1.6666666666666667,Prompt: Write a function to convert the given decimal number its binary equivalent Assesments: assert decimal_to_binary(8) '1000 assert10010111',0.0,0.05389935099478668
"Prompt: Write a function to find the next smallest palindrome of a specified number. Assesments: assert next_smallest_palindrome(99)==101, assert next_smallest_palindrome(1221)==1331, assert next_smallest_palindrome(120)==121",54,0.029,26,2.076923076923077,Prompt: Write a function find the next smallest palindrome a specified number Assesments assert next_smallest_palindrome(99)==101,0.0,0.09574995703307226
"Prompt: Write a function to find the kth element in the given array. Assesments: assert kth_element([12,3,5,7,19], 5, 2) == 3, assert kth_element([17,24,8,23], 4, 3) == 8, assert kth_element([16,21,25,36,4], 5, 4) == 36",88,0.03,57,1.543859649122807,"Prompt: Write a function find the kth element the given array Assesments: assert kth_element([12,3,5,7,19 5 2) == 3, assert kth_element([17,24,8,23 4 3 8 36",0.0,0.041371702476747235
"Prompt: Write a function to convert snake case string to camel case string. Assesments: assert snake_to_camel('python_program')=='PythonProgram', assert snake_to_camel('python_language')==('PythonLanguage'), assert snake_to_camel('programming_language')==('ProgrammingLanguage')",61,0.029,30,2.033333333333333,Prompt: Write a function to convert snake case string camel case string Assesments: assert snake_to_camel('python_program')=='PythonProgram assert,0.0,0.0913033301415044
"Prompt: Write a function to find eulerian number a(n, m). Assesments: assert eulerian_num(3, 1) == 4, assert eulerian_num(4, 1) == 11, assert eulerian_num(5, 3) == 26",64,0.03,38,1.6842105263157894,"Prompt: Write a function to find eulerian number a(n, m). Assesments: assert eulerian_num(3 1 4, 11 3 26",0.0,0.0556890150687923
"Prompt: Write a function to sort each sublist of strings in a given list of lists using lambda function. Assesments: assert sort_sublists(([""green"", ""orange""], [""black"", ""white""], [""white"", ""black"", ""orange""]))==[['green', 'orange'], ['black', 'white'], ['black', 'orange', 'white']], assert sort_sublists((["" red "",""green"" ],[""blue "","" black""],["" orange"",""brown""]))==[[' red ', 'green'], [' black', 'blue '], [' orange', 'brown']], assert sort_sublists(([""zilver"",""gold""], [""magnesium"",""aluminium""], [""steel"", ""bronze""]))==[['gold', 'zilver'],['aluminium', 'magnesium'], ['bronze', 'steel']]",166,0.047,118,1.4067796610169492,"Prompt: Write a function to sort each sublist of strings in a given list of lists using lambda function. Assesments: assert sort_sublists(([""greenorange""], [""blackwhitewhiteblack"",orange""]))==[['green'black'blackorange',white], assert red "",""green"" ],[""blue "" black""], orange"",""brown""]))== redgreen black',blue ' orange',brown'] sort_sublists(([""zilver"",""gold [""magnesium"",""aluminium""steel"", ""bronze""]))==[['goldzilver'],['aluminiumbronzesteel]]",0.0,0.027388056067991363
"Prompt: Write a python function to count true booleans in the given list. Assesments: assert count([True,False,True]) == 2, assert count([False,False]) == 0, assert count([True,True,True]) == 3",57,0.034,36,1.5833333333333333,"Prompt: Write a python function count true booleans in the given list Assesments: assert count([TrueFalseTrue == 2, 0True,True 3",0.0,0.04539844664325991
"Prompt: Write a function to add the given list to the given tuples. Assesments: assert add_lists([5, 6, 7], (9, 10)) == (9, 10, 5, 6, 7), assert add_lists([6, 7, 8], (10, 11)) == (10, 11, 6, 7, 8), assert add_lists([7, 8, 9], (11, 12)) == (11, 12, 7, 8, 9)",121,0.034,65,1.8615384615384616,"Prompt: Write a function to add the given list to the given tuples. Assesments: assert add_lists([5 6,], (9 10)) == (9 10, 5, 6, 7), assert add_lists([610 11 6, 811 7 8)",0.0,0.07377838886297233
"Prompt: Write a python function to count hexadecimal numbers for a given range. Assesments: assert count_Hexadecimal(10,15) == 6, assert count_Hexadecimal(2,4) == 0, assert count_Hexadecimal(15,16) == 1",60,0.028,34,1.7647058823529411,"Prompt: Write a python function to count hexadecimal numbers for a given range Assesments: assert count_Hexadecimal(10,15 6, 0 1",0.0,0.06390041493775933
"Prompt: Write a function to merge multiple sorted inputs into a single sorted iterator using heap queue algorithm. Assesments: assert merge_sorted_list([25, 24, 15, 4, 5, 29, 110],[19, 20, 11, 56, 25, 233, 154],[24, 26, 54, 48])==[4, 5, 11, 15, 19, 20, 24, 24, 25, 25, 26, 29, 48, 54, 56, 110, 154, 233], assert merge_sorted_list([1, 3, 5, 6, 8, 9], [2, 5, 7, 11], [1, 4, 7, 8, 12])==[1, 1, 2, 3, 4, 5, 5, 6, 7, 7, 8, 8, 9, 11, 12], assert merge_sorted_list([18, 14, 10, 9, 8, 7, 9, 3, 2, 4, 1],[25, 35, 22, 85, 14, 65, 75, 25, 58],[12, 74, 9, 50, 61, 41])==[1, 2, 3, 4, 7, 8, 9, 9, 9, 10, 12, 14, 14, 18, 22, 25, 25, 35, 41, 50, 58, 61, 65, 74, 75, 85]",389,0.054,250,1.556,"Prompt: Write a function to merge multiple sorted inputs a single sorted iterator using heap queue algorithm Assesments: assert merge_sorted_list([25 24 15 4 5 29 110],[19 20 11 56 25 233, 154],[24 26 54 48])==[4 5 11 15 19 20 24 24 25 25 26 29 48, 54 56 110, 154 233], assert 3 5 6 8],2 5 7 11],1 4 7 8 12])==[1 1 5 6 7 8 8 11 12 14 10 9 8 7 9 3 2 4 1],[25 35 22 85 14 65 75 25 58],[12 74 9 50 61 41])==[1 2 7 8 9 9 10 12 14 14 18 22 25 25 35 41 50 58 61 65 74 75 85]",0.0,0.04261015001595914
"Prompt: Write a python function to find the count of rotations of a binary string with odd value. Assesments: assert odd_Equivalent(""011001"",6) == 3, assert odd_Equivalent(""11011"",5) == 4, assert odd_Equivalent(""1010"",4) == 2",65,0.03,35,1.8571428571428572,"Prompt: Write a python function find the count rotations of a binary string with odd value Assesments: assert odd_Equivalent(""011001"",6 3, 2",0.0,0.07332998951256213
"Prompt: Write a function to extract the ranges that are missing from the given list with the given start range and end range values. Assesments: assert extract_missing([(6, 9), (15, 34), (48, 70)], 2, 100) == [(2, 6), (9, 100), (9, 15), (34, 100), (34, 48), (70, 100)], assert extract_missing([(7, 2), (15, 19), (38, 50)], 5, 60) == [(5, 7), (2, 60), (2, 15), (19, 60), (19, 38), (50, 60)], assert extract_missing([(7, 2), (15, 19), (38, 50)], 1, 52) == [(1, 7), (2, 52), (2, 15), (19, 52), (19, 38), (50, 52)]",222,0.047,138,1.608695652173913,"Prompt: Write a function to extract the ranges that are missing from the given list with the given start range and end range values. Assesments: assert extract_missing([(6, 9), (15 3448 70)], 2, 100) == [(2 6),9 100),9 15),34 100),34 4870 100) assert extract_missing([(7 215 1938 50) 5 605 72 602 1519 6019 3850 60) extract_missing([(7 215 19 1 521 72 522 1519 5219 38 52)]",0.0,0.04798567840242024
"Prompt: Write a function to find common elements in given nested lists. * list item * list item * list item * list item Assesments: assert common_in_nested_lists([[12, 18, 23, 25, 45], [7, 12, 18, 24, 28], [1, 5, 8, 12, 15, 16, 18]])==[18, 12], assert common_in_nested_lists([[12, 5, 23, 25, 45], [7, 11, 5, 23, 28], [1, 5, 8, 18, 23, 16]])==[5,23], assert common_in_nested_lists([[2, 3,4, 1], [4, 5], [6,4, 8],[4, 5], [6, 8,4]])==[4]",199,0.043,152,1.3092105263157894,"Prompt: Write a function to find common elements in given nested lists. * list item * list item * list item * list item Assesments: assert common_in_nested_lists([[12 18 23 25 45], [7, 12, 18, 24, 28], [1, 5, 8, 12, 15, 16, 18]])==[18, 12], assert common_in_nested_lists([[12 5 23 25 11 5 23 28 5 18 23, 16]])==[5,23 3,4 14 5],6,4 8],[4 56 8,4]])==[4]",0.0,0.01743494548692189
"Prompt: Write a python function to find the perimeter of a cylinder. Assesments: assert perimeter(2,4) == 12, assert perimeter(1,2) == 6, assert perimeter(3,1) == 8",50,0.031,29,1.7241379310344827,"Prompt: Write a python function find the perimeter a cylinder Assesments: assert perimeter(2,4 == 12, 6 8",0.0,0.059762043651012016
"Prompt: Write a function to check if a string represents an integer or not. Assesments: assert check_integer(""python"")==False, assert check_integer(""1"")==True, assert check_integer(""12345"")==True",44,0.028,21,2.0952380952380953,"Prompt: Write a function check a string represents Assesments: assert check_integer(""python"")==False,",0.0,0.09761828765978144
"Prompt: Write a function to assign frequency to each tuple in the given tuple list. Assesments: assert assign_freq([(6, 5, 8), (2, 7), (6, 5, 8), (6, 5, 8), (9, ), (2, 7)] ) == '[(6, 5, 8, 3), (2, 7, 2), (9, 1)]', assert assign_freq([(4, 2, 4), (7, 1), (4, 8), (4, 2, 4), (9, 2), (7, 1)] ) == '[(4, 2, 4, 2), (7, 1, 2), (4, 8, 1), (9, 2, 1)]', assert assign_freq([(11, 13, 10), (17, 21), (4, 2, 3), (17, 21), (9, 2), (4, 2, 3)] ) == '[(11, 13, 10, 1), (17, 21, 2), (4, 2, 3, 2), (9, 2, 1)]'",280,0.052,151,1.8543046357615893,"Prompt: Write a function to assign frequency to each tuple in the given tuple list. Assesments: assert assign_freq([(6, 5, 8), (2 7),6 5,69 ), (2 7)] ) == '[(6, 3),2, 2),9 1)]', assert assign_freq([(4 2 47 14 8)4 2, 49 2),7 1 )4, 27, 24 8, 19 2, 1 assign_freq([(11 13 1017 214 2, 317 21),9 24 2)] ), 1, 24, 2),9 2'",0.0,0.07304046013067474
"Prompt: Write a function to check whether all dictionaries in a list are empty or not. Assesments: assert empty_dit([{},{},{}])==True, assert empty_dit([{1,2},{},{}])==False, assert empty_dit({})==True",57,0.028,26,2.1923076923076925,"Prompt: Write a function check all dictionaries in empty Assesments: assert empty_dit([{},{},{}])==True,",0.0,0.10752043998134009
"Prompt: Write a function to convert a given tuple of positive integers into an integer. Assesments: assert tuple_to_int((1,2,3))==123, assert tuple_to_int((4,5,6))==456, assert tuple_to_int((5,6,7))==567",62,0.027,28,2.2142857142857144,"Prompt: Write a function convert a given tuple positive integers Assesments assert tuple_to_int((1,2,3))==123,",0.0,0.1097624367333911
"Prompt: Write a function to convert all possible convertible elements in the list to float. Assesments: assert list_to_float( [(""3"", ""4""), (""1"", ""26.45""), (""7.32"", ""8""), (""4"", ""8"")] ) == '[(3.0, 4.0), (1.0, 26.45), (7.32, 8.0), (4.0, 8.0)]', assert list_to_float( [(""4"", ""4""), (""2"", ""27""), (""4.12"", ""9""), (""7"", ""11"")] ) == '[(4.0, 4.0), (2.0, 27.0), (4.12, 9.0), (7.0, 11.0)]', assert list_to_float( [(""6"", ""78""), (""5"", ""26.45""), (""1.33"", ""4""), (""82"", ""13"")] ) == '[(6.0, 78.0), (5.0, 26.45), (1.33, 4.0), (82.0, 13.0)]'",253,0.052,148,1.7094594594594594,"Prompt: Write a function to convert all possible convertible elements in the list to float. Assesments: assert list_to_float( [(""3"", ""4""), (""126.45""),7.328""),4"",8"")] ) == '[(3.0, 4.0), (1.0 26.457.32 8.0 (4.0 8.0)]', assert list_to_float44227""),4.1297"",11"")4.0 4.02.0 27.04.12 9.07.0678""),526.451.334""),82"",13"")6.0 78.05.01.33 4.082.0'",0.0,0.05826468025638149
"Prompt: [link text](https:// [link text](https:// [link text](https://)))write a function to convert a string to a list. Assesments: assert string_to_list(""python programming"")==['python','programming'], assert string_to_list(""lists tuples strings"")==['lists','tuples','strings'], assert string_to_list(""write a program"")==['write','a','program']",83,0.033,54,1.537037037037037,"Prompt: [link text](https:// [ text](https://)))write a function convert a list. Assesments: assert string_to_list(""python programming"")==['python','programming' string_to_list(""lists tuples strings"")==['lists','tuples','strings",0.0,0.040675722003522825
"Prompt: Write a python function to find the element that appears only once in a sorted array. Assesments: assert search([1,1,2,2,3],5) == 3, assert search([1,1,3,3,4,4,5,5,7,7,8],11) == 8, assert search([1,2,2,3,3,4,4],7) == 1",95,0.032,40,2.375,"Prompt: Write a python function find the element that appears only a sorted array Assesments: assert search([1,1,2,2,3],5 3, 8 1",0.0,0.12615703798276412
"Prompt: Write a function to find the maximum product from the pairs of tuples within a given list. Assesments: assert max_product_tuple([(2, 7), (2, 6), (1, 8), (4, 9)] )==36, assert max_product_tuple([(10,20), (15,2), (5,10)] )==200, assert max_product_tuple([(11,44), (10,15), (20,5), (12, 9)] )==484",107,0.035,69,1.5507246376811594,"Prompt: Write a function to find the maximum product from the pairs of tuples within a given list Assesments: assert max_product_tuple([(2 72 61 8)4 9)] )==36, assert max_product_tuple([(10,2015,25,1020010,1520,5),12 9484",0.0,0.0420720058100538
"Prompt: Write a function to find the triplet with sum of the given array Assesments: assert check_triplet([2, 7, 4, 0, 9, 5, 1, 3], 8, 6, 0) == True, assert check_triplet([1, 4, 5, 6, 7, 8, 5, 9], 8, 6, 0) == False, assert check_triplet([10, 4, 2, 3, 5], 5, 15, 0) == True",130,0.023,74,1.7567567567567568,"Prompt: Write a function to find the triplet with sum of the given array Assesments assert check_triplet([2 7 4 0 9 5 1 3], 8 6 0) == True, assert 4 5 5 9 8 4 2 5], 5 15 0",0.0,0.0630895178613021
"Prompt: Write a function to find n’th smart number. Assesments: assert smartNumber(1) == 30, assert smartNumber(50) == 273, assert smartNumber(1000) == 2664",48,0.028,29,1.6551724137931034,"Prompt: Write a function find n��th smart number. Assesments: assert smartNumber(1 30, 273 2664",0.0,0.052726812463541606
"Prompt: Write a function to sum all amicable numbers from 1 to a specified number. Assesments: assert amicable_numbers_sum(999)==504, assert amicable_numbers_sum(9999)==31626, assert amicable_numbers_sum(99)==0",54,0.027,24,2.25,Prompt: Write a function sum all amicable numbers from Assesments: assert amicable_numbers_sum(999)==504,0.0,0.11340568145547399
"Prompt: Write a function to get the angle of a complex number. Assesments: assert angle_complex(0,1j)==1.5707963267948966 , assert angle_complex(2,1j)==0.4636476090008061, assert angle_complex(0,2j)==1.5707963267948966",71,0.028,29,2.4482758620689653,"Prompt: Write the angle a complex number Assesments assert angle_complex(0,1j)==1.5707963267948966 ,,",0.0,0.1336319711194514
"Prompt: Write a function to find the maximum difference between the number of 0s and number of 1s in any sub-string of the given binary string. Assesments: assert find_length(""11000010001"", 11) == 6, assert find_length(""10111"", 5) == 1, assert find_length(""11011101100101"", 14) == 2",83,0.033,55,1.509090909090909,"Prompt: Write a function find the maximum difference the number 0s number in any substring of the given binary string Assesments: assert find_length(""11000010001 11) 6, 5 1 find_length(""11011101100101 14",0.0,0.03782491367553607
"Prompt: Write a python function to find the sum of common divisors of two given numbers. Assesments: assert sum(10,15) == 6, assert sum(100,150) == 93, assert sum(4,6) == 3",55,0.029,38,1.4473684210526316,"Prompt: Write a python function find the sum common divisors of two given numbers Assesments: assert sum(10,15 6, 93 sum(4,6 3",0.0,0.03152855006971626
"Prompt: Write a function to multiply two integers without using the * operator in python. Assesments: assert multiply_int(10,20)==200, assert multiply_int(5,10)==50, assert multiply_int(4,8)==32",50,0.027,24,2.0833333333333335,"Prompt: Write a function multiply without the * operator in python Assesments assert multiply_int(10,20)==200",0.0,0.09640387275242047
"Prompt: Write a function to shortlist words that are longer than n from a given list of words. Assesments: assert long_words(3,""python is a programming language"")==['python','programming','language'], assert long_words(2,""writing a program"")==['writing','program'], assert long_words(5,""sorting list"")==['sorting']",71,0.03,39,1.8205128205128205,"Prompt: Write a function shortlist words that are longer n from a given list Assesments: assert long_words(3,""python is a programming language"")==['python','programming','language''",0.0,0.06959332825914376
"Prompt: Write a function to calculate magic square. Assesments: assert magic_square_test([[7, 12, 1, 14], [2, 13, 8, 11], [16, 3, 10, 5], [9, 6, 15, 4]])==True, assert magic_square_test([[2, 7, 6], [9, 5, 1], [4, 3, 8]])==True, assert magic_square_test([[2, 7, 6], [9, 5, 1], [4, 3, 7]])==False",136,0.04,80,1.7,"Prompt: Write a function to calculate magic square. Assesments: assert magic_square_test([[7, 12, 1 14],2 13 8 1116 3 10 59 6 15 4]])==True, assert 7 6],9 5 14 3 8]])==True 7 69 7]])==False",0.0,0.05729971273539737
"Prompt: Write a function to find the item with maximum frequency in a given list. Assesments: assert max_occurrences([2,3,8,4,7,9,8,2,6,5,1,6,1,2,3,2,4,6,9,1,2])==(2, 5), assert max_occurrences([2,3,8,4,7,9,8,7,9,15,14,10,12,13,16,16,18])==(8, 2), assert max_occurrences([10,20,20,30,40,90,80,50,30,20,50,10])==(20, 3)",154,0.032,25,6.16,Prompt: Write a function find the item with maximum frequency in a given list Assesments: 5 2 3,0.0,0.5122681136291095
"Prompt: Write a python function to reverse only the vowels of a given string. Assesments: assert reverse_vowels(""Python"") == ""Python"", assert reverse_vowels(""USA"") == ""ASU"", assert reverse_vowels(""ab"") == ""ab""",54,0.03,37,1.4594594594594594,"Prompt: Write a python function reverse only the vowels of a given string Assesments: assert reverse_vowels(""Python ""Python assert reverse_vowels(""USA ""ASU"")ab",0.0,0.03276196720180122
"Prompt: Write a function to convert tuple to a string. Assesments: assert tup_string(('e', 'x', 'e', 'r', 'c', 'i', 's', 'e', 's'))==(""exercises""), assert tup_string(('p','y','t','h','o','n'))==(""python""), assert tup_string(('p','r','o','g','r','a','m'))==(""program"")",93,0.031,70,1.3285714285714285,"Prompt: Write a function to convert tuple to a string. Assesments: assert tup_string(('exerci 'ses'))==(""exercises""), tup_string(('p','y','t','h','o','n'))==(""python""), tup_string(('p','r','o','g','r','a','m'))==(""program",0.0,0.019409967625735252
"Prompt: Write a function to calculate the sum of the negative numbers of a given list of numbers using lambda function. Assesments: assert sum_negativenum([2, 4, -6, -9, 11, -12, 14, -5, 17])==-32, assert sum_negativenum([10,15,-14,13,-18,12,-20])==-52, assert sum_negativenum([19, -65, 57, 39, 152,-639, 121, 44, 90, -190])==-894",121,0.033,64,1.890625,"Prompt: Write a function calculate the sum the negative numbers a given list numbers using lambda function Assesments: assert sum_negativenum([2 4 -6 11 -5 17])==-32, -65 57 39 152,-639 121 44 90 -190])==-894",0.0,0.07674553143951483
"Prompt: Write a python function to check whether the last element of given array is even or odd after performing an operation p times. Assesments: assert check_last([5,7,10],3,1) == ""ODD"", assert check_last([2,3],2,3) == ""EVEN"", assert check_last([1,2,3],3,1) == ""ODD""",85,0.033,43,1.9767441860465116,"Prompt: Write a python function check whether the last element given array even or after performing an operation p times Assesments: assert check_last([5,7,10],3,1 == ""ODDEVEN",0.0,0.08553062300046763
"Prompt: Write a function to find the nth hexagonal number. Assesments: assert hexagonal_num(10) == 190, assert hexagonal_num(5) == 45, assert hexagonal_num(7) == 91",49,0.029,29,1.6896551724137931,"Prompt: Write a function find the nth hexagonal number. Assesments: assert hexagonal_num(10 190, 45 91",0.0,0.05624442805727682
"Prompt: Write a function to calculate electricity bill. Assesments: assert cal_electbill(75)==246.25, assert cal_electbill(265)==1442.75, assert cal_electbill(100)==327.5",50,0.028,22,2.272727272727273,Prompt: Write a function calculate electricity bill Assesments assert cal_electbill(75)==246.25,0.0,0.1157241099149813
"Prompt: Write a function to find the ration of zeroes in an array of integers. Assesments: assert zero_count([0, 1, 2, -1, -5, 6, 0, -3, -2, 3, 4, 6, 8])==0.15, assert zero_count([2, 1, 2, -1, -5, 6, 4, -3, -2, 3, 4, 6, 8])==0.00, assert zero_count([2, 4, -6, -9, 11, -12, 14, -5, 17])==0.00",150,0.037,83,1.8072289156626506,"Prompt: Write a function to find the ration of zeroes in an array of integers Assesments: assert zero_count([0,, -1, -5, 6 0 -3 -2 3 4 6 8])==0.15, assert 1 4 -3 4 -6 -9 11 -12 14 -5 17])==0.00",0.0,0.06823822580459085
"Prompt: Write a python function to check whether the given number can be represented as sum of non-zero powers of 2 or not. Assesments: assert is_Sum_Of_Powers_Of_Two(10) == True, assert is_Sum_Of_Powers_Of_Two(7) == False, assert is_Sum_Of_Powers_Of_Two(14) == True",84,0.033,41,2.048780487804878,"Prompt: Write a python function check whether the given number can represented sum non-zero powers of or not Assesments: assert is_Sum_Of_Powers_Of_Two(10 == True,",0.0,0.09287910753349474
"Prompt: Write a function to find the circumference of a circle. Assesments: assert circle_circumference(10)==62.830000000000005, assert circle_circumference(5)==31.415000000000003, assert circle_circumference(4)==25.132",63,0.028,29,2.1724137931034484,"Prompt: Write a function find the circumference Assesments: assert circle_circumference(10)==62.830000000000005,",0.0,0.10549104636956977
"Prompt: Write a function to extract elements that occur singly in the given tuple list. Assesments: assert extract_singly([(3, 4, 5), (4, 5, 7), (1, 4)]) == [3, 4, 5, 7, 1], assert extract_singly([(1, 2, 3), (4, 2, 3), (7, 8)]) == [1, 2, 3, 4, 7, 8], assert extract_singly([(7, 8, 9), (10, 11, 12), (10, 11)]) == [7, 8, 9, 10, 11, 12]",159,0.039,85,1.8705882352941177,"Prompt: Write a function to extract elements that occur singly in the given tuple list. Assesments: assert extract_singly([(3, 4,), (4 71 4) == [3,, 1], assert 24 2 37 8)1 2 4 7 8], 8 910 11,10 11)7 8 10 11,]",0.0,0.0747015639961698
"Prompt: Write a function to sort a list of elements using pancake sort. Assesments: assert pancake_sort([15, 79, 25, 38, 69]) == [15, 25, 38, 69, 79], assert pancake_sort([98, 12, 54, 36, 85]) == [12, 36, 54, 85, 98], assert pancake_sort([41, 42, 32, 12, 23]) == [12, 23, 32, 41, 42]",121,0.04,66,1.8333333333333333,"Prompt: Write a function to sort a list elements using pancake sort Assesments: assert pancake_sort([15 79 25 38 69 == [15 25, 79], assert pancake_sort([98 12 54 36 85 42 32 12 2312 32 41]",0.0,0.07090115969784018
"Prompt: Write a function to count the same pair in three given lists. Assesments: assert count_samepair([1,2,3,4,5,6,7,8],[2,2,3,1,2,6,7,9],[2,1,3,1,2,6,7,9])==3, assert count_samepair([1,2,3,4,5,6,7,8],[2,2,3,1,2,6,7,8],[2,1,3,1,2,6,7,8])==4, assert count_samepair([1,2,3,4,2,6,7,8],[2,2,3,1,2,6,7,8],[2,1,3,1,2,6,7,8])==5",186,0.032,17,10.941176470588236,"Prompt: Write a function count the same pair three given lists Assesments assert,",0.0,1.0
"Prompt: Write a function to find number of lists present in the given tuple. Assesments: assert find_lists(([1, 2, 3, 4], [5, 6, 7, 8])) == 2, assert find_lists(([1, 2], [3, 4], [5, 6]))  == 3, assert find_lists(([9, 8, 7, 6, 5, 4, 3, 2, 1])) == 1",110,0.034,59,1.8644067796610169,"Prompt: Write a function to find number lists present the given tuple. Assesments: assert find_lists(([1,], [5] == 2,],3] 3 assert find_lists(([9 8, 7, 6, 5,, 1] 1",0.0,0.07407098843908745
"Prompt: Write a python function to find the sum of absolute differences in all pairs of the given array. Assesments: assert sum_Pairs([1,8,9,15,16],5) == 74, assert sum_Pairs([1,2,3,4],4) == 10, assert sum_Pairs([1,2,3,4,5,7,9,11,14],9) == 188",93,0.03,44,2.1136363636363638,"Prompt: Write a python function find the sum absolute differences all pairs the given array Assesments: assert sum_Pairs([1,8,9,15,16],5 == 74, 10 188",0.0,0.09949511069843021
"Prompt: Write a python function to find the maximum difference between any two elements in a given array. Assesments: assert max_Abs_Diff((2,1,5,3),4) == 4, assert max_Abs_Diff((9,3,2,5,1),5) == 8, assert max_Abs_Diff((3,2,1),3) == 2",86,0.035,43,2.0,"Prompt: Write a python function find the maximum difference any two elements in a given array Assesments: assert max_Abs_Diff((2,1,5,3),4) 4, 8",0.0,0.0879029684008937
"Prompt: Write a function to find the ascii value of total characters in a string. Assesments: assert ascii_value_string(""python"")==112, assert ascii_value_string(""Program"")==80, assert ascii_value_string(""Language"")==76",47,0.027,23,2.0434782608695654,"Prompt: Write a function find the ascii value total characters Assesments assert ascii_value_string(""python"")==112,",0.0,0.09233822284516856
"Prompt: Write a function to find the maximum total path sum in the given triangle. Assesments: assert max_path_sum([[1, 0, 0], [4, 8, 0], [1, 5, 3]], 2, 2) == 14, assert max_path_sum([[13, 0, 0], [7, 4, 0], [2, 4, 6]], 2, 2) == 24 , assert max_path_sum([[2, 0, 0], [11, 18, 0], [21, 25, 33]], 2, 2) == 53",143,0.037,89,1.6067415730337078,"Prompt: Write a function to find the maximum total path sum in the given triangle. Assesments: assert max_path_sum([[1 0, 0],4 8 01 5 3] 2, 2) == 14, assert max_path_sum([[13 0 07 4 02 4 6] 2 24 , 011 1821 25 33] 53",0.0,0.047786341124025855
"Prompt: Write a function to divide a number into two parts such that the sum of digits is maximum. Assesments: assert sum_digits_twoparts(35)==17, assert sum_digits_twoparts(7)==7, assert sum_digits_twoparts(100)==19",57,0.028,25,2.28,Prompt: Write a function divide a number such digits maximum Assesments: assert sum_digits_twoparts(35)==17,0.0,0.11646600702202359
"Prompt: Write a function to find the longest subsequence such that the difference between adjacents is one for the given array. Assesments: assert longest_subseq_with_diff_one([1, 2, 3, 4, 5, 3, 2], 7) == 6, assert longest_subseq_with_diff_one([10, 9, 4, 5, 4, 8, 6], 7) == 3, assert longest_subseq_with_diff_one([1, 2, 3, 2, 3, 7, 2, 1], 8) == 7",137,0.035,76,1.8026315789473684,"Prompt: Write a function to find the longest subsequence such the difference adjacents is one for the given array. Assesments: assert longest_subseq_with_diff_one([1, 3 2 7) == 6, 9 4 5 4 8 6 7 3 2 7 2, 1 7",0.0,0.06776924756833033
"Prompt: Write a python function to find whether the given number is present in the infinite sequence or not. Assesments: assert does_Contain_B(1,7,3) == True, assert does_Contain_B(1,-3,5) == False, assert does_Contain_B(3,2,5) == False",69,0.03,35,1.9714285714285715,"Prompt: Write a python function to find whether the given number present the infinite sequence or Assesments: assert does_Contain_B(1,7,3 == True,",0.0,0.0849883726232274
"Prompt: Write a python function to check whether the given number is co-prime or not. Assesments: assert is_coprime(17,13) == True, assert is_coprime(15,21) == False, assert is_coprime(25,45) == False",61,0.028,32,1.90625,"Prompt: Write a python function check whether the given number coprime or not Assesments: assert is_coprime(17,13 == True,",0.0,0.07833945100542611
"Prompt: Write a function to sort the given array by using merge sort. Assesments: assert merge_sort([3, 4, 2, 6, 5, 7, 1, 9]) == [1, 2, 3, 4, 5, 6, 7, 9], assert merge_sort([7, 25, 45, 78, 11, 33, 19]) == [7, 11, 19, 25, 33, 45, 78], assert merge_sort([3, 1, 4, 9, 8]) == [1, 3, 4, 8, 9]",151,0.036,88,1.7159090909090908,"Prompt: Write a function to sort the given array by using merge sort. Assesments: assert merge_sort([3 4 2 6 5 7 1 9]) == [1 9], assert merge_sort([7 25 45 78 11 33 197 11 19 25 33 45 1 4 9 8]) 3 8 9]",0.0,0.05892261265705248
"Prompt: Write a function to find the vertex of a parabola. Assesments: assert parabola_vertex(5,3,2)==(-0.3, 1.55), assert parabola_vertex(9,8,4)==(-0.4444444444444444, 2.2222222222222223), assert parabola_vertex(2,4,6)==(-1.0, 4.0)",91,0.029,36,2.5277777777777777,"Prompt: Write a function find the vertex of a parabola Assesments: assert parabola_vertex(5,3,2)==(-0.3 1.55,)",0.0,0.1417420292938965
"Prompt: Write a function to extract every specified element from a given two dimensional list. Assesments: assert specified_element([[1, 2, 3, 2], [4, 5, 6, 2], [7, 1, 9, 5]],0)==[1, 4, 7], assert specified_element([[1, 2, 3, 2], [4, 5, 6, 2], [7, 1, 9, 5]],2)==[3, 6, 9], assert specified_element([[1, 2, 3, 2], [4, 5, 6, 2], [7, 1, 9, 5]],3)==[2,2,5]",169,0.037,99,1.707070707070707,"Prompt: Write a function to extract every specified element from a given two dimensional list. Assesments: assert specified_element([[1, 2,, 2], [4 5, 6, 2],7 1 9, 5]],0)==[1, 4, 7], assert specified_element([[1 2 24 5]],2)==[3 6, 9], assert 5]],3)==[2,2,5]",0.0,0.058021001589466305
"Prompt: Write a python function to toggle all even bits of a given number. Assesments: assert even_bit_toggle_number(10) == 0, assert even_bit_toggle_number(20) == 30, assert even_bit_toggle_number(30) == 20",55,0.03,31,1.7741935483870968,"Prompt: Write a python function toggle all even bits a given number. Assesments: assert even_bit_toggle_number(10 ==, 30 20",0.0,0.06486825983546636
"Prompt: Write a function to convert a tuple of string values to a tuple of integer values. Assesments: assert tuple_int_str((('333', '33'), ('1416', '55')))==((333, 33), (1416, 55)), assert tuple_int_str((('999', '99'), ('1000', '500')))==((999, 99), (1000, 500)), assert tuple_int_str((('666', '66'), ('1500', '555')))==((666, 66), (1500, 555))",119,0.037,76,1.5657894736842106,"Prompt: Write a function to convert a tuple of string values to a tuple integer values. Assesments: assert tuple_int_str((('333', '33'), ('141655')))==((333 33), ()), assert tuple_int_str((('999991000500')))==((999 991000 tuple_int_str((('666661500555')))==((666))",0.0,0.043608782569254295
"Prompt: Write a function to reflect the run-length encoding from a list. Assesments: assert encode_list([1,1,2,3,4,4.3,5,1])==[[2, 1], [1, 2], [1, 3], [1, 4], [1, 4.3], [1, 5], [1, 1]], assert encode_list('automatically')==[[1, 'a'], [1, 'u'], [1, 't'], [1, 'o'], [1, 'm'], [1, 'a'], [1, 't'], [1, 'i'], [1, 'c'], [1, 'a'], [2, 'l'], [1, 'y']], assert encode_list('python')==[[1, 'p'], [1, 'y'], [1, 't'], [1, 'h'], [1, 'o'], [1, 'n']]",209,0.049,132,1.5833333333333333,"Prompt: Write a function to reflect the run-length encoding from a list. Assesments: assert encode_list([1,1,2,3,4,4.3,5,1])==[[2, 1], [1, 2],1, 3],1 4],1 4.3],1 5],1 1]], assert encode_list('automatically')==[[1, 'a'], [1, 'u'1 't1 'o1ma],tica2, 'l1y']], assert encode_list('python')==[[1, 'p'1y1thon]]",0.0,0.04539844664325991
"Prompt: Write a python function to find k number of operations required to make all elements equal. Assesments: assert min_Ops([2,2,2,2],4,3) == 0, assert min_Ops([4,2,6,8],4,3) == -1, assert min_Ops([21,33,9,45,63],5,6) == 24",87,0.033,40,2.175,"Prompt: Write a python function find k number operations required make all elements equal Assesments: assert min_Ops([2,2,2,2],4,3), -1 24",0.0,0.10575486753909988
"Prompt: Write a function to print the season for the given month and day. Assesments: assert month_season('January',4)==('winter'), assert month_season('October',28)==('autumn'), assert month_season('June',6)==('spring')",57,0.03,29,1.9655172413793103,"Prompt: Write a function print the season for the given month and day Assesments: assert month_season('January',4)==('winter",0.0,0.08438535280715849
"Prompt: Write a function to find x and y that satisfies ax + by = n. Assesments: assert solution(2, 3, 7) == ('x = ', 2, ', y = ', 1), assert solution(4, 2, 7) == 'No solution', assert solution(1, 13, 17) == ('x = ', 4, ', y = ', 1)",90,0.04,52,1.7307692307692308,"Prompt: Write a function find x and that satisfies ax + by = n. Assesments: assert solution(2 7 ('x = ', 2 ', y 1), assert 2 7 'No solution 13 17 4)",0.0,0.060438508188268805
"Prompt: Write a function to remove all elements from a given list present in another list. Assesments: assert remove_elements([1,2,3,4,5,6,7,8,9,10],[2,4,6,8])==[1, 3, 5, 7, 9, 10], assert remove_elements([1, 2, 3, 4, 5, 6, 7, 8, 9, 10],[1, 3, 5, 7])==[2, 4, 6, 8, 9, 10], assert remove_elements([1, 2, 3, 4, 5, 6, 7, 8, 9, 10],[5,7])==[1, 2, 3, 4, 6, 8, 9, 10]",198,0.039,127,1.5590551181102361,"Prompt: Write a function to remove all elements from a given list present in another list. Assesments: assert remove_elements([1,2,3,4,5,6,7,8,9,10],[2,4,6,8])==[1, 3 5 7 9, 10], assert remove_elements([1 2 3 4,, 10],[1 3 5 7])==[2 4 6 8, 9], 2 10],[5,7])==[1 2 3 6 8]",0.0,0.042921805218011956
"Prompt: Write a function to calculate the sum of the positive integers of n+(n-2)+(n-4)... (until n-x =< 0). Assesments: assert sum_series(6)==12, assert sum_series(10)==30, assert sum_series(9)==25",60,0.04,23,2.608695652173913,Prompt: Write a function calculate)... (until n-x =< Assesments assert sum_series(6)==12,0.0,0.14999653062074134
"Prompt: Write a function to calculate the area of a regular polygon. Assesments: assert area_polygon(4,20)==400.00000000000006, assert area_polygon(10,15)==1731.1969896610804, assert area_polygon(9,7)==302.90938549487214",66,0.028,29,2.2758620689655173,"Prompt: Write a function calculate the area a regular polygon Assesments assert area_polygon(4,20)==400.00000000000006",0.0,0.1160438931507754
"Prompt: Write a python function to check whether the sum of divisors are same or not. Assesments: assert areEquivalent(36,57) == False, assert areEquivalent(2,4) == False, assert areEquivalent(23,47) == True",55,0.029,30,1.8333333333333333,"Prompt: Write a python function check whether the sum divisors are same not Assesments: assert areEquivalent(36,57 == False, True",0.0,0.07090115969784018
"Prompt: Write a python function to count characters at same position in a given string (lower and uppercase characters) as in english alphabet. Assesments: assert count_char_position(""xbcefg"") == 2, assert count_char_position(""ABcED"") == 3, assert count_char_position(""AbgdeF"") == 5",70,0.03,54,1.2962962962962963,"Prompt: Write a python function count characters at same position a given string (lower and uppercase characters as english alphabet Assesments: assert count_char_position(""xbcefg 2, count_char_position(""ABcED count_char_position(""AbgdeF 5",0.0,0.01611755387688997
"Prompt: Write a python function to count the pairs with xor as an even number. Assesments: assert find_even_Pair([5,4,7,2,1],5) == 4, assert find_even_Pair([7,2,8,1,0,5,11],7) == 9, assert find_even_Pair([1,2,3],3) == 1",86,0.029,41,2.097560975609756,"Prompt: Write a python function count the pairs with xor as an even number Assesments: assert find_even_Pair([5,4,7,2,1],5 4, 9",0.0,0.09785524666609577
"Prompt: Write a python function to find smallest power of 2 greater than or equal to n. Assesments: assert next_Power_Of_2(0) == 1, assert next_Power_Of_2(5) == 8, assert next_Power_Of_2(17) == 32",68,0.029,36,1.8888888888888888,"Prompt: Write a python function find smallest power of greater or n. Assesments: assert next_Power_Of_2(0) 1, 8 32",0.0,0.07656842926552469
"Prompt: Write a python function to find the frequency of a number in a given array. Assesments: assert frequency([1,2,3],4) == 0, assert frequency([1,2,2,3,3,3,4],3) == 3, assert frequency([0,1,2,3,1,2],1) == 2",80,0.029,33,2.4242424242424243,"Prompt: Write a python function find the frequency a number in a given array Assesments: assert frequency([1,2,3],4 ==, 3",0.0,0.13118029964502995
"Prompt: Write a function to calculate the nth pell number. Assesments: assert get_pell(4) == 12, assert get_pell(7) == 169, assert get_pell(8) == 408",48,0.033,28,1.7142857142857142,"Prompt: Write a function calculate the nth pell number. Assesments: assert get_pell(4 12, 169 408",0.0,0.05875701062423053
"Prompt: Write a function to find sum of the numbers in a list between the indices of a specified range. Assesments: assert sum_range_list( [2,1,5,6,8,3,4,9,10,11,8,12],8,10)==29, assert sum_range_list( [2,1,5,6,8,3,4,9,10,11,8,12],5,7)==16, assert sum_range_list( [2,1,5,6,8,3,4,9,10,11,8,12],7,10)==38",133,0.034,24,5.541666666666667,"Prompt: Write a function find sum the numbers between the indices a specified range Assesments: assert sum_range_list [,",0.0,0.449191403340781
"Prompt: Write a function to find the perimeter of a pentagon. Assesments: assert perimeter_pentagon(5)==25, assert perimeter_pentagon(10)==50, assert perimeter_pentagon(15)==75",47,0.026,23,2.0434782608695654,Prompt: Write a function find the perimeter a pentagon Assesments assert perimeter_pentagon(5)==25,0.0,0.09233822284516856
"Prompt: Write a function to find the occurence of characters 'std' in the given string 1. list item 1. list item 1. list item 2. list item 2. list item 2. list item Assesments: assert count_occurance(""letstdlenstdporstd"") == 3, assert count_occurance(""truststdsolensporsd"") == 1, assert count_occurance(""makestdsostdworthit"") == 2",104,0.085,77,1.3506493506493507,"Prompt: Write a function find characters 'std 1 list item 1. list item 1. list item 2 list item 2 list item 2 list item Assesments: assert count_occurance(""letstdlenstdporstd 3, count_occurance(""truststdsolensporsd count_occurance(""makestdsostdworthit",0.0,0.021662155272113775
"Prompt: Write a function to remove everything except alphanumeric characters from a string. Assesments: assert remove_splchar('python  @#&^%$*program123')==('pythonprogram123'), assert remove_splchar('python %^$@!^&*()  programming24%$^^()    language')==('pythonprogramming24language'), assert remove_splchar('python   ^%&^()(+_)(_^&67)                  program')==('python67program')",107,0.032,71,1.5070422535211268,Prompt: Write a function remove everything except alphanumeric characters Assesments: assert remove_splchar('python @#&^%$*program123')==('pythonprogram123 %^$@!^&*() programming24%$^^ language')==('pythonprogramming24language ^%&^()(+_)(_^&67,0.0,0.03761592857496077
"Prompt: Write a function to group a sequence of key-value pairs into a dictionary of lists. Assesments: assert group_keyvalue([('yellow', 1), ('blue', 2), ('yellow', 3), ('blue', 4), ('red', 1)])=={'yellow': [1, 3], 'blue': [2, 4], 'red': [1]}, assert group_keyvalue([('python', 1), ('python', 2), ('python', 3), ('python', 4), ('python', 5)])=={'python': [1,2,3,4,5]}, assert group_keyvalue([('yellow',100), ('blue', 200), ('yellow', 300), ('blue', 400), ('red', 100)])=={'yellow': [100, 300], 'blue': [200, 400], 'red': [100]}",192,0.053,134,1.4328358208955223,"Prompt: Write a function to group a sequence of key-value pairs into a dictionary of lists. Assesments: assert group_keyvalue([('yellow', 1), ('blue 2),yellow 3),blue),red 1)])=={'yellow [1, 3], 'blue [2, 4red1]}, assert group_keyvalue([('python', 1python 5)])=={'python [1,2,3,4,5] group_keyvalue([('yellow',100), ('blue 200),yellow 300),blue 400red 100)])=={'yellow100 300],200, 400100]}",0.0,0.030046067142741436
"Prompt: Write a function to verify validity of a string of parentheses. Assesments: assert is_valid_parenthese(""(){}[]"")==True, assert is_valid_parenthese(""()[{)}"")==False, assert is_valid_parenthese(""()"")==True",54,0.036,24,2.25,"Prompt: Write a function verify validity of parentheses Assesments assert is_valid_parenthese(""(){}[]"")==True",0.0,0.11340568145547399
"Prompt: Write a function to find the perimeter of a triangle. Assesments: assert perimeter_triangle(10,20,30)==60, assert perimeter_triangle(3,4,5)==12, assert perimeter_triangle(25,35,45)==105",52,0.028,24,2.1666666666666665,"Prompt: Write a function find the perimeter a triangle Assesments assert perimeter_triangle(10,20,30)==60",0.0,0.1049047771039472
"Prompt: Write a python function to find two distinct numbers such that their lcm lies within the given range. Assesments: assert answer(3,8) == (3,6), assert answer(2,6) == (2,4), assert answer(1,3) == (1,2)",65,0.03,36,1.8055555555555556,"Prompt: Write a python function find two distinct numbers such their lcm lies within the given range Assesments: assert answer(3,8 (3,6), assert)",0.0,0.06806752491399794
"Prompt: Write a function to search some literals strings in a string. Assesments: assert string_literals(['language'],'python language')==('Matched!'), assert string_literals(['program'],'python language')==('Not Matched!'), assert string_literals(['python'],'programming language')==('Not Matched!')",65,0.031,29,2.2413793103448274,"Prompt: Write a function search some literals strings in. Assesments: assert string_literals(['language'],'python language')==('Matched!'!",0.0,0.11252627755704016
"Prompt: Write a function to find if the given number is a keith number or not. Assesments: assert is_num_keith(14) == True, assert is_num_keith(12) == False, assert is_num_keith(197) == True",55,0.031,29,1.896551724137931,"Prompt: Write a function find if the given number a keith number or Assesments: assert is_num_keith(14 == True,",0.0,0.07735012161968807
"Prompt: Write a function to calculate distance between two points using latitude and longitude. Assesments: assert distance_lat_long(23.5,67.5,25.5,69.5)==12179.372041317429, assert distance_lat_long(10.5,20.5,30.5,40.5)==6069.397933300514, assert distance_lat_long(10,20,30,40)==6783.751974994595",98,0.031,41,2.3902439024390243,"Prompt: Write a function calculate distance using latitude Assesments assert distance_lat_long(23.5,67.5,25.5,69.5)==12179.372041317429,",0.0,0.12771208146170193
"Prompt: Write a function to find the longest common prefix in the given set of strings. Assesments: assert common_prefix([""tablets"", ""tables"", ""taxi"", ""tamarind""], 4) == 'ta', assert common_prefix([""apples"", ""ape"", ""april""], 3) == 'ap', assert common_prefix([""teens"", ""teenager"", ""teenmar""], 3) == 'teen'",91,0.039,65,1.4,"Prompt: Write a function to find the longest common prefix in the given set strings Assesments: assert common_prefix([""tablets ""tablestaxi ""tamarind 4 == 'ta assert common_prefix([""applesapeapril 3ap', common_prefix([""teensteenager"", ""teenmar""],teen'",0.0,0.02669645706990104
"Prompt: Write a function to find uppercase, lowercase, special character and numeric values using regex. Assesments: assert find_character(""ThisIsGeeksforGeeks"") == (['T', 'I', 'G', 'G'], ['h', 'i', 's', 's', 'e', 'e', 'k', 's', 'f', 'o', 'r', 'e', 'e', 'k', 's'], [], []), assert find_character(""Hithere2"") == (['H'], ['i', 't', 'h', 'e', 'r', 'e'], ['2'], []), assert find_character(""HeyFolks32"") == (['H', 'F'], ['e', 'y', 'o', 'l', 'k', 's'], ['3', '2'], [])",176,0.053,100,1.76,"Prompt: Write a function to find uppercase,, special character and numeric values using regex. Assesments: assert find_character(""ThisIsGeeksforGeeks"") == (['T',IGG'], ['h',i 's 's',ee',k 'sforeek 's'], [], []), assert find_character(""Hithere2"")H'i',there'2' [] find_character(""HeyFolks32HF'eyolk 's'3', '2' [])",0.0,0.06342036386849664
"Prompt: Write a function to count all the distinct pairs having a difference of k in any array. Assesments: assert count_pairs([1, 5, 3, 4, 2], 5, 3) == 2, assert count_pairs([8, 12, 16, 4, 0, 20], 6, 4) == 5, assert count_pairs([2, 4, 1, 3, 4], 5, 2) == 3",110,0.039,68,1.6176470588235294,"Prompt: Write a function count all the distinct pairs having a difference of k in any array Assesments: assert count_pairs([1 5 3 4 2 5) == 2, 12 16 4 0 20 6 4 5 4 1 3 4 5",0.0,0.04889881902330035
"Prompt: Write a function to find all the values in a list that are greater than a specified number. Assesments: assert greater_specificnum([220, 330, 500],200)==True, assert greater_specificnum([12, 17, 21],20)==False, assert greater_specificnum([1,2,3,4],10)==False",75,0.031,32,2.34375,"Prompt: Write a function find all the values that are greater Assesments: assert greater_specificnum([220 330 500],200)==True 17",0.0,0.12296919885094158
"Prompt: Write a function to find the focus of a parabola. Assesments: assert parabola_focus(5,3,2)==(-0.3, 1.6), assert parabola_focus(9,8,4)==(-0.4444444444444444, 2.25), assert parabola_focus(2,4,6)==(-1.0, 4.125)",86,0.028,43,2.0,"Prompt: Write a function find the focus a parabola Assesments: assert parabola_focus(5,3,2)==(-0.3 1.6, 2.25 4.125",0.0,0.0879029684008937
"Prompt: Write a function to search some literals strings in a string by using regex. Assesments: assert check_literals('The quick brown fox jumps over the lazy dog.',['fox']) == 'Matched!', assert check_literals('The quick brown fox jumps over the lazy dog.',['horse']) == 'Not Matched!', assert check_literals('The quick brown fox jumps over the lazy dog.',['lazy']) == 'Matched!'",86,0.037,50,1.72,"Prompt: Write a function to search some literals strings in a string by using regex. Assesments: assert check_literals('The quick brown fox jumps over the lazy dog.',['fox' == 'Matched! assert',['horseNot Matched',['lazy",0.0,0.059339929779763795
"Prompt: Write a function to find the longest common subsequence for the given two sequences. Assesments: assert longest_common_subsequence(""AGGTAB"" , ""GXTXAYB"", 6, 7) == 4, assert longest_common_subsequence(""ABCDGH"" , ""AEDFHR"", 6, 6) == 3, assert longest_common_subsequence(""AXYT"" , ""AYZX"", 4, 4) == 2",98,0.034,64,1.53125,"Prompt: Write a function find the longest common subsequence for the given two sequences Assesments: assert longest_common_subsequence(""AGGTAB"" ,GXTXAYB 6, 7 == 4, longest_common_subsequence(""ABCDGH""AEDFHR 6 3""AYZX 4",0.0,0.040085381423555694
"Prompt: Write a python function to check whether the given number can be represented by product of two squares or not. Assesments: assert prod_Square(25) == False, assert prod_Square(30) == False, assert prod_Square(16) == True",56,0.031,31,1.8064516129032258,"Prompt: Write a python function check whether the given number can represented product of two squares or not Assesments: assert prod_Square(25 False,",0.0,0.06815893248767027
"Prompt: Write a python function to find the first missing positive number. Assesments: assert first_Missing_Positive([1,2,3,-1,5],5) == 4, assert first_Missing_Positive([0,-1,-2,1,5,8],6) == 2, assert first_Missing_Positive([0,1,2,5,-8],5) == 3",88,0.03,40,2.2,"Prompt: Write a python function find the first missing positive number Assesments: assert first_Missing_Positive([1,2,3,-1,5],5 == 4, 2",0.0,0.10830513884455795
"Prompt: Write a python function to count the number of integral co-ordinates that lie inside a square. Assesments: assert count_Intgral_Points(1,1,4,4) == 4, assert count_Intgral_Points(1,2,1,2) == 1, assert count_Intgral_Points(4,2,6,4) == 1",84,0.035,41,2.048780487804878,"Prompt: Write a python function count integral co- that lie inside a square Assesments: assert count_Intgral_Points(1,1,4,4 4, 1 1",0.0,0.09287910753349474
"Prompt: Write a function to check whether the given month name contains 30 days or not. Assesments: assert check_monthnumber(""February"")==False, assert check_monthnumber(""June"")==True, assert check_monthnumber(""April"")==True",49,0.031,25,1.96,"Prompt: Write a function check the given month name contains 30 Assesments: assert check_monthnumber(""February"")==False",0.0,0.08382253431216086
"Prompt: Write a python function to check whether a string has atleast one letter and one number. Assesments: assert check_String('thishasboth29') == True, assert check_String('python') == False, assert check_String ('string') == False",52,0.032,34,1.5294117647058822,"Prompt: Write a python function check whether a string has atleast one letter and one number Assesments: assert check_String('thishasboth29 True, ('string False",0.0,0.03989786147462494
"Prompt: Write a function to remove the duplicates from the given tuple. Assesments: assert remove_tuple((1, 3, 5, 2, 3, 5, 1, 1, 3)) == (1, 2, 3, 5), assert remove_tuple((2, 3, 4, 4, 5, 6, 6, 7, 8, 8)) == (2, 3, 4, 5, 6, 7, 8), assert remove_tuple((11, 12, 13, 11, 11, 12, 14, 13)) == (11, 12, 13, 14)",156,0.043,89,1.752808988764045,"Prompt: Write a function to remove the duplicates from the given tuple. Assesments: assert remove_tuple((1 3, 5, 2, 3, 5, 1 1 3 == (1 2), assert 4 4 5 6 6 7 8 8)2, assert remove_tuple((11 12 11 11 14 13)) 14)",0.0,0.06268680268400535
"Prompt: Write a python function to convert octal number to decimal number. Assesments: assert octal_To_Decimal(25) == 21, assert octal_To_Decimal(30) == 24, assert octal_To_Decimal(40) == 32",60,0.031,33,1.8181818181818181,"Prompt: Write a python function convert octal number decimal number Assesments: assert octal_To_Decimal(25) 21, 24 32",0.0,0.06935554072483532
"Prompt: Write a python function to find the first position of an element in a sorted array. Assesments: assert first([1,2,3,4,5,6,6],6,6) == 5, assert first([1,2,2,2,3,2,2,4,2],2,9) == 1, assert first([1,2,3],1,3) == 0",93,0.032,45,2.066666666666667,"Prompt: Write a python function find the first position an element a sorted array Assesments: assert first([1,2,3,4,5,6,6],6,6 == 5, 0",0.0,0.09470369188211514
"Prompt: Write a function to remove all the tuples with length k. Assesments: assert remove_tuples([(4, 5), (4, ), (8, 6, 7), (1, ), (3, 4, 6, 7)] , 1) == [(4, 5), (8, 6, 7), (3, 4, 6, 7)], assert remove_tuples([(4, 5), (4,5), (6, 7), (1, 2, 3), (3, 4, 6, 7)] ,2) == [(1, 2, 3), (3, 4, 6, 7)], assert remove_tuples([(1, 4, 4), (4, 3), (8, 6, 7), (1, ), (3, 6, 7)] , 3) == [(4, 3), (1,)]",212,0.048,105,2.019047619047619,"Prompt: Write a function to remove all the tuples with length k. Assesments: assert remove_tuples([(4, 5), (4 ), (8 6, 7),1 ),3 4, 6, 7)] , 1) == [(48,3 4)], assert4,56 71 2, 3),3 6 ,21,3) 4, 44 3),8 6,1 ), 6)] 34 31)]",0.0,0.08984603225267125
"Prompt: Write a function to perform the exponentiation of the given two tuples. Assesments: assert find_exponentio((10, 4, 5, 6), (5, 6, 7, 5)) == (100000, 4096, 78125, 7776), assert find_exponentio((11, 5, 6, 7), (6, 7, 8, 6)) == (1771561, 78125, 1679616, 117649), assert find_exponentio((12, 6, 7, 8), (7, 8, 9, 7)) == (35831808, 1679616, 40353607, 2097152)",164,0.044,95,1.7263157894736842,"Prompt: Write a function to perform the exponentiation of the given two tuples Assesments: assert find_exponentio((10 4, 5, 6), (5 6, 5 == (100000, 4096 78125, 7776), assert 56 61771561 78125 1679616, 117649 67 735831808 1679616 40353607 2097152)",0.0,0.05998420884640583
"Prompt: Write a function to find the largest triangle that can be inscribed in an ellipse. Assesments: assert largest_triangle(4,2)==10.392304845413264, assert largest_triangle(5,7)==4.639421805988064, assert largest_triangle(9,1)==105.2220865598093",70,0.029,31,2.2580645161290325,"Prompt: Write a function find the largest triangle that inscribed Assesments assert largest_triangle(4,2)==10.392304845413264 assert",0.0,0.11422834961852497
"Prompt: Write a python function to find highest power of 2 less than or equal to given number. Assesments: assert highest_Power_of_2(10) == 8, assert highest_Power_of_2(19) == 16, assert highest_Power_of_2(32) == 32",66,0.03,36,1.8333333333333333,"Prompt: Write a python function find highest power of 2 less or given number. Assesments: assert highest_Power_of_2(10) 8, 16",0.0,0.07090115969784018
"Prompt: Write a function to find all index positions of the maximum values in a given list. Assesments: assert position_max([12,33,23,10,67,89,45,667,23,12,11,10,54])==[7], assert position_max([1,2,2,2,4,4,4,5,5,5,5])==[7,8,9,10], assert position_max([2,1,5,6,8,3,4,9,10,11,8,12])==[11]",125,0.031,51,2.450980392156863,"Prompt: Write a function find all index positions of the maximum values Assesments: assert position_max([12,33,23,10,67,89,45,667,23,12,11,10,54])==[7]",0.0,0.13390786253856796
"Prompt: Write a python function to check whether the elements in a list are same or not. Assesments: assert chkList(['one','one','one']) == True, assert chkList(['one','Two','Three']) == False, assert chkList(['bigdata','python','Django']) == False",63,0.032,44,1.4318181818181819,"Prompt: Write a python function check whether the elements in a list same not Assesments: assert chkList(['one','one','one' == True, False chkList(['bigdata','python','Django'",0.0,0.02994225691321127
"Prompt: Write a function to remove even characters in a string. Assesments: assert remove_even(""python"")==(""pto""), assert remove_even(""program"")==(""porm""), assert remove_even(""language"")==(""lnug"")",46,0.029,37,1.2432432432432432,"Prompt: Write a function remove even characters in Assesments: assert remove_even(""python"")==(""pto remove_even(""program"")==(""porm remove_even(""language"")==(""lnug",0.0,0.010705566722164224
"Prompt: Write a python function to find the hamming distance between given two integers. Assesments: assert hamming_Distance(4,8) == 2, assert hamming_Distance(2,4) == 2, assert hamming_Distance(1,2) == 2",62,0.03,32,1.9375,"Prompt: Write a python function find the hamming distance between given two integers Assesments: assert hamming_Distance(4,8 2, assert",0.0,0.08152729013724865
"Prompt: Write a python function to count the occurrence of a given character in a string. Assesments: assert count(""abcc"",""c"") == 2, assert count(""ababca"",""a"") == 3, assert count(""mnmm0pm"",""m"") == 4",59,0.029,43,1.372093023255814,"Prompt: Write a python function to count the occurrence a given character in Assesments: assert count(""abcc"",""c"") 2, count(""ababca"",""a count(""mnmm0pm"",""m",0.0,0.023849642589389763
"Prompt: Write a function to find the inversions of tuple elements in the given tuple list. Assesments: assert inversion_elements((7, 8, 9, 1, 10, 7)) == (-8, -9, -10, -2, -11, -8), assert inversion_elements((2, 4, 5, 6, 1, 7)) == (-3, -5, -6, -7, -2, -8), assert inversion_elements((8, 9, 11, 14, 12, 13)) == (-9, -10, -12, -15, -13, -14)",143,0.041,81,1.7654320987654322,"Prompt: Write a function to find the inversions of tuple elements in the given tuple list Assesments: assert inversion_elements((7 8,, 1, 10 7 == (-8 -9 -2 -11 -8), assert 4 5 1 7-3 -5 -2 9 11 14 12 13))-9 -15 -13,)",0.0,0.06397449689289247
"Prompt: Write a function to perform the adjacent element concatenation in the given tuples. Assesments: assert concatenate_elements((""DSP "", ""IS "", ""BEST "", ""FOR "", ""ALL "", ""UTS"")) == ('DSP IS ', 'IS BEST ', 'BEST FOR ', 'FOR ALL ', 'ALL UTS'), assert concatenate_elements((""RES "", ""IS "", ""BEST "", ""FOR "", ""ALL "", ""QESR"")) == ('RES IS ', 'IS BEST ', 'BEST FOR ', 'FOR ALL ', 'ALL QESR'), assert concatenate_elements((""MSAM"", ""IS "", ""BEST "", ""FOR "", ""ALL "", ""SKD"")) == ('MSAMIS ', 'IS BEST ', 'BEST FOR ', 'FOR ALL ', 'ALL SKD')",157,0.047,93,1.6881720430107527,"Prompt: Write a function to perform the adjacent element concatenation in the given tuples. Assesments: assert concatenate_elements((""DSP "", ""IS "",BEST "", ""FOR "",ALL "", ""UTS"")) == ('DSP IS ',IS BEST ',BEST FOR ',FOR ALL ', 'ALL UTS'), assert concatenate_elements((""RES "",ISFOR ""ALL "", ""QESR"")) FORFOR concatenate_elements((""MSAM"",, ""SKD""))MSAMIS')",0.0,0.05609313276292262
"Prompt: Write a function to count the longest repeating subsequences such that the two subsequences don’t have same string characters at same positions. Assesments: assert find_longest_repeating_subseq(""AABEBCDD"") == 3, assert find_longest_repeating_subseq(""aabb"") == 2, assert find_longest_repeating_subseq(""aab"") == 1",81,0.034,47,1.7234042553191489,"Prompt: Write a function count the longest repeating subsequences such the two subsequences don��t have same string characters at same positions Assesments: assert find_longest_repeating_subseq(""AABEBCDD 3,"")",0.0,0.05968720076603893
"Prompt: Write a function to check the given decimal with a precision of 2 by using regex. Assesments: assert is_decimal('123.11') == True, assert is_decimal('0.21') == True, assert is_decimal('123.1214') == False",57,0.03,32,1.78125,"Prompt: Write a function check the given decimal with a precision 2 by using regex. Assesments: assert is_decimal('123.11 True, False",0.0,0.06558809447813596
"Prompt: Write a function to delete the smallest element from the given heap and then insert a new item. Assesments: assert heap_replace( [25, 44, 68, 21, 39, 23, 89],21)==[21, 25, 23, 44, 39, 68, 89], assert heap_replace([25, 44, 68, 21, 39, 23, 89],110)== [23, 25, 68, 44, 39, 110, 89], assert heap_replace([25, 44, 68, 21, 39, 23, 89],500)==[23, 25, 68, 44, 39, 500, 89]",167,0.038,100,1.67,"Prompt: Write a function to delete the smallest element from the given heap and then insert a new item. Assesments: assert heap_replace( [25, 44, 68, 21 39 23 89],21)==[21, 25 23 44 39 68 89 assert heap_replace([25 44 89],110)== [23 25 68 44 110 89 89],500)==[23 68 500]",0.0,0.05423938716884774
"Prompt: Write a function to check that the given string contains only a certain set of characters(in this case a-z, a-z and 0-9) by using regex. Assesments: assert is_allowed_specific_char(""ABCDEFabcdef123450"") == True, assert is_allowed_specific_char(""*&%@#!}{"") == False, assert is_allowed_specific_char(""HELLOhowareyou98765"") == True",85,0.034,55,1.5454545454545454,"Prompt: Write a function check that the given string only a certain set characters(in a-, and 0 by regex Assesments: assert is_allowed_specific_char(""ABCDEFabcdef123450 True,#!}{"") is_allowed_specific_char(""HELLOhowareyou98765",0.0,0.04153439921074775
"Prompt: Write a python function to count numbers whose oth and nth bits are set. Assesments: assert count_Num(2) == 1, assert count_Num(3) == 2, assert count_Num(1) == 1",50,0.029,29,1.7241379310344827,"Prompt: Write a python function count numbers whose oth and nth bits set. Assesments: assert count_Num(2 1, 1",0.0,0.059762043651012016
"Prompt: Write a python function to find the sum of fourth power of n natural numbers. Assesments: assert fourth_Power_Sum(2) == 17, assert fourth_Power_Sum(4) == 354, assert fourth_Power_Sum(6) == 2275",61,0.029,35,1.7428571428571429,"Prompt: Write a python function find the sum fourth power n natural numbers Assesments: assert fourth_Power_Sum(2) 17, 354 2275",0.0,0.06167160640189686
"Prompt: Write a function to perform the concatenation of two string tuples. Assesments: assert concatenate_strings((""Manjeet"", ""Nikhil"", ""Akshat""), ("" Singh"", "" Meherwal"", "" Garg"")) == ('Manjeet Singh', 'Nikhil Meherwal', 'Akshat Garg'), assert concatenate_strings((""Shaik"", ""Ayesha"", ""Sanya""), ("" Dawood"", "" Begum"", "" Singh"")) == ('Shaik Dawood', 'Ayesha Begum', 'Sanya Singh'), assert concatenate_strings((""Harpreet"", ""Priyanka"", ""Muskan""), (""Kour"", "" Agarwal"", ""Sethi"")) == ('HarpreetKour', 'Priyanka Agarwal', 'MuskanSethi')",163,0.044,115,1.4173913043478261,"Prompt: Write a function to perform the concatenation of two string tuples. Assesments: assert concatenate_strings((""Manjeet"",NikhilAkshat""), ("" Singh"", "" Meherwal"", "" Garg"")) == ('Manjeet SinghAkshat Garg assert concatenate_strings((""Shaik"",Ayesha ""Sanya ("" Dawood "" Begum"", Singh""))Sanya Singh concatenate_strings((""HarpreetPriyanka ""MuskanKour"", "" Agarwal ""Sethi""))HarpreetKourPriyanka AgarwalMuskanSethi",0.0,0.028470558847610985
"Prompt: Write a function to convert radians to degrees. Assesments: assert degree_radian(90)==5156.620156177409, assert degree_radian(60)==3437.746770784939, assert degree_radian(120)==6875.493541569878",59,0.03,25,2.36,"Prompt: Write a function convert radians Assesments assert degree_radian(90)==5156.620156177409,",0.0,0.12462687519948928
"Prompt: Write a function to decode a run-length encoded given list. Assesments: assert decode_list([[2, 1], 2, 3, [2, 4], 5,1])==[1,1,2,3,4,4,5,1], assert decode_list(['a', 'u', 't', 'o', 'm', 'a', 't', 'i', 'c', 'a', [2, 'l'], 'y'])==['a', 'u', 't', 'o', 'm', 'a', 't', 'i', 'c', 'a', 'l', 'l', 'y'], assert decode_list(['p', 'y', 't', 'h', 'o', 'n'])==['p', 'y', 't', 'h', 'o', 'n']",184,0.047,111,1.6576576576576576,"Prompt: Write a function to decode a run-length encoded given list. Assesments: assert decode_list([[2, 1], 2, 3, [2 4], 5,1])==[1,1,2,3,4,4,5,1], assert decode_list(['a', 'u',t',o',ma',tica [2, 'l'], 'y'])==['a 'uti ' 'l', 'l', 'y'], assert decode_list(['python'])==['py']",0.0,0.052980334308135126
"Prompt: Write a function to check if a nested list is a subset of another nested list. Assesments: assert check_subset_list([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14],[[12, 18, 23, 25, 45], [7, 11, 19, 24, 28], [1, 5, 8, 18, 15, 16]])==False, assert check_subset_list([[2, 3, 1], [4, 5], [6, 8]],[[4, 5], [6, 8]])==True, assert check_subset_list([['a', 'b'], ['e'], ['c', 'd']],[['g']])==False",187,0.04,116,1.6120689655172413,"Prompt: Write a function to check a nested list is a subset another nested list. Assesments: assert check_subset_list([1,,, 14],[[12 18 23 25 45], [7 11 19 24 281 5 8 18 15, 16]])==False, assert check_subset_list([[2 3 1],4 5],6 8]],[[4 5],6 8]])==True check_subset_list([['a' ['e'cd']],[['g']])==False",0.0,0.04832979297137259
"Prompt: Write a python function to find the first repeated character in a given string. Assesments: assert first_Repeated_Char(""Google"") == ""o"", assert first_Repeated_Char(""data"") == ""a"", assert first_Repeated_Char(""python"") == '\0'",60,0.03,41,1.4634146341463414,"Prompt: Write a python function to find the first repeated character in a given string Assesments: assert first_Repeated_Char(""Google"") ==o first_Repeated_Char(""dataa '\0",0.0,0.03316543794228238
"Prompt: Write a python function to find the minimum operations required to make two numbers equal. Assesments: assert min_Operations(2,4) == 1, assert min_Operations(4,10) == 4, assert min_Operations(1,4) == 3",60,0.03,34,1.7647058823529411,"Prompt: Write a python function find the minimum operations required make two numbers Assesments: assert min_Operations(2,4 1, assert 4 3",0.0,0.06390041493775933
"Prompt: Write a function to extract maximum and minimum k elements in the given tuple. Assesments: assert extract_min_max((5, 20, 3, 7, 6, 8), 2) == (3, 5, 8, 20), assert extract_min_max((4, 5, 6, 1, 2, 7), 3) == (1, 2, 4, 5, 6, 7), assert extract_min_max((2, 3, 4, 8, 9, 11, 7), 4) == (2, 3, 4, 7, 8, 9, 11)",153,0.037,89,1.7191011235955056,"Prompt: Write a function to extract maximum and minimum k elements in the given tuple Assesments: assert extract_min_max((5 20, 3, 7, 6 8) 2) (3 5 8 20), assert 5 6 1 2, 7 31 2 4 5 6 7 8 9 11 72 7 8,)",0.0,0.05924823463170239
"Prompt: Write a function to replace maximum n occurrences of spaces, commas, or dots with a colon. Assesments: assert replace_max_specialchar('Python language, Programming language.',2)==('Python:language: Programming language.'), assert replace_max_specialchar('a b c,d e f',3)==('a:b:c:d e f'), assert replace_max_specialchar('ram reshma,ram rahim',1)==('ram:reshma,ram rahim')",97,0.035,56,1.7321428571428572,"Prompt: Write a function replace maximum n occurrences spaces, dots a colon Assesments: assert replace_max_specialchar('Python language, Programming language.',2)==('Python:language: Programming language assert b c,d eb e replace_max_specialchar('ram reshmareshma,",0.0,0.06057863298527199
"Prompt: Write a python function to find the first even number in a given list of numbers. Assesments: assert first_even ([1, 3, 5, 7, 4, 1, 6, 8]) == 4, assert first_even([2, 3, 4]) == 2, assert first_even([5, 6, 7]) == 6",85,0.032,47,1.8085106382978724,"Prompt: Write a python function find the first even number in a given list of numbers Assesments: assert first_even ([1 3 5 4 1 6 8]) == 4, 2 6",0.0,0.06836897542291734
"Prompt: Write a function to check if all the elements in tuple have same data type or not. Assesments: assert check_type((5, 6, 7, 3, 5, 6) ) == True, assert check_type((1, 2, ""4"") ) == False, assert check_type((3, 2, 1, 4, 5) ) == True",86,0.033,49,1.7551020408163265,"Prompt: Write a function check all the elements in tuple have same data type or not Assesments: assert check_type((5 6, 3 5 6) ) True, ""4 ) 2 1 4,",0.0,0.06292071887803956
"Prompt: Write a function to check for majority element in the given sorted array. Assesments: assert is_majority([1, 2, 3, 3, 3, 3, 10], 7, 3) == True, assert is_majority([1, 1, 2, 4, 4, 4, 6, 6], 8, 4) == False, assert is_majority([1, 1, 1, 2, 2], 5, 1) == True",118,0.034,66,1.7878787878787878,"Prompt: Write a function to check for majority element in the given sorted array Assesments: assert is_majority([1, 3 3 3 10], 7 3) == True, 1 4 4 6 6 8 4 1 2], 5 1",0.0,0.0662643027788256
"Prompt: Write a python function to count set bits of a given number. Assesments: assert count_Set_Bits(2) == 1, assert count_Set_Bits(4) == 1, assert count_Set_Bits(6) == 2",54,0.029,29,1.8620689655172413,"Prompt: Write a python function count set bits of a given number Assesments: assert count_Set_Bits(2) ==, 2",0.0,0.07383250602595286
"Prompt: Write a python function to find the minimum element in a sorted and rotated array. Assesments: assert find_Min([1,2,3,4,5],0,4) == 1, assert find_Min([4,6,8],0,2) == 4, assert find_Min([2,3,5,7,9],0,4) == 2",83,0.03,42,1.9761904761904763,"Prompt: Write a python function find the minimum element in a sorted and rotated array Assesments: assert find_Min([1,2,3,4,5],0,4) ==, 2",0.0,0.08547413858617178
"Prompt: Write a python function to remove the characters which have odd index values of a given string. Assesments: assert odd_values_string('abcdef') == 'ace', assert odd_values_string('python') == 'pto', assert odd_values_string('data') == 'dt'",57,0.034,35,1.6285714285714286,Prompt: Write a python function remove the characters which have odd index values of a given string Assesments: assert odd_values_string('abcdef') ==aceptodt',0.0,0.05001322329123158
"Prompt: Write a function to find minimum of three numbers. Assesments: assert min_of_three(10,20,0)==0, assert min_of_three(19,15,18)==15, assert min_of_three(-10,-20,-30)==-30",55,0.032,23,2.391304347826087,"Prompt: Write find minimum of three numbers Assesments assert min_of_three(10,20,0)==0",0.0,0.12782025839936717
"Prompt: Write a python function to check whether all the bits are unset in the given range or not. Assesments: assert all_Bits_Set_In_The_Given_Range(4,1,2) == True, assert all_Bits_Set_In_The_Given_Range(17,2,4) == True, assert all_Bits_Set_In_The_Given_Range(39,4,6) == False",90,0.032,43,2.0930232558139537,"Prompt: Write a python function check whether all the bits unset in the given range or Assesments: assert all_Bits_Set_In_The_Given_Range(4,1,2 == True, False",0.0,0.09739235000259801
"Prompt: Write a function to re-arrange the elements of the given array so that all negative elements appear before positive ones. Assesments: assert re_arrange_array([-1, 2, -3, 4, 5, 6, -7, 8, 9], 9) == [-1, -3, -7, 4, 5, 6, 2, 8, 9], assert re_arrange_array([12, -14, -26, 13, 15], 5) == [-14, -26, 12, 13, 15], assert re_arrange_array([10, 24, 36, -42, -39, -78, 85], 7) == [-42, -39, -78, 10, 24, 36, 85]",182,0.041,107,1.7009345794392523,"Prompt: Write a function to rearrange the elements of the given array so all negative elements appear before positive ones Assesments: assert re_arrange_array([-1 2, -3, 4, 5,, -7], 9) == [ -3 -7 4 2 8], assert re_arrange_array([12 -14 -26 13 15], 5-14 12 24 36 -42 -39 -78 85 7-42 10 85]",0.0,0.05739504998046123
"Prompt: Write a function to replace blank spaces with any character in a string. Assesments: assert replace_blank(""hello people"",'@')==(""hello@people""), assert replace_blank(""python program language"",'$')==(""python$program$language""), assert replace_blank(""blank space"",""-"")==(""blank-space"")",66,0.029,56,1.1785714285714286,"Prompt: Write a function replace blank spaces any character in Assesments: assert replace_blank(""hello people"",'@')==(""hello@people replace_blank(""python program language"",'$')==(""python$program$language replace_blank(""blank space"",""-"")==(""blank-space",0.0,0.004108339792987096
"Prompt: Write a function to find the maximum sum in the given right triangle of numbers. Assesments: assert max_sum([[1], [2,1], [3,3,2]], 3) == 6, assert max_sum([[1], [1, 2], [4, 1, 12]], 3) == 15 , assert max_sum([[2], [3,2], [13,23,12]], 3) == 28",99,0.032,64,1.546875,"Prompt: Write a function to find the maximum sum in the given right triangle of numbers Assesments: assert max_sum([[1],2,13,3,2] 3) == 6,1 24 1, 12 3 15 ,3,213,23,12 28",0.0,0.04167930098946696
"Prompt: Write a function to get the n largest items from a dataset. Assesments: assert larg_nnum([10, 20, 50, 70, 90, 20, 50, 40, 60, 80, 100],2)==[100,90], assert larg_nnum([10, 20, 50, 70, 90, 20, 50, 40, 60, 80, 100],5)==[100,90,80,70,60], assert larg_nnum([10, 20, 50, 70, 90, 20, 50, 40, 60, 80, 100],3)==[100,90,80]",159,0.034,83,1.9156626506024097,"Prompt: Write a function to get the n largest items from a dataset. Assesments: assert larg_nnum([10, 20, 50, 70, 90, 20, 50, 40 60, 80, 100],2)==[100,90], assert 20 100],5)==[100,90,80,70,60], assert]",0.0,0.07929964351501122
"Prompt: Write a function to find the lateral surface area of a cylinder. Assesments: assert lateralsuface_cylinder(10,5)==314.15000000000003, assert lateralsuface_cylinder(4,5)==125.66000000000001, assert lateralsuface_cylinder(4,10)==251.32000000000002",78,0.029,34,2.2941176470588234,"Prompt: Write a function find the lateral surface area a cylinder Assesments assert lateralsuface_cylinder(10,5)==314.15000000000003",0.0,0.11790616022981167
"Prompt: Write a function to find the volume of a cube. Assesments: assert volume_cube(3)==27, assert volume_cube(2)==8, assert volume_cube(5)==125",40,0.027,20,2.0,Prompt: Write a function find the volume a cube Assesments assert volume_cube(3)==27,0.0,0.0879029684008937
"Prompt: Write a python function to set all even bits of a given number. Assesments: assert even_bit_set_number(10) == 10, assert even_bit_set_number(20) == 30, assert even_bit_set_number(30) == 30",55,0.027,32,1.71875,"Prompt: Write a python function set all even bits a given number. Assesments: assert even_bit_set_number(10 10, 30 30",0.0,0.0592124162144909
"Prompt: Write a python function to count the maximum number of equilateral triangles that can be formed within a given equilateral triangle. Assesments: assert No_of_Triangle(4,2) == 7, assert No_of_Triangle(4,3) == 3, assert No_of_Triangle(1,3) == -1",71,0.03,37,1.9189189189189189,"Prompt: Write a python function count the maximum number equilateral triangles that formed within Assesments: assert No_of_Triangle(4,2 == 7, 3 -1",0.0,0.07963181822102983
"Prompt: Write a function to check the occurrences of records which occur similar times in the given tuples. Assesments: assert check_occurences([(3, 1), (1, 3), (2, 5), (5, 2), (6, 3)] ) == {(1, 3): 2, (2, 5): 2, (3, 6): 1}, assert check_occurences([(4, 2), (2, 4), (3, 6), (6, 3), (7, 4)] ) == {(2, 4): 2, (3, 6): 2, (4, 7): 1}, assert check_occurences([(13, 2), (11, 23), (12, 25), (25, 12), (16, 23)] ) == {(2, 13): 1, (11, 23): 1, (12, 25): 2, (16, 23): 1}",225,0.046,135,1.6666666666666667,"Prompt: Write a function to check the occurrences records which occur similar times in the given tuples. Assesments: assert check_occurences([(3, 1), (1 32 55 26 3)] ) == {(1 3): 2, (2 23 6 1}, assert check_occurences([(4 22 43 66 3),7 42 4 23 6 2 7 1 check_occurences([(13 211 2312 2525 1216 232 13 111 23 1,12 25 2,16 23 1}",0.0,0.05389935099478668
"Prompt: Write a python function to count number of non-empty substrings of a given string. Assesments: assert number_of_substrings(""abc"") == 6, assert number_of_substrings(""abcd"") == 10, assert number_of_substrings(""abcde"") == 15",59,0.031,36,1.6388888888888888,"Prompt: Write a python function to count number non-empty substrings of a given string. Assesments: assert number_of_substrings(""abc 6, 10 15",0.0,0.05106571621094442
"Prompt: Write a function to find the number of possible sequences of length n such that each of the next element is greater than or equal to twice of the previous element but less than or equal to m. Assesments: assert get_total_number_of_sequences(10, 4) == 4, assert get_total_number_of_sequences(5, 2) == 6, assert get_total_number_of_sequences(16, 3) == 84",92,0.038,51,1.803921568627451,"Prompt: Write a function find the number possible sequences of length n such each of the next element greater twice of but less m. Assesments: assert get_total_number_of_sequences(10 4 4, 2 6 3 84",0.0,0.0679008405149484
"Prompt: Write a function to replace the last element of the list with another list. Assesments: assert replace_list([1, 3, 5, 7, 9, 10],[2, 4, 6, 8])==[1, 3, 5, 7, 9, 2, 4, 6, 8], assert replace_list([1,2,3,4,5],[5,6,7,8])==[1,2,3,4,5,6,7,8], assert replace_list([""red"",""blue"",""green""],[""yellow""])==[""red"",""blue"",""yellow""]",142,0.037,72,1.9722222222222223,"Prompt: Write a function to replace the last element the list another list. Assesments: assert replace_list([1 3 5 7 9 10],[2 4 6 8])==[1 3 2,], assert replace_list([""red"",""blue"",""green""],[""yellow""])==[""red"",""blue"",""yellow",0.0,0.08506933361705146
"Prompt: Write a function to generate a 3d array having each element as '*'. Assesments: assert array_3d(6,4,3)==[[['*', '*', '*', '*', '*', '*'], ['*', '*', '*', '*', '*', '*'], ['*', '*', '*', '*', '*', '*'], ['*', '*', '*', '*', '*', '*']], [['*', '*', '*', '*', '*', '*'], ['*', '*', '*', '*', '*', '*'], ['*', '*', '*', '*', '*', '*'], ['*', '*', '*', '*', '*', '*']], [['*', '*', '*', '*', '*', '*'], ['*', '*', '*', '*', '*', '*'], ['*', '*', '*', '*', '*', '*'], ['*', '*', '*', '*', '*', '*']]], assert array_3d(5,3,4)==[[['*', '*', '*', '*', '*'], ['*', '*', '*', '*','*'], ['*', '*', '*', '*', '*']], [['*', '*', '*', '*', '*'],['*', '*', '*', '*', '*'], ['*', '*', '*', '*', '*']], [['*', '*', '*', '*', '*'], ['*', '*', '*', '*', '*'], ['*', '*', '*', '*', '*']], [['*', '*', '*', '*', '*'], ['*', '*', '*', '*', '*'], ['*', '*', '*', '*', '*']]], assert array_3d(1,2,3)==[[['*'],['*']],[['*'],['*']],[['*'],['*']]]",372,0.134,200,1.86,"Prompt: Write a function to generate a 3d array having each element as '*'. Assesments: assert array_3d(6,4,3)==[[['*', '*', '*', '*', '*', '*'], ['*', '*', '*',*',*',*'], ['*',*',',*',*','], ['*',*',',']], [['*', '*',*',',','], ['*',',','], ['*','], ['*',']], [['*','],','],','], ['',']]], assert array_3d(5,3,4)==[[['*',*',','],','*'],',',']], [['*'],['',',','], ['',']], [['','], ['','], ['',']], [['*','], ['','], ['',']]], assert array_3d(1,2,3)==[[['*'],['*']],[['*'],['*']],[['*'],['*']]]",0.0,0.07362144909032876
"Prompt: Write a function to count total characters in a string. Assesments: assert count_charac(""python programming"")==18, assert count_charac(""language"")==8, assert count_charac(""words"")==5",44,0.029,21,2.0952380952380953,"Prompt: Write a function count total characters Assesments: assert count_charac(""python programming"")==18",0.0,0.09761828765978144
"Prompt: Write a function to sort the given list based on the occurrence of first element of tuples. Assesments: assert sort_on_occurence([(1, 'Jake'), (2, 'Bob'), (1, 'Cara')]) == [(1, 'Jake', 'Cara', 2), (2, 'Bob', 1)], assert sort_on_occurence([('b', 'ball'), ('a', 'arm'), ('b', 'b'), ('a', 'ant')]) == [('b', 'ball', 'b', 2), ('a', 'arm', 'ant', 2)], assert sort_on_occurence([(2, 'Mark'), (3, 'Maze'), (2, 'Sara')]) == [(2, 'Mark', 'Sara', 2), (3, 'Maze', 1)]",175,0.048,103,1.6990291262135921,"Prompt: Write a function to sort the given list based the occurrence first element of tuples. Assesments: assert sort_on_occurence([(1 'Jake'), (Bob1Cara')]) == [(1Jake', 'Cara', 2),2Bob 1)], assert sort_on_occurence([('b', 'ball ('aarmbb'),aant') [bballb', 2', 'ant', 2)Mark (Maze2Sara') [(2Sara 2 1)]",0.0,0.057200673073049484
"Prompt: Write a python function to find the next perfect square greater than a given number. Assesments: assert next_Perfect_Square(35) == 36, assert next_Perfect_Square(6) == 9, assert next_Perfect_Square(9) == 16",60,0.031,35,1.7142857142857142,"Prompt: Write a python function find the next perfect square greater a given number Assesments: assert next_Perfect_Square(35) 36, 9 16",0.0,0.05875701062423053
"Prompt: Write a function to find the maximum sum of bi-tonic sub-sequence for the given array. Assesments: assert max_sum([1, 15, 51, 45, 33, 100, 12, 18, 9], 9) == 194, assert max_sum([80, 60, 30, 40, 20, 10], 6) == 210, assert max_sum([2, 3 ,14, 16, 21, 23, 29, 30], 8) == 138",123,0.036,76,1.618421052631579,"Prompt: Write a function find the maximum sum bitonic sub-sequence for the given array Assesments: assert max_sum([1 15 51 45 33 100 12 18 9 9 194, 60 30 40 20 10 6 210 ,14 16 21 23 29 30 138",0.0,0.04897777479127119
"Prompt: Write a function for computing square roots using the babylonian method. Assesments: assert babylonian_squareroot(10)==3.162277660168379, assert babylonian_squareroot(2)==1.414213562373095, assert babylonian_squareroot(9)==3.0",72,0.031,34,2.1176470588235294,Prompt: Write a function computing square roots the babylonian method Assesments assert babylonian_squareroot(10)==3.162277660168379,0.0,0.09990424513246089
"Prompt: Write a function to find the longest palindromic subsequence in the given string. Assesments: assert lps(""TENS FOR TENS"") == 5 , assert lps(""CARDIO FOR CARDS"") == 7, assert lps(""PART OF THE JOURNEY IS PART"") == 9",67,0.032,42,1.5952380952380953,"Prompt: Write a function find the longest palindromic subsequence Assesments: assert lps(""TENS FOR TENS 5 , lps(""CARDIO 7, OF IS PART"")",0.0,0.046612861550620895
"Prompt: Write a function to calculate the harmonic sum of n-1. Assesments: assert harmonic_sum(7) == 2.5928571428571425, assert harmonic_sum(4) == 2.083333333333333, assert harmonic_sum(19) == 3.547739657143682",67,0.03,48,1.3958333333333333,"Prompt: Write a function calculate the harmonic sum n-1. Assesments: assert harmonic_sum(7 2.5928571428571425, 2.083333333333333 3.547739657143682",0.0,0.026271411852324705
"Prompt: Write a function to find the intersection of two arrays using lambda function. Assesments: assert intersection_array([1, 2, 3, 5, 7, 8, 9, 10],[1, 2, 4, 8, 9])==[1, 2, 8, 9], assert intersection_array([1, 2, 3, 5, 7, 8, 9, 10],[3,5,7,9])==[3,5,7,9], assert intersection_array([1, 2, 3, 5, 7, 8, 9, 10],[10,20,30,40])==[10]",158,0.035,97,1.6288659793814433,"Prompt: Write a function to find the intersection of two arrays using lambda function. Assesments: assert intersection_array([1 2,, 5, 7, 8, 9, 10],[1 4 8 9])==[1 8], assert 3, 10],[3,5,7,9])==[3,5,7,9], 10],[10,20,30,40])==[10]",0.0,0.050043270670382785
"Prompt: Write a python function to count the occcurences of an element in a tuple. Assesments: assert count_X((10, 8, 5, 2, 10, 15, 10, 8, 5, 8, 8, 2),4) == 0, assert count_X((10, 8, 5, 2, 10, 15, 10, 8, 5, 8, 8, 2),10) == 3, assert count_X((10, 8, 5, 2, 10, 15, 10, 8, 5, 8, 8, 2),8) == 4",157,0.04,87,1.8045977011494252,"Prompt: Write a python function to count the occcurences an element in a tuple. Assesments: assert count_X((10, 8, 5, 2, 10, 15, 10, 8, 5, 8, 8, 2),4) == 0, assert count_X((10 8 2),10 3, 2),8 4",0.0,0.0679698133697275
"Prompt: Write a function to insert an element before each element of a list. Assesments: assert insert_element(['Red', 'Green', 'Black'] ,'c')==['c', 'Red', 'c', 'Green', 'c', 'Black'] , assert insert_element(['python', 'java'] ,'program')==['program', 'python', 'program', 'java'] , assert insert_element(['happy', 'sad'] ,'laugh')==['laugh', 'happy', 'laugh', 'sad']",106,0.039,78,1.358974358974359,"Prompt: Write a function to insert an element before each element of a list. Assesments: assert insert_element(['Red',GreenBlack ,'c')==['c',Redc',Greenc', , assert insert_element(['pythonjava']program')==['programpythonprogram',java , insert_element(['happysadlaugh')==['laughhappylaughsad",0.0,0.022511396466072496
"Prompt: Write a python function to convert complex numbers to polar coordinates. Assesments: assert convert(1) == (1.0, 0.0), assert convert(4) == (4.0,0.0), assert convert(5) == (5.0,0.0)",64,0.032,27,2.3703703703703702,"Prompt: Write a python function convert complex numbers polar coordinates Assesments: assert convert(1) == (,), convert(4)",0.0,0.1256847655187904
"Prompt: Write a python function to count integers from a given list. Assesments: assert count_integer([1,2,'abc',1.2]) == 2, assert count_integer([1,2,3]) == 3, assert count_integer([1,1.2,4,5.1]) == 2",69,0.03,36,1.9166666666666667,"Prompt: Write a python function count integers from a given list Assesments: assert count_integer([1,2,'abc',1.2 == 2,]) 2",0.0,0.07940206404936696
"Prompt: Write a function to find all words starting with 'a' or 'e' in a given string. Assesments: assert words_ae(""python programe"")==['ame'], assert words_ae(""python programe language"")==['ame','anguage'], assert words_ae(""assert statement"")==['assert', 'atement']",68,0.032,45,1.511111111111111,"Prompt: Write a function find all words starting 'a or 'e in a given string Assesments: assert words_ae(""python programe"")==['ame' language"")==['ame','anguage statement"")==['assertatement",0.0,0.038030996205270055
"Prompt: Write a function to choose specified number of colours from three different colours and generate all the combinations with repetitions. Assesments: assert combinations_colors( [""Red"",""Green"",""Blue""],1)==[('Red',), ('Green',), ('Blue',)], assert combinations_colors( [""Red"",""Green"",""Blue""],2)==[('Red', 'Red'), ('Red', 'Green'), ('Red', 'Blue'), ('Green', 'Green'), ('Green', 'Blue'), ('Blue', 'Blue')], assert combinations_colors( [""Red"",""Green"",""Blue""],3)==[('Red', 'Red', 'Red'), ('Red', 'Red', 'Green'), ('Red', 'Red', 'Blue'), ('Red', 'Green', 'Green'), ('Red', 'Green', 'Blue'), ('Red', 'Blue', 'Blue'), ('Green', 'Green', 'Green'), ('Green', 'Green', 'Blue'), ('Green', 'Blue', 'Blue'), ('Blue', 'Blue', 'Blue')]",208,0.057,127,1.6377952755905512,"Prompt: Write a function to choose specified number colours from three different colours and generate all the combinations with repetitions. Assesments: assert combinations_colors( [""Red"",""Green"",""Blue""],1)==[('Red',), ('Green), (')], assert combinations_colors [""Red"",""Green"",""Blue""],2)==[('Red 'Red'), ('Red 'Green ('Red 'Green 'GreenGreenBlue 'Blue')], assert combinations_colors ["" '', 'RedRedRed', 'GreenRed',BlueRedGreen',GreenRedGreen',RedBlue',Blue'),GreenGreen',GreenGreenGreen',BlueGreenBlue',BlueBlue',Blue')]",0.0,0.0509541557863837
"Prompt: Write a python function to count the number of prime numbers less than a given non-negative number. Assesments: assert count_Primes_nums(5) == 2, assert count_Primes_nums(10) == 4, assert count_Primes_nums(100) == 25",60,0.031,35,1.7142857142857142,"Prompt: Write a python function to count prime numbers less a given non-negative number Assesments: assert count_Primes_nums(5 2, assert 4 25",0.0,0.05875701062423053
"Prompt: Write a function to swap two numbers. Assesments: assert swap_numbers(10,20)==(20,10), assert swap_numbers(15,17)==(17,15), assert swap_numbers(100,200)==(200,100)",53,0.029,25,2.12,"Prompt: Write a function swap two numbers Assesments: assert swap_numbers(10,20)==(20,10)",0.0,0.10014427066709225
"Prompt: Write a function to find number of odd elements in the given list using lambda function. Assesments: assert count_odd([1, 2, 3, 5, 7, 8, 10])==4, assert count_odd([10,15,14,13,-18,12,-20])==2, assert count_odd([1, 2, 4, 8, 9])==2",94,0.031,60,1.5666666666666667,"Prompt: Write a function find number odd elements the given list using lambda function Assesments: assert count_odd([1 5 10])==4, assert count_odd([10,15,14,13,-18,12,-20])==2 2 4 8",0.0,0.04369826577295456
"Prompt: Write a function to maximize the given two tuples. Assesments: assert maximize_elements(((1, 3), (4, 5), (2, 9), (1, 10)), ((6, 7), (3, 9), (1, 1), (7, 3))) == ((6, 7), (4, 9), (2, 9), (7, 10)), assert maximize_elements(((2, 4), (5, 6), (3, 10), (2, 11)), ((7, 8), (4, 10), (2, 2), (8, 4))) == ((7, 8), (5, 10), (3, 10), (8, 11)), assert maximize_elements(((3, 5), (6, 7), (4, 11), (3, 12)), ((8, 9), (5, 11), (3, 3), (9, 5))) == ((8, 9), (6, 11), (4, 11), (9, 12))",244,0.055,132,1.8484848484848484,"Prompt: Write a function to maximize the given two tuples. Assesments: assert maximize_elements(((1, 3), (4 5), (2 9),1 10)), ((6 7 (3 91 1), (7 3))) == ((6 74 92 97 10)), assert maximize_elements(((2 45 63 10),2 11)),7 8)4 102 28 4)))75 103 108 11 assert maximize_elements(((3 56 74 113 128 95 113 39 5)))86 114 119 12))",0.0,0.07244677867084505
"Prompt: Write a function to find the nth newman–shanks–williams prime number. Assesments: assert newman_prime(3) == 7 , assert newman_prime(4) == 17, assert newman_prime(5) == 41",56,0.033,34,1.6470588235294117,"Prompt: Write a function find the nth newman–shanks–williams prime Assesments assert newman_prime(3 7 , 17, 41",0.0,0.05189913820619214
"Prompt: Write a function to perform mathematical division operation across the given tuples. Assesments: assert division_elements((10, 4, 6, 9),(5, 2, 3, 3)) == (2, 2, 2, 3), assert division_elements((12, 6, 8, 16),(6, 3, 4, 4)) == (2, 2, 2, 4), assert division_elements((20, 14, 36, 18),(5, 7, 6, 9)) == (4, 2, 6, 2)",136,0.039,83,1.6385542168674698,"Prompt: Write a function to perform mathematical division operation across the given tuples Assesments: assert division_elements((10 4, 6, 9),(5 2 3 3 == (2 2 3), assert 6 8 16),(6 3 42 4 14 36 18),(5 7 6 94 2 6 2)",0.0,0.051031576032825834
"Prompt: Write a function to split a given list into two parts where the length of the first part of the list is given. Assesments: assert split_two_parts([1,1,2,3,4,4,5,1],3)==([1, 1, 2], [3, 4, 4, 5, 1]), assert split_two_parts(['a', 'b', 'c', 'd'],2)==(['a', 'b'], ['c', 'd']), assert split_two_parts(['p', 'y', 't', 'h', 'o', 'n'],4)==(['p', 'y', 't', 'h'], ['o', 'n'])",149,0.042,102,1.4607843137254901,"Prompt: Write a function to split a given list into two parts where the length of the first part of given. Assesments: assert split_two_parts([1,1,2,3,4,4,5,1],3)==([1 1 2], [3 4 4,, 1]), assert split_two_parts(['ad'],2)==(['a' ['c'] assert split_two_parts(['pyt',h',on'],4)==(['p' ['o])",0.0,0.03289711671454409
"Prompt: Write a function to merge two dictionaries. Assesments: assert merge_dict({'a': 100, 'b': 200},{'x': 300, 'y': 200})=={'x': 300, 'y': 200, 'a': 100, 'b': 200}, assert merge_dict({'a':900,'b':900,'d':900},{'a':900,'b':900,'d':900})=={'a':900,'b':900,'d':900,'a':900,'b':900,'d':900}, assert merge_dict({'a':10,'b':20},{'x':30,'y':40})=={'x':30,'y':40,'a':10,'b':20}",160,0.036,135,1.1851851851851851,"Prompt: Write a function to merge two dictionaries. Assesments: assert merge_dict({'a 100, 200},{'x 300 200})=={'x 300,a 100,}, assert merge_dict({'a':900,'b':900,'d':900},{'a':900,'b':900,'d':900})=={'a':900,'b':900,'d':900,'a':900,'b':900,'d':900}, merge_dict({'a':10,'b':20},{'x':30,'y':40})=={'x':30,'y':40,'a':10,'b':20}",0.0,0.004783014741520955
"Prompt: Write a function to calculate a dog's age in dog's years. Assesments: assert dog_age(12)==61, assert dog_age(15)==73, assert dog_age(24)==109",41,0.029,21,1.9523809523809523,Prompt: Write a function calculate a dog's age dog's years Assesments assert dog_age(12)==61,0.0,0.08304530877144985
"Prompt: Write a function to split a list for every nth element. Assesments: assert list_split(['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n'],3)==[['a', 'd', 'g', 'j', 'm'], ['b', 'e', 'h', 'k', 'n'], ['c', 'f', 'i', 'l']] , assert list_split([1,2,3,4,5,6,7,8,9,10,11,12,13,14],3)==[[1,4,7,10,13], [2,5,8,11,14], [3,6,9,12]] , assert list_split(['python','java','C','C++','DBMS','SQL'],2)==[['python', 'C', 'DBMS'], ['java', 'C++', 'SQL']]",214,0.047,149,1.436241610738255,"Prompt: Write a function to split a list for every nth element. Assesments: assert list_split(['a',',',',',',n'],3)==[['a 'dgjm' ['behkn' ['fil']] , assert list_split([1,2,3,4,5,6,7,8,9,10,11,12,13,14],3)==[[1,4,7,10,13], [2,5,8,11,14],3,6,9,12]] , assert list_split(['python','java','C','C++','DBMS','SQL'],2)==[['python',C',DBMS' ['java',C++',SQL']]",0.0,0.030393494667075097
"Prompt: Write a function to find the lateral surface area of a cube. Assesments: assert lateralsurface_cube(5)==100, assert lateralsurface_cube(9)==324, assert lateralsurface_cube(10)==400",48,0.03,24,2.0,Prompt: Write a function find the lateral surface area a cube Assesments assert lateralsurface_cube(5)==100,0.0,0.0879029684008937
"Prompt: Write a python function to find the sum of squares of first n odd natural numbers. Assesments: assert square_Sum(2) == 10, assert square_Sum(3) == 35, assert square_Sum(4) == 84",55,0.03,33,1.6666666666666667,"Prompt: Write a python function find the sum squares first n odd natural numbers Assesments: assert square_Sum(2) 10, 35 84",0.0,0.05389935099478668
"Prompt: Write a function to find the n'th star number. Assesments: assert find_star_num(3) == 37, assert find_star_num(4) == 73, assert find_star_num(5) == 121",49,0.032,29,1.6896551724137931,"Prompt: Write a function find the n'th star number. Assesments: assert find_star_num(3 37, 73 121",0.0,0.05624442805727682
"Prompt: Write a function to find the ascii value of a character. Assesments: assert ascii_value('A')==65, assert ascii_value('R')==82, assert ascii_value('S')==83",44,0.029,21,2.0952380952380953,Prompt: Write a function find the ascii value Assesments: assert ascii_value('A')==65,0.0,0.09761828765978144
"Prompt: Write a python function to find the sum of even numbers at even positions. Assesments: assert sum_even_and_even_index([5, 6, 12, 1, 18, 8],6) == 30, assert sum_even_and_even_index([3, 20, 17, 9, 2, 10, 18, 13, 6, 18],10) == 26, assert sum_even_and_even_index([5, 6, 12, 1],4) == 12",116,0.035,71,1.6338028169014085,"Prompt: Write a python function find the sum even numbers at even positions Assesments: assert sum_even_and_even_index([5 6 12 1 18 8],6) == 30, 20 17 9 2 10 18 13 6 18],10 26 1],4 12",0.0,0.05054688167305782
"Prompt: Write a python function to find the sum of fifth power of first n even natural numbers. Assesments: assert even_Power_Sum(2) == 1056, assert even_Power_Sum(3) == 8832, assert even_Power_Sum(1) == 32",64,0.031,38,1.6842105263157894,"Prompt: Write a python function find the sum fifth power of first n even natural numbers Assesments: assert even_Power_Sum(2 1056, 8832 32",0.0,0.0556890150687923
"Prompt: Write a function to perfom the rear element extraction from list of tuples records. Assesments: assert rear_extract([(1, 'Rash', 21), (2, 'Varsha', 20), (3, 'Kil', 19)]) == [21, 20, 19], assert rear_extract([(1, 'Sai', 36), (2, 'Ayesha', 25), (3, 'Salman', 45)]) == [36, 25, 45], assert rear_extract([(1, 'Sudeep', 14), (2, 'Vandana', 36), (3, 'Dawood', 56)]) == [14, 36, 56]",152,0.048,93,1.6344086021505377,"Prompt: Write a function to perfom the rear element extraction from list of tuples records. Assesments: assert rear_extract([(1, 'Rash', 21), (2Varsha 20Kil', 19)]) == [21, 20, 19], assertSai 36Ayesha 25Salman 45)36 25],Sudeep', 14Vandana 36Dawood 5614 36]",0.0,0.05060867834258278
"Prompt: Write a function to substract the contents of one tuple with corresponding index of other tuple. Assesments: assert substract_elements((10, 4, 5), (2, 5, 18)) == (8, -1, -13), assert substract_elements((11, 2, 3), (24, 45 ,16)) == (-13, -43, -13), assert substract_elements((7, 18, 9), (10, 11, 12)) == (-3, 7, -3)",119,0.038,73,1.63013698630137,"Prompt: Write a function substract the contents one tuple with corresponding index of other tuple Assesments: assert substract_elements((10 4, 5 (2 5 18 == (8 -1 -13 assert 2 324 45 ,16 (-13 -43 -13 18 910 11 12-3 7)",0.0,0.05017292716945988
"Prompt: Write a python function to find sum of even index binomial coefficients. Assesments: assert even_binomial_Coeff_Sum(4) == 8, assert even_binomial_Coeff_Sum(6) == 32, assert even_binomial_Coeff_Sum(2) == 2",67,0.032,36,1.8611111111111112,"Prompt: Write a python function find sum even index binomial coefficients Assesments: assert even_binomial_Coeff_Sum(4) 8, 32 2",0.0,0.07373479448168245
"Prompt: Write a python function to find the position of the last removed element from the given array. Assesments: assert get_Position([2,5,4],3,2) == 2, assert get_Position([4,3],2,2) == 2, assert get_Position([1,2,3,4],4,1) == 4",77,0.031,41,1.8780487804878048,"Prompt: Write a python function find the position the last removed element from the given array Assesments: assert get_Position([2,5,4],3,2) 2, assert 2",0.0,0.07546262056939113
"Prompt: Write a function to find the volume of a cylinder. Assesments: assert volume_cylinder(10,5)==1570.7500000000002, assert volume_cylinder(4,5)==251.32000000000002, assert volume_cylinder(4,10)==502.64000000000004",68,0.03,30,2.2666666666666666,"Prompt: Write a function find the volume a cylinder Assesments assert volume_cylinder(10,5)==1570.7500000000002",0.0,0.11510586232577932
"Prompt: Write a function to filter a dictionary based on values. Assesments: assert dict_filter({'Cierra Vega': 175, 'Alden Cantrell': 180, 'Kierra Gentry': 165, 'Pierre Cox': 190},170)=={'Cierra Vega': 175, 'Alden Cantrell': 180, 'Pierre Cox': 190}, assert dict_filter({'Cierra Vega': 175, 'Alden Cantrell': 180, 'Kierra Gentry': 165, 'Pierre Cox': 190},180)=={ 'Alden Cantrell': 180, 'Pierre Cox': 190}, assert dict_filter({'Cierra Vega': 175, 'Alden Cantrell': 180, 'Kierra Gentry': 165, 'Pierre Cox': 190},190)=={ 'Pierre Cox': 190}",180,0.048,113,1.592920353982301,"Prompt: Write a function to filter a dictionary based values. Assesments: assert dict_filter({'Cierra Vega': 175, 'Alden Cantrell': 180, 'Kierra Gentry 165,Pierre Cox': 190},170)=={'Cierra Vega': 175,Pierre Cox}, assert dict_filter({'Cierra 175Kierra 190},180)=={ 'Alden Cantrell 180,Pierre Cox 190}, assert dict_filter({'Cierra 175Kierra 190},190)== 'Pierre Cox 190}",0.0,0.046376426789895744
"Prompt: Write a function to find the element count that occurs before the record in the given tuple. Assesments: assert count_first_elements((1, 5, 7, (4, 6), 10) ) == 3, assert count_first_elements((2, 9, (5, 7), 11) ) == 2, assert count_first_elements((11, 15, 5, 8, (2, 3), 8) ) == 4",104,0.035,60,1.7333333333333334,"Prompt: Write a function find the element count that occurs before the record in the given tuple Assesments: assert count_first_elements((1 5, 7 (4 6 10) ) 3, 9 (5 11 15 5,2 3 4",0.0,0.06070007447600809
"Prompt: Write a function to find the nth decagonal number. Assesments: assert is_num_decagonal(3) == 27, assert is_num_decagonal(7) == 175, assert is_num_decagonal(10) == 370",52,0.031,30,1.7333333333333334,"Prompt: Write a function find the nth decagonal number. Assesments: assert is_num_decagonal(3 27, 175 370",0.0,0.06070007447600809
"Prompt: Write a function to search an element in the given array by using sequential search. Assesments: assert sequential_search([11,23,58,31,56,77,43,12,65,19],31) == (True, 3), assert sequential_search([12, 32, 45, 62, 35, 47, 44, 61],61) == (True, 7), assert sequential_search([9, 10, 17, 19, 22, 39, 48, 56],48) == (True, 6)",127,0.036,88,1.4431818181818181,"Prompt: Write a function search an element in the given array by using sequential search Assesments: assert sequential_search([11,23,58,31,56,77,43,12,65,19],31) == (True 3 32 45 62 35 47 44 61],61 7 10 17 19 22 39 48 56],48 6)",0.0,0.03110147114296491
"Prompt: Write a python function to check if the elements of a given list are unique or not. Assesments: assert all_unique([1,2,3]) == True, assert all_unique([1,2,1,2]) == False, assert all_unique([1,2,3,4,5]) == True",68,0.032,42,1.619047619047619,"Prompt: Write a python function to check the elements of a given list unique or Assesments: assert all_unique([1,2,3 == True, all_unique([1,2,1,2",0.0,0.04904169136534282
"Prompt: Write a function to substaract two lists using map and lambda function. Assesments: assert sub_list([1, 2, 3],[4,5,6])==[-3,-3,-3], assert sub_list([1,2],[3,4])==[-2,-2], assert sub_list([90,120],[50,70])==[40,50]",83,0.034,25,3.32,Prompt: Write a function substaract two lists using map and lambda function Assesments: assert sub_list([1 assert,0.0,0.2225572933290775
"Prompt: Write a python function to check whether the frequency of each digit is less than or equal to the digit itself. Assesments: assert validate(1234) == True, assert validate(51241) == False, assert validate(321) == True",53,0.03,36,1.4722222222222223,"Prompt: Write a python function check whether the frequency each digit less the digit itself Assesments: assert validate(1234 == True, validate(51241 assert validate(321",0.0,0.034063907507890914
"Prompt: Write a function to check whether all items of a list are equal to a given string. Assesments: assert check_element([""green"", ""orange"", ""black"", ""white""],'blue')==False, assert check_element([1,2,3,4],7)==False, assert check_element([""green"", ""green"", ""green"", ""green""],'green')==True",81,0.032,62,1.3064516129032258,"Prompt: Write a function to check whether all items of a list equal to a given string Assesments: assert check_element([""greenorangeblackwhite""],'blue')==False, check_element([1,2,3,4],7)==Falsegreengreengreen""],'green')==True",0.0,0.017153506378509716
"Prompt: Write a function that matches a string that has an a followed by two to three 'b'. Assesments: assert text_match_two_three(""ac"")==('Not matched!'), assert text_match_two_three(""dc"")==('Not matched!'), assert text_match_two_three(""abbbba"")==('Found a match!')",67,0.03,46,1.4565217391304348,"Prompt: Write a function matches a string that has an a followed two to three 'b Assesments: assert text_match_two_three(""ac"")==('Not matched!' text_match_two_three(""abbbba"")==('Found!",0.0,0.03246228784745833
"Prompt: Write a function to find the largest sum of contiguous array in the modified array which is formed by repeating the given array k times. Assesments: assert max_sub_array_sum_repeated([10, 20, -30, -1], 4, 3) == 30, assert max_sub_array_sum_repeated([-1, 10, 20], 3, 2) == 59, assert max_sub_array_sum_repeated([-1, -2, -3], 3, 3) == -1",112,0.037,64,1.75,"Prompt: Write a function find the largest sum contiguous array in the modified array which formed repeating the given array k times Assesments: assert max_sub_array_sum_repeated([10 20 -30 -1 4 3) == 30, 10 3 59, -2 3 -1",0.0,0.06240025534631343
"Prompt: Write a python function to find the sum of squares of first n even natural numbers. Assesments: assert square_Sum(2) == 20, assert square_Sum(3) == 56, assert square_Sum(4) == 120",55,0.033,33,1.6666666666666667,"Prompt: Write a python function find the sum squares first n even natural numbers Assesments: assert square_Sum(2) 20, 56 120",0.0,0.05389935099478668
"Prompt: Write a function to count array elements having modular inverse under given prime number p equal to itself. Assesments: assert modular_inverse([ 1, 6, 4, 5 ], 4, 7) == 2, assert modular_inverse([1, 3, 8, 12, 12], 5, 13) == 3, assert modular_inverse([2, 3, 4, 5], 4, 6) == 1",103,0.034,59,1.7457627118644068,"Prompt: Write a function count array elements having modular inverse under given prime number p equal itself Assesments: assert modular_inverse([ 1 6 4 5 4 7) == 2, 3 8 12 12 5 13 4 1",0.0,0.06196800597250699
"Prompt: Write a python function to calculate the number of odd days in a given year. Assesments: assert odd_Days(100) == 5, assert odd_Days(50) ==6, assert odd_Days(75) == 2",53,0.028,29,1.8275862068965518,"Prompt: Write a python function calculate the number odd days in Assesments: assert odd_Days(100) 5,6 2",0.0,0.07031489043221767
"Prompt: Write a function to find the list of lists with maximum length. Assesments: assert max_length([[0], [1, 3], [5, 7], [9, 11], [13, 15, 17]])==(3, [13, 15, 17]), assert max_length([[1], [5, 7], [10, 12, 14,15]])==(4, [10, 12, 14,15]), assert max_length([[5], [15,20,25]])==(3, [15,20,25])",124,0.036,67,1.8507462686567164,"Prompt: Write a function to find the list lists with maximum length. Assesments: assert max_length([[0], [, 35 79 1113 15, 17]])==(3, [13 15]), assert510 12, 14,15]])==(41015,20,25]])==(3])",0.0,0.07267746806980101
"Prompt: Write a function to find out the number of ways of painting the fence such that at most 2 adjacent posts have the same color for the given fence with n posts and k colors. Assesments: assert count_no_of_ways(2, 4) == 16, assert count_no_of_ways(3, 2) == 6, assert count_no_of_ways(4, 4) == 228",90,0.034,49,1.836734693877551,"Prompt: Write a function find ways of painting the fence such at most 2 adjacent posts for the given fence with n posts and k colors Assesments: assert count_no_of_ways(2 4 16, 6 228",0.0,0.07124813538565762
"Prompt: Write a python function to find quotient of two numbers. Assesments: assert find(10,3) == 3, assert find(4,2) == 2, assert find(20,5) == 4",49,0.03,28,1.75,"Prompt: Write a python function find quotient two numbers Assesments: assert find(10,3 3, assert 2 4",0.0,0.06240025534631343
"Prompt: Write a function to find the third side of a right angled triangle. Assesments: assert otherside_rightangle(7,8)==10.63014581273465, assert otherside_rightangle(3,4)==5, assert otherside_rightangle(7,15)==16.55294535724685",67,0.033,32,2.09375,"Prompt: Write find the third side a right angled triangle Assesments assert otherside_rightangle(7,8)==10.63014581273465,",0.0,0.09746648579636132
"Prompt: Write a function to find the maximum value in a given heterogeneous list. Assesments: assert max_val(['Python', 3, 2, 4, 5, 'version'])==5, assert max_val(['Python', 15, 20, 25])==25, assert max_val(['Python', 30, 20, 40, 50, 'version'])==50",85,0.034,51,1.6666666666666667,"Prompt: Write a function find the maximum value in a given heterogeneous list Assesments: assert max_val(['Python 3 2 4 'version'])==5, 15 20 25])==25 30 20 40,,",0.0,0.05389935099478668
"Prompt: Write a function to return the sum of all divisors of a number. Assesments: assert sum_div(8)==7, assert sum_div(12)==16, assert sum_div(7)==1",44,0.029,22,2.0,"Prompt: Write a function return the sum a number Assesments: assert sum_div(8)==7,",0.0,0.0879029684008937
"Prompt: Write a python function to count inversions in an array. Assesments: assert get_Inv_Count([1,20,6,4,5],5) == 5, assert get_Inv_Count([1,2,1],3) == 1, assert get_Inv_Count([1,2,5,6,1],5) == 3",79,0.033,40,1.975,"Prompt: Write a python function count inversions in an array Assesments: assert get_Inv_Count([1,20,6,4,5],5 5, 1 3",0.0,0.08535269709543569
"Prompt: Write a function to flatten a given nested list structure. Assesments: assert flatten_list([0, 10, [20, 30], 40, 50, [60, 70, 80], [90, 100, 110, 120]])==[0, 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 110, 120], assert flatten_list([[10, 20], [40], [30, 56, 25], [10, 20], [33], [40]])==[10, 20, 40, 30, 56, 25, 10, 20, 33, 40], assert flatten_list([[1,2,3], [4,5,6], [10,11,12], [7,8,9]])==[1, 2, 3, 4, 5, 6, 10, 11, 12, 7, 8, 9]",231,0.047,144,1.6041666666666667,"Prompt: Write a function to flatten a given nested list structure. Assesments: assert flatten_list([0 10, [20 30 40, 50, [60 70, [90, 100, 110, 120]])==[0, 10 20 40 60 70, 110], assert flatten_list([[10 20], [40],30, 56, 2510 2033],40]])==[10 40 30 56 10 33 40], flatten_list([[1,2,34,5,610,11,127,8,9]])==[1 4 10 7 8]",0.0,0.047523672731141615
"Prompt: Write a function to find the nested list elements which are present in another list. Assesments: assert intersection_nested_lists( [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14],[[12, 18, 23, 25, 45], [7, 11, 19, 24, 28], [1, 5, 8, 18, 15, 16]])==[[12], [7, 11], [1, 5, 8]], assert intersection_nested_lists([[2, 3, 1], [4, 5], [6, 8]], [[4, 5], [6, 8]])==[[], []], assert intersection_nested_lists(['john','amal','joel','george'],[['john'],['jack','john','mary'],['howard','john'],['jude']])==[['john'], ['john'], ['john'], []]",226,0.048,147,1.5374149659863945,"Prompt: Write a function to find the nested list elements which are present another list. Assesments: assert intersection_nested_lists( [1, 14],[[12 18 23 25 45], [7 11 19 24 281 5 8 18 15, 16]])==[[12], [7 11],1 8]], assert intersection_nested_lists([[2 3 14 56 8]4 56 8]])==], []], assert intersection_nested_lists(['john','amal','joel','george'],[['john'],['jack','john','mary'],['howard','john'],['jude']])==[['john'johnjohn []]",0.0,0.04071427485772476
"Prompt: Write a function to calculate the maximum aggregate from the list of tuples. Assesments: assert max_aggregate([('Juan Whelan',90),('Sabah Colley',88),('Peter Nichols',7),('Juan Whelan',122),('Sabah Colley',84)])==('Juan Whelan', 212), assert max_aggregate([('Juan Whelan',50),('Sabah Colley',48),('Peter Nichols',37),('Juan Whelan',22),('Sabah Colley',14)])==('Juan Whelan', 72), assert max_aggregate([('Juan Whelan',10),('Sabah Colley',20),('Peter Nichols',30),('Juan Whelan',40),('Sabah Colley',50)])==('Sabah Colley', 70)",179,0.037,73,2.452054794520548,"Prompt: Write a function calculate the maximum aggregate from the list tuples Assesments: assert max_aggregate([('Juan Whelan',90),('Sabah Colley',88),('Peter Nichols',7),('Juan Whelan',122),('Sabah Colley',84)])==('Juan Whelan 212 assert 72 70",0.0,0.13401746323931282
"Prompt: Write a function to find the count of all binary sequences of length 2n such that sum of first n bits is same as sum of last n bits. Assesments: assert count_binary_seq(1) == 2.0, assert count_binary_seq(2) == 6.0, assert count_binary_seq(3) == 20.0",76,0.033,45,1.6888888888888889,"Prompt: Write a function find the count all binary sequences of length 2n such that sum of first n bits same Assesments: assert count_binary_seq(1) == 2.0, 6.0",0.0,0.05616625882186048
"Prompt: Write a function to find the depth of a dictionary. Assesments: assert dict_depth({'a':1, 'b': {'c': {'d': {}}}})==4, assert dict_depth({'a':1, 'b': {'c':'python'}})==2, assert dict_depth({1: 'Sun', 2: {3: {4:'Mon'}}})==3",82,0.032,52,1.5769230769230769,"Prompt: Write a function to find the depth a dictionary. Assesments: assert dict_depth({'a':1 {c { {}}}})==4,c':'python'}})==2 dict_depth({1 'Sun3 {4:'Mon'}}})==3",0.0,0.0447445309239117
"Prompt: Write a python function to find the most significant bit number which is also a set bit. Assesments: assert set_Bit_Number(6) == 4, assert set_Bit_Number(10) == 8, assert set_Bit_Number(18) == 16",59,0.031,35,1.6857142857142857,"Prompt: Write a python function find the most significant bit number which also a set bit Assesments: assert set_Bit_Number(6 4, 8 16",0.0,0.05584241484656422
"Prompt: Write a python function to check whether the count of inversion of two types are same or not. Assesments: assert solve([1,0,2],3) == True, assert solve([1,2,0],3) == False, assert solve([1,2,1],3) == True",66,0.03,34,1.9411764705882353,"Prompt: Write a python function check whether the count inversion of two types are same not Assesments: assert solve([1,0,2],3 == True,",0.0,0.08190233003511012
"Prompt: Write a python function to find element at a given index after number of rotations. Assesments: assert find_Element([1,2,3,4,5],[[0,2],[0,3]],2,1) == 3, assert find_Element([1,2,3,4],[[0,1],[0,2]],1,2) == 3, assert find_Element([1,2,3,4,5,6],[[0,1],[0,2]],1,1) == 1",114,0.03,48,2.375,"Prompt: Write a python function find element at after number rotations Assesments: assert find_Element([1,2,3,4,5],[[0,2],[0,3]],2,1 3, assert 1",0.0,0.12615703798276412
"Prompt: Write a function to match two words from a list of words starting with letter 'p'. Assesments: assert start_withp([""Python PHP"", ""Java JavaScript"", ""c c++""])==('Python', 'PHP'), assert start_withp([""Python Programming"",""Java Programming""])==('Python','Programming'), assert start_withp([""Pqrst Pqr"",""qrstuv""])==('Pqrst','Pqr')",87,0.033,54,1.6111111111111112,"Prompt: Write a function match two words from words starting letter 'p Assesments: assert start_withp([""Python PHP ""Java JavaScriptc c++""])==('PythonPHP Programming"",""Java Programming""])==('Python','Programming start_withp([""Pqrst')",0.0,0.048232081427102176
"Prompt: Write a function to find the maximum sum of increasing subsequence from prefix till ith index and also including a given kth element which is after i, i.e., k > i . Assesments: assert max_sum_increasing_subseq([1, 101, 2, 3, 100, 4, 5 ], 7, 4, 6) == 11, assert max_sum_increasing_subseq([1, 101, 2, 3, 100, 4, 5 ], 7, 2, 5) == 7, assert max_sum_increasing_subseq([11, 15, 19, 21, 26, 28, 31], 7, 2, 4) == 71",164,0.039,91,1.8021978021978022,"Prompt: Write a function find the maximum sum increasing subsequence from prefix till ith index and also including a given kth element which after i, i.e., k > i . Assesments: assert max_sum_increasing_subseq([1 101 2 100 4 ], 7 4 6) == 11, assert 2 5 7 15 19 21 26 31 2 4 71",0.0,0.0677249976324346
"Prompt: Write a function to get a colon of a tuple. Assesments: assert colon_tuplex((""HELLO"", 5, [], True) ,2,50)==(""HELLO"", 5, [50], True) , assert colon_tuplex((""HELLO"", 5, [], True) ,2,100)==((""HELLO"", 5, [100],True)), assert colon_tuplex((""HELLO"", 5, [], True) ,2,500)==(""HELLO"", 5, [500], True)",114,0.035,63,1.8095238095238095,"Prompt: Write a function to get a colon of a tuple. Assesments: assert colon_tuplex((""HELLO"", 5, [], True) ,2,50)==(""HELLO 5 [50], True , assert 5 True2,100)==((""HELLO100],True)), True",0.0,0.06847232988311826
"Prompt: Write a function to find the specified number of largest products from two given lists. Assesments: assert large_product([1, 2, 3, 4, 5, 6],[3, 6, 8, 9, 10, 6],3)==[60, 54, 50], assert large_product([1, 2, 3, 4, 5, 6],[3, 6, 8, 9, 10, 6],4)==[60, 54, 50, 48], assert large_product([1, 2, 3, 4, 5, 6],[3, 6, 8, 9, 10, 6],5)==[60, 54, 50, 48, 45]",178,0.037,89,2.0,"Prompt: Write a function to find the specified number largest products from two given lists. Assesments: assert large_product([1, 2,,,, 6],[3, 6, 8, 9,, 6],3)==[60, 54, 50], assert large_product([1 2 6],[3 6],4)==[60 54, 48], assert 48, 45]",0.0,0.0879029684008937
"Prompt: Write a python function to find the maximum of two numbers. Assesments: assert maximum(5,10) == 10, assert maximum(-1,-2) == -1, assert maximum(9,7) == 9",50,0.029,30,1.6666666666666667,"Prompt: Write a python function find the maximum of two numbers Assesments: assert maximum(5,10 10, maximum(-1,-2",0.0,0.05389935099478668
"Prompt: Write a function to convert a given string to a tuple. Assesments: assert string_to_tuple(""python 3.0"")==('p', 'y', 't', 'h', 'o', 'n', '3', '.', '0'), assert string_to_tuple(""item1"")==('i', 't', 'e', 'm', '1'), assert string_to_tuple(""15.10"")==('1', '5', '.', '1', '0')",99,0.035,63,1.5714285714285714,"Prompt: Write a function to convert a given string a tuple. Assesments: assert string_to_tuple(""python 3.0"")==('p',yt',hon3.',0'), string_to_tuple(""item1"")==('item1 string_to_tuple(""15.10"")==('15.'1',0')",0.0,0.04418403173589895
"Prompt: Write a python function to set the left most unset bit. Assesments: assert set_left_most_unset_bit(10) == 14, assert set_left_most_unset_bit(12) == 14, assert set_left_most_unset_bit(15) == 15",62,0.031,32,1.9375,"Prompt: Write a python function set the left most unset bit Assesments: assert set_left_most_unset_bit(10 == 14, 15",0.0,0.08152729013724865
"Prompt: Write a function to find the volume of a cone. Assesments: assert volume_cone(5,12)==314.15926535897927, assert volume_cone(10,15)==1570.7963267948965, assert volume_cone(19,17)==6426.651371693521",68,0.028,29,2.3448275862068964,"Prompt: Write a function find the volume a cone Assesments assert volume_cone(5,12)==314.15926535897927",0.0,0.12307912433824579
"Prompt: Write a python function to print positive numbers in a list. Assesments: assert pos_nos([-1,-2,1,2]) == 1,2, assert pos_nos([3,4,-5]) == 3,4, assert pos_nos([-2,-3,1]) == 1",68,0.029,45,1.511111111111111,"Prompt: Write a python function print positive numbers in a list Assesments: assert pos_nos([-1,-2,1,2 == 1,2 assert pos_nos([3,4,-5 1",0.0,0.038030996205270055
"Prompt: Write a function to find out the maximum sum such that no two chosen numbers are adjacent for the given rectangular grid of dimension 2 x n. Assesments: assert max_sum_rectangular_grid([ [1, 4, 5], [2, 0, 0 ] ], 3) == 7, assert max_sum_rectangular_grid([ [ 1, 2, 3, 4, 5], [ 6, 7, 8, 9, 10] ], 5) == 24, assert max_sum_rectangular_grid([ [7, 9, 11, 15, 19], [21, 25, 28, 31, 32] ], 5) == 81",159,0.039,93,1.7096774193548387,"Prompt: Write a function to find out the maximum sum such that no two chosen numbers adjacent for the given rectangular grid of dimension 2 x n. Assesments: assert max_sum_rectangular_grid([ [1 4 5 0 0 ] ], 3) == 7, 1 2,, 6 7] 5 247 9 11 15 1921 25 28 31 5 81",0.0,0.05828691453105855
"Prompt: Write a python function to find the first maximum length of even word. Assesments: assert find_Max_Len_Even(""python language"") == ""language"", assert find_Max_Len_Even(""maximum even length"") == ""length"", assert find_Max_Len_Even(""eve"") == ""-1""",65,0.03,54,1.2037037037037037,"Prompt: Write a python function find the first maximum length of even word. Assesments: assert find_Max_Len_Even(""python language ""language assert find_Max_Len_Even(""maximum even length ""length find_Max_Len_Even(""eve ""-1",0.0,0.006672104597415799
"Prompt: Write a function to find the index of the last occurrence of a given number in a sorted array. Assesments: assert find_last_occurrence([2, 5, 5, 5, 6, 6, 8, 9, 9, 9], 5) == 3, assert find_last_occurrence([2, 3, 5, 8, 6, 6, 8, 9, 9, 9], 9) == 9, assert find_last_occurrence([2, 2, 1, 5, 6, 6, 6, 9, 9, 9], 6) == 6",151,0.036,86,1.755813953488372,"Prompt: Write a function to find the index the last occurrence a given number in a sorted array Assesments: assert find_last_occurrence([2 5, 5,, 6 8 9 9], 5) == 3, assert 3 5 8 6 6 8, 9 9 2 1 5 6 6 9 6 6",0.0,0.06299334169641996
"Prompt: Write a function to reflect the modified run-length encoding from a list. Assesments: assert modified_encode([1,1,2,3,4,4,5,1])==[[2, 1], 2, 3, [2, 4], 5, 1], assert modified_encode('automatically')==['a', 'u', 't', 'o', 'm', 'a', 't', 'i', 'c', 'a', [2, 'l'], 'y'], assert modified_encode('python')==['p', 'y', 't', 'h', 'o', 'n']",137,0.038,90,1.5222222222222221,"Prompt: Write a function to reflect the modified run-length encoding from a list. Assesments: assert modified_encode([1,1,2,3,4,4,5,1])==[[2 1], 2, [2 4 5 1], assert modified_encode('automatically')==['a 'utomatica [2 'l' 'y' assert modified_encode('python')==['python']",0.0,0.039164450118806954
"Prompt: Write a python function to find the maximum volume of a cuboid with given sum of sides. Assesments: assert max_volume(8) == 18, assert max_volume(4) == 2, assert max_volume(1) == 0",54,0.029,33,1.6363636363636365,"Prompt: Write a python function find the maximum volume a cuboid with given sum sides Assesments: assert max_volume(8 18, 2 0",0.0,0.05080811304877696
"Prompt: Write a function to find all five characters long word in the given string by using regex. Assesments: assert find_long_word('Please move back to strem') == ['strem'], assert find_long_word('4K Ultra HD streaming player') == ['Ultra'], assert find_long_word('Streaming Media Player') == ['Media']",70,0.033,44,1.5909090909090908,Prompt: Write a function find all five characters long word in the given string by regex Assesments: assert find_long_word('Please move back strem ['strem'K Ultra HD streaming playerUltra'Media'],0.0,0.04617125612976234
"Prompt: Write a function to calculate the difference between the squared sum of first n natural numbers and the sum of squared first n natural numbers. Assesments: assert sum_difference(12)==5434, assert sum_difference(20)==41230, assert sum_difference(54)==2151270",59,0.032,36,1.6388888888888888,"Prompt: Write a function calculate the difference the squared sum first n natural numbers Assesments: assert sum_difference(12)==5434, sum_difference(54)==2151270",0.0,0.05106571621094442
"Prompt: Write a function to find the demlo number for the given number. Assesments: assert find_demlo(""111111"") == '12345654321', assert find_demlo(""1111"") == '1234321', assert find_demlo(""13333122222"") == '123456789101110987654321'",70,0.03,52,1.3461538461538463,"Prompt: Write a function find the demlo number for the given number Assesments: assert find_demlo(""111111 '12345654321 assert"")1234321 find_demlo(""13333122222123456789101110987654321'",0.0,0.021203565027376078
"Prompt: Write a function to find all index positions of the minimum values in a given list. Assesments: assert position_min([12,33,23,10,67,89,45,667,23,12,11,10,54])==[3,11], assert position_min([1,2,2,2,4,4,4,5,5,5,5])==[0], assert position_min([2,1,5,6,8,3,4,9,10,11,8,12])==[1]",121,0.029,53,2.2830188679245285,"Prompt: Write a function find all index positions the minimum values Assesments: assert position_min([12,33,23,10,67,89,45,667,23,12,11,10,54])==[3,11 assert]",0.0,0.11677396431173932
"Prompt: Write a function to re-arrange the given array in alternating positive and negative items. Assesments: assert re_arrange([-5, -2, 5, 2, 4,	7, 1, 8, 0, -8], 10) == [-5, 5, -2, 2, -8, 4, 7, 1, 8, 0], assert re_arrange([1, 2, 3, -4, -1, 4], 6) == [-4, 1, -1, 2, 3, 4], assert re_arrange([4, 7, 9, 77, -4, 5, -3, -9], 8) == [-4, 4, -3, 7, -9, 9, 77, 5]",191,0.04,114,1.6754385964912282,"Prompt: Write a function to rearrange the given array in alternating positive and negative items Assesments: assert re_arrange([-5 -2, 5, 2 4 7 1 8 0 -8 10) == [ 5 2 -8 4], assert 3 -4 -1 4], 6-4 1 2 3 4 7 9 77 -4 5 -3 -9-4 4 -3 7 -9 9 77 5]",0.0,0.054794183031789505
"Prompt: Write a function to extract the sum of alternate chains of tuples. Assesments: assert sum_of_alternates((5, 6, 3, 6, 10, 34)) == (46, 18), assert sum_of_alternates((1, 2, 3, 4, 5)) == (6, 9), assert sum_of_alternates((6, 7, 8, 9, 4, 5)) == (21, 18)",109,0.033,58,1.8793103448275863,"Prompt: Write a function to extract the sum alternate chains of tuples. Assesments: assert sum_of_alternates((5 6, 3, 6 10 34 (46 18), assert))6 9 7 4, 521 18)",0.0,0.07559131382282049
"Prompt: Write a python function to find the minimum number of squares whose sum is equal to a given number. Assesments: assert get_Min_Squares(6) == 3, assert get_Min_Squares(2) == 2, assert get_Min_Squares(4) == 1",61,0.029,36,1.6944444444444444,"Prompt: Write a python function find the minimum number squares whose sum equal a given number. Assesments: assert get_Min_Squares(6 3, 2 1",0.0,0.056732985778628925
"Prompt: Write a function to get the word with most number of occurrences in the given strings list. Assesments: assert most_occurrences([""UTS is best for RTF"", ""RTF love UTS"", ""UTS is best""] ) == 'UTS', assert most_occurrences([""Its been a great year"", ""this year is so worse"", ""this year is okay""] ) == 'year', assert most_occurrences([""Families can be reunited"", ""people can be reunited"", ""Tasks can be achieved ""] ) == 'can'",112,0.038,71,1.5774647887323943,"Prompt: Write a function to get the word with most number occurrences in the given strings list Assesments: assert most_occurrences([""UTS is best for RTF ""RTF love UTS""] ) == 'UTS assert most_occurrences([""Its been a great yearthis year so worse okayyear can be reunitedpeopleTasks achieved ""]can'",0.0,0.044799791407236896
"Prompt: Write a function to print check if the triangle is isosceles or not. Assesments: assert check_isosceles(6,8,12)==False , assert check_isosceles(6,6,12)==True, assert check_isosceles(6,16,20)==False",67,0.03,29,2.310344827586207,"Prompt: Write print check the triangle isosceles Assesments assert check_isosceles(6,8,12)==False ,,",0.0,0.11956150874451059
"Prompt: Write a function to rotate a given list by specified number of items to the left direction. Assesments: assert rotate_left([1, 2, 3, 4, 5, 6, 7, 8, 9, 10],3,4)==[4, 5, 6, 7, 8, 9, 10, 1, 2, 3, 4], assert rotate_left([1, 2, 3, 4, 5, 6, 7, 8, 9, 10],2,2)==[3, 4, 5, 6, 7, 8, 9, 10, 1, 2], assert rotate_left([1, 2, 3, 4, 5, 6, 7, 8, 9, 10],5,2)==[6, 7, 8, 9, 10, 1, 2]",219,0.04,109,2.0091743119266057,"Prompt: Write a function to rotate a given list by specified number of items to the left direction. Assesments: assert rotate_left([1, 2,,,,,,,, 10],3,4)==[4, 5, 6,, 8,,, 1, 2, 3, 4], assert rotate_left([1,, 10],2,2)==[3 4 5 6,], assert rotate_left([1 10],5,2)==[6 7 9 1]",0.0,0.08883884777904345
"Prompt: Write a python function to count negative numbers in a list. Assesments: assert neg_count([-1,-2,3,-4,-5]) == 4, assert neg_count([1,2,3]) == 0, assert neg_count([1,2,-3,-10,20]) == 2",67,0.036,37,1.8108108108108107,"Prompt: Write a python function count negative numbers in a list Assesments: assert neg_count([-1,-2,3,-4,-5 4,]) 0 2",0.0,0.06860361798121133
"Prompt: Write a function to find all three, four, five characters long words in the given string by using regex. Assesments: assert find_char('For the four consumer complaints contact manager AKR reddy') == ['For', 'the', 'four', 'AKR', 'reddy'], assert find_char('Certain service are subject to change MSR') == ['are', 'MSR'], assert find_char('Third party legal desclaimers') == ['Third', 'party', 'legal']",104,0.042,76,1.368421052631579,"Prompt: Write a function find all three, four five characters long words the given string by regex Assesments: assert find_char('For the four consumer complaints contact manager AKR reddy') ['For',thefourAKRreddy' find_char('Certain service are subject change MSRareMSR' find_char('Third party legal desclaimersThird',partylegal",0.0,0.02347506173669091
"Prompt: Write a python function to count unset bits of a given number. Assesments: assert count_unset_bits(2) == 1, assert count_unset_bits(4) == 2, assert count_unset_bits(6) == 1",54,0.032,28,1.9285714285714286,"Prompt: Write a python function count unset bits of a given number Assesments: assert count_unset_bits(2 ==, 1",0.0,0.08061647895672792
"Prompt: Write a function to count character frequency of a given string. Assesments: assert char_frequency('python')=={'p': 1, 'y': 1, 't': 1, 'h': 1, 'o': 1, 'n': 1}, assert char_frequency('program')=={'p': 1, 'r': 2, 'o': 1, 'g': 1, 'a': 1, 'm': 1}, assert char_frequency('language')=={'l': 1, 'a': 2, 'n': 1, 'g': 2, 'u': 1, 'e': 1}",147,0.04,92,1.5978260869565217,"Prompt: Write a function to count character frequency of a given string. Assesments: assert char_frequency('python')=={'p': 1,y 1,t 1,h 1,o 1,n}, assert char_frequency('program')=={'p 1r 2o 1g 1am}, char_frequency('language')=={'l 1a 2n 1,g 2,u 1e 1}",0.0,0.04687686479135152
"Prompt: Write a python function to sort a list according to the second element in sublist. Assesments: assert Sort([['a', 10], ['b', 5], ['c', 20], ['d', 15]]) == [['b', 5], ['a', 10], ['d', 15], ['c', 20]], assert Sort([['452', 10], ['256', 5], ['100', 20], ['135', 15]]) == [['256', 5], ['452', 10], ['135', 15], ['100', 20]], assert Sort([['rishi', 10], ['akhil', 5], ['ramya', 20], ['gaur', 15]]) == [['akhil', 5], ['rishi', 10], ['gaur', 15], ['ramya', 20]]",187,0.051,124,1.5080645161290323,"Prompt: Write a python function to sort a list according the second element in sublist. Assesments: assert Sort([['a', 10], ['b 5], [' 20], 15]]) == [['b 5],a 10'd 15],c]], assert Sort([['452 10256 5100', 20],135 15]]) =='256 5452 10135],100] assert Sort([['rishi 10akhil', 5ramya 20gaur', 15]]'akhilrishi 10gaur 15],]]",0.0,0.03772021045478414
"Prompt: Write a python function to check whether the triangle is valid or not if sides are given. Assesments: assert check_Validity(1,2,3) == False, assert check_Validity(2,3,5) == False, assert check_Validity(7,10,5) == True",65,0.031,32,2.03125,"Prompt: Write a python function check whether the triangle valid or if sides given Assesments: assert check_Validity(1,2,3 == False,",0.0,0.09109080753271624
"Prompt: Write a function to find the sum of arithmetic progression. Assesments: assert ap_sum(1,5,2)==25, assert ap_sum(2,6,4)==72, assert ap_sum(1,4,5)==34",52,0.028,24,2.1666666666666665,"Prompt: Write a function find the sum arithmetic progression Assesments assert ap_sum(1,5,2)==25",0.0,0.1049047771039472
"Prompt: Write a function to check whether the given month name contains 28 days or not. Assesments: assert check_monthnum(""February"")==True, assert check_monthnum(""January"")==False, assert check_monthnum(""March"")==False",49,0.028,25,1.96,"Prompt: Write a function check the given month name contains 28 days Assesments assert check_monthnum(""February"")==True",0.0,0.08382253431216086
"Prompt: Write a function that matches a word at the end of a string, with optional punctuation. Assesments: assert text_match_word(""python."")==('Found a match!'), assert text_match_word(""python."")==('Found a match!'), assert text_match_word(""  lang  ."")==('Not matched!')",67,0.036,38,1.763157894736842,"Prompt: Write a function matches a word at, with optional punctuation Assesments: assert text_match_word(""python."")==('Found a match!'. lang ."")==('Not matched!",0.0,0.06374250340181765
"Prompt: Write a python function to count the number of substrings with same first and last characters. Assesments: assert count_Substring_With_Equal_Ends('aba') == 4, assert count_Substring_With_Equal_Ends('abcab') == 7, assert count_Substring_With_Equal_Ends('abc') == 3",72,0.033,39,1.8461538461538463,"Prompt: Write a python function count substrings with same first and last characters Assesments: assert count_Substring_With_Equal_Ends('aba == 4, 7') 3",0.0,0.07220899113653663
"Prompt: Write a python function to find the maximum occuring divisor in an interval. Assesments: assert find_Divisor(2,2) == 2, assert find_Divisor(2,5) == 2, assert find_Divisor(5,10) == 2",62,0.031,31,2.0,"Prompt: Write a python function find the maximum occuring divisor in an interval Assesments: assert find_Divisor(2,2 ==, assert",0.0,0.0879029684008937
"Prompt: Write a python function to find the sum of the three lowest positive numbers from a given list of numbers. Assesments: assert sum_three_smallest_nums([10,20,30,40,50,60,7]) == 37, assert sum_three_smallest_nums([1,2,3,4,5]) == 6, assert sum_three_smallest_nums([0,1,2,3,4,5]) == 6",95,0.034,52,1.8269230769230769,"Prompt: Write a python function find the sum the three lowest positive numbers from a given list of numbers Assesments: assert sum_three_smallest_nums([10,20,30,40,50,60,7 37,]) 6 6",0.0,0.07024724397849197
"Prompt: Write a function to convert the given set into ordered tuples. Assesments: assert set_to_tuple({1, 2, 3, 4, 5}) == (1, 2, 3, 4, 5), assert set_to_tuple({6, 7, 8, 9, 10, 11}) == (6, 7, 8, 9, 10, 11), assert set_to_tuple({12, 13, 14, 15, 16}) == (12, 13, 14, 15, 16)",129,0.044,59,2.1864406779661016,"Prompt: Write a function to convert the given set into ordered tuples. Assesments: assert set_to_tuple({1, 2,,,}) == (1, 2,), assert set_to_tuple({6 7,,}) (6 7, set_to_tuple({12})12)",0.0,0.10692194084837729
"Prompt: Write a function to find the smallest range that includes at-least one element from each of the given arrays. Assesments: assert find_minimum_range([[3, 6, 8, 10, 15], [1, 5, 12], [4, 8, 15, 16], [2, 6]]) == (4, 6), assert find_minimum_range([[ 2, 3, 4, 8, 10, 15 ], [1, 5, 12], [7, 8, 15, 16], [3, 6]]) == (4, 7), assert find_minimum_range([[4, 7, 9, 11, 16], [2, 6, 13], [5, 9, 16, 17], [3, 7]]) == (5, 7)",194,0.048,109,1.7798165137614679,"Prompt: Write a function to find the smallest range that includes at-least one element from each of the given arrays Assesments: assert find_minimum_range([[3 6 8 10 15], [1 5 12],4 8 15, 162 6]]) == (4, 6), assert 2 3 8 10 ],1 57 834 7 7 9 11 162 6, 135 9 16,3 75 7)",0.0,0.06544186332530007
"Prompt: Write a function to calculate the number of digits and letters in a string. Assesments: assert dig_let(""python"")==(6,0), assert dig_let(""program"")==(7,0), assert dig_let(""python3.0"")==(6,2)",60,0.032,27,2.2222222222222223,"Prompt: Write a function calculate the number digits and letters Assesments: assert dig_let(""python"")==(6,0)",0.0,0.11057204667163174
"Prompt: Write a python function to find number of elements with odd factors in a given range. Assesments: assert count_Odd_Squares(5,100) == 8, assert count_Odd_Squares(8,65) == 6, assert count_Odd_Squares(2,5) == 1",67,0.033,35,1.9142857142857144,"Prompt: Write a python function find number elements with odd factors in a given range Assesments: assert count_Odd_Squares(5,100 8, 6",0.0,0.07915918106789477
"Prompt: Write a function to find the difference between two consecutive numbers in a given list. Assesments: assert diff_consecutivenums([1, 1, 3, 4, 4, 5, 6, 7])==[0, 2, 1, 0, 1, 1, 1], assert diff_consecutivenums([4, 5, 8, 9, 6, 10])==[1, 3, 1, -3, 4], assert diff_consecutivenums([0, 1, 2, 3, 4, 4, 4, 4, 5, 7])==[1, 1, 1, 1, 0, 0, 0, 1, 2]",178,0.042,100,1.78,"Prompt: Write a function to find the difference two consecutive numbers in a given list Assesments: assert diff_consecutivenums([1 1 3, 4 4 7])==[0, 2 1 0], assert 5 8 6 10])==[1 3 1 -3 4], 2 4 4 4 5, 1 1 1 0 0 1, 2]",0.0,0.06546058091286307
"Prompt: Write a function to find entringer number e(n, k). Assesments: assert zigzag(4, 3) == 5, assert zigzag(4, 2) == 4, assert zigzag(3, 1) == 1",57,0.035,33,1.7272727272727273,"Prompt: Write a function to find entringer number e(n, k). Assesments: assert zigzag(4 3 5, 4 1",0.0,0.06008182688680614
"Prompt: Write a python function to count the number of squares in a rectangle. Assesments: assert count_Squares(4,3) == 20, assert count_Squares(1,2) == 2, assert count_Squares(2,2) == 5",58,0.032,31,1.8709677419354838,"Prompt: Write a python function count squares in a rectangle Assesments: assert count_Squares(4,3 20, assert 2 5",0.0,0.07474027779207808
"Prompt: Write a function to count sequences of given length having non-negative prefix sums that can be generated by given values. Assesments: assert find_ways(4) == 2, assert find_ways(6) == 5, assert find_ways(8) == 14",60,0.034,34,1.7647058823529411,"Prompt: Write a function count sequences given length having non-negative prefix sums that can generated given values Assesments: assert find_ways(4, 5 14",0.0,0.06390041493775933
"Prompt: Write a python function to check whether the given string is a binary string or not. Assesments: assert check(""01010101010"") == ""Yes"", assert check(""name0"") == ""No"", assert check(""101"") == ""Yes""",54,0.035,39,1.3846153846153846,"Prompt: Write a python function check whether the given string a binary string or Assesments: assert check(""01010101010 == ""Yes check(""name0No check(""101Yes""",0.0,0.025127059343465336
"Prompt: Write a python function to minimize the length of the string by removing occurrence of only one character. Assesments: assert minimum_Length(""mnm"") == 1, assert minimum_Length(""abcda"") == 3, assert minimum_Length(""abcb"") == 2",57,0.033,42,1.3571428571428572,"Prompt: Write a python function minimize the length by removing occurrence only one character Assesments: assert minimum_Length(""mnm 1, minimum_Length(""abcda 3 minimum_Length(""abcb 2",0.0,0.02232456340340158
"Prompt: Write a python function to find the first element occurring k times in a given array. Assesments: assert first_Element([0,1,2,3,4,5],6,1) == 0, assert first_Element([1,2,1,3,4],5,2) == 1, assert first_Element([2,3,4,3,5,7,1,2,3,5],10,2) == 2",100,0.032,42,2.380952380952381,"Prompt: Write a python function find the first element occurring k times a given array Assesments: assert first_Element([0,1,2,3,4,5],6,1) ==,",0.0,0.1267642454364446
"Prompt: Write a python function to check whether all the characters in a given string are unique. Assesments: assert unique_Characters('aba') == False, assert unique_Characters('abc') == True, assert unique_Characters('abab') == False",52,0.033,34,1.5294117647058822,"Prompt: Write a python function check whether all the characters a given string unique Assesments: assert unique_Characters('aba == False, True unique_Characters('abab",0.0,0.03989786147462494
"Prompt: Write a function to remove a specified column from a given nested list. Assesments: assert remove_column([[1, 2, 3], [2, 4, 5], [1, 1, 1]],0)==[[2, 3], [4, 5], [1, 1]], assert remove_column([[1, 2, 3], [-2, 4, -5], [1, -1, 1]],2)==[[1, 2], [-2, 4], [1, -1]], assert remove_column([[1, 3], [5, 7], [1, 3], [13, 15, 17], [5, 7], [9, 11]],0)==[[3], [7], [3], [15, 17], [7], [11]]",185,0.046,109,1.6972477064220184,"Prompt: Write a function to remove a specified column from a given nested list. Assesments: assert remove_column([[1 2], [2 41 1 1]],0)==[[2 3], [41 1] assert [-2 4, -5 [1 -1 1]],2)==[[1 2 [-2 4 [1] assert 3 [5, 7 313 15, 175 79 11]],0)==[[3],7315 177],11]]",0.0,0.05701894892195246
"Prompt: Write a function to find t-nth term of arithemetic progression. Assesments: assert tn_ap(1,5,2)==9, assert tn_ap(2,6,4)==22, assert tn_ap(1,4,5)==16",56,0.034,28,2.0,"Prompt: Write a function find t-nth term arithemetic progression Assesments assert tn_ap(1,5,2)==9",0.0,0.0879029684008937
"Prompt: Write a python function to count the number of rectangles in a circle of radius r. Assesments: assert count_Rectangles(2) == 8, assert count_Rectangles(1) == 1, assert count_Rectangles(0) == 0",55,0.032,31,1.7741935483870968,"Prompt: Write a python function count rectangles in a circle of radius r. Assesments: assert count_Rectangles(2) 8, 1",0.0,0.06486825983546636
"Prompt: Write a function to find the third angle of a triangle using two angles. Assesments: assert find_angle(47,89)==44, assert find_angle(45,95)==40, assert find_angle(50,40)==90",50,0.031,24,2.0833333333333335,"Prompt: Write a function find the third angle using two angles Assesments assert find_angle(47,89)==44",0.0,0.09640387275242047
"Prompt: Write a function to find the maximum element of all the given tuple records. Assesments: assert find_max([(2, 4), (6, 7), (5, 1), (6, 10), (8, 7)]) == 10, assert find_max([(3, 5), (7, 8), (6, 2), (7, 11), (9, 8)]) == 11, assert find_max([(4, 6), (8, 9), (7, 3), (8, 12), (10, 9)]) == 12",131,0.039,79,1.6582278481012658,"Prompt: Write a function to find the maximum element of all the given tuple records. Assesments: assert find_max([(2, 4), (6 75 16 108 7)]) == 10, assert find_max([(3 57 8)6 27 119 8) 11, 68 97 38 1210 9 12",0.0,0.053038499921214344
"Prompt: Write a function to find modulo division of two lists using map and lambda function. Assesments: assert moddiv_list([4,5,6],[1, 2, 3])==[0, 1, 0], assert moddiv_list([3,2],[1,4])==[0, 2], assert moddiv_list([90,120],[50,70])==[40, 50]",91,0.032,43,2.116279069767442,"Prompt: Write a function find modulo division two lists using map and lambda function Assesments: assert moddiv_list([4,5,6],[1 2 3])==[0 0 assert],",0.0,0.09976469540302409
"Prompt: Write a python function to check whether one root of the quadratic equation is twice of the other or not. Assesments: assert Check_Solution(1,3,2) == ""Yes"", assert Check_Solution(1,2,3) == ""No"", assert Check_Solution(1,-5,6) == ""No""",72,0.033,35,2.057142857142857,"Prompt: Write a python function check whether one root of the quadratic equation twice of other or not Assesments: assert Check_Solution(1,3,2 == """,0.0,0.09373215995622632
"Prompt: Write a function to find the n’th carol number. Assesments: assert get_carol(2) == 7, assert get_carol(4) == 223, assert get_carol(5) == 959",51,0.03,31,1.6451612903225807,"Prompt: Write a function find the n��th carol number. Assesments: assert get_carol(2 7, 223 959",0.0,0.05170556922665075
"Prompt: Write a function to remove empty lists from a given list of lists. Assesments: assert remove_empty([[], [], [], 'Red', 'Green', [1,2], 'Blue', [], []])==['Red', 'Green', [1, 2], 'Blue'], assert remove_empty([[], [], [],[],[], 'Green', [1,2], 'Blue', [], []])==[ 'Green', [1, 2], 'Blue'], assert remove_empty([[], [], [], 'Python',[],[], 'programming', 'language',[],[],[], [], []])==['Python', 'programming', 'language']",133,0.05,82,1.6219512195121952,"Prompt: Write a function to remove empty lists from a given list of lists. Assesments: assert remove_empty([[], [], 'Red', 'Green [1,2], 'Blue [], []])==['Red [ 2'], assert],[],[], 'Green1,2=[ 'Green [ [], [], 'Python',[],[], 'programming', 'language[],[], [],, 'programming']",0.0,0.04933789012323574
"Prompt: Write a python function to find the item with maximum occurrences in a given list. Assesments: assert max_occurrences([1,2,3,1,2,3,12,4,2]) ==  2, assert max_occurrences([1,2,6,7,0,1,0,1,0]) == 1,0, assert max_occurrences([1,2,3,1,2,4,1]) == 1",101,0.032,51,1.9803921568627452,"Prompt: Write a python function find the item with maximum occurrences in a given list Assesments: assert max_occurrences([1,2,3,1,2,3,12,4,2 == 2, 1,0 assert",0.0,0.08590275561229918
"Prompt: Write a function to add the k elements to each element in the tuple. Assesments: assert add_K_element([(1, 3, 4), (2, 4, 6), (3, 8, 1)], 4) == [(5, 7, 8), (6, 8, 10), (7, 12, 5)], assert add_K_element([(1, 2, 3), (4, 5, 6), (7, 8, 9)], 8) == [(9, 10, 11), (12, 13, 14), (15, 16, 17)], assert add_K_element([(11, 12, 13), (14, 15, 16), (17, 18, 19)], 9) == [(20, 21, 22), (23, 24, 25), (26, 27, 28)]",207,0.047,122,1.6967213114754098,"Prompt: Write a function to add the k elements to each element in the tuple. Assesments: assert add_K_element([(1, 3, 4), (2 4 63 8 1)], 4) == [(5 7, 8),6 8, 10),7 12 5) assert 24 5 67 8 9) 8)9 10 1112 13, 14),) add_K_element([(11 12 1314 15 1617 18 19) 920,)]",0.0,0.05696525092484551
"Prompt: Write a function to find the number of flips required to make the given binary string a sequence of alternate characters. Assesments: assert min_flip_to_make_string_alternate(""0001010111"") == 2, assert min_flip_to_make_string_alternate(""001"") == 1, assert min_flip_to_make_string_alternate(""010111011"") == 2",77,0.032,41,1.8780487804878048,"Prompt: Write a function find the number flips required make the given binary string a sequence alternate characters Assesments: assert min_flip_to_make_string_alternate(""0001010111 == 2,"")",0.0,0.07546262056939113
"Prompt: Write a python function to count the number of digits of a given number. Assesments: assert count_Digit(12345) == 5, assert count_Digit(11223305) == 8, assert count_Digit(4123459) == 7",58,0.029,41,1.4146341463414633,"Prompt: Write a python function count digits of Assesments: assert count_Digit(12345 5, count_Digit(11223305 8 count_Digit(4123459 7",0.0,0.02818929880968135
"Prompt: Write a python function to find the largest product of the pair of adjacent elements from a given list of integers. Assesments: assert adjacent_num_product([1,2,3,4,5,6]) == 30, assert adjacent_num_product([1,2,3,4,5]) == 20, assert adjacent_num_product([2,3]) == 6",80,0.031,45,1.7777777777777777,"Prompt: Write a python function find the largest product the pair adjacent elements from integers Assesments: assert adjacent_num_product([1,2,3,4,5,6 30,]) 20]) 6",0.0,0.06523389013015568
"Prompt: Write a function to check if a binary tree is balanced or not. Assesments: assert is_tree_balanced(root) == False, assert is_tree_balanced(root1) == True, assert is_tree_balanced(root2) == False",51,0.029,26,1.9615384615384615,"Prompt: Write a function to check a binary tree balanced or Assesments: assert is_tree_balanced(root) == False,",0.0,0.08397947408480443
"Prompt: Write a function to repeat the given tuple n times. Assesments: assert repeat_tuples((1, 3), 4) == ((1, 3), (1, 3), (1, 3), (1, 3)), assert repeat_tuples((1, 2), 3) == ((1, 2), (1, 2), (1, 2)), assert repeat_tuples((3, 4), 5) == ((3, 4), (3, 4), (3, 4), (3, 4), (3, 4))",131,0.038,75,1.7466666666666666,"Prompt: Write a function to repeat the given tuple n times. Assesments: assert repeat_tuples((1, 3), 4) == ((1 3), (1 3), (1 3), ()), assert repeat_tuples((1 2 3 2 2)), assert repeat_tuples((3 4 53),))",0.0,0.06206021917225236
"Prompt: Write a function to find the lateral surface area of cuboid Assesments: assert lateralsurface_cuboid(8,5,6)==156, assert lateralsurface_cuboid(7,9,10)==320, assert lateralsurface_cuboid(10,20,30)==1800",66,0.017,31,2.129032258064516,"Prompt: Write a function find the lateral surface area cuboid Assesments: assert lateralsurface_cuboid(8,5,6)==156",0.0,0.10106565900970932
"Prompt: Write a function to sort a tuple by its float element. Assesments: assert float_sort([('item1', '12.20'), ('item2', '15.10'), ('item3', '24.5')])==[('item3', '24.5'), ('item2', '15.10'), ('item1', '12.20')] , assert float_sort([('item1', '15'), ('item2', '10'), ('item3', '20')])==[('item3', '20'), ('item1', '15'), ('item2', '10')] , assert float_sort([('item1', '5'), ('item2', '10'), ('item3', '14')])==[('item3', '14'), ('item2', '10'), ('item1', '5')]",179,0.045,111,1.6126126126126126,"Prompt: Write a function to sort a tuple by its float element. Assesments: assert float_sort([('item1', '12.20'), ('item215.1024.5')])==[('item3', '24.5'), ('item215.10'),item112.20')] , assert float_sort([('item115'),10'),item320')])==[('item320'),item115'),10')] , assert float_sort([('item151014')])==[('item314item210'),item15')]",0.0,0.048385250874877425
"Prompt: Write a function to find the smallest missing element in a sorted array. Assesments: assert smallest_missing([0, 1, 2, 3, 4, 5, 6], 0, 6) == 7, assert smallest_missing([0, 1, 2, 6, 9, 11, 15], 0, 6) == 3, assert smallest_missing([1, 2, 3, 4, 6, 9, 11, 15], 0, 7) == 0",124,0.035,63,1.9682539682539681,"Prompt: Write a function to find the smallest missing element in a sorted array. Assesments: assert smallest_missing([0 1,,,,,], 0, 6) == 7, 6 9 11 15], 6 3 6 9 11 7 0",0.0,0.08466452864793113
"Prompt: Write a function to sort a given list of elements in ascending order using heap queue algorithm. Assesments: assert heap_assending([18, 14, 10, 9, 8, 7, 9, 3, 2, 4, 1])==[1, 2, 3, 4, 7, 8, 9, 9, 10, 14, 18], assert heap_assending([25, 35, 22, 85, 14, 65, 75, 25, 58])==[14, 22, 25, 25, 35, 58, 65, 75, 85], assert heap_assending([1, 3, 5, 7, 9, 2, 4, 6, 8, 0])==[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]",219,0.043,134,1.6343283582089552,"Prompt: Write a function to sort a given list of elements in ascending using heap queue algorithm Assesments: assert heap_assending([18, 14, 10 9 9 3 4 1])==[1, 7 8 9 9 10 14 18], assert 35 22 85 14 65 75 25 58])==[14 22 25 25 35 58 65 85 3 5 7 9 2 4 6 8 0])==[0 1 5 6 7 8 9]",0.0,0.050600492589716585
"Prompt: Write a function to find the volume of a cuboid. Assesments: assert volume_cuboid(1,2,3)==6, assert volume_cuboid(5,7,9)==315, assert volume_cuboid(10,15,21)==3150",60,0.028,27,2.2222222222222223,"Prompt: Write a function find the volume a cuboid Assesments assert volume_cuboid(1,2,3)==6",0.0,0.11057204667163174
"Prompt: Write a function to print all permutations of a given string including duplicates. Assesments: assert permute_string('ab')==['ab', 'ba'], assert permute_string('abc')==['abc', 'bac', 'bca', 'acb', 'cab', 'cba'], assert permute_string('abcd')==['abcd', 'bacd', 'bcad', 'bcda', 'acbd', 'cabd', 'cbad', 'cbda', 'acdb', 'cadb', 'cdab', 'cdba', 'abdc', 'badc', 'bdac', 'bdca', 'adbc', 'dabc', 'dbac', 'dbca', 'adcb', 'dacb', 'dcab', 'dcba']",166,0.045,117,1.4188034188034189,"Prompt: Write a function to print all permutations of a given string including duplicates. Assesments: assert permute_string('ab')==['ab', 'ba'], assert permute_string('abc')==['abcbac',bca',acb',cab',cba'], permute_string('abcd')==['abcdbacd', 'bcad', 'bcda', 'acbdcabdcbadcbdaacdbcadbcdabcdbaabdcbadcbdacbdcaadbcdabc 'dbacdbca 'adcbdacbdcabdcba']",0.0,0.02861460984665581
"Prompt: Write a function to round the given number to the nearest multiple of a specific number. Assesments: assert round_num(4722,10)==4720, assert round_num(1111,5)==1110, assert round_num(219,2)==218",56,0.029,27,2.074074074074074,"Prompt: Write a function round the given number a specific number Assesments: assert round_num(4722,10)==4720",0.0,0.09545932782447304
"Prompt: Write a function to remove tuple elements that occur more than once and replace the duplicates with some custom value. Assesments: assert remove_replica((1, 1, 4, 4, 4, 5, 5, 6, 7, 7)) == (1, 'MSP', 4, 'MSP', 'MSP', 5, 'MSP', 6, 7, 'MSP'), assert remove_replica((2, 3, 4, 4, 5, 6, 6, 7, 8, 9, 9)) == (2, 3, 4, 'MSP', 5, 6, 'MSP', 7, 8, 9, 'MSP'), assert remove_replica((2, 2, 5, 4, 5, 7, 5, 6, 7, 7)) == (2, 'MSP', 5, 4, 'MSP', 7, 'MSP', 6, 'MSP', 'MSP')",241,0.047,140,1.7214285714285715,"Prompt: Write a function to remove tuple elements that occur more and replace the duplicates with some custom value. Assesments: assert remove_replica((1 1, 4, 4, 4, 5, 5, 6 7 7)) == (1 'MSP', 4, 'MSP ' 5 6 7, ''), assert remove_replica((2 3 4 5 6 8 9 92 3 ' 5 6 ' 8 9 2 5 4 5 7 5 6 7 ' 5 4 ' 7 ' 6 ' '')",0.0,0.059485659568647126
"Prompt: Write a python function to remove all occurrences of a character in a given string. Assesments: assert remove_Char(""aba"",'a') == ""b"", assert remove_Char(""toggle"",'g') == ""tole"", assert remove_Char(""aabbc"",'b') == ""aac""",64,0.031,51,1.2549019607843137,"Prompt: Write a python function remove all occurrences a character in a given string Assesments: assert remove_Char(""aba"",'a == ""b remove_Char(""toggle"",'gtole remove_Char(""aabbc"",'b ""aac""",0.0,0.011894882434301516
"Prompt: Write a python function to shift last element to first position in the given list. Assesments: assert move_first([1,2,3,4]) == [4,1,2,3], assert move_first([0,1,2,3]) == [3,0,1,2], assert move_first([9,8,7,1]) == [1,9,8,7]",88,0.031,35,2.5142857142857142,"Prompt: Write a python function shift last element to first position in the given list Assesments: assert move_first([1,2,3,4 == [], assert]",0.0,0.1403656923988874
"Prompt: Write a function to find the surface area of a cuboid. Assesments: assert surfacearea_cuboid(1,2,3)==22, assert surfacearea_cuboid(5,7,9)==286, assert surfacearea_cuboid(10,15,21)==1350",64,0.028,29,2.206896551724138,"Prompt: Write a function find the surface area a cuboid Assesments assert surfacearea_cuboid(1,2,3)==22",0.0,0.10900866196330497
"Prompt: Write a function to generate a two-dimensional array. Assesments: assert multi_list(3,4)==[[0, 0, 0, 0], [0, 1, 2, 3], [0, 2, 4, 6]] , assert multi_list(5,7)==[[0, 0, 0, 0, 0, 0, 0], [0, 1, 2, 3, 4, 5, 6], [0, 2, 4, 6, 8, 10, 12], [0, 3, 6, 9, 12, 15, 18], [0, 4, 8, 12, 16, 20, 24]], assert multi_list(10,15)==[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], [0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28], [0, 3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42], [0, 4, 8, 12, 16, 20, 24, 28, 32, 36, 40, 44, 48, 52, 56], [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70], [0, 6, 12, 18, 24, 30, 36, 42, 48, 54, 60, 66, 72, 78, 84], [0, 7, 14, 21, 28, 35, 42, 49, 56, 63, 70, 77, 84, 91, 98], [0, 8, 16, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 104, 112], [0, 9, 18, 27, 36, 45, 54, 63, 72, 81, 90, 99, 108, 117, 126]]",632,0.082,354,1.7853107344632768,"Prompt: Write a function to generate a two-dimensional array. Assesments: assert multi_list(3,4)==[[0 0 0], [0 1 2 3],0 2 4 6]] , assert multi_list(5,7)==[[0 0,,,,, 5,], 2 6 8, 10, 12], 3 6 9 12 15, 18], 8 12 16 20, 24]], assert multi_list(10,15)==[[0,,,,,],,,,,,,,,], 2 4 6 8 10 12 14 16 18, 20, 22, 24, 26 28], [ 3 6 9 12 15 18 21 24 27 30 33 36 39 42], 8 12 16 20 24 28 32 36 40 44, 48, 52, 56], 10 15 20 25 30 35 40 45 50 55 60 65 70], 12 18 24 30 36 42 48 54 60 66 72, 78 84], 14 21 28 35 42 49 56 63 70 77 84, 91, 98], 16 24 32 40 48 56 64 72 80 88 96 104, 112], 18 27 36 45 54 63 72 81 90 99 108 117 126]]",0.0,0.06600233346136714
"Prompt: Write a function to sort a list of lists by a given index of the inner list. Assesments: assert index_on_inner_list([('Greyson Fulton', 98, 99), ('Brady Kent', 97, 96), ('Wyatt Knott', 91, 94), ('Beau Turnbull', 94, 98)] ,0)==[('Beau Turnbull', 94, 98), ('Brady Kent', 97, 96), ('Greyson Fulton', 98, 99), ('Wyatt Knott', 91, 94)], assert index_on_inner_list([('Greyson Fulton', 98, 99), ('Brady Kent', 97, 96), ('Wyatt Knott', 91, 94), ('Beau Turnbull', 94, 98)] ,1)==[('Wyatt Knott', 91, 94), ('Beau Turnbull', 94, 98), ('Brady Kent', 97, 96), ('Greyson Fulton', 98, 99)], assert index_on_inner_list([('Greyson Fulton', 98, 99), ('Brady Kent', 97, 96), ('Wyatt Knott', 91, 94), ('Beau Turnbull', 94, 98)] ,2)==[('Wyatt Knott', 91, 94), ('Brady Kent', 97, 96), ('Beau Turnbull', 94, 98), ('Greyson Fulton', 98, 99)]",330,0.059,200,1.65,"Prompt: Write a function to sort a list of lists by a given index of the inner list. Assesments: assert index_on_inner_list([('Greyson Fulton', 98, 99), ('Brady Kent', 97, 96), ('Wyatt Knott', 91, 94),Beau Turnbull 94, 98)] ,0)==[('Beau Turnbull', 94, 98), ('Brady Kent 97, 96),Greyson Fulton 98, 99), ('Wyatt Knott 91)], assert index_on_inner_list([('Greyson Fulton 98BradyWyatt 91),Beau 94)] ,1)==[('Wyatt 91), ('Beau 94), ('Brady),Greyson)], assert index_on_inner_list([('Greyson Fulton 98Brady KentWyatt), ,2)==[('Wyatt 91Brady KentBeau),Greyson)]",0.0,0.05219917012448132
"Prompt: Write a function to find the number of rotations in a circularly sorted array. Assesments: assert find_rotation_count([8, 9, 10, 1, 2, 3, 4, 5, 6, 7]) == 3, assert find_rotation_count([8, 9, 10,2, 5, 6]) == 3, assert find_rotation_count([2, 5, 6, 8, 9, 10]) == 0",110,0.035,57,1.9298245614035088,"Prompt: Write a function to find the number rotations in a circularly sorted array. Assesments: assert find_rotation_count([8 9,, 1,]) == 3, assert 10,2 5]) 3 5 6 8]) 0",0.0,0.08074431210487118
"Prompt: Write a python function to toggle all odd bits of a given number. Assesments: assert even_bit_toggle_number(10) == 15, assert even_bit_toggle_number(20) == 1, assert even_bit_toggle_number(30) == 11",55,0.029,32,1.71875,"Prompt: Write a python function toggle all odd bits a given number Assesments: assert even_bit_toggle_number(10 == 15, 1 11",0.0,0.0592124162144909
"Prompt: Write a python function to find the frequency of the smallest value in a given array. Assesments: assert frequency_Of_Smallest(5,[1,2,3,4,3]) == 1, assert frequency_Of_Smallest(7,[3,1,2,5,6,2,3]) == 1, assert frequency_Of_Smallest(7,[3,3,6,3,7,4,9]) == 3",102,0.031,46,2.217391304347826,"Prompt: Write a python function find the frequency the smallest value in a given array Assesments: assert frequency_Of_Smallest(5,[1,2,3,4,3 == 1, assert 3",0.0,0.11007924062226787
"Prompt: Write a function to find the n'th perrin number using recursion. Assesments: assert get_perrin(9) == 12, assert get_perrin(4) == 2, assert get_perrin(6) == 5",52,0.034,31,1.6774193548387097,"Prompt: Write a function find the n'th perrin number using recursion Assesments: assert get_perrin(9 12, 2 5",0.0,0.05499624187885465
"Prompt: Write a function to find out the minimum no of swaps required for bracket balancing in the given string. Assesments: assert swap_count(""[]][]["") == 2, assert swap_count(""[[][]]"") == 0, assert swap_count(""[[][]]]["") == 1",59,0.037,38,1.5526315789473684,"Prompt: Write a function find the minimum no of swaps required bracket balancing in the given string Assesments: assert swap_count(""[]][]["") 2, assert[[ 0]",0.0,0.04226653451375005
"Prompt: Write a python function to check whether the hexadecimal number is even or odd. Assesments: assert even_or_odd(""AB3454D"") ==""Odd"", assert even_or_odd(""ABC"") == ""Even"", assert even_or_odd(""AAD"") == ""Odd""",59,0.032,31,1.903225806451613,"Prompt: Write a python function check whether the hexadecimal number even or Assesments: assert even_or_odd(""AB3454D ==""Odd"") """,0.0,0.078030950444282
"Prompt: Write a python function to find the highest power of 2 that is less than or equal to n. Assesments: assert highest_Power_of_2(10) == 8, assert highest_Power_of_2(19) == 16, assert highest_Power_of_2(32) == 32",68,0.031,37,1.837837837837838,"Prompt: Write a python function find the highest power of 2 that is less or n. Assesments: assert highest_Power_of_2(10 8, 16",0.0,0.07136066804116598
"Prompt: Write a function to find the n'th lucas number. Assesments: assert find_lucas(9) == 76, assert find_lucas(4) == 7, assert find_lucas(3) == 4",53,0.029,32,1.65625,"Prompt: Write a function find the n'th lucas number. Assesments: assert find_lucas(9 == 76, 7 4",0.0,0.05283673795084583
"Prompt: Write a function to insert a given string at the beginning of all items in a list. Assesments: assert add_string([1,2,3,4],'temp{0}')==['temp1', 'temp2', 'temp3', 'temp4'], assert add_string(['a','b','c','d'], 'python{0}')==[ 'pythona', 'pythonb', 'pythonc', 'pythond'], assert add_string([5,6,7,8],'string{0}')==['string5', 'string6', 'string7', 'string8']",127,0.036,92,1.3804347826086956,"Prompt: Write a function to insert a given string at the beginning all items a list. Assesments: assert add_string([1,2,3,4],'temp{0}')==['temp1 '',','], assert add_string(['a','b','c','d' 'python{0}')==[ 'pythonapythonbpythond'], add_string([5,6,7,8],'string{0}')==['string5",0.0,0.024700592569977368
"Prompt: Write a function to convert more than one list to nested dictionary. Assesments: assert convert_list_dictionary([""S001"", ""S002"", ""S003"", ""S004""],[""Adina Park"", ""Leyton Marsh"", ""Duncan Boyle"", ""Saim Richards""] ,[85, 98, 89, 92])==[{'S001': {'Adina Park': 85}}, {'S002': {'Leyton Marsh': 98}}, {'S003': {'Duncan Boyle': 89}}, {'S004': {'Saim Richards': 92}}], assert convert_list_dictionary([""abc"",""def"",""ghi"",""jkl""],[""python"",""program"",""language"",""programs""],[100,200,300,400])==[{'abc':{'python':100}},{'def':{'program':200}},{'ghi':{'language':300}},{'jkl':{'programs':400}}], assert convert_list_dictionary([""A1"",""A2"",""A3"",""A4""],[""java"",""C"",""C++"",""DBMS""],[10,20,30,40])==[{'A1':{'java':10}},{'A2':{'C':20}},{'A3':{'C++':30}},{'A4':{'DBMS':40}}]",276,0.049,240,1.15,"Prompt: Write a function to convert more than one list to nested dictionary. Assesments: assert convert_list_dictionary([""S001"", ""S003"", ""S004""],[""Adina ParkLeyton MarshDuncan BoyleSaim Richards""] ,[85, 98, 89, 92])==[{'S001 {'Adina 85}}, {Leyton Marsh 98 { 89Saim Richards 92}}], assert convert_list_dictionary([""abc"",""def"",""ghi"",""jkl""],[""python"",""program"",""language"",""programs""],[100,200,300,400])==[{'abc':{'python':100}},{'def':{'program':200}},{'ghi':{'language':300}},{'jkl':{'programs':400}} assert convert_list_dictionary([""A1"",""A2"",""A3"",""A4""],[""java"",""C"",""C++"",""DBMS""],[10,20,30,40])==[{'A1':{'java':10}},{'A2':{'C':20}},{'A3':{'C++':30}},{'A4':{'DBMS':40]",0.0,0.0011937440153207664
"Prompt: Write a function to find the maximum sum possible by using the given equation f(n) = max( (f(n/2) + f(n/3) + f(n/4) + f(n/5)), n). Assesments: assert get_max_sum(60) == 106, assert get_max_sum(10) == 12, assert get_max_sum(2) == 2",84,0.036,45,1.8666666666666667,"Prompt: Write a function find the maximum sum possible by using the given equation f(n = max( (f(n/2 + n). Assesments: assert get_max_sum(60 106, 12 2",0.0,0.0743015214384509
"Prompt: Write a function to find the list with maximum length using lambda function. Assesments: assert max_length_list([[0], [1, 3], [5, 7], [9, 11], [13, 15, 17]])==(3, [13, 15, 17]), assert max_length_list([[1,2,3,4,5],[1,2,3,4],[1,2,3],[1,2],[1]])==(5,[1,2,3,4,5]), assert max_length_list([[3,4,5],[6,7,8,9],[10,11,12]])==(4,[6,7,8,9])",150,0.035,44,3.409090909090909,"Prompt: Write a function find the list with maximum length using lambda function Assesments: assert max_length_list([[0, 35 79 1113, 17]])==(3, [13 assert]),])",0.0,0.2316455328903462
"Prompt: Write a function to check if given tuple is distinct or not. Assesments: assert check_distinct((1, 4, 5, 6, 1, 4)) == False, assert check_distinct((1, 4, 5, 6)) == True, assert check_distinct((2, 3, 4, 5, 6)) == True",84,0.035,43,1.9534883720930232,"Prompt: Write a function to check given tuple distinct or Assesments: assert check_distinct((1 4, 5, 6, 1, 4 == False,)) True 3 True",0.0,0.08315827760004156
"Prompt: Write a python function to find the first non-repeated character in a given string. Assesments: assert first_non_repeating_character(""abcabc"") == None, assert first_non_repeating_character(""abc"") == ""a"", assert first_non_repeating_character(""ababc"") == ""c""",63,0.034,35,1.8,"Prompt: Write a python function find the first non-repeated character a given string Assesments: assert first_non_repeating_character(""abcabc == None, ""a""",0.0,0.06750079795722949
"Prompt: Write a function to check whether the given string starts and ends with the same character or not using regex. Assesments: assert check_char(""abba"") == ""Valid"", assert check_char(""a"") == ""Valid"", assert check_char(""abcd"") == ""Invalid""",57,0.033,37,1.5405405405405406,"Prompt: Write a function to check whether the given string starts and the same character or not using regex. Assesments: assert check_char(""abbaValid"", check_char(""abcd""",0.0,0.041033117381665096
"Prompt: Write a function to find the median of three specific numbers. Assesments: assert median_numbers(25,55,65)==55.0, assert median_numbers(20,10,30)==20.0, assert median_numbers(15,45,75)==45.0",59,0.03,27,2.185185185185185,"Prompt: Write a function find the median three specific numbers Assesments assert median_numbers(25,55,65)==55.0",0.0,0.10679386695984205
"Prompt: Write a function to compute the sum of digits of each number of a given list. Assesments: assert sum_of_digits([10,2,56])==14, assert sum_of_digits([[10,20,4,5,'b',70,'a']])==19, assert sum_of_digits([10,20,-4,5,-70])==19",77,0.03,29,2.6551724137931036,"Prompt: Write a function compute digits each number a given list Assesments assert sum_of_digits([10,2,56])==14,",0.0,0.15473766468186273
"Prompt: Write a function to perform the mathematical bitwise xor operation across the given tuples. Assesments: assert bitwise_xor((10, 4, 6, 9), (5, 2, 3, 3)) == (15, 6, 5, 10), assert bitwise_xor((11, 5, 7, 10), (6, 3, 4, 4)) == (13, 6, 3, 14), assert bitwise_xor((12, 6, 8, 11), (7, 4, 5, 6)) == (11, 2, 13, 13)",148,0.039,88,1.6818181818181819,"Prompt: Write a function to perform the mathematical bitwise xor operation across the given tuples Assesments: assert bitwise_xor((10 4, 6, 9), (5 2 3 3 == (15 6 5 10 assert 5 7 106 3 4 413 6 3 14 6 8 117 411 2 13 13)",0.0,0.055444969967791545
"Prompt: Write a function to extract the frequency of unique tuples in the given list order irrespective. Assesments: assert extract_freq([(3, 4), (1, 2), (4, 3), (5, 6)] ) == 3, assert extract_freq([(4, 15), (2, 3), (5, 4), (6, 7)] ) == 4, assert extract_freq([(5, 16), (2, 3), (6, 5), (6, 9)] ) == 4",118,0.039,67,1.7611940298507462,"Prompt: Write a function to extract the frequency of unique tuples in the given list order irrespective. Assesments: assert extract_freq([(3, 4), (1 24 35 6)] ) == 3, assert 152 35 4 7 4 162 36 56 9 4",0.0,0.06354216787114539
"Prompt: Write a function to perform index wise addition of tuple elements in the given two nested tuples. Assesments: assert add_nested_tuples(((1, 3), (4, 5), (2, 9), (1, 10)), ((6, 7), (3, 9), (1, 1), (7, 3))) == ((7, 10), (7, 14), (3, 10), (8, 13)), assert add_nested_tuples(((2, 4), (5, 6), (3, 10), (2, 11)), ((7, 8), (4, 10), (2, 2), (8, 4))) == ((9, 12), (9, 16), (5, 12), (10, 15)), assert add_nested_tuples(((3, 5), (6, 7), (4, 11), (3, 12)), ((8, 9), (5, 11), (3, 3), (9, 5))) == ((11, 14), (11, 18), (7, 14), (12, 17))",258,0.057,142,1.8169014084507042,"Prompt: Write a function to perform index wise addition of tuple elements in the given two nested tuples. Assesments: assert add_nested_tuples(((1, 3), (4 5 (2 91 10)), ((6 73 91 1), (7 3))) == ((7 10 (7 143 108 13)), assert add_nested_tuples(((2 45 63 102 117 8)4 102 28 4)))9 129 165 1210 15)), 56 74 113 12)),8 95 113 39 5)))11 1411 187 1412 17))",0.0,0.06922492503697576
"Prompt: Write a function to compute the value of ncr%p. Assesments: assert ncr_modp(10,2,13)==6, assert ncr_modp(15,12,43)==25, assert ncr_modp(17,9,18)==10",60,0.03,27,2.2222222222222223,"Prompt: Write a function compute ncr%p Assesments: assert ncr_modp(10,2,13)==6",0.0,0.11057204667163174
"Prompt: Write a function to check if a url is valid or not using regex. Assesments: assert is_valid_URL(""https://www.google.com"") == True, assert is_valid_URL(""https:/www.gmail.com"") == False, assert is_valid_URL(""https:// www.redit.com"") == False",63,0.032,35,1.8,"Prompt: Write a function to check a url valid or using regex. Assesments: assert is_valid_URL(""https://www.google.com == True, www.redit.com",0.0,0.06750079795722949
"Prompt: Write a python function to find the minimum of two numbers. Assesments: assert minimum(1,2) == 1, assert minimum(-5,-4) == -5, assert minimum(0,0) == 0",50,0.03,30,1.6666666666666667,"Prompt: Write a python function find the minimum of two numbers. Assesments: assert minimum(1,2, assert minimum(-5,-4",0.0,0.05389935099478668
"Prompt: Write a function to check whether an element exists within a tuple. Assesments: assert check_tuplex((""w"", 3, ""r"", ""e"", ""s"", ""o"", ""u"", ""r"", ""c"", ""e""),'r')==True, assert check_tuplex((""w"", 3, ""r"", ""e"", ""s"", ""o"", ""u"", ""r"", ""c"", ""e""),'5')==False, assert check_tuplex((""w"", 3, ""r"", ""e"", ""s"", ""o"", ""u"", ""r"", ""c"",""e""),3)==True",138,0.04,86,1.6046511627906976,"Prompt: Write a function to check whether an element exists within a tuple. Assesments: assert check_tuplex((""w"", 3, ""r"", ""e"", ""s"", ""o"", ""u"", ""r"", ""c"",e""),'r')==True, assert check_tuplex((""w 3ree""),'5')==False, assert 3c"",""e""),3)==True",0.0,0.04757309659365048
"Prompt: Write a python function to find the parity of a given number. Assesments: assert find_Parity(12) == ""Even Parity"", assert find_Parity(7) == ""Odd Parity"", assert find_Parity(10) == ""Even Parity""",58,0.032,34,1.7058823529411764,"Prompt: Write a python function find the parity of a given number. Assesments: assert find_Parity(12 ""Even Parity"", assertOdd Parity""",0.0,0.05789977657197573
"Prompt: Write a function to create the next bigger number by rearranging the digits of a given number. Assesments: assert rearrange_bigger(12)==21, assert rearrange_bigger(10)==False, assert rearrange_bigger(102)==120",54,0.031,25,2.16,Prompt: Write a function create the next bigger number by rearranging Assesments assert rearrange_bigger(12)==21,0.0,0.1042247047558251
"Prompt: Write a function to find k number of pairs which consist of one element from the first array and one element from the second array. Assesments: assert k_smallest_pairs([1,3,7],[2,4,6],2)==[[1, 2], [1, 4]], assert k_smallest_pairs([1,3,7],[2,4,6],1)==[[1, 2]], assert k_smallest_pairs([1,3,7],[2,4,6],7)==[[1, 2], [1, 4], [3, 2], [1, 6], [3, 4], [3, 6], [7, 2]]",152,0.039,70,2.1714285714285713,"Prompt: Write a function to find k number of pairs which consist one element from the first array and Assesments: assert k_smallest_pairs([1,3,7],[2,4,6],2)==[[1 2], [1 4] assert]], [3 2],1 63 43 67 2",0.0,0.10539054306689159
"Prompt: Write a function to find the minimum product from the pairs of tuples within a given list. Assesments: assert min_product_tuple([(2, 7), (2, 6), (1, 8), (4, 9)] )==8, assert min_product_tuple([(10,20), (15,2), (5,10)] )==30, assert min_product_tuple([(11,44), (10,15), (20,5), (12, 9)] )==100",107,0.037,67,1.5970149253731343,"Prompt: Write a function to find the minimum product from the pairs of tuples within a given list. Assesments: assert min_product_tuple([(2 72 61 8)4 9)] )==8, assert min_product_tuple([(10,2015,25,103010,1520,512 9100",0.0,0.04679411750694341
"Prompt: Write a function to find the minimum value in a given heterogeneous list. Assesments: assert min_val(['Python', 3, 2, 4, 5, 'version'])==2, assert min_val(['Python', 15, 20, 25])==15, assert min_val(['Python', 30, 20, 40, 50, 'version'])==20",85,0.034,51,1.6666666666666667,"Prompt: Write a function find the minimum value in a given heterogeneous list Assesments: assert min_val(['Python 3 2 4 'version'])==2, 15 20 25])==15 30 20 40,,",0.0,0.05389935099478668
"Prompt: Write a function to convert the given snake case string to camel case string by using regex. Assesments: assert snake_to_camel('android_tv') == 'AndroidTv', assert snake_to_camel('google_pixel') == 'GooglePixel', assert snake_to_camel('apple_watch') == 'AppleWatch'",66,0.032,43,1.5348837209302326,"Prompt: Write a function to convert the given snake case string camel case string by using regex. Assesments: assert snake_to_camel('android_tvAndroidTv', assert snake_to_camel('google_pixel'",0.0,0.040456060392372276
"Prompt: Write a python function to remove odd numbers from a given list. Assesments: assert remove_odd([1,2,3]) == [2], assert remove_odd([2,4,6]) == [2,4,6], assert remove_odd([10,20,3]) == [10,20]",70,0.031,50,1.4,"Prompt: Write a python function remove odd numbers a given list. Assesments: assert remove_odd([1,2,3 == [2], remove_odd([2,4,6 remove_odd([10,20,3]",0.0,0.02669645706990104
"Prompt: Write a function to extract the nth element from a given list of tuples. Assesments: assert extract_nth_element([('Greyson Fulton', 98, 99), ('Brady Kent', 97, 96), ('Wyatt Knott', 91, 94), ('Beau Turnbull', 94, 98)] ,0)==['Greyson Fulton', 'Brady Kent', 'Wyatt Knott', 'Beau Turnbull'], assert extract_nth_element([('Greyson Fulton', 98, 99), ('Brady Kent', 97, 96), ('Wyatt Knott', 91, 94), ('Beau Turnbull', 94, 98)] ,2)==[99, 96, 94, 98], assert extract_nth_element([('Greyson Fulton', 98, 99), ('Brady Kent', 97, 96), ('Wyatt Knott', 91, 94), ('Beau Turnbull', 94, 98)],1)==[98, 97, 91, 94]",231,0.051,146,1.582191780821918,"Prompt: Write a function to extract the nth element from a given list of tuples. Assesments: assert extract_nth_element([('Greyson Fulton', 98, 99), ('Brady Kent', 97, 96),Wyatt Knott 91, 94),Beau Turnbull 94, 98)] ,0)==['Greyson Fulton', 'Brady Kent', 'Wyatt Knott ''], assert extract_nth_element([('Greyson Fulton 98,Brady), ,2)==[99, 96, 94, 98], assert extract_nth_element([('Greyson Fulton 98 98)],1)==[98 97 91 94]",0.0,0.045281995898718466
"Prompt: Write a python function to check whether the value exists in a sequence or not. Assesments: assert overlapping([1,2,3,4,5],[6,7,8,9]) == False, assert overlapping([1,2,3],[4,5,6]) == False, assert overlapping([1,4,5],[1,4,5]) == True",81,0.032,24,3.375,"Prompt: Write a python function check whether the value exists a sequence or Assesments: assert]) == False, True",0.0,0.22816789020108524
"Prompt: Write a python function to find a pair with highest product from a given array of integers. Assesments: assert max_Product([1,2,3,4,7,0,8,4]) == (7,8), assert max_Product([0,-1,-2,-4,5,0,-6]) == (-4,-6), assert max_Product([1,2,3]) == (2,3)",90,0.032,48,1.875,"Prompt: Write a python function find a pair with highest product from a given array of integers Assesments: assert max_Product([1,2,3,4,7,0,8,4 (7,8 assert (]))",0.0,0.07515161187360357
"Prompt: Write a function to find the maximum sum we can make by dividing number in three parts recursively and summing them up together for the given number. Assesments: assert breakSum(12) == 13, assert breakSum(24) == 27, assert breakSum(23) == 23",64,0.033,35,1.8285714285714285,"Prompt: Write a function find the maximum sum we make by dividing number in three parts and together for Assesments assert breakSum(12 13, 27 23",0.0,0.0704153937348958
"Prompt: Write a function to find common first element in given list of tuple. Assesments: assert group_tuples([('x', 'y'), ('x', 'z'), ('w', 't')]) == [('x', 'y', 'z'), ('w', 't')], assert group_tuples([('a', 'b'), ('a', 'c'), ('d', 'e')]) == [('a', 'b', 'c'), ('d', 'e')], assert group_tuples([('f', 'g'), ('f', 'g'), ('h', 'i')]) == [('f', 'g', 'g'), ('h', 'i')]",142,0.046,81,1.7530864197530864,"Prompt: Write a function to find common first element in given list of tuple. Assesments: assert group_tuples([('x', 'y'), ('x',z'), ('wt')]) == [('x',z'),wt')], assert group_tuples([('ab ('ac'de') == [ac'de], assert group_tuples([('fgfghi') [fghi]",0.0,0.06271510365562924
"Prompt: Write a python function to find the sublist having maximum length. Assesments: assert Find_Max([['A'],['A','B'],['A','B','C']]) == ['A','B','C'], assert Find_Max([[1],[1,2],[1,2,3]]) == [1,2,3], assert Find_Max([[1,1],[1,2,3],[1,5,6,1]]) == [1,5,6,1]",103,0.036,55,1.8727272727272728,"Prompt: Write a python function find the sublist having maximum length. Assesments: assert Find_Max([['A'],['A','B'],['A','B','C]]) == [' assert Find_Max([[1],[1,2],[1,2,3 []",0.0,0.07491976902765285
"Prompt: Write a function to round every number of a given list of numbers and print the total sum multiplied by the length of the list. Assesments: assert round_and_sum([22.4, 4.0, -16.22, -9.10, 11.00, -12.22, 14.20, -5.20, 17.50])==243, assert round_and_sum([5,2,9,24.3,29])==345, assert round_and_sum([25.0,56.7,89.2])==513",123,0.035,53,2.3207547169811322,"Prompt: Write a function round every number of a given list numbers and print the total sum multiplied the length Assesments: assert round_and_sum([22.4 -16.22 -9.10 11.00 17.50])==243,",0.0,0.1206234304331854
"Prompt: Write a python function to find the cube sum of first n even natural numbers. Assesments: assert cube_Sum(2) == 72, assert cube_Sum(3) == 288, assert cube_Sum(4) == 800",54,0.03,33,1.6363636363636365,"Prompt: Write a python function find the cube sum first n even natural numbers Assesments: assert cube_Sum(2) 72, 288 800",0.0,0.05080811304877696
"Prompt: Write a function to concatenate each element of tuple by the delimiter. Assesments: assert concatenate_tuple((""ID"", ""is"", 4, ""UTS"") ) == 'ID-is-4-UTS', assert concatenate_tuple((""QWE"", ""is"", 4, ""RTY"") ) == 'QWE-is-4-RTY', assert concatenate_tuple((""ZEN"", ""is"", 4, ""OP"") ) == 'ZEN-is-4-OP'",100,0.038,54,1.8518518518518519,"Prompt: Write a function to concatenate each element tuple by the delimiter. Assesments: assert concatenate_tuple((""IDis"", 4,UTS"") ) == 'ID-is-4-UTS', assert concatenate_tuple((""QWEisRTYOP"")'",0.0,0.07279024955373503
"Prompt: Write a python function to find the average of cubes of first n natural numbers. Assesments: assert find_Average_Of_Cube(2) == 4.5, assert find_Average_Of_Cube(3) == 12, assert find_Average_Of_Cube(1) == 1",68,0.031,38,1.7894736842105263,"Prompt: Write a python function find the average of cubes first n natural numbers Assesments: assert find_Average_Of_Cube(2 4.5, 12 1",0.0,0.06642699951282612
"Prompt: Write a function to solve gold mine problem. Assesments: assert get_maxgold([[1, 3, 1, 5],[2, 2, 4, 1],[5, 0, 2, 3],[0, 6, 1, 2]],4,4)==16, assert get_maxgold([[10,20],[30,40]],2,2)==70, assert get_maxgold([[4,9],[3,7]],2,2)==13",107,0.032,51,2.0980392156862746,"Prompt: Write a function solve gold mine problem Assesments: assert get_maxgold([[1 3 1 5],[2 1],[5 0 2 3],[0 6 2]],4,4)==16, assert",0.0,0.09790403234386637
"Prompt: Write a function to extract only the rear index element of each string in the given tuple. Assesments: assert extract_rear(('Mers', 'for', 'Vers') ) == ['s', 'r', 's'], assert extract_rear(('Avenge', 'for', 'People') ) == ['e', 'r', 'e'], assert extract_rear(('Gotta', 'get', 'go') ) == ['a', 't', 'o']",100,0.038,67,1.492537313432836,"Prompt: Write a function to extract only the rear index element of each string in the given tuple Assesments: assert extract_rear(('Mers', 'for', 'Vers') ) == ['s',r 's' assert extract_rear(('Avenge 'Peopleere extract_rear(('Gotta',getgoato",0.0,0.03613626727517853
"Prompt: Write a function to count the number of sublists containing a particular element. Assesments: assert count_element_in_list([[1, 3], [5, 7], [1, 11], [1, 15, 7]],1)==3, assert count_element_in_list([['A', 'B'], ['A', 'C'], ['A', 'D', 'E'], ['B', 'C', 'D']],'A')==3, assert count_element_in_list([['A', 'B'], ['A', 'C'], ['A', 'D', 'E'], ['B', 'C', 'D']],'E')==1",140,0.043,91,1.5384615384615385,"Prompt: Write a function to count the number sublists containing a particular element. Assesments: assert count_element_in_list([[1, 3], [5, 7], [1 11],1 15, 7]],1)==3, assert count_element_in_list([['A', 'B' ['A',CAD',EBC',D']],'A')==3, assert'A',D']],'E')==1",0.0,0.04082103660782244
"Prompt: Write a function to filter odd numbers using lambda function. Assesments: assert filter_oddnumbers([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[1,3,5,7,9], assert filter_oddnumbers([10,20,45,67,84,93])==[45,67,93], assert filter_oddnumbers([5,7,9,8,6,4,3])==[5,7,9,3]",120,0.031,65,1.8461538461538463,"Prompt: Write a function to filter odd numbers using lambda function Assesments: assert filter_oddnumbers([1 10])==[1,3,5,7,9], assert filter_oddnumbers([10,20,45,67,84,93])==[45,67,93],]",0.0,0.07220899113653663
"Prompt: Write a function to convert a date of yyyy-mm-dd format to dd-mm-yyyy format by using regex. Assesments: assert change_date_format(""2026-01-02"") == '02-01-2026', assert change_date_format(""2020-11-13"") == '13-11-2020', assert change_date_format(""2021-04-26"") == '26-04-2021'",90,0.038,50,1.8,"Prompt: Write a function to convert a date of yyyy-mm-dd format dd-mm-yyyy format by using regex. Assesments: assert change_date_format(""2026-0102 == '02-2026 assert1113131120200426'",0.0,0.06750079795722949
"Prompt: Write a function to sort the given array by using shell sort. Assesments: assert shell_sort([12, 23, 4, 5, 3, 2, 12, 81, 56, 95]) == [2, 3, 4, 5, 12, 12, 23, 56, 81, 95], assert shell_sort([24, 22, 39, 34, 87, 73, 68]) == [22, 24, 34, 39, 68, 73, 87], assert shell_sort([32, 30, 16, 96, 82, 83, 74]) == [16, 30, 32, 74, 82, 83, 96]",175,0.041,112,1.5625,Prompt: Write a function to sort the given array by using shell sort. Assesments: assert shell_sort([12 23 4 5 3 12 81 56 95 == [2 3 12 12 23 56 81 95 assert shell_sort([24 22 39 34 87 73 68])22 24 34 39 68 73 87 30 16 96 82 83 7416 30 32 74 82 96],0.0,0.04327322055537823
"Prompt: Write a function to extract the elementwise and tuples from the given two tuples. Assesments: assert and_tuples((10, 4, 6, 9), (5, 2, 3, 3)) == (0, 0, 2, 1), assert and_tuples((1, 2, 3, 4), (5, 6, 7, 8)) == (1, 2, 3, 0), assert and_tuples((8, 9, 11, 12), (7, 13, 14, 17)) == (0, 9, 10, 0)",145,0.04,80,1.8125,"Prompt: Write a function to extract the elementwise and tuples the given two tuples Assesments: assert and_tuples((10 4, 6, 9), (5 2 3 3 == (0 0 2 1), assert 25 6 7,1 0 9 117 13, 170 9 10 0)",0.0,0.0687759336099585
"Prompt: Write a function to find the directrix of a parabola. Assesments: assert parabola_directrix(5,3,2)==-198, assert parabola_directrix(9,8,4)==-2336, assert parabola_directrix(2,4,6)==-130",64,0.029,29,2.206896551724138,"Prompt: Write a function find the directrix a parabola Assesments assert parabola_directrix(5,3,2)==-198",0.0,0.10900866196330497
"Prompt: Write a function that takes two lists and returns true if they have at least one common element. Assesments: assert common_element([1,2,3,4,5], [5,6,7,8,9])==True, assert common_element([1,2,3,4,5], [6,7,8,9])==None, assert common_element(['a','b','c'], ['d','b','e'])==True",98,0.032,57,1.719298245614035,"Prompt: Write a function takes two lists and true they have at least one common element Assesments: assert common_element([1,2,3,4,5 [5,6,7,8,9])==True, assertd','b','e'])==True",0.0,0.059268343216803576
"Prompt: Write a function to find the median of a trapezium. Assesments: assert median_trapezium(15,25,35)==20, assert median_trapezium(10,20,30)==15, assert median_trapezium(6,9,4)==7.5",65,0.029,29,2.2413793103448274,"Prompt: Write a function find the median a trapezium Assesments assert median_trapezium(15,25,35)==20",0.0,0.11252627755704016
"Prompt: Write a function to check whether the entered number is greater than the elements of the given array. Assesments: assert check_greater([1, 2, 3, 4, 5], 4) == 'No, entered number is less than those in the array', assert check_greater([2, 3, 4, 5, 6], 8) == 'Yes, the entered number is greater than those in the array', assert check_greater([9, 7, 4, 8, 6, 1], 11) == 'Yes, the entered number is greater than those in the array'",138,0.038,75,1.84,"Prompt: Write a function to check whether the entered number greater the elements of the given array Assesments: assert check_greater([1,,,], 4) == 'No, entered number is less those in the array', assert, 8)Yes the entered number greater check_greater([9 7 4 8 6, 1 11'",0.0,0.07158123204596234
"Prompt: Write a function that matches a string that has an a followed by one or more b's. Assesments: assert text_match_one(""ac"")==('Not matched!'), assert text_match_one(""dc"")==('Not matched!'), assert text_match_one(""abba"")==('Found a match!')",62,0.03,34,1.8235294117647058,"Prompt: Write a function matches a string that has an a followed one or more b's Assesments: assert text_match_one(""ac"")==('Not matched!'!",0.0,0.06990105330354292
"Prompt: Write a python function to find the last digit of a given number. Assesments: assert last_Digit(123) == 3, assert last_Digit(25) == 5, assert last_Digit(30) == 0",52,0.034,31,1.6774193548387097,"Prompt: Write a python function find the last digit a given number Assesments: assert last_Digit(123 3, assert 5 0",0.0,0.05499624187885465
"Prompt: Write a python function to print negative numbers in a list. Assesments: assert neg_nos([-1,4,5,-6]) == -1,-6, assert neg_nos([-1,-2,3,4]) == -1,-2, assert neg_nos([-7,-6,8,9]) == -7,-6",74,0.03,36,2.0555555555555554,"Prompt: Write a python function print negative numbers in a list. Assesments: assert neg_nos([-1,4,5,-6 == -1,-6, assert",0.0,0.09357023796857819
"Prompt: Write a function to remove odd characters in a string. Assesments: assert remove_odd(""python"")==(""yhn""), assert remove_odd(""program"")==(""rga""), assert remove_odd(""language"")==(""agae"")",50,0.028,41,1.2195121951219512,"Prompt: Write a function remove odd characters in Assesments: assert remove_odd(""python"")==(""yhn remove_odd(""program"")==(""rga remove_odd(""language"")==(""agae",0.0,0.00828474227927724
"Prompt: Write a function to count bidirectional tuple pairs. Assesments: assert count_bidirectional([(5, 6), (1, 2), (6, 5), (9, 1), (6, 5), (2, 1)] ) == '3', assert count_bidirectional([(5, 6), (1, 3), (6, 5), (9, 1), (6, 5), (2, 1)] ) == '2', assert count_bidirectional([(5, 6), (1, 2), (6, 5), (9, 2), (6, 5), (2, 1)] ) == '4'",151,0.044,84,1.7976190476190477,"Prompt: Write a function to count bidirectional tuple pairs. Assesments: assert count_bidirectional([(5, 6), (1, 2), (6, 5), (9, 1), (6 5),2, 1)] ) == '3', assert count_bidirectional([(5 61 36 59 ) ==2 assert 2 2 5 14'",0.0,0.0672579149757573
"Prompt: Write a function to convert a list of multiple integers into a single integer. Assesments: assert multiple_to_single([11, 33, 50])==113350, assert multiple_to_single([-1,2,3,4,5,6])==-123456, assert multiple_to_single([10,15,20,25])==10152025",76,0.032,27,2.814814814814815,"Prompt: Write a function convert multiple integers Assesments: assert multiple_to_single([11 33 50])==113350,",0.0,0.17102292206026645
"Prompt: Write a function to find all adverbs and their positions in a given sentence. Assesments: assert find_adverb_position(""clearly!! we can see the sky"")==(0, 7, 'clearly'), assert find_adverb_position(""seriously!! there are many roses"")==(0, 9, 'seriously'), assert find_adverb_position(""unfortunately!! sita is going to home"")==(0, 13, 'unfortunately')",96,0.035,57,1.6842105263157894,"Prompt: Write a function to find all adverbs and their positions a given sentence Assesments: assert find_adverb_position(""clearly!! we can see the sky"")==(0, 7 ' there many roses"")==(0 9 sita going home"")==(0 13",0.0,0.0556890150687923
"Prompt: Write a function to find the surface area of a cube. Assesments: assert surfacearea_cube(5)==150, assert surfacearea_cube(3)==54, assert surfacearea_cube(10)==600",44,0.028,22,2.0,Prompt: Write a function find the surface area a cube Assesments assert surfacearea_cube(5)==150,0.0,0.0879029684008937
"Prompt: Write a function to find the ration of positive numbers in an array of integers. Assesments: assert positive_count([0, 1, 2, -1, -5, 6, 0, -3, -2, 3, 4, 6, 8])==0.54, assert positive_count([2, 1, 2, -1, -5, 6, 4, -3, -2, 3, 4, 6, 8])==0.69, assert positive_count([2, 4, -6, -9, 11, -12, 14, -5, 17])==0.56",150,0.037,85,1.7647058823529411,"Prompt: Write a function to find the ration of positive numbers in an array of integers Assesments: assert positive_count([0 1,, -1, -5, 6 0 -3 -2 3 4, 6 8])==0.54, 1 4 -3 4 -6 -9 11 -12 14 -5 17])==0.56",0.0,0.06390041493775933
"Prompt: Write a python function to find the largest negative number from the given list. Assesments: assert largest_neg([1,2,3,-4,-6]) == -6, assert largest_neg([1,2,3,-8,-9]) == -9, assert largest_neg([1,2,3,4,-1]) == -1",74,0.031,38,1.9473684210526316,"Prompt: Write a python function to find the largest negative number from the given list Assesments: assert largest_neg([1,2,3,-4,-6 == -6, assert",0.0,0.08253397617887681
"Prompt: Write a function to trim each tuple by k in the given tuple list. Assesments: assert trim_tuple([(5, 3, 2, 1, 4), (3, 4, 9, 2, 1),(9, 1, 2, 3, 5), (4, 8, 2, 1, 7)], 2) == '[(2,), (9,), (2,), (2,)]', assert trim_tuple([(5, 3, 2, 1, 4), (3, 4, 9, 2, 1), (9, 1, 2, 3, 5), (4, 8, 2, 1, 7)], 1) == '[(3, 2, 1), (4, 9, 2), (1, 2, 3), (8, 2, 1)]', assert trim_tuple([(7, 8, 4, 9), (11, 8, 12, 4),(4, 1, 7, 8), (3, 6, 9, 7)], 1) == '[(8, 4), (8, 12), (1, 7), (6, 9)]'",287,0.052,163,1.7607361963190185,"Prompt: Write a function to trim each tuple by k in the given tuple list. Assesments: assert trim_tuple([(5 3, 2, 1, 4), (3 4 9 2 1),(9 1 2 3, 5), (4 8 2 1, 7)], 2) == '[(2), (9),2),2)]', assert trim_tuple([(5 ( 13 2, 14 9),1 2, 3),8 2)] assert trim_tuple([(7 8 4 911 8 12, 4),(4 1 7, 8)3 6 9 7) 18 48 121 76 9)]'",0.0,0.06349546388239971
"Prompt: Write a function to perform index wise multiplication of tuple elements in the given two tuples. Assesments: assert index_multiplication(((1, 3), (4, 5), (2, 9), (1, 10)),((6, 7), (3, 9), (1, 1), (7, 3)) ) == ((6, 21), (12, 45), (2, 9), (7, 30)), assert index_multiplication(((2, 4), (5, 6), (3, 10), (2, 11)),((7, 8), (4, 10), (2, 2), (8, 4)) ) == ((14, 32), (20, 60), (6, 20), (16, 44)), assert index_multiplication(((3, 5), (6, 7), (4, 11), (3, 12)),((8, 9), (5, 11), (3, 3), (9, 5)) ) == ((24, 45), (30, 77), (12, 33), (27, 60))",260,0.052,171,1.5204678362573099,"Prompt: Write a function to perform index wise multiplication of tuple elements in the given two tuples. Assesments: assert index_multiplication(((1, 3), (4 5), (2 91 10)),((6 73 91 1), (7 3)) ) == ((6, 21), (12, 45), (2, 9), (7, 30)), assert index_multiplication(((2 45 63 10),2 11)),((7 8)4 102 2),8 4))14 3220 606 2016 44)), assert index_multiplication(((3 56 74 113 12)),((8 95 113 39 5))24 4530 7712 3327 60))",0.0,0.038985483711406387
"Prompt: Write a python function to count the occurence of all elements of list in a tuple. Assesments: assert count_Occurrence(('a', 'a', 'c', 'b', 'd'),['a', 'b'] ) == 3, assert count_Occurrence((1, 2, 3, 1, 4, 6, 7, 1, 4),[1, 4, 7]) == 6, assert count_Occurrence((1,2,3,4,5,6),[1,2]) == 2",126,0.035,70,1.8,"Prompt: Write a python function to count the occurence all elements of list in a tuple Assesments: assert count_Occurrence(('aacbd'),['a ) == 3, assert count_Occurrence((1 1 4 6 7 1 4),[1 4 7]) 6]) 2",0.0,0.06750079795722949
"Prompt: Write a function to find cubes of individual elements in a list using lambda function. Assesments: assert cube_nums([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[1, 8, 27, 64, 125, 216, 343, 512, 729, 1000], assert cube_nums([10,20,30])==([1000, 8000, 27000]), assert cube_nums([12,15])==([1728, 3375])",127,0.035,84,1.5119047619047619,"Prompt: Write a function find cubes of individual elements in using lambda function Assesments: assert cube_nums([1 10])==[1 8 27 64 125 216 343 512 729 1000 assert cube_nums([10,20,30])==([1000 8000 27000]), cube_nums([12,15])==([1728 3375])",0.0,0.03811195719909412
"Prompt: Write a function to calculate the sum of perrin numbers. Assesments: assert cal_sum(9) == 49, assert cal_sum(10) == 66, assert cal_sum(11) == 88",47,0.028,28,1.6785714285714286,"Prompt: Write a function calculate the sum perrin numbers. Assesments: assert cal_sum(9 49, 66 88",0.0,0.05511376590214764
"Prompt: Write a python function to check whether the triangle is valid or not if 3 points are given. Assesments: assert check_Triangle(1,5,2,5,4,6) == 'Yes', assert check_Triangle(1,1,1,4,1,5) == 'No', assert check_Triangle(1,1,1,1,1,1) == 'No'",89,0.03,42,2.119047619047619,"Prompt: Write a python function check whether the triangle valid or if 3 points given Assesments: assert check_Triangle(1,5,2,5,4,6) == 'Yes'",0.0,0.10004711747450336
"Prompt: Write a function to extract specified size of strings from a give list of string values. Assesments: assert extract_string(['Python', 'list', 'exercises', 'practice', 'solution'] ,8)==['practice', 'solution'], assert extract_string(['Python', 'list', 'exercises', 'practice', 'solution'] ,6)==['Python'], assert extract_string(['Python', 'list', 'exercises', 'practice', 'solution'] ,9)==['exercises']",102,0.038,62,1.6451612903225807,"Prompt: Write a function to extract specified size of strings from a give list of string values. Assesments: assert extract_string(['Python', 'list', 'exercises',practicesolution'] ,8)==['practice', ''], assertlist6)==['Python'9)==['exercises']",0.0,0.05170556922665075
"Prompt: Write a function to remove all whitespaces from the given string using regex. Assesments: assert remove_whitespaces(' Google    Flutter ') == 'GoogleFlutter', assert remove_whitespaces(' Google    Dart ') == 'GoogleDart', assert remove_whitespaces(' iOS    Swift ') == 'iOSSwift'",69,0.034,38,1.8157894736842106,"Prompt: Write a function remove all whitespaces the given string using regex Assesments: assert remove_whitespaces(' Google Flutter) ==GoogleFlutter', assert Google Dart iOS Swift'",0.0,0.06911149562383456
"Prompt: Write a function that gives loss amount if the given amount has loss else return none. Assesments: assert loss_amount(1500,1200)==None, assert loss_amount(100,200)==100, assert loss_amount(2000,5000)==3000",57,0.031,26,2.1923076923076925,"Prompt: Write a function gives loss amount if loss else none Assesments assert loss_amount(1500,1200)==None",0.0,0.10752043998134009
"Prompt: Write a python function to find the sum of even factors of a number. Assesments: assert sumofFactors(18) == 26, assert sumofFactors(30) == 48, assert sumofFactors(6) == 8",53,0.028,31,1.7096774193548387,"Prompt: Write a python function find the sum even factors of a number Assesments: assert sumofFactors(18 26, 48 8",0.0,0.05828691453105855
"Prompt: Write a function that matches a word containing 'z'. Assesments: assert text_match_wordz(""pythonz."")==('Found a match!'), assert text_match_wordz(""xyz."")==('Found a match!'), assert text_match_wordz(""  lang  ."")==('Not matched!')",64,0.029,33,1.9393939393939394,"Prompt: Write a function matches a word containing 'z Assesments: assert text_match_wordz(""pythonz."")==('Found a match!' lang matched!",0.0,0.08172049250887425
"Prompt: Write a function to check whether the given month number contains 31 days or not. Assesments: assert check_monthnumb_number(5)==True, assert check_monthnumb_number(2)==False, assert check_monthnumb_number(6)==False",55,0.027,28,1.9642857142857142,Prompt: Write a function check the given month number contains 31 days Assesments: assert check_monthnumb_number(5)==True,0.0,0.08425972367881081
"Prompt: Write a function to reverse strings in a given list of string values. Assesments: assert reverse_string_list(['Red', 'Green', 'Blue', 'White', 'Black'])==['deR', 'neerG', 'eulB', 'etihW', 'kcalB'], assert reverse_string_list(['john','amal','joel','george'])==['nhoj','lama','leoj','egroeg'], assert reverse_string_list(['jack','john','mary'])==['kcaj','nhoj','yram']",115,0.033,94,1.2234042553191489,"Prompt: Write a function to reverse strings in a given list of string values Assesments: assert reverse_string_list(['Red',WhiteBlack'])==['deRneerGeulBetihWkcalB' assert reverse_string_list(['john','amal','joel','george'])==['nhoj','lama','leoj','egroeg' reverse_string_list(['jack','john','mary'])==['kcaj','nhoj','yram']",0.0,0.008681774656878381
"Prompt: Write a python function to find the sublist having minimum length. Assesments: assert Find_Min([[1],[1,2],[1,2,3]]) == [1], assert Find_Min([[1,1],[1,1,1],[1,2,7,8]]) == [1,1], assert Find_Min([['x'],['x','y'],['x','y','z']]) == ['x']",91,0.031,39,2.3333333333333335,"Prompt: Write a python function find the sublist having minimum length. Assesments: assert Find_Min([[1],[1,2],[1,2,3) == [], assert]] ['",0.0,0.12190658580700076
"Prompt: Write a function to find the area of a rectangle. Assesments: assert rectangle_area(10,20)==200, assert rectangle_area(10,5)==50, assert rectangle_area(4,2)==8",46,0.026,22,2.090909090909091,"Prompt: Write a function find the area a rectangle Assesments assert rectangle_area(10,20)==200",0.0,0.0971766822389229
"Prompt: Write a function to remove uppercase substrings from a given string by using regex. Assesments: assert remove_uppercase('cAstyoUrFavoRitETVshoWs') == 'cstyoravoitshos', assert remove_uppercase('wAtchTheinTernEtrAdIo') == 'wtchheinerntrdo', assert remove_uppercase('VoicESeaRchAndreComMendaTionS') == 'oiceachndreomendaion'",105,0.032,91,1.1538461538461537,Prompt: Write a function remove uppercase substrings a given string by regex. Assesments: assert remove_uppercase('cAstyoUrFavoRitETVshoWs ==cstyoravoitshos assert remove_uppercase('wAtchTheinTernEtrAdIowtchheinerntrdo remove_uppercase('VoicESeaRchAndreComMendaTionSoiceachndreomendaion',0.0,0.0015860934469296923
"Prompt: Write a python function to get the first element of each sublist. Assesments: assert Extract([[1, 2], [3, 4, 5], [6, 7, 8, 9]]) == [1, 3, 6], assert Extract([[1,2,3],[4, 5]]) == [1,4], assert Extract([[9,8,1],[1,2]]) == [9,1]",98,0.033,60,1.6333333333333333,"Prompt: Write a python function to get the first element each sublist. Assesments: assert Extract([[1 2,,]]) == [ 3 6], assert Extract([[1,2,3],[4]]], Extract([[9,8,1],[1,29,1]",0.0,0.050498989254175966
"Prompt: Write a python function to count the upper case characters in a given string. Assesments: assert upper_ctr('PYthon') == 1, assert upper_ctr('BigData') == 1, assert upper_ctr('program') == 0",52,0.031,40,1.3,"Prompt: Write a python function count the upper case characters in a given string Assesments: assert upper_ctr('PYthon 1, upper_ctr('BigData assert upper_ctr('program 0",0.0,0.016495371848068943
"Prompt: Write a function to find all possible combinations of the elements of a given list. Assesments: assert combinations_list(['orange', 'red', 'green', 'blue'])==[[], ['orange'], ['red'], ['red', 'orange'], ['green'], ['green', 'orange'], ['green', 'red'], ['green', 'red', 'orange'], ['blue'], ['blue', 'orange'], ['blue', 'red'], ['blue', 'red', 'orange'], ['blue', 'green'], ['blue', 'green', 'orange'], ['blue', 'green', 'red'], ['blue', 'green', 'red', 'orange']], assert combinations_list(['red', 'green', 'blue', 'white', 'black', 'orange'])==[[], ['red'], ['green'], ['green', 'red'], ['blue'], ['blue', 'red'], ['blue', 'green'], ['blue', 'green', 'red'], ['white'], ['white', 'red'], ['white', 'green'], ['white', 'green', 'red'], ['white', 'blue'], ['white', 'blue', 'red'], ['white', 'blue', 'green'], ['white', 'blue', 'green', 'red'], ['black'], ['black', 'red'], ['black', 'green'], ['black', 'green', 'red'], ['black', 'blue'], ['black', 'blue', 'red'], ['black', 'blue', 'green'], ['black', 'blue', 'green', 'red'], ['black', 'white'], ['black', 'white', 'red'], ['black', 'white', 'green'], ['black', 'white', 'green', 'red'], ['black', 'white', 'blue'], ['black', 'white', 'blue', 'red'], ['black', 'white', 'blue', 'green'], ['black', 'white', 'blue', 'green', 'red'], ['orange'], ['orange', 'red'], ['orange', 'green'], ['orange', 'green', 'red'], ['orange', 'blue'], ['orange', 'blue', 'red'], ['orange', 'blue', 'green'], ['orange', 'blue', 'green', 'red'], ['orange', 'white'], ['orange', 'white', 'red'], ['orange', 'white', 'green'], ['orange', 'white', 'green', 'red'], ['orange', 'white', 'blue'], ['orange', 'white', 'blue', 'red'], ['orange', 'white', 'blue', 'green'], ['orange', 'white', 'blue', 'green', 'red'], ['orange', 'black'], ['orange', 'black', 'red'], ['orange', 'black', 'green'], ['orange', 'black', 'green', 'red'], ['orange', 'black', 'blue'], ['orange', 'black', 'blue', 'red'], ['orange', 'black', 'blue', 'green'], ['orange', 'black', 'blue', 'green', 'red'], ['orange', 'black', 'white'], ['orange', 'black', 'white', 'red'], ['orange', 'black', 'white', 'green'], ['orange', 'black', 'white', 'green', 'red'], ['orange', 'black', 'white', 'blue'], ['orange', 'black', 'white', 'blue', 'red'], ['orange', 'black', 'white', 'blue', 'green'], ['orange', 'black', 'white', 'blue', 'green', 'red']], assert combinations_list(['red', 'green', 'black', 'orange'])==[[], ['red'], ['green'], ['green', 'red'], ['black'], ['black', 'red'], ['black', 'green'], ['black', 'green', 'red'], ['orange'], ['orange', 'red'], ['orange', 'green'], ['orange', 'green', 'red'], ['orange', 'black'], ['orange', 'black', 'red'], ['orange', 'black', 'green'], ['orange', 'black', 'green', 'red']]",850,0.19,511,1.6634050880626223,"Prompt: Write a function to find all possible combinations of the elements of a given list. Assesments: assert combinations_list(['orange', 'red',green', 'blue'])==[[], ['orange'], ['red'], ['red', 'orange'], ['green'], ['green',orange'], ['green',red'], ['green',red', 'orange'], ['blue'], ['blue',orange'], ['blue',red'], ['bluered',orange'], ['blue',green'], ['bluegreen',orange'], ['bluegreen',red'], ['bluegreenred',orange']], assert combinations_list(['red', 'green',blue', 'white', 'black', 'orange'])==],red'],green'],green',red'],blue'bluered'bluegreen'bluegreen',red'],white'white', 'red'], ['whitegreen'], ['whitegreen',red'], ['whiteblue'],whiteblue',red'],whiteblue',green'], ['whitebluegreen',red'], ['black' ['black 'red'], ['blackgreen'],green',red'],blackblue'blue',red'],blackblue',green'blackbluegreen',red'],blackwhite' ['blackwhite',red'],blackwhitegreen'blackwhitegreen',red],blackwhiteblue'blackwhiteblue',red],blackwhiteblue',green'whiteblue',green',red],orange'orange 'red'],orangegreen'orangegreen',red'],orangeblue'orangeblueredorangebluegreen'orangebluegreen',red],orangewhite' ['orangewhitered],orangewhite',green'], ['orangewhitegreen',red],orangewhiteblue'orangewhiteblue',red],orangewhiteblue',green'orangewhiteblue',green',red],orangeblack'orangeblackred'blackgreen'orangeblackgreen',redorangeblackblue'orangeblackblue',redorangeblackblue',green'orangeblackbluegreen',red],orangeblackwhite'orangeblackwhite',red],orangeblackwhite',green'orangeblackwhitegreen',red],orangeblackwhiteblue'orangeblackwhiteblue',redorangeblackwhiteblue',green'orangeblackwhiteblue',green',red']], assert combinations_list(['redgreen',black',orange'])==red'green'greenred'black'blackred'blackgreen'blackgreen',red'orange'red'green'orangegreenred'orangeblack'orangeblackred'orangeblackgreen'orangeblackgreen',red']]",0.01,0.05356663458181107
"Prompt: Write a function to find the maximum product subarray of the given array. Assesments: assert max_subarray_product([1, -2, -3, 0, 7, -8, -2]) == 112, assert max_subarray_product([6, -3, -10, 0, 2]) == 180 , assert max_subarray_product([-2, -40, 0, -2, -3]) == 80",98,0.035,57,1.719298245614035,"Prompt: Write a function to find the maximum product subarray of the given array Assesments: assert max_subarray_product([1 -2 0 7 -8 -2 == 112, -10 2]) 180 , -40 0 -2 80",0.0,0.059268343216803576
"Prompt: Write a function to check if all values are same in a dictionary. Assesments: assert check_value({'Cierra Vega': 12, 'Alden Cantrell': 12, 'Kierra Gentry': 12, 'Pierre Cox': 12},10)==False, assert check_value({'Cierra Vega': 12, 'Alden Cantrell': 12, 'Kierra Gentry': 12, 'Pierre Cox': 12},12)==True, assert check_value({'Cierra Vega': 12, 'Alden Cantrell': 12, 'Kierra Gentry': 12, 'Pierre Cox': 12},5)==False",139,0.039,87,1.5977011494252873,"Prompt: Write a function to check if all values are same in a dictionary. Assesments: assert check_value({'Cierra Vega': 12, 'Alden Cantrell': 12, 'Kierra Gentry 12,Pierre Cox 12},10)==False, assert check_value({'Cierra Vega 12 12},12)==True, assert check_value({'Cierra 12 12},5)==False",0.0,0.04686411980731625
"Prompt: Write a function to drop empty items from a given dictionary. Assesments: assert drop_empty({'c1': 'Red', 'c2': 'Green', 'c3':None})=={'c1': 'Red', 'c2': 'Green'}, assert drop_empty({'c1': 'Red', 'c2': None, 'c3':None})=={'c1': 'Red'}, assert drop_empty({'c1': None, 'c2': 'Green', 'c3':None})=={ 'c2': 'Green'}",117,0.038,59,1.9830508474576272,"Prompt: Write a function to drop empty items from a given dictionary. Assesments: assert drop_empty({'c1': 'Red', ' 'Greenc3':None})=={'c1 'Red'}, assertRed None,Red'}, None 'Green', 'c2 'Green'}",0.0,0.08617397090566793
"Prompt: Write a function to find the peak element in the given array. Assesments: assert find_peak([1, 3, 20, 4, 1, 0], 6) == 2, assert find_peak([2, 3, 4, 5, 6], 5) == 4, assert find_peak([8, 9, 11, 12, 14, 15], 6) == 5",99,0.034,61,1.6229508196721312,"Prompt: Write a function to find the peak element in the given array Assesments: assert find_peak([1 3 20 4 1 0], 6) == 2, 4 5 6 5 4 9 11 14 6 5",0.0,0.04943986018742838
"Prompt: Write a python function to convert decimal number to octal number. Assesments: assert decimal_to_Octal(10) == 12, assert decimal_to_Octal(2) == 2, assert decimal_to_Octal(33) == 41",54,0.03,31,1.7419354838709677,"Prompt: Write a python function convert decimal number octal number Assesments: assert decimal_to_Octal(10) 12, 2 41",0.0,0.06157758718326246
"Prompt: Write a function to find the maximum product formed by multiplying numbers of an increasing subsequence of that array. Assesments: assert max_product([3, 100, 4, 5, 150, 6], 6) == 45000 , assert max_product([4, 42, 55, 68, 80], 5) == 50265600, assert max_product([10, 22, 9, 33, 21, 50, 41, 60], 8) == 21780000",118,0.035,75,1.5733333333333333,"Prompt: Write a function find the maximum product formed multiplying numbers an increasing subsequence that array Assesments: assert max_product([3 100 4 150 6 6 == 45000 , 42 55 68 80 5 50265600, 22 9 33 21 50 41 60 21780000",0.0,0.0443783381210767
"Prompt: Write a function to find the maximum profit earned from a maximum of k stock transactions Assesments: assert max_profit([1, 5, 2, 3, 7, 6, 4, 5], 3) == 10, assert max_profit([2, 4, 7, 5, 4, 3, 5], 2) == 7, assert max_profit([10, 6, 8, 4, 2], 2) == 2",111,0.023,67,1.6567164179104477,"Prompt: Write a function find the maximum profit earned a maximum of k stock transactions Assesments assert max_profit([1 5 2 7 6 4 3) == 10, assert 4 5 4 3 5 2 7 6 8 4 2], 2",0.0,0.052884317639380486
"Prompt: Write a function to find the pairwise addition of the elements of the given tuples. Assesments: assert add_pairwise((1, 5, 7, 8, 10)) == (6, 12, 15, 18), assert add_pairwise((2, 6, 8, 9, 11)) == (8, 14, 17, 20), assert add_pairwise((3, 7, 9, 10, 12)) == (10, 16, 19, 22)",119,0.036,69,1.7246376811594204,"Prompt: Write a function to find the pairwise addition of the elements the given tuples Assesments: assert add_pairwise((1 5, 7, 8 10 == (6 12 15 18), 6 8 118 14 17 7 1210 16 19 22)",0.0,0.059813023587153125
"Prompt: Write a python function to find remainder of array multiplication divided by n. Assesments: assert find_remainder([ 100, 10, 5, 25, 35, 14 ],6,11) ==9, assert find_remainder([1,1,1],3,1) == 0, assert find_remainder([1,2,1],3,2) == 0",87,0.033,38,2.289473684210526,"Prompt: Write a python function find remainder array multiplication divided Assesments: assert find_remainder([ 100 10 5 25 35 146,119, assert 0",0.0,0.11743242562198664
"Prompt: Write a python function to check whether the given list contains consecutive numbers or not. Assesments: assert check_Consecutive([1,2,3,4,5]) == True, assert check_Consecutive([1,2,3,5,6]) == False, assert check_Consecutive([1,2,1]) == False",74,0.032,38,1.9473684210526316,"Prompt: Write a python function check whether the given list contains consecutive numbers or not Assesments: assert check_Consecutive([1,2,3,4,5 True,])",0.0,0.08253397617887681
"Prompt: Write a function to find the tuple intersection of elements in the given tuple list irrespective of their order. Assesments: assert tuple_intersection([(3, 4), (5, 6), (9, 10), (4, 5)] , [(5, 4), (3, 4), (6, 5), (9, 11)]) == {(4, 5), (3, 4), (5, 6)}, assert tuple_intersection([(4, 1), (7, 4), (11, 13), (17, 14)] , [(1, 4), (7, 4), (16, 12), (10, 13)]) == {(4, 7), (1, 4)}, assert tuple_intersection([(2, 1), (3, 2), (1, 3), (1, 4)] , [(11, 2), (2, 3), (6, 2), (1, 3)]) == {(1, 3), (2, 3)}",230,0.052,126,1.8253968253968254,"Prompt: Write a function to find the tuple intersection of elements in the given tuple list irrespective their order. Assesments: assert tuple_intersection([(3, 4), (594 5)] , [(5 43 46 5),9 11)]) == {(4 53 45 6)}, assert tuple_intersection([(4 17 411 1317 14)] ,1 47 416 1210 13) ==4 71 4) 13 21 31 4)]11 22 36 2),1 3)1 32 3)}",0.0,0.07009154975959954
"Prompt: Write a function to replace characters in a string. Assesments: assert replace_char(""polygon"",'y','l')==(""pollgon""), assert replace_char(""character"",'c','a')==(""aharaater""), assert replace_char(""python"",'l','a')==(""python"")",60,0.03,40,1.5,"Prompt: Write a function replace characters in. Assesments: assert replace_char(""polygon"",'y','l')==(""pollgon replace_char(""character"",'c','a')==(""aharaater",0.0,0.03689754229173316
"Prompt: Write a function to sort counter by value. Assesments: assert sort_counter({'Math':81, 'Physics':83, 'Chemistry':87})==[('Chemistry', 87), ('Physics', 83), ('Math', 81)], assert sort_counter({'Math':400, 'Physics':300, 'Chemistry':250})==[('Math', 400), ('Physics', 300), ('Chemistry', 250)], assert sort_counter({'Math':900, 'Physics':1000, 'Chemistry':1250})==[('Chemistry', 1250), ('Physics', 1000), ('Math', 900)]",139,0.038,107,1.2990654205607477,"Prompt: Write a function to sort counter by value. Assesments: assert sort_counter({'Math':81,Physics':83,Chemistry':87})==[('Chemistry', 87),Physics 83),Math 81)], assert sort_counter({'Math':400Physics':300,Chemistry':250})==[('Math 400 300Chemistry) sort_counter({'Math':900Physics':1000Chemistry':1250})==[('Chemistry 1250 1000Math 900)]",0.0,0.01640003460300509
"Prompt: Write a python function to find the sum of the largest and smallest value in a given array. Assesments: assert big_sum([1,2,3]) == 4, assert big_sum([-1,2,3,4]) == 3, assert big_sum([2,3,6]) == 8",68,0.031,39,1.7435897435897436,"Prompt: Write a python function find the sum the largest and smallest value in a given array Assesments: assert big_sum([1,2,3 == 4, 3 8",0.0,0.06174633962696522
"Prompt: Write a python function to convert the given string to lower case. Assesments: assert is_lower(""InValid"") == ""invalid"", assert is_lower(""TruE"") == ""true"", assert is_lower(""SenTenCE"") == ""sentence""",54,0.031,39,1.3846153846153846,"Prompt: Write a python function convert the given string lower Assesments: assert is_lower(""InValid == "" is_lower(""TruE"")true is_lower(""SenTenCEsentence""",0.0,0.025127059343465336
"Prompt: Write a function to remove lowercase substrings from a given string. Assesments: assert remove_lowercase(""PYTHon"")==('PYTH'), assert remove_lowercase(""FInD"")==('FID'), assert remove_lowercase(""STRinG"")==('STRG')",57,0.029,39,1.4615384615384615,"Prompt: Write a function remove lowercase substrings a given string Assesments: assert remove_lowercase(""PYTHon"")==('PYTH'), remove_lowercase(""FInD"")==('FID",0.0,0.03297404797564388
"Prompt: Write a python function to find the first digit of a given number. Assesments: assert first_Digit(123) == 1, assert first_Digit(456) == 4, assert first_Digit(12) == 1",52,0.029,31,1.6774193548387097,"Prompt: Write a python function find the first digit a given number Assesments: assert first_Digit(123 1, 4) 1",0.0,0.05499624187885465
"Prompt: Write a python function to find the maximum occurring character in a given string. Assesments: assert get_max_occuring_char(""data"") == ""a"", assert get_max_occuring_char(""create"") == ""e"", assert get_max_occuring_char(""brilliant girl"") == ""i""",65,0.033,54,1.2037037037037037,"Prompt: Write a python function to find the maximum occurring character in a given string Assesments: assert get_max_occuring_char(""data ""a"", assert get_max_occuring_char(""createe get_max_occuring_char(""brilliant girli""",0.0,0.006672104597415799
"Prompt: Write a function to determine if there is a subset of the given set with sum equal to the given sum. Assesments: assert is_subset_sum([3, 34, 4, 12, 5, 2], 6, 9) == True, assert is_subset_sum([3, 34, 4, 12, 5, 2], 6, 30) == False, assert is_subset_sum([3, 34, 4, 12, 5, 2], 6, 15) == True",120,0.036,62,1.935483870967742,"Prompt: Write a function to determine if there a subset the given set with sum equal the given sum. Assesments: assert is_subset_sum([3 34, 4, 12, 5, 2], 6, 9) == True, assert 30 False, 15",0.0,0.0813216230964859
"Prompt: Write a function to find sequences of one upper case letter followed by lower case letters in the given string by using regex. Assesments: assert match(""Geeks"") == 'Yes', assert match(""geeksforGeeks"") == 'Yes', assert match(""geeks"") == 'No'",63,0.031,41,1.5365853658536586,"Prompt: Write a function find sequences one upper case letter followed in the given string by using regex. Assesments: assert match(""Geeks 'Yes assert match(""geeksforGeeks"")No",0.0,0.04062964664118394
"Prompt: Write a python function to find the first natural number whose factorial is divisible by x. Assesments: assert first_Factorial_Divisible_Number(10) == 5, assert first_Factorial_Divisible_Number(15) == 5, assert first_Factorial_Divisible_Number(5) == 4",70,0.036,37,1.8918918918918919,"Prompt: Write a python function find the first natural number whose factorial divisible x. Assesments: assert first_Factorial_Divisible_Number(10) 5, 4",0.0,0.0768747681610752
"Prompt: Write a function to remove the matching tuples from the given two tuples. Assesments: assert remove_matching_tuple([('Hello', 'dude'), ('How', 'are'), ('you', '?')], [('Hello', 'dude'), ('How', 'are')]) == [('you', '?')], assert remove_matching_tuple([('Part', 'of'), ('the', 'journey'), ('is ', 'end')], [('Journey', 'the'), ('is', 'end')]) == [('Part', 'of'), ('the', 'journey'), ('is ', 'end')], assert remove_matching_tuple([('Its', 'been'), ('a', 'long'), ('day', 'without')], [('a', 'long'), ('my', 'friend')]) == [('Its', 'been'), ('day', 'without')]",174,0.055,108,1.6111111111111112,"Prompt: Write a function to remove the matching tuples from the given two tuples. Assesments: assert remove_matching_tuple([('Hello',dude'), ('How',are'), ('you',?')], [('HellodudeHow')]) == [('you?') assert remove_matching_tuple([('Part',of'),the', 'journeyis ',end') ['Journeytheis',end]) == [Part ',], assert remove_matching_tuple([('Itsbeena',long'),day',without')amyfriend')])Itsday]",0.0,0.048232081427102176
"Prompt: Write a function to find the largest palindromic number in the given array. Assesments: assert largest_palindrome([1, 232, 54545, 999991], 4) == 54545, assert largest_palindrome([1, 2, 3, 4, 5, 50], 6) == 5, assert largest_palindrome([1, 3, 7, 9, 45], 5)  == 9",104,0.035,64,1.625,"Prompt: Write a function to find the largest palindromic number the given array Assesments: assert largest_palindrome([1 232 54545, 999991 4) == 54545, 2 3 50], 6, 7 9 45 5 9",0.0,0.0496488988190233
"Prompt: Write a function to compute binomial probability for the given number. Assesments: assert binomial_probability(10, 5, 1.0/3) == 0.13656454808718185, assert binomial_probability(11, 6, 2.0/4) == 0.2255859375, assert binomial_probability(12, 7, 3.0/5) == 0.227030335488",98,0.034,60,1.6333333333333333,"Prompt: Write a function compute binomial probability for the given number. Assesments: assert binomial_probability(10 5 1.0/3 == 0.13656454808718185, 6 0.2255859375, 0.227030335488",0.0,0.050498989254175966
"Prompt: Write a function to sort a list of tuples in increasing order by the last element in each tuple. Assesments: assert sort_tuple([(1, 3), (3, 2), (2, 1)] ) == [(2, 1), (3, 2), (1, 3)], assert sort_tuple([(2, 4), (3, 3), (1, 1)] ) == [(1, 1), (3, 3), (2, 4)], assert sort_tuple([(3, 9), (6, 7), (4, 3)] ) == [(4, 3), (6, 7), (3, 9)]",149,0.043,82,1.8170731707317074,"Prompt: Write a function to sort a list of tuples in increasing order by the last element in each tuple. Assesments: assert sort_tuple([(1 3), (3 22 1)] ) == [(2 131 3)], assert sort_tuple([(2 43 31 11 13 32 4) 96 74 3)]4 36 73 9",0.0,0.06924244665363985
"Prompt: Write a function to find the area of a pentagon. Assesments: assert area_pentagon(5)==43.01193501472417, assert area_pentagon(10)==172.0477400588967, assert area_pentagon(15)==387.10741513251753",65,0.031,29,2.2413793103448274,Prompt: Write a function find the area a pentagon Assesments assert area_pentagon(5)==43.01193501472417,0.0,0.11252627755704016
"Prompt: Write a python function to find the frequency of the largest value in a given array. Assesments: assert frequency_Of_Largest(5,[1,2,3,4,4]) == 2, assert frequency_Of_Largest(3,[5,6,5]) == 1, assert frequency_Of_Largest(4,[2,7,7,7]) == 3",85,0.032,46,1.8478260869565217,"Prompt: Write a python function find the frequency the largest value a given array Assesments: assert frequency_Of_Largest(5,[1,2,3,4,4 == 2, assert 1 3",0.0,0.0723795778459318
"Prompt: Write a function to extract all the pairs which are symmetric in the given tuple list. Assesments: assert extract_symmetric([(6, 7), (2, 3), (7, 6), (9, 8), (10, 2), (8, 9)] ) == {(8, 9), (6, 7)}, assert extract_symmetric([(7, 8), (3, 4), (8, 7), (10, 9), (11, 3), (9, 10)] ) == {(9, 10), (7, 8)}, assert extract_symmetric([(8, 9), (4, 5), (9, 8), (11, 10), (12, 4), (10, 11)] ) == {(8, 9), (10, 11)}",185,0.046,108,1.712962962962963,"Prompt: Write a function to extract all the pairs which are symmetric in the given tuple list. Assesments: assert extract_symmetric([(6, 7), (2 3 (7 69 8)10 28 9)] ) == {(8 9),6 7)}, assert extract_symmetric([(7 8)3 48 710 911 39 10)] )9 107 8) 94 59 8)11 10 410 118 910 11)}",0.0,0.05862207563452377
"Prompt: Write a function to find the sum of geometric progression series. Assesments: assert sum_gp(1,5,2)==31, assert sum_gp(1,5,4)==341, assert sum_gp(2,6,3)==728",53,0.031,25,2.12,"Prompt: Write a function find the sum geometric progression series Assesments assert sum_gp(1,5,2)==31",0.0,0.10014427066709225
"Prompt: Write a function to search an element in the given array by using binary search. Assesments: assert binary_search([1,2,3,5,8], 6) == False, assert binary_search([7, 8, 9, 10, 13], 10) == True, assert binary_search([11, 13, 14, 19, 22, 36], 23) == False",92,0.036,57,1.6140350877192982,"Prompt: Write a function search an element in the given array by using binary search. Assesments: assert binary_search([1,2,3,5,8 6) == False, 8 13 10 True 13 19 22 36 23",0.0,0.04853035877276977
"Prompt: Write a function to convert the given binary tuple to integer. Assesments: assert binary_to_integer((1, 1, 0, 1, 0, 0, 1)) == '105', assert binary_to_integer((0, 1, 1, 0, 0, 1, 0, 1)) == '101', assert binary_to_integer((1, 1, 0, 1, 0, 1)) == '53'",105,0.036,52,2.019230769230769,"Prompt: Write a function to convert the given binary tuple integer. Assesments: assert binary_to_integer((1, 1, 0, 1,, 0, == '105', assert 0 1,101 0))53'",0.0,0.08986471555893834
"Prompt: Write a function to remove lowercase substrings from a given string by using regex. Assesments: assert remove_lowercase('KDeoALOklOOHserfLoAJSIskdsf') == 'KDALOOOHLAJSI', assert remove_lowercase('ProducTnamEstreAmIngMediAplAYer') == 'PTEAIMAAY', assert remove_lowercase('maNufacTuredbYSheZenTechNolOGIes') == 'NTYSZTNOGI'",113,0.038,99,1.1414141414141414,Prompt: Write a function remove lowercase substrings a given string by regex. Assesments: assert remove_lowercase('KDeoALOklOOHserfLoAJSIskdsf')KDALOOOHLAJSI assert remove_lowercase('ProducTnamEstreAmIngMediAplAYerPTEAIMAAY remove_lowercase('maNufacTuredbYSheZenTechNolOGIesNTYSZTNOGI',0.0,0.00031789326395135413
"Prompt: Write a function to find the smallest integers from a given list of numbers using heap queue algorithm. Assesments: assert heap_queue_smallest( [25, 35, 22, 85, 14, 65, 75, 25, 58],3)==[14, 22, 25] , assert heap_queue_smallest( [25, 35, 22, 85, 14, 65, 75, 25, 58],2)==[14, 22], assert heap_queue_smallest( [25, 35, 22, 85, 14, 65, 75, 22, 58],5)==[14, 22, 22, 25, 35]",161,0.041,91,1.7692307692307692,"Prompt: Write a function to find the smallest integers from a given list of numbers using heap queue algorithm Assesments: assert heap_queue_smallest( [25, 35, 22 85 14 65 75 25 58],3)==[14 22 25] , assert25 58],2)==[14], assert 22 58],5)==[14, 22, 25, 35]",0.0,0.06436200250435806
"Prompt: Write a function to find the surface area of a cone. Assesments: assert surfacearea_cone(5,12)==282.7433388230814, assert surfacearea_cone(10,15)==880.5179353159282, assert surfacearea_cone(19,17)==2655.923961165254",71,0.029,31,2.2903225806451615,"Prompt: Write a function find the surface area a cone Assesments assert surfacearea_cone(5,12)==282.7433388230814",0.0,0.11751902227072888
"Prompt: Write a python function to find gcd of two positive integers. Assesments: assert gcd(12, 17) == 1, assert gcd(4,6) == 2, assert gcd(2,9) == 1",51,0.029,32,1.59375,"Prompt: Write a python function find gcd of two positive integers Assesments: assert gcd(12 17 1, gcd(4,6 1",0.0,0.04646105968720076
"Prompt: Write a function to find the diameter of a circle. Assesments: assert diameter_circle(10)==20, assert diameter_circle(40)==80, assert diameter_circle(15)==30",40,0.028,19,2.1052631578947367,Prompt: Write a function find the diameter Assesments: assert diameter_circle(10)==20,0.0,0.09864095284492749
"Prompt: Write a function to concatenate all elements of the given list into a string. Assesments: assert concatenate_elements(['hello','there','have','a','rocky','day'] ) == '  hello there have a rocky day', assert concatenate_elements([ 'Hi', 'there', 'How','are', 'you'] ) == '  Hi there How are you', assert concatenate_elements([ 'Part', 'of', 'the','journey', 'is', 'end'] ) == '  Part of the journey is end'",110,0.04,69,1.5942028985507246,"Prompt: Write a function concatenate all elements the given list into a string Assesments: assert concatenate_elements(['hello','there','have','a','rocky','day'] ) == hello there have a rocky day', assert([HithereHow','are',you'] Hi How',Partofthe','journeyisend is end'",0.0,0.04650726025432862
"Prompt: Write a python function to find common divisor between two numbers in a given pair. Assesments: assert num_comm_div(2,4) == 2, assert num_comm_div(2,8) == 2, assert num_comm_div(12,24) == 6",60,0.031,32,1.875,"Prompt: Write a python function find common divisor between two numbers in a given pair Assesments: assert num_comm_div(2,4, assert 6",0.0,0.07515161187360357
"Prompt: Write a python function to find remainder of two numbers. Assesments: assert find(3,3) == 0, assert find(10,3) == 1, assert find(16,5) == 1",49,0.031,33,1.4848484848484849,"Prompt: Write a python function find remainder two numbers Assesments: assert find(3,3 0, assert 1 find(16,5 1",0.0,0.035351923318728294
"Prompt: Write a function to add consecutive numbers of a given list. Assesments: assert add_consecutive_nums([1, 1, 3, 4, 4, 5, 6, 7])==[2, 4, 7, 8, 9, 11, 13], assert add_consecutive_nums([4, 5, 8, 9, 6, 10])==[9, 13, 17, 15, 16], assert add_consecutive_nums([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[3, 5, 7, 9, 11, 13, 15, 17, 19]",171,0.041,92,1.858695652173913,"Prompt: Write a function to add consecutive numbers of a given list. Assesments: assert add_consecutive_nums([1 1, 3, 4 4 7])==[2 4 7 8 11 13], assert 5 8 6 10])==[9 13 17 15 16,,, 5 9 11 13, 15, 17, 19]",0.0,0.07348839145700051
"Prompt: Write a python function to find the cube sum of first n natural numbers. Assesments: assert sum_Of_Series(5) == 225, assert sum_Of_Series(2) == 9, assert sum_Of_Series(3) == 36",59,0.03,33,1.7878787878787878,"Prompt: Write a python function find the cube sum first n natural numbers Assesments: assert sum_Of_Series(5 225, 9 36",0.0,0.0662643027788256
"Prompt: Write a function to move all zeroes to the end of the given array. Assesments: assert re_order([6, 0, 8, 2, 3, 0, 4, 0, 1]) == [6, 8, 2, 3, 4, 1, 0, 0, 0], assert re_order([4, 0, 2, 7, 0, 9, 0, 12, 0]) == [4, 2, 7, 9, 12, 0, 0, 0, 0], assert re_order([3, 11, 0, 74, 14, 0, 1, 0, 2]) == [3, 11, 74, 14, 1, 2, 0, 0, 0]",196,0.045,119,1.6470588235294117,"Prompt: Write a function to move all zeroes to the end the given array. Assesments: assert re_order([6 0, 8, 2 3 0 4 0 1]) == [6 8 2 4 1 0 0 0], assert re_order([4 0 2 7 0 9 0 12 04 2 7 9 12 0, 11 0 74 14 0 1 0 2 74 1 2,]",0.0,0.05189913820619214
"Prompt: Write a function to calculate the permutation coefficient of given p(n, k). Assesments: assert permutation_coefficient(10, 2) == 90, assert permutation_coefficient(10, 3) == 720, assert permutation_coefficient(10, 1) == 10",62,0.031,37,1.6756756756756757,"Prompt: Write a function calculate the permutation coefficient given p(n, k Assesments: assert permutation_coefficient(10 2 90, 3 720 1 10",0.0,0.05481836768143822
"Prompt: Write a function to remove specific words from a given list. Assesments: assert remove_words(['red', 'green', 'blue', 'white', 'black', 'orange'],['white', 'orange'])==['red', 'green', 'blue', 'black'], assert remove_words(['red', 'green', 'blue', 'white', 'black', 'orange'],['black', 'orange'])==['red', 'green', 'blue', 'white'], assert remove_words(['red', 'green', 'blue', 'white', 'black', 'orange'],['blue', 'white'])==['red', 'green', 'black', 'orange']",138,0.045,89,1.550561797752809,"Prompt: Write a function to remove specific words from a given list. Assesments: assert remove_words(['red',green',blue',white',black',orange'],['white',orange'])==['red',green',',black'], assert remove_words(['redgreenwhite',black',orange'],['blackorange'])==['redgreenwhite' assert remove_words(['redgreenorange'],['bluewhite'])==['redgreenblackorange']",0.0,0.0420553943701876
"Prompt: Write a function to check if the common elements between two given lists are in the same order or not. Assesments: assert same_order([""red"",""green"",""black"",""orange""],[""red"",""pink"",""green"",""white"",""black""])==True, assert same_order([""red"",""pink"",""green"",""white"",""black""],[""white"",""orange"",""pink"",""black""])==False, assert same_order([""red"",""green"",""black"",""orange""],[""red"",""pink"",""green"",""white"",""black""])==True",104,0.033,44,2.3636363636363638,"Prompt: Write a function check the common elements between two given lists in or Assesments assert same_order([""red"",""green"",""black"",""orange""],[""red"",""pink"",""green"",""white"",""black""])==True,",0.0,0.12499782375301048
"Prompt: Write a python function to find the average of odd numbers till a given odd number. Assesments: assert average_Odd(9) == 5, assert average_Odd(5) == 3, assert average_Odd(11) == 6",55,0.031,32,1.71875,"Prompt: Write a python function find the average of odd numbers till a given odd number Assesments: assert average_Odd(9 5, 6",0.0,0.0592124162144909
"Prompt: Write a function to find the number of subsequences having product smaller than k for the given non negative array. Assesments: assert no_of_subsequences([1,2,3,4], 10) == 11, assert no_of_subsequences([4,8,7,2], 50) == 9, assert no_of_subsequences([5,6,7,8], 15) == 4",93,0.034,48,1.9375,"Prompt: Write a function find subsequences having product smaller k for the given non negative array Assesments: assert no_of_subsequences([1,2,3,4 10 == 11, 50 9 15",0.0,0.08152729013724865
"Prompt: Write a python function to find minimum sum of factors of a given number. Assesments: assert find_Min_Sum(12) == 7, assert find_Min_Sum(105) == 15, assert find_Min_Sum(2) == 2",56,0.031,32,1.75,"Prompt: Write a python function find minimum sum factors of a given number Assesments: assert find_Min_Sum(12 7, 15 2",0.0,0.06240025534631343
"Prompt: Write a function to count the element frequency in the mixed nested tuple. Assesments: assert count_element_freq((5, 6, (5, 6), 7, (8, 9), 9) ) == {5: 2, 6: 2, 7: 1, 8: 1, 9: 2}, assert count_element_freq((6, 7, (6, 7), 8, (9, 10), 10) ) == {6: 2, 7: 2, 8: 1, 9: 1, 10: 2}, assert count_element_freq((7, 8, (7, 8), 9, (10, 11), 11) ) == {7: 2, 8: 2, 9: 1, 10: 1, 11: 2}",200,0.048,112,1.7857142857142858,"Prompt: Write a function to count the element frequency in the mixed nested tuple. Assesments: assert count_element_freq((5, 6, (5, 6), 7, (8 9 9) ) == {5: 2, 6: 2 7 1, 8 1 2}, assert count_element_freq((6 7 (6 89 10 106 2 7 2 1 1, 2 87 8 2 1, 2}",0.0,0.06604350006839634
"Prompt: Write a function to convert tuple into list by adding the given string after every element. Assesments: assert add_str((5, 6, 7, 4, 9) , ""FDF"") == [5, 'FDF', 6, 'FDF', 7, 'FDF', 4, 'FDF', 9, 'FDF'], assert add_str((7, 8, 9, 10) , ""PF"") == [7, 'PF', 8, 'PF', 9, 'PF', 10, 'PF'], assert add_str((11, 14, 12, 1, 4) , ""JH"") == [11, 'JH', 14, 'JH', 12, 'JH', 1, 'JH', 4, 'JH']",185,0.047,107,1.7289719626168225,"Prompt: Write a function to convert tuple into list by adding the given string after every element. Assesments: assert add_str((5, 6, 7, 4, 9) , ""FDF"") == [5 'FDF', 6', 7', 4', 9,'], assert add_str((7 8 10) ""PF"")7 9 10' 14 12 1, 4 ""JH11 14 12 1 4']",0.0,0.060255167332376784
"Prompt: Write a function to find the summation of tuple elements in the given tuple list. Assesments: assert sum_elements((7, 8, 9, 1, 10, 7)) == 42, assert sum_elements((1, 2, 3, 4, 5, 6)) == 21, assert sum_elements((11, 12 ,13 ,45, 14)) == 95",92,0.034,51,1.803921568627451,"Prompt: Write a function to find the summation tuple elements in the given tuple list Assesments: assert sum_elements((7 8,, 1, 10, 7 42, 21 ,13 ,45 14)) 95",0.0,0.0679008405149484
"Prompt: Write a function to check if there is a subset with sum divisible by m. Assesments: assert modular_sum([3, 1, 7, 5], 4, 6) == True, assert modular_sum([1, 7], 2, 5) == False, assert modular_sum([1, 6], 2, 5) == False",81,0.033,48,1.6875,"Prompt: Write a function check there a subset with sum divisible m. Assesments: assert modular_sum([3 1 7 5 4 6) == True, 7], 2 5 6 2",0.0,0.056024577082668364
"Prompt: Write a function to sort a list of elements using radix sort. Assesments: assert radix_sort([15, 79, 25, 68, 37]) == [15, 25, 37, 68, 79], assert radix_sort([9, 11, 8, 7, 3, 2]) == [2, 3, 7, 8, 9, 11], assert radix_sort([36, 12, 24, 26, 29]) == [12, 24, 26, 29, 36]",127,0.042,76,1.6710526315789473,"Prompt: Write a function to sort a list elements using radix sort Assesments: assert radix_sort([15 79, 25 68 37 == [15 25 37 68 79], assert 11 8 7 3,2 3 7 8 9 11 12 24 26 2912 36]",0.0,0.05434676701328808
"Prompt: Write a python function to find the largest postive number from the given list. Assesments: assert largest_pos([1,2,3,4,-1]) == 4, assert largest_pos([0,1,2,-5,-1,6]) == 6, assert largest_pos([0,0,1,0]) == 1",75,0.031,40,1.875,"Prompt: Write a python function find the largest postive number from the given list Assesments: assert largest_pos([1,2,3,4,-1 == 4, 6])",0.0,0.07515161187360357
"Prompt: Write a function to find the square root of a perfect number. Assesments: assert sqrt_root(4)==2, assert sqrt_root(16)==4, assert sqrt_root(400)==20",42,0.028,23,1.826086956521739,Prompt: Write a function find the square root a perfect number Assesments: assert sqrt_root(4)==2,0.0,0.07016195062379438
"Prompt: Write a function to calculate volume of a tetrahedron. Assesments: assert volume_tetrahedron(10)==117.85, assert volume_tetrahedron(15)==397.75, assert volume_tetrahedron(20)==942.81",52,0.028,22,2.3636363636363638,Prompt: Write a function calculate volume Assesments: assert volume_tetrahedron(10)==117.85,0.0,0.12499782375301048
"Prompt: Write a function to find the lcm of the given array elements. Assesments: assert get_lcm([2, 7, 3, 9, 4]) == 252, assert get_lcm([1, 2, 8, 3]) == 24, assert get_lcm([3, 8, 4, 10, 5]) == 120",85,0.037,53,1.6037735849056605,"Prompt: Write a function to find the lcm of the given array elements Assesments: assert get_lcm([2 7, 3, 9 4 252, 8 3 24 8 4 10, 120",0.0,0.04748357412570989
"Prompt: Write a function to print check if the triangle is scalene or not. Assesments: assert check_isosceles(6,8,12)==True, assert check_isosceles(6,6,12)==False, assert check_isosceles(6,15,20)==True",65,0.029,29,2.2413793103448274,"Prompt: Write a function print check the triangle scalene or Assesments assert check_isosceles(6,8,12)==True",0.0,0.11252627755704016
"Prompt: Write a function to find the longest bitonic subsequence for the given array. Assesments: assert lbs([0 , 8 , 4, 12, 2, 10 , 6 , 14 , 1 , 9 , 5 , 13, 3, 11 , 7 , 15]) == 7, assert lbs([1, 11, 2, 10, 4, 5, 2, 1]) == 6, assert lbs([80, 60, 30, 40, 20, 10]) == 5",129,0.037,83,1.5542168674698795,"Prompt: Write a function find the longest bitonic subsequence for the given array Assesments: assert lbs([0 , 8 4, 12 2 10 , 6 , 14 1 , 9 5 13 11 , 7 , 15 7, 11 2 10 5 2 lbs([80 60 30 20 10",0.0,0.04242825114694334
"Prompt: Write a function to check whether a given string has a capital letter, a lower case letter, a number and specified length using lambda function. Assesments: assert check_string('python')==['String must have 1 upper case character.', 'String must have 1 number.', 'String length should be atleast 8.'], assert check_string('123python')==['String must have 1 upper case character.'], assert check_string('123Python')==['Valid string.']",101,0.038,52,1.9423076923076923,"Prompt: Write a function check whether a given string has a capital letter and specified length using lambda function Assesments: assert check_string('python')==['String must have 1 upper case character, 1 numberString length should atleast 8],],",0.0,0.08201772692675979
"Prompt: Write a function to find the sum of maximum increasing subsequence of the given array. Assesments: assert max_sum_increasing_subsequence([1, 101, 2, 3, 100, 4, 5], 7) == 106, assert max_sum_increasing_subsequence([3, 4, 5, 10], 4) == 22, assert max_sum_increasing_subsequence([10, 5, 4, 3], 4) == 10",109,0.035,65,1.676923076923077,"Prompt: Write a function to find the sum maximum increasing subsequence of the given array Assesments: assert max_sum_increasing_subsequence([1 101 2 100 4 5 7) == 106, 4 10 4 22 5 4 3 4 10",0.0,0.054945616145743816
"Prompt: Write a python function to check whether two given lines are parallel or not. Assesments: assert parallel_lines([2,3,4], [2,3,8]) == True, assert parallel_lines([2,3,4], [4,-3,8]) == False, assert parallel_lines([3,3],[5,5]) == True",75,0.032,52,1.4423076923076923,"Prompt: Write a python function to check whether two given lines parallel or Assesments: assert parallel_lines([2,3,4 [2,3,8 == True, assert4,-3,8 parallel_lines([3,3],[5,5",0.0,0.03101230081759925
"Prompt: Write a python function to capitalize first and last letters of each word of a given string. Assesments: assert capitalize_first_last_letters(""python"") == ""PythoN"", assert capitalize_first_last_letters(""bigdata"") == ""BigdatA"", assert capitalize_first_last_letters(""Hadoop"") == ""HadooP""",69,0.033,47,1.4680851063829787,"Prompt: Write a python function capitalize first and last letters each word of a given string Assesments: assert capitalize_first_last_letters(""python ==PythoN"", capitalize_first_last_letters(""bigdataBigdatAHadooP""",0.0,0.033641876795403765
"Prompt: Write a function to find all pairs in an integer array whose sum is equal to a given number. Assesments: assert get_pairs_count([1, 5, 7, -1, 5], 5, 6) == 3, assert get_pairs_count([1, 5, 7, -1], 4, 6) == 2, assert get_pairs_count([1, 1, 1, 1], 4, 2) == 6",106,0.036,63,1.6825396825396826,"Prompt: Write a function find all pairs in an integer array whose sum equal a given number Assesments: assert get_pairs_count([1 5, 7 -1 5 5 6) == 3,], 4 6 2 1 1 4 2 6",0.0,0.055518570871267964
"Prompt: Write a function to find the list of lists with minimum length. Assesments: assert min_length([[0], [1, 3], [5, 7], [9, 11], [13, 15, 17]])==(1, [0]), assert min_length([[1], [5, 7], [10, 12, 14,15]])==(1, [1]), assert min_length([[5], [15,20,25]])==(1, [5])",106,0.038,63,1.6825396825396826,"Prompt: Write a function to find the list lists with minimum length. Assesments: assert min_length([[0, 35 79 1113 15, 17]])==(1, []), assert510 12, 14,15]])==(1115,20,25]])==(15])",0.0,0.055518570871267964
"Prompt: Write a function to find the nth jacobsthal-lucas number. Assesments: assert jacobsthal_lucas(5) == 31, assert jacobsthal_lucas(2) == 5, assert jacobsthal_lucas(4) == 17",66,0.03,38,1.736842105263158,"Prompt: Write a function find the nth jacobsthal-lucas number. Assesments: assert jacobsthal_lucas(5 31, 5 17",0.0,0.061058007290809214
"Prompt: Write a function to find the ration of negative numbers in an array of integers. Assesments: assert negative_count([0, 1, 2, -1, -5, 6, 0, -3, -2, 3, 4, 6, 8])==0.31, assert negative_count([2, 1, 2, -1, -5, 6, 4, -3, -2, 3, 4, 6, 8])==0.31, assert negative_count([2, 4, -6, -9, 11, -12, 14, -5, 17])==0.44",150,0.037,84,1.7857142857142858,"Prompt: Write a function to find the ration of negative numbers in an array of integers Assesments: assert negative_count([0 1,, -1, -5, 6 0 -3 -2 3 4 6 8])==0.31, 1 4 -3 4 -6 -9 11 -12 14 -5 17])==0.44",0.0,0.06604350006839634
"Prompt: Write a function to find minimum number of coins that make a given value. Assesments: assert min_coins([9, 6, 5, 1] ,4,11)==2, assert min_coins([4,5,6,7,8,9],6,9)==1, assert min_coins([1, 2, 3],3,4)==2",85,0.031,34,2.5,"Prompt: Write a function find minimum number coins that make a given value Assesments: assert min_coins([9 6 ,4,11)==2 2",0.0,0.13890839451005427
"Prompt: Write a function to check if the two given strings are permutations of each other. Assesments: assert check_permutation(""abc"", ""cba"") == True, assert check_permutation(""test"", ""ttew"") == False, assert check_permutation(""xxyz"", ""yxzx"") == True",64,0.034,47,1.3617021276595744,"Prompt: Write a function to check the two given strings permutations each Assesments: assert check_permutation(""abc"",cba == True, check_permutation(""testttew False assert check_permutation(""xxyzyxzx",0.0,0.02278965847430577
"Prompt: Write a function to remove particular data type elements from the given tuple. Assesments: assert remove_datatype((4, 5, 4, 7.7, 1.2), int) == [7.7, 1.2], assert remove_datatype((7, 8, 9, ""SR""), str) == [7, 8, 9], assert remove_datatype((7, 1.1, 2, 2.2), float) == [7, 2]",113,0.036,65,1.7384615384615385,"Prompt: Write a function remove particular data type elements the given tuple Assesments: assert remove_datatype((4 5, 4, 7.7, 1.2 int) == [7.7 assert 8 ""SR""), str7, 8 1.1 float7 2]",0.0,0.06122320705148666
"Prompt: Write a function to search a literals string in a string and also find the location within the original string where the pattern occurs. Assesments: assert search_literal('python','python programming language')==(0,6), assert search_literal('programming','python programming language')==(7,18), assert search_literal('language','python programming language')==(19,27)",77,0.034,34,2.264705882352941,"Prompt: Write a function search a literals string and also find the location within where occurs Assesments assert search_literal('python','python programming language')==(0,6",0.0,0.11490584104691988
"Prompt: Write a function to find the top or bottom surface area of a cylinder. Assesments: assert topbottom_surfacearea(10)==314.15000000000003, assert topbottom_surfacearea(5)==78.53750000000001, assert topbottom_surfacearea(4)==50.264",64,0.029,32,2.0,Prompt: Write a function find the top or bottom surface area a cylinder Assesments assert topbottom_surfacearea(10)==314.15000000000003,0.0,0.0879029684008937
"Prompt: Write a function to select the nth items of a list. Assesments: assert nth_items([1, 2, 3, 4, 5, 6, 7, 8, 9],2)==[1, 3, 5, 7, 9] , assert nth_items([10,15,19,17,16,18],3)==[10,17] , assert nth_items([14,16,19,15,17],4)==[14,17]",111,0.033,63,1.7619047619047619,"Prompt: Write a function to select the nth items of a list. Assesments: assert nth_items([1, 9],2)==[1 3 5 7 9 , assert nth_items([10,15,19,17,16,18],3)==[10,17]",0.0,0.0636146702536744
"Prompt: Write a python function to find the first repeated word in a given string. Assesments: assert first_repeated_word(""ab ca bc ab"") == ""ab"", assert first_repeated_word(""ab ca bc"") == 'None', assert first_repeated_word(""ab ca bc ca ab bc"") == ""ca""",67,0.033,39,1.7179487179487178,"Prompt: Write a python function to find the first repeated word a given string Assesments: assert first_repeated_word(""ab ca bc ab == "" ca 'None ca ab bcca""",0.0,0.05913067674957236
"Prompt: Write a python function to convert a given string list to a tuple. Assesments: assert string_list_to_tuple((""python 3.0"")) == ('p', 'y', 't', 'h', 'o', 'n', '3', '.', '0'), assert string_list_to_tuple((""bigdata"")) == ('b', 'i', 'g', 'd', 'a', 't', 'a'), assert string_list_to_tuple((""language"")) == ('l', 'a', 'n', 'g', 'u', 'a', 'g','e')",121,0.043,70,1.7285714285714286,"Prompt: Write a python function to convert a given string list to a tuple. Assesments: assert string_list_to_tuple((""python 3.0"")) == ('p', 'ython3.',0'), assert string_list_to_tuple((""bigdata""))big 'data'), string_list_to_tuple((""languagelangua',g','e')",0.0,0.060214308513063704
"Prompt: Write a function to create a list containing the power of said number in bases raised to the corresponding number in the index using map function. Assesments: assert basesnum_coresspondingnum([10, 20, 30, 40, 50, 60, 70, 80, 90, 100],[1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[10, 400, 27000, 2560000, 312500000, 46656000000, 8235430000000, 1677721600000000, 387420489000000000, 100000000000000000000], assert basesnum_coresspondingnum([1, 2, 3, 4, 5, 6, 7],[10, 20, 30, 40, 50, 60, 70])==[1, 1048576, 205891132094649, 1208925819614629174706176, 88817841970012523233890533447265625, 48873677980689257489322752273774603865660850176, 143503601609868434285603076356671071740077383739246066639249], assert basesnum_coresspondingnum([4, 8, 12, 16, 20, 24, 28],[3, 6, 9, 12, 15, 18, 21])==[64, 262144, 5159780352, 281474976710656, 32768000000000000000, 6979147079584381377970176, 2456510688823056210273111113728]",392,0.063,275,1.4254545454545455,"Prompt: Write a function to create a list containing the power said number in bases raised to the corresponding number in the index using map function. Assesments: assert basesnum_coresspondingnum([10 20, 30, 70 100],[1 10])==[10 400 27000 2560000 312500000 46656000000 8235430000000, 1677721600000000 387420489000000000, 100000000000000000000], assert 7],[10 20 70])==[1 1048576 205891132094649, 1208925819614629174706176, 88817841970012523233890533447265625, 48873677980689257489322752273774603865660850176, 143503601609868434285603076356671071740077383739246066639249], 8 12 16 20 24 28],[3 6 9 12 15 18 21])==[64 262144, 5159780352 281474976710656 32768000000000000000 6979147079584381377970176, 2456510688823056210273111113728]",0.0,0.02929309694454923
"Prompt: Write a python function to find the difference between highest and least frequencies in a given array. Assesments: assert find_Diff([1,1,2,2,7,8,4,5,1,4],10) == 2, assert find_Diff([1,7,9,2,3,3,1,3,3],9) == 3, assert find_Diff([1,2,1,2],4) == 0",102,0.035,52,1.9615384615384615,"Prompt: Write a python function find the difference highest and least frequencies a given array Assesments: assert find_Diff([1,1,2,2,7,8,4,5,1,4],10 == 2, 0",0.0,0.08397947408480443
"Prompt: Write a function to find if the given number is abundant or not. Assesments: assert check_abundant(12) == True, assert check_abundant(15) == False, assert check_abundant(18) == True",49,0.03,26,1.8846153846153846,"Prompt: Write a function to find if the given number abundant or Assesments: assert check_abundant(12 == True,",0.0,0.07613248545262588
"Prompt: Write a function to replace all occurrences of spaces, commas, or dots with a colon in the given string by using regex. Assesments: assert fill_spaces('Boult Curve Wireless Neckband') == 'Boult:Curve:Wireless:Neckband', assert fill_spaces('Stereo Sound Sweatproof') == 'Stereo:Sound:Sweatproof', assert fill_spaces('Probass Curve Audio') == 'Probass:Curve:Audio'",92,0.04,56,1.6428571428571428,"Prompt: Write a function replace all occurrences spaces, or dots a colon in the given string by regex. Assesments: assert fill_spaces('Boult Curve Wireless Neckband:CurveWirelessNeckband assert Sound Sweatproof') assert fill_spaces('Probass Curve Audio')'",0.0,0.05147052118006474
"Prompt: Write a function to add two numbers and print number of digits of sum. Assesments: assert count_digits(9875,10)==(4), assert count_digits(98759853034,100)==(11), assert count_digits(1234567,500)==(7)",60,0.031,28,2.142857142857143,"Prompt: Write a function add two numbers and print number of sum Assesments: assert count_digits(9875,10)==(4",0.0,0.10247594728922528
"Prompt: Write a function to flatten the tuple list to a string. Assesments: assert flatten_tuple([('1', '4', '6'), ('5', '8'), ('2', '9'), ('1', '10')]) == '1 4 6 5 8 2 9 1 10', assert flatten_tuple([('2', '3', '4'), ('6', '9'), ('3', '2'), ('2', '11')]) == '2 3 4 6 9 3 2 2 11', assert flatten_tuple([('14', '21', '9'), ('24', '19'), ('12', '29'), ('23', '17')]) == '14 21 9 24 19 12 29 23 17'",174,0.05,112,1.5535714285714286,"Prompt: Write a function to flatten the tuple list to a string. Assesments: assert flatten_tuple([('1 '4',6'), ('58'),29110') == '1 4 6 5 8 2 9 1 10', assert flatten_tuple([('2346932'),2112 3 4 6 9 3 2 2 11', flatten_tuple([('14219241912292317')14 21 9 24 19 12 29 23 17'",0.0,0.04236240937485751
"Prompt: Write a python function to toggle only first and last bits of a given number. Assesments: assert toggle_F_and_L_bits(10) == 3, assert toggle_F_and_L_bits(15) == 6, assert toggle_F_and_L_bits(20) == 5",60,0.031,34,1.7647058823529411,"Prompt: Write a python function toggle only first and bits a given number Assesments: assert toggle_F_and_L_bits(10 == 3, 6 5",0.0,0.06390041493775933
"Prompt: Write a function to find the last occurrence of a character in a string. Assesments: assert last_occurence_char(""hello world"",'l')==10, assert last_occurence_char(""language"",'g')==7, assert last_occurence_char(""little"",'y')==None",63,0.029,29,2.1724137931034484,"Prompt: Write a function find the last occurrence a character Assesments: assert last_occurence_char(""hello world"",'l')==10",0.0,0.10549104636956977
"Prompt: Write a python function to find the sum of hamming distances of all consecutive numbers from o to n. Assesments: assert Total_Hamming_Distance(4) == 7, assert Total_Hamming_Distance(2) == 3, assert Total_Hamming_Distance(5) == 8",65,0.031,36,1.8055555555555556,"Prompt: Write a python function find the sum hamming distances of all consecutive numbers from o to Assesments: assert Total_Hamming_Distance(4 7, 8",0.0,0.06806752491399794
"Prompt: Write a function to find the length of the longest increasing subsequence of the given sequence. Assesments: assert longest_increasing_subsequence([10, 22, 9, 33, 21, 50, 41, 60]) == 5, assert longest_increasing_subsequence([3, 10, 2, 1, 20]) == 3, assert longest_increasing_subsequence([50, 3, 10, 7, 40, 80]) == 4",110,0.036,68,1.6176470588235294,"Prompt: Write a function to find the length the longest increasing subsequence the given sequence Assesments: assert longest_increasing_subsequence([10 22 9 33 21 50 41 60 == 5, 10 2 1 20 3 3 10 7 40, 80",0.0,0.04889881902330035
"Prompt: Write a python function to find the sum of fifth power of first n odd natural numbers. Assesments: assert odd_Num_Sum(1) == 1, assert odd_Num_Sum(2) == 244, assert odd_Num_Sum(3) == 3369",60,0.03,34,1.7647058823529411,"Prompt: Write a python function find the sum fifth power of first n odd natural numbers Assesments: assert odd_Num_Sum(1), 244 3369",0.0,0.06390041493775933
"Prompt: Write a python function to find the maximum element in a sorted and rotated array. Assesments: assert find_Max([2,3,5,6,9],0,4) == 9, assert find_Max([3,4,5,2,1],0,4) == 5, assert find_Max([1,2,3],0,2) == 3",83,0.033,43,1.930232558139535,"Prompt: Write a python function find the maximum element in a sorted and rotated array Assesments: assert find_Max([2,3,5,6,9],0,4) 9, 5",0.0,0.0807859321996155
"Prompt: Write a function to extract a specified column from a given nested list. Assesments: assert extract_column([[1, 2, 3], [2, 4, 5], [1, 1, 1]],0)==[1, 2, 1], assert extract_column([[1, 2, 3], [-2, 4, -5], [1, -1, 1]],2)==[3, -5, 1], assert extract_column([[1, 3], [5, 7], [1, 3], [13, 15, 17], [5, 7], [9, 11]],0)==[1, 5, 1, 13, 5, 9]",164,0.043,113,1.4513274336283186,"Prompt: Write a function to extract a specified column a given nested list. Assesments: assert extract_column([[1 22 41, 1, 1]],0)==[1, 2, 1], assert extract_column([[1 [-2 4 -5 [1, -1 1]],2)==[3 -5 1 3], [5 71 313 15, 175 7 [9, 11]],0)==[1 5 1, 13, 5, 9]",0.0,0.03193241231650514
"Prompt: Write a python function to check whether a given sequence is linear or not. Assesments: assert Seq_Linear([0,2,4,6,8,10]) == ""Linear Sequence"", assert Seq_Linear([1,2,3]) == ""Linear Sequence"", assert Seq_Linear([1,5,2]) == ""Non Linear Sequence""",76,0.033,43,1.7674418604651163,"Prompt: Write a python function check whether a given sequence linear or Assesments: assert Seq_Linear([0,2,4,6,8,10 == ""Linear Sequence assert])Non Linear Sequence""",0.0,0.064179514396633
"Prompt: Write a function to convert the given tuple to a floating-point number. Assesments: assert tuple_to_float((4, 56)) == 4.56, assert tuple_to_float((7, 256)) == 7.256, assert tuple_to_float((8, 123)) == 8.123",67,0.031,38,1.763157894736842,"Prompt: Write a function to convert the given tuple a floating-point number Assesments: assert tuple_to_float((4, 56)) == 4.56, 256 123",0.0,0.06374250340181765
"Prompt: Write a python function to find odd numbers from a mixed list. Assesments: assert Split([1,2,3,4,5,6]) == [1,3,5], assert Split([10,11,12,13]) == [11,13], assert Split([7,8,9,1]) == [7,9,1]",78,0.031,39,2.0,"Prompt: Write a python function find odd numbers from a mixed list Assesments: assert Split([1,2,3,4,5,6 == [], assert])11,13]",0.0,0.0879029684008937
"Prompt: Write a python function to find the difference between sum of cubes of first n natural numbers and the sum of first n natural numbers. Assesments: assert difference(3) == 30, assert difference(5) == 210, assert difference(2) == 6",58,0.031,34,1.7058823529411764,"Prompt: Write a python function find the difference sum of cubes of first n natural numbers the sum Assesments: assert difference(3 30, 210 6",0.0,0.05789977657197573
"Prompt: Write a python function to count the pairs with xor as an odd number. Assesments: assert find_Odd_Pair([5,4,7,2,1],5) == 6, assert find_Odd_Pair([7,2,8,1,0,5,11],7) == 12, assert find_Odd_Pair([1,2,3],3) == 2",89,0.032,42,2.119047619047619,"Prompt: Write a python function count the pairs with xor as an odd number Assesments: assert find_Odd_Pair([5,4,7,2,1],5 6, 12",0.0,0.10004711747450336
"Prompt: Write a function to toggle characters case in a string. Assesments: assert toggle_string(""Python"")==(""pYTHON""), assert toggle_string(""Pangram"")==(""pANGRAM""), assert toggle_string(""LIttLE"")==(""liTTle"")",54,0.029,36,1.5,"Prompt: Write a function toggle characters case in a string Assesments: assert toggle_string(""Python"")==(""pYTHON toggle_string(""LIttLE"")==(""liTTle",0.0,0.03689754229173316
"Prompt: Write a python function to find the digit distance between two integers. Assesments: assert digit_distance_nums(1,2) == 1, assert digit_distance_nums(23,56) == 6, assert digit_distance_nums(123,256) == 7",57,0.03,31,1.8387096774193548,"Prompt: Write a python function find the digit distance between two integers Assesments: assert digit_distance_nums(1,2, assert 6 7",0.0,0.07144960513987417
"Prompt: Write a function to find the largest sum of contiguous subarray in the given array. Assesments: assert max_sub_array_sum([-2, -3, 4, -1, -2, 1, 5, -3], 8) == 7, assert max_sub_array_sum([-3, -4, 5, -2, -3, 2, 6, -4], 8) == 8, assert max_sub_array_sum([-4, -5, 6, -3, -4, 3, 7, -5], 8) == 10",130,0.037,70,1.8571428571428572,"Prompt: Write a function to find the largest sum contiguous subarray in the given array Assesments: assert max_sub_array_sum([-2 -3, 4, -1 -2 1, 5,], 8) == 7, 5 -2 2 6 8 6 3 7 10",0.0,0.07332998951256213
"Prompt: Write a function to find the union of elements of the given tuples. Assesments: assert union_elements((3, 4, 5, 6),(5, 7, 4, 10) ) == (3, 4, 5, 6, 7, 10), assert union_elements((1, 2, 3, 4),(3, 4, 5, 6) ) == (1, 2, 3, 4, 5, 6), assert union_elements((11, 12, 13, 14),(13, 15, 16, 17) ) == (11, 12, 13, 14, 15, 16, 17)",161,0.042,83,1.9397590361445782,"Prompt: Write a function to find the union of elements of the given tuples. Assesments: assert union_elements((3, 4, 5, 6),(5 7 4, 10) ) == (3 4, 7, 10), assert union_elements((1 4),(3)1,), union_elements((11 12 14),(13 15,,,,)",0.0,0.08175773633954905
"Prompt: Write a function to assign with each element, its pair elements from other similar pairs in the given tuple. Assesments: assert assign_elements([(5, 3), (7, 5), (2, 7), (3, 8), (8, 4)] ) == {3: [8], 5: [3], 7: [5], 2: [7], 8: [4], 4: []}, assert assign_elements([(6, 4), (9, 4), (3, 8), (4, 9), (9, 5)] ) == {4: [9], 6: [4], 9: [4, 5], 8: [], 3: [8], 5: []}, assert assign_elements([(6, 2), (6, 8), (4, 9), (4, 9), (3, 7)] ) == {2: [], 6: [2, 8], 8: [], 9: [], 4: [9, 9], 7: [], 3: [7]}",243,0.058,137,1.7737226277372262,"Prompt: Write a function to assign with each element, its pair elements from other similar pairs in the given tuple. Assesments: assert assign_elements([(5 3), (7 52 73 8)8 4)] ) == {3: [8], 53 75 27 84 4 []}, assert assign_elements([(6 49 43 8)4 99 5)]49 64 94, 5 8], 38 5 26 8)4 94 93 7)]2], 62, 8 8], 9], 49, 9 7 37]}",0.0,0.06482022081864586
"Prompt: Write a python function to find the maximum length of sublist. Assesments: assert Find_Max_Length([[1],[1,4],[5,6,7,8]]) == 4, assert Find_Max_Length([[0,1],[2,2,],[3,2,1]]) == 3, assert Find_Max_Length([[7],[22,23],[13,14,15],[10,20,30,40,50]]) == 5",96,0.034,44,2.1818181818181817,"Prompt: Write a python function find the maximum length sublist. Assesments: assert Find_Max_Length([[1],[1,4],[5,6,7,8) == 4, 3 5",0.0,0.10645039607695207
"Prompt: Write a function to extract values between quotation marks of a string. Assesments: assert extract_values('""Python"", ""PHP"", ""Java""')==['Python', 'PHP', 'Java'], assert extract_values('""python"",""program"",""language""')==['python','program','language'], assert extract_values('""red"",""blue"",""green"",""yellow""')==['red','blue','green','yellow']",84,0.035,51,1.6470588235294117,"Prompt: Write a function to extract values between quotation marks of a string. Assesments: assert extract_values('""Python"",PHPJava""')==['Python' assert extract_values('""python"",""program"",""language""')==['python','program','language",0.0,0.05189913820619214
"Prompt: Write a python function to count unequal element pairs from the given array. Assesments: assert count_Pairs([1,2,1],3) == 2, assert count_Pairs([1,1,1,1],4) == 0, assert count_Pairs([1,2,3,4,5],5) == 10",76,0.03,37,2.054054054054054,"Prompt: Write a python function count unequal element pairs from the given array Assesments: assert count_Pairs([1,2,1],3 2, 0 10",0.0,0.09341706852080295
"Prompt: Write a python function to split a string into characters. Assesments: assert split('python') == ['p','y','t','h','o','n'], assert split('Name') == ['N','a','m','e'], assert split('program') == ['p','r','o','g','r','a','m']",72,0.032,62,1.1612903225806452,"Prompt: Write a python function split a string characters. Assesments: assert split('python ['p','y','t','h','o','n' assert split('NameN','a','m','e' split('programp','r','o','g','r','a','m']",0.0,0.0023454794435921506
"Prompt: Write a function to get the sum of a non-negative integer. Assesments: assert sum_digits(345)==12, assert sum_digits(12)==3, assert sum_digits(97)==16",42,0.028,20,2.1,"Prompt: Write a function get the sum Assesments: assert sum_digits(345)==12,",0.0,0.09810405362272583
"Prompt: Write a function to check whether a specified list is sorted or not. Assesments: assert issort_list([1,2,4,6,8,10,12,14,16,17])==True, assert issort_list([1, 2, 4, 6, 8, 10, 12, 14, 20, 17])==False, assert issort_list([1, 2, 4, 6, 8, 10,15,14,20])==False",115,0.033,75,1.5333333333333334,"Prompt: Write a function to check whether a specified list is sorted or Assesments: assert issort_list([1,2,4,6,8,10,12,14,16,17])==True, assert 2 4 6 10 20, 17])==False, 10,15,14,20])==False",0.0,0.04029790403234387
"Prompt: Write a function to create a list of empty dictionaries. Assesments: assert empty_list(5)==[{},{},{},{},{}], assert empty_list(6)==[{},{},{},{},{},{}], assert empty_list(7)==[{},{},{},{},{},{},{}]",59,0.039,39,1.5128205128205128,"Prompt: Write a function to create a list of empty dictionaries. Assesments: assert empty_list(5)==[{},{},{},},}], assert empty_list(6)==},}},},]",0.0,0.03820537373042958
"Prompt: Write a function to sort each sublist of strings in a given list of lists. Assesments: assert sort_sublists([['green', 'orange'], ['black', 'white'], ['white', 'black', 'orange']])==[['green', 'orange'], ['black', 'white'], ['black', 'orange', 'white']], assert sort_sublists([['green', 'orange'], ['black'], ['green', 'orange'], ['white']])==[['green', 'orange'], ['black'], ['green', 'orange'], ['white']], assert sort_sublists([['a','b'],['d','c'],['g','h'] , ['f','e']])==[['a', 'b'], ['c', 'd'], ['g', 'h'], ['e', 'f']]",170,0.049,121,1.4049586776859504,"Prompt: Write a function to sort each sublist of strings in a given list of lists. Assesments: assert sort_sublists([['green',orange' ['blackwhite'], ['whiteblack',orange']])==[['green'black],blackorange', 'white']], assert sort_sublists([['greenblack'greenorange'],white']])==[['green'greenorange'']], assert sort_sublists([['a','b'],['d','c'],['g','h'] , ['f','e']])==[['a','c 'd'gh'ef']]",0.0,0.027202296006520823
"Prompt: Write a function to remove words from a given list of strings containing a character or string. Assesments: assert remove_words(['Red color', 'Orange#', 'Green', 'Orange @', ""White""],['#', 'color', '@'])==['Red', '', 'Green', 'Orange', 'White'], assert remove_words(['Red &', 'Orange+', 'Green', 'Orange @', 'White'],['&', '+', '@'])==['Red', '', 'Green', 'Orange', 'White'], assert remove_words(['Red &', 'Orange+', 'Green', 'Orange @', 'White'],['@'])==['Red &', 'Orange+', 'Green', 'Orange', 'White']",148,0.049,87,1.7011494252873562,"Prompt: Write a function to remove words from a given list of strings containing a character or string. Assesments: assert remove_words(['Red color',Orange#', 'Green',Orange @', ""White""],['#',color',@'])==['Red', '',Green',White'], assert &',Orange+Green @ 'White'&+ &Orange+ 'White'],['@'])==['Red &Orange+',']",0.0,0.05741696658852188
"Prompt: Write a function to find maximum possible sum of disjoint pairs for the given array of integers and a number k. Assesments: assert max_sum_pair_diff_lessthan_K([3, 5, 10, 15, 17, 12, 9], 7, 4) == 62, assert max_sum_pair_diff_lessthan_K([5, 15, 10, 300], 4, 12) == 25, assert max_sum_pair_diff_lessthan_K([1, 2, 3, 4, 5, 6], 6, 6) == 21",139,0.038,79,1.759493670886076,"Prompt: Write a function find maximum possible sum disjoint pairs for the given array of integers and a number k. Assesments: assert max_sum_pair_diff_lessthan_K([3 5 10, 15 17 12 9 7 4) == 62, 15 10 300 4 12 25 6 6 21",0.0,0.06336871280408231
"Prompt: Write a python function to remove two duplicate numbers from a given number of lists. Assesments: assert two_unique_nums([1,2,3,2,3,4,5]) == [1, 4, 5], assert two_unique_nums([1,2,3,2,4,5]) == [1, 3, 4, 5], assert two_unique_nums([1,2,3,4,5]) == [1, 2, 3, 4, 5]",112,0.034,57,1.9649122807017543,"Prompt: Write a python function to remove two duplicate numbers from a given number of lists. Assesments: assert two_unique_nums([1,2,3,2,3,4,5]) == [ 4 5], assert 3, 2 3]",0.0,0.08432364025288243
"Prompt: Write a python function to calculate the product of the unique numbers of a given list. Assesments: assert unique_product([10, 20, 30, 40, 20, 50, 60, 40]) ==  720000000, assert unique_product([1, 2, 3, 1,]) == 6, assert unique_product([7, 8, 9, 0, 1, 1]) == 0",101,0.034,59,1.7118644067796611,"Prompt: Write a python function to calculate the product the unique numbers of a given list. Assesments: assert unique_product([10 20 30 20 50 60 40 == 720000000, 1]) 6, 0 1 1 0",0.0,0.05851001098205544
"Prompt: Write a function to find the surface area of a cylinder. Assesments: assert surfacearea_cylinder(10,5)==942.45, assert surfacearea_cylinder(4,5)==226.18800000000002, assert surfacearea_cylinder(4,10)==351.848",63,0.028,27,2.3333333333333335,"Prompt: Write a function find the surface area a cylinder Assesments assert surfacearea_cylinder(10,5)==942.45",0.0,0.12190658580700076
"Prompt: Write a python function to find nth number in a sequence which is not a multiple of a given number. Assesments: assert count_no(2,3,1,10) == 5, assert count_no(3,6,4,20) == 11, assert count_no(5,10,4,20) == 16",74,0.031,40,1.85,"Prompt: Write a python function find nth number a sequence which not a multiple a given number Assesments: assert count_no(2,3,1,10 5, 11 16",0.0,0.07260134056814556
"Prompt: Write a python function to check whether an array is subarray of another or not. Assesments: assert is_Sub_Array([1,4,3,5],[1,2],4,2) == False, assert is_Sub_Array([1,2,1],[1,2,1],3,3) == True, assert is_Sub_Array([1,0,2,2],[2,2,0],4,3) ==False",96,0.031,43,2.2325581395348837,"Prompt: Write a python function check whether an array subarray another or not Assesments: assert is_Sub_Array([1,4,3,5],[1,2],4,2 == False,False",0.0,0.11162642240515443
"Prompt: Write a python function to find the last digit in factorial of a given number. Assesments: assert last_Digit_Factorial(4) == 4, assert last_Digit_Factorial(21) == 0, assert last_Digit_Factorial(30) == 0",63,0.03,34,1.8529411764705883,"Prompt: Write a python function find the last digit factorial of a given number Assesments: assert last_Digit_Factorial(4 4, assert 0",0.0,0.07290137248643473
"Prompt: Write a function to interleave lists of the same length. Assesments: assert interleave_lists([1,2,3,4,5,6,7],[10,20,30,40,50,60,70],[100,200,300,400,500,600,700])==[1, 10, 100, 2, 20, 200, 3, 30, 300, 4, 40, 400, 5, 50, 500, 6, 60, 600, 7, 70, 700], assert interleave_lists([10,20],[15,2],[5,10])==[10,15,5,20,2,10], assert interleave_lists([11,44], [10,15], [20,5])==[11,10,20,44,15,5]",193,0.037,155,1.2451612903225806,"Prompt: Write a function interleave lists the same length Assesments: assert interleave_lists([1,2,3,4,5,6,7],[10,20,30,40,50,60,70],[100,200,300,400,500,600,700])==[1 10 100 2 20 200 3 30 300 40 400 500 60 600 70 700 assert interleave_lists([10,20],[15,2],[5,10])==[10,15,5,20,2,10], interleave_lists([11,44],10,1520,5])==[11,10,20,44,15,5]",0.0,0.010901228339322295
"Prompt: Write a function to find the dissimilar elements in the given two tuples. Assesments: assert find_dissimilar((3, 4, 5, 6), (5, 7, 4, 10)) == (3, 6, 7, 10), assert find_dissimilar((1, 2, 3, 4), (7, 2, 3, 9)) == (1, 4, 7, 9), assert find_dissimilar((21, 11, 25, 26), (26, 34, 21, 36)) == (34, 36, 11, 25)",147,0.041,91,1.6153846153846154,"Prompt: Write a function to find the dissimilar elements in the given two tuples. Assesments: assert find_dissimilar((3 4,,), (5 7 4 10 == (3 6 7 10), assert7 2 3 9 4 7 9 find_dissimilar((21 11 25 2626 34 21 3634 36 11 25)",0.0,0.04866802524000098
"Prompt: Write a function to extract the even elements in the nested mixed tuple. Assesments: assert extract_even((4, 5, (7, 6, (2, 4)), 6, 8)) == (4, (6, (2, 4)), 6, 8), assert extract_even((5, 6, (8, 7, (4, 8)), 7, 9)) == (6, (8, (4, 8))), assert extract_even((5, 6, (9, 8, (4, 6)), 8, 10)) == (6, (8, (4, 6)), 8, 10)",152,0.042,92,1.6521739130434783,"Prompt: Write a function to extract the even elements in the nested mixed tuple. Assesments: assert extract_even((4, 5, (7 6, (2 4)), 6, 8) == (4 (62 6 8), assert extract_even((5 68 7,4 8) 7 9684 8))9 8 6 8 1068 6 10)",0.0,0.052420932846695065
"Prompt: Write a python function to find the surface area of the square pyramid. Assesments: assert surface_Area(3,4) == 33, assert surface_Area(4,5) == 56, assert surface_Area(1,2) == 5",58,0.03,33,1.7575757575757576,"Prompt: Write a python function find the surface area the square pyramid Assesments: assert surface_Area(3,4 == 33, 56 5",0.0,0.06317306483281586
"Prompt: Write a function to check if a dictionary is empty or not. Assesments: assert my_dict({10})==False, assert my_dict({11})==False, assert my_dict({})==True",44,0.028,22,2.0,"Prompt: Write a function check a dictionary or Assesments: assert my_dict({10})==False,",0.0,0.0879029684008937
"Prompt: Write a function for nth catalan number. Assesments: assert catalan_number(10)==16796, assert catalan_number(9)==4862, assert catalan_number(7)==429",43,0.027,22,1.9545454545454546,Prompt: Write a function nth catalan number Assesments: assert catalan_number(10)==16796,0.0,0.08326611148187911
"Prompt: Write a function to find all adverbs and their positions in a given sentence by using regex. Assesments: assert find_adverbs(""Clearly, he has no excuse for such behavior."") == '0-7: Clearly', assert find_adverbs(""Please handle the situation carefuly"") == '28-36: carefuly', assert find_adverbs(""Complete the task quickly"") == '18-25: quickly'",87,0.037,49,1.7755102040816326,"Prompt: Write a function find all adverbs their positions by regex Assesments assert find_adverbs(""Clearly he no excuse such behavior == '0-7: Clearly', handle carefuly2836 carefuly the task quickly1825 quickly'",0.0,0.06500257300494407
"Prompt: Write a function to find the n - expensive price items from a given dataset using heap queue algorithm. Assesments: assert expensive_items([{'name': 'Item-1', 'price': 101.1},{'name': 'Item-2', 'price': 555.22}],1)==[{'name': 'Item-2', 'price': 555.22}], assert expensive_items([{'name': 'Item-1', 'price': 101.1},{'name': 'Item-2', 'price': 555.22}, {'name': 'Item-3', 'price': 45.09}],2)==[{'name': 'Item-2', 'price': 555.22},{'name': 'Item-1', 'price': 101.1}], assert expensive_items([{'name': 'Item-1', 'price': 101.1},{'name': 'Item-2', 'price': 555.22}, {'name': 'Item-3', 'price': 45.09},{'name': 'Item-4', 'price': 22.75}],1)==[{'name': 'Item-2', 'price': 555.22}]",255,0.053,196,1.3010204081632653,"Prompt: Write a function to find the n - expensive price items from a given dataset using heap queue algorithm. Assesments: assert expensive_items([{'name': 'Item-1', 'price': 101.1},{'name 'Item-2', 555.22}],1)==[{'name 'Item-2', 'price 555.22}], assert expensive_items([{'name 'Item-1', 101.1},{'name ' 555.22}, {Item-3 ' 45.09}],2)==[{'nameItem-2 ' 555.22},{'nameItem-1 ' 101.1}], assert expensive_items([{'nameItem-1 ' 101.1},{'nameItem-2 ' 555.22}, {Item-3 '': 45.09},{'nameItem-4 ' 22.75}],1)==[{'nameItem-2 ' 555.22}]",0.0,0.016599464554414158
"Prompt: Write a python function to split the array and add the first part to the end. Assesments: assert split_Arr([12,10,5,6,52,36],6,2) == [5,6,52,36,12,10], assert split_Arr([1,2,3,4],4,1) == [2,3,4,1], assert split_Arr([0,1,2,3,4,5,6,7],8,3) == [3,4,5,6,7,0,1,2]",128,0.033,43,2.9767441860465116,"Prompt: Write a python function split the array and add the first part Assesments: assert split_Arr([12,10,5,6,52,36],6,2) == [], assert]",0.0,0.18754147521878872
"Prompt: Write a function to convert a list to a tuple. Assesments: assert list_tuple([5, 10, 7, 4, 15, 3])==(5, 10, 7, 4, 15, 3), assert list_tuple([2, 4, 5, 6, 2, 3, 4, 4, 7])==(2, 4, 5, 6, 2, 3, 4, 4, 7), assert list_tuple([58,44,56])==(58,44,56)",130,0.036,81,1.6049382716049383,"Prompt: Write a function to convert a list to a tuple. Assesments: assert list_tuple([5 10, 7 4 15 3])==(5), assert list_tuple([2 4 5 6 2, 3, 4, 4, 7])==(2 list_tuple([58,44,56])==(58,44,56)",0.0,0.04760238480847056
"Prompt: Write a python function to find the difference between largest and smallest value in a given array. Assesments: assert big_diff([1,2,3,4]) == 3, assert big_diff([4,5,12]) == 8, assert big_diff([9,2,3]) == 7",67,0.031,40,1.675,"Prompt: Write a python function find the difference largest and smallest value in a given array Assesments: assert big_diff([1,2,3,4 == 3, 8 7",0.0,0.05474944142993936
"Prompt: Write a function to find perfect squares between two given numbers. Assesments: assert perfect_squares(1,30)==[1, 4, 9, 16, 25], assert perfect_squares(50,100)==[64, 81, 100], assert perfect_squares(100,200)==[100, 121, 144, 169, 196]",84,0.032,46,1.826086956521739,"Prompt: Write a function find perfect squares between two given numbers Assesments: assert perfect_squares(1,30)==[1 4 9 25 81 100 121 144 169 196]",0.0,0.07016195062379438
"Prompt: Write a function to convert polar coordinates to rectangular coordinates. Assesments: assert polar_rect(3,4)==((5.0, 0.9272952180016122), (-2+2.4492935982947064e-16j)), assert polar_rect(4,7)==((8.06225774829855, 1.0516502125483738), (-2+2.4492935982947064e-16j)), assert polar_rect(15,17)==((22.67156809750927, 0.8478169733934057), (-2+2.4492935982947064e-16j))",142,0.036,101,1.4059405940594059,"Prompt: Write a function convert polar coordinates rectangular coordinates Assesments: assert polar_rect(3,4)==((5.0 0.9272952180016122 (-2+2.4492935982947064e-16j)), assert polar_rect(4,7)==((8.06225774829855, 1.0516502125483738 polar_rect(15,17)==((22.67156809750927 0.8478169733934057",0.0,0.027302462132584138
"Prompt: Write a python function to interchange the first and last elements in a list. Assesments: assert swap_List([12, 35, 9, 56, 24]) == [24, 35, 9, 56, 12], assert swap_List([1, 2, 3]) == [3, 2, 1], assert swap_List([4, 5, 6]) == [6, 5, 4]",99,0.035,58,1.706896551724138,"Prompt: Write a python function to interchange the first and last elements in a list. Assesments: assert swap_List([12 35, 9 56, 24 == [24 35 12], assert 2])3 2 1 5 4]",0.0,0.058003235854144415
"Prompt: Write a python function to find sum of product of binomial co-efficients. Assesments: assert sum_Of_product(3) == 15, assert sum_Of_product(4) == 56, assert sum_Of_product(1) == 1",57,0.035,32,1.78125,"Prompt: Write a python function find sum product of binomial coefficients. Assesments: assert sum_Of_product(3 15, 56 1",0.0,0.06558809447813596
"Prompt: Write a function to remove leading zeroes from an ip address. Assesments: assert removezero_ip(""216.08.094.196"")==('216.8.94.196') , assert removezero_ip(""12.01.024"")==('12.1.24') , assert removezero_ip(""216.08.094.0196"")==('216.8.94.196')",84,0.032,54,1.5555555555555556,"Prompt: Write a function remove leading zeroes an ip address Assesments: assert removezero_ip(""216.08.094.196"")==('216.8.94.196 , removezero_ip(""12.01.024"")==('12.1.24",0.0,0.04256481185941767
"Prompt: Write a function to find the difference of first even and odd number of a given list. Assesments: assert diff_even_odd([1,3,5,7,4,1,6,8])==3, assert diff_even_odd([1,2,3,4,5,6,7,8,9,10])==1, assert diff_even_odd([1,5,7,9,10])==9",96,0.031,44,2.1818181818181817,"Prompt: Write a function find the difference of first even and odd number a given list Assesments assert diff_even_odd([1,3,5,7,4,1,6,8])==3",0.0,0.10645039607695207
"Prompt: Write a python function to count minimum number of swaps required to convert one binary string to another. Assesments: assert min_Swaps(""1101"",""1110"") == 1, assert min_Swaps(""111"",""000"") == ""Not Possible"", assert min_Swaps(""111"",""110"") == ""Not Possible""",71,0.034,47,1.5106382978723405,"Prompt: Write a python function count minimum number swaps required to convert one binary string Assesments: assert min_Swaps(""1101"",""1110 == 1, min_Swaps(""111"",""000 ""Not Possible""",0.0,0.037982764123842966
"Prompt: Write a function to find the size of the given tuple. Assesments: assert tuple_size((""A"", 1, ""B"", 2, ""C"", 3) ) == sys.getsizeof((""A"", 1, ""B"", 2, ""C"", 3)), assert tuple_size((1, ""Raju"", 2, ""Nikhil"", 3, ""Deepanshu"") ) == sys.getsizeof((1, ""Raju"", 2, ""Nikhil"", 3, ""Deepanshu"")), assert tuple_size(((1, ""Lion""), ( 2, ""Tiger""), (3, ""Fox""), (4, ""Wolf""))  ) == sys.getsizeof(((1, ""Lion""), ( 2, ""Tiger""), (3, ""Fox""), (4, ""Wolf"")))",175,0.048,103,1.6990291262135921,"Prompt: Write a function to find the size the given tuple. Assesments: assert tuple_size((""A"", 1, "" 2, 3) ) == sys.getsizeof((""A 1,)), assert tuple_size((1, ""Raju 2,Nikhil"",, ""Deepanshu"") ) sys.getsizeof((1Raju), assert tuple_size(((1Lion""), ( 2 ""Tiger (3Fox""),Wolf"")) ) sys.getsizeof(((1 ""Lion 23"")))",0.0,0.057200673073049484
"Prompt: Write a function to find kth element from the given two sorted arrays. Assesments: assert find_kth([2, 3, 6, 7, 9], [1, 4, 8, 10], 5, 4, 5) == 6, assert find_kth([100, 112, 256, 349, 770], [72, 86, 113, 119, 265, 445, 892], 5, 7, 7) == 256, assert find_kth([3, 4, 7, 8, 10], [2, 5, 9, 11], 5, 4, 6) == 8",160,0.042,103,1.5533980582524272,"Prompt: Write a function to find kth element from the given two sorted arrays Assesments: assert find_kth([2, 6 9 [1 4 8 5 4 5) == 6, assert find_kth([100 112 256 349 77072 86 113 119 265 445, 892 5 7 7 256 7 8 102 5 9 11 5 4 6 8",0.0,0.042344723720866805
"Prompt: Write a function to check whether the given number is armstrong or not. Assesments: assert armstrong_number(153)==True, assert armstrong_number(259)==False, assert armstrong_number(4458)==False",48,0.029,23,2.0869565217391304,Prompt: Write a function check the given number armstrong Assesments: assert armstrong_number(153)==True,0.0,0.09677347728944337
"Prompt: Write a function to find sum and average of first n natural numbers. Assesments: assert sum_average(10)==(55, 5.5), assert sum_average(15)==(120, 8.0), assert sum_average(20)==(210, 10.5)",62,0.029,34,1.8235294117647058,Prompt: Write a function find sum and average of first n natural numbers Assesments: assert sum_average(10)==(55 5.5 8.0,0.0,0.06990105330354292
"Prompt: Write a python function to check whether the given number is even or not using bitwise operator. Assesments: assert is_Even(1) == False, assert is_Even(2) == True, assert is_Even(3) == False",54,0.03,30,1.8,"Prompt: Write a python function check whether the given number even or using bitwise operator. Assesments: assert is_Even(1 False,",0.0,0.06750079795722949
"Prompt: Write a function to find the longest chain which can be formed from the given set of pairs. Assesments: assert max_chain_length([Pair(5, 24), Pair(15, 25),Pair(27, 40), Pair(50, 60)], 4) == 3, assert max_chain_length([Pair(1, 2), Pair(3, 4),Pair(5, 6), Pair(7, 8)], 4) == 4, assert max_chain_length([Pair(19, 10), Pair(11, 12),Pair(13, 14), Pair(15, 16), Pair(31, 54)], 5) == 5",151,0.04,97,1.556701030927835,"Prompt: Write a function to find the longest chain which can formed from the given set pairs. Assesments: assert max_chain_length([Pair(5 24), Pair(15 25),Pair(27 40 Pair(50 60)], 4) == 3, assert 2 4),Pair(5 8) 4 4 max_chain_length([Pair(19 10 Pair(11 14 Pair(31 54 5 5",0.0,0.042681662778339
"Prompt: Write a python function to find the first repeated character in a given string. Assesments: assert first_repeated_char(""abcabc"") == ""a"", assert first_repeated_char(""abc"") == ""None"", assert first_repeated_char(""123123"") == ""1""",59,0.031,35,1.6857142857142857,"Prompt: Write a python function to find the first repeated character in a given string Assesments: assert first_repeated_char(""abcabc == ""a"",None1""",0.0,0.05584241484656422
"Prompt: Write a function to get a lucid number smaller than or equal to n. Assesments: assert get_ludic(10) == [1, 2, 3, 5, 7], assert get_ludic(25) == [1, 2, 3, 5, 7, 11, 13, 17, 23, 25], assert get_ludic(45) == [1, 2, 3, 5, 7, 11, 13, 17, 23, 25, 29, 37, 41, 43]",135,0.037,72,1.875,"Prompt: Write a function to get a lucid number smaller or n. Assesments: assert get_ludic(10) == [1, 2 5 7], assert get_ludic(251, 11, 13, 17, 23 25], 11, 29, 37 41 43]",0.0,0.07515161187360357
"Prompt: Write a function to reverse words in a given string. Assesments: assert reverse_words(""python program"")==(""program python""), assert reverse_words(""java language"")==(""language java""), assert reverse_words(""indian man"")==(""man indian"")",51,0.03,29,1.7586206896551724,"Prompt: Write a function reverse words in a given string Assesments: assert reverse_words(""python program"")==(""program python language"")==(""language",0.0,0.06327965924474724
"Prompt: Write a function to check if the given integer is a prime number. Assesments: assert prime_num(13)==True, assert prime_num(7)==True, assert prime_num(-1010)==False",44,0.028,23,1.9130434782608696,Prompt: Write a function check the given integer a prime number Assesments: assert prime_num(13)==True,0.0,0.07903245951234406
"Prompt: Write a function to convert degrees to radians. Assesments: assert radian_degree(90)==1.5707963267948966, assert radian_degree(60)==1.0471975511965976, assert radian_degree(120)==2.0943951023931953",62,0.032,26,2.3846153846153846,"Prompt: Write a function convert degrees Assesments assert radian_degree(90)==1.5707963267948966,",0.0,0.12713791156178644
"Prompt: Write a function to search a literals string in a string and also find the location within the original string where the pattern occurs by using regex. Assesments: assert find_literals('The quick brown fox jumps over the lazy dog.', 'fox') == ('fox', 16, 19), assert find_literals('Its been a very crazy procedure right', 'crazy') == ('crazy', 16, 21), assert find_literals('Hardest choices required strongest will', 'will') == ('will', 35, 39)",112,0.041,76,1.4736842105263157,"Prompt: Write a function search a literals string in and also find the location within the original string where the pattern occurs by regex Assesments: assert find_literals('The quick brown fox jumps over the lazy dog,fox (' 16 19 been a very crazy procedure right',crazycrazy 21 find_literals('Hardest choices required strongest willwill 35 39",0.0,0.0342130461807247
"Prompt: Write a python function to find nth bell number. Assesments: assert bell_Number(2) == 2, assert bell_Number(3) == 5, assert bell_Number(4) == 15",45,0.03,27,1.6666666666666667,"Prompt: Write a python function find nth bell number. Assesments: assert bell_Number(2 2, 5 15",0.0,0.05389935099478668
"Prompt: Write a python function to find minimum possible value for the given periodic function. Assesments: assert floor_Min(10,20,30) == 15, assert floor_Min(1,2,1) == 0, assert floor_Min(11,10,9) == 9",62,0.031,43,1.441860465116279,"Prompt: Write a python function find minimum possible value the given periodic function Assesments: assert floor_Min(10,20,30) 15, 0 floor_Min(11,10,9 9",0.0,0.03096667879066797
"Prompt: Write a python function to remove the k'th element from a given list. Assesments: assert remove_kth_element([1,1,2,3,4,4,5,1],3)==[1, 1, 3, 4, 4, 5, 1], assert remove_kth_element([0, 0, 1, 2, 3, 4, 4, 5, 6, 6, 6, 7, 8, 9, 4, 4],4)==[0, 0, 1, 3, 4, 4, 5, 6, 6, 6, 7, 8, 9, 4, 4], assert remove_kth_element([10, 10, 15, 19, 18, 18, 17, 26, 26, 17, 18, 10],5)==[10,10,15,19, 18, 17, 26, 26, 17, 18, 10]",240,0.043,160,1.5,"Prompt: Write a python function to remove the k'th element from a given list. Assesments: assert remove_kth_element([1,1,2,3,4,4,5,1],3)==[1 1 3 4 1], assert 0 1 2 4 6, 6, 6, 7 8 9 4, 4],4)==[0 0 1 3 4 6 6 6 4 assert remove_kth_element([10 10 15 19 18 18 17 26 26 17 18 10],5)==[10,10,15,19 18 17 26 26 17 18]",0.0,0.03689754229173316
"Prompt: Write a function to find the maximum of nth column from the given tuple list. Assesments: assert max_of_nth([(5, 6, 7), (1, 3, 5), (8, 9, 19)], 2) == 19, assert max_of_nth([(6, 7, 8), (2, 4, 6), (9, 10, 20)], 1) == 10, assert max_of_nth([(7, 8, 9), (3, 5, 7), (10, 11, 21)], 1) == 11",138,0.039,80,1.725,"Prompt: Write a function to find the maximum of nth column from the given tuple list. Assesments: assert max_of_nth([(5, 6,), (1 3 58 9 19)], 2) == 19, assert max_of_nth([(62 4 69 10 20 1 103 5 7 21 1 11",0.0,0.05984998404085542
"Prompt: Write a python function to merge the first and last elements separately in a list of lists. Assesments: assert merge([['x', 'y'], ['a', 'b'], ['m', 'n']]) == [['x', 'a', 'm'], ['y', 'b', 'n']], assert merge([[1, 2], [3, 4], [5, 6], [7, 8]]) == [[1, 3, 5, 7], [2, 4, 6, 8]], assert merge([['x', 'y','z' ], ['a', 'b','c'], ['m', 'n','o']]) == [['x', 'a', 'm'], ['y', 'b', 'n'],['z', 'c','o']]",172,0.052,101,1.702970297029703,"Prompt: Write a python function to merge the first and last elements separately in a list of lists. Assesments: assert merge([['x',' ['a'mn]]) == [['xa',myb',n']], assert merge([[1 2], [3,]])1 3, 5, 7],2 4, 6, 8] merge([['xy','z' ], ['ab','c'mn','o']])'amn'],['zc','o'",0.0,0.05760271526673892
"Prompt: Write a function to find the maximum value in record list as tuple attribute in the given tuple list. Assesments: assert maximum_value([('key1', [3, 4, 5]), ('key2', [1, 4, 2]), ('key3', [9, 3])]) == [('key1', 5), ('key2', 4), ('key3', 9)], assert maximum_value([('key1', [4, 5, 6]), ('key2', [2, 5, 3]), ('key3', [10, 4])]) == [('key1', 6), ('key2', 5), ('key3', 10)], assert maximum_value([('key1', [5, 6, 7]), ('key2', [3, 6, 4]), ('key3', [11, 5])]) == [('key1', 7), ('key2', 6), ('key3', 11)]",215,0.057,133,1.6165413533834587,"Prompt: Write a function to find the maximum value in record list as tuple attribute in the given tuple list. Assesments: assert maximum_value([('key1', [3, 4, 5]), ('1 4, 2]),9 3])]) == [('key1 5), 4), 9)], assert maximum_value([('key1 [4, 5, 6 [2, 5, 3 [10, 4])]) == 6 5 10) [5, 6, [3 6, 4 [11 5])]) 7 6 11)]",0.0,0.0487860250690563
"Prompt: Write a function to find the cumulative sum of all the values that are present in the given tuple list. Assesments: assert cummulative_sum([(1, 3), (5, 6, 7), (2, 6)]) == 30, assert cummulative_sum([(2, 4), (6, 7, 8), (3, 7)]) == 37, assert cummulative_sum([(3, 5), (7, 8, 9), (4, 8)]) == 44",116,0.039,68,1.7058823529411764,"Prompt: Write a function to find the cumulative sum all the values that are present the given tuple list. Assesments: assert cummulative_sum([(1, 3), (5 6,2 6) == 30, assert 46 7,3 7 37 57, 8) 44",0.0,0.05789977657197573
"Prompt: Write a function to find average value of the numbers in a given tuple of tuples. Assesments: assert average_tuple(((10, 10, 10, 12), (30, 45, 56, 45), (81, 80, 39, 32), (1, 2, 3, 4)))==[30.5, 34.25, 27.0, 23.25], assert average_tuple(((1, 1, -5), (30, -15, 56), (81, -60, -39), (-10, 2, 3)))== [25.5, -18.0, 3.75], assert average_tuple( ((100, 100, 100, 120), (300, 450, 560, 450), (810, 800, 390, 320), (10, 20, 30, 40)))==[305.0, 342.5, 270.0, 232.5]",223,0.048,148,1.5067567567567568,"Prompt: Write a function to find average value of the numbers in a given tuple of tuples Assesments: assert average_tuple(((10 10,, 12 (30 45 56 4581 80 39 321 4)))==[30.5 34.25 27.0 23.25 assert 1 -530 -15 5681 -60 -39 (-10 2 3)))== [25.5 -18.0 3.75( ((100 120300 450 560, 450810 800 390 32010 20 30, 40)))==[305.0 342.5 270.0 232.5]",0.0,0.03758680480672182
"Prompt: Write a function to perfom the modulo of tuple elements in the given two tuples. Assesments: assert tuple_modulo((10, 4, 5, 6), (5, 6, 7, 5)) == (0, 4, 5, 1), assert tuple_modulo((11, 5, 6, 7), (6, 7, 8, 6)) == (5, 5, 6, 1), assert tuple_modulo((12, 6, 7, 8), (7, 8, 9, 7)) == (5, 6, 7, 1)",146,0.04,81,1.8024691358024691,"Prompt: Write a function to perfom the modulo of tuple elements in the given two tuples. Assesments: assert tuple_modulo((10, 4, 5, 6), (5 6, 5 == (0 4 5 1), assert tuple_modulo((11 5 66 8 65 5 6 67 75 6)",0.0,0.06775267660468214
"Prompt: Write a function to check for the number of jumps required of given length to reach a point of form (d, 0) from origin in a 2d plane. Assesments: assert min_Jumps(3,4,11)==3.5, assert min_Jumps(3,4,0)==0, assert min_Jumps(11,14,11)==1",81,0.033,35,2.3142857142857145,"Prompt: Write jumps required of given length to reach formd, 0 from origin in Assesments assert min_Jumps(3,4,11)==3.5",0.0,0.11996352195522322
"Prompt: Write a function to divide two lists using map and lambda function. Assesments: assert div_list([4,5,6],[1, 2, 3])==[4.0,2.5,2.0], assert div_list([3,2],[1,4])==[3.0, 0.5], assert div_list([90,120],[50,70])==[1.8, 1.7142857142857142]",102,0.031,43,2.372093023255814,"Prompt: Write a function divide two lists using map and lambda function Assesments assert div_list([4,5,6],[1 2 0.5 1.7142857142857142]",0.0,0.1258604948077109
"Prompt: Write a function to move all the numbers in it to the given string. Assesments: assert move_num('I1love143you55three3000thousand') == 'Iloveyouthreethousand1143553000', assert move_num('Avengers124Assemble') == 'AvengersAssemble124', assert move_num('Its11our12path13to14see15things16do17things') == 'Itsourpathtoseethingsdothings11121314151617'",107,0.035,94,1.1382978723404256,Prompt: Write a function to move all the numbers it the given string Assesments: assert move_num('I1love143you55three3000thousand 'Iloveyouthreethousand1143553000 assert move_num('Avengers124AssembleAvengersAssemble124 assert move_num('Its11our12path13to14see15things16do17thingsItsourpathtoseethingsdothings11121314151617',0.0,0.0
"Prompt: Write a function to find the largest subset where each pair is divisible. Assesments: assert largest_subset([ 1, 3, 6, 13, 17, 18 ], 6) == 4, assert largest_subset([10, 5, 3, 15, 20], 5) == 3, assert largest_subset([18, 1, 3, 6, 13, 17], 6) == 4",101,0.035,56,1.8035714285714286,"Prompt: Write a function find the largest subset where each pair divisible. Assesments: assert largest_subset([ 1 3 6 13 17 18 ], 6) == 4, 5 3 15 20 1 6 13",0.0,0.06786512242943778
"Prompt: Write a function to increment the numeric values in the given strings by k. Assesments: assert increment_numerics([""MSM"", ""234"", ""is"", ""98"", ""123"", ""best"", ""4""] , 6) == ['MSM', '240', 'is', '104', '129', 'best', '10'], assert increment_numerics([""Dart"", ""356"", ""is"", ""88"", ""169"", ""Super"", ""6""] , 12) == ['Dart', '368', 'is', '100', '181', 'Super', '18'], assert increment_numerics([""Flutter"", ""451"", ""is"", ""44"", ""96"", ""Magnificent"", ""12""] , 33) == ['Flutter', '484', 'is', '77', '129', 'Magnificent', '45']",183,0.056,117,1.564102564102564,"Prompt: Write a function to increment the numeric values in the given strings by k. Assesments: assert increment_numerics([""MSM"", ""234"", ""is"", ""98"",123"",best"", ""4""] , 6) == ['MSM', '240is104129best10'], assert increment_numerics([""Dart"",356is88169 ""Super"",6""] , 12Dart368 '100181Super '18' assert increment_numerics([""Flutter4514496Magnificent12 33484 '77129Magnificent45']",0.0,0.04343669948521528
"Prompt: Write a function to find the median of two sorted arrays of same size. Assesments: assert get_median([1, 12, 15, 26, 38], [2, 13, 17, 30, 45], 5) == 16.0, assert get_median([2, 4, 8, 9], [7, 13, 19, 28], 4) == 8.5, assert get_median([3, 6, 14, 23, 36, 42], [2, 18, 27, 39, 49, 55], 6) == 25.0",149,0.04,91,1.6373626373626373,"Prompt: Write a function find the median of two sorted arrays of same size Assesments: assert get_median([1 12 15 26 382 13 17 30 45 5) == 16.0, 4 8 97 13 19 28 4 8.5 6 14 23, 36, 422 18 27 39 49, 55",0.0,0.05091002199205199
"Prompt: Write a function to find the n-th power of individual elements in a list using lambda function. Assesments: assert nth_nums([1, 2, 3, 4, 5, 6, 7, 8, 9, 10],2)==[1, 4, 9, 16, 25, 36, 49, 64, 81, 100], assert nth_nums([10,20,30],3)==([1000, 8000, 27000]), assert nth_nums([12,15],5)==([248832, 759375])",132,0.037,91,1.4505494505494505,"Prompt: Write a function to find the n-th power individual elements in a list using lambda function Assesments: assert nth_nums([1, 10],2)==[1 4 9 16 25 36 49 64 81 100 assert nth_nums([10,20,30],3)==([1000 8000 27000]), nth_nums([12,15],5)==([248832 759375",0.0,0.03185304959961838
"Prompt: Write a python function to convert the given string to upper case. Assesments: assert is_upper(""person"") ==""PERSON"", assert is_upper(""final"") == ""FINAL"", assert is_upper(""Valid"") == ""VALID""",48,0.031,34,1.411764705882353,"Prompt: Write a python function convert the given string upper case Assesments: assert is_upper(""person ==""PERSON is_upper(""final ==FINAL is_upper(""ValidVALID",0.0,0.027896584743057777
"Prompt: Write a python function to interchange first and last elements in a given list. Assesments: assert swap_List([1,2,3]) == [3,2,1], assert swap_List([1,2,3,4,4]) == [4,2,3,4,1], assert swap_List([4,5,6]) == [6,5,4]",83,0.032,50,1.66,"Prompt: Write a python function interchange first and last elements in a given list Assesments: assert swap_List([1,2,3 == [3,2,1], assert swap_List([1,2,3,4,4]",0.0,0.05321927864666453
"Prompt: Write a python function to find the largest triangle that can be inscribed in the semicircle. Assesments: assert triangle_area(0) == 0, assert triangle_area(-1) == -1, assert triangle_area(2) == 4",54,0.03,31,1.7419354838709677,"Prompt: Write a python function find the largest triangle that can inscribed the semicircle Assesments: assert triangle_area(0), -1 4",0.0,0.06157758718326246
"Prompt: Write a python function to find the smallest missing number from the given array. Assesments: assert find_First_Missing([0,1,2,3],0,3) == 4, assert find_First_Missing([0,1,2,6,9],0,4) == 3, assert find_First_Missing([2,3,5,8,9],0,4) == 0",90,0.031,42,2.142857142857143,"Prompt: Write a python function find the smallest missing number from the given array Assesments: assert find_First_Missing([0,1,2,3],0,3 == 4, 0",0.0,0.10247594728922528
"Prompt: Write a function to replace all spaces in the given string with character * list item * list item * list item * list item '%20'. Assesments: assert replace_spaces(""My Name is Dawood"") == 'My%20Name%20is%20Dawood', assert replace_spaces(""I am a Programmer"") == 'I%20am%20a%20Programmer', assert replace_spaces(""I love Coding"") == 'I%20love%20Coding'",100,0.036,47,2.127659574468085,"Prompt: Write a function replace all spaces the given string character * list item * list item * list item * list item '%20'. Assesments: assert replace_spaces(""My Name Dawood == ' assert a Programmer love Coding'",0.0,0.10092563038621129
"Prompt: Write a python function to find even numbers from a mixed list. Assesments: assert Split([1,2,3,4,5]) == [2,4], assert Split([4,5,6,7,8,0,1]) == [4,6,8,0], assert Split ([8,12,15,19]) == [8,12]",82,0.031,45,1.8222222222222222,"Prompt: Write a python function find even numbers from a mixed list Assesments: assert Split([1,2,3,4,5 == [2,4], assert ([8,12,15,19]",0.0,0.06976770578430329
"Prompt: Write a function to extract all the adjacent coordinates of the given coordinate tuple. Assesments: assert get_coordinates((3, 4)) == [[2, 3], [2, 4], [2, 5], [3, 3], [3, 4], [3, 5], [4, 3], [4, 4], [4, 5]], assert get_coordinates((4, 5)) ==[[3, 4], [3, 5], [3, 6], [4, 4], [4, 5], [4, 6], [5, 4], [5, 5], [5, 6]], assert get_coordinates((5, 6)) == [[4, 5], [4, 6], [4, 7], [5, 5], [5, 6], [5, 7], [6, 5], [6, 6], [6, 7]]",213,0.055,122,1.7459016393442623,"Prompt: Write a function to extract all the adjacent coordinates of the given coordinate tuple. Assesments: assert get_coordinates((3, 4)) == [[2, 3], [2 4], [2 5],3 3],3 4],3 5],4, 3], 4], [4, 5]], assert get_coordinates((4 5=[[3 43 53 64 4 545 4 55 6] assert get_coordinates((5 6 [[4 5445 555 76 5 66 7]]",0.0,0.0619821780831236
"Prompt: Write a function to replace whitespaces with an underscore and vice versa in a given string by using regex. Assesments: assert replace_spaces('Jumanji The Jungle') == 'Jumanji_The_Jungle', assert replace_spaces('The Avengers') == 'The_Avengers', assert replace_spaces('Fast and Furious') == 'Fast_and_Furious'",76,0.037,37,2.054054054054054,Prompt: Write a function replace whitespaces an underscore and vice in a given string by regex. Assesments: assert replace_spaces('Jumanji The Jungle') == assert and',0.0,0.09341706852080295
"Prompt: Write a python function to move all zeroes to the end of the given list. Assesments: assert move_zero([1,0,2,0,3,4]) == [1,2,3,4,0,0], assert move_zero([2,3,2,0,0,4,0,5,0]) == [2,3,2,4,5,0,0,0,0], assert move_zero([0,1,0,1,1]) == [1,1,1,0,0]",121,0.033,57,2.1228070175438596,"Prompt: Write a python function move all zeroes to the given list Assesments: assert move_zero([1,0,2,0,3,4 == [], assert move_zero([2,3,2,0,0,4,0,5,0])]",0.0,0.10043061691893314
"Prompt: Write a python function to find the sum of xor of all pairs of numbers in the given array. Assesments: assert pair_OR_Sum([5,9,7,6],4) == 47, assert pair_OR_Sum([7,3,5],3) == 12, assert pair_OR_Sum([7,3],2) == 4",79,0.031,43,1.8372093023255813,"Prompt: Write a python function find the sum xor of all pairs numbers the given array Assesments: assert pair_OR_Sum([5,9,7,6],4 47, 12 4",0.0,0.07129655059791119
"Prompt: Write a python function to find the sum of fourth power of first n even natural numbers. Assesments: assert even_Power_Sum(2) == 272, assert even_Power_Sum(3) == 1568, assert even_Power_Sum(4) == 5664",64,0.03,38,1.6842105263157894,"Prompt: Write a python function find the sum fourth power of first n even natural numbers Assesments: assert even_Power_Sum(2 272, 1568 5664",0.0,0.0556890150687923
"Prompt: Write a function to push all values into a heap and then pop off the smallest values one at a time. Assesments: assert heap_sort([1, 3, 5, 7, 9, 2, 4, 6, 8, 0])==[0, 1, 2, 3, 4, 5, 6, 7, 8, 9], assert heap_sort([25, 35, 22, 85, 14, 65, 75, 25, 58])==[14, 22, 25, 25, 35, 58, 65, 75, 85], assert heap_sort( [7, 1, 9, 5])==[1,5,7,9]",176,0.04,112,1.5714285714285714,"Prompt: Write a function to push all values into a heap and then pop off the smallest values one Assesments: assert heap_sort([1 3 5 9 2 4 6 8 0])==[0, 9], assert heap_sort([25 35 22 85 14 65 75 25 58])==[14 22 25 25 35 58 65 85( [7 1 9 5])==[1,5,7,9]",0.0,0.04418403173589895
"Prompt: Write a python function to check if roots of a quadratic equation are reciprocal of each other or not. Assesments: assert Check_Solution(2,0,2) == ""Yes"", assert Check_Solution(2,-5,2) == ""Yes"", assert Check_Solution(1,2,3) == ""No""",71,0.033,32,2.21875,"Prompt: Write a python function check roots of a quadratic equation reciprocal of each or Assesments: assert Check_Solution(2,0,2 == """,0.0,0.11021784232365145
"Prompt: Write a function to check whether the given amount has no profit and no loss Assesments: assert noprofit_noloss(1500,1200)==False, assert noprofit_noloss(100,100)==True, assert noprofit_noloss(2000,5000)==False",66,0.018,31,2.129032258064516,"Prompt: Write a function the given amount no profit and no loss Assesments assert noprofit_noloss(1500,1200)==False",0.0,0.10106565900970932
"Prompt: Write a function to calculate wind chill index. Assesments: assert wind_chill(120,35)==40, assert wind_chill(40,70)==86, assert wind_chill(10,100)==116",47,0.027,22,2.1363636363636362,"Prompt: Write a function calculate wind chill index Assesments assert wind_chill(120,35)==40",0.0,0.10181353915793748
"Prompt: Write a function to sum the length of the names of a given list of names after removing the names that start with a lowercase letter. Assesments: assert sample_nam(['sally', 'Dylan', 'rebecca', 'Diana', 'Joanne', 'keith'])==16, assert sample_nam([""php"", ""res"", ""Python"", ""abcd"", ""Java"", ""aaa""])==10, assert sample_nam([""abcd"", ""Python"", ""abba"", ""aba""])==6",107,0.039,79,1.3544303797468353,"Prompt: Write a function to sum the length the names of a given list of names after removing the names that start a lowercase letter Assesments: assert sample_nam(['sallyDylanrebeccaDianaJoannekeith'])==16, assert sample_nam([""php ""resPython"", ""abcdJavaaaa""])==10 sample_nam([""abcdPythonabbaaba""])==6",0.0,0.022047861272610457
"Prompt: Write a function to remove the parenthesis area in a string. Assesments: assert remove_parenthesis([""python (chrome)""])==(""python""), assert remove_parenthesis([""string(.abc)""])==(""string""), assert remove_parenthesis([""alpha(num)""])==(""alpha"")",60,0.033,42,1.4285714285714286,"Prompt: Write a function remove the parenthesis area in a string Assesments: assert remove_parenthesis([""python (chrome)""])==(""python remove_parenthesis([""string(.abc)""])==(""string",0.0,0.02961105284756737
"Prompt: Write a function to find the nth nonagonal number. Assesments: assert is_nonagonal(10) == 325, assert is_nonagonal(15) == 750, assert is_nonagonal(18) == 1089",50,0.029,30,1.6666666666666667,"Prompt: Write a function find the nth nonagonal number. Assesments: assert is_nonagonal(10 325, 750 1089",0.0,0.05389935099478668
"Prompt: Write a function to remove similar rows from the given tuple matrix. Assesments: assert remove_similar_row([[(4, 5), (3, 2)], [(2, 2), (4, 6)], [(3, 2), (4, 5)]] ) == {((2, 2), (4, 6)), ((3, 2), (4, 5))}, assert remove_similar_row([[(5, 6), (4, 3)], [(3, 3), (5, 7)], [(4, 3), (5, 6)]] ) == {((4, 3), (5, 6)), ((3, 3), (5, 7))}, assert remove_similar_row([[(6, 7), (5, 4)], [(4, 4), (6, 8)], [(5, 4), (6, 7)]] ) =={((4, 4), (6, 8)), ((5, 4), (6, 7))}",232,0.055,131,1.7709923664122138,"Prompt: Write a function to remove similar rows from the given tuple matrix. Assesments: assert remove_similar_row([[(4, 5), (3 2)], [(2 2), (4 6) [(3 24 5)]] ) == {((2 2 (4 6)), ((3 5))}, assert remove_similar_row([[(5 64 3)3 35 7)4 35 6]] )4 3 6)),35)) 75 44 46 8)5 46 7]]{46 8)),5 7))}",0.0,0.06454170453410263
"Prompt: Write a function that matches a word containing 'z', not at the start or end of the word. Assesments: assert text_match_wordz_middle(""pythonzabc."")==('Found a match!'), assert text_match_wordz_middle(""xyzabc."")==('Found a match!'), assert text_match_wordz_middle(""  lang  ."")==('Not matched!')",79,0.035,37,2.135135135135135,"Prompt: Write a function matches a word containing 'z not at or Assesments: assert text_match_wordz_middle(""pythonzabc."")==('Found a match lang matched!",0.0,0.10168821870066683
"Prompt: Write a python function to reverse an array upto a given position. Assesments: assert reverse_Array_Upto_K([1, 2, 3, 4, 5, 6],4) == [4, 3, 2, 1, 5, 6], assert reverse_Array_Upto_K([4, 5, 6, 7], 2) == [5, 4, 6, 7], assert reverse_Array_Upto_K([9, 8, 7, 6, 5],3) == [7, 8, 9, 6, 5]",137,0.038,76,1.8026315789473684,"Prompt: Write a python function to reverse an array upto a given position. Assesments: assert reverse_Array_Upto_K([1, 6],4) == [4 3 2 1 5 6], assert 5 25 4 6 8 7 6, 5],37 8 9 6 5]",0.0,0.06776924756833033
"Prompt: Write a function to find the product of it’s kth index in the given tuples. Assesments: assert find_k_product([(5, 6, 7), (1, 3, 5), (8, 9, 19)], 2) == 665, assert find_k_product([(6, 7, 8), (2, 4, 6), (9, 10, 20)], 1) == 280, assert find_k_product([(7, 8, 9), (3, 5, 7), (10, 11, 21)], 0) == 210",136,0.04,81,1.6790123456790123,"Prompt: Write a function to find the product of it��s kth index in the given tuples. Assesments: assert find_k_product([(5 6,), (1 3 5),8 9 19) 2) == 665, assert 72 4 69 10 20 1 280, 83 5 7 21 0 210",0.0,0.05515874423204989
"Prompt: Write a python function to count number of cubes of size k in a cube of size n. Assesments: assert No_of_cubes(2,1) == 8, assert No_of_cubes(5,2) == 64, assert No_of_cubes(1,1) == 1",66,0.031,34,1.9411764705882353,"Prompt: Write a python function count number cubes of size k in a cube Assesments: assert No_of_cubes(2,1 8 64 1",0.0,0.08190233003511012
"Prompt: Write a function to split a string at uppercase letters. Assesments: assert split_upperstring(""PythonProgramLanguage"")==['Python','Program','Language'], assert split_upperstring(""PythonProgram"")==['Python','Program'], assert split_upperstring(""ProgrammingLanguage"")==['Programming','Language']",59,0.03,29,2.0344827586206895,"Prompt: Write a function split at uppercase letters Assesments: assert split_upperstring(""PythonProgramLanguage"")==['Python','Program','Language''",0.0,0.0914205839946289
"Prompt: Write a function to exchange the position of every n-th value with (n+1)th value and (n+1)th value with n-th value in a given list. Assesments: assert exchange_elements([0,1,2,3,4,5])==[1, 0, 3, 2, 5, 4] , assert exchange_elements([5,6,7,8,9,10])==[6,5,8,7,10,9] , assert exchange_elements([25,35,45,55,75,95])==[35,25,55,45,95,75]",140,0.034,50,2.8,"Prompt: Write a function exchange the position every n-th value with ( and with in a given list Assesments: assert exchange_elements([0,1,2,3,4,5])==[1 0 3 2 ,",0.0,0.16951165017555056
"Prompt: Write a python function to calculate the sum of the numbers in a list between the indices of a specified range. Assesments: assert sum_Range_list([2, 1, 5, 6, 8, 3, 4, 9, 10, 11, 8, 12],8,10) == 29, assert sum_Range_list([1,2,3,4,5],1,2) == 5, assert sum_Range_list([1,0,1,2,5,6],4,5) == 11",126,0.036,60,2.1,"Prompt: Write a python function calculate the sum the numbers a list between the indices a specified range Assesments: assert sum_Range_list([2 1 5 6 3 4 9 8 12],8,10) == 29, assert 5 11",0.0,0.09810405362272583
"Prompt: Write a python function to check whether the given two arrays are equal or not. Assesments: assert are_Equal([1,2,3],[3,2,1],3,3) == True, assert are_Equal([1,1,1],[2,2,2],3,3) == False, assert are_Equal([8,9],[4,5,6],2,3) == False",91,0.031,42,2.1666666666666665,"Prompt: Write a python function check whether the given two arrays equal or Assesments: assert are_Equal([1,2,3],[3,2,1],3,3) == True,",0.0,0.1049047771039472
"Prompt: Write a function to check if one tuple is a subset of another tuple. Assesments: assert check_subset((10, 4, 5, 6), (5, 10)) == True, assert check_subset((1, 2, 3, 4), (5, 6)) == False, assert check_subset((7, 8, 9, 10), (10, 8)) == True",92,0.034,50,1.84,"Prompt: Write a function to check one tuple a subset another tuple Assesments: assert check_subset((10 4, 5, 6), (5 10)) == True, assert 25 6, 810 8)",0.0,0.07158123204596234
"Prompt: Write a function to flatten the given tuple matrix into the tuple list with each tuple representing each column. Assesments: assert matrix_to_list([[(4, 5), (7, 8)], [(10, 13), (18, 17)], [(0, 4), (10, 1)]]) == '[(4, 7, 10, 18, 0, 10), (5, 8, 13, 17, 4, 1)]', assert matrix_to_list([[(5, 6), (8, 9)], [(11, 14), (19, 18)], [(1, 5), (11, 2)]]) == '[(5, 8, 11, 19, 1, 11), (6, 9, 14, 18, 5, 2)]', assert matrix_to_list([[(6, 7), (9, 10)], [(12, 15), (20, 21)], [(23, 7), (15, 8)]]) == '[(6, 9, 12, 20, 23, 15), (7, 10, 15, 21, 7, 8)]'",269,0.06,172,1.563953488372093,"Prompt: Write a function to flatten the given tuple matrix into the tuple list with each tuple representing each column. Assesments: assert matrix_to_list([[(4, 5), (7 8) [(10 1318 17)0 410 1)]]) == '[(4 7, 10, 18 0 10),5 8 13, 17, 4 1)]', assert matrix_to_list([[(5 68 9)11 1419 181 511 2) 8 11 19 1 116 9 14 18 5 2 79 1012 1520 2123 715 8)]] 9 12 20 23 15),7 10 15 21 7 8)'",0.0,0.04342149214290485
"Prompt: Write a function to group a sequence of key-value pairs into a dictionary of lists using collections module. Assesments: assert grouping_dictionary([('yellow', 1), ('blue', 2), ('yellow', 3), ('blue', 4), ('red', 1)])== ({'yellow': [1, 3], 'blue': [2, 4], 'red': [1]}), assert grouping_dictionary([('yellow', 10), ('blue', 20), ('yellow', 30), ('blue', 40), ('red', 10)])== ({'yellow': [10, 30], 'blue': [20, 40], 'red': [10]}), assert grouping_dictionary([('yellow', 15), ('blue', 25), ('yellow', 35), ('blue', 45), ('red', 15)])== ({'yellow': [15, 35], 'blue': [25, 45], 'red': [15]})",209,0.056,137,1.5255474452554745,"Prompt: Write a function to group a sequence of key-value pairs into a dictionary of lists using collections module. Assesments: assert grouping_dictionary([('yellow', 1), ('blue 2),yellow 3),blue),red 1)])== ({'yellow': [1, 3], 'blue [2, 4], 'red1]}), assert grouping_dictionary([('yellow 10blue 20yellow 30),blue 40),red 10)])== ({yellow [10, 30],20, 4010]} assert 15blue 25yellow 35 45 15)])==15 3525 4515]})",0.0,0.03950365895424501
"Prompt: Write a function to find the perimeter of a rectangle. Assesments: assert rectangle_perimeter(10,20)==60, assert rectangle_perimeter(10,5)==30, assert rectangle_perimeter(4,2)==12",49,0.029,23,2.130434782608696,"Prompt: Write a function find the perimeter a rectangle Assesments assert rectangle_perimeter(10,20)==60",0.0,0.10120873173371821
"Prompt: Write a python function to find the sum of fifth power of n natural numbers. Assesments: assert fifth_Power_Sum(2) == 33, assert fifth_Power_Sum(4) == 1300, assert fifth_Power_Sum(3) == 276",61,0.03,35,1.7428571428571429,"Prompt: Write a python function find the sum fifth power of n natural numbers Assesments: assert fifth_Power_Sum(2 33, 1300 276",0.0,0.06167160640189686
"Prompt: Write a python function to find the minimum sum of absolute differences of two arrays. Assesments: assert find_Min_Sum([3,2,1],[2,1,3],3) == 0, assert find_Min_Sum([1,2,3],[4,5,6],3) == 9, assert find_Min_Sum([4,1,8,7],[2,3,6,5],4) == 6",97,0.032,44,2.2045454545454546,"Prompt: Write a python function find the minimum sum absolute differences of two arrays Assesments: assert find_Min_Sum([3,2,1],[2,1,3],3, assert 9 6",0.0,0.10876882453645939
"Prompt: Write a python function to find the first digit in factorial of a given number. Assesments: assert first_Digit(5) == 1, assert first_Digit(10) == 3, assert first_Digit(7) == 5",54,0.03,32,1.6875,"Prompt: Write a python function find the first digit factorial of a given number Assesments: assert first_Digit(5 1, 3 5",0.0,0.056024577082668364
"Prompt: Write a function to find the item with maximum occurrences in a given list. Assesments: assert max_occurrences([2,3,8,4,7,9,8,2,6,5,1,6,1,2,3,4,6,9,1,2])==2, assert max_occurrences([1, 3,5, 7,1, 3,13, 15, 17,5, 7,9,1, 11])==1, assert max_occurrences([1, 2, 3,2, 4, 5,1, 1, 1])==1",143,0.034,100,1.43,"Prompt: Write a function find the item with maximum occurrences in a given list Assesments: assert max_occurrences([2,3,8,4,7,9,8,2,6,5,1,6,1,2,3,4,6,9,1,2])==2, 3,5 7,1 3,13 15 17,5 11])==1 3,2 5,1 1",0.0,0.029756782636450676
"Prompt: Write a python function to print duplicants from a list of integers. Assesments: assert Repeat([10, 20, 30, 20, 20, 30, 40, 50, -20, 60, 60, -20, -20]) == [20, 30, -20, 60], assert Repeat([-1, 1, -1, 8]) == [-1], assert Repeat([1, 2, 3, 1, 2,]) == [1, 2]",117,0.039,66,1.7727272727272727,"Prompt: Write a python function print duplicants from a list integers Assesments: assert Repeat([10 20 20 20 40 50 -20 60 60 -20 -20]) == [20 30 60], assert Repeat([-1 1 8 [], 2 3 1])]",0.0,0.06471868380582073
"Prompt: Write a python function to choose points from two ranges such that no point lies in both the ranges. Assesments: assert find_Points(5,10,1,5) == (1,10), assert find_Points(3,5,7,9) == (3,9), assert find_Points(1,5,2,8) == (1,8)",83,0.033,37,2.2432432432432434,"Prompt: Write a python function choose points two ranges such no point lies in both the ranges Assesments: assert find_Points(5,10,1,5 == (),)",0.0,0.11271641894048534
"Prompt: Write a function to find the maximum sum that can be formed which has no three consecutive elements present. Assesments: assert max_sum_of_three_consecutive([100, 1000, 100, 1000, 1], 5) == 2101, assert max_sum_of_three_consecutive([3000, 2000, 1000, 3, 10], 5) == 5013, assert max_sum_of_three_consecutive([1, 2, 3, 4, 5, 6, 7, 8], 8) == 27",128,0.036,70,1.8285714285714285,"Prompt: Write a function to find the maximum sum that can formed which has no three consecutive elements present Assesments: assert max_sum_of_three_consecutive([100 1000 100, 1 5) == 2101, 2000 1000 3, 10 5013, 8) = 27",0.0,0.0704153937348958
"Prompt: Write a function to sort a list in a dictionary. Assesments: assert sorted_dict({'n1': [2, 3, 1], 'n2': [5, 1, 2], 'n3': [3, 2, 4]})=={'n1': [1, 2, 3], 'n2': [1, 2, 5], 'n3': [2, 3, 4]}, assert sorted_dict({'n1': [25,37,41], 'n2': [41,54,63], 'n3': [29,38,93]})=={'n1': [25, 37, 41], 'n2': [41, 54, 63], 'n3': [29, 38, 93]}, assert sorted_dict({'n1': [58,44,56], 'n2': [91,34,58], 'n3': [100,200,300]})=={'n1': [44, 56, 58], 'n2': [34, 58, 91], 'n3': [100, 200, 300]}",254,0.054,163,1.5582822085889572,"Prompt: Write a function to sort a list in a dictionary. Assesments: assert sorted_dict({'n1': [2, 3, 1], 'n2 [5, 1, 2],n33 2, 4]})=={'n1 [1, 2, 3],1 2, 5],2 3, 4]}, assert sorted_dict({'n125,37,41],41,54,63], [29,38,93]})=={'n125 37 4141 54 6329 38 93]}, assert58,44,56 [91,34,58100,200,300]})=={'n144 56 5834 58 91100 200 300]}",0.0,0.04284296005905863
"Prompt: Write a function to find the largest possible value of k such that k modulo x is y. Assesments: assert find_max_val(15, 10, 5) == 15, assert find_max_val(187, 10, 5) == 185, assert find_max_val(16, 11, 1) == 12",75,0.033,44,1.7045454545454546,"Prompt: Write a function find the largest possible value k such k modulo x y. Assesments: assert find_max_val(15 10 5 15, 10 185 11 1 12",0.0,0.05776339842729884
"Prompt: Write a python function to find the average of even numbers till a given even number. Assesments: assert average_Even(2) == 2, assert average_Even(4) == 3, assert average_Even(100) == 51",55,0.03,32,1.71875,"Prompt: Write a python function find the average of even numbers till a given even number Assesments: assert average_Even(2 2, 51",0.0,0.0592124162144909
"Prompt: Write a python function to shift first element to the end of given list. Assesments: assert move_last([1,2,3,4]) == [2,3,4,1], assert move_last([2,3,4,1,5,0]) == [3,4,1,5,0,2], assert move_last([5,4,3,2,1]) == [4,3,2,1,5]",99,0.032,48,2.0625,"Prompt: Write a python function to shift first element to the end given list Assesments: assert move_last([1,2,3,4 == [], assert move_last([2,3,4,1,5,0]",0.0,0.09427864666453878
"Prompt: Write a function to count occurrence of a character in a string. Assesments: assert count_char(""Python"",'o')==1, assert count_char(""little"",'t')==2, assert count_char(""assert"",'s')==2",51,0.028,23,2.217391304347826,"Prompt: Write a function count occurrence a character Assesments: assert count_char(""Python"",'o')==1",0.0,0.11007924062226787
"Prompt: Write a python function to count number of vowels in the string. Assesments: assert Check_Vow('corner','AaEeIiOoUu') == 2, assert Check_Vow('valid','AaEeIiOoUu') == 2, assert Check_Vow('true','AaEeIiOoUu') ==2",71,0.033,35,2.0285714285714285,"Prompt: Write a python function count number vowels the string Assesments: assert Check_Vow('corner','AaEeIiOoUu') == 2, 22",0.0,0.09081756417856002
"Prompt: Write a python function to replace multiple occurence of character by single. Assesments: assert replace('peep','e') == 'pep', assert replace('Greek','e') == 'Grek', assert replace('Moon','o') == 'Mon'",55,0.032,42,1.3095238095238095,"Prompt: Write a python function replace multiple occurence of character by single. Assesments: assert replace('peep','e ==pep replace('Greek','eGrek replace('Moon','oMon'",0.0,0.017466903773957713
"Prompt: Write a function to check whether the given ip address is valid or not using regex. Assesments: assert check_IP(""192.168.0.1"") == 'Valid IP address', assert check_IP(""110.234.52.124"") == 'Valid IP address', assert check_IP(""366.1.2.2"") == 'Invalid IP address'",77,0.034,57,1.3508771929824561,"Prompt: Write a function check whether the given ip address valid or using regex. Assesments: assert check_IP(""192.168.0.1 == 'Valid IP address assert check_IP(""110.234.52.124 check_IP(""366.1.2.2",0.0,0.021685397662685273
"Prompt: Write a python function to check whether a sequence of numbers has a decreasing trend or not. Assesments: assert decreasing_trend([-4,-3,-2,-1]) == True, assert decreasing_trend([1,2,3]) == True, assert decreasing_trend([3,2,1]) == False",67,0.031,36,1.8611111111111112,"Prompt: Write a python function check whether a sequence numbers has a decreasing trend or not Assesments: assert decreasing_trend([-4,-3,-2,-1 == True,",0.0,0.07373479448168245
"Prompt: Write a python function to set the right most unset bit. Assesments: assert set_Right_most_Unset_Bit(21) == 23, assert set_Right_most_Unset_Bit(11) == 15, assert set_Right_most_Unset_Bit(15) == 15",65,0.03,35,1.8571428571428572,"Prompt: Write a python function set the right most unset bit Assesments: assert set_Right_most_Unset_Bit(21 == 23, 15 15",0.0,0.07332998951256213
"Prompt: Write a function to find maximum of three numbers. Assesments: assert max_of_three(10,20,30)==30, assert max_of_three(55,47,39)==55, assert max_of_three(10,49,30)==49",54,0.032,25,2.16,"Prompt: Write a function find maximum of three numbers Assesments assert max_of_three(10,20,30)==30",0.0,0.1042247047558251
"Prompt: Write a python function to convert a list of multiple integers into a single integer. Assesments: assert convert([1,2,3]) == 123, assert convert([4,5,6]) == 456, assert convert([7,8,9]) == 789",60,0.031,35,1.7142857142857142,"Prompt: Write a python function to convert a list multiple integers a single integer Assesments: assert convert([1,2,3 == 123, 456 789",0.0,0.05875701062423053
"Prompt: Write a function to remove duplicate words from a given string using collections module. Assesments: assert remove_duplicate(""Python Exercises Practice Solution Exercises"")==(""Python Exercises Practice Solution""), assert remove_duplicate(""Python Exercises Practice Solution Python"")==(""Python Exercises Practice Solution""), assert remove_duplicate(""Python Exercises Practice Solution Practice"")==(""Python Exercises Practice Solution"")",69,0.037,32,2.15625,"Prompt: Write a function remove duplicate words a given string using collections module Assesments: assert remove_duplicate(""Python Exercises Practice Solution Exercises"")==(""Python""), assert",0.0,0.10384216406000638
"Prompt: Write a function to add two integers. however, if the sum is between the given range it will return 20. Assesments: assert sum_nums(2,10,11,20)==20, assert sum_nums(15,17,1,10)==32, assert sum_nums(10,15,5,30)==20",71,0.043,33,2.1515151515151514,"Prompt: Write add two integers however the sum between the given range it return 20 Assesments assert sum_nums(2,10,11,20)==20",0.0,0.10335915813094235
"Prompt: Write a function to remove everything except alphanumeric characters from the given string by using regex. Assesments: assert remove_extra_char('**//Google Android// - 12. ') == 'GoogleAndroid12', assert remove_extra_char('****//Google Flutter//*** - 36. ') == 'GoogleFlutter36', assert remove_extra_char('**//Google Firebase// - 478. ') == 'GoogleFirebase478'",88,0.079,61,1.4426229508196722,Prompt: Write remove everything by regex Assesments assert remove_extra_char('**//Google Android// - 12 ')GoogleAndroid12 assert remove_extra_char('****//Google Flutter// - 36 ')GoogleFlutter36 assert remove_extra_char('**//Google Firebase// - 478 ')GoogleFirebase478,0.0,0.031044460607075396
"Prompt: Write a function to check if the triangle is valid or not. Assesments: assert validity_triangle(60,50,90)==False, assert validity_triangle(45,75,60)==True, assert validity_triangle(30,50,100)==True",54,0.03,25,2.16,"Prompt: Write a function check the triangle valid or Assesments: assert validity_triangle(60,50,90)==False",0.0,0.1042247047558251
"Prompt: Write a python function to remove spaces from a given string. Assesments: assert remove_spaces(""a b c"") == ""abc"", assert remove_spaces(""1 2 3"") == ""123"", assert remove_spaces("" b c"") == ""bc""",55,0.033,33,1.6666666666666667,"Prompt: Write a python function remove spaces from a given string Assesments: assert remove_spaces(""a b == ""abc assert 2123"", b ""bc",0.0,0.05389935099478668
"Prompt: Write a function to access dictionary key’s element by index. Assesments: assert access_key({'physics': 80, 'math': 90, 'chemistry': 86},0)== 'physics', assert access_key({'python':10, 'java': 20, 'C++':30},2)== 'C++', assert access_key({'program':15,'computer':45},1)== 'computer'",88,0.036,70,1.2571428571428571,"Prompt: Write a function access dictionary key��s element by index. Assesments: assert access_key({'physics 80math 90chemistry 86},0)== 'physics assert access_key({'python':10java 20C++':30},2)== 'C++ access_key({'program':15,'computer':45},1)==",0.0,0.012123478181569461
"Prompt: Write a python function to check whether a sequence of numbers has an increasing trend or not. Assesments: assert increasing_trend([1,2,3,4]) == True, assert increasing_trend([4,3,2,1]) == False, assert increasing_trend([0,1,4,9]) == True",71,0.032,36,1.9722222222222223,"Prompt: Write a python function check whether a sequence numbers has an increasing trend or not Assesments: assert increasing_trend([1,2,3,4 == True,",0.0,0.08506933361705146
"Prompt: Write a python function to find the smallest prime divisor of a number. Assesments: assert smallest_Divisor(10) == 2, assert smallest_Divisor(25) == 5, assert smallest_Divisor(31) == 31",55,0.03,33,1.6666666666666667,"Prompt: Write a python function find the smallest prime divisor of a number Assesments: assert smallest_Divisor(10) 2, 5 31",0.0,0.05389935099478668
"Prompt: Write a function to multiply two lists using map and lambda function. Assesments: assert mul_list([1, 2, 3],[4,5,6])==[4,10,18], assert mul_list([1,2],[3,4])==[3,8], assert mul_list([90,120],[50,70])==[4500,8400]",83,0.03,23,3.608695652173913,Prompt: Write a function multiply two lists using map and lambda function Assesments: assert mul_list([1],0.0,0.25200738283906243
"Prompt: Write a python function to check whether the given number can be represented by sum of two squares or not. Assesments: assert sum_Square(25) == True, assert sum_Square(24) == False, assert sum_Square(17) == True",56,0.032,29,1.9310344827586208,"Prompt: Write a python function check the given number can sum of two squares or not Assesments: assert sum_Square(25 True,",0.0,0.0808677372134233
"Prompt: Write a python function to count occurences of a character in a repeated string. Assesments: assert count_Char(""abcac"",'a') == 4, assert count_Char(""abca"",'c') == 2, assert count_Char(""aba"",'a') == 7",62,0.033,44,1.4090909090909092,"Prompt: Write a python function to count occurences a character in a repeated string Assesments: assert count_Char(""abcac"",'a 4, count_Char(""abca"",'c 2 7",0.0,0.027623828453703977
"Prompt: Write a python function to find sum of prime numbers between 1 to n. Assesments: assert sum_Of_Primes(10) == 17, assert sum_Of_Primes(20) == 77, assert sum_Of_Primes(5) == 10",60,0.03,31,1.935483870967742,"Prompt: Write a python function find sum prime numbers between to Assesments: assert sum_Of_Primes(10 17, 77 10",0.0,0.0813216230964859
"Prompt: Write a function to find the frequency of each element in the given list. Assesments: assert freq_element((4, 5, 4, 5, 6, 6, 5, 5, 4) ) == '{4: 3, 5: 4, 6: 2}', assert freq_element((7, 8, 8, 9, 4, 7, 6, 5, 4) ) == '{7: 2, 8: 2, 9: 1, 4: 2, 6: 1, 5: 1}', assert freq_element((1, 4, 3, 1, 4, 5, 2, 6, 2, 7) ) == '{1: 2, 4: 2, 3: 1, 5: 1, 2: 2, 6: 1, 7: 1}'",216,0.046,134,1.6119402985074627,"Prompt: Write a function to find the frequency each element in the given list Assesments: assert freq_element((4 5, 4, 5, 6, 6 5 5 4) ) '{4: 3, 4, 2', assert freq_element((7 8 8 9 4 7 6 5 4 2 8 2, 4 2, 6 5 4 3 1 4 5 2 6 2 7)1 2 4 2 3 5 2 2 6 7'",0.0,0.048316667540052684
"Prompt: Write a function to find the greatest common divisor (gcd) of two integers by using recursion. Assesments: assert recur_gcd(12,14) == 2, assert recur_gcd(13,17) == 1, assert recur_gcd(9, 3) == 3",65,0.031,37,1.7567567567567568,"Prompt: Write a function find the greatest common divisor (gcd two integers by using recursion Assesments: assert recur_gcd(12,14 2, 3 3",0.0,0.0630895178613021
"Prompt: Write a function to get the length of a complex number. Assesments: assert len_complex(3,4)==5.0, assert len_complex(9,10)==13.45362404707371, assert len_complex(7,9)==11.40175425099138",61,0.028,25,2.44,"Prompt: Write a function get the length a complex number Assesments assert len_complex(3,4)==5.0",0.0,0.13278774337695498
"Prompt: ## write a function to find the minimum number of jumps to reach the end of the array for the given array of integers where each element represents the max number of steps that can be made forward from that element. > indented block > indented block Assesments: assert min_jumps([1, 3, 6, 1, 0, 9], 6) == 3, assert min_jumps([1, 3, 5, 8, 9, 2, 6, 7, 6, 8, 9], 11) == 3, assert min_jumps([1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], 11) == 10",172,0.042,101,1.702970297029703,"Prompt: ## write a function find the minimum number jumps to reach the array for the given array of integers where each element represents the max number steps that can made forward from that element > indented block > indented block Assesments: assert min_jumps([1 3 6 1 0 9 6) == 3, 5 8 9, 2 6, 7 6 8 11 3 1 1 11 10",0.0,0.05760271526673892
"Prompt: Write a function to multiply consecutive numbers of a given list. Assesments: assert mul_consecutive_nums([1, 1, 3, 4, 4, 5, 6, 7])==[1, 3, 12, 16, 20, 30, 42], assert mul_consecutive_nums([4, 5, 8, 9, 6, 10])==[20, 40, 72, 54, 60], assert mul_consecutive_nums([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[2, 6, 12, 20, 30, 42, 56, 72, 90]",171,0.043,94,1.8191489361702127,"Prompt: Write a function to multiply consecutive numbers of a given list. Assesments: assert mul_consecutive_nums([1 1 3, 4 4 7])==[1 3 12 16 20 30 42], assert 5 8 9 6 10])==[20 40 72 54 60],, 6 12 20, 56, 72, 90]",0.0,0.06945419725502712
"Prompt: Write a function to group the 1st elements on the basis of 2nd elements in the given tuple list. Assesments: assert group_element([(6, 5), (2, 7), (2, 5), (8, 7), (9, 8), (3, 7)]) == {5: [6, 2], 7: [2, 8, 3], 8: [9]}, assert group_element([(7, 6), (3, 8), (3, 6), (9, 8), (10, 9), (4, 8)]) == {6: [7, 3], 8: [3, 9, 4], 9: [10]}, assert group_element([(8, 7), (4, 9), (4, 7), (10, 9), (11, 10), (5, 9)]) == {7: [8, 4], 9: [4, 10, 5], 10: [11]}",231,0.053,138,1.673913043478261,"Prompt: Write a function to group the 1st elements on the basis 2nd elements in the given tuple list. Assesments: assert group_element([(6, 5), (2 72 58 79 8)3 7)]) == {5: [6 2], 7 [2, 8, 3 89]}, assert group_element([(7 63 8)3 69 8)10 94 8)67 3 83 9, 410] assert group_element([(8 74 94 710 911 105 978 4 94 10, 5 1011]}",0.0,0.05463856006883249
"Prompt: Write a python function to find the last two digits in factorial of a given number. Assesments: assert last_Two_Digits(7) == 40, assert last_Two_Digits(5) == 20, assert last_Two_Digits(2) == 2",61,0.032,33,1.8484848484848484,"Prompt: Write a python function find the last two digits in factorial of Assesments: assert last_Two_Digits(7 40, 20 2",0.0,0.07244677867084505
"Prompt: Write a function to remove multiple spaces in a string by using regex. Assesments: assert remove_multiple_spaces('Google      Assistant') == 'Google Assistant', assert remove_multiple_spaces('Quad      Core') == 'Quad Core', assert remove_multiple_spaces('ChromeCast      Built-in') == 'ChromeCast Built-in'",66,0.033,43,1.5348837209302326,Prompt: Write a function to remove multiple spaces in by using regex. Assesments: assert remove_multiple_spaces('Google Assistant == 'Google assert remove_multiple_spaces('Quad Core remove_multiple_spaces('ChromeCast Built',0.0,0.040456060392372276
"Prompt: Write a function to extract unique values from the given dictionary values. Assesments: assert extract_unique({'msm' : [5, 6, 7, 8],'is' : [10, 11, 7, 5],'best' : [6, 12, 10, 8],'for' : [1, 2, 5]} ) == [1, 2, 5, 6, 7, 8, 10, 11, 12], assert extract_unique({'Built' : [7, 1, 9, 4],'for' : [11, 21, 36, 14, 9],'ISP' : [4, 1, 21, 39, 47],'TV' : [1, 32, 38]} ) == [1, 4, 7, 9, 11, 14, 21, 32, 36, 38, 39, 47], assert extract_unique({'F' : [11, 13, 14, 17],'A' : [12, 11, 15, 18],'N' : [19, 21, 15, 36],'G' : [37, 36, 35]}) == [11, 12, 13, 14, 15, 17, 18, 19, 21, 35, 36, 37]",314,0.059,206,1.5242718446601942,"Prompt: Write a function to extract unique values the given dictionary values. Assesments: assert extract_unique({'msm' : [5, 6, 7, 8],'is' [10 7 5],'best [6, 12, 10, 8],'for1 5]} ) == [1 6, 10 12], assert extract_unique({'Built'7 1 9 4],'for11 21 36 14 9],'ISP4 1 21 39 47],'TV1 32 38]} 4 7 9 11 14 21 32 36 38 39 47], extract_unique({'F'11 13 14 17],'A'12 11 15 18],'N19 21 15 36],'G37 36 35]11 12 13 14 15 17 18 19 21 35 36 37]",0.0,0.03937353385043027
"Prompt: Write a function to check if each element of the second tuple is greater than its corresponding index in the first tuple. Assesments: assert check_greater((10, 4, 5), (13, 5, 18)) == True, assert check_greater((1, 2, 3), (2, 1, 4)) == False, assert check_greater((4, 5, 6), (5, 6, 7)) == True",103,0.037,57,1.8070175438596492,"Prompt: Write a function to check each element of the second tuple greater its corresponding index in Assesments: assert check_greater((10 4, 5), (13 5 18 == True, assert 22 1 4 False 55 6 7",0.0,0.06821666358683175
"Prompt: Write a function to zip two given lists of lists. Assesments: assert zip_list([[1, 3], [5, 7], [9, 11]] ,[[2, 4], [6, 8], [10, 12, 14]] )==[[1, 3, 2, 4], [5, 7, 6, 8], [9, 11, 10, 12, 14]], assert zip_list([[1, 2], [3, 4], [5, 6]] ,[[7, 8], [9, 10], [11, 12]] )==[[1, 2, 7, 8], [3, 4, 9, 10], [5, 6, 11, 12]], assert zip_list([['a','b'],['c','d']] , [['e','f'],['g','h']] )==[['a','b','e','f'],['c','d','g','h']]",224,0.051,131,1.7099236641221374,"Prompt: Write a function to zip two given lists of lists. Assesments: assert zip_list([[1 35 79 11]] ,[[2 46 810 12, 14 )==[[1 3, 2, 4], [5, 6, 89, 10 12, 14]], assert 23 4 6]]7 89 1011 2 7 83 9,5 11] zip_list([['a','b'],['c','d]] [[' )=[['a','b','e','f'],['c','d','g','h",0.0,0.058312034169624986
"Prompt: Write a function to find number of even elements in the given list using lambda function. Assesments: assert count_even([1, 2, 3, 5, 7, 8, 9, 10])==3, assert count_even([10,15,14,13,-18,12,-20])==5, assert count_even([1, 2, 4, 8, 9])==3",94,0.032,63,1.492063492063492,"Prompt: Write a function to find number even elements the given list using lambda function Assesments: assert count_even([1 5 10])==3, count_even([10,15,14,13,-18,12,-20])==5 2 4 8 9])==3",0.0,0.036087932353492516
"Prompt: Write a function to sort dictionary items by tuple product of keys for the given dictionary with tuple keys. Assesments: assert sort_dict_item({(5, 6) : 3, (2, 3) : 9, (8, 4): 10, (6, 4): 12} ) == {(2, 3): 9, (6, 4): 12, (5, 6): 3, (8, 4): 10}, assert sort_dict_item({(6, 7) : 4, (3, 4) : 10, (9, 5): 11, (7, 5): 13} ) == {(3, 4): 10, (7, 5): 13, (6, 7): 4, (9, 5): 11}, assert sort_dict_item({(7, 8) : 5, (4, 5) : 11, (10, 6): 12, (8, 6): 14} ) == {(4, 5): 11, (8, 6): 14, (7, 8): 5, (10, 6): 12}",269,0.053,137,1.9635036496350364,"Prompt: Write a function to sort dictionary items by tuple product of keys for the given dictionary with tuple keys. Assesments: assert sort_dict_item({(5 6) : 3, (2 9,8 4): 10,6 4): 12} ) == {(2): 96,5 6 3,8 10}, assert 7 43 4 109 5 117 5 13}3 4 107 136 7 49 5 11}, 54 5 1110 128 6 14}4 58 147 510 6 12}",0.0,0.08417994459730534
"Prompt: Write a python function to find the minimum number of swaps required to convert one binary string to another. Assesments: assert min_Swaps(""1101"",""1110"") == 1, assert min_Swaps(""1111"",""0100"") == ""Not Possible"", assert min_Swaps(""1110000"",""0001101"") == 3",76,0.032,62,1.2258064516129032,"Prompt: Write a python function find the minimum number swaps required convert one binary string Assesments: assert min_Swaps(""1101"",""1110 1, assert min_Swaps(""1111"",""0100 ""Not Possible min_Swaps(""1110000"",""0001101 3",0.0,0.008926824747999957
"Prompt: Write a function to count the number of elements in a list which are within a specific range. Assesments: assert count_range_in_list([10,20,30,40,40,40,70,80,99],40,100)==6, assert count_range_in_list(['a','b','c','d','e','f'],'a','e')==5, assert count_range_in_list([7,8,9,15,17,19,45],15,20)==3",105,0.031,43,2.441860465116279,"Prompt: Write a function count elements which within Assesments assert count_range_in_list([10,20,30,40,40,40,70,80,99],40,100)==6, assert",0.0,0.13297753100898907
"Prompt: Write a function to find the equilibrium index of the given array. Assesments: assert equilibrium_index([1, 2, 3, 4, 1, 2, 3]) == 3, assert equilibrium_index([-7, 1, 5, 2, -4, 3, 0]) == 3, assert equilibrium_index([1, 2, 3]) == -1",90,0.033,53,1.6981132075471699,"Prompt: Write a function to find the equilibrium index the given array. Assesments: assert equilibrium_index([1, 1 == 3, assert equilibrium_index([-7 1 5 2 -4 3, 0 3]) -1",0.0,0.05710723942932508
"Prompt: Write a function to find the minimum number of elements that should be removed such that amax-amin<=k. Assesments: assert removals([1, 3, 4, 9, 10,11, 12, 17, 20], 9, 4) == 5, assert removals([1, 5, 6, 2, 8], 5, 2) == 3, assert removals([1, 2, 3 ,4, 5, 6], 6, 3) == 2",125,0.036,76,1.644736842105263,"Prompt: Write a function find the minimum number elements that should removed such that amax-amin<=k. Assesments: assert removals([1 3 9 10,11 17 20], 9 4) == 5, assert 5 6 2 8 5 2 3 2 ,4 6 2",0.0,0.05166227090227962
"Prompt: Write a function to check whether the given key is present in the dictionary or not. Assesments: assert is_key_present({1: 10, 2: 20, 3: 30, 4: 40, 5: 50, 6: 60},5)==True, assert is_key_present({1: 10, 2: 20, 3: 30, 4: 40, 5: 50, 6: 60},6)==True, assert is_key_present({1: 10, 2: 20, 3: 30, 4: 40, 5: 50, 6: 60},10)==False",154,0.038,91,1.6923076923076923,"Prompt: Write a function to check whether the given key is present in the dictionary or not. Assesments: assert is_key_present({1: 10, 2 20, 3 30, 4 40, 5 50, 6 60},5)==True, assert is_key_present({1 10 60},6)==True, assert is_key_present({1 10 60},10)==False",0.0,0.05651501387217952
"Prompt: Write a function to calculate the harmonic sum of n-1. Assesments: assert harmonic_sum(10)==2.9289682539682538, assert harmonic_sum(4)==2.083333333333333, assert harmonic_sum(7)==2.5928571428571425",62,0.031,29,2.1379310344827585,Prompt: Write a function calculate the harmonic sum n-1 Assesments assert harmonic_sum(10)==2.9289682539682538,0.0,0.10197343077583453
"Prompt: Write a function to sort a list of lists by length and value. Assesments: assert sort_sublists([[2], [0], [1, 3], [0, 7], [9, 11], [13, 15, 17]])==[[0], [2], [0, 7], [1, 3], [9, 11], [13, 15, 17]], assert sort_sublists([[1], [2, 3], [4, 5, 6], [7], [10, 11]])==[[1], [7], [2, 3], [10, 11], [4, 5, 6]], assert sort_sublists([[""python""],[""java"",""C"",""C++""],[""DBMS""],[""SQL"",""HTML""]])==[['DBMS'], ['python'], ['SQL', 'HTML'], ['java', 'C', 'C++']]",203,0.048,126,1.6111111111111112,"Prompt: Write a function to sort a list of lists by length and value. Assesments: assert sort_sublists([[2], [0, 30 79 1113 15, 17]])==[[0], [20, 71 39]], assert sort_sublists([[12, 34 5,7],10 11]])==[[172, 3104] sort_sublists([[""python""],[""java"",""C"",""C++""],[""DBMS""],[""SQL"",""HTML""]])==[['DBMS' ['python'SQL', 'HTML'java',',']]",0.0,0.048232081427102176
"Prompt: Write a function to find whether an array is subset of another array. Assesments: assert is_subset([11, 1, 13, 21, 3, 7], 6, [11, 3, 7, 1], 4) == True, assert is_subset([1, 2, 3, 4, 5, 6], 6, [1, 2, 4], 3) == True, assert is_subset([10, 5, 2, 23, 19], 5, [19, 5, 3], 3) == False",136,0.038,79,1.7215189873417722,"Prompt: Write a function to find whether an array subset another array Assesments: assert is_subset([11 1, 13 21 3 7], 6 [11 3 7 1 4) == True, assert 2 61 4], 3 5 2 23 19 5,19 5 3 3 False",0.0,0.05949488297300683
"Prompt: Write a python function to count the total set bits from 1 to n. Assesments: assert count_Set_Bits(16) == 33, assert count_Set_Bits(2) == 2, assert count_Set_Bits(14) == 28",57,0.03,34,1.6764705882352942,"Prompt: Write a python function count the total set bits from 1 n. Assesments: assert count_Set_Bits(16 33, 2 28",0.0,0.054899457389083944
"Prompt: Write a python function to convert a string to a list. Assesments: assert Convert('python program') == ['python','program'], assert Convert('Data Analysis') ==['Data','Analysis'], assert Convert('Hadoop Training') == ['Hadoop','Training']",56,0.032,41,1.3658536585365855,"Prompt: Write a python function convert a string a list. Assesments: assert Convert('python program == ['python','program' assert Convert('Data Analysis=['Data','Analysis Convert('Hadoop Training",0.0,0.02321315967708034
"Prompt: Write a function to count unique keys for each value present in the tuple. Assesments: assert get_unique([(3, 4), (1, 2), (2, 4), (8, 2), (7, 2), (8, 1), (9, 1), (8, 4), (10, 4)] ) == '{4: 4, 2: 3, 1: 2}', assert get_unique([(4, 5), (2, 3), (3, 5), (9, 3), (8, 3), (9, 2), (10, 2), (9, 5), (11, 5)] ) == '{5: 4, 3: 3, 2: 2}', assert get_unique([(6, 5), (3, 4), (2, 6), (11, 1), (8, 22), (8, 11), (4, 3), (14, 3), (11, 6)] ) == '{5: 1, 4: 1, 6: 2, 1: 1, 22: 1, 11: 1, 3: 2}'",276,0.06,155,1.7806451612903227,"Prompt: Write a function to count unique keys for each value present in the tuple. Assesments: assert get_unique([(3, 4), (1),2 48 27 28 19 18 410 4)] ) == '{4: 4, 2: 3, 1 2}', assert get_unique([(4 52 33 59 38 39 210 29 511 55 4 3 3 2 2 53 42 611 18 228 114 314 311 6)]5 1, 4 1 6 2, 1: 1, 22: 1, 11 1, 3 2}'",0.0,0.06552639436590715
"Prompt: Write a function to access the initial and last data of the given tuple record. Assesments: assert front_and_rear((10, 4, 5, 6, 7)) == (10, 7), assert front_and_rear((1, 2, 3, 4, 5)) == (1, 5), assert front_and_rear((6, 7, 8, 9, 10)) == (6, 10)",103,0.036,54,1.9074074074074074,"Prompt: Write a function to access the initial and last data of the given tuple record. Assesments: assert front_and_rear((10, 4, 5, 6,)) == (10 7), assert 21 5 10)",0.0,0.07845751912141953
"Prompt: Write a python function to check whether the product of digits of a number at even and odd places is equal or not. Assesments: assert product_Equal(2841) == True, assert product_Equal(1234) == False, assert product_Equal(1212) == False",62,0.033,34,1.8235294117647058,"Prompt: Write a python function check whether the product of digits of at even and odd places equal or not Assesments: assert product_Equal(2841 True,",0.0,0.06990105330354292
"Prompt: Write a function to remove duplicates from a list of lists. Assesments: assert remove_duplicate([[10, 20], [40], [30, 56, 25], [10, 20], [33], [40]])==[[10, 20], [30, 56, 25], [33], [40]] , assert remove_duplicate([""a"", ""b"", ""a"", ""c"", ""c""] )==[""a"", ""b"", ""c""], assert remove_duplicate([1, 3, 5, 6, 3, 5, 6, 1] )==[1, 3, 5, 6]",144,0.043,85,1.6941176470588235,"Prompt: Write a function to remove duplicates from a list of lists. Assesments: assert remove_duplicate([[10 20], [40],30, 56, 2510 2033],40]])==[[103033 , assert remove_duplicate([""aacc""] )==[""c remove_duplicate([1 3, 5, 6, 3 5 6 1] )=[1]",0.0,0.05669964889881902
"Prompt: Write a function to check if the given tuple contains all valid values or not. Assesments: assert check_valid((True, True, True, True) ) == True, assert check_valid((True, False, True, True) ) == False, assert check_valid((True, True, True, True) ) == True",69,0.032,36,1.9166666666666667,"Prompt: Write a function to check the given tuple contains all valid values or not Assesments: assert check_valid((True True, True,) ) == True, assert True True",0.0,0.07940206404936696
"Prompt: Write a python function to count the number of distinct power of prime factor of given number. Assesments: assert count_Fac(24) == 3, assert count_Fac(12) == 2, assert count_Fac(4) == 1",56,0.03,32,1.75,"Prompt: Write a python function count distinct power of prime factor of given number. Assesments: assert count_Fac(24) 3, 2",0.0,0.06240025534631343
"Prompt: Write a function to convert the given string of integers into a tuple. Assesments: assert str_to_tuple(""1, -5, 4, 6, 7"") == (1, -5, 4, 6, 7), assert str_to_tuple(""1, 2, 3, 4, 5"") == (1, 2, 3, 4, 5), assert str_to_tuple(""4, 6, 9, 11, 13, 14"") == (4, 6, 9, 11, 13, 14)",131,0.037,64,2.046875,"Prompt: Write a function to convert the given string of integers into a tuple. Assesments: assert str_to_tuple(""1, -5, 4, 6, 7"") == (1 -5), assert 2 3"") 2 6 9 11 13"")4)",0.0,0.0926847270986275
"Prompt: Write a function to find the perimeter of a rombus. Assesments: assert rombus_perimeter(10)==40, assert rombus_perimeter(5)==20, assert rombus_perimeter(4)==16",47,0.029,23,2.0434782608695654,Prompt: Write a function find the perimeter a rombus Assesments assert rombus_perimeter(10)==40,0.0,0.09233822284516856
"Prompt: Write a function to calculate the standard deviation. Assesments: assert sd_calc([4, 2, 5, 8, 6])== 2.23606797749979, assert sd_calc([1,2,3,4,5,6,7])==2.160246899469287, assert sd_calc([5,9,10,15,6,4])==4.070217029430577",94,0.032,32,2.9375,"Prompt: Write a function calculate Assesments: assert sd_calc([4 2 5 6])== 2.23606797749979,",0.0,0.18353814235556973
"Prompt: Write a function to create a list taking alternate elements from another given list. Assesments: assert alternate_elements([""red"", ""black"", ""white"", ""green"", ""orange""])==['red', 'white', 'orange'], assert alternate_elements([2, 0, 3, 4, 0, 2, 8, 3, 4, 2])==[2, 3, 0, 8, 4], assert alternate_elements([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[1,3,5,7,9]",143,0.039,100,1.43,"Prompt: Write a function to create a list taking alternate elements from another given list Assesments: assert alternate_elements([""redblackwhitegreenorange""])==['redwhite' assert alternate_elements([2 0 3 4 0 2 8 3 4 2])==[2 3 0 8 4], 2 3 5 6 7 8 9 10])==[1,3,5,7,9]",0.0,0.029756782636450676
"Prompt: Write a function that matches a string that has an a followed by zero or more b's. Assesments: assert text_match(""ac"")==('Found a match!'), assert text_match(""dc"")==('Not matched!'), assert text_match(""abba"")==('Found a match!')",60,0.031,34,1.7647058823529411,"Prompt: Write a function matches a string that has an a followed zero or more b's Assesments: assert text_match(""ac"")==('Found a match matched!",0.0,0.06390041493775933
"Prompt: Write a function to add a dictionary to the tuple. Assesments: assert add_dict_to_tuple((4, 5, 6), {""MSAM"" : 1, ""is"" : 2, ""best"" : 3} ) == (4, 5, 6, {'MSAM': 1, 'is': 2, 'best': 3}), assert add_dict_to_tuple((1, 2, 3), {""UTS"" : 2, ""is"" : 3, ""Worst"" : 4} ) == (1, 2, 3, {'UTS': 2, 'is': 3, 'Worst': 4}), assert add_dict_to_tuple((8, 9, 10), {""POS"" : 3, ""is"" : 4, ""Okay"" : 5} ) == (8, 9, 10, {'POS': 3, 'is': 4, 'Okay': 5})",213,0.052,121,1.7603305785123966,"Prompt: Write a function to add a dictionary to the tuple. Assesments: assert add_dict_to_tuple((4, 5, 6), {""MSAM"" : 1,is"" 2,best"" 3} ) == (4 5, {'MSAM': 1':,':}), assert add_dict_to_tuple((1 2""UTS"" 2is 3,Worst 4 ) (1 2,UTS 2,Worst add_dict_to_tuple((8 9 10 {""POS"" 3isOkay 58Okay':})",0.0,0.06345408646427128
"Prompt: Write a function to find a path with the maximum average over all existing paths for the given square matrix of size n*n. Assesments: assert maxAverageOfPath([[1, 2, 3], [6, 5, 4], [7, 3, 9]], 3) == 5.2, assert maxAverageOfPath([[2, 3, 4], [7, 6, 5], [8, 4, 10]], 3) == 6.2, assert maxAverageOfPath([[3, 4, 5], [8, 7, 6], [9, 5, 11]], 3) == 7.2",153,0.047,92,1.6630434782608696,"Prompt: Write a function to find a path with the maximum average over all existing paths for the given square matrix of size n*n. Assesments: assert maxAverageOfPath([[1 2], [6 5 47 3 9]], 3) == 5.2, assert7 6 5 4 10 3 6.2, 48 7 6 5 11 7.2",0.0,0.05352974645776378
"Prompt: Write a function to filter the height and width of students which are stored in a dictionary. Assesments: assert filter_data({'Cierra Vega': (6.2, 70), 'Alden Cantrell': (5.9, 65), 'Kierra Gentry': (6.0, 68), 'Pierre Cox': (5.8, 66)},6.0,70)=={'Cierra Vega': (6.2, 70)}, assert filter_data({'Cierra Vega': (6.2, 70), 'Alden Cantrell': (5.9, 65), 'Kierra Gentry': (6.0, 68), 'Pierre Cox': (5.8, 66)},5.9,67)=={'Cierra Vega': (6.2, 70),'Kierra Gentry': (6.0, 68)}, assert filter_data({'Cierra Vega': (6.2, 70), 'Alden Cantrell': (5.9, 65), 'Kierra Gentry': (6.0, 68), 'Pierre Cox': (5.8, 66)},5.7,64)=={'Cierra Vega': (6.2, 70),'Alden Cantrell': (5.9, 65),'Kierra Gentry': (6.0, 68),'Pierre Cox': (5.8, 66)}",299,0.058,185,1.6162162162162161,"Prompt: Write a function to filter the height and width of students which are stored in a dictionary. Assesments: assert filter_data({'Cierra Vega': (6.2, 70), 'Alden Cantrell': (5.9, 65), 'Kierra Gentry': (6.0 68), 'Pierre Cox':5.8 66)},6.0,70)=={'Cierra Vega': (6.2 70)}, assert filter_data({'Cierra (6.2 70),Alden CantrellKierra),5.8, 66)},5.9,67)=={'Cierra Vega (6.2 70),'Kierra Gentry 68)}, assert '), 66)},5.7,64)=={'Cierra Vega6.2 70),'Alden Cantrell 65),'Kierra Gentry 68),'Pierre Cox)}",0.0,0.04875285754953804
"Prompt: Write a function to count the same pair in two given lists using map function. Assesments: assert count_same_pair([1, 2, 3, 4, 5, 6, 7, 8],[2, 2, 3, 1, 2, 6, 7, 9])==4, assert count_same_pair([0, 1, 2, -1, -5, 6, 0, -3, -2, 3, 4, 6, 8],[2, 1, 2, -1, -5, 6, 4, -3, -2, 3, 4, 6, 8])==11, assert count_same_pair([2, 4, -6, -9, 11, -12, 14, -5, 17],[2, 1, 2, -1, -5, 6, 4, -3, -2, 3, 4, 6, 8])==1",231,0.045,135,1.711111111111111,"Prompt: Write a function to count the same pair in two given lists using map function. Assesments: assert count_same_pair([1,,,,,, 8],[2 2 3 1 2 6 7 9])==4, assert count_same_pair([0 1 -1 -5 6 0, -3 -2 3, 4, 6, 8],[2 1 2 -1 6 4 -3 4 6 8])==11, 4 -6 -9 11 -12 14 -5 17],[2 1 4 8])==1",0.0,0.05843316664893427
"Prompt: Write a function to calculate the sum of all digits of the base to the specified power. Assesments: assert power_base_sum(2,100)==115, assert power_base_sum(8,10)==37, assert power_base_sum(8,15)==62",56,0.03,27,2.074074074074074,"Prompt: Write a function calculate all digits the base to the specified power Assesments assert power_base_sum(2,100)==115",0.0,0.09545932782447304
"Prompt: Write a function to extract values between quotation marks of the given string by using regex. Assesments: assert extract_quotation('Cortex ""A53"" Based ""multi"" tasking ""Processor""') == ['A53', 'multi', 'Processor'], assert extract_quotation('Cast your ""favorite"" entertainment ""apps""') == ['favorite', 'apps'], assert extract_quotation('Watch content ""4k Ultra HD"" resolution with ""HDR 10"" Support') == ['4k Ultra HD', 'HDR 10']",111,0.042,73,1.5205479452054795,"Prompt: Write a function extract values between quotation marks of the given string by regex Assesments: assert extract_quotation('Cortex ""A53 Based ""multi"" tasking ""Processor') ['multi extract_quotation('Cast your ""favorite"" entertainment ""apps')favorite', 'apps ""4k Ultra HD"" resolution with ""HDR 10"" Support')",0.0,0.03899365569347949
"Prompt: Write a function to multiply the adjacent elements of the given tuple. Assesments: assert multiply_elements((1, 5, 7, 8, 10)) == (5, 35, 56, 80), assert multiply_elements((2, 4, 5, 6, 7)) == (8, 20, 30, 42), assert multiply_elements((12, 13, 14, 9, 15)) == (156, 182, 126, 135)",112,0.037,67,1.671641791044776,"Prompt: Write a function to multiply the adjacent elements the given tuple. Assesments: assert multiply_elements((1 5, 7, 8 10 == (5 35 56 80), 4 58 20 30 42 13 9 15156 182 126 135)",0.0,0.054406867672489756
"Prompt: Write a function to remove all characters except letters and numbers using regex Assesments: assert remove_char(""123abcjw:, .@! eiw"") == '123abcjweiw', assert remove_char(""Hello1234:, ! Howare33u"") == 'Hello1234Howare33u', assert remove_char(""Cool543Triks@:, Make@987Trips"") == 'Cool543TriksMake987Trips'",90,0.025,59,1.5254237288135593,"Prompt: Write a function remove all characters except letters using regex Assesments assert remove_char(""123abcjw:, .@! eiw123abcjweiw assert remove_char(""Hello1234:, ! Howare33u remove_char(""Cool543Triks@:, Make@987Trips",0.0,0.03949103853457182
"Prompt: Write a function to sum elements in two lists. Assesments: assert sum_list([10,20,30],[15,25,35])==[25,45,65], assert sum_list([1,2,3],[5,6,7])==[6,8,10], assert sum_list([15,20,30],[15,45,75])==[30,65,105]",88,0.03,37,2.3783783783783785,"Prompt: Write a function sum elements two lists Assesments: assert sum_list([10,20,30],[15,25,35])==[25,45,65]",0.0,0.12650166924025846
"Prompt: Write a function to add two lists using map and lambda function. Assesments: assert add_list([1, 2, 3],[4,5,6])==[5, 7, 9], assert add_list([1,2],[3,4])==[4,6], assert add_list([10,20],[50,70])==[60,90]",83,0.03,37,2.2432432432432434,"Prompt: Write a function add two lists using map and lambda function Assesments: assert add_list([1 3],[4,5,6])==[5 7]",0.0,0.11271641894048534
"Prompt: Write a function to remove consecutive duplicates of a given list. Assesments: assert consecutive_duplicates([0, 0, 1, 2, 3, 4, 4, 5, 6, 6, 6, 7, 8, 9, 4, 4 ])==[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 4], assert consecutive_duplicates([10, 10, 15, 19, 18, 18, 17, 26, 26, 17, 18, 10])==[10, 15, 19, 18, 17, 26, 17, 18, 10], assert consecutive_duplicates(['a', 'a', 'b', 'c', 'd', 'd'])==['a', 'b', 'c', 'd']",204,0.045,117,1.7435897435897436,"Prompt: Write a function to remove consecutive duplicates of a given list. Assesments: assert consecutive_duplicates([0, 0, 1, 2,,, 4,, 6, 6 6 7 8 9, 4, 4 ])==[0, 1 4], assert consecutive_duplicates([10 10 15 19 18 18 17 26 26 17 18 10])==[10 15 17 17 18], assert consecutive_duplicates(['aac 'dd'])==['a']",0.0,0.06174633962696522
"Prompt: Write a function to find the lateral surface area of a cone. Assesments: assert lateralsurface_cone(5,12)==204.20352248333654, assert lateralsurface_cone(10,15)==566.3586699569488, assert lateralsurface_cone(19,17)==1521.8090132193388",76,0.03,33,2.303030303030303,"Prompt: Write a function find the lateral surface area a cone Assesments assert lateralsurface_cone(5,12)==204.20352248333654",0.0,0.11881534786099103
"Prompt: Write a function to replace all occurrences of spaces, commas, or dots with a colon. Assesments: assert replace_specialchar('Python language, Programming language.')==('Python:language::Programming:language:'), assert replace_specialchar('a b c,d e f')==('a:b:c:d:e:f'), assert replace_specialchar('ram reshma,ram rahim')==('ram:reshma:ram:rahim')",92,0.038,60,1.5333333333333334,"Prompt: Write a function replace all occurrences spaces, or dots a colon Assesments: assert replace_specialchar('Python language, Programming language.')==('Python:language::Programming:language:') b,d:b replace_specialchar('ram reshma rahim')==('ramreshmarahim",0.0,0.04029790403234387
"Prompt: Write a function to find the index of the first occurrence of a given number in a sorted array. Assesments: assert find_first_occurrence([2, 5, 5, 5, 6, 6, 8, 9, 9, 9], 5) == 1, assert find_first_occurrence([2, 3, 5, 5, 6, 6, 8, 9, 9, 9], 5) == 2, assert find_first_occurrence([2, 4, 1, 5, 6, 6, 8, 9, 9, 9], 6) == 4",151,0.039,84,1.7976190476190477,"Prompt: Write a function to find the index the first occurrence a given number in a sorted array Assesments: assert find_first_occurrence([2 5, 5,, 6, 6 8 9 9 9], 5) == 1, assert 3 5 6 8, 2 4 1 5 6 6, 6 4",0.0,0.0672579149757573
"Prompt: Write a python function to find sum of products of all possible subarrays. Assesments: assert sum_Of_Subarray_Prod([1,2,3],3) == 20, assert sum_Of_Subarray_Prod([1,2],2) == 5, assert sum_Of_Subarray_Prod([1,2,3,4],4) == 84",83,0.033,41,2.024390243902439,"Prompt: Write a python function find sum products of all possible subarrays Assesments: assert sum_Of_Subarray_Prod([1,2,3],3 20, 5 84",0.0,0.09039103796719422
"Prompt: Write a python function to toggle bits of the number except the first and the last bit. Assesments: assert toggle_middle_bits(9) == 15, assert toggle_middle_bits(10) == 12, assert toggle_middle_bits(11) == 13",56,0.03,30,1.8666666666666667,"Prompt: Write a python function toggle bits the number except the and Assesments: assert toggle_middle_bits(9 15, 12 13",0.0,0.0743015214384509
"Prompt: Write a function to locate the left insertion point for a specified value in sorted order. Assesments: assert left_insertion([1,2,4,5],6)==4, assert left_insertion([1,2,4,5],3)==2, assert left_insertion([1,2,4,5],7)==4",73,0.03,34,2.1470588235294117,"Prompt: Write a function locate the left insertion point a specified value sorted order Assesments assert left_insertion([1,2,4,5],6)==4",0.0,0.10290456431535268
"Prompt: Write a function to check whether the given string is starting with a vowel or not using regex. Assesments: assert check_str(""annie"") == 'Valid', assert check_str(""dawood"") == 'Invalid', assert check_str(""Else"") == 'Valid'",57,0.032,41,1.3902439024390243,"Prompt: Write a function check whether the given string starting a vowel or not using regex. Assesments: assert check_str(""annie 'Valid check_str(""dawoodInvalid check_str(""ElseValid",0.0,0.025701229243380835
"Prompt: Write a function to calculate the geometric sum of n-1. Assesments: assert geometric_sum(7) == 1.9921875, assert geometric_sum(4) == 1.9375, assert geometric_sum(8) == 1.99609375",59,0.03,40,1.475,"Prompt: Write a function calculate the geometric sum n-1. Assesments: assert geometric_sum(7 1.9921875, 1.9375 1.99609375",0.0,0.034347270986275144
"Prompt: Write a python function to find the index of smallest triangular number with n digits. Assesments: assert find_Index(2) == 4, assert find_Index(3) == 14, assert find_Index(4) == 45",51,0.033,31,1.6451612903225807,"Prompt: Write a python function find the index smallest triangular number with n digits Assesments: assert find_Index(2 4, 14 45",0.0,0.05170556922665075
"Prompt: Write a function to convert the given tuple to a key-value dictionary using adjacent elements. Assesments: assert tuple_to_dict((1, 5, 7, 10, 13, 5)) == {1: 5, 7: 10, 13: 5}, assert tuple_to_dict((1, 2, 3, 4, 5, 6)) == {1: 2, 3: 4, 5: 6}, assert tuple_to_dict((7, 8, 9, 10, 11, 12)) == {7: 8, 9: 10, 11: 12}",146,0.039,79,1.8481012658227849,"Prompt: Write a function to convert the given tuple to a key-value dictionary using adjacent elements. Assesments: assert tuple_to_dict((1 5, 7, 10, 13 5)) == {1: 5, 7:}, assert 2, 61 2 4 tuple_to_dict((7 8)) 8 10 12}",0.0,0.07240764907659178
"Prompt: Write a python function to check whether all the characters are same or not. Assesments: assert all_Characters_Same(""python"") == False, assert all_Characters_Same(""aaa"") == True, assert all_Characters_Same(""data"") == False",56,0.031,36,1.5555555555555556,"Prompt: Write a python function check whether all the characters same or not Assesments: assert all_Characters_Same(""python == False, all_Characters_Same(""aaa",0.0,0.04256481185941767
"Prompt: Write a function to caluclate the area of a tetrahedron. Assesments: assert area_tetrahedron(3)==15.588457268119894, assert area_tetrahedron(20)==692.8203230275509, assert area_tetrahedron(10)==173.20508075688772",67,0.029,29,2.310344827586207,Prompt: Write a function caluclate the area Assesments: assert area_tetrahedron(3)==15.588457268119894,0.0,0.11956150874451059
"Prompt: Write a function to rotate a given list by specified number of items to the right direction. Assesments: assert rotate_right([1, 2, 3, 4, 5, 6, 7, 8, 9, 10],3,4)==[8, 9, 10, 1, 2, 3, 4, 5, 6], assert rotate_right([1, 2, 3, 4, 5, 6, 7, 8, 9, 10],2,2)==[9, 10, 1, 2, 3, 4, 5, 6, 7, 8], assert rotate_right([1, 2, 3, 4, 5, 6, 7, 8, 9, 10],5,2)==[6, 7, 8, 9, 10, 1, 2, 3, 4, 5, 6, 7, 8]",231,0.044,107,2.1588785046728973,"Prompt: Write a function to rotate a given list by specified number of items to the right direction. Assesments: assert rotate_right([1, 2,,,,,,,, 10],3,4)==[8, 9, 10, 1, 2, 3,,,], assert rotate_right([1,,, 10],2,2)==[9 10 1,,], assert 10],5,2)==[6 7 8 9 10, 1,,, 7,]",0.0,0.10411030006174847
"Prompt: Write a function to check if the given tuple has any none value or not. Assesments: assert check_none((10, 4, 5, 6, None)) == True, assert check_none((7, 8, 9, 11, 14)) == False, assert check_none((1, 2, 3, 4, None)) == True",82,0.035,44,1.8636363636363635,"Prompt: Write a function to check the given tuple has any none value or not Assesments: assert check_none((10 4, 5,, None == True, 8 11 14)) False None",0.0,0.0739923976438499
"Prompt: Write a function to find numbers within a given range where every number is divisible by every digit it contains. Assesments: assert divisible_by_digits(1,22)==[1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22], assert divisible_by_digits(1,15)==[1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15], assert divisible_by_digits(20,25)==[22, 24]",135,0.036,78,1.7307692307692308,"Prompt: Write a function to find numbers within a given range where every number is divisible every digit it contains. Assesments: assert divisible_by_digits(1,22)==[1, 2 3,, 11, 15 22], assert divisible_by_digits(1,15)==[1 2], divisible_by_digits(20,25)==[22 24]",0.0,0.060438508188268805
"Prompt: Write a function to find area of a sector. Assesments: assert sector_area(4,45)==6.285714285714286, assert sector_area(9,45)==31.82142857142857, assert sector_area(9,360)==None",57,0.028,26,2.1923076923076925,"Prompt: Write find area a sector Assesments assert sector_area(4,45)==6.285714285714286,",0.0,0.10752043998134009
"Prompt: Write a function to find the longest common subsequence for the given three string sequence. Assesments: assert lcs_of_three('AGGT12', '12TXAYB', '12XBA', 6, 7, 5) == 2, assert lcs_of_three('Reels', 'Reelsfor', 'ReelsforReels', 5, 8, 13) == 5 , assert lcs_of_three('abcd1e2', 'bc12ea', 'bd1ea', 7, 6, 5) == 3",124,0.038,96,1.2916666666666667,"Prompt: Write a function find the longest common subsequence for the given three string sequence Assesments: assert lcs_of_three('AGGT1212TXAYB12XBA', 6, 7 5) == 2, lcs_of_three('ReelsReelsforReelsforReels 5 8 13 5 , lcs_of_three('abcd1e2 'bc12eabd1ea 7 6 3",0.0,0.01564528141291627
"Prompt: Write a function to put spaces between words starting with capital letters in a given string by using regex. Assesments: assert capital_words_spaces(""Python"") == 'Python', assert capital_words_spaces(""PythonProgrammingExamples"") == 'Python Programming Examples', assert capital_words_spaces(""GetReadyToBeCodingFreak"") == 'Get Ready To Be Coding Freak'",74,0.035,54,1.3703703703703705,"Prompt: Write a function put spaces words starting capital letters in a given string by regex. Assesments: assert capital_words_spaces(""Python 'Python assert capital_words_spaces(""PythonProgrammingExamples Programming Examples capital_words_spaces(""GetReadyToBeCodingFreakGet Ready To",0.0,0.02367391330046932
"Prompt: Write a function to sort a given list of strings of numbers numerically. Assesments: assert sort_numeric_strings( ['4','12','45','7','0','100','200','-12','-500'])==[-500, -12, 0, 4, 7, 12, 45, 100, 200], assert sort_numeric_strings(['2','3','8','4','7','9','8','2','6','5','1','6','1','2','3','4','6','9','1','2'])==[1, 1, 1, 2, 2, 2, 2, 3, 3, 4, 4, 5, 6, 6, 6, 7, 8, 8, 9, 9], assert sort_numeric_strings(['1','3','5','7','1', '3','13', '15', '17','5', '7 ','9','1', '11'])==[1, 1, 1, 3, 3, 5, 5, 7, 7, 9, 11, 13, 15, 17]",262,0.047,169,1.5502958579881656,"Prompt: Write a function to sort a given list of strings of numbers numerically. Assesments: assert sort_numeric_strings( ['4','12','45','7','0','100','200','-12','-500'])==[-500, -12 0 4 7 12 45 100], assert sort_numeric_strings(['2','3','8','4','7','9','8','2','6','5','1','6','1','2','3','4','6','9','1','2'])==[1 1 1 2 2 3 4 5 6 7 8 9], assert', '3','131517','57 ','9','1 3 5 7 7 9 11 13 15 17]",0.0,0.042028265628157584
"Prompt: Write a function to add the given tuple to the given list. Assesments: assert add_tuple([5, 6, 7], (9, 10)) == [5, 6, 7, 9, 10], assert add_tuple([6, 7, 8], (10, 11)) == [6, 7, 8, 10, 11], assert add_tuple([7, 8, 9], (11, 12)) == [7, 8, 9, 11, 12]",121,0.038,64,1.890625,"Prompt: Write a function to add the given tuple to the given list. Assesments: assert add_tuple([5, 6,], (9, 10)) == [5 6, 9, 10], assert add_tuple([6 8],106 10, 811 11]",0.0,0.07674553143951483
"Prompt: Write a function to check if the given array represents min heap or not. Assesments: assert check_min_heap([1, 2, 3, 4, 5, 6], 0) == True, assert check_min_heap([2, 3, 4, 5, 10, 15], 0) == True, assert check_min_heap([2, 10, 4, 5, 3, 15], 0) == False",104,0.035,49,2.122448979591837,"Prompt: Write a function to check the given array represents min heap or not. Assesments: assert check_min_heap([1,,,,], 0) == True, assert 10 15], 10 4 3 15 False",0.0,0.1003940931623208
"Prompt: Write a function to find the nth jacobsthal number. Assesments: assert jacobsthal_num(5) == 11, assert jacobsthal_num(2) == 1, assert jacobsthal_num(4) == 5",57,0.031,33,1.7272727272727273,"Prompt: Write a function find the nth jacobsthal number. Assesments: assert jacobsthal_num(5 11, 1 5",0.0,0.06008182688680614
"Prompt: Write a function to find minimum k records from tuple list. Assesments: assert min_k([('Manjeet', 10), ('Akshat', 4), ('Akash', 2), ('Nikhil', 8)], 2) == [('Akash', 2), ('Akshat', 4)], assert min_k([('Sanjeev', 11), ('Angat', 5), ('Akash', 3), ('Nepin', 9)], 3) == [('Akash', 3), ('Angat', 5), ('Nepin', 9)], assert min_k([('tanmay', 14), ('Amer', 11), ('Ayesha', 9), ('SKD', 16)], 1) == [('Ayesha', 9)]",172,0.051,130,1.323076923076923,"Prompt: Write a function to find minimum k records from tuple list. Assesments: assert min_k([('Manjeet', 10), ('Akshat', 4Akash', 2Nikhil', 8)], 2) == [('Akash 2Akshat 4) assert min_k([('Sanjeev 11Angat', 5Akash 3Nepin 9) 3Akash 3Angat),Nepin assert min_k([('tanmay', 14Amer', 11Ayesha 9),SKD 16) 1Ayesha 9)]",0.0,0.0188494684377225
"Prompt: Write a function to find common index elements from three lists. Assesments: assert extract_index_list([1, 1, 3, 4, 5, 6, 7],[0, 1, 2, 3, 4, 5, 7],[0, 1, 2, 3, 4, 5, 7])==[1, 7], assert extract_index_list([1, 1, 3, 4, 5, 6, 7],[0, 1, 2, 3, 4, 6, 5],[0, 1, 2, 3, 4, 6, 7])==[1, 6], assert extract_index_list([1, 1, 3, 4, 6, 5, 6],[0, 1, 2, 3, 4, 5, 7],[0, 1, 2, 3, 4, 5, 7])==[1, 5]",234,0.044,134,1.7462686567164178,"Prompt: Write a function to find common index elements from three lists. Assesments: assert extract_index_list([1, 1, 3, 4, 5, 6, 7],[0, 1, 2, 3, 4, 5, 7],[0 1, 7])==[1, 7], assert extract_index_list([1 1 3, 6 5],[0 6 7])==[1 6], assert 1 6 5, 6],[0 5 7],[0 5 7])==[1 5]",0.0,0.06201961783803611
"Prompt: Write a function to find the second smallest number in a list. Assesments: assert second_smallest([1, 2, -8, -2, 0, -2])==-2, assert second_smallest([1, 1, -0.5, 0, 2, -2, -2])==-0.5, assert second_smallest([2,2])==None",87,0.032,53,1.6415094339622642,"Prompt: Write a function find the second smallest number a list Assesments: assert second_smallest([1 -8 -2 0 -2])==-2, 1 -0.5 2, second_smallest([2,2])==None",0.0,0.051333040247155966
"Prompt: Write a function that matches a string that has an a followed by zero or one 'b'. Assesments: assert text_match_zero_one(""ac"")==('Found a match!'), assert text_match_zero_one(""dc"")==('Not matched!'), assert text_match_zero_one(""abbbba"")==('Found a match!')",68,0.031,34,2.0,"Prompt: Write a function matches a string that has an a followed zero one 'b Assesments: assert text_match_zero_one(""ac"")==('Found!' matched!",0.0,0.0879029684008937
"Prompt: Write a function to count the pairs of reverse strings in the given string list. Assesments: assert count_reverse_pairs([""julia"", ""best"", ""tseb"", ""for"", ""ailuj""])== '2', assert count_reverse_pairs([""geeks"", ""best"", ""for"", ""skeeg""]) == '1', assert count_reverse_pairs([""makes"", ""best"", ""sekam"", ""for"", ""rof""]) == '2'",94,0.038,71,1.323943661971831,"Prompt: Write a function to count the pairs reverse strings in the given string list. Assesments: assert count_reverse_pairs([""juliabest"",tsebforailuj""])== '2', assert count_reverse_pairs([""geeksbestforskeeg ==1 count_reverse_pairs([""makes"", ""best"", ""sekam, ""rof2'",0.0,0.018937885211042827
"Prompt: Write a function to count number of unique lists within a list. Assesments: assert unique_sublists([[1, 3], [5, 7], [1, 3], [13, 15, 17], [5, 7], [9, 11]] )=={(1, 3): 2, (5, 7): 2, (13, 15, 17): 1, (9, 11): 1}, assert unique_sublists([['green', 'orange'], ['black'], ['green', 'orange'], ['white']])=={('green', 'orange'): 2, ('black',): 1, ('white',): 1}, assert unique_sublists([[10, 20, 30, 40], [60, 70, 50, 50], [90, 100, 200]])=={(10, 20, 30, 40): 1, (60, 70, 50, 50): 1, (90, 100, 200): 1}",237,0.052,143,1.6573426573426573,"Prompt: Write a function to count number unique lists within a list. Assesments: assert unique_sublists([[1 3], [5 7],1 313 15, 175 79 11]] )=={(1 3): 2, (5 213 19 1}, assert unique_sublists([['green',orange' ['black'greenorangewhite']])=={('green '' 2): 1, 1}, assert unique_sublists([[10 20, 30, 40 [60 70, 50, 5090 100 200]])=={(10 1 (60,90}",0.0,0.052948200857552905
"Prompt: Write a function to check a decimal with a precision of 2. Assesments: assert is_decimal('123.11')==True, assert is_decimal('e666.86')==False, assert is_decimal('3.124587')==False",54,0.03,24,2.25,Prompt: Write a function check a decimal with a precision Assesments assert is_decimal('123.11')==True,0.0,0.11340568145547399
"Prompt: Write a python function to check whether an array contains only one distinct element or not. Assesments: assert unique_Element([1,1,1],3) == 'YES', assert unique_Element([1,2,1,2],4) == 'NO', assert unique_Element([1,2,3,4,5],5) == 'NO'",77,0.032,37,2.081081081081081,"Prompt: Write a python function check whether an array contains only one distinct element or not Assesments: assert unique_Element([1,1,1],3 == 'YES assert'",0.0,0.09617411858075758
"Prompt: Write a function to caluclate arc length of an angle. Assesments: assert arc_length(9,45)==3.5357142857142856, assert arc_length(9,480)==None, assert arc_length(5,270)==11.785714285714285",61,0.028,30,2.033333333333333,"Prompt: Write a function caluclate arc length of Assesments assert arc_length(9,45)==3.5357142857142856",0.0,0.0913033301415044
"Prompt: Write a function to check whether the given month number contains 30 days or not. Assesments: assert check_monthnumber_number(6)==True, assert check_monthnumber_number(2)==False, assert check_monthnumber_number(12)==False",52,0.028,26,2.0,Prompt: Write a function check the given month number contains 30 Assesments: assert check_monthnumber_number(6)==True,0.0,0.0879029684008937
"Prompt: Write a python function to find the minimum difference between any two elements in a given array. Assesments: assert find_Min_Diff((1,5,3,19,18,25),6) == 1, assert find_Min_Diff((4,3,2,6),4) == 1, assert find_Min_Diff((30,5,20,9),4) == 4",87,0.031,46,1.891304347826087,"Prompt: Write a python function find the minimum difference any two elements a given array Assesments: assert find_Min_Diff((1,5,3,19,18,25),6) 1, assert 4",0.0,0.07681483229020662
"Prompt: Write a python function to count numeric values in a given string. Assesments: assert number_ctr('program2bedone') == 1, assert number_ctr('3wonders') ==1, assert number_ctr('123') == 3",52,0.031,41,1.2682926829268293,"Prompt: Write a python function count numeric values in a given string Assesments: assert number_ctr('program2bedone 1, number_ctr('3wonders1 number_ctr('123 3",0.0,0.013260881411878273
"Prompt: Write a function to find nth polite number. Assesments: assert is_polite(7) == 11, assert is_polite(4) == 7, assert is_polite(9) == 13",47,0.029,27,1.7407407407407407,"Prompt: Write a function find nth polite number. Assesments: assert is_polite(7 11, 7 13",0.0,0.06145571041836601
"Prompt: Write a function to iterate over all pairs of consecutive items in a given list. Assesments: assert pair_wise([1,1,2,3,3,4,4,5])==[(1, 1), (1, 2), (2, 3), (3, 3), (3, 4), (4, 4), (4, 5)], assert pair_wise([1,5,7,9,10])==[(1, 5), (5, 7), (7, 9), (9, 10)], assert pair_wise([1,2,3,4,5,6,7,8,9,10])==[(1, 2), (2, 3), (3, 4), (4, 5), (5, 6), (6, 7), (7, 8), (8, 9), (9, 10)]",206,0.044,130,1.5846153846153845,"Prompt: Write a function to iterate over all pairs of consecutive items in a given list. Assesments: assert pair_wise([1,1,2,3,3,4,4,5])==[(1, 1), (1 22 33 3),3), 4),4)], assert pair_wise([1,5,7,9,10])==[(1 55 77 99) assert pair_wise([1,2,3,4,5,6,7,8,9,10])==[(1 22 334 55),6),789)]",0.0,0.04552922978712955
"Prompt: Write a python function to count the number of pairs whose sum is equal to ‘sum’. Assesments: assert get_Pairs_Count([1,1,1,1],4,2) == 6, assert get_Pairs_Count([1,5,7,-1,5],5,6) == 3, assert get_Pairs_Count([1,-2,3],3,1) == 1",89,0.032,41,2.1707317073170733,"Prompt: Write a python function count pairs whose sum ��sum�� Assesments: assert get_Pairs_Count([1,1,1,1],4,2) == 6, 3",0.0,0.10531945536499733
"Prompt: Write a python function to check for odd parity of a given number. Assesments: assert check_Odd_Parity(13) == True, assert check_Odd_Parity(21) == True, assert check_Odd_Parity(18) == False",55,0.031,30,1.8333333333333333,"Prompt: Write a python function check for odd parity of a given number Assesments: assert check_Odd_Parity(13 == True, False",0.0,0.07090115969784018
"Prompt: Write a python function to get the difference between two lists. Assesments: assert (Diff([10, 15, 20, 25, 30, 35, 40], [25, 40, 35])) == [10, 20, 30, 15], assert (Diff([1,2,3,4,5], [6,7,1])) == [2,3,4,5,6,7], assert (Diff([1,2,3], [6,7,1])) == [2,3,6,7]",126,0.037,55,2.290909090909091,"Prompt: Write a python function to get the difference two lists. Assesments: assert (Diff([10 15 20 25], [25 40 35] == [10 20 30 15], assert],6,7,1]],]",0.0,0.11757885268258712
"Prompt: Write a python function to find the sum of fourth power of first n odd natural numbers. Assesments: assert odd_Num_Sum(2) == 82, assert odd_Num_Sum(3) == 707, assert odd_Num_Sum(4) == 3108",60,0.03,36,1.6666666666666667,"Prompt: Write a python function find the sum fourth power of first n odd natural numbers Assesments: assert odd_Num_Sum(2 82, 707 3108",0.0,0.05389935099478668
"Prompt: Write a function to check if the given expression is balanced or not. Assesments: assert check_expression(""{()}[{}]"") == True, assert check_expression(""{()}[{]"") == False, assert check_expression(""{()}[{}][]({})"") == True",56,0.037,31,1.8064516129032258,"Prompt: Write a function to check the given expression balanced or Assesments: assert check_expression(""{()[{}"") == True,]""),][]({})",0.0,0.06815893248767027
"Prompt: Write a function to remove all the words with k length in the given string. Assesments: assert remove_length('The person is most value tet', 3) == 'person is most value', assert remove_length('If you told me about this ok', 4) == 'If you me about ok', assert remove_length('Forces of darkeness is come into the play', 4) == 'Forces of darkeness is the'",94,0.038,51,1.8431372549019607,"Prompt: Write a function remove all the words with k length in Assesments: assert remove_length('The person most value tet', 3 ==person is told about this ok me about ok of darkeness is come into the play 4 the'",0.0,0.07190126609213744
"Prompt: Write a function to find the occurrence and position of the substrings within a string. Assesments: assert occurance_substring('python programming, python language','python')==('python', 0, 6), assert occurance_substring('python programming,programming language','programming')==('programming', 7, 18), assert occurance_substring('python programming,programming language','language')==('language', 31, 39)",99,0.034,52,1.9038461538461537,"Prompt: Write a function find the occurrence and position the substrings within a string Assesments: assert occurance_substring('python programming, python language','python')==('python 0 6programming 7 18 31 39)",0.0,0.07809423261067051
"Prompt: Write a function to check if the string is a valid email address or not using regex. Assesments: assert check_email(""ankitrai326@gmail.com"") == 'Valid Email', assert check_email(""my.ownsite@ourearth.org"") == 'Valid Email', assert check_email(""ankitaoie326.com"") == 'Invalid Email'",73,0.033,56,1.3035714285714286,"Prompt: Write a function to check the string a valid email address or using regex. Assesments: assert check_email(""ankitrai326@gmail.com == 'Valid Email assert check_email(""my.ownsite@ourearth.org check_email(""ankitaoie326.comInvalid",0.0,0.016859696320277232
"Prompt: Write a python function to check whether every odd index contains odd numbers of a given list. Assesments: assert odd_position([2,1,4,3,6,7,6,3]) == True, assert odd_position([4,1,2]) == True, assert odd_position([1,2,3]) == False",72,0.031,44,1.6363636363636365,"Prompt: Write a python function check whether every odd index contains odd numbers of a given list Assesments: assert odd_position([2,1,4,3,6,7,6,3 True,])",0.0,0.05080811304877696
"Prompt: Write a function to count those characters which have vowels as their neighbors in the given string. Assesments: assert count_vowels('bestinstareels') == 7, assert count_vowels('partofthejourneyistheend') == 12, assert count_vowels('amazonprime') == 5",67,0.033,46,1.4565217391304348,"Prompt: Write a function count those characters which vowels as their neighbors in Assesments: assert count_vowels('bestinstareels 7, count_vowels('partofthejourneyistheend 12 5",0.0,0.03246228784745833
"Prompt: Write a python function to find the sum of non-repeated elements in a given array. Assesments: assert find_Sum([1,2,3,1,1,4,5,6],8) == 21, assert find_Sum([1,10,9,4,2,10,10,45,4],9) == 71, assert find_Sum([12,10,9,45,2,10,10,45,10],9) == 78",108,0.034,50,2.16,"Prompt: Write a python function find the sum non-repeated elements a given array Assesments: assert find_Sum([1,2,3,1,1,4,5,6],8 == 21, 71 78",0.0,0.1042247047558251
"Prompt: Write a function to pack consecutive duplicates of a given list elements into sublists. Assesments: assert pack_consecutive_duplicates([0, 0, 1, 2, 3, 4, 4, 5, 6, 6, 6, 7, 8, 9, 4, 4])==[[0, 0], [1], [2], [3], [4, 4], [5], [6, 6, 6], [7], [8], [9], [4, 4]], assert pack_consecutive_duplicates([10, 10, 15, 19, 18, 18, 17, 26, 26, 17, 18, 10])==[[10, 10], [15], [19], [18, 18], [17], [26, 26], [17], [18], [10]], assert pack_consecutive_duplicates(['a', 'a', 'b', 'c', 'd', 'd'])==[['a', 'a'], ['b'], ['c'], ['d', 'd']]",244,0.056,152,1.605263157894737,"Prompt: Write a function to pack consecutive duplicates of a given list elements into sublists. Assesments: assert pack_consecutive_duplicates([0 0, 1, 2,,, 4,, 6 6 6 7 8 9 4 4])==[[0 0], [1],, 4],],, 6, 6],],4, 4]], assert pack_consecutive_duplicates([10 10 15 19 18 18 17 26 26 17 18 10])==[[10 10],151918, 1817],26, 2617],1810] pack_consecutive_duplicates(['aabc 'dd'])==[['aa'b'',",0.0,0.04763552673576697
"Prompt: Write a function to count the number of unique lists within a list. Assesments: assert unique_sublists([[1, 3], [5, 7], [1, 3], [13, 15, 17], [5, 7], [9, 11]])=={(1, 3): 2, (5, 7): 2, (13, 15, 17): 1, (9, 11): 1}, assert unique_sublists([['green', 'orange'], ['black'], ['green', 'orange'], ['white']])=={('green', 'orange'): 2, ('black',): 1, ('white',): 1}, assert unique_sublists([[1, 2], [3, 4], [4, 5], [6, 7]])=={(1, 2): 1, (3, 4): 1, (4, 5): 1, (6, 7): 1}",222,0.05,137,1.6204379562043796,"Prompt: Write a function to count the number unique lists within a list. Assesments: assert unique_sublists([[1 3], [5 7],1 313 15, 175 79 11]])=={(1 3): 2, (5): 213 1,9 1}, assert unique_sublists([['green',orange' ['black'greenorangewhite']])=={('green '' 2): 1, 1}, assert unique_sublists([[1 23, 44 56 7]])=={(1 2 1 (3, (4,6}",0.0,0.04918352084357475
"Prompt: Write a function to find the combinations of sums with tuples in the given tuple list. Assesments: assert find_combinations([(2, 4), (6, 7), (5, 1), (6, 10)]) == [(8, 11), (7, 5), (8, 14), (11, 8), (12, 17), (11, 11)], assert find_combinations([(3, 5), (7, 8), (6, 2), (7, 11)]) == [(10, 13), (9, 7), (10, 16), (13, 10), (14, 19), (13, 13)], assert find_combinations([(4, 6), (8, 9), (7, 3), (8, 12)]) == [(12, 15), (11, 9), (12, 18), (15, 12), (16, 21), (15, 15)]",218,0.055,134,1.626865671641791,"Prompt: Write a function to find the combinations of sums with tuples in the given tuple list. Assesments: assert find_combinations([(2, 4), (6 7 (5 16 10) == [(8 11),7 58 14),11 8),12 17),11 11)], assert find_combinations([(3 57 8)6 27 11)])10 139 710 1613 1014 1913 13) find_combinations([(4 68 97 38 12)12 1511 912 1815 1216 2115 15)]",0.0,0.04983921757316196
"Prompt: Write a python function to check whether the count of divisors is even or odd. Assesments: assert count_Divisors(10) == ""Even"", assert count_Divisors(100) == ""Odd"", assert count_Divisors(125) == ""Even""",62,0.032,33,1.878787878787879,"Prompt: Write a python function check whether the count of divisors even or Assesments: assert count_Divisors(10 ""Even"",OddEven""",0.0,0.0755380166168548
"Prompt: Write a python function to find the sum of all odd length subarrays. Assesments: assert Odd_Length_Sum([1,2,4]) == 14, assert Odd_Length_Sum([1,2,1,2]) == 15, assert Odd_Length_Sum([1,7]) == 8",68,0.03,38,1.7894736842105263,"Prompt: Write a python function find the sum all odd length subarrays Assesments: assert Odd_Length_Sum([1,2,4 == 14, 15]) 8",0.0,0.06642699951282612
"Prompt: Write a function to convert rgb color to hsv color. Assesments: assert rgb_to_hsv(255, 255, 255)==(0, 0.0, 100.0), assert rgb_to_hsv(0, 215, 0)==(120.0, 100.0, 84.31372549019608), assert rgb_to_hsv(10, 215, 110)==(149.26829268292684, 95.34883720930233, 84.31372549019608)",118,0.034,68,1.7352941176470589,"Prompt: Write a function convert rgb color hsv color Assesments: assert rgb_to_hsv(255 255)==(0 0.0 100.0 215, 84.31372549019608 215 110)==(149.26829268292684, 95.34883720930233,)",0.0,0.06090009575486754
"Prompt: Write a function to find the product of first even and odd number of a given list. Assesments: assert mul_even_odd([1,3,5,7,4,1,6,8])==4, assert mul_even_odd([1,2,3,4,5,6,7,8,9,10])==2, assert mul_even_odd([1,5,7,9,10])==10",96,0.03,21,4.571428571428571,Prompt: Write a function find the product of first even and odd number a given list Assesments assert,0.0,0.3502165883908622
"Prompt: Write a function to convert tuple string to integer tuple. Assesments: assert tuple_str_int(""(7, 8, 9)"") == (7, 8, 9), assert tuple_str_int(""(1, 2, 3)"") == (1, 2, 3), assert tuple_str_int(""(4, 5, 6)"") == (4, 5, 6)",86,0.035,52,1.6538461538461537,"Prompt: Write a function to convert tuple string to integer tuple. Assesments: assert tuple_str_int(""(7, 8, 9)"") == (7 8), assert tuple_str_int(""(1 2)1 tuple_str_int(""(4)",0.0,0.05259151955609024
"Prompt: Write a function to locate the right insertion point for a specified value in sorted order. Assesments: assert right_insertion([1,2,4,5],6)==4, assert right_insertion([1,2,4,5],3)==2, assert right_insertion([1,2,4,5],7)==4",73,0.03,34,2.1470588235294117,"Prompt: Write a function locate the right insertion point a specified value sorted order Assesments assert right_insertion([1,2,4,5],6)==4",0.0,0.10290456431535268
"Prompt: Write a function that matches a string that has an a followed by three 'b'. Assesments: assert text_match_three(""ac"")==('Not matched!'), assert text_match_three(""dc"")==('Not matched!'), assert text_match_three(""abbbba"")==('Found a match!')",62,0.031,41,1.5121951219512195,"Prompt: Write a function matches a string that has an a followed three 'b Assesments: assert text_match_three(""ac"")==('Not matched text_match_three(""abbbba"")==('Found!",0.0,0.038141577074883415
"Prompt: Write a function to create a new tuple from the given string and list. Assesments: assert new_tuple([""WEB"", ""is""], ""best"") == ('WEB', 'is', 'best'), assert new_tuple([""We"", ""are""], ""Developers"") == ('We', 'are', 'Developers'), assert new_tuple([""Part"", ""is""], ""Wrong"") == ('Part', 'is', 'Wrong')",89,0.042,55,1.6181818181818182,"Prompt: Write a function to create a new tuple from the given string and list. Assesments: assert new_tuple([""WEB"",is""], ""best"") == ('WEB assert"",are ""Developers"")WeareDevelopers new_tuple([""Part"",isWrong"")')",0.0,0.0489533702811711
"Prompt: Write a function to calculate the perimeter of a regular polygon. Assesments: assert perimeter_polygon(4,20)==80, assert perimeter_polygon(10,15)==150, assert perimeter_polygon(9,7)==63",47,0.031,23,2.0434782608695654,"Prompt: Write a function calculate the perimeter a regular polygon Assesments assert perimeter_polygon(4,20)==80",0.0,0.09233822284516856
"Prompt: Write a python function to check whether every even index contains even numbers of a given list. Assesments: assert even_position([3,2,1]) == False, assert even_position([1,2,3]) == False, assert even_position([2,1,4]) == True",62,0.032,35,1.7714285714285714,"Prompt: Write a python function check whether every even index contains even numbers of a given list Assesments: assert even_position([3,2,1 == False, True",0.0,0.06458620217956317
"Prompt: Write a function to remove the nested record from the given tuple. Assesments: assert remove_nested((1, 5, 7, (4, 6), 10)) == (1, 5, 7, 10), assert remove_nested((2, 6, 8, (5, 7), 11)) == (2, 6, 8, 11), assert remove_nested((3, 7, 9, (6, 8), 12)) == (3, 7, 9, 12)",121,0.038,65,1.8615384615384616,"Prompt: Write a function to remove the nested record from the given tuple. Assesments: assert remove_nested((1, 5, 7, (4 6), 10)) == (1 5 10), assert 6 85 7 112 11 7 96 8))",0.0,0.07377838886297233
"Prompt: Write a python function to count the number of lists in a given number of lists. Assesments: assert count_list([[1, 3], [5, 7], [9, 11], [13, 15, 17]]) == 4, assert count_list([[1,2],[2,3],[4,5]]) == 3, assert count_list([[1,0],[2,0]]) == 2",92,0.034,45,2.0444444444444443,"Prompt: Write a python function to count lists in a given number lists Assesments: assert count_list([[1 35 79 1113 15, 17]]) == 4, assert 3 2",0.0,0.0924367840550413
"Prompt: Write a python function to find the last position of an element in a sorted array. Assesments: assert last([1,2,3],1,3) == 0, assert last([1,1,1,2,3,4],1,6) == 2, assert last([2,3,2,3,6,8,9],3,8) == 3",87,0.032,38,2.289473684210526,"Prompt: Write a python function find the last position an element a sorted array Assesments: assert last([1,2,3],1,3) == 0, 2",0.0,0.11743242562198664
"Prompt: Write a function that matches a string that has an 'a' followed by anything, ending in 'b'. Assesments: assert text_starta_endb(""aabbbb"")==('Found a match!'), assert text_starta_endb(""aabAbbbc"")==('Not matched!'), assert text_starta_endb(""accddbbjjj"")==('Not matched!')",80,0.033,53,1.509433962264151,"Prompt: Write a function matches a string that has an 'a followed anything, endingb Assesments: assert text_starta_endb(""aabbbb"")==('Found a match matched text_starta_endb(""accddbbjjj"")==('Not!",0.0,0.03785990882209469
"Prompt: Write a function to find the n - cheap price items from a given dataset using heap queue algorithm. Assesments: assert cheap_items([{'name': 'Item-1', 'price': 101.1},{'name': 'Item-2', 'price': 555.22}],1)==[{'name': 'Item-1', 'price': 101.1}], assert cheap_items([{'name': 'Item-1', 'price': 101.1},{'name': 'Item-2', 'price': 555.22}],2)==[{'name': 'Item-1', 'price': 101.1},{'name': 'Item-2', 'price': 555.22}], assert cheap_items([{'name': 'Item-1', 'price': 101.1},{'name': 'Item-2', 'price': 555.22}, {'name': 'Item-3', 'price': 45.09},{'name': 'Item-4', 'price': 22.75}],1)==[{'name': 'Item-4', 'price': 22.75}]",239,0.05,185,1.2918918918918918,"Prompt: Write a function to find the n - cheap price items from a given dataset using heap queue algorithm. Assesments: assert cheap_items([{'name': 'Item-1', 'price': 101.1},{'name 'Item-2', 'price 555.22}],1)==[{'name 'Item-1', 'price 101.1}], assert cheap_items([{'name 'Item-1', 101.1},{'nameItem-2 'price 555.22}],2)==[{'nameItem-1 'price 101.1},{'name ' 555.22}], assert cheap_items([{'nameItem-1 101.1},{'name ' 555.22}, {Item-3 ' 45.09},{'nameItem-4 ' 22.75}],1)==[{'nameItem-4 ' 22.75}]",0.0,0.015668256830082543
"Prompt: Write function to find the sum of all items in the given dictionary. Assesments: assert return_sum({'a': 100, 'b':200, 'c':300}) == 600, assert return_sum({'a': 25, 'b':18, 'c':45}) == 88, assert return_sum({'a': 36, 'b':39, 'c':49}) == 124",88,0.037,58,1.5172413793103448,"Prompt: Write function to find the sum all items in the given dictionary. Assesments: assert return_sum({'a 100,b':200,c':300 == 600, assert 25b':18c':45 88, 36b':39c':49 124",0.0,0.03865635008860076
"Prompt: Write a python function to find the sum of all odd natural numbers within the range l and r. Assesments: assert sum_in_Range(2,5) == 8, assert sum_in_Range(5,7) == 12, assert sum_in_Range(7,13) == 40",67,0.031,37,1.8108108108108107,"Prompt: Write a python function find the sum all odd natural numbers within the range l and Assesments assert sum_in_Range(2,5 8, 12 40",0.0,0.06860361798121133
"Prompt: Write a python function to find the sum of an array. Assesments: assert _sum([1, 2, 3]) == 6, assert _sum([15, 12, 13, 10]) == 50, assert _sum([0, 1, 2]) == 3",68,0.032,42,1.619047619047619,"Prompt: Write a python function to find the sum an array. Assesments: assert _sum([1 == 6,sum([15 12 13, 10 50sum([0 3",0.0,0.04904169136534282
"Prompt: Write a python function to left rotate the bits of a given number. Assesments: assert left_Rotate(16,2) == 64, assert left_Rotate(10,2) == 40, assert left_Rotate(99,3) == 792",58,0.03,32,1.8125,"Prompt: Write a python function left rotate the bits a given number Assesments: assert left_Rotate(16,2 64, 40 792",0.0,0.0687759336099585
"Prompt: Write a function to remove all whitespaces from a string. Assesments: assert remove_all_spaces('python  program')==('pythonprogram'), assert remove_all_spaces('python   programming    language')==('pythonprogramminglanguage'), assert remove_all_spaces('python                     program')==('pythonprogram')",64,0.03,42,1.5238095238095237,Prompt: Write a function remove all whitespaces a string Assesments: assert remove_all_spaces('python program')==('pythonprogram remove_all_spaces('python programming language')==('pythonprogramminglanguage'),0.0,0.03932637210645508
"Prompt: Write a python function to count the number of equal numbers from three given integers. Assesments: assert test_three_equal(1,1,1) == 3, assert test_three_equal(-1,-2,-3) == 0, assert test_three_equal(1,2,2) == 2",66,0.031,35,1.8857142857142857,"Prompt: Write a python function count equal numbers from three given integers Assesments: assert test_three_equal(1,1,1 == 3, 0 2",0.0,0.07624458529022844
"Prompt: Write a python function to count the number of rotations required to generate a sorted array. Assesments: assert count_Rotation([3,2,1],3) == 1, assert count_Rotation([4,5,1,2,3],5) == 2, assert count_Rotation([7,8,9,1,2,3],6) == 3",83,0.031,34,2.4411764705882355,"Prompt: Write a python function count rotations required generate a sorted array Assesments: assert count_Rotation([3,2,1],3) ==, 2",0.0,0.1329077561442707
"Prompt: Write a python function to check whether the given number is a perfect square or not. Assesments: assert is_Perfect_Square(10) == False, assert is_Perfect_Square(36) == True, assert is_Perfect_Square(14) == False",58,0.03,31,1.8709677419354838,"Prompt: Write a python function check whether the given number a perfect square or Assesments: assert is_Perfect_Square(10 == False, True",0.0,0.07474027779207808
"Prompt: Write a python function to check whether the product of numbers is even or not. Assesments: assert is_Product_Even([1,2,3],3) == True, assert is_Product_Even([1,2,1,4],4) == True, assert is_Product_Even([1,1],2) == False",72,0.03,34,2.1176470588235294,"Prompt: Write a python function check whether the product of numbers even or Assesments: assert is_Product_Even([1,2,3],3 == True,",0.0,0.09990424513246089
"Prompt: Write a function to find the list in a list of lists whose sum of elements is the highest. Assesments: assert max_sum_list([[1,2,3], [4,5,6], [10,11,12], [7,8,9]])==[10, 11, 12] , assert max_sum_list([[3,2,1], [6,5,4], [12,11,10]])==[12,11,10] , assert max_sum_list([[2,3,1]])==[2,3,1]",122,0.038,68,1.7941176470588236,"Prompt: Write a function to find the list in a list of lists whose sum of elements the highest. Assesments: assert max_sum_list([[1,2,310,11,127,8,9]])==[10 11 , assert6,5,412,11,10]])==[12,11,10",0.0,0.06690073412065113
"Prompt: Write a function to find maximum run of uppercase characters in the given string. Assesments: assert max_run_uppercase('GeMKSForGERksISBESt') == 5, assert max_run_uppercase('PrECIOusMOVemENTSYT') == 6, assert max_run_uppercase('GooGLEFluTTER') == 4",78,0.032,66,1.1818181818181819,"Prompt: Write a function find maximum run of uppercase characters the given string Assesments: assert max_run_uppercase('GeMKSForGERksISBESt 5, max_run_uppercase('PrECIOusMOVemENTSYT 6 max_run_uppercase('GooGLEFluTTER 4",0.0,0.0044395438586309986
"Prompt: Write a python function to find the first odd number in a given list of numbers. Assesments: assert first_odd([1,3,5]) == 1, assert first_odd([2,4,1,3]) == 1, assert first_odd ([8,9,1]) == 9",69,0.031,40,1.725,"Prompt: Write a python function find the first odd number a given list of numbers Assesments: assert first_odd([1,3,5 ==, ([8,9,1 9",0.0,0.05984998404085542
"Prompt: Write a function to check if the given tuples contain the k or not. Assesments: assert check_K((10, 4, 5, 6, 8), 6) == True, assert check_K((1, 2, 3, 4, 5, 6), 7) == False, assert check_K((7, 8, 9, 44, 11, 12), 11) == True",98,0.034,53,1.849056603773585,"Prompt: Write a function to check the given tuples contain the k or not Assesments: assert check_K((10 4, 5, 6, 8), 6) == True, assert 7 44 11 12 11",0.0,0.07250510391510939
"Prompt: Write a function to check if each element of second tuple is smaller than its corresponding index in first tuple. Assesments: assert check_smaller((1, 2, 3), (2, 3, 4)) == False, assert check_smaller((4, 5, 6), (3, 4, 5)) == True, assert check_smaller((11, 12, 13), (10, 11, 12)) == True",101,0.036,59,1.7118644067796611,"Prompt: Write a function to check each element of second tuple smaller its corresponding index in first tuple Assesments: assert check_smaller((1, 2,), (2 == False, assert check_smaller((43 4 True, check_smaller((1110 11 12 True",0.0,0.05851001098205544
"Prompt: Write a function to iterate over elements repeating each as many times as its count. Assesments: assert count_variable(4,2,0,-2)==['p', 'p', 'p', 'p', 'q', 'q'] , assert count_variable(0,1,2,3)==['q', 'r', 'r', 's', 's', 's'] , assert count_variable(11,15,12,23)==['p', 'p', 'p', 'p', 'p', 'p', 'p', 'p', 'p', 'p', 'p', 'q', 'q', 'q', 'q', 'q', 'q', 'q', 'q', 'q', 'q', 'q', 'q', 'q', 'q', 'q', 'r', 'r', 'r', 'r', 'r', 'r', 'r', 'r', 'r', 'r', 'r', 'r', 's', 's', 's', 's', 's', 's', 's', 's', 's', 's', 's', 's', 's', 's', 's', 's', 's', 's', 's', 's', 's', 's', 's']",279,0.068,147,1.8979591836734695,"Prompt: Write a function to iterate over elements repeating each as many times as its count. Assesments: assert count_variable(4,2,0,-2)==['p', 'p', 'p', 'p', 'q', 'q'] , assert count_variable(0,1,2,3)==['q',r',r', 's', 's', 's'] , assert count_variable(11,15,12,23)==['ppppp',p',p',p',p',p',q',q',',',',',',',q',q',q',',',rrr',r',r',r',r',r',r',rrr 's']",0.0,0.07749369776637116
"Prompt: Write a function to check if two lists of tuples are identical or not. Assesments: assert check_identical([(10, 4), (2, 5)], [(10, 4), (2, 5)]) == True, assert check_identical([(1, 2), (3, 7)], [(12, 14), (12, 45)]) == False, assert check_identical([(2, 14), (12, 25)], [(2, 14), (12, 25)]) == True",113,0.04,69,1.6376811594202898,"Prompt: Write a function to check two lists of tuples are identical or not Assesments: assert check_identical([(10 4), (2 5)], [(10 4]) == True, assert check_identical([(1 23 7)12 1412 45 False, 1412 252 14 25",0.0,0.05094251469860345
"Prompt: Write a function to abbreviate 'road' as 'rd.' in a given string. Assesments: assert road_rd(""ravipadu Road"")==('ravipadu Rd.'), assert road_rd(""palnadu Road"")==('palnadu Rd.'), assert road_rd(""eshwar enclave Road"")==('eshwar enclave Rd.')",71,0.033,34,2.088235294117647,"Prompt: Write a function abbreviate 'road asrd in a given string Assesments: assert road_rd(""ravipadu Road"")==('ravipadu Rd.')",0.0,0.0969039259495691
"Prompt: Write a function to find length of the string. Assesments: assert string_length('python')==6, assert string_length('program')==7, assert string_length('language')==8",42,0.028,19,2.210526315789474,Prompt: Write a function find length Assesments: assert string_length('python')==6,0.0,0.10937893728896132
"Prompt: Write a function to find the area of a rombus. Assesments: assert rombus_area(10,20)==100, assert rombus_area(10,5)==25, assert rombus_area(4,2)==4",50,0.029,24,2.0833333333333335,"Prompt: Write a function find the area a rombus Assesments assert rombus_area(10,20)==100",0.0,0.09640387275242047
"Prompt: Write a function to sort the given array without using any sorting algorithm. the given array consists of only 0, 1, and 2. Assesments: assert sort_by_dnf([1,2,0,1,0,1,2,1,1], 9) == [0, 0, 1, 1, 1, 1, 1, 2, 2], assert sort_by_dnf([1,0,0,1,2,1,2,2,1,0], 10) == [0, 0, 0, 1, 1, 1, 1, 2, 2, 2], assert sort_by_dnf([2,2,1,0,0,0,1,1,2,1], 10) == [0, 0, 0, 1, 1, 1, 1, 2, 2, 2]",211,0.054,143,1.4755244755244756,"Prompt: Write a function to sort the given array without using any sorting algorithm. the given array consists only 0, 1 and 2. Assesments: assert sort_by_dnf([1,2,0,1,0,1,2,1,1], 9) == [0, 0 1 1 1 2 2], assert sort_by_dnf([1,0,0,1,2,1,2,2,1,0], 100 0 0 2, 2 sort_by_dnf([2,2,1,0,0,0,1,1,2,1 10,]",0.0,0.034400773181494544
"Prompt: Write a function to clear the values of the given tuples. Assesments: assert clear_tuple((1, 5, 3, 6, 8)) == (), assert clear_tuple((2, 1, 4 ,5 ,6)) == (), assert clear_tuple((3, 2, 5, 6, 8)) == ()",76,0.039,43,1.7674418604651163,"Prompt: Write a function to clear the values the given tuples Assesments: assert clear_tuple((1 5, 3, 6 == (), 1 4 ,5 , 2 5 ()",0.0,0.064179514396633
"Prompt: Write a function to find numbers divisible by m or n from a list of numbers using lambda function. Assesments: assert div_of_nums([19, 65, 57, 39, 152, 639, 121, 44, 90, 190],19,13)==[19, 65, 57, 39, 152, 190], assert div_of_nums([1, 2, 3, 5, 7, 8, 10],2,5)==[2, 5, 8, 10], assert div_of_nums([10,15,14,13,18,12,20],10,5)==[10, 15, 20]",155,0.04,95,1.631578947368421,"Prompt: Write a function to find numbers divisible m or n from a list of numbers using lambda function Assesments: assert div_of_nums([19 65, 57, 39 152 639 121 44 90 190],19,13)==[19 190 assert 2 5 8 8 div_of_nums([10,15,14,13,18,12,20],10,5)==[10 20]",0.0,0.050320022846775406
"Prompt: Write a python function to count lower case letters in a given string. Assesments: assert lower_ctr('abc') == 3, assert lower_ctr('string') == 6, assert lower_ctr('Python') == 5",49,0.033,38,1.2894736842105263,"Prompt: Write a python function count lower case letters in a given string Assesments: assert lower_ctr('abc 3, lower_ctr('string 6 lower_ctr('Python 5",0.0,0.015421573403665562
"Prompt: Write a function to count the frequency of consecutive duplicate elements in a given list of numbers. Assesments: assert count_duplic([1,2,2,2,4,4,4,5,5,5,5])==([1, 2, 4, 5], [1, 3, 3, 4]), assert count_duplic([2,2,3,1,2,6,7,9])==([2, 3, 1, 2, 6, 7, 9], [2, 1, 1, 1, 1, 1, 1]), assert count_duplic([2,1,5,6,8,3,4,9,10,11,8,12])==([2, 1, 5, 6, 8, 3, 4, 9, 10, 11, 8, 12], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1])",242,0.048,166,1.4578313253012047,"Prompt: Write a function to count the frequency consecutive duplicate elements in a given list of numbers Assesments: assert count_duplic([1,2,2,2,4,4,4,5,5,5,5])==([1 2 4], [1 3 3]), assert count_duplic([2,2,3,1,2,6,7,9])==([2 3 1 2 6, 7, 92 1 1 1 1 count_duplic([2,1,5,6,8,3,4,9,10,11,8,12])==([2 1 5 6 8 3, 4, 9,,, 8 121 1,])",0.0,0.0325958798487919
"Prompt: Write a function to check whether the given month number contains 28 days or not. Assesments: assert check_monthnum_number(2)==True, assert check_monthnum_number(1)==False, assert check_monthnum_number(3)==False",52,0.031,26,2.0,Prompt: Write a function check the given month number contains 28 days Assesments assert check_monthnum_number(2)==True,0.0,0.0879029684008937
"Prompt: Write a function to merge two dictionaries into a single expression. Assesments: assert merge_dictionaries({ ""R"": ""Red"", ""B"": ""Black"", ""P"": ""Pink"" }, { ""G"": ""Green"", ""W"": ""White"" })=={'B': 'Black', 'R': 'Red', 'P': 'Pink', 'G': 'Green', 'W': 'White'}, assert merge_dictionaries({ ""R"": ""Red"", ""B"": ""Black"", ""P"": ""Pink"" },{ ""O"": ""Orange"", ""W"": ""White"", ""B"": ""Black"" })=={'O': 'Orange', 'P': 'Pink', 'B': 'Black', 'W': 'White', 'R': 'Red'}, assert merge_dictionaries({ ""G"": ""Green"", ""W"": ""White"" },{ ""O"": ""Orange"", ""W"": ""White"", ""B"": ""Black"" })=={'W': 'White', 'O': 'Orange', 'G': 'Green', 'B': 'Black'}",225,0.068,127,1.7716535433070866,"Prompt: Write a function to merge two dictionaries into a single expression. Assesments: assert merge_dictionaries({ ""R"": ""Red"", ""B ""Black ""PPink"" }, { ""G ""GreenWWhite"" })=={'B 'BlackRRedPPink',G 'Green',W'}, assert merge_dictionaries({ ""R ""Red ""B ""P""{OOrangeWWhite"",BBlack"" })'O 'OrangeP 'Pink',B': 'Black',W',RRed'}, assert ""GGreenW"" },{OOrangeWhite"","" })W 'WhiteOG': 'GreenB':'}",0.0,0.06460915175261565
"Prompt: Write a function to return true if the password is valid. Assesments: assert pass_validity(""password"")==False, assert pass_validity(""Password@10"")==True, assert pass_validity(""password@10"")==False",48,0.031,22,2.1818181818181817,"Prompt: Write a function return true the password Assesments: assert pass_validity(""password"")==False,",0.0,0.10645039607695207
"Prompt: Write a function to check if the given string starts with a substring using regex. Assesments: assert check_substring(""dreams for dreams makes life fun"", ""makes"") == 'string doesnt start with the given substring', assert check_substring(""Hi there how are you Hi alex"", ""Hi"") == 'string starts with the given substring', assert check_substring(""Its been a long day"", ""been"") == 'string doesnt start with the given substring'",97,0.04,49,1.9795918367346939,"Prompt: Write a function check the given string starts using regex. Assesments: assert check_substring(""dreams for dreams makes life funmakes"") == 'string doesnt start the given substring there how Hi alexHi"") starts beenbeen"")",0.0,0.0858211142739892
"Prompt: Write a python function to remove even numbers from a given list. Assesments: assert remove_even([1,3,5,2]) == [1,3,5], assert remove_even([5,6,7]) == [5,7], assert remove_even([1,2,3,4]) == [1,3]",73,0.032,36,2.0277777777777777,"Prompt: Write a python function to remove even numbers a given list. Assesments: assert remove_even([1,3,5,2 == [], assert5,7]",0.0,0.09073660318473595
"Prompt: Write a python function to access multiple elements of specified index from a given list. Assesments: assert access_elements([2,3,8,4,7,9],[0,3,5]) == [2, 4, 9], assert access_elements([1, 2, 3, 4, 5],[1,2]) == [2,3], assert access_elements([1,0,2,3],[0,1]) == [1,0]",104,0.035,61,1.7049180327868851,"Prompt: Write a python function access multiple elements specified index from a given list Assesments: assert access_elements([2,3,8,4,7,9],[0,3,5]) == [2 4 9 assert 5],[1,2])2,3],]",0.0,0.057801405451225175
"Prompt: Write a python function to find the type of triangle from the given sides. Assesments: assert check_Type_Of_Triangle(1,2,3) == ""Obtuse-angled Triangle"", assert check_Type_Of_Triangle(2,2,2) == ""Acute-angled Triangle"", assert check_Type_Of_Triangle(1,0,1) == ""Right-angled Triangle""",86,0.037,49,1.7551020408163265,"Prompt: Write a python function find the type triangle from the given sides Assesments: assert check_Type_Of_Triangle(1,2,3 == ""Obtuse-angled Triangle ""Acute-angled TriangleRight-angled Triangle""",0.0,0.06292071887803956
"Prompt: Write a function to sum a specific column of a list in a given list of lists. Assesments: assert sum_column( [[1,2,3,2],[4,5,6,2],[7,8,9,5],],0)==12, assert sum_column( [[1,2,3,2],[4,5,6,2],[7,8,9,5],],1)==15, assert sum_column( [[1,2,3,2],[4,5,6,2],[7,8,9,5],],3)==9",125,0.035,26,4.8076923076923075,"Prompt: Write a function sum a specific column a list in a given list of lists Assesments: assert sum_column [[,",0.0,0.37431805347541064
"Prompt: Write a function to count alphabets,digits and special charactes in a given string. Assesments: assert count_alpha_dig_spl(""abc!@#123"")==(3,3,3), assert count_alpha_dig_spl(""dgsuy@#$%&1255"")==(5,4,5), assert count_alpha_dig_spl(""fjdsif627348#%$^&"")==(6,6,5)",97,0.035,41,2.3658536585365852,"Prompt: Write a function count alphabetsdigits special charactes a given string Assesments: assert count_alpha_dig_spl(""abc!@#123"")==(3,3,3)",0.0,0.12522401189540142
"Prompt: Write a function to find out the second most repeated (or frequent) string in the given sequence. Assesments: assert second_frequent(['aaa','bbb','ccc','bbb','aaa','aaa']) == 'bbb', assert second_frequent(['abc','bcd','abc','bcd','bcd','bcd']) == 'abc', assert second_frequent(['cdma','gsm','hspa','gsm','cdma','cdma']) == 'gsm'",97,0.036,85,1.1411764705882352,"Prompt: Write a function to find out the second most repeated (or frequent) string the given sequence Assesments: assert second_frequent(['aaa','bbb','ccc','bbb','aaa','aaa' == 'bbb assert second_frequent(['abc','bcd','abc','bcd','bcd','bcdabc second_frequent(['cdma','gsm','hspa','gsm','cdma','cdma'",0.0,0.00029364826045323047
"Prompt: Write a function to round up a number to specific digits. Assesments: assert round_up(123.01247,0)==124, assert round_up(123.01247,1)==123.1, assert round_up(123.01247,2)==123.02",60,0.029,13,4.615384615384615,Prompt: Write a function round to specific digits Assesments assert,0.0,0.35470058189496423
"Prompt: Write a python function to count equal element pairs from the given array. Assesments: assert count_Pairs([1,1,1,1],4) == 6, assert count_Pairs([1,5,1],3) == 1, assert count_Pairs([3,2,1,7,8,9],6) == 0",78,0.032,39,2.0,"Prompt: Write a python function count equal element pairs from the given array Assesments: assert count_Pairs([1,1,1,1],4 6, 1 0",0.0,0.0879029684008937
"Prompt: Write a function to extract the maximum numeric value from a string by using regex. Assesments: assert extract_max('100klh564abc365bg') == 564, assert extract_max('hello300how546mer231') == 546, assert extract_max('its233beenalong343journey234') == 343",69,0.033,55,1.2545454545454546,"Prompt: Write a function extract the maximum numeric value by regex. Assesments: assert extract_max('100klh564abc365bg 564, extract_max('hello300how546mer231 546 extract_max('its233beenalong343journey234 343",0.0,0.011858514929054353
"Prompt: Write a function to get dictionary keys as a list. Assesments: assert get_key({1:'python',2:'java'})==[1,2], assert get_key({10:'red',20:'blue',30:'black'})==[10,20,30], assert get_key({27:'language',39:'java',44:'little'})==[27,39,44]",83,0.032,31,2.6774193548387095,"Prompt: Write a function get dictionary keys as Assesments: assert get_key({1:'python',2:'java'})==[1,2 assert",0.0,0.15700709409717573
"Prompt: Write a function to generate a square matrix filled with elements from 1 to n raised to the power of 2 in spiral order. Assesments: assert generate_matrix(3)==[[1, 2, 3], [8, 9, 4], [7, 6, 5]] , assert generate_matrix(2)==[[1,2],[4,3]], assert generate_matrix(7)==[[1, 2, 3, 4, 5, 6, 7], [24, 25, 26, 27, 28, 29, 8], [23, 40, 41, 42, 43, 30, 9], [22, 39, 48, 49, 44, 31, 10], [21, 38, 47, 46, 45, 32, 11], [20, 37, 36, 35, 34, 33, 12], [19, 18, 17, 16, 15, 14, 13]]",235,0.05,128,1.8359375,"Prompt: Write a function to generate a square matrix filled elements from 1 n raised to the power 2 in spiral order. Assesments: assert generate_matrix(3)==[[1 2], [8 9 47 6 5 , assert generate_matrix(2)==[[1,2],[4,3] assert 2,,,,,],24 25,,,, 8],23 40 30, 922 39 48 49 44 3121 38 47 46 45 32 37 36 34 33 12 18 17 14 13]]",0.0,0.0711668129588254
"Prompt: Write a python function to find the slope of a line. Assesments: assert slope(4,2,2,5) == -1.5, assert slope(2,4,4,6) == 1, assert slope(1,2,4,2) == 0",64,0.031,34,1.8823529411764706,"Prompt: Write a python function find the slope a line Assesments: assert slope(4,2,2,5 -1.5, assert 1,",0.0,0.07590169166932652
"Prompt: Write a function to find length of the subarray having maximum sum. Assesments: assert max_sub_array_sum([-2, -3, 4, -1, -2, 1, 5, -3],8) == 5, assert max_sub_array_sum([1, -2, 1, 1, -2, 1],6) == 2, assert max_sub_array_sum([-1, -2, 3, 4, 5],5) == 3",109,0.038,62,1.7580645161290323,"Prompt: Write a function to find length the subarray having maximum sum. Assesments: assert max_sub_array_sum([-2, 4, -1 1 5 -3],8 == 5, 1 1 1],6 2 3 4 5],5",0.0,0.06322292350936441
"Prompt: Write a python function to find the cube sum of first n odd natural numbers. Assesments: assert cube_Sum(2) == 28, assert cube_Sum(3) == 153, assert cube_Sum(4) == 496",54,0.03,33,1.6363636363636365,"Prompt: Write a python function find the cube sum first n odd natural numbers Assesments: assert cube_Sum(2) 28, 153 496",0.0,0.05080811304877696
"Prompt: Write a python function to find minimum number swaps required to make two binary strings equal. Assesments: assert min_Swaps(""0011"",""1111"") == 1, assert min_Swaps(""00011"",""01001"") == 2, assert min_Swaps(""111"",""111"") == 0",68,0.031,39,1.7435897435897436,"Prompt: Write a python function find minimum number swaps required to make two binary strings equal Assesments: assert min_Swaps(""0011"",""1111 1, 2 0",0.0,0.06174633962696522
"Prompt: Write a function to sort the tuples alphabetically by the first item of each tuple. Assesments: assert sort_tuple([(""Amana"", 28), (""Zenat"", 30), (""Abhishek"", 29),(""Nikhil"", 21), (""B"", ""C"")]) == [('Abhishek', 29), ('Amana', 28), ('B', 'C'), ('Nikhil', 21), ('Zenat', 30)], assert sort_tuple([(""aaaa"", 28), (""aa"", 30), (""bab"", 29), (""bb"", 21), (""csa"", ""C"")]) == [('aa', 30), ('aaaa', 28), ('bab', 29), ('bb', 21), ('csa', 'C')], assert sort_tuple([(""Sarala"", 28), (""Ayesha"", 30), (""Suman"", 29),(""Sai"", 21), (""G"", ""H"")]) == [('Ayesha', 30), ('G', 'H'), ('Sai', 21), ('Sarala', 28), ('Suman', 29)]",242,0.062,168,1.4404761904761905,"Prompt: Write a function to sort the tuples alphabetically by the first item of each tuple. Assesments: assert sort_tuple([(""Amana"", 28), (""Zenat"", 30),Abhishek 29),(""Nikhil"", 21B"", ""C"")]) == [('Abhishek 29),Amana 28B ''),Nikhil 21Zenat)], assert sort_tuple([(""aaaa"", 28 (""aa"", 30bab 29bb"", 21csa ""C"")]) == [aa 30aaaa 28babbb '], sort_tuple([(""Sarala 28 (""Ayesha 30 (""Suman"", 29),(""Sai"", 21G"", ""H])Ayesha 30G 'Sai 21Sarala 28Suman)]",0.0,0.03082546775492833
"Prompt: Write a python function to check whether the roots of a quadratic equation are numerically equal but opposite in sign or not. Assesments: assert Check_Solution(2,0,-1) == ""Yes"", assert Check_Solution(1,-5,6) == ""No"", assert Check_Solution(2,0,2) == ""Yes""",75,0.034,37,2.027027027027027,"Prompt: Write a python function check whether the roots a quadratic equation numerically but opposite in sign or not Assesments: assert Check_Solution(2,0,-1 == """,0.0,0.09066001846084835
"Prompt: Write a function to count the number of inversions in the given array. Assesments: assert get_inv_count([1, 20, 6, 4, 5], 5) == 5, assert get_inv_count([8, 4, 2, 1], 4) == 6, assert get_inv_count([3, 1, 2], 3) == 2",89,0.036,51,1.7450980392156863,"Prompt: Write a function to count inversions in the given array Assesments: assert get_inv_count([1 20, 6 4 5 5) == 5, 4 2 4 6 1 2",0.0,0.0619002021491648
"Prompt: Write a function to find the number which occurs for odd number of times in the given array. Assesments: assert get_odd_occurence([2, 3, 5, 4, 5, 2, 4, 3, 5, 2, 4, 4, 2], 13) == 5, assert get_odd_occurence([1, 2, 3, 2, 3, 1, 3], 7) == 3, assert get_odd_occurence([5, 7, 2, 7, 5, 2, 5], 7) == 5",147,0.042,83,1.7710843373493976,"Prompt: Write a function to find the number which occurs for odd number times in the given array Assesments: assert get_odd_occurence([2 5 4 5 2 4 5 4 2 13) == 5, assert 2 1 3], 7 3 7 2 7 5 2 5 7 5",0.0,0.06455108656778406
"Prompt: Write a function to find the nth super ugly number from a given prime list of size k using heap queue algorithm. Assesments: assert nth_super_ugly_number(12,[2,7,13,19])==32, assert nth_super_ugly_number(10,[2,7,13,19])==26, assert nth_super_ugly_number(100,[2,7,13,19])==5408",92,0.035,42,2.1904761904761907,"Prompt: Write find the nth super ugly number a given prime list size k using heap queue algorithm Assesments assert nth_super_ugly_number(12,[2,7,13,19])==32",0.0,0.10733360691866918
"Prompt: Write a python function to find the kth element in an array containing odd elements first and then even elements. Assesments: assert get_Number(8,5) == 2, assert get_Number(7,2) == 3, assert get_Number(5,2) == 3",62,0.033,37,1.6756756756756757,"Prompt: Write a python function find the kth element an array containing odd elements first and then even elements. Assesments: assert get_Number(8,5 2, 3",0.0,0.05481836768143822
"Prompt: Write a python function to count the number of digits in factorial of a given number. Assesments: assert find_Digits(7) == 4, assert find_Digits(5) == 3, assert find_Digits(4) == 2",55,0.034,30,1.8333333333333333,"Prompt: Write a python function count digits factorial of a given number Assesments: assert find_Digits(7 == 4, assert 3",0.0,0.07090115969784018
"Prompt: Write a function to find the minimum number of platforms required for a railway/bus station. Assesments: assert find_platform([900, 940, 950, 1100, 1500, 1800],[910, 1200, 1120, 1130, 1900, 2000],6)==3, assert find_platform([100,200,300,400],[700,800,900,1000],4)==4, assert find_platform([5,6,7,8],[4,3,2,1],4)==1",122,0.034,51,2.392156862745098,"Prompt: Write a function find platforms required a railway/bus station Assesments: assert find_platform([900 940 950 1100 1500 1800],[910 1200 1900 2000],6)==3,",0.0,0.12790722417278433
"Prompt: Write a python function to copy a list from a singleton tuple. Assesments: assert lcopy([1, 2, 3]) == [1, 2, 3], assert lcopy([4, 8, 2, 10, 15, 18]) == [4, 8, 2, 10, 15, 18], assert lcopy([4, 5, 6]) == [4, 5, 6]",103,0.038,56,1.8392857142857142,"Prompt: Write a python function to copy a list from a singleton tuple. Assesments: assert lcopy([1 2]) == [], assert lcopy([4 8 2, 10, 15, 184 lcopy([4 5 6])]",0.0,0.07150836715152066
"Prompt: Write a function to find the area of a trapezium. Assesments: assert area_trapezium(6,9,4)==30, assert area_trapezium(10,20,30)==450, assert area_trapezium(15,25,35)==700",63,0.033,29,2.1724137931034484,"Prompt: Write a function find the area a trapezium Assesments assert area_trapezium(6,9,4)==30",0.0,0.10549104636956977
"Prompt: Write a python function to find sum of all prime divisors of a given number. Assesments: assert Sum(60) == 10, assert Sum(39) == 16, assert Sum(40) == 7",49,0.031,31,1.5806451612903225,"Prompt: Write a python function find sum all prime divisors of Assesments: assert Sum(60 10, Sum(39 16 7",0.0,0.04512422392224292
"Prompt: Write a function to check if a triangle of positive area is possible with the given angles. Assesments: assert is_triangleexists(50,60,70)==True, assert is_triangleexists(90,45,45)==True, assert is_triangleexists(150,30,70)==False",62,0.031,30,2.066666666666667,"Prompt: Write a function a triangle of positive area possible with the given angles Assesments assert is_triangleexists(50,60,70)==True",0.0,0.09470369188211514
"Prompt: Write a python function to find sum of inverse of divisors. Assesments: assert Sum_of_Inverse_Divisors(6,12) == 2, assert Sum_of_Inverse_Divisors(9,13) == 1.44, assert Sum_of_Inverse_Divisors(1,4) == 4",74,0.031,38,1.9473684210526316,"Prompt: Write a python function find sum inverse of divisors Assesments: assert Sum_of_Inverse_Divisors(6,12 2, 1.44 4",0.0,0.08253397617887681
"Prompt: Write a python function to remove negative numbers from a list. Assesments: assert remove_negs([1,-2,3,-4]) == [1,3], assert remove_negs([1,2,3,-4]) == [1,2,3], assert remove_negs([4,5,-6,7,-8]) == [4,5,7]",81,0.033,49,1.653061224489796,"Prompt: Write a python function remove negative numbers a list. Assesments: assert remove_negs([1,-2,3,-4 == [1,3], assert remove_negs([4,5,-6,7,-8]",0.0,0.05251144824351701
"Prompt: Write a python function to find sum of odd factors of a number. Assesments: assert sum_of_odd_Factors(30) == 24, assert sum_of_odd_Factors(18) == 13, assert sum_of_odd_Factors(2) == 1",61,0.032,33,1.8484848484848484,"Prompt: Write a python function find sum odd factors of a number Assesments: assert sum_of_odd_Factors(30 24, 13 1",0.0,0.07244677867084505
"Prompt: Write a function which accepts an arbitrary list and converts it to a heap using heap queue algorithm. Assesments: assert raw_heap([25, 44, 68, 21, 39, 23, 89])==[21, 25, 23, 44, 39, 68, 89], assert raw_heap([25, 35, 22, 85, 14, 65, 75, 25, 58])== [14, 25, 22, 25, 35, 65, 75, 85, 58], assert raw_heap([4, 5, 6, 2])==[2, 4, 6, 5]",157,0.04,97,1.6185567010309279,Prompt: Write a function which accepts an arbitrary list and converts a heap using heap queue algorithm Assesments: assert raw_heap([25 44 68 21 39 23 89])==[21 25 23 44 39 68 89 assert 35 22 85 14 65 75 25 [14 25 22 25 35 65 85 58 5 6 2])==[2],0.0,0.04899161240009082
"Prompt: Write a python function to check for even parity of a given number. Assesments: assert check_Even_Parity(10) == True, assert check_Even_Parity(11) == False, assert check_Even_Parity(18) == True",55,0.03,30,1.8333333333333333,"Prompt: Write a python function check for even parity of a given number. Assesments: assert check_Even_Parity(10 == True,",0.0,0.07090115969784018
"Prompt: Write a python function to find minimum adjacent swaps required to sort binary array. Assesments: assert find_Min_Swaps([1,0,1,0],4) == 3, assert find_Min_Swaps([0,1,0],3) == 1, assert find_Min_Swaps([0,0,1,1,0],5) == 2",83,0.031,39,2.128205128205128,"Prompt: Write a python function find minimum adjacent swaps required sort binary array Assesments: assert find_Min_Swaps([1,0,1,0],4 == 3, assert",0.0,0.10098128278785795
"Prompt: Write a function to list out the list of given strings individually using map function. Assesments: assert listify_list(['Red', 'Blue', 'Black', 'White', 'Pink'])==[['R', 'e', 'd'], ['B', 'l', 'u', 'e'], ['B', 'l', 'a', 'c', 'k'], ['W', 'h', 'i', 't', 'e'], ['P', 'i', 'n', 'k']], assert listify_list(['python'])==[['p', 'y', 't', 'h', 'o', 'n']], assert listify_list([' red ', 'green',' black', 'blue ',' orange', 'brown'])==[[' ', 'r', 'e', 'd', ' '], ['g', 'r', 'e', 'e', 'n'], [' ', 'b', 'l', 'a', 'c', 'k'], ['b', 'l', 'u', 'e', ' '], [' ', 'o', 'r', 'a', 'n', 'g', 'e'], ['b', 'r', 'o', 'w', 'n']]",248,0.067,120,2.066666666666667,"Prompt: Write a function to list out the list of given strings individually using map function. Assesments: assert listify_list(['Red',BlueBlack',White',Pink'])==[['R',e', 'd'], ['Bl',u',e'Blac',k'Whit',e'Pink']], assert listify_list(['python'])==[['p',yt',h',o',n']], assert red ',green',' black',blue ',' orange',brown'])== ',re', '],gree',n' ',blac'blu ' ',oran',g',e'brown']]",0.0,0.09470369188211514
"Prompt: Write a function to count number of lists in a given list of lists and square the count. Assesments: assert count_list([[0], [1, 3], [5, 7], [9, 11], [13, 15, 17]])==25, assert count_list([[1, 3], [5, 7], [9, 11], [13, 15, 17]] )==16, assert count_list([[2, 4], [[6,8], [4,5,8]], [10, 12, 14]])==9",127,0.041,74,1.7162162162162162,"Prompt: Write a function to count number lists in a given list of lists and square the count. Assesments: assert count_list([[0], [, 35 79 1113 15, 17]])==25, assert, 35 )16, 4 [[6,84,5,8]10 12, 14]])==9",0.0,0.05895394277137016
"Prompt: Write a function to generate all sublists of a given list. Assesments: assert sub_lists([10, 20, 30, 40])==[[], [10], [20], [30], [40], [10, 20], [10, 30], [10, 40], [20, 30], [20, 40], [30, 40], [10, 20, 30], [10, 20, 40], [10, 30, 40], [20, 30, 40], [10, 20, 30, 40]], assert sub_lists(['X', 'Y', 'Z'])==[[], ['X'], ['Y'], ['Z'], ['X', 'Y'], ['X', 'Z'], ['Y', 'Z'], ['X', 'Y', 'Z']], assert sub_lists([1,2,3])==[[],[1],[2],[3],[1,2],[1,3],[2,3],[1,2,3]]",222,0.054,152,1.4605263157894737,"Prompt: Write a function to generate all sublists of a given list. Assesments: assert sub_lists([10, 20, 30, 40])==[[], [10],2030],10, 20],10 3010 4020, 3020 4030 4010 20, 3010 20, 4010 30, 4020 30,10 20 30,]], assert sub_lists(['X', 'Z'])== ['X' ['X','XZYXY',']], assert sub_lists([1,2,3])==[[],[1],[2],[3],[1,2],[1,3],[2,3],[1,2,3]]",0.0,0.032870798125220486
"Prompt: Write a function to check whether the given string is ending with only alphanumeric characters or not using regex. Assesments: assert check_alphanumeric(""dawood@"") == 'Discard', assert check_alphanumeric(""skdmsam326"") == 'Accept', assert check_alphanumeric(""cooltricks@"") == 'Discard'",70,0.034,46,1.5217391304347827,"Prompt: Write a function check whether the given string ending only alphanumeric characters or using regex Assesments: assert check_alphanumeric(""dawood@"") 'Discard check_alphanumeric(""skdmsam326AcceptDiscard'",0.0,0.03911516951387058
"Prompt: Write a function to find all anagrams of a string in a given list of strings using lambda function. Assesments: assert anagram_lambda([""bcda"", ""abce"", ""cbda"", ""cbea"", ""adcb""],""abcd"")==['bcda', 'cbda', 'adcb'], assert anagram_lambda([""recitals"","" python""], ""articles"" )==[""recitals""], assert anagram_lambda(["" keep"","" abcdef"","" xyz""],"" peek"")==["" keep""]",103,0.041,73,1.4109589041095891,"Prompt: Write a function find all anagrams of a string in a given list of strings using lambda function Assesments: assert anagram_lambda([""bcdaabcecbdacbeaadcb""],""abcd"")==['bcdacbda' anagram_lambda([""recitals python""], ""articles"" ) keep abcdef"","" xyz""],"" peek"")== keep""]",0.0,0.0278143842174991
"Prompt: Write a function to find the occurrences of n most common words in a given text. Assesments: assert n_common_words(""python is a programming language"",1)==[('python', 1)], assert n_common_words(""python is a programming language"",1)==[('python', 1)], assert n_common_words(""python is a programming language"",5)==[('python', 1),('is', 1), ('a', 1), ('programming', 1), ('language', 1)]",108,0.037,64,1.6875,"Prompt: Write a function to find the occurrences n most common words in a given text. Assesments: assert n_common_words(""python is a programming language"",1)==[('python', 1)], assert language"",5)==[('python 1),('is', 1), ('aprogramminglanguage",0.0,0.056024577082668364
"Prompt: Write a function to find the length of the longest sub-sequence such that elements in the subsequences are consecutive integers. Assesments: assert find_longest_conseq_subseq([1, 2, 2, 3], 4) == 3, assert find_longest_conseq_subseq([1, 9, 3, 10, 4, 20, 2], 7) == 4, assert find_longest_conseq_subseq([36, 41, 56, 35, 44, 33, 34, 92, 43, 32, 42], 11) == 5",140,0.039,84,1.6666666666666667,"Prompt: Write a function find the length the longest sub-sequence such elements in the subsequences consecutive integers Assesments: assert find_longest_conseq_subseq([1 2 4 == 3, 9 3 10 4, 20 2 7 4 41 56 35 44 33 34 92 43 32 42 11 5",0.0,0.05389935099478668
"Prompt: Write a function to find palindromes in a given list of strings using lambda function. Assesments: assert palindrome_lambda([""php"", ""res"", ""Python"", ""abcd"", ""Java"", ""aaa""])==['php', 'aaa'], assert palindrome_lambda([""abcd"", ""Python"", ""abba"", ""aba""])==['abba', 'aba'], assert palindrome_lambda([""abcd"", ""abbccbba"", ""abba"", ""aba""])==['abbccbba', 'abba', 'aba']",103,0.04,65,1.5846153846153845,"Prompt: Write a function to find palindromes in a given list of strings using lambda function. Assesments: assert palindrome_lambda([""php"",resPython"", ""abcdJavaaaa""])==['phpaaa'], assert palindrome_lambda([""abcd ""Pythonabba"",aba""])==['abbaaba'abbccbbaabbaabba',",0.0,0.04552922978712955
"Prompt: Write a function to print n-times a list using map function. Assesments: assert ntimes_list([1, 2, 3, 4, 5, 6, 7],3)==[3, 6, 9, 12, 15, 18, 21], assert ntimes_list([1, 2, 3, 4, 5, 6, 7],4)==[4, 8, 12, 16, 20, 24, 28], assert ntimes_list([1, 2, 3, 4, 5, 6, 7],10)==[10, 20, 30, 40, 50, 60, 70]",163,0.039,88,1.8522727272727273,"Prompt: Write a function to print n-times a list using map function. Assesments: assert ntimes_list([1 2,,,,, 7],3)==[3, 6 9 12 15 18 21], assert 7],4)==[4 8 12 16 20 24, 28], 7],10)==[10 20 30 40 60]",0.0,0.07283318341409628
"Prompt: Write a function to check whether the given month name contains 31 days or not. Assesments: assert check_monthnumb(""February"")==False, assert check_monthnumb(""January"")==True, assert check_monthnumb(""March"")==True",52,0.031,27,1.9259259259259258,"Prompt: Write a function check the given month name contains 31 days Assesments: assert check_monthnumb(""February"")==False",0.0,0.08034660897731435
"Prompt: Write a python function to add a minimum number such that the sum of array becomes even. Assesments: assert min_Num([1,2,3,4,5,6,7,8,9],9) == 1, assert min_Num([1,2,3,4,5,6,7,8],8) == 2, assert min_Num([1,2,3],3) == 2",93,0.032,47,1.9787234042553192,"Prompt: Write a python function add a minimum number such the sum array becomes even Assesments: assert min_Num([1,2,3,4,5,6,7,8,9],9 ==, 2",0.0,0.08573252473667411
"Prompt: Write a python function to find the length of the last word in a given string. Assesments: assert length_Of_Last_Word(""python language"") == 8, assert length_Of_Last_Word(""PHP"") == 3, assert length_Of_Last_Word("""") == 0",63,0.035,38,1.6578947368421053,"Prompt: Write a python function to find the length the last word a given string Assesments: assert length_Of_Last_Word(""python language 8, 3"" 0",0.0,0.05300451895778387
"Prompt: Write a function to remove sublists from a given list of lists, which are outside a given range. Assesments: assert remove_list_range([[2], [0], [1, 2, 3], [0, 1, 2, 3, 6, 7], [9, 11], [13, 14, 15, 17]],13,17)==[[13, 14, 15, 17]], assert remove_list_range([[2], [0], [1, 2, 3], [0, 1, 2, 3, 6, 7], [9, 11], [13, 14, 15, 17]],1,3)==[[2], [1, 2, 3]], assert remove_list_range([[2], [0], [1, 2, 3], [0, 1, 2, 3, 6, 7], [9, 11], [13, 14, 15, 17]],0,7)==[[2], [0], [1, 2, 3], [0, 1, 2, 3, 6, 7]]",261,0.053,138,1.891304347826087,"Prompt: Write a function to remove sublists from a given list of lists, which are outside a given range. Assesments: assert remove_list_range([[2], [0], [1, 2, 3], [0 1, 2, 3, 6, 7], [9, 11], [13, 14, 15, 17]],13,17)==[[13, 14, 15]], assert remove_list_range([[20],, 17]],1,3)==[[2], [1, 2] assert0], 17]],0,7)==[[2],0],1,], []]",0.0,0.07681483229020662
"Prompt: Write a function to calculate the sum of the positive numbers of a given list of numbers using lambda function. Assesments: assert sum_positivenum([2, 4, -6, -9, 11, -12, 14, -5, 17])==48, assert sum_positivenum([10,15,-14,13,-18,12,-20])==50, assert sum_positivenum([19, -65, 57, 39, 152,-639, 121, 44, 90, -190])==522",124,0.036,66,1.878787878787879,"Prompt: Write a function calculate the positive numbers a given list numbers using lambda function Assesments: assert sum_positivenum([2 4 -6 11 14 -5, 17])==48, -65 57 39 152,-639 121 44 90 -190])==522",0.0,0.0755380166168548
"Prompt: Write a python function to check whether the given strings are rotations of each other or not. Assesments: assert are_Rotations(""abc"",""cba"") == False, assert are_Rotations(""abcd"",""cdba"") == False, assert are_Rotations(""abacd"",""cdaba"") == True",66,0.037,52,1.2692307692307692,"Prompt: Write a python function check whether the given strings rotations of each or not Assesments: assert are_Rotations(""abc"",""cba False, are_Rotations(""abcd"",""cdba are_Rotations(""abacd"",""cdaba True",0.0,0.013356576395197514
"Prompt: Write a function to check if a nested list is a subset of another nested list. Assesments: assert check_subset([[1, 3], [5, 7], [9, 11], [13, 15, 17]] ,[[1, 3],[13,15,17]])==True, assert check_subset([[1, 2], [2, 3], [3, 4], [5, 6]],[[3, 4], [5, 6]])==True, assert check_subset([[[1, 2], [2, 3]], [[3, 4], [5, 7]]],[[[3, 4], [5, 6]]])==False",156,0.043,101,1.5445544554455446,"Prompt: Write a function to check if a nested list is a subset another nested list. Assesments: assert check_subset([[1 3], [5 79 1113 15, 17]] ,[[1, 3],[13,15,17]])==True, assert 2],2 335 6]],[[3],5 6]])==True check_subset([[[1 2] [[5 7]]],[[[3 6]]])==False",0.0,0.041442580261856383
"Prompt: Write a function to solve the fibonacci sequence using recursion. Assesments: assert fibonacci(7) == 13, assert fibonacci(8) == 21, assert fibonacci(9) == 34",43,0.03,26,1.6538461538461537,"Prompt: Write a function solve the fibonacci sequence using recursion Assesments: assert fibonacci(7 13, 21 34",0.0,0.05259151955609024
"Prompt: Write a python function to check if the string is a concatenation of another string. Assesments: assert check_Concat(""abcabcabc"",""abc"") == True, assert check_Concat(""abcab"",""abc"") == False, assert check_Concat(""aba"",""ab"") == False",61,0.032,39,1.564102564102564,"Prompt: Write a python function check the string a concatenation another string Assesments: assert check_Concat(""abcabcabc"",""abc"") == True, check_Concat(""aba"",""ab",0.0,0.04343669948521528
"Prompt: Write a function to find the minimum difference in the tuple pairs of given tuples. Assesments: assert min_difference([(3, 5), (1, 7), (10, 3), (1, 2)]) == 1, assert min_difference([(4, 6), (12, 8), (11, 4), (2, 13)]) == 2, assert min_difference([(5, 17), (3, 9), (12, 5), (3, 24)]) == 6",114,0.039,67,1.7014925373134329,"Prompt: Write a function to find the minimum difference in the tuple pairs of given tuples. Assesments: assert min_difference([(3, 5), (1 710 31 2) == 1, 612 8)11 42 13) 2 173 912 53 24 6",0.0,0.05745196773870831
"Prompt: Write a python function to find lcm of two positive integers. Assesments: assert lcm(4,6) == 12, assert lcm(15,17) == 255, assert lcm(2,6) == 6",54,0.03,31,1.7419354838709677,"Prompt: Write a python function find lcm of two positive integers Assesments: assert lcm(4,6 12, 255 6",0.0,0.06157758718326246
"Prompt: Write a python function to sort the given string. Assesments: assert sort_String(""cba"") == ""abc"", assert sort_String(""data"") == ""aadt"", assert sort_String(""zxy"") == ""xyz""",49,0.031,38,1.2894736842105263,"Prompt: Write a python function to sort the given string. Assesments: assert sort_String(""cba"") ""abc sort_String(""dataaadt sort_String(""zxyxyz""",0.0,0.015421573403665562
"Prompt: Write a function to check if the given tuple contains only k elements. Assesments: assert check_tuples((3, 5, 6, 5, 3, 6),[3, 6, 5]) == True, assert check_tuples((4, 5, 6, 4, 6, 5),[4, 5, 6]) == True, assert check_tuples((9, 8, 7, 6, 8, 9),[9, 8, 1]) == False",121,0.036,64,1.890625,"Prompt: Write a function to check the given tuple contains only k elements Assesments: assert check_tuples((3 5, 6, 5 3, 6),[3 6]) == True, assert 4 6, 8 7 6 8 1]) False",0.0,0.07674553143951483
"Prompt: Write a function that matches a string that has an 'a' followed by anything, ending in 'b' by using regex. Assesments: assert text_match(""aabbbbd"") == 'Not matched!', assert text_match(""aabAbbbc"") == 'Not matched!', assert text_match(""accddbbjjjb"") == 'Found a match!'",76,0.035,56,1.3571428571428572,"Prompt: Write a function matches a string that has an 'a followed anything, ending 'b by using regex. Assesments: assert text_match(""aabbbbd 'Not matched! assert text_match(""aabAbbbc text_match(""accddbbjjjbFound",0.0,0.02232456340340158
"Prompt: Write a python function to find number of solutions in quadratic equation. Assesments: assert Check_Solution(2,5,2) == ""2 solutions"", assert Check_Solution(1,1,1) == ""No solutions"", assert Check_Solution(1,2,1) == ""1 solution""",67,0.034,35,1.9142857142857144,"Prompt: Write a python function find number solutions in quadratic equation Assesments: assert Check_Solution(2,5,2 == ""2 solutions"", assertNo solutions""",0.0,0.07915918106789477
"Prompt: Write a function to find the sum of first even and odd number of a given list. Assesments: assert sum_even_odd([1,3,5,7,4,1,6,8])==5, assert sum_even_odd([1,2,3,4,5,6,7,8,9,10])==3, assert sum_even_odd([1,5,7,9,10])==11",96,0.03,43,2.2325581395348837,"Prompt: Write a function find the sum first even and odd number a given list Assesments assert sum_even_odd([1,3,5,7,4,1,6,8])==5",0.0,0.11162642240515443
"Prompt: Write a function to caluclate perimeter of a parallelogram. Assesments: assert parallelogram_perimeter(10,20)==400, assert parallelogram_perimeter(15,20)==600, assert parallelogram_perimeter(8,9)==144",58,0.028,25,2.32,"Prompt: Write a function caluclate perimeter Assesments: assert parallelogram_perimeter(10,20)==400",0.0,0.12054644111075644
"Prompt: Write a function to find numbers divisible by m and n from a list of numbers using lambda function. Assesments: assert div_of_nums([19, 65, 57, 39, 152, 639, 121, 44, 90, 190],2,4)==[ 152,44], assert div_of_nums([1, 2, 3, 5, 7, 8, 10],2,5)==[10], assert div_of_nums([10,15,14,13,18,12,20],10,5)==[10,20]",130,0.035,58,2.2413793103448274,"Prompt: Write a function find numbers divisible m and n from numbers using lambda function Assesments: assert div_of_nums([19 65 57 39 152 639 121 44 90 190],2,4)==[ 152,44], assert 2",0.0,0.11252627755704016
"Prompt: Write a python function to check whether all the bits are within a given range or not. Assesments: assert all_Bits_Set_In_The_Given_Range(10,2,1) == True , assert all_Bits_Set_In_The_Given_Range(5,2,4) == False, assert all_Bits_Set_In_The_Given_Range(22,2,3) == True",89,0.032,41,2.1707317073170733,"Prompt: Write a python function check whether all the bits within a given range or Assesments: assert all_Bits_Set_In_The_Given_Range(10,2,1 == True ,,",0.0,0.10531945536499733
"Prompt: Write a python function to check whether the two given strings are isomorphic to each other or not. Assesments: assert is_Isomorphic(""paper"",""title"") == True, assert is_Isomorphic(""ab"",""ba"") == True, assert is_Isomorphic(""ab"",""aa"") == False",61,0.031,40,1.525,"Prompt: Write a python function to check whether the two given strings isomorphic each or Assesments: assert is_Isomorphic(""paper"",""title == True, is_Isomorphic(""ab"",""ba False",0.0,0.03944781359719118
"Prompt: Write a function to add all the numbers in a list and divide it with the length of the list. Assesments: assert sum_num((8, 2, 3, 0, 7))==4.0, assert sum_num((-10,-20,-30))==-20.0, assert sum_num((19,15,18))==17.333333333333332",83,0.031,33,2.515151515151515,"Prompt: Write a function add all the numbers and divide with Assesments: assert sum_num((8 2 0 7))==4.0,",0.0,0.1404540134830591
"Prompt: Write a python function to check whether the given number is odd or not using bitwise operator. Assesments: assert is_odd(5) == True, assert is_odd(6) == False, assert is_odd(7) == True",54,0.03,31,1.7419354838709677,"Prompt: Write a python function check whether the given number odd not using bitwise operator. Assesments: assert is_odd(5 == True,",0.0,0.06157758718326246
"Prompt: Write a function to substract the elements of the given nested tuples. Assesments: assert substract_elements(((1, 3), (4, 5), (2, 9), (1, 10)), ((6, 7), (3, 9), (1, 1), (7, 3))) == ((-5, -4), (1, -4), (1, 8), (-6, 7)), assert substract_elements(((13, 4), (14, 6), (13, 10), (12, 11)), ((19, 8), (14, 10), (12, 2), (18, 4))) == ((-6, -4), (0, -4), (1, 8), (-6, 7)), assert substract_elements(((19, 5), (18, 7), (19, 11), (17, 12)), ((12, 9), (17, 11), (13, 3), (19, 5))) == ((7, -4), (1, -4), (6, 8), (-2, 7))",253,0.057,144,1.7569444444444444,"Prompt: Write a function to substract the elements of the given nested tuples. Assesments: assert substract_elements(((1, 3), (4 5), (2 91 10)), ((6 73 91 1),7 3))) == ((-5 -4 (1 -41 8) (-6 7)), assert substract_elements(((13 414 613 1012 1119 8)14 1012 218 4)))-6 -40 -41 8) (-6 7)), 518 719 1117 12)),12 917 1113 319 57 -416 8)-2 7))",0.0,0.063108664042274
"Prompt: Write a function to reverse each list in a given list of lists. Assesments: assert reverse_list_lists([[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]])==[[4, 3, 2, 1], [8, 7, 6, 5], [12, 11, 10, 9], [16, 15, 14, 13]], assert reverse_list_lists([[1,2],[2,3],[3,4]])==[[2,1],[3,2],[4,3]], assert reverse_list_lists([[10,20],[30,40]])==[[20,10],[40,30]]",175,0.041,114,1.5350877192982457,"Prompt: Write a function to reverse each list in a given list of lists. Assesments: assert reverse_list_lists([[1 2,], [5],,, 16]])==[[4 3 2 1],8 7 6],12 11],16 15]], assert reverse_list_lists([[1,2],[2,3],[3,4]])==[[2,1],[3,2],[4,3] assert reverse_list_lists([[10,20],[30,40]])==[[20,10],[40,30",0.0,0.04047687043974443
"Prompt: Write a python function to find the index of an extra element present in one sorted array. Assesments: assert find_Extra([1,2,3,4],[1,2,3],3) == 3, assert find_Extra([2,4,6,8,10],[2,4,6,8],4) == 4, assert find_Extra([1,3,5,7,9,11],[1,3,5,7,9],5) == 5",110,0.032,45,2.4444444444444446,"Prompt: Write a python function find the index an extra element present one sorted array Assesments: assert find_Extra([1,2,3,4],[1,2,3],3 == 3, assert",0.0,0.13324112494236978
"Prompt: Write a python function to check whether the given two numbers have same number of digits or not. Assesments: assert same_Length(12,1) == False, assert same_Length(2,2) == True, assert same_Length(10,20) == True",57,0.03,31,1.8387096774193548,"Prompt: Write a python function check whether the given two numbers have same number or not Assesments: assert same_Length(12,1 == False,",0.0,0.07144960513987417
"Prompt: Write a function to remove multiple spaces in a string. Assesments: assert remove_spaces('python  program')==('python program'), assert remove_spaces('python   programming    language')==('python programming language'), assert remove_spaces('python                     program')==('python program')",59,0.031,26,2.269230769230769,Prompt: Write a function to remove multiple spaces in Assesments: assert remove_spaces('python program')==('python program assert,0.0,0.1153674286135186
"Prompt: Write a python function to get the last element of each sublist. Assesments: assert Extract([[1, 2, 3], [4, 5], [6, 7, 8, 9]]) == [3, 5, 9], assert Extract([['x', 'y', 'z'], ['m'], ['a', 'b'], ['u', 'v']]) == ['z', 'm', 'b', 'v'], assert Extract([[1, 2, 3], [4, 5]]) == [3, 5]",124,0.042,66,1.878787878787879,"Prompt: Write a python function to get the last element of each sublist. Assesments: assert Extract([[1 2], [4],,,]]) == [3 5 9], assert Extract([['x' ['m'ab'uv']]) ['zmb',v' assert Extract([[1]]3]",0.0,0.0755380166168548
"Prompt: Write a function to convert the given string of float type into tuple. Assesments: assert float_to_tuple(""1.2, 1.3, 2.3, 2.4, 6.5"") == (1.2, 1.3, 2.3, 2.4, 6.5), assert float_to_tuple(""2.3, 2.4, 5.6, 5.4, 8.9"") == (2.3, 2.4, 5.6, 5.4, 8.9), assert float_to_tuple(""0.3, 0.5, 7.8, 9.4"") == (0.3, 0.5, 7.8, 9.4)",175,0.039,89,1.9662921348314606,"Prompt: Write a function to convert the given string of float type into tuple. Assesments: assert float_to_tuple(""1.2, 1.3, 2.3,, 6.5"") == (1.2, 2.3), 5.6, 5.4, 8.9 float_to_tuple(""0.3 0.5 7.8 9.4)",0.0,0.08446440034859073
"Prompt: Write a function to find the maximum sum of subsequences of given array with no adjacent elements. Assesments: assert max_sum_subseq([1, 2, 9, 4, 5, 0, 4, 11, 6]) == 26, assert max_sum_subseq([1, 2, 9, 5, 6, 0, 5, 12, 7]) == 28, assert max_sum_subseq([1, 3, 10, 5, 6, 0, 6, 14, 21]) == 44",132,0.037,79,1.6708860759493671,"Prompt: Write a function to find the maximum sum subsequences of given array with no adjacent elements. Assesments: assert max_sum_subseq([1 9, 4 5, 0 4 11 6 == 26, 5 6 0 5 12 7 28 3 10 5 6 14 21 44",0.0,0.054329776531572845
"Prompt: Write a function to sort a list in increasing order by the last element in each tuple from a given list of non-empty tuples. Assesments: assert sort_list_last([(2, 5), (1, 2), (4, 4), (2, 3), (2, 1)])==[(2, 1), (1, 2), (2, 3), (4, 4), (2, 5)] , assert sort_list_last([(9,8), (4, 7), (3,5), (7,9), (1,2)])==[(1,2), (3,5), (4,7), (9,8), (7,9)] , assert sort_list_last([(20,50), (10,20), (40,40)])==[(10,20),(40,40),(20,50)]",188,0.044,126,1.492063492063492,"Prompt: Write a function to sort a list in increasing order by the last element in each tuple from a given list of non-empty tuples. Assesments: assert sort_list_last([(2, 5), (1 24 42 32 1)])==[(2 11 22 34 5)] , assert sort_list_last([(9,84 73,57,91,2)])==[(1,23,54,79,87,9)] , sort_list_last([(20,5010,2040,40)])==[(10,20),(40,40),(20,50)]",0.0,0.036087932353492516
"Prompt: Write a python function to check whether the word is present in a given sentence or not. Assesments: assert is_Word_Present(""machine learning"",""machine"") == True, assert is_Word_Present(""easy"",""fun"") == False, assert is_Word_Present(""python language"",""code"") == False",67,0.031,52,1.2884615384615385,"Prompt: Write a python function check whether the word present a given sentence or Assesments: assert is_Word_Present(""machine learning"",""machine"") True, is_Word_Present(""easy"",""fun is_Word_Present(""python language"",""code",0.0,0.015318323553242167
"Prompt: Write a function to extract specified number of elements from a given list, which follow each other continuously. Assesments: assert extract_elements([1, 1, 3, 4, 4, 5, 6, 7],2)==[1, 4], assert extract_elements([0, 1, 2, 3, 4, 4, 4, 4, 5, 7],4)==[4], assert extract_elements([0,0,0,0,0],5)==[0]",118,0.034,56,2.107142857142857,"Prompt: Write a function to extract specified number elements a given list, which follow each continuously Assesments: assert extract_elements([1 1 3, 4 4 7],2)==[1 4], assert 2 4 4 4]",0.0,0.0988327025671424
"Prompt: Write a python function to check whether an array can be sorted or not by picking only the corner elements. Assesments: assert check([3,2,1,2,3,4],6) == True, assert check([2,1,4,5,1],5) == True, assert check([1,2,2,1,2,3],6) == True",84,0.031,42,2.0,"Prompt: Write a python function check whether an array can sorted or by picking only the corner elements Assesments: assert check([3,2,1,2,3,4],6 == True,",0.0,0.0879029684008937
"Prompt: Write a function where a string will start with a specific number. Assesments: assert match_num('5-2345861')==True, assert match_num('6-2345861')==False, assert match_num('78910')==False",54,0.028,28,1.9285714285714286,Prompt: Write a function where a string will start a specific number Assesments assert match_num('5-2345861')==True,0.0,0.08061647895672792
"Prompt: Write a function to find the smallest multiple of the first n numbers. Assesments: assert smallest_multiple(13)==360360, assert smallest_multiple(2)==2, assert smallest_multiple(1)==1",44,0.029,25,1.76,Prompt: Write a function find the smallest multiple the first n numbers Assesments: assert smallest_multiple(13)==360360,0.0,0.06342036386849664
"Prompt: Write a function to combine two dictionaries by adding values for common keys. Assesments: assert add_dict({'a': 100, 'b': 200, 'c':300},{'a': 300, 'b': 200, 'd':400})==({'b': 400, 'd': 400, 'a': 400, 'c': 300}) , assert add_dict({'a': 500, 'b': 700, 'c':900},{'a': 500, 'b': 600, 'd':900})==({'b': 1300, 'd': 900, 'a': 1000, 'c': 900}) , assert add_dict({'a':900,'b':900,'d':900},{'a':900,'b':900,'d':900})==({'b': 1800, 'd': 1800, 'a': 1800})",199,0.044,145,1.3724137931034484,"Prompt: Write a function to combine two dictionaries by adding values for common keys. Assesments: assert add_dict({'a': 100,b 200,c':300},{'a 300, 200d':400})==({'b 400, 'd 400,a 400,c 300}) , assert add_dict({'a 500 700c':900},{'a 500 600d':900})==({'b 1300 900 1000,c 900}) , add_dict({'a':900,'b':900,'d':900},{'a':900,'b':900,'d':900})==({'b 1800, 1800 1800})",0.0,0.02388236459491289
"Prompt: Write a python function to count the total unset bits from 1 to n. Assesments: assert count_Unset_Bits(2) == 1, assert count_Unset_Bits(5) == 4, assert count_Unset_Bits(14) == 17",60,0.03,34,1.7647058823529411,"Prompt: Write a python function count the total unset bits from 1 n. Assesments: assert count_Unset_Bits(2 ==, 4 17",0.0,0.06390041493775933
"Prompt: Write a function to return true if the given number is even else return false. Assesments: assert even_num(13.5)==False, assert even_num(0)==True, assert even_num(-9)==False",47,0.028,25,1.88,Prompt: Write a function return true the given number even else Assesments: assert even_num(13.5)==False,0.0,0.07566166613469516
"Prompt: Write a python function to find the sum of squares of binomial co-efficients. Assesments: assert sum_of_square(4) == 70, assert sum_of_square(5) == 252, assert sum_of_square(2) == 6",55,0.03,31,1.7741935483870968,"Prompt: Write a python function find the sum squares of binomial coefficients Assesments: assert sum_of_square(4 70, 252 6",0.0,0.06486825983546636
"Prompt: Write a function to extract year, month and date from a url by using regex. Assesments: assert extract_date(""https://www.washingtonpost.com/news/football-insider/wp/2016/09/02/odell-beckhams-fame-rests-on-one-stupid-little-ball-josh-norman-tells-author/"") == [('2016', '09', '02')], assert extract_date(""https://www.indiatoday.in/movies/celebrities/story/wp/2020/11/03/odeof-sushant-singh-rajput-s-death-his-brother-in-law-shares-advice-for-fans-1749646/"") == [('2020', '11', '03')], assert extract_date(""https://economictimes.indiatimes.com/news/economy/2020/12/29/finance/pension-assets-under-pfrda-touch-rs-5-32-lakh-crore/articleshow/79736619.cms"") == [('2020', '12', '29')]",225,0.057,176,1.2784090909090908,"Prompt: Write a function to extract year, month date from a url by using regex. Assesments: assert extract_date(""https://www.washingtonpost.com/news/football-insider/wp/2016/09/02/odell-beckhamsfame-rests-on-one-stupid-little-ball-josh-norman-tellsauthor/ == [('2016',09',02 assert extract_date(""https://www.indiatoday.inmoviescelebritiesstorywp/2020/11/03odeof-sushant-singh-rajput-s-deathhis-brotherinlaw-sharesadviceforfans-1749646/202011economy/2020/12/29financepensionassetsunderpfrdatouchrs-5-32-lakhcrore/articleshow/79736619.cms29]",0.0,0.014292864811537
"Prompt: Write a function to print the first n lucky numbers. Assesments: assert lucky_num(10)==[1, 3, 7, 9, 13, 15, 21, 25, 31, 33] , assert lucky_num(5)==[1, 3, 7, 9, 13], assert lucky_num(8)==[1, 3, 7, 9, 13, 15, 21, 25]",105,0.034,52,2.019230769230769,"Prompt: Write a function to print the first n lucky numbers. Assesments: assert lucky_num(10)==[1, 3 7 9 13 15 21 25 31 33] , assert 3],,,]",0.0,0.08986471555893834
"Prompt: Write a function to find the fixed point in the given array. Assesments: assert find_fixed_point([-10, -1, 0, 3, 10, 11, 30, 50, 100],9) == 3, assert find_fixed_point([1, 2, 3, 4, 5, 6, 7, 8],8) == -1, assert find_fixed_point([0, 2, 5, 8, 17],5) == 0",114,0.035,68,1.6764705882352942,"Prompt: Write a function find the fixed point the given array Assesments: assert find_fixed_point([-10 -1, 0, 3 10 11 30 50 100],9) == 3, assert 2 8],8 -1 2 5 8 17],5 0",0.0,0.054899457389083944
"Prompt: Write a function to find the previous palindrome of a specified number. Assesments: assert previous_palindrome(99)==88, assert previous_palindrome(1221)==1111, assert previous_palindrome(120)==111",47,0.028,23,2.0434782608695654,Prompt: Write a function find the previous palindrome a specified number Assesments assert previous_palindrome(99)==88,0.0,0.09233822284516856
"Prompt: Write a function to validate a gregorian date. Assesments: assert check_date(11,11,2002)==True, assert check_date(13,11,2002)==False, assert check_date('11','11','2002')==True",55,0.029,25,2.2,"Prompt: Write a function validate a gregorian date Assesments assert check_date(11,11,2002)==True",0.0,0.10830513884455795
"Prompt: Write a function to compute maximum product of three numbers of a given array of integers using heap queue algorithm. Assesments: assert maximum_product( [12, 74, 9, 50, 61, 41])==225700, assert maximum_product([25, 35, 22, 85, 14, 65, 75, 25, 58])==414375, assert maximum_product([18, 14, 10, 9, 8, 7, 9, 3, 2, 4, 1])==2520",126,0.036,74,1.7027027027027026,"Prompt: Write a function compute maximum product three numbers of a given array using heap queue algorithm Assesments: assert maximum_product [12 74 9 50 61 41])==225700, 35 22 85 14 65 75 25 58])==414375 14 10 9 9 3 4",0.0,0.05757541774139283
"Prompt: Write a function to find ln, m lobb number. Assesments: assert int(lobb_num(5, 3)) == 35, assert int(lobb_num(3, 2)) == 5, assert int(lobb_num(4, 2)) == 20",62,0.031,36,1.7222222222222223,"Prompt: Write a function find ln, m lobb number. Assesments: assert int(lobb_num(5, 3 35, 5 2 20",0.0,0.05956662056247119
"Prompt: Write a function to check for a number at the end of a string. Assesments: assert end_num('abcdef')==False, assert end_num('abcdef7')==True, assert end_num('abc')==False",48,0.028,22,2.1818181818181817,"Prompt: Write a function check a number at Assesments: assert end_num('abcdef')==False,",0.0,0.10645039607695207
"Prompt: Write a python function to check whether the given string is made up of two alternating characters or not. Assesments: assert is_Two_Alter(""abab"") == True, assert is_Two_Alter(""aaaa"") == False, assert is_Two_Alter(""xyz"") == False",61,0.031,34,1.7941176470588236,"Prompt: Write a python function to check whether the given string made two alternating characters or not Assesments: assert is_Two_Alter(""abab == True, False",0.0,0.06690073412065113
"Prompt: Write a function to rearrange positive and negative numbers in a given array using lambda function. Assesments: assert rearrange_numbs([-1, 2, -3, 5, 7, 8, 9, -10])==[2, 5, 7, 8, 9, -10, -3, -1], assert rearrange_numbs([10,15,14,13,-18,12,-20])==[10, 12, 13, 14, 15, -20, -18], assert rearrange_numbs([-20,20,-10,10,-30,30])==[10, 20, 30, -30, -20, -10]",157,0.037,95,1.6526315789473685,"Prompt: Write a function to rearrange positive and negative numbers in a given array using lambda function Assesments: assert rearrange_numbs([-1 2 -3, 5 7 8 -10])==[2 5, -3 -1], assert rearrange_numbs([10,15,14,13,-18,12,-20])==[10 12 13 -20 -18 20 30 -30 -10]",0.0,0.05246761973558217
"Prompt: Write a function to find if there is a triplet in the array whose sum is equal to a given value. Assesments: assert find_triplet_array([1, 4, 45, 6, 10, 8], 6, 22) == (4, 10, 8), assert find_triplet_array([12, 3, 5, 2, 6, 9], 6, 24) == (12, 3, 9), assert find_triplet_array([1, 2, 3, 4, 5], 5, 9) == (1, 3, 5)",143,0.04,85,1.6823529411764706,"Prompt: Write a function to find if there a triplet in the array whose sum equal a given value Assesments: assert find_triplet_array([1 4 45 6 10 8], 6 22) == (4 10 8), assert 3 5 2 6 9 6 2412 9 2 5 9 3 5)",0.0,0.055499521225662304
"Prompt: Write a function to find the sequences of one upper case letter followed by lower case letters. Assesments: assert text_uppercase_lowercase(""AaBbGg"")==('Found a match!'), assert text_uppercase_lowercase(""aA"")==('Not matched!'), assert text_uppercase_lowercase(""PYTHON"")==('Not matched!')",72,0.046,39,1.8461538461538463,"Prompt: Write a function find the sequences one upper case letter followed lower case letters Assesments: assert text_uppercase_lowercase(""AaBbGg"")==('Found a match!' matched!",0.0,0.07220899113653663
"Prompt: Write a function to count coin change. Assesments: assert coin_change([1, 2, 3],3,4)==4, assert coin_change([4,5,6,7,8,9],6,9)==2, assert coin_change([4,5,6,7,8,9],6,4)==1",75,0.029,25,3.0,"Prompt: Write a function count coin change Assesments assert coin_change([1 3],3,4)==4,",0.0,0.1899138206192148
"Prompt: Write a python function to multiply all items in the list. Assesments: assert multiply_list([1,-2,3]) == -6, assert multiply_list([1,2,3,4]) == 24, assert multiply_list([3,1,2,3]) == 18",63,0.032,32,1.96875,"Prompt: Write a python function multiply all items the list Assesments: assert multiply_list([1,-2,3 == -6, 24 18",0.0,0.08471512926907117
"Prompt: Write a function to remove all tuples with all none values in the given tuple list. Assesments: assert remove_tuple([(None, 2), (None, None), (3, 4), (12, 3), (None, )] ) == '[(None, 2), (3, 4), (12, 3)]', assert remove_tuple([(None, None), (None, None), (3, 6), (17, 3), (None,1 )] ) == '[(3, 6), (17, 3), (None, 1)]', assert remove_tuple([(1, 2), (2, None), (3, None), (24, 3), (None, None )] ) == '[(1, 2), (2, None), (3, None), (24, 3)]'",186,0.058,110,1.690909090909091,"Prompt: Write a function to remove all tuples with all none values in the given tuple list. Assesments: assert remove_tuple([(None, 2), (None None), (3, 4),12 3None )] ) == '[(None 2 (3)]', assert remove_tuple([(None NoneNone3 617 3None,1 )] ) '[3 617 3), 1 assert remove_tuple([(1 22 None3 None24 3None None )] )1 2224)]'",0.0,0.05637234135159446
"Prompt: Write a function to perform chunking of tuples each of size n. Assesments: assert chunk_tuples((10, 4, 5, 6, 7, 6, 8, 3, 4), 3) == [(10, 4, 5), (6, 7, 6), (8, 3, 4)], assert chunk_tuples((1, 2, 3, 4, 5, 6, 7, 8, 9), 2) == [(1, 2), (3, 4), (5, 6), (7, 8), (9,)], assert chunk_tuples((11, 14, 16, 17, 19, 21, 22, 25), 4) == [(11, 14, 16, 17), (19, 21, 22, 25)]",201,0.047,109,1.8440366972477065,"Prompt: Write a function to perform chunking of tuples each of size n. Assesments: assert chunk_tuples((10 4, 5, 6, 6 8 3 4), 3) == [(10), (6, 68 3,)], assert chunk_tuples((1 2,, 8 9 21),,5 67 8)9,) chunk_tuples((11 14 16 19 21 25 4),19 21,, 25",0.0,0.07199301897234822
"Prompt: Write a function to find a pair with the highest product from a given array of integers. Assesments: assert max_product([1, 2, 3, 4, 7, 0, 8, 4])==(7, 8), assert max_product([0, -1, -2, -4, 5, 0, -6])==(-4, -6), assert max_product([1, 3, 5, 6, 8, 9])==(8,9)",114,0.035,71,1.6056338028169015,"Prompt: Write a function find a pair with the highest product from a given array of integers Assesments: assert max_product([1 7 0 8 4])==(7 8), -1 -4 5 0 -6])==(-4 -6 3 5 8 9])==(8,9)",0.0,0.04767333654014737
"Prompt: Write a function to find the length of the shortest string that has both str1 and str2 as subsequences. Assesments: assert super_seq(""AGGTAB"", ""GXTXAYB"", 6, 7) == 9, assert super_seq(""feek"", ""eke"", 4, 3) == 5, assert super_seq(""PARRT"", ""RTA"", 5, 3) == 6",94,0.034,67,1.4029850746268657,"Prompt: Write a function to find the length the shortest string that has both str1 as subsequences Assesments: assert super_seq(""AGGTAB ""GXTXAYB 6 7 == 9, super_seq(""feekeke 4 3 5 super_seq(""PARRTRTA 5 3",0.0,0.02700096707652291
"Prompt: Write a function to find maximum of two numbers. Assesments: assert max_of_two(10,20)==20, assert max_of_two(19,15)==19, assert max_of_two(-10,-20)==-10",49,0.028,21,2.3333333333333335,"Prompt: Write a function find maximum of Assesments assert max_of_two(10,20)==20",0.0,0.12190658580700076
"Prompt: Write a python function to calculate the product of all the numbers of a given tuple. Assesments: assert mutiple_tuple((4, 3, 2, 2, -1, 18)) == -864, assert mutiple_tuple((1,2,3)) == 6, assert mutiple_tuple((-2,-4,-6)) == -48",78,0.034,42,1.8571428571428572,"Prompt: Write a python function calculate the product all the numbers of a given tuple Assesments: assert mutiple_tuple((4 3 -1 18 -864, assert)) 6, -48",0.0,0.07332998951256213
"Prompt: Write a function to find n-th rencontres number. Assesments: assert rencontres_number(7, 2) == 924, assert rencontres_number(3, 0) == 2, assert rencontres_number(3, 1) == 3",54,0.032,31,1.7419354838709677,"Prompt: Write a function to find n-th rencontres number. Assesments: assert rencontres_number(7 2 == 924, 0 2",0.0,0.06157758718326246
"Prompt: Write a function to calculate the height of the given binary tree. Assesments: assert (max_height(root)) == 3, assert (max_height(root1)) == 5 , assert (max_height(root2)) == 4",50,0.03,34,1.4705882352941178,"Prompt: Write a function calculate the height the given binary tree Assesments: assert (max_height(root 3, assertmax_height(root1 5 , 4",0.0,0.03389722310884137
"Prompt: Write a function to convert a date of yyyy-mm-dd format to dd-mm-yyyy format. Assesments: assert change_date_format('2026-01-02')=='02-01-2026', assert change_date_format('2021-01-04')=='04-01-2021', assert change_date_format('2030-06-06')=='06-06-2030'",84,0.034,42,2.0,Prompt: Write a function to convert a date of yyyy-mm-dd format dd-mm-yyyy format. Assesments: assert change_date_format('2026-0102')=='02-012026 assert06',0.0,0.0879029684008937
"Prompt: Write a function to count repeated items of a tuple. Assesments: assert count_tuplex((2, 4, 5, 6, 2, 3, 4, 4, 7),4)==3, assert count_tuplex((2, 4, 5, 6, 2, 3, 4, 4, 7),2)==2, assert count_tuplex((2, 4, 7, 7, 7, 3, 4, 4, 7),7)==4",124,0.034,65,1.9076923076923078,"Prompt: Write a function to count repeated items of a tuple. Assesments: assert count_tuplex((2, 4, 5, 6, 2, 3 4 4 7),4)==3, assert 7),2)==2 7 7 7 3",0.0,0.07848658204227946
"Prompt: Write a function that matches a string that has an a followed by zero or more b's by using regex. Assesments: assert text_match(""msb"") == 'Not matched!', assert text_match(""a0c"") == 'Found a match!', assert text_match(""abbc"") == 'Found a match!'",67,0.033,49,1.3673469387755102,"Prompt: Write a function matches a string that has an a followed zero or more b's by using regex. Assesments: assert text_match(""msb 'Not matched! assert text_match(""a0cFound text_match(""abbc",0.0,0.023365490466853826
"Prompt: Write a function to calculate the sum of series 1³+2³+3³+….+n³. Assesments: assert sum_series(7)==784, assert sum_series(5)==225, assert sum_series(15)==14400",54,0.03,21,2.5714285714285716,Prompt: Write a function calculate….+n. Assesments: assert sum_series(7)==784,0.0,0.14619488395422006
"Prompt: Write a function to remove duplicate words from a given list of strings. Assesments: assert remove_duplic_list([""Python"", ""Exercises"", ""Practice"", ""Solution"", ""Exercises""])==['Python', 'Exercises', 'Practice', 'Solution'], assert remove_duplic_list([""Python"", ""Exercises"", ""Practice"", ""Solution"", ""Exercises"",""Java""])==['Python', 'Exercises', 'Practice', 'Solution', 'Java'], assert remove_duplic_list([""Python"", ""Exercises"", ""Practice"", ""Solution"", ""Exercises"",""C++"",""C"",""C++""])==['Python', 'Exercises', 'Practice', 'Solution','C++','C']",137,0.042,89,1.5393258426966292,"Prompt: Write a function to remove duplicate words from a given list of strings. Assesments: assert remove_duplic_list([""Python"", ""Exercises"", ""Practice"", ""Solution"", ""Exercises""])==['Python', '',Practice','], assert remove_duplic_list([""Python ""Exercises"",Exercises"",""Java""])==['Python',Java' assertExercises"",""C++"",""C"",""C++""])==['PythonSolution','C++','C']",0.0,0.04090920501941994
"Prompt: Write a function to convert camel case string to snake case string by using regex. Assesments: assert camel_to_snake('GoogleAssistant') == 'google_assistant', assert camel_to_snake('ChromeCast') == 'chrome_cast', assert camel_to_snake('QuadCore') == 'quad_core'",65,0.032,42,1.5476190476190477,Prompt: Write a function to convert camel case string snake case string by using regex. Assesments: assert camel_to_snake('GoogleAssistant ==google_assistant assert camel_to_snake('QuadCore',0.0,0.04175520192117703
"Prompt: Write a function to find the nth delannoy number. Assesments: assert dealnnoy_num(3, 4) == 129, assert dealnnoy_num(3, 3) == 63, assert dealnnoy_num(4, 5) == 681",62,0.032,37,1.6756756756756757,"Prompt: Write a function find the nth delannoy number. Assesments: assert dealnnoy_num(3 4 129, 3 63 5 681",0.0,0.05481836768143822
"Prompt: Write a function to calculate the sum of series 1²+2²+3²+….+n². Assesments: assert series_sum(6)==91, assert series_sum(7)==140, assert series_sum(12)==650",53,0.031,22,2.409090909090909,Prompt: Write a function calculate series….+n². Assesments assert series_sum(6)==91,0.0,0.12963468067202508
"Prompt: Write a function to re-arrange the given tuples based on the given ordered list. Assesments: assert re_arrange_tuples([(4, 3), (1, 9), (2, 10), (3, 2)],  [1, 4, 2, 3]) == [(1, 9), (4, 3), (2, 10), (3, 2)], assert re_arrange_tuples([(5, 4), (2, 10), (3, 11), (4, 3)],  [3, 4, 2, 3]) == [(3, 11), (4, 3), (2, 10), (3, 11)], assert re_arrange_tuples([(6, 3), (3, 8), (5, 7), (2, 4)],  [2, 5, 3, 6]) == [(2, 4), (5, 7), (3, 8), (6, 3)]",227,0.051,134,1.6940298507462686,"Prompt: Write a function to re-arrange the given tuples based the given ordered list. Assesments: assert re_arrange_tuples([(4, 3), (1 9), (2 103 2)], [1 4, 2, 3]) == [(1 9),4 32 10], assert re_arrange_tuples([(5 42 103 11 3)3 4, 2,3 114 32 10 11) assert 33 8)5 72 4)2 5 3, 62 45 73 8)6 3)]",0.0,0.05669069272215366
"Prompt: Write a function to count the most common character in a given string. Assesments: assert max_char(""hello world"")==('l'), assert max_char(""hello "")==('l'), assert max_char(""python pr"")==('p')",50,0.031,37,1.3513513513513513,"Prompt: Write a function to count the most common character a given string Assesments: assert max_char(""hello world"")==('l "")l max_char(""python pr"")==('p",0.0,0.02173376696198272
"Prompt: Write a function to find three closest elements from three sorted arrays. Assesments: assert find_closet([1, 4, 10],[2, 15, 20],[10, 12],3,3,2) == (10, 15, 10), assert find_closet([20, 24, 100],[2, 19, 22, 79, 800],[10, 12, 23, 24, 119],3,5,5) == (24, 22, 23), assert find_closet([2, 5, 11],[3, 16, 21],[11, 13],3,3,2) == (11, 16, 11)",163,0.038,100,1.63,"Prompt: Write a function find three closest elements from three sorted arrays Assesments: assert find_closet([1 4 10],[2 15 20],[10 12],3,3,2) == (10 15 10 assert 24 100],[2 19 22, 79, 800],[10 23 24 119],3,5,524 22 23 5 16 21],[11 16 11)",0.0,0.05015895308011489
"Prompt: Write a function to sort a list of dictionaries using lambda function. Assesments: assert sorted_models([{'make':'Nokia', 'model':216, 'color':'Black'}, {'make':'Mi Max', 'model':2, 'color':'Gold'}, {'make':'Samsung', 'model': 7, 'color':'Blue'}])==[{'make': 'Nokia', 'model': 216, 'color': 'Black'}, {'make': 'Samsung', 'model': 7, 'color': 'Blue'}, {'make': 'Mi Max', 'model': 2, 'color': 'Gold'}], assert sorted_models([{'make':'Vivo', 'model':20,'color':'Blue'},{'make': 'oppo','model':17,'color':'Gold'},{'make':'Apple','model':11,'color':'red'}])==([{'make':'Vivo', 'model':20,'color':'Blue'},{'make': 'oppo','model':17,'color':'Gold'},{'make':'Apple','model':11,'color':'red'}]), assert sorted_models([{'make':'micromax','model':40,'color':'grey'},{'make':'poco','model':60,'color':'blue'}])==([{'make':'poco','model':60,'color':'blue'},{'make':'micromax','model':40,'color':'grey'}])",295,0.06,212,1.3915094339622642,"Prompt: Write a function to sort a list of dictionaries using lambda function. Assesments: assert sorted_models([{'make':'Nokia', 'model':216,color':'Black'}, {make':'Mi Max',model':2,color':'Gold'},make':'Samsung', 7,color':'Blue'}])==[{'make 'Nokiamodel 216 'Black 'Samsung 7 'Blue}, 'Mi Max 2 'Gold}], assert sorted_models([{'make':'Vivo',model':20,'color':'Blue'},{'make 'oppo','model':17,'color':'Gold'},{'make':'Apple','model':11,'color':'red'}])==([{'make':'Vivo ']), assert sorted_models([{'make':'micromax','model':40,'color':'grey'},{'make':'poco','model':60,'color':'blue'}])==([{'make':'poco','model':60,'color':'blue'},{'make':'micromax','model':40,'color':'grey}])",0.0,0.025830327192575688
"Prompt: Write a function to sort the given array by using heap sort. Assesments: assert heap_sort([12, 2, 4, 5, 2, 3]) == [2, 2, 3, 4, 5, 12], assert heap_sort([32, 14, 5, 6, 7, 19]) == [5, 6, 7, 14, 19, 32], assert heap_sort([21, 15, 29, 78, 65]) == [15, 21, 29, 65, 78]",133,0.038,81,1.6419753086419753,"Prompt: Write a function to sort the given array by using heap sort Assesments: assert heap_sort([12 2 4 5 2 3 == [2 2 12], assert heap_sort([32 14 5 6 7 195 14 19, 32 15 29 78 6515 21 29 65 78]",0.0,0.05138056452026023
"Prompt: Write a function to count the elements in a list until an element is a tuple. Assesments: assert count_elim([10,20,30,(10,20),40])==3, assert count_elim([10,(20,30),(10,20),40])==1, assert count_elim([(10,(20,30,(10,20),40))])==0",83,0.03,34,2.4411764705882355,"Prompt: Write a function count the elements until a tuple Assesments assert count_elim([10,20,30,(10,20),40])==3,",0.0,0.1329077561442707
"Prompt: Write a function to check if any list element is present in the given list. Assesments: assert check_element((4, 5, 7, 9, 3),  [6, 7, 10, 11]) == True, assert check_element((1, 2, 3, 4),  [4, 6, 7, 8, 9]) == True, assert check_element((3, 2, 1, 4, 5),  [9, 8, 7, 6]) == False",123,0.037,66,1.8636363636363635,"Prompt: Write a function to check any list element present the given list. Assesments: assert check_element((4, 5, 7, 9, 3), [6 7 10]) == True, assert4 6 2 1 4,9 8 7 6 False",0.0,0.0739923976438499
"Prompt: Write a function to combine two given sorted lists using heapq module. Assesments: assert combine_lists([1, 3, 5, 7, 9, 11],[0, 2, 4, 6, 8, 10])==[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11], assert combine_lists([1, 3, 5, 6, 8, 9], [2, 5, 7, 11])==[1,2,3,5,5,6,7,8,9,11], assert combine_lists([1,3,7],[2,4,6])==[1,2,3,4,6,7]",180,0.038,124,1.4516129032258065,"Prompt: Write a function to combine two given sorted lists using heapq module. Assesments: assert combine_lists([1 3, 5, 7 9 11],[0 2 4 6 8 10])==[0 1 8,], assert 6 8], [2 5 7 11])==[1,2,3,5,5,6,7,8,9,11 combine_lists([1,3,7],[2,4,6])==[1,2,3,4,6,7]",0.0,0.031961533313427305
"Prompt: Write a function to separate and print the numbers and their position of a given string. Assesments: assert num_position(""there are 70 flats in this apartment"")==10, assert num_position(""every adult have 32 teeth"")==17, assert num_position(""isha has 79 chocolates in her bag"")==9",65,0.032,35,1.8571428571428572,"Prompt: Write a function separate and print their position of Assesments assert num_position(""there 70 flats apartment"")==10 have 32 teeth"")==17 79 chocolates in",0.0,0.07332998951256213
"Prompt: Write a function to convert the given tuples into set. Assesments: assert tuple_to_set(('x', 'y', 'z') ) == {'y', 'x', 'z'}, assert tuple_to_set(('a', 'b', 'c') ) == {'c', 'a', 'b'}, assert tuple_to_set(('z', 'd', 'e') ) == {'d', 'e', 'z'}",89,0.041,54,1.6481481481481481,"Prompt: Write a function to convert the given tuples into set. Assesments: assert tuple_to_set(('x', 'y', '') ) == {'y',xz'}, assert tuple_to_set(('ac' tuple_to_set(('z 'd',e'dz}",0.0,0.05201026113889184
"Prompt: Write a function to find the most common elements and their counts of a specified text. Assesments: assert most_common_elem('lkseropewdssafsdfafkpwe',3)==[('s', 4), ('e', 3), ('f', 3)] , assert most_common_elem('lkseropewdssafsdfafkpwe',2)==[('s', 4), ('e', 3)], assert most_common_elem('lkseropewdssafsdfafkpwe',7)==[('s', 4), ('e', 3), ('f', 3), ('k', 2), ('p', 2), ('w', 2), ('d', 2)]",153,0.045,85,1.8,"Prompt: Write a function to find the most common elements and their counts of a specified text. Assesments: assert most_common_elem('lkseropewdssafsdfafkpwe',3)==[('s', 4),e 3f 3)] , assert's 4e 3) assert 4e),k 2),p 2),w 2),'d 2)]",0.0,0.06750079795722949
"Prompt: Write a python function to find the length of the shortest word. Assesments: assert len_log([""win"",""lose"",""great""]) == 3, assert len_log([""a"",""ab"",""abc""]) == 1, assert len_log([""12"",""12"",""1234""]) == 2",61,0.031,50,1.22,"Prompt: Write a python function find the length the shortest word. Assesments: assert len_log([""win"",""lose"",""great) 3, assert len_log([""a"",""ab"",""abc 1 len_log([""12"",""12"",""1234",0.0,0.00833450367060325
"Prompt: Write a function to get an item of a tuple. Assesments: assert get_item((""w"", 3, ""r"", ""e"", ""s"", ""o"", ""u"", ""r"", ""c"", ""e""),3)==('e'), assert get_item((""w"", 3, ""r"", ""e"", ""s"", ""o"", ""u"", ""r"", ""c"", ""e""),-4)==('u'), assert get_item((""w"", 3, ""r"", ""e"", ""s"", ""o"", ""u"", ""r"", ""c"", ""e""),-3)==('r')",133,0.042,82,1.6219512195121952,"Prompt: Write a function to get an item of a tuple. Assesments: assert get_item((""w"", 3, ""r"", ""e"", ""s"", ""o"", ""u"", ""r"", ""c"", ""e""),3)==('e'), assert get_item((""w 3ree""),-4)==('u'), assert 3 ""e""),-3)==('r')",0.0,0.04933789012323574
"Prompt: Write a function to sort the given tuple list basis the total digits in tuple. Assesments: assert sort_list([(3, 4, 6, 723), (1, 2), (12345,), (134, 234, 34)] ) == '[(1, 2), (12345,), (3, 4, 6, 723), (134, 234, 34)]', assert sort_list([(3, 4, 8), (1, 2), (1234335,), (1345, 234, 334)] ) == '[(1, 2), (3, 4, 8), (1234335,), (1345, 234, 334)]', assert sort_list([(34, 4, 61, 723), (1, 2), (145,), (134, 23)] ) == '[(1, 2), (145,), (134, 23), (34, 4, 61, 723)]'",219,0.052,119,1.8403361344537814,"Prompt: Write a function to sort the given tuple list basis the total digits in tuple. Assesments: assert sort_list([(3, 4, 6, 723), (1 2),12345,), (134, 234, 34)] ) == '[(1 2),12345),3 4,),134', assert sort_list([(3 8),11234335,1345, 234 334 )131234335 sort_list([(34 4 61, 7231145,),134 23)]145134), (34)]'",0.0,0.07161552140805251
"Prompt: Write a function to display sign of the chinese zodiac for given year. Assesments: assert chinese_zodiac(1997)==('Ox'), assert chinese_zodiac(1998)==('Tiger'), assert chinese_zodiac(1994)==('Dog')",53,0.031,28,1.8928571428571428,Prompt: Write a function display sign of the chinese zodiac for given year Assesments: assert chinese_zodiac(1997)==('Ox,0.0,0.07697323423464501
"Prompt: Write a function to find the maximum of similar indices in two lists of tuples. Assesments: assert max_similar_indices([(2, 4), (6, 7), (5, 1)],[(5, 4), (8, 10), (8, 14)]) == [(5, 4), (8, 10), (8, 14)], assert max_similar_indices([(3, 5), (7, 8), (6, 2)],[(6, 5), (9, 11), (9, 15)]) == [(6, 5), (9, 11), (9, 15)], assert max_similar_indices([(4, 6), (8, 9), (7, 3)],[(7, 6), (10, 12), (10, 16)]) == [(7, 6), (10, 12), (10, 16)]",202,0.05,120,1.6833333333333333,"Prompt: Write a function to find the maximum of similar indices in two lists of tuples. Assesments: assert max_similar_indices([(2, 4), (6 7), (5 1)],[(5 48 10),8 14)]) == [(5 48 108)], assert max_similar_indices([(3 57 8)6 2)],[(6 59 119 15]) ==6 59 11 max_similar_indices([(4 68 97 3)],[(7 610 1210 16])710 12)]",0.0,0.055599531865092026
"Prompt: Write a function to compute the value of ncr mod p. Assesments: assert nCr_mod_p(10, 2, 13) == 6, assert nCr_mod_p(11, 3, 14) == 11, assert nCr_mod_p(18, 14, 19) == 1",72,0.032,43,1.6744186046511629,"Prompt: Write a function compute the value ncr mod p. Assesments: assert nCr_mod_p(10 2 13 6, 3 14 11 14 19 1",0.0,0.05469013279492871
"Prompt: Write a python function to find the minimun number of subsets with distinct elements. Assesments: assert subset([1, 2, 3, 4],4) == 1, assert subset([5, 6, 9, 3, 4, 3, 4],7) == 2, assert subset([1, 2, 3 ],3) == 1",87,0.034,52,1.6730769230769231,"Prompt: Write a python function find the minimun number subsets with distinct elements Assesments: assert subset([1 4],4) == 1, subset([5 9 3, 3 4],7 2 ],3 1",0.0,0.05455326671413489
"Prompt: Write a function that gives profit amount if the given amount has profit else return none. Assesments: assert profit_amount(1500,1200)==300, assert profit_amount(100,200)==None, assert profit_amount(2000,5000)==None",56,0.031,26,2.1538461538461537,"Prompt: Write a function gives profit amount if profit else none Assesments assert profit_amount(1500,1200)==300",0.0,0.1035969456652508
"Prompt: Write a function to find out, if the given number is abundant. Assesments: assert is_abundant(12)==True, assert is_abundant(13)==False, assert is_abundant(9)==False",46,0.028,23,2.0,"Prompt: Write a function find, the given number abundant Assesments: assert is_abundant(12)==True",0.0,0.0879029684008937
"Prompt: Write a function to split the given string at uppercase letters by using regex. Assesments: assert split_list(""LearnToBuildAnythingWithGoogle"") == ['Learn', 'To', 'Build', 'Anything', 'With', 'Google'], assert split_list(""ApmlifyingTheBlack+DeveloperCommunity"") == ['Apmlifying', 'The', 'Black+', 'Developer', 'Community'], assert split_list(""UpdateInTheGoEcoSystem"") == ['Update', 'In', 'The', 'Go', 'Eco', 'System']",112,0.041,76,1.4736842105263157,"Prompt: Write a function to split the given string at uppercase letters by using regex. Assesments: assert split_list(""LearnToBuildAnythingWithGoogle"") == ['Learn',To',BuildAnythingWithGoogle'], assert split_list(""ApmlifyingTheBlack+DeveloperCommunity',TheBlack+',DeveloperCommunity' split_list(""UpdateInTheGoEcoSystemInTheGoSystem']",0.0,0.0342130461807247
"Prompt: Write a python function to get the position of rightmost set bit. Assesments: assert get_First_Set_Bit_Pos(12) == 3, assert get_First_Set_Bit_Pos(18) == 2, assert get_First_Set_Bit_Pos(16) == 5",61,0.03,33,1.8484848484848484,"Prompt: Write a python function get the position rightmost set bit Assesments: assert get_First_Set_Bit_Pos(12 3, 2 5",0.0,0.07244677867084505
"Prompt: Write a function to convert an integer into a roman numeral. Assesments: assert int_to_roman(1)==(""I""), assert int_to_roman(50)==(""L""), assert int_to_roman(4)==(""IV"")",51,0.029,26,1.9615384615384615,"Prompt: Write a function to convert an integer into roman Assesments: assert int_to_roman(1)==(""I""),",0.0,0.08397947408480443
"Prompt: Write a python function to find the average of a list. Assesments: assert Average([15, 9, 55, 41, 35, 20, 62, 49]) == 35.75, assert Average([4, 5, 1, 2, 9, 7, 10, 8]) == 5.75, assert Average([1,2,3]) == 2",94,0.033,58,1.6206896551724137,"Prompt: Write a python function find the average of a list. Assesments: assert Average([15 9 55 41 35 20 62 49 35.75, Average([4 5 1 9 7 10 8]) 2",0.0,0.04920919686980638
"Prompt: Write a function to solve tiling problem. Assesments: assert get_noOfways(4)==3, assert get_noOfways(3)==2, assert get_noOfways(5)==5",44,0.028,21,2.0952380952380953,Prompt: Write a function solve tiling problem Assesments assert get_noOfways(4)==3,0.0,0.09761828765978144
"Prompt: Write a function to convert a roman numeral to an integer. Assesments: assert roman_to_int('MMMCMLXXXVI')==3986, assert roman_to_int('MMMM')==4000, assert roman_to_int('C')==100",53,0.028,27,1.962962962962963,"Prompt: Write a function convert a roman Assesments: assert roman_to_int('MMMCMLXXXVI')==3986,",0.0,0.08412478868910404
"Prompt: Write a python function to find the sum of all even natural numbers within the range l and r. Assesments: assert sum_Even(2,5) == 6, assert sum_Even(3,8) == 18, assert sum_Even(4,6) == 10",64,0.03,36,1.7777777777777777,"Prompt: Write a python function find the sum all even natural numbers within the range l and Assesments assert sum_Even(2,5 6, 18 10",0.0,0.06523389013015568
"Prompt: Write a function to calculate the discriminant value. Assesments: assert discriminant_value(4,8,2)==(""Two solutions"",32), assert discriminant_value(5,7,9)==(""no real solution"",-131), assert discriminant_value(0,0,9)==(""one solution"",0)",68,0.031,46,1.4782608695652173,"Prompt: Write a function calculate the discriminant value Assesments: assert discriminant_value(4,8,2)==(""Two solutions"",32 discriminant_value(5,7,9)==(""no real solution"",-131",0.0,0.03467991506959574
"Prompt: Write a python function to check whether the length of the word is even or not. Assesments: assert word_len(""program"") == False, assert word_len(""solution"") == True, assert word_len(""data"") == True",49,0.031,32,1.53125,"Prompt: Write a python function check whether the length the word even or not Assesments: assert word_len(""program False, assert word_len(""solution True",0.0,0.040085381423555694
"Prompt: Write a function to convert camel case string to snake case string. Assesments: assert camel_to_snake('PythonProgram')==('python_program'), assert camel_to_snake('pythonLanguage')==('python_language'), assert camel_to_snake('ProgrammingLanguage')==('programming_language')",62,0.029,31,2.0,Prompt: Write a function to convert camel case string snake case string. Assesments: assert camel_to_snake('PythonProgram')==('python_program,0.0,0.0879029684008937
"Prompt: Write a function to remove an empty tuple from a list of tuples. Assesments: assert remove_empty([(), (), ('',), ('a', 'b'), ('a', 'b', 'c'), ('d')])==[('',), ('a', 'b'), ('a', 'b', 'c'), 'd']  , assert remove_empty([(), (), ('',), (""python""), (""program"")])==[('',), (""python""), (""program"")]  , assert remove_empty([(), (), ('',), (""java"")])==[('',),(""java"") ]",121,0.044,73,1.6575342465753424,"Prompt: Write a function to remove an empty tuple from a list of tuples. Assesments: assert remove_empty([(), (), ('',), ('a 'bab',d')])==[('',),a 'd'] , assert (), (""python""), (""program"")])=='', (""] , (),'',java"")])==[('',),(""java ]",0.0,0.05296774503845497
"Prompt: Write a python function to accept the strings which contains all vowels. Assesments: assert check(""SEEquoiaL"") == 'accepted', assert check('program') == ""not accepted"", assert check('fine') == ""not accepted""",52,0.031,39,1.3333333333333333,"Prompt: Write a python function accept the strings which contains all vowels. Assesments: assert check(""SEEquoiaL 'accepted assert check('program') ""not check('fine accepted",0.0,0.019895733588679635
"Prompt: Write a python function to find maximum possible value for the given periodic function. Assesments: assert floor_Max(11,10,9) == 9, assert floor_Max(5,7,4) == 2, assert floor_Max(2,2,1) == 1",62,0.03,35,1.7714285714285714,"Prompt: Write a python function find maximum possible value the given periodic function Assesments: assert floor_Max(11,10,9) 9, 2 1",0.0,0.06458620217956317
"Prompt: Write a function to join the tuples if they have similar initial elements. Assesments: assert join_tuples([(5, 6), (5, 7), (6, 8), (6, 10), (7, 13)] ) == [(5, 6, 7), (6, 8, 10), (7, 13)], assert join_tuples([(6, 7), (6, 8), (7, 9), (7, 11), (8, 14)] ) == [(6, 7, 8), (7, 9, 11), (8, 14)], assert join_tuples([(7, 8), (7, 9), (8, 10), (8, 12), (9, 15)] ) == [(7, 8, 9), (8, 10, 12), (9, 15)]",200,0.049,113,1.7699115044247788,"Prompt: Write a function to join the tuples if they have similar initial elements. Assesments: assert join_tuples([(5, 6), (5 766 107 13)] ) == [(5 6, 7 8, 10),7)], assert join_tuples([(6 76 8)7 97 118 14 ) [(6 7, 8)7, 11 14) 8) 98 108 129 157 8 98 10, 129 15)]",0.0,0.06443144488163399
"Prompt: Write a function to find minimum of two numbers. Assesments: assert min_of_two(10,20)==10, assert min_of_two(19,15)==15, assert min_of_two(-10,-20)==-20",49,0.028,23,2.130434782608696,"Prompt: Write a function find minimum of two numbers Assesments assert min_of_two(10,20)==10",0.0,0.10120873173371821
"Prompt: Write a function to find the maximum number of segments of lengths a, b and c that can be formed from n. Assesments: assert maximum_segments(7, 5, 2, 5) == 2, assert maximum_segments(17, 2, 1, 3) == 17, assert maximum_segments(18, 16, 3, 6) == 6",86,0.033,51,1.6862745098039216,"Prompt: Write a function find the maximum number segments of lengths a, that formed n. Assesments: assert maximum_segments(7 5 2 5 2 2 1 3 17 16 3 6 6",0.0,0.055899563783381206
"Prompt: Write a function to concatenate the given two tuples to a nested tuple. Assesments: assert concatenate_nested((3, 4), (5, 6)) == (3, 4, 5, 6), assert concatenate_nested((1, 2), (3, 4)) == (1, 2, 3, 4), assert concatenate_nested((4, 5), (6, 8)) == (4, 5, 6, 8)",104,0.037,55,1.8909090909090909,"Prompt: Write a function to concatenate the given two tuples to a nested tuple. Assesments: assert concatenate_nested((3, 4), (5)) == (3, 5,), assert concatenate_nested((1))1,6, 8) 8)",0.0,0.07677451179525867
"Prompt: Write a python function to left rotate the string. Assesments: assert left_rotate(""python"",2) == ""thonpy""   , assert left_rotate(""bigdata"",3 ) == ""databig"" , assert left_rotate(""hadoop"",1 ) == ""adooph""",61,0.031,34,1.7941176470588236,"Prompt: Write a python function left rotate the string Assesments: assert left_rotate(""python"",2 ""thonpy , ) ""databig ""adooph""",0.0,0.06690073412065113
"Prompt: Write a function to find the minimum total path sum in the given triangle. Assesments: assert min_sum_path([[ 2 ], [3, 9 ], [1, 6, 7 ]]) == 6, assert min_sum_path([[ 2 ], [3, 7 ], [8, 5, 6 ]]) == 10 , assert min_sum_path([[ 3 ], [6, 4 ], [5, 2, 7 ]]) == 9",104,0.037,63,1.6507936507936507,"Prompt: Write a function to find the minimum total path sum in the given triangle Assesments: assert min_sum_path([[ 2 ],3, 91 6, 7 ] == 6, 78 5, 6 10 , 36 45 2, 7 9",0.0,0.05228013111830538
"Prompt: Write a function to find the minimum total path sum in the given triangle. Assesments: assert min_sum_path([[ 2 ], [3, 9 ], [1, 6, 7 ]]) == 6, assert min_sum_path([[ 2 ], [3, 7 ], [8, 5, 6 ]]) == 10 , assert min_sum_path([[ 3 ], [6, 4 ], [5, 2, 7 ]]) == 9",104,0.047,63,1.6507936507936507,"Prompt: Write a function to find the minimum total path sum in the given triangle Assesments: assert min_sum_path([[ 2 ],3, 91 6, 7 ] == 6, 78 5, 6 10 , 36 45 2, 7 9",0.0,0.05228013111830538