original_text,compressed_text,prompt_tokens,compressed_tokens,tokens_saved,compression_time,compression_ratio,runtime_date,gpt_o1_saving,avg_distance_interrogative_words,compression_ratio_normalized,memory_used_kb
"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",Prompt:Write function find minimum cost path reach n 0 0 given cost matrix cost position n 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,106,61,0.002,1.575,2025/11/05 17:15:56,0.0,0.0,0.6130167106420404,75.901
"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)",Prompt:Write function find similar elements 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,88,32,0.001,1.364,2025/11/05 17:15:56,0.0,0.0,0.4274406332453827,59.879
"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",Prompt:Write python function identify non-prime numbers. Assesments:assert is_not_prime 2 == False assert is_not_prime 10 == True assert is_not_prime 35 == True,46,39,7,0.001,1.179,2025/11/05 17:15:56,0.0,0.0,0.2647317502198769,32.875
"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]","Prompt:Write function find largest integers given list 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,117,45,0.001,1.385,2025/11/05 17:15:56,0.0,0.0,0.445910290237467,72.618
"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",Prompt:Write function find number ways fill 2 x 1 dominoes given3xn board. Assesments:assert count_ways 2 ==3 assert count_ways 8 == 153 assert count_ways 12 == 2131,68,51,17,0.001,1.333,2025/11/05 17:15:56,0.0,0.0,0.4001759014951626,34.88
"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","Prompt:Write python function check whether two numbers differ one bit position 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,64,11,0.001,1.172,2025/11/05 17:15:56,0.0,0.0,0.258575197889182,34.598
"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']",Prompt:Write function find words which are at least 4 characters long string using regex. Assesments:assert find_char_long 'Please move back stream' == 'Please' 'move' 'back' 'stream' assert find_char_long 'Jing Eco Tech' == 'Jing' 'Tech' assert find_char_long 'Jhingai wulu road Zone 3' == 'Jhingai' 'wulu' 'road' 'Zone',102,94,8,0.001,1.085,2025/11/05 17:15:56,0.0,3.0,0.1820580474934036,44.638
"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])","Prompt:Write function find squares individual elements 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,89,29,0.001,1.326,2025/11/05 17:15:56,0.0,0.0,0.3940193491644679,52.818
"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",Prompt:Write python function find minimum number rotations required get string. Assesments:assert find_Rotations aaaa ==1 assert find_Rotations ab ==2 assert find_Rotations abc ==3,59,42,17,0.001,1.405,2025/11/05 17:15:56,0.0,0.0,0.4635004397537379,34.797
"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]","Prompt:Write function get n smallest items 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,121,38,0.001,1.314,2025/11/05 17:15:56,0.0,0.0,0.3834652594547054,70.0
"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""",Prompt:Write python function remove first last occurrence given character string. Assesments:assert remove_Occ hello l == heo assert remove_Occ abcda == bcd assert remove_Occ PHP P ==H,65,43,22,0.001,1.512,2025/11/05 17:15:56,0.0,0.0,0.5576077396657871,35.079
"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]]","Prompt:Write function sort given matrix ascending order according sum 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,137,55,0.002,1.401,2025/11/05 17:15:56,0.0,0.0,0.4599824098504837,80.032
"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)]",Prompt:Write function count common words 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,222,-6,0.003,0.973,2025/11/05 17:15:56,-0.0,0.0,0.0835532102022866,75.667
"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","Prompt:Write python function find volume 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,54,12,0.001,1.222,2025/11/05 17:15:56,0.0,0.0,0.3025505716798592,33.654
"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']",Prompt:Write function split string 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,84,6,0.001,1.071,2025/11/05 17:15:56,0.0,0.0,0.169744942832014,44.905
"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!')",Prompt:Write function find sequences lowercase letters joined underscore. Assesments:assert text_lowercase_underscore aab_cbbbc == 'Found match! assert text_lowercase_underscore aab_Abbbc == 'Not matched! assert text_lowercase_underscore Aaab_abbbc == 'Not matched!,74,62,12,0.001,1.194,2025/11/05 17:15:56,0.0,0.0,0.2779243623570799,35.449
"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",Prompt:Write function find perimeter square. Assesments:assert square_perimeter 10 ==40 assert square_perimeter 5 ==20 assert square_perimeter 4 ==16,43,36,7,0.001,1.194,2025/11/05 17:15:56,0.0,0.0,0.2779243623570799,33.675
"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' ",Prompt:Write function remove characters first string which are present second string. Assesments:assert remove_dirty_chars probasscurve pros == 'bacuve' assert remove_dirty_chars digitalindia talent == 'digiidi' assert remove_dirty_chars exoticmiles toxic == 'emles',79,57,22,0.001,1.386,2025/11/05 17:15:56,0.0,2.0,0.4467897977132805,36.597
"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","Prompt:Write function find whether given array integers contains 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,70,11,0.001,1.157,2025/11/05 17:15:56,0.0,0.0,0.2453825857519789,34.591
"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",Prompt:Write function check if the given number is woodball not. Assesments:assert is_woodall 383 == True assert is_woodall 254 == False assert is_woodall 200 == False,53,45,8,0.001,1.178,2025/11/05 17:15:56,0.0,1.5,0.2638522427440632,34.335
"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]","Prompt:Write function find number multiples 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,70,8,0.001,1.114,2025/11/05 17:15:56,0.0,0.0,0.2075637642919965,35.55
"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",Prompt:Write function find first duplicate element given array 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,69,24,0.001,1.348,2025/11/05 17:15:56,0.0,0.0,0.4133685136323659,43.086
"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","Prompt:Write python function find maximum sum elements list list 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,107,16,0.001,1.15,2025/11/05 17:15:56,0.0,0.0,0.2392260334212839,48.909
"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",Prompt:Write function convert given binary number decimal equivalent. Assesments:assert binary_to_decimal 100 ==4 assert binary_to_decimal 1011 ==11 assert binary_to_decimal 1101101 == 109,55,43,12,0.001,1.279,2025/11/05 17:15:56,0.0,0.0,0.3526824978012312,33.798
"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","Prompt:Write python function find product non-repeated elements 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,68,13,0.001,1.191,2025/11/05 17:15:56,0.0,0.0,0.2752858399296394,36.313
"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",Prompt:Write function 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,89,32,0.001,1.36,2025/11/05 17:15:56,0.0,2.0,0.4239226033421285,56.459
"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']",Prompt:Write python function remove digits list 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,86,-2,0.001,0.977,2025/11/05 17:15:56,-0.0,0.0,0.0870712401055408,43.919
"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","Prompt:Write python function find binomial co-efficient Assesments:assert binomial_Coeff 5,2 ==10 assert binomial_Coeff 4,3 ==4 assert binomial_Coeff 3,2 ==3",61,50,11,0.001,1.22,2025/11/05 17:15:56,0.0,0.0,0.3007915567282321,32.736
"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","Prompt:Write python function find element occurring odd number 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,103,12,0.001,1.117,2025/11/05 17:15:56,0.0,0.0,0.2102022867194371,34.889
"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",Prompt:Write python function count substrings starting ending 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,53,18,0.001,1.34,2025/11/05 17:15:56,0.0,0.0,0.4063324538258576,34.22
"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]","Prompt:Write function find top k integers occur frequently given lists sorted 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,201,86,0.003,1.428,2025/11/05 17:15:56,0.0,0.0,0.4837291116974493,119.873
"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",Prompt:Write python function find largest prime factor given number. Assesments:assert max_Prime_Factors 15 ==5 assert max_Prime_Factors 6 ==3 assert max_Prime_Factors 2 ==2,59,46,13,0.001,1.283,2025/11/05 17:15:56,0.0,0.0,0.3562005277044854,33.693
"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",Prompt:Write python function convert decimal number binary number. Assesments:assert decimal_To_Binary 10 == 1010 assert decimal_To_Binary 1 ==1 assert decimal_To_Binary 20 == 10100,56,46,10,0.001,1.217,2025/11/05 17:15:56,0.0,0.0,0.2981530343007916,34.045
"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","Prompt:Write python function find missing number 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,64,13,0.001,1.203,2025/11/05 17:15:56,0.0,0.0,0.2858399296394019,34.784
"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",Prompt:Write function find n-th rectangular number. Assesments:assert find_rect_num 4 ==20 assert find_rect_num 5 ==30 assert find_rect_num 6 ==42,49,38,11,0.001,1.289,2025/11/05 17:15:56,0.0,0.0,0.3614775725593667,33.282
"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","Prompt:Write python function find nth digit proper fraction 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,60,14,0.001,1.233,2025/11/05 17:15:56,0.0,0.0,0.3122251539138083,34.334
"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']","Prompt:Write function sort given mixed list integers 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,165,14,0.002,1.085,2025/11/05 17:15:56,0.0,0.0,0.1820580474934036,66.039
"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","Prompt:Write function find division first even odd number 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,84,12,0.001,1.143,2025/11/05 17:15:56,0.0,0.0,0.2330694810905892,35.546
"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')",Prompt:Write function check if the letters given string can be rearranged two characters are adjacent are different. Assesments:assert rearange_string aab == 'aba' assert rearange_string aabb == 'abab' assert rearange_string abccdd == 'cdabcd',70,57,13,0.001,1.228,2025/11/05 17:15:56,0.0,1.5,0.3078276165347405,39.415
"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})","Prompt:Write function find frequency elements given list 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,214,77,0.002,1.36,2025/11/05 17:15:56,0.0,0.0,0.4239226033421285,90.395
"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]","Prompt:Write function 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,98,21,0.001,1.214,2025/11/05 17:15:56,0.0,0.0,0.2955145118733508,42.438
"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","Prompt:Write python function find sum repeated elements 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,72,14,0.001,1.194,2025/11/05 17:15:56,0.0,0.0,0.2779243623570799,36.0
"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!'",Prompt:Write function find sequences lowercase letters joined underscore using regex. Assesments:assert text_match aab_cbbbc == 'Found match! assert text_match aab_Abbbc == 'Not matched! assert text_match Aaab_abbbc == 'Not matched!,67,55,12,0.001,1.218,2025/11/05 17:15:56,0.0,0.0,0.299032541776605,34.597
"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!')",Prompt:Write function matches word beginning string. Assesments:assert text_match_string python == 'Not matched! assert text_match_string python == 'Found match! assert text_match_string lang == 'Not matched!,58,43,15,0.001,1.349,2025/11/05 17:15:56,0.0,0.0,0.4142480211081794,35.384
"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 ",Prompt:Write function find gcd 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,79,56,23,0.001,1.411,2025/11/05 17:15:56,0.0,0.0,0.4687774846086192,39.078
"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","Prompt:Write python function determine whether numbers are different 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,61,12,0.001,1.197,2025/11/05 17:15:56,0.0,1.0,0.2805628847845207,35.749
"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","Prompt:Write python function find last digit when factorial divides factorial b. Assesments:assert compute_Last_Digit 2,4 ==2 assert compute_Last_Digit 6,8 ==6 assert compute_Last_Digit 1,2 ==2",65,51,14,0.001,1.275,2025/11/05 17:15:56,0.0,1.0,0.349164467897977,34.933
"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",Prompt:Write python function set odd bits 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,42,13,0.001,1.31,2025/11/05 17:15:56,0.0,0.0,0.3799472295514512,33.849
"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]","Prompt:Write function extract every first specified element 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,126,45,0.002,1.357,2025/11/05 17:15:56,0.0,0.0,0.4212840809146877,75.987
"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])","Prompt:Write function find list 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,119,17,0.001,1.143,2025/11/05 17:15:56,0.0,0.0,0.2330694810905892,55.018
"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","Prompt:Write function print check if the triangle is equilateral not. Assesments:assert check_equilateral 6,8,12 ==False assert check_equilateral 6,6,12 ==False assert check_equilateral 6,6,6 ==True",59,54,5,0.001,1.093,2025/11/05 17:15:56,0.0,1.5,0.189094107299912,34.408
"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","Prompt:Write function caluclate area parallelogram. Assesments:assert parallelogram_area 10,20 ==200 assert parallelogram_area 15,20 ==300 assert parallelogram_area 8,9 ==72",55,49,6,0.001,1.122,2025/11/05 17:15:56,0.0,0.0,0.2145998240985049,33.241
"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""",Prompt:Write python function check whether first last characters given string are equal not. Assesments:assert check_Equality abcda == Equal assert check_Equality ab == Equal assert check_Equality mad == Equal,63,42,21,0.001,1.5,2025/11/05 17:15:56,0.0,1.0,0.5470536499560246,37.31
"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]","Prompt:Write function sort given array 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,103,36,0.001,1.35,2025/11/05 17:15:56,0.0,0.0,0.415127528583993,61.729
"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","Prompt:Write function find t-nth term 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,49,5,0.001,1.102,2025/11/05 17:15:56,0.0,0.0,0.197009674582234,33.243
"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",Prompt:Write python function check if a given number is one less twice reverse. Assesments:assert check 70 == False assert check 23 == False assert check 73 == True,47,38,9,0.001,1.237,2025/11/05 17:15:56,0.0,1.5,0.3157431838170625,35.047
"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","Prompt:Write python function find largest number can be formed 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,69,11,0.001,1.159,2025/11/05 17:15:56,0.0,2.0,0.247141600703606,36.542
"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","Prompt:Write python function check whether given two integers have opposite sign not. Assesments:assert opposite_Signs 1 -2 == True assert opposite_Signs 3,2 == False assert opposite_Signs -10 -10 == False",58,49,9,0.001,1.184,2025/11/05 17:15:56,0.0,1.0,0.2691292875989445,35.195
"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",Prompt:Write function find nth octagonal number. Assesments:assert is_octagonal 5 ==65 assert is_octagonal 10 == 280 assert is_octagonal 15 == 645,49,40,9,0.001,1.225,2025/11/05 17:15:56,0.0,0.0,0.3051890941073,33.36
"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",Prompt:Write function find maximum length subsequence difference adjacent elements 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,83,37,0.001,1.446,2025/11/05 17:15:56,0.0,0.0,0.4995602462620931,55.763
"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","Prompt:Write python function count number substrings sum digits equal length. Assesments:assert count_Substrings '112112',6 ==6 assert count_Substrings '111',3 ==6 assert count_Substrings '1101112',7 ==12",67,51,16,0.001,1.314,2025/11/05 17:15:56,0.0,0.0,0.3834652594547054,34.79
"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",Prompt:Write python function find smallest number 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,53,21,0.001,1.396,2025/11/05 17:15:56,0.0,0.0,0.4555848724714159,38.729
"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",Prompt:Write function find maximum difference available pairs 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,80,35,0.001,1.438,2025/11/05 17:15:56,0.0,0.0,0.4925241864555848,55.407
"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)])","Prompt:Write function sort list 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,128,31,0.001,1.242,2025/11/05 17:15:56,0.0,0.0,0.3201407211961301,57.971
"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","Prompt:Write function 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,66,16,0.001,1.242,2025/11/05 17:15:56,0.0,0.0,0.3201407211961301,39.794
"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","Prompt:Write python function count positive numbers 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,53,12,0.001,1.226,2025/11/05 17:15:56,0.0,0.0,0.3060686015831134,34.567
"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",Prompt:Write function find number ways partition set bell numbers. Assesments:assert bell_number 2 ==2 assert bell_number 10 ==115975 assert bell_number 56 ==6775685320645824322581483068371419745979053216268760300,65,56,9,0.001,1.161,2025/11/05 17:15:56,0.0,0.0,0.248900615655233,34.493
"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",Prompt:Write python function check whether given array is monotonic 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,64,17,0.001,1.266,2025/11/05 17:15:56,0.0,1.0,0.3412489006156552,39.828
"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","Prompt:Write function check whether list contains given sublist 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,77,10,0.001,1.13,2025/11/05 17:15:56,0.0,0.0,0.2216358839050131,35.036
"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'",Prompt:Write function find whether given tuples have equal length 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,92,25,0.001,1.272,2025/11/05 17:15:56,0.0,2.333,0.3465259454705365,56.129
"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]",Prompt:Write function sort list 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,83,32,0.001,1.386,2025/11/05 17:15:56,0.0,0.0,0.4467897977132805,55.405
"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",Prompt:Write python function check whether given number can be represented difference two squares not. Assesments:assert dif_Square 5 == True assert dif_Square 10 == False assert dif_Square 15 == True,56,45,11,0.001,1.244,2025/11/05 17:15:56,0.0,2.0,0.3218997361477572,36.325
"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.']",Prompt:Write function split given string multiple delimiters using regex. Assesments:assert multiple_split 'Forces \ndarkness* are coming play.' == 'Forces 'darkness' 'are coming play.' assert multiple_split 'Mi Box runs \n Latest android* which has google assistance chromecast.' == 'Mi Box runs Latest android' 'which has google assistance chromecast.' assert multiple_split 'Certain services\nare subjected change* seperate subscriptions.' == 'Certain services' 'are subjected change' 'over seperate subscriptions.',139,109,30,0.001,1.275,2025/11/05 17:15:56,0.0,1.333,0.349164467897977,61.825
"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 ",Prompt:Write function check whether follows sequence given patterns array. Assesments:assert is_samepatterns red green green b b ==True assert is_samepatterns red green greenn b b ==False assert is_samepatterns red green greenn b ==False,87,50,37,0.001,1.74,2025/11/05 17:15:57,0.0,0.0,0.7581354441512752,43.497
"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)]'",Prompt:Write function find tuples which have all elements divisible k given list 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,113,51,0.002,1.451,2025/11/05 17:15:57,0.0,3.0,0.503957783641161,54.418
"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","Prompt:Write python function count number squares rectangle. Assesments:assert count_Squares 4,3 ==20 assert count_Squares 2,2 ==5 assert count_Squares 1,1 ==1",58,44,14,0.001,1.318,2025/11/05 17:15:57,0.0,0.0,0.3869832893579595,33.943
"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",Prompt:Write python function find difference sum even odd digits. Assesments:assert is_Diff 12345 == False assert is_Diff 1212112 == True assert is_Diff 1212 == False,55,44,11,0.001,1.25,2025/11/05 17:15:57,0.0,0.0,0.3271767810026385,35.296
"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",Prompt:Write python function find number integers odd number 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,50,13,0.001,1.26,2025/11/05 17:15:57,0.0,0.0,0.335971855760774,34.125
"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",Prompt:Write python function check whether length word is odd not. Assesments:assert word_len Hadoop == False assert word_len great == True assert word_len structure == True,50,35,15,0.001,1.429,2025/11/05 17:15:57,0.0,1.0,0.484608619173263,34.894
"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",Prompt:Write function find nth tetrahedral number. Assesments:assert tetrahedral_number 5 == 35.0 assert tetrahedral_number 6 == 56.0 assert tetrahedral_number 7 == 84.0,55,47,8,0.001,1.17,2025/11/05 17:15:57,0.0,0.0,0.2568161829375548,33.324
"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)]",Prompt:Write function zip 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,154,66,0.002,1.429,2025/11/05 17:15:57,0.0,0.0,0.484608619173263,80.266
"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",Prompt:Write function find volume sphere. Assesments:assert volume_sphere 10 ==4188.790204786391 assert volume_sphere 25 ==65449.84694978735 assert volume_sphere 20 ==33510.32163829113,61,54,7,0.001,1.13,2025/11/05 17:15:57,0.0,0.0,0.2216358839050131,33.595
"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""",Prompt:Write python function find character made adding characters given string. Assesments:assert get_Char abc ==f assert get_Char gfg == assert get_Char ab ==c,59,38,21,0.001,1.553,2025/11/05 17:15:57,0.0,0.0,0.5936675461741424,34.697
"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",Prompt:Write function find n-th number newman conway sequence. Assesments:assert sequence 10 ==6 assert sequence 2 ==1 assert sequence 3 ==2,48,36,12,0.001,1.333,2025/11/05 17:15:57,0.0,0.0,0.4001759014951626,33.532
"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",Prompt:Write function find surface area sphere. Assesments:assert surfacearea_sphere 10 ==1256.6370614359173 assert surfacearea_sphere 15 ==2827.4333882308138 assert surfacearea_sphere 20 ==5026.548245743669,67,60,7,0.001,1.117,2025/11/05 17:15:57,0.0,0.0,0.2102022867194371,33.723
"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",Prompt:Write function 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,44,8,0.001,1.182,2025/11/05 17:15:57,0.0,0.0,0.2673702726473174,32.981
"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'}",Prompt:Write function merge three dictionaries 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,210,78,0.002,1.371,2025/11/05 17:15:57,0.0,0.0,0.4335971855760773,64.355
"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}) ","Prompt:Write function get frequency elements 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",183,157,26,0.001,1.166,2025/11/05 17:15:57,0.0,0.0,0.2532981530343007,40.121
"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",Prompt:Write function find closest smaller number n. Assesments:assert closest_num 11 ==10 assert closest_num 7 ==6 assert closest_num 12 ==11,47,35,12,0.001,1.343,2025/11/05 17:15:57,0.0,0.0,0.4089709762532981,33.58
"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",Prompt:Write python function find length longest word. Assesments:assert len_log python PHP bigdata ==7 assert len_log ab abc ==3 assert len_log small big tall ==5,62,38,24,0.001,1.632,2025/11/05 17:15:57,0.0,0.0,0.6631486367634124,36.364
"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",Prompt:Write function check if a substring is present given list 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,55,40,0.001,1.727,2025/11/05 17:15:57,0.0,1.5,0.7467018469656993,45.71
"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",Prompt:Write function check whether given number is undulating not. Assesments:assert is_undulating 1212121 == True assert is_undulating 1991 == False assert is_undulating 121 == True,56,47,9,0.001,1.191,2025/11/05 17:15:57,0.0,1.0,0.2752858399296394,34.353
"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","Prompt:Write function calculate value 'a' power 'b'. Assesments:assert power 3,4 ==81 assert power 2,3 ==8 assert power 5,5 == 3125",56,43,13,0.001,1.302,2025/11/05 17:15:57,0.0,0.0,0.3729111697449428,34.604
"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'",Prompt:Write function extract index minimum value record 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,99,17,0.001,1.172,2025/11/05 17:15:57,0.0,0.0,0.258575197889182,51.459
"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","Prompt:Write python function find minimum length 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,71,12,0.001,1.169,2025/11/05 17:15:57,0.0,0.0,0.2559366754617414,35.394
"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",Prompt:Write python function find number divisors given integer. Assesments:assert divisor 15 ==4 assert divisor 12 ==6 assert divisor 9 ==3,48,34,14,0.001,1.412,2025/11/05 17:15:57,0.0,0.0,0.4696569920844326,33.835
"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}","Prompt:Write function find frequency count list 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,131 10:1",280,216,64,0.002,1.296,2025/11/05 17:15:57,0.0,0.0,0.3676341248900616,74.57
"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","Prompt:Write function multiply numbers list divide length 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,62,18,0.001,1.29,2025/11/05 17:15:57,0.0,0.0,0.3623570800351803,39.106
"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' ",Prompt:Write function convert given decimal number binary equivalent. Assesments:assert decimal_to_binary 8 == '1000' assert decimal_to_binary 18 == '10010' assert decimal_to_binary 7 == '111',56,47,9,0.001,1.191,2025/11/05 17:15:57,0.0,0.0,0.2752858399296394,33.772
"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",Prompt:Write function find next smallest palindrome specified number. Assesments:assert next_smallest_palindrome 99 ==101 assert next_smallest_palindrome 1221 ==1331 assert next_smallest_palindrome 120 ==121,54,47,7,0.001,1.149,2025/11/05 17:15:57,0.0,0.0,0.2383465259454705,33.902
"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","Prompt:Write function find kth element 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,69,19,0.001,1.275,2025/11/05 17:15:57,0.0,0.0,0.349164467897977,38.045
"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')",Prompt:Write function convert snake case string 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,58,3,0.001,1.052,2025/11/05 17:15:57,0.0,0.0,0.1530343007915567,34.248
"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",Prompt:Write function find eulerian number n Assesments:assert eulerian_num 3 1 ==4 assert eulerian_num 4 1 ==11 assert eulerian_num 5 3 ==26,64,47,17,0.001,1.362,2025/11/05 17:15:57,0.0,0.0,0.4256816182937555,34.155
"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']]",Prompt:Write function sort sublist strings given list 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,113,53,0.002,1.469,2025/11/05 17:15:57,0.0,0.0,0.5197889182058048,74.527
"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",Prompt:Write python function count true booleans given list. Assesments:assert count True False True ==2 assert count False False ==0 assert count True True True ==3,57,37,20,0.001,1.541,2025/11/05 17:15:57,0.0,0.0,0.5831134564643798,34.801
"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)",Prompt:Write function add given list 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,86,35,0.001,1.407,2025/11/05 17:15:57,0.0,0.0,0.465259454705365,60.311
"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","Prompt:Write python function count hexadecimal numbers given range. Assesments:assert count_Hexadecimal 10,15 ==6 assert count_Hexadecimal 2,4 ==0 assert count_Hexadecimal 15,16 ==1",60,48,12,0.001,1.25,2025/11/05 17:15:57,0.0,0.0,0.3271767810026385,33.521
"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]",Prompt:Write function merge multiple sorted inputs 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,271,118,0.004,1.435,2025/11/05 17:15:57,0.0,0.0,0.4898856640281442,134.079
"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","Prompt:Write python function find count rotations binary string odd value. Assesments:assert odd_Equivalent 011001,6 ==3 assert odd_Equivalent 11011,5 ==4 assert odd_Equivalent 1010,4 ==2",65,50,15,0.001,1.3,2025/11/05 17:15:57,0.0,0.0,0.3711521547933157,35.58
"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)]",Prompt:Write function extract ranges are missing given list given start range 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,153,69,0.002,1.451,2025/11/05 17:15:57,0.0,1.0,0.503957783641161,88.314
"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]","Prompt:Write function find common elements 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,149,50,0.002,1.336,2025/11/05 17:15:57,0.0,0.0,0.4028144239226034,74.351
"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","Prompt:Write python function find perimeter cylinder. Assesments:assert perimeter 2,4 ==12 assert perimeter 1,2 ==6 assert perimeter 3,1 ==8",50,37,13,0.001,1.351,2025/11/05 17:15:57,0.0,0.0,0.4160070360598065,33.581
"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",Prompt:Write function check if a string represents integer not. Assesments:assert check_integer python ==False assert check_integer 1 ==True assert check_integer 12345 ==True,44,37,7,0.001,1.189,2025/11/05 17:15:57,0.0,2.0,0.2735268249780123,34.172
"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)]'",Prompt:Write function assign frequency tuple 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,185,95,0.003,1.514,2025/11/05 17:15:57,0.0,0.0,0.5593667546174143,108.542
"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","Prompt:Write function check whether dictionaries list are empty not. Assesments:assert empty_dit ==True assert empty_dit 1,2 ==False assert empty_dit ==True",57,38,19,0.001,1.5,2025/11/05 17:15:57,0.0,1.0,0.5470536499560246,36.194
"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","Prompt:Write function convert given tuple positive integers 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,51,11,0.001,1.216,2025/11/05 17:15:57,0.0,0.0,0.297273526824978,34.229
"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)]'",Prompt:Write function convert possible convertible elements list 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,184,69,0.002,1.375,2025/11/05 17:15:57,0.0,0.0,0.4371152154793316,81.395
"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']",Prompt:link text https://link text https://link text https://write function convert string 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 program == 'write' 'a' 'program',83,72,11,0.001,1.153,2025/11/05 17:15:57,0.0,0.0,0.2418645558487247,44.708
"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","Prompt:Write python function find element appears 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,79,16,0.001,1.203,2025/11/05 17:15:57,0.0,0.0,0.2858399296394019,36.046
"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","Prompt:Write function find maximum product pairs tuples within 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,79,28,0.001,1.354,2025/11/05 17:15:57,0.0,0.0,0.4186455584872472,50.592
"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",Prompt:Write function find triplet sum 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,92,38,0.001,1.413,2025/11/05 17:15:57,0.0,0.0,0.4705364995602463,59.512
"Prompt: Write a function to find n’th smart number. Assesments: assert smartNumber(1) == 30, assert smartNumber(50) == 273, assert smartNumber(1000) == 2664",Prompt:Write function find nth smart number. Assesments:assert smartNumber 1 ==30 assert smartNumber 50 == 273 assert smartNumber 1000 == 2664,48,38,10,0.001,1.263,2025/11/05 17:15:57,0.0,0.0,0.3386103781882145,32.822
"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",Prompt:Write function sum amicable numbers 1 specified number. Assesments:assert amicable_numbers_sum 999 ==504 assert amicable_numbers_sum 9999 ==31626 assert amicable_numbers_sum 99 ==0,54,46,8,0.001,1.174,2025/11/05 17:15:57,0.0,0.0,0.2603342128408091,34.084
"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","Prompt:Write function get angle 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,64,7,0.001,1.109,2025/11/05 17:15:57,0.0,0.0,0.2031662269129287,33.361
"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 ",Prompt:Write function find maximum difference number 0s number 1s sub-string given binary string. Assesments:assert find_length 11000010001 11 ==6 assert find_length 10111 5 ==1 assert find_length 11011101100101 14 ==2,84,60,24,0.001,1.4,2025/11/05 17:15:57,0.0,0.0,0.4591029023746701,39.091
"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","Prompt:Write python function find sum common divisors two given numbers. Assesments:assert sum 10,15 ==6 assert sum 100,150 ==93 assert sum 4,6 ==3",55,42,13,0.001,1.31,2025/11/05 17:15:57,0.0,0.0,0.3799472295514512,34.071
"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","Prompt:Write function multiply two integers without using * operator python. Assesments:assert multiply_int 10,20 ==200 assert multiply_int 5,10 ==50 assert multiply_int 4,8 ==32",50,44,6,0.001,1.136,2025/11/05 17:15:57,0.0,0.0,0.2269129287598943,34.005
"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']",Prompt:Write function shortlist words are longer n given list words. Assesments:assert long_words 3 python is a programming language == 'python' 'programming' 'language' assert long_words 2 writing program == 'writing' 'program' assert long_words 5 sorting list == 'sorting',71,63,8,0.001,1.127,2025/11/05 17:15:57,0.0,1.5,0.2189973614775725,44.15
"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",Prompt:Write function 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,98,38,0.001,1.388,2025/11/05 17:15:57,0.0,0.0,0.4485488126649075,61.922
"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)","Prompt:Write function find item maximum frequency 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,142,12,0.001,1.085,2025/11/05 17:15:57,0.0,0.0,0.1820580474934036,38.307
"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""",Prompt:Write python function reverse vowels given string. Assesments:assert reverse_vowels Python == Python assert reverse_vowels USA == ASU assert reverse_vowels ab ==ab,54,36,18,0.001,1.5,2025/11/05 17:15:57,0.0,0.0,0.5470536499560246,33.813
"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"")",Prompt:Write function convert tuple 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,93,0,0.001,1.0,2025/11/05 17:15:57,0.0,0.0,0.1072999120492524,54.217
"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","Prompt:Write function calculate sum negative numbers given list 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,95,26,0.001,1.274,2025/11/05 17:15:57,0.0,0.0,0.3482849604221636,53.734
"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""","Prompt:Write python function check whether last element given array is even odd performing 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,68,17,0.001,1.25,2025/11/05 17:15:57,0.0,1.0,0.3271767810026385,39.163
"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",Prompt:Write function find nth hexagonal number. Assesments:assert hexagonal_num 10 == 190 assert hexagonal_num 5 ==45 assert hexagonal_num 7 ==91,49,39,10,0.001,1.256,2025/11/05 17:15:57,0.0,0.0,0.3324538258575197,33.321
"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",Prompt:Write function calculate electricity bill. Assesments:assert cal_electbill 75 ==246.25 assert cal_electbill 265 ==1442.75 assert cal_electbill 100 ==327.5,50,46,4,0.001,1.087,2025/11/05 17:15:57,0.0,0.0,0.1838170624450307,32.601
"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",Prompt:Write function find ration zeroes array 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,106,44,0.001,1.415,2025/11/05 17:15:57,0.0,0.0,0.4722955145118733,65.651
"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",Prompt:Write python function check whether given number can be represented sum non-zero powers 2 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,72,12,0.001,1.167,2025/11/05 17:15:57,0.0,2.0,0.2541776605101143,36.63
"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",Prompt:Write function find circumference circle. Assesments:assert circle_circumference 10 ==62.830000000000005 assert circle_circumference 5 ==31.415000000000003 assert circle_circumference 4 ==25.132,63,56,7,0.001,1.125,2025/11/05 17:15:57,0.0,0.0,0.2172383465259454,33.55
"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]",Prompt:Write function extract elements occur singly 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,113,46,0.002,1.407,2025/11/05 17:15:57,0.0,0.0,0.465259454705365,70.93
"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]",Prompt:Write function sort list 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,87,34,0.001,1.391,2025/11/05 17:15:57,0.0,0.0,0.4511873350923482,59.393
"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","Prompt:Write function count pair 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,176,10,0.001,1.057,2025/11/05 17:15:57,0.0,0.0,0.1574318381706244,38.473
"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",Prompt:Write function find number lists present 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,76,34,0.001,1.447,2025/11/05 17:15:57,0.0,0.0,0.5004397537379068,52.045
"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","Prompt:Write python function find sum absolute differences pairs 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,78,15,0.001,1.192,2025/11/05 17:15:57,0.0,0.0,0.2761653474054529,36.613
"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","Prompt:Write python function find maximum difference two elements 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,71,15,0.001,1.211,2025/11/05 17:15:57,0.0,0.0,0.2928759894459103,36.113
"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",Prompt:Write function find ascii value total characters string. Assesments:assert ascii_value_string python ==112 assert ascii_value_string Program ==80 assert ascii_value_string Language ==76,47,36,11,0.001,1.306,2025/11/05 17:15:57,0.0,0.0,0.376429199648197,34.195
"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",Prompt:Write function find maximum total path sum 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,100,43,0.001,1.43,2025/11/05 17:15:57,0.0,0.0,0.4854881266490764,66.665
"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",Prompt:Write function divide number two parts sum digits is maximum. Assesments:assert sum_digits_twoparts 35 ==17 assert sum_digits_twoparts 7 ==7 assert sum_digits_twoparts 100 ==19,57,47,10,0.001,1.213,2025/11/05 17:15:57,0.0,1.0,0.2946350043975374,35.723
"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",Prompt:Write function find longest subsequence difference adjacents is one 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,98,39,0.001,1.398,2025/11/05 17:15:57,0.0,1.0,0.457343887423043,58.262
"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","Prompt:Write python function find whether given number is present infinite sequence 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,58,11,0.001,1.19,2025/11/05 17:15:57,0.0,1.0,0.2744063324538258,35.415
"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","Prompt:Write python function check whether given number is co-prime not. Assesments:assert is_coprime 17,13 == True assert is_coprime 15,21 == False assert is_coprime 25,45 == False",61,52,9,0.001,1.173,2025/11/05 17:15:57,0.0,1.0,0.2594547053649956,34.435
"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]",Prompt:Write function sort given array 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,107,44,0.001,1.411,2025/11/05 17:15:57,0.0,0.0,0.4687774846086192,68.033
"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)","Prompt:Write function find vertex 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,80,11,0.001,1.137,2025/11/05 17:15:57,0.0,0.0,0.227792436235708,37.767
"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]","Prompt:Write function extract every specified element 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,125,44,0.002,1.352,2025/11/05 17:15:57,0.0,0.0,0.4168865435356201,75.883
"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",Prompt:Write python function toggle even bits 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,42,13,0.001,1.31,2025/11/05 17:15:57,0.0,0.0,0.3799472295514512,33.783
"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))",Prompt:Write function convert tuple string values tuple 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,97,22,0.001,1.227,2025/11/05 17:15:57,0.0,0.0,0.306948109058927,57.02
"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']]","Prompt:Write function reflect run-length encoding 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,171,38,0.003,1.222,2025/11/05 17:15:57,0.0,0.0,0.3025505716798592,90.381
"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","Prompt:Write python function find k number operations required make 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,75,12,0.001,1.16,2025/11/05 17:15:57,0.0,0.0,0.2480211081794194,35.286
"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')","Prompt:Write function print season given month day. Assesments:assert month_season 'January',4 == 'winter' assert month_season 'October',28 == 'autumn' assert month_season 'June',6 == 'spring'",57,51,6,0.001,1.118,2025/11/05 17:15:57,0.0,0.0,0.2110817941952507,34.892
"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)",Prompt:Write function findx satisfiesax+n. Assesments:assert solution 2 3 7 == 'x 2 1 assert solution 4 2 7 == 'No solution' assert solution 1 13 17 == 'x 4 1,90,57,33,0.001,1.579,2025/11/05 17:15:57,0.0,0.0,0.6165347405452946,42.914
"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]","Prompt:Write function remove elements given list present 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,148,50,0.002,1.338,2025/11/05 17:15:57,0.0,0.0,0.4045734388742305,74.23
"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",Prompt:Write function calculate sum positive integers n+n-2+n-4... n-x 0 Assesments:assert sum_series 6 ==12 assert sum_series 10 ==30 assert sum_series 9 ==25,60,45,15,0.001,1.333,2025/11/05 17:15:57,0.0,0.0,0.4001759014951626,38.122
"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","Prompt:Write function calculate area 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,59,7,0.001,1.119,2025/11/05 17:15:57,0.0,0.0,0.2119613016710642,33.657
"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","Prompt:Write python function check whether sum divisors are same or not. Assesments:assert areEquivalent 36,57 == False assert areEquivalent 2,4 == False assert areEquivalent 23,47 == True",55,46,9,0.001,1.196,2025/11/05 17:15:57,0.0,3.0,0.279683377308707,34.459
"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",Prompt:Write python function count characters position given string lower uppercase characters english alphabet. Assesments:assert count_char_position xbcefg ==2 assert count_char_position ABcED ==3 assert count_char_position AbgdeF ==5,70,48,22,0.001,1.458,2025/11/05 17:15:57,0.0,0.0,0.5101143359718557,36.159
"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","Prompt:Write python function count pairs xor 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,72,14,0.001,1.194,2025/11/05 17:15:57,0.0,0.0,0.2779243623570799,35.973
"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",Prompt:Write python function find smallest power 2 greater equal n. Assesments:assert next_Power_Of_2 0 ==1 assert next_Power_Of_2 5 ==8 assert next_Power_Of_2 17 ==32,68,54,14,0.001,1.259,2025/11/05 17:15:57,0.0,0.0,0.3350923482849603,34.053
"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","Prompt:Write python function find frequency number 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,65,15,0.001,1.231,2025/11/05 17:15:57,0.0,0.0,0.3104661389621812,35.915
"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",Prompt:Write function calculate nth pell number. Assesments:assert get_pell 4 ==12 assert get_pell 7 == 169 assert get_pell 8 == 408,48,39,9,0.001,1.231,2025/11/05 17:15:57,0.0,0.0,0.3104661389621812,33.248
"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","Prompt:Write function find sum numbers list indices 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,118,15,0.001,1.127,2025/11/05 17:15:57,0.0,0.0,0.2189973614775725,36.343
"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",Prompt:Write function find perimeter pentagon. Assesments:assert perimeter_pentagon 5 ==25 assert perimeter_pentagon 10 ==50 assert perimeter_pentagon 15 ==75,47,40,7,0.001,1.175,2025/11/05 17:15:57,0.0,0.0,0.2612137203166227,33.545
"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",Prompt:Write function find occurence characters 'std' given string1. list item1. list item1. list item2. list item2. list item2. list item Assesments:assert count_occurance letstdlenstdporstd ==3 assert count_occurance truststdsolensporsd ==1 assert count_occurance makestdsostdworthit ==2,104,81,23,0.001,1.284,2025/11/05 17:15:57,0.0,0.0,0.357080035180299,36.757
"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')",Prompt:Write function remove everything except alphanumeric characters string. Assesments:assert remove_splchar 'python#^ * program123' == 'pythonprogram123' assert remove_splchar 'python%^$@^ * programming24% $^^ language' == 'pythonprogramming24language' assert remove_splchar 'python^ ^+_^ 67 program' == 'python67program',107,83,24,0.001,1.289,2025/11/05 17:15:57,0.0,0.0,0.3614775725593667,44.473
"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]}","Prompt:Write function group sequence key-value pairs dictionary 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,156,36,0.002,1.231,2025/11/05 17:15:57,0.0,0.0,0.3104661389621812,76.054
"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",Prompt:Write function verify validity string parentheses. Assesments:assert is_valid_parenthese ==True assert is_valid_parenthese ==False assert is_valid_parenthese ==True,54,37,17,0.001,1.459,2025/11/05 17:15:57,0.0,0.0,0.5109938434476693,33.653
"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","Prompt:Write function find perimeter triangle. Assesments:assert perimeter_triangle 10,20,30 ==60 assert perimeter_triangle 3,4,5 ==12 assert perimeter_triangle 25,35,45 ==105",52,45,7,0.001,1.156,2025/11/05 17:15:57,0.0,0.0,0.2445030782761652,33.603
"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)","Prompt:Write python function find two distinct numbers lcm lies within given range. Assesments:assert answer 3,8 == 3,6 assert answer 2,6 == 2,4 assert answer 1,3 == 1,2",65,53,12,0.001,1.226,2025/11/05 17:15:57,0.0,0.0,0.3060686015831134,35.008
"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!')",Prompt:Write function search literals strings 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,59,6,0.001,1.102,2025/11/05 17:15:57,0.0,0.0,0.197009674582234,38.84
"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",Prompt:Write function find if the given number is a keith number not. Assesments:assert is_num_keith 14 == True assert is_num_keith 12 == False assert is_num_keith 197 == True,55,47,8,0.001,1.17,2025/11/05 17:15:57,0.0,2.0,0.2568161829375548,34.416
"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","Prompt:Write function calculate distance two points using latitude 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,92,6,0.001,1.065,2025/11/05 17:15:57,0.0,0.0,0.1644678979771327,34.035
"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'",Prompt:Write function find longest common prefix given set 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,56,35,0.001,1.625,2025/11/05 17:15:57,0.0,0.0,0.6569920844327176,42.18
"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'], [])",Prompt:Write function find uppercase lowercase special character 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,156,20,0.002,1.128,2025/11/05 17:15:57,0.0,0.0,0.2198768689533859,72.113
"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",Prompt:Write function count distinct pairs difference k 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,74,36,0.001,1.486,2025/11/05 17:15:57,0.0,0.0,0.534740545294635,52.705
"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","Prompt:Write function find values list are greater 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,60,15,0.001,1.25,2025/11/05 17:15:57,0.0,1.0,0.3271767810026385,39.245
"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)","Prompt:Write function find focus 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,75,11,0.001,1.147,2025/11/05 17:15:57,0.0,0.0,0.2365875109938434,37.747
"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!'",Prompt:Write function search literals strings string using regex. Assesments:assert check_literals 'The quick brown fox jumps lazy dog.' 'fox' == 'Matched assert check_literals 'The quick brown fox jumps lazy dog.' 'horse' == 'Not Matched! assert check_literals 'The quick brown fox jumps lazy dog.' 'lazy' == 'Matched,86,72,14,0.001,1.194,2025/11/05 17:15:57,0.0,0.0,0.2779243623570799,41.219
"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",Prompt:Write function find longest common subsequence 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,68,30,0.001,1.441,2025/11/05 17:15:57,0.0,0.0,0.4951627088830255,39.246
"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",Prompt:Write python function check whether given number can be represented product two squares not. Assesments:assert prod_Square 25 == False assert prod_Square 30 == False assert prod_Square 16 == True,56,45,11,0.001,1.244,2025/11/05 17:15:57,0.0,2.0,0.3218997361477572,36.372
"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","Prompt:Write python function find 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,77,11,0.001,1.143,2025/11/05 17:15:57,0.0,0.0,0.2330694810905892,38.105
"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","Prompt:Write python function count number integral co-ordinates lie inside 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,70,14,0.001,1.2,2025/11/05 17:15:57,0.0,0.0,0.2832014072119612,34.626
"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",Prompt:Write function check whether given month name contains 30 days not. Assesments:assert check_monthnumber February ==False assert check_monthnumber June ==True assert check_monthnumber April ==True,49,40,9,0.001,1.225,2025/11/05 17:15:57,0.0,0.0,0.3051890941073,33.855
"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",Prompt:Write python function check whether string has atleast one letter one number. Assesments:assert check_String 'thishasboth29' == True assert check_String 'python' == False assert check_String 'string' == False,52,46,6,0.001,1.13,2025/11/05 17:15:57,0.0,1.0,0.2216358839050131,34.506
"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)",Prompt:Write function remove duplicates 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,109,47,0.002,1.431,2025/11/05 17:15:57,0.0,0.0,0.4863676341248901,71.514
"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",Prompt:Write python function convert octal number decimal number. Assesments:assert octal_To_Decimal 25 ==21 assert octal_To_Decimal 30 ==24 assert octal_To_Decimal 40 ==32,60,49,11,0.001,1.224,2025/11/05 17:15:57,0.0,0.0,0.3043095866314863,33.57
"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","Prompt:Write python function find first position element 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,78,15,0.001,1.192,2025/11/05 17:15:57,0.0,0.0,0.2761653474054529,36.047
"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,)]","Prompt:Write function remove tuples lengthk. 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,144,68,0.002,1.472,2025/11/05 17:15:57,0.0,0.0,0.5224274406332453,85.854
"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)",Prompt:Write function perform exponentiation 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,123,41,0.002,1.333,2025/11/05 17:15:57,0.0,0.0,0.4001759014951626,65.274
"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","Prompt:Write function find largest triangle can be inscribed ellipse. Assesments:assert largest_triangle 4,2 ==10.392304845413264 assert largest_triangle 5,7 ==4.639421805988064 assert largest_triangle 9,1 ==105.2220865598093",70,62,8,0.001,1.129,2025/11/05 17:15:57,0.0,2.0,0.2207563764291996,35.411
"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",Prompt:Write python function find highest power 2 less equal 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,52,14,0.001,1.269,2025/11/05 17:15:57,0.0,0.0,0.3438874230430958,34.385
"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]","Prompt:Write function find index positions maximum values 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,112,13,0.001,1.116,2025/11/05 17:15:57,0.0,0.0,0.2093227792436236,36.049
"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",Prompt:Write python function check whether elements 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,62,1,0.001,1.016,2025/11/05 17:15:57,0.0,3.0,0.1213720316622691,40.922
"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"")",Prompt:Write function remove even characters string. Assesments:assert remove_even python == pto assert remove_even program == porm assert remove_even language == lnug,46,34,12,0.001,1.353,2025/11/05 17:15:57,0.0,0.0,0.4177660510114335,34.238
"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","Prompt:Write python function find hamming distance given two integers. Assesments:assert hamming_Distance 4,8 ==2 assert hamming_Distance 2,4 ==2 assert hamming_Distance 1,2 ==2",62,50,12,0.001,1.24,2025/11/05 17:15:57,0.0,0.0,0.318381706244503,33.773
"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",Prompt:Write python function count occurrence given character string. Assesments:assert count abcc c ==2 assert count ababca ==3 assert count mnmm0pm ==4,59,36,23,0.001,1.639,2025/11/05 17:15:57,0.0,0.0,0.6693051890941073,34.538
"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)",Prompt:Write function find inversions tuple elements 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,101,42,0.001,1.416,2025/11/05 17:15:57,0.0,0.0,0.4731750219876868,59.781
"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')","Prompt:Write function perform adjacent element concatenation given tuples. Assesments:assert concatenate_elements DSP IS,BEST UTS == 'DSP IS ','IS BEST 'BEST 'FOR 'ALL UTS' assert concatenate_elements RES IS,BEST QESR == 'RES IS ','IS BEST 'BEST 'FOR 'ALL QESR' assert concatenate_elements MSAM IS,BEST SKD == 'MSAMIS 'IS BEST 'BEST 'FOR 'ALL SKD'",157,95,62,0.001,1.653,2025/11/05 17:15:57,0.0,2.5,0.6816182937554969,60.715
"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",Prompt:Write function count longest repeating subsequences two subsequences dont have same string characters positions. Assesments:assert find_longest_repeating_subseq AABEBCDD ==3 assert find_longest_repeating_subseq aabb ==2 assert find_longest_repeating_subseq aab ==1,81,61,20,0.001,1.328,2025/11/05 17:15:57,0.0,2.0,0.395778364116095,36.253
"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",Prompt:Write function check given decimal precision 2 using regex. Assesments:assert is_decimal '123.11' == True assert is_decimal '0.21' == True assert is_decimal '123.1214' == False,57,48,9,0.001,1.188,2025/11/05 17:15:57,0.0,0.0,0.2726473175021987,34.565
"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]","Prompt:Write function delete smallest element given heap insert 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,119,48,0.002,1.403,2025/11/05 17:15:57,0.0,0.0,0.4617414248021108,78.145
"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",Prompt:Write function check given string contains certain set characters case a-z a-z 0-9 using regex. Assesments:assert is_allowed_specific_char ABCDEFabcdef123450 == True assert is_allowed_specific_char * %@#== False assert is_allowed_specific_char HELLOhowareyou98765 == True,85,63,22,0.001,1.349,2025/11/05 17:15:57,0.0,0.0,0.4142480211081794,38.86
"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",Prompt:Write python function count numbers whose oth nth bits are set. Assesments:assert count_Num 2 ==1 assert count_Num 3 ==2 assert count_Num 1 ==1,50,39,11,0.001,1.282,2025/11/05 17:15:57,0.0,1.0,0.3553210202286719,33.874
"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",Prompt:Write python function find sum fourth power n natural numbers. Assesments:assert fourth_Power_Sum 2 ==17 assert fourth_Power_Sum 4 == 354 assert fourth_Power_Sum 6 == 2275,61,50,11,0.001,1.22,2025/11/05 17:15:57,0.0,0.0,0.3007915567282321,34.06
"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')",Prompt:Write function perform concatenation 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,123,40,0.002,1.325,2025/11/05 17:15:57,0.0,0.0,0.3931398416886543,57.83
"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",Prompt:Write function convert radians degrees. Assesments:assert degree_radian 90 ==5156.620156177409 assert degree_radian 60 ==3437.746770784939 assert degree_radian 120 ==6875.493541569878,59,54,5,0.001,1.093,2025/11/05 17:15:57,0.0,0.0,0.189094107299912,33.228
"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']","Prompt:Write function decode 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,172,12,0.002,1.07,2025/11/05 17:15:57,0.0,0.0,0.1688654353562005,60.302
"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",Prompt:Write function check if a nested list is a subset 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,138,49,0.002,1.355,2025/11/05 17:15:57,0.0,2.0,0.4195250659630606,77.666
"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'",Prompt:Write python function find first repeated character given string. Assesments:assert first_Repeated_Char Google == assert first_Repeated_Char data == assert first_Repeated_Char python == '\0',60,43,17,0.001,1.395,2025/11/05 17:15:57,0.0,0.0,0.4547053649956024,33.724
"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","Prompt:Write python function find minimum operations required make two numbers equal. Assesments:assert min_Operations 2,4 ==1 assert min_Operations 4,10 ==4 assert min_Operations 1,4 ==3",60,48,12,0.001,1.25,2025/11/05 17:15:57,0.0,0.0,0.3271767810026385,33.896
"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)",Prompt:Write function extract maximum minimum k elements 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,109,44,0.001,1.404,2025/11/05 17:15:57,0.0,0.0,0.4626209322779243,68.363
"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')","Prompt:Write function replace maximum n occurrences spaces commas dots colon. Assesments:assert replace_max_specialchar 'Python language Programming language.',2 == 'Python language:Programming language.' assert replace_max_specialchar 'abc e f',3 == 'ab:c:ef' assert replace_max_specialchar 'ram reshma ram rahim',1 == 'ram reshma ram rahim'",97,78,19,0.001,1.244,2025/11/05 17:15:57,0.0,0.0,0.3218997361477572,42.394
"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",Prompt:Write python function find first even number given list 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,60,25,0.001,1.417,2025/11/05 17:15:57,0.0,0.0,0.4740545294635004,41.141
"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",Prompt:Write function check if all the elements tuple have same data type 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,63,23,0.001,1.365,2025/11/05 17:15:57,0.0,2.5,0.4283201407211961,42.145
"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",Prompt:Write function check majority element 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,85,33,0.001,1.388,2025/11/05 17:15:57,0.0,0.0,0.4485488126649075,54.446
"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",Prompt:Write python function count set bits given number. Assesments:assert count_Set_Bits 2 ==1 assert count_Set_Bits 4 ==1 assert count_Set_Bits 6 ==2,54,42,12,0.001,1.286,2025/11/05 17:15:57,0.0,0.0,0.3588390501319261,33.35
"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","Prompt:Write python function find minimum element sorted 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,69,14,0.001,1.203,2025/11/05 17:15:57,0.0,0.0,0.2858399296394019,35.99
"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'",Prompt:Write python function remove characters which have odd index values given string. Assesments:assert odd_values_string 'abcdef' == 'ace' assert odd_values_string 'python' == 'pto' assert odd_values_string 'data' == 'dt',57,52,5,0.001,1.096,2025/11/05 17:15:57,0.0,2.0,0.1917326297273527,34.649
"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","Prompt:Write function find minimum 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,50,5,0.001,1.1,2025/11/05 17:15:57,0.0,0.0,0.1952506596306069,34.004
"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","Prompt:Write python function check whether bits are unset given range 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,78,12,0.001,1.154,2025/11/05 17:15:57,0.0,1.0,0.2427440633245381,35.273
"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]",Prompt:Write function re-arrange elements given array negative elements appear 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,128,54,0.002,1.422,2025/11/05 17:15:57,0.0,0.0,0.4784520668425681,62.009
"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"")",Prompt:Write function replace blank spaces character 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,48,18,0.001,1.375,2025/11/05 17:15:57,0.0,0.0,0.4371152154793316,38.481
"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","Prompt:Write function find maximum sum given right triangle 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,73,26,0.001,1.356,2025/11/05 17:15:57,0.0,0.0,0.4204045734388743,48.776
"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]","Prompt:Write function get n largest items 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,121,38,0.001,1.314,2025/11/05 17:15:57,0.0,0.0,0.3834652594547054,68.198
"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","Prompt:Write function find lateral surface area cylinder. Assesments:assert lateralsuface_cylinder 10,5 ==314.15000000000003 assert lateralsuface_cylinder 4,5 ==125.66000000000001 assert lateralsuface_cylinder 4,10 ==251.32000000000002",78,71,7,0.001,1.099,2025/11/05 17:15:57,0.0,0.0,0.1943711521547932,35.967
"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",Prompt:Write function find volume cube. Assesments:assert volume_cube 3 ==27 assert volume_cube 2 ==8 assert volume_cube 5 ==125,40,33,7,0.001,1.212,2025/11/05 17:15:57,0.0,0.0,0.2937554969217238,33.409
"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",Prompt:Write python function set even bits 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,42,13,0.001,1.31,2025/11/05 17:15:57,0.0,0.0,0.3799472295514512,33.856
"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","Prompt:Write python function count maximum number equilateral triangles can be formed within 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,58,13,0.001,1.224,2025/11/05 17:15:57,0.0,2.0,0.3043095866314863,35.256
"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}",Prompt:Write function check occurrences records which occur similar times 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,156,69,0.002,1.442,2025/11/05 17:15:57,0.0,1.0,0.496042216358839,85.536
"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",Prompt:Write python function count number non-empty substrings given string. Assesments:assert number_of_substrings abc ==6 assert number_of_substrings abcd ==10 assert number_of_substrings abcde ==15,59,44,15,0.001,1.341,2025/11/05 17:15:57,0.0,0.0,0.407211961301671,33.913
"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",Prompt:Write function find number possible sequences lengthn next element is greater equal twice previous element less equal 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,62,30,0.001,1.484,2025/11/05 17:15:57,0.0,1.0,0.5329815303430079,43.205
"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""]","Prompt:Write function replace last element list 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,106,36,0.001,1.34,2025/11/05 17:15:57,0.0,0.0,0.4063324538258576,59.245
"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)==[[['*'],['*']],[['*'],['*']],[['*'],['*']]]","Prompt:Write function generate 3d array element * '. Assesments:assert array_3d 6,4,3 == * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * assert array_3d 5,3,4 == * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * assert array_3d 1,2,3 == * * * * * *",372,190,182,0.014,1.958,2025/11/05 17:15:57,0.0,0.0,0.949868073878628,665.073
"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",Prompt:Write function count total characters string. Assesments:assert count_charac python programming ==18 assert count_charac language ==8 assert count_charac words ==5,44,35,9,0.001,1.257,2025/11/05 17:15:57,0.0,0.0,0.3333333333333332,33.357
"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)]",Prompt:Write function sort given list based occurrence first element 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,148,27,0.002,1.182,2025/11/05 17:15:57,0.0,0.0,0.2673702726473174,73.694
"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",Prompt:Write python function find next perfect square greater given number. Assesments:assert next_Perfect_Square 35 ==36 assert next_Perfect_Square 6 ==9 assert next_Perfect_Square 9 ==16,60,47,13,0.001,1.277,2025/11/05 17:15:57,0.0,0.0,0.3509234828496041,33.846
"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","Prompt:Write function find maximum sum bi-tonic sub-sequence 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,90,33,0.001,1.367,2025/11/05 17:15:57,0.0,0.0,0.4300791556728232,55.365
"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",Prompt:Write function computing square roots using babylonian method. Assesments:assert babylonian_squareroot 10 ==3.162277660168379 assert babylonian_squareroot 2 ==1.414213562373095 assert babylonian_squareroot 9 ==3.0,72,67,5,0.001,1.075,2025/11/05 17:15:57,0.0,0.0,0.1732629727352682,33.341
"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 ",Prompt:Write function find longest palindromic subsequence given string. Assesments:assert lps TENS TENS ==5 assert lps CARDIO CARDS ==7 assert lps PART JOURNEY IS PART ==9,68,47,21,0.001,1.447,2025/11/05 17:15:57,0.0,1.0,0.5004397537379068,36.147
"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",Prompt:Write function calculate harmonic sum n-1 Assesments:assert harmonic_sum 7 == 2.5928571428571425 assert harmonic_sum 4 == 2.083333333333333 assert harmonic_sum 19 == 3.547739657143682,67,57,10,0.001,1.175,2025/11/05 17:15:57,0.0,0.0,0.2612137203166227,33.576
"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]","Prompt:Write function find intersection 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,120,38,0.002,1.317,2025/11/05 17:15:57,0.0,0.0,0.3861037818821459,59.282
"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","Prompt:Write python function count occcurences element 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,109,48,0.002,1.44,2025/11/05 17:15:57,0.0,0.0,0.4942832014072119,72.666
"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'] ",Prompt:Write function insert element element 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',107,97,10,0.001,1.103,2025/11/05 17:15:57,0.0,0.0,0.1978891820580474,53.646
"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)","Prompt:Write python function convert complex numbers 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,54,10,0.001,1.185,2025/11/05 17:15:57,0.0,0.0,0.2700087950747581,34.555
"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","Prompt:Write python function count integers 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,57,12,0.001,1.211,2025/11/05 17:15:57,0.0,0.0,0.2928759894459103,33.873
"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']",Prompt:Write function find words starting 'a' 'e' 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,59,9,0.001,1.153,2025/11/05 17:15:57,0.0,0.0,0.2418645558487247,38.936
"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')]","Prompt:Write function choose specified number colours three different colours generate combinations 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,181,27,0.002,1.149,2025/11/05 17:15:57,0.0,0.0,0.2383465259454705,85.515
"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",Prompt:Write python function count number prime numbers less given non-negative number. Assesments:assert count_Primes_nums 5 ==2 assert count_Primes_nums 10 ==4 assert count_Primes_nums 100 ==25,60,46,14,0.001,1.304,2025/11/05 17:15:57,0.0,0.0,0.3746701846965699,34.274
"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)","Prompt:Write function 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,48,5,0.001,1.104,2025/11/05 17:15:57,0.0,0.0,0.1987686895338611,33.655
"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","Prompt:Write function find number odd elements 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,74,20,0.001,1.27,2025/11/05 17:15:57,0.0,0.0,0.3447669305189094,41.428
"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))",Prompt:Write function maximize 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,169,75,0.003,1.444,2025/11/05 17:15:57,0.0,0.0,0.497801231310466,80.145
"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",Prompt:Write function find nth newman–shanks–williams prime number. Assesments:assert newman_prime 3 ==7 assert newman_prime 4 ==17 assert newman_prime 5 ==41,56,45,11,0.001,1.244,2025/11/05 17:15:57,0.0,0.0,0.3218997361477572,33.429
"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)",Prompt:Write function perform mathematical division operation across 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,100,36,0.001,1.36,2025/11/05 17:15:57,0.0,0.0,0.4239226033421285,66.916
"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'])","Prompt:Write function split given list two parts where the length first part 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,133,16,0.001,1.12,2025/11/05 17:15:57,0.0,1.5,0.2128408091468778,65.393
"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}",Prompt:Write function 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,144,16,0.001,1.111,2025/11/05 17:15:57,0.0,0.0,0.2049252418645558,56.242
"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",Prompt:Write function calculate dog's age dog's years. Assesments:assert dog_age 12 ==61 assert dog_age 15 ==73 assert dog_age 24 ==109,41,35,6,0.001,1.171,2025/11/05 17:15:57,0.0,0.0,0.2576956904133685,33.526
"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']] ","Prompt:Write function split list 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'",215,208,7,0.002,1.034,2025/11/05 17:15:57,0.0,0.0,0.1372031662269129,60.933
"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",Prompt:Write function find lateral surface area cube. Assesments:assert lateralsurface_cube 5 ==100 assert lateralsurface_cube 9 ==324 assert lateralsurface_cube 10 ==400,48,41,7,0.001,1.171,2025/11/05 17:15:57,0.0,0.0,0.2576956904133685,33.715
"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",Prompt:Write python function find sum squares first n odd natural numbers. Assesments:assert square_Sum 2 ==10 assert square_Sum 3 ==35 assert square_Sum 4 ==84,55,42,13,0.001,1.31,2025/11/05 17:15:57,0.0,0.0,0.3799472295514512,34.089
"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",Prompt:Write function find n'th star number. Assesments:assert find_star_num 3 ==37 assert find_star_num 4 ==73 assert find_star_num 5 == 121,49,39,10,0.001,1.256,2025/11/05 17:15:57,0.0,0.0,0.3324538258575197,33.271
"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",Prompt:Write function find ascii value character. Assesments:assert ascii_value 'A' ==65 assert ascii_value 'R' ==82 assert ascii_value 'S' ==83,44,37,7,0.001,1.189,2025/11/05 17:15:57,0.0,0.0,0.2735268249780123,36.049
"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","Prompt:Write python function find sum even numbers 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,86,30,0.001,1.349,2025/11/05 17:15:57,0.0,0.0,0.4142480211081794,48.363
"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",Prompt:Write python function find sum fifth power 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,53,11,0.001,1.208,2025/11/05 17:15:57,0.0,0.0,0.2902374670184696,34.312
"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]",Prompt:Write function perfom rear element extraction list 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,120,32,0.002,1.267,2025/11/05 17:15:57,0.0,0.0,0.3421284080914686,54.038
"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)","Prompt:Write function substract contents one tuple corresponding index 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,86,33,0.001,1.384,2025/11/05 17:15:57,0.0,0.0,0.4450307827616533,56.457
"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",Prompt:Write python function find sum 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,56,11,0.001,1.196,2025/11/05 17:15:57,0.0,0.0,0.279683377308707,33.533
"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","Prompt:Write python function find position last removed element 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,62,15,0.001,1.242,2025/11/05 17:15:57,0.0,0.0,0.3201407211961301,36.163
"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","Prompt:Write function find volume cylinder. Assesments:assert volume_cylinder 10,5 ==1570.7500000000002 assert volume_cylinder 4,5 ==251.32000000000002 assert volume_cylinder 4,10 ==502.64000000000004",68,61,7,0.001,1.115,2025/11/05 17:15:57,0.0,0.0,0.20844327176781,33.618
"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}","Prompt:Write function filter dictionary based 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,159,21,0.001,1.132,2025/11/05 17:15:57,0.0,0.0,0.2233948988566401,55.485
"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",Prompt:Write function find element count occurs record 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,70,34,0.001,1.486,2025/11/05 17:15:57,0.0,0.0,0.534740545294635,44.867
"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",Prompt:Write function find nth decagonal number. Assesments:assert is_num_decagonal 3 ==27 assert is_num_decagonal 7 == 175 assert is_num_decagonal 10 == 370,52,43,9,0.001,1.209,2025/11/05 17:15:57,0.0,0.0,0.2911169744942832,33.342
"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)","Prompt:Write function search element given array 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,95,32,0.001,1.337,2025/11/05 17:15:57,0.0,0.0,0.4036939313984168,55.864
"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","Prompt:Write python function check if the elements given list are unique 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,58,10,0.001,1.172,2025/11/05 17:15:57,0.0,1.5,0.258575197889182,36.097
"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]","Prompt:Write function substaract two lists using map 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,72,11,0.001,1.153,2025/11/05 17:15:57,0.0,0.0,0.2418645558487247,40.856
"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",Prompt:Write python function check whether frequency digit is less equal digit itself. Assesments:assert validate 1234 == True assert validate 51241 == False assert validate 321 == True,53,39,14,0.001,1.359,2025/11/05 17:15:57,0.0,1.0,0.4230430958663148,36.205
"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","Prompt:Write function check whether items list are equal 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,56,25,0.001,1.446,2025/11/05 17:15:57,0.0,1.0,0.4995602462620931,41.302
"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!')",Prompt:Write function matches string has an a followed two 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 match!,67,54,13,0.001,1.241,2025/11/05 17:15:57,0.0,3.0,0.3192612137203167,36.993
"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",Prompt:Write function find largest sum contiguous array modified array which is formed repeating 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,84,28,0.001,1.333,2025/11/05 17:15:57,0.0,2.0,0.4001759014951626,46.403
"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",Prompt:Write python function find sum squares first n even natural numbers. Assesments:assert square_Sum 2 ==20 assert square_Sum 3 ==56 assert square_Sum 4 == 120,55,43,12,0.001,1.279,2025/11/05 17:15:57,0.0,0.0,0.3526824978012312,34.094
"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",Prompt:Write function count array elements modular inverse given prime numberp equal 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,73,30,0.001,1.411,2025/11/05 17:15:57,0.0,0.0,0.4687774846086192,44.497
"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",Prompt:Write python function calculate number odd days given year. Assesments:assert odd_Days 100 ==5 assert odd_Days 50 ==6 assert odd_Days 75 ==2,53,40,13,0.001,1.325,2025/11/05 17:15:57,0.0,0.0,0.3931398416886543,34.2
"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])","Prompt:Write function find list lists 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,94,30,0.001,1.319,2025/11/05 17:15:57,0.0,0.0,0.387862796833773,58.402
"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",Prompt:Write function find number ways painting fence 2 adjacent posts have the same color given fence n posts 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,65,25,0.001,1.385,2025/11/05 17:15:57,0.0,3.0,0.445910290237467,41.222
"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","Prompt:Write python function find quotient two numbers. Assesments:assert find 10,3 ==3 assert find 4,2 ==2 assert find 20,5 ==4",49,38,11,0.001,1.289,2025/11/05 17:15:57,0.0,0.0,0.3614775725593667,33.369
"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","Prompt:Write function find third side 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,60,7,0.001,1.117,2025/11/05 17:15:57,0.0,0.0,0.2102022867194371,33.887
"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",Prompt:Write function find maximum value 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,67,18,0.001,1.269,2025/11/05 17:15:57,0.0,0.0,0.3438874230430958,42.46
"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",Prompt:Write function return sum divisors number. Assesments:assert sum_div 8 ==7 assert sum_div 12 ==16 assert sum_div 7 ==1,44,35,9,0.001,1.257,2025/11/05 17:15:57,0.0,0.0,0.3333333333333332,33.853
"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","Prompt:Write python function count inversions 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,67,12,0.001,1.179,2025/11/05 17:15:57,0.0,0.0,0.2647317502198769,34.321
"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]","Prompt:Write function flatten 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,166,65,0.002,1.392,2025/11/05 17:15:57,0.0,0.0,0.4520668425681617,87.36
"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'], []]",Prompt:Write function find nested list elements which are present 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,173,53,0.002,1.306,2025/11/05 17:15:57,0.0,2.0,0.376429199648197,86.718
"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)","Prompt:Write function calculate maximum aggregate 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 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,152,27,0.001,1.178,2025/11/05 17:15:57,0.0,0.0,0.2638522427440632,55.207
"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",Prompt:Write function find count binary sequences length2n sum first n bits is same as sum 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,60,16,0.001,1.267,2025/11/05 17:15:57,0.0,3.0,0.3421284080914686,37.104
"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",Prompt:Write function find depth 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,67,15,0.001,1.224,2025/11/05 17:15:57,0.0,0.0,0.3043095866314863,39.986
"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",Prompt:Write python function find significant bit number which is also set bit. Assesments:assert set_Bit_Number 6 ==4 assert set_Bit_Number 10 ==8 assert set_Bit_Number 18 ==16,59,46,13,0.001,1.283,2025/11/05 17:15:57,0.0,2.0,0.3562005277044854,34.49
"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","Prompt:Write python function check whether count inversion 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,56,10,0.001,1.179,2025/11/05 17:15:57,0.0,3.0,0.2647317502198769,36.817
"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","Prompt:Write python function find element given index number 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,97,17,0.001,1.175,2025/11/05 17:15:57,0.0,0.0,0.2612137203166227,41.864
"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')",Prompt:Write function match two words list words starting letter 'p'. Assesments:assert start_withp Python PHP Java JavaScript cc++== 'Python' 'PHP' assert start_withp Python Programming Java Programming == 'Python' 'Programming' assert start_withp Pqrst Pqr qrstuv == 'Pqrst' 'Pqr',87,71,16,0.001,1.225,2025/11/05 17:15:57,0.0,0.0,0.3051890941073,41.683
"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",Prompt:Write function find maximum sum increasing subsequence prefix till ith index also including given kth element which is afteri.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,118,46,0.002,1.39,2025/11/05 17:15:57,0.0,4.0,0.4503078276165346,67.731
"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)","Prompt:Write function get colon 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,78,36,0.001,1.462,2025/11/05 17:15:57,0.0,0.0,0.5136323658751099,53.813
"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]","Prompt:Write function find specified number largest products 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,131,47,0.002,1.359,2025/11/05 17:15:57,0.0,0.0,0.4230430958663148,76.905
"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","Prompt:Write python function find maximum two numbers. Assesments:assert maximum 5,10 ==10 assert maximum -1 -2 ==-1 assert maximum 9,7 ==9",50,39,11,0.001,1.282,2025/11/05 17:15:57,0.0,0.0,0.3553210202286719,36.686
"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')",Prompt:Write function convert given string 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,92,7,0.001,1.076,2025/11/05 17:15:57,0.0,0.0,0.1741424802110818,46.174
"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",Prompt:Write python function set left 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,50,12,0.001,1.24,2025/11/05 17:15:57,0.0,0.0,0.318381706244503,33.773
"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","Prompt:Write function find volume cone. Assesments:assert volume_cone 5,12 ==314.15926535897927 assert volume_cone 10,15 ==1570.7963267948965 assert volume_cone 19,17 ==6426.651371693521",68,61,7,0.001,1.115,2025/11/05 17:15:57,0.0,0.0,0.20844327176781,33.589
"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","Prompt:Write python function print positive numbers 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,58,10,0.001,1.172,2025/11/05 17:15:57,0.0,0.0,0.258575197889182,34.687
"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",Prompt:Write function find maximum sum two chosen numbers are adjacent given rectangular grid dimension2xn. 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,105,54,0.002,1.514,2025/11/05 17:15:57,0.0,1.0,0.5593667546174143,65.846
"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""",Prompt:Write python function find first maximum length 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,50,15,0.001,1.3,2025/11/05 17:15:57,0.0,0.0,0.3711521547933157,34.109
"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",Prompt:Write function find index last occurrence given number 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,104,47,0.001,1.452,2025/11/05 17:15:57,0.0,0.0,0.5048372911169744,68.597
"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']","Prompt:Write function reflect modified run-length encoding 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,122,15,0.001,1.123,2025/11/05 17:15:57,0.0,0.0,0.2154793315743183,59.342
"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",Prompt:Write python function find maximum volume cuboid given sum sides. Assesments:assert max_volume 8 ==18 assert max_volume 4 ==2 assert max_volume 1 ==0,54,39,15,0.001,1.385,2025/11/05 17:15:57,0.0,0.0,0.445910290237467,34.597
"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']",Prompt:Write function find five characters long word given string using regex. Assesments:assert find_long_word 'Please move back strem' == 'strem' assert find_long_word '4K Ultra HD streaming player' == 'Ultra' assert find_long_word 'Streaming Media Player' == 'Media',70,63,7,0.001,1.111,2025/11/05 17:15:57,0.0,0.0,0.2049252418645558,38.664
"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",Prompt:Write function calculate difference squared sum first n natural numbers sum squared first n natural numbers. Assesments:assert sum_difference 12 ==5434 assert sum_difference 20 ==41230 assert sum_difference 54 ==2151270,59,48,11,0.001,1.229,2025/11/05 17:15:57,0.0,0.0,0.3087071240105541,36.064
"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'",Prompt:Write function find demlo number given number. Assesments:assert find_demlo 111111 == '12345654321' assert find_demlo 1111 == '1234321' assert find_demlo 13333122222 == '123456789101110987654321',70,62,8,0.001,1.129,2025/11/05 17:15:57,0.0,0.0,0.2207563764291996,33.854
"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]","Prompt:Write function find index positions minimum values 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,108,13,0.001,1.12,2025/11/05 17:15:57,0.0,0.0,0.2128408091468778,36.003
"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]",Prompt:Write function re-arrange given array alternating positive 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,135,56,0.002,1.415,2025/11/05 17:15:57,0.0,0.0,0.4722955145118733,75.842
"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)",Prompt:Write function extract sum alternate chains 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,81,28,0.001,1.346,2025/11/05 17:15:57,0.0,0.0,0.4116094986807388,52.366
"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",Prompt:Write python function find minimum number squares whose sum is equal given number. Assesments:assert get_Min_Squares 6 ==3 assert get_Min_Squares 2 ==2 assert get_Min_Squares 4 ==1,61,47,14,0.001,1.298,2025/11/05 17:15:57,0.0,1.0,0.3693931398416887,34.829
"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'",Prompt:Write function get word number occurrences given strings list. Assesments:assert most_occurrences UTS is best RTF RTF love UTS UTS is best == 'UTS' assert most_occurrences great year year is so worse year is okay == 'year' assert most_occurrences Families can be reunited people can be reunited Tasks can be achieved == 'can',112,77,35,0.001,1.455,2025/11/05 17:15:57,0.0,1.6,0.5074758135444152,54.863
"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","Prompt:Write function print check if the triangle is isosceles not. Assesments:assert check_isosceles 6,8,12 ==False assert check_isosceles 6,6,12 ==True assert check_isosceles 6,16,20 ==False",67,62,5,0.001,1.081,2025/11/05 17:15:57,0.0,1.5,0.1785400175901494,34.395
"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]","Prompt:Write function rotate given list specified number items 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,157,62,0.002,1.395,2025/11/05 17:15:57,0.0,0.0,0.4547053649956024,79.573
"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","Prompt:Write python function count negative numbers 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,55,12,0.001,1.218,2025/11/05 17:15:57,0.0,0.0,0.299032541776605,35.064
"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']",Prompt:Write function find three four five characters long words given string using regex. Assesments:assert find_char 'For four consumer complaints contact manager AKR reddy' == 'For' 'the' 'four' 'AKR' 'reddy' assert find_char 'Certain service are subject change MSR' == 'are' 'MSR' assert find_char 'Third party legal desclaimers' == 'Third' 'party' 'legal',104,94,10,0.001,1.106,2025/11/05 17:15:57,0.0,1.0,0.2005277044854882,46.027
"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",Prompt:Write python function count unset bits given number. Assesments:assert count_unset_bits 2 ==1 assert count_unset_bits 4 ==2 assert count_unset_bits 6 ==1,54,42,12,0.001,1.286,2025/11/05 17:15:57,0.0,0.0,0.3588390501319261,33.365
"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}",Prompt:Write function count character frequency 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,107,40,0.001,1.374,2025/11/05 17:15:57,0.0,0.0,0.4362357080035181,52.501
"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]]",Prompt:Write python function sort list according second element 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,154,33,0.002,1.214,2025/11/05 17:15:57,0.0,0.0,0.2955145118733508,64.419
"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","Prompt:Write python function check whether triangle is valid 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,55,10,0.001,1.182,2025/11/05 17:15:57,0.0,1.0,0.2673702726473174,36.106
"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","Prompt:Write function find sum 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,46,6,0.001,1.13,2025/11/05 17:15:57,0.0,0.0,0.2216358839050131,33.576
"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",Prompt:Write function check whether given month name contains 28 days not. Assesments:assert check_monthnum February ==True assert check_monthnum January ==False assert check_monthnum March ==False,49,40,9,0.001,1.225,2025/11/05 17:15:57,0.0,0.0,0.3051890941073,33.842
"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!')",Prompt:Write function matches word end string optional punctuation. Assesments:assert text_match_word python. == 'Found match! assert text_match_word python. == 'Found match! assert text_match_word lang. == 'Not matched!,67,48,19,0.001,1.396,2025/11/05 17:15:57,0.0,0.0,0.4555848724714159,38.882
"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",Prompt:Write python function count number substrings first 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,60,12,0.001,1.2,2025/11/05 17:15:57,0.0,0.0,0.2832014072119612,34.638
"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","Prompt:Write python function find maximum occuring divisor interval. Assesments:assert find_Divisor 2,2 ==2 assert find_Divisor 2,5 ==2 assert find_Divisor 5,10 ==2",62,49,13,0.001,1.265,2025/11/05 17:15:57,0.0,0.0,0.3403693931398416,33.758
"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","Prompt:Write python function find sum three lowest positive numbers given list 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,79,16,0.001,1.203,2025/11/05 17:15:57,0.0,0.0,0.2858399296394019,35.1
"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)",Prompt:Write function convert given set 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,93,36,0.001,1.387,2025/11/05 17:15:57,0.0,0.0,0.4476693051890941,47.896
"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)",Prompt:Write function find smallest range includes at-least one element 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,136,58,0.002,1.426,2025/11/05 17:15:57,0.0,0.0,0.4819700967458222,75.554
"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)","Prompt:Write function calculate number digits letters string. Assesments:assert dig_let python == 6,0 assert dig_let program == 7,0 assert dig_let python3.0 == 6,2",60,47,13,0.001,1.277,2025/11/05 17:15:57,0.0,0.0,0.3509234828496041,35.992
"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","Prompt:Write python function find number elements odd factors 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,53,14,0.001,1.264,2025/11/05 17:15:57,0.0,0.0,0.3394898856640281,34.162
"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]",Prompt:Write function find difference two consecutive numbers 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,127,51,0.002,1.402,2025/11/05 17:15:57,0.0,0.0,0.4608619173262971,77.578
"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",Prompt:Write function find entringer numbere n k Assesments:assert zigzag 4 3 ==5 assert zigzag 4 2 ==4 assert zigzag 3 1 ==1,57,42,15,0.001,1.357,2025/11/05 17:15:57,0.0,0.0,0.4212840809146877,34.191
"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","Prompt:Write python function count number squares rectangle. Assesments:assert count_Squares 4,3 ==20 assert count_Squares 1,2 ==2 assert count_Squares 2,2 ==5",58,44,14,0.001,1.318,2025/11/05 17:15:57,0.0,0.0,0.3869832893579595,33.943
"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",Prompt:Write function count sequences given length non-negative prefix sums can be generated given values. Assesments:assert find_ways 4 ==2 assert find_ways 6 ==5 assert find_ways 8 ==14,60,46,14,0.001,1.304,2025/11/05 17:15:57,0.0,2.0,0.3746701846965699,34.94
"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""",Prompt:Write python function check whether given string is a binary string not. Assesments:assert check 01010101010 == Yes assert check name0 == assert check 101 == Yes,54,39,15,0.001,1.385,2025/11/05 17:15:57,0.0,2.0,0.445910290237467,34.625
"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",Prompt:Write python function minimize length string removing occurrence one character. Assesments:assert minimum_Length mnm ==1 assert minimum_Length abcda ==3 assert minimum_Length abcb ==2,57,38,19,0.001,1.5,2025/11/05 17:15:57,0.0,0.0,0.5470536499560246,34.688
"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","Prompt:Write python function find first element occurringk times 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,87,13,0.001,1.149,2025/11/05 17:15:57,0.0,0.0,0.2383465259454705,35.019
"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",Prompt:Write python function check whether characters given string are unique. Assesments:assert unique_Characters 'aba' == False assert unique_Characters 'abc' == True assert unique_Characters 'abab' == False,52,44,8,0.001,1.182,2025/11/05 17:15:57,0.0,1.0,0.2673702726473174,34.525
"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]]","Prompt:Write function remove specified column 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,133,52,0.002,1.391,2025/11/05 17:15:57,0.0,0.0,0.4511873350923482,82.146
"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","Prompt:Write function find t-nth term 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,51,5,0.001,1.098,2025/11/05 17:15:57,0.0,0.0,0.1934916446789798,33.254
"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",Prompt:Write python function count number rectangles circle radiusr. Assesments:assert count_Rectangles 2 ==8 assert count_Rectangles 1 ==1 assert count_Rectangles 0 ==0,55,40,15,0.001,1.375,2025/11/05 17:15:57,0.0,0.0,0.4371152154793316,34.31
"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","Prompt:Write function find third angle triangle using two angles. Assesments:assert find_angle 47,89 ==44 assert find_angle 45,95 ==40 assert find_angle 50,40 ==90",50,43,7,0.001,1.163,2025/11/05 17:15:57,0.0,0.0,0.2506596306068602,33.885
"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",Prompt:Write function find maximum element 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,90,41,0.001,1.456,2025/11/05 17:15:57,0.0,0.0,0.5083553210202286,62.459
"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]","Prompt:Write function find modulo division two lists using map 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,75,16,0.001,1.213,2025/11/05 17:15:57,0.0,0.0,0.2946350043975374,41.384
"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""","Prompt:Write python function check whether one root quadratic equation is twice not. Assesments:assert Check_Solution 1,3,2 == Yes assert Check_Solution 1,2,3 == assert Check_Solution 1 -5,6 ==",72,53,19,0.001,1.358,2025/11/05 17:15:57,0.0,1.0,0.4221635883905014,36.073
"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",Prompt:Write function find nth carol number. Assesments:assert get_carol 2 ==7 assert get_carol 4 == 223 assert get_carol 5 == 959,51,40,11,0.001,1.275,2025/11/05 17:15:58,0.0,0.0,0.349164467897977,33.208
"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']","Prompt:Write function remove empty lists given list 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,93,40,0.002,1.43,2025/11/05 17:15:58,0.0,0.0,0.4854881266490764,50.864
"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","Prompt:Write python function find item maximum occurrences 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,87,14,0.001,1.161,2025/11/05 17:15:58,0.0,0.0,0.248900615655233,34.345
"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)]",Prompt:Write function add k elements element 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,143,64,0.002,1.448,2025/11/05 17:15:58,0.0,0.0,0.5013192612137203,84.877
"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 ",Prompt:Write function find number flips required make given binary string sequence 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,78,61,17,0.001,1.279,2025/11/05 17:15:58,0.0,0.0,0.3526824978012312,35.348
"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",Prompt:Write python function count number digits given number. Assesments:assert count_Digit 12345 ==5 assert count_Digit 11223305 ==8 assert count_Digit 4123459 ==7,58,44,14,0.001,1.318,2025/11/05 17:15:58,0.0,0.0,0.3869832893579595,33.911
"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","Prompt:Write python function find largest product pair adjacent elements given list 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,63,17,0.001,1.27,2025/11/05 17:15:58,0.0,0.0,0.3447669305189094,36.269
"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 ",Prompt:Write function check if a binary tree is balanced not. Assesments:assert is_tree_balanced root == False assert is_tree_balanced root1 == True assert is_tree_balanced root2 == False,52,43,9,0.001,1.209,2025/11/05 17:15:58,0.0,1.5,0.2911169744942832,34.327
"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))",Prompt:Write function repeat 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,95,36,0.001,1.379,2025/11/05 17:15:58,0.0,0.0,0.4406332453825857,63.864
"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","Prompt:Write function find lateral surface area cuboid Assesments:assert lateralsurface_cuboid 8,5,6 ==156 assert lateralsurface_cuboid 7,9,10 ==320 assert lateralsurface_cuboid 10,20,30 ==1800",66,60,6,0.001,1.1,2025/11/05 17:15:58,0.0,0.0,0.1952506596306069,33.685
"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')] ",Prompt:Write function sort tuple 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',180,163,17,0.002,1.104,2025/11/05 17:15:58,0.0,0.0,0.1987686895338611,68.526
"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",Prompt:Write function find smallest missing element 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,86,38,0.001,1.442,2025/11/05 17:15:58,0.0,0.0,0.496042216358839,54.538
"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]",Prompt:Write function sort given list elements 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,154,65,0.002,1.422,2025/11/05 17:15:58,0.0,0.0,0.4784520668425681,66.962
"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","Prompt:Write function find volume cuboid. Assesments:assert volume_cuboid 1,2,3 ==6 assert volume_cuboid 5,7,9 ==315 assert volume_cuboid 10,15,21 ==3150",60,53,7,0.001,1.132,2025/11/05 17:15:58,0.0,0.0,0.2233948988566401,33.564
"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']",Prompt:Write function print permutations 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,161,5,0.001,1.031,2025/11/05 17:15:58,0.0,0.0,0.1345646437994722,67.576
"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","Prompt:Write function round given number nearest multiple specific number. Assesments:assert round_num 4722,10 ==4720 assert round_num 1111,5 ==1110 assert round_num 219,2 ==218",56,47,9,0.001,1.191,2025/11/05 17:15:58,0.0,0.0,0.2752858399296394,34.224
"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')",Prompt:Write function remove tuple elements occur replace duplicates 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,182,59,0.002,1.324,2025/11/05 17:15:58,0.0,0.0,0.3922603342128408,88.521
"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""",Prompt:Write python function remove occurrences character given string. Assesments:assert remove_Char aba 'a' ==b assert remove_Char toggle 'g' == tole assert remove_Char aabbc 'b' == aac,64,49,15,0.001,1.306,2025/11/05 17:15:58,0.0,0.0,0.376429199648197,35.079
"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]","Prompt:Write python function shift last element first position 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,77,11,0.001,1.143,2025/11/05 17:15:58,0.0,0.0,0.2330694810905892,35.002
"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","Prompt:Write function find surface area cuboid. Assesments:assert surfacearea_cuboid 1,2,3 ==22 assert surfacearea_cuboid 5,7,9 ==286 assert surfacearea_cuboid 10,15,21 ==1350",64,57,7,0.001,1.123,2025/11/05 17:15:58,0.0,0.0,0.2154793315743183,33.691
"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]]","Prompt:Write function generate 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,431,201,0.008,1.466,2025/11/05 17:15:58,0.0,0.0,0.5171503957783641,243.586
"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)]","Prompt:Write function sort list lists given index 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,268,62,0.003,1.231,2025/11/05 17:15:58,0.0,0.0,0.3104661389621812,102.342
"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","Prompt:Write function find number rotations 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,78,32,0.001,1.41,2025/11/05 17:15:58,0.0,0.0,0.4678979771328055,44.852
"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",Prompt:Write python function toggle odd bits 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,42,13,0.001,1.31,2025/11/05 17:15:58,0.0,0.0,0.3799472295514512,33.832
"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","Prompt:Write python function find frequency smallest value 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,87,15,0.001,1.172,2025/11/05 17:15:58,0.0,0.0,0.258575197889182,35.889
"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",Prompt:Write function find n'th perrin number using recursion. Assesments:assert get_perrin 9 ==12 assert get_perrin 4 ==2 assert get_perrin 6 ==5,52,41,11,0.001,1.268,2025/11/05 17:15:58,0.0,0.0,0.3430079155672823,33.349
"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",Prompt:Write function find minimum swaps required bracket balancing given string. Assesments:assert swap_count ==2 assert swap_count ==0 assert swap_count ==1,59,32,27,0.001,1.844,2025/11/05 17:15:58,0.0,0.0,0.8496042216358839,35.48
"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""",Prompt:Write python function check whether hexadecimal number is even odd. Assesments:assert even_or_odd AB3454D ==Odd assert even_or_odd ABC == Even assert even_or_odd AAD == Odd,59,45,14,0.001,1.311,2025/11/05 17:15:58,0.0,1.0,0.3808267370272646,34.604
"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",Prompt:Write python function find highest power 2 is less equal n. Assesments:assert highest_Power_of_2 10 ==8 assert highest_Power_of_2 19 ==16 assert highest_Power_of_2 32 ==32,68,52,16,0.001,1.308,2025/11/05 17:15:58,0.0,1.0,0.3781882145998241,36.11
"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",Prompt:Write function find n'th lucas number. Assesments:assert find_lucas 9 ==76 assert find_lucas 4 ==7 assert find_lucas 3 ==4,53,42,11,0.001,1.262,2025/11/05 17:15:58,0.0,0.0,0.337730870712401,33.167
"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']","Prompt:Write function insert given string beginning items 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,117,10,0.001,1.085,2025/11/05 17:15:58,0.0,0.0,0.1820580474934036,56.703
"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}}]","Prompt:Write function convert one list 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,199,77,0.002,1.387,2025/11/05 17:15:58,0.0,0.0,0.4476693051890941,85.867
"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",Prompt:Write function find maximum sum possible using given equationf 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,63,21,0.001,1.333,2025/11/05 17:15:58,0.0,0.0,0.4001759014951626,42.261
"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])","Prompt:Write function find list 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,131,19,0.001,1.145,2025/11/05 17:15:58,0.0,0.0,0.2348284960422163,55.862
"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",Prompt:Write function check if given tuple is distinct 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,64,20,0.001,1.312,2025/11/05 17:15:58,0.0,1.0,0.3817062445030783,41.372
"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""",Prompt:Write python function find first non-repeated character given string. Assesments:assert first_non_repeating_character abcabc == None assert first_non_repeating_character abc == assert first_non_repeating_character ababc ==c,63,46,17,0.001,1.37,2025/11/05 17:15:58,0.0,0.0,0.4327176781002639,33.884
"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""",Prompt:Write function check whether given string starts ends character using regex. Assesments:assert check_char abba == Valid assert check_char == Valid assert check_char abcd == Invalid,57,37,20,0.001,1.541,2025/11/05 17:15:58,0.0,0.0,0.5831134564643798,34.713
"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","Prompt:Write function find median 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,53,6,0.001,1.113,2025/11/05 17:15:58,0.0,0.0,0.2066842568161829,33.68
"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","Prompt:Write function compute sum digits number 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,64,13,0.001,1.203,2025/11/05 17:15:58,0.0,0.0,0.2858399296394019,38.046
"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)",Prompt:Write function perform mathematical bitwise xor operation across 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,108,40,0.002,1.37,2025/11/05 17:15:58,0.0,0.0,0.4327176781002639,67.03
"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",Prompt:Write function extract frequency unique tuples 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,80,38,0.001,1.475,2025/11/05 17:15:58,0.0,0.0,0.5250659630606861,53.975
"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))",Prompt:Write function perform index wise addition tuple elements 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,181,77,0.003,1.425,2025/11/05 17:15:58,0.0,0.0,0.4810905892700088,82.547
"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","Prompt:Write function compute value 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,53,7,0.001,1.132,2025/11/05 17:15:58,0.0,0.0,0.2233948988566401,33.475
"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",Prompt:Write function check if a url is valid 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,51,12,0.001,1.235,2025/11/05 17:15:58,0.0,1.5,0.3139841688654354,34.672
"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","Prompt:Write python function find minimum two numbers. Assesments:assert minimum 1,2 ==1 assert minimum -5 -4 ==-5 assert minimum 0,0 ==0",50,39,11,0.001,1.282,2025/11/05 17:15:58,0.0,0.0,0.3553210202286719,33.892
"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","Prompt:Write function check whether element exists within tuple. Assesments:assert check_tuplex w 3 r e u r c e 'r' ==True assert check_tuplex w 3 r e u r c e '5' ==False assert check_tuplex w 3 r e u r c e,3 ==True",138,71,67,0.001,1.944,2025/11/05 17:15:58,0.0,0.0,0.937554969217238,57.915
"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""",Prompt:Write python function find parity given number. Assesments:assert find_Parity 12 == Even Parity assert find_Parity 7 == Odd Parity assert find_Parity 10 == Even Parity,58,44,14,0.001,1.318,2025/11/05 17:15:58,0.0,0.0,0.3869832893579595,33.849
"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",Prompt:Write function create next bigger number rearranging digits given number. Assesments:assert rearrange_bigger 12 ==21 assert rearrange_bigger 10 ==False assert rearrange_bigger 102 ==120,54,45,9,0.001,1.2,2025/11/05 17:15:58,0.0,0.0,0.2832014072119612,34.452
"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]]","Prompt:Write function find k number pairs which consist one element first array one element 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,123,29,0.002,1.236,2025/11/05 17:15:58,0.0,1.0,0.3148636763412489,65.429
"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","Prompt:Write function find minimum product pairs tuples within 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,79,28,0.001,1.354,2025/11/05 17:15:58,0.0,0.0,0.4186455584872472,50.074
"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",Prompt:Write function find minimum value 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,67,18,0.001,1.269,2025/11/05 17:15:58,0.0,0.0,0.3438874230430958,41.46
"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'",Prompt:Write function convert given snake case string camel case string 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,61,5,0.001,1.082,2025/11/05 17:15:58,0.0,0.0,0.1794195250659631,34.494
"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]","Prompt:Write python function remove odd numbers 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,60,10,0.001,1.167,2025/11/05 17:15:58,0.0,0.0,0.2541776605101143,34.418
"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]","Prompt:Write function extract nth element given list 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,191,40,0.002,1.209,2025/11/05 17:15:58,0.0,0.0,0.2911169744942832,69.843
"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","Prompt:Write python function check whether value exists sequence 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,70,11,0.001,1.157,2025/11/05 17:15:58,0.0,0.0,0.2453825857519789,36.274
"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)","Prompt:Write python function find pair highest product given array 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,77,13,0.001,1.169,2025/11/05 17:15:58,0.0,0.0,0.2559366754617414,40.436
"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",Prompt:Write function find maximum sum can make dividing number three parts recursively summing together given number. Assesments:assert breakSum 12 ==13 assert breakSum 24 ==27 assert breakSum 23 ==23,64,45,19,0.001,1.422,2025/11/05 17:15:58,0.0,1.0,0.4784520668425681,37.129
"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')]",Prompt:Write function find common first element given list 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,130,12,0.001,1.092,2025/11/05 17:15:58,0.0,0.0,0.1882145998240985,65.276
"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]","Prompt:Write python function find sublist 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,98,5,0.001,1.051,2025/11/05 17:15:58,0.0,0.0,0.1521547933157431,49.236
"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","Prompt:Write function round every number given list numbers print total sum multiplied length 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,99,24,0.001,1.242,2025/11/05 17:15:58,0.0,0.0,0.3201407211961301,42.25
"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",Prompt:Write python function find cube sum first n even natural numbers. Assesments:assert cube_Sum 2 ==72 assert cube_Sum 3 == 288 assert cube_Sum 4 == 800,54,44,10,0.001,1.227,2025/11/05 17:15:58,0.0,0.0,0.306948109058927,33.901
"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'","Prompt:Write function concatenate element tuple 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,71,29,0.001,1.408,2025/11/05 17:15:58,0.0,2.0,0.4661389621811784,39.997
"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",Prompt:Write python function find average cubes 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,56,12,0.001,1.214,2025/11/05 17:15:58,0.0,0.0,0.2955145118733508,34.023
"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","Prompt:Write function 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,91,16,0.001,1.176,2025/11/05 17:15:58,0.0,0.0,0.2620932277924361,51.864
"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']",Prompt:Write function extract rear index element string 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,89,11,0.001,1.124,2025/11/05 17:15:58,0.0,0.0,0.216358839050132,44.364
"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","Prompt:Write function count number sublists containing 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,123,17,0.001,1.138,2025/11/05 17:15:58,0.0,0.0,0.2286719437115214,63.046
"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]","Prompt:Write function 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,103,17,0.001,1.165,2025/11/05 17:15:58,0.0,0.0,0.2524186455584872,39.862
"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'",Prompt:Write function convert date yyyy-mm-dd format dd-mm-yyyy format 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,81,9,0.001,1.111,2025/11/05 17:15:58,0.0,0.0,0.2049252418645558,34.764
"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]",Prompt:Write function sort given array 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,123,52,0.002,1.423,2025/11/05 17:15:58,0.0,0.0,0.4793315743183817,59.564
"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)",Prompt:Write function extract elementwise tuples 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,103,42,0.001,1.408,2025/11/05 17:15:58,0.0,0.0,0.4661389621811784,65.162
"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","Prompt:Write function find directrix parabola. Assesments:assert parabola_directrix 5,3,2 ==-198 assert parabola_directrix 9,8,4 ==-2336 assert parabola_directrix 2,4,6 ==-130",64,57,7,0.001,1.123,2025/11/05 17:15:58,0.0,0.0,0.2154793315743183,33.603
"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","Prompt:Write function takes two lists 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,93,5,0.001,1.054,2025/11/05 17:15:58,0.0,4.0,0.1547933157431838,39.544
"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","Prompt:Write function find median 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,58,7,0.001,1.121,2025/11/05 17:15:58,0.0,0.0,0.2137203166226912,33.59
"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'",Prompt:Write function check whether entered number is greater elements given array. Assesments:assert check_greater 1 2 3 4 5 4 == 'No entered number is less array' assert check_greater 2 3 4 5 6 8 == 'Yes entered number is greater array' assert check_greater 9 7 4 8 6 1 11 == 'Yes entered number is greater array',138,95,43,0.002,1.453,2025/11/05 17:15:58,0.0,1.0,0.5057167985927881,66.016
"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!')",Prompt:Write function matches string has an a followed one b's Assesments:assert text_match_one ac == 'Not matched! assert text_match_one dc == 'Not matched! assert text_match_one abba == 'Found match!,62,48,14,0.001,1.292,2025/11/05 17:15:58,0.0,3.0,0.3641160949868074,36.938
"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",Prompt:Write python function find last digit given number. Assesments:assert last_Digit 123 ==3 assert last_Digit 25 ==5 assert last_Digit 30 ==0,52,39,13,0.001,1.333,2025/11/05 17:15:58,0.0,0.0,0.4001759014951626,33.679
"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","Prompt:Write python function print negative numbers 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,65,9,0.001,1.138,2025/11/05 17:15:58,0.0,0.0,0.2286719437115214,35.579
"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"")",Prompt:Write function remove odd characters string. Assesments:assert remove_odd python == yhn assert remove_odd program == rga assert remove_odd language == agae,50,37,13,0.001,1.351,2025/11/05 17:15:58,0.0,0.0,0.4160070360598065,34.229
"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'",Prompt:Write function 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,110,41,0.001,1.373,2025/11/05 17:15:58,0.0,0.0,0.4353562005277044,67.053
"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","Prompt:Write function convert list multiple integers 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,64,12,0.001,1.188,2025/11/05 17:15:58,0.0,0.0,0.2726473175021987,35.677
"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')",Prompt:Write function find adverbs positions given sentence. Assesments:assert find_adverb_position clearly! can see sky == 0 7 'clearly' assert find_adverb_position seriously! are many roses == 0 9 'seriously' assert find_adverb_position unfortunately! sita is going home == 0 13 'unfortunately',96,73,23,0.001,1.315,2025/11/05 17:15:58,0.0,1.0,0.3843447669305188,45.282
"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",Prompt:Write function find surface area cube. Assesments:assert surfacearea_cube 5 ==150 assert surfacearea_cube 3 ==54 assert surfacearea_cube 10 ==600,44,37,7,0.001,1.189,2025/11/05 17:15:58,0.0,0.0,0.2735268249780123,33.579
"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",Prompt:Write function find ration positive numbers array 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,106,44,0.002,1.415,2025/11/05 17:15:58,0.0,0.0,0.4722955145118733,66.304
"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","Prompt:Write python function find largest negative number 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,64,10,0.001,1.156,2025/11/05 17:15:58,0.0,0.0,0.2445030782761652,36.664
"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)]'",Prompt:Write function trim tuple k 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,193,94,0.003,1.487,2025/11/05 17:15:58,0.0,0.0,0.5356200527704487,116.432
"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))",Prompt:Write function perform index wise multiplication tuple elements 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,180,80,0.003,1.444,2025/11/05 17:15:58,0.0,0.0,0.497801231310466,93.06
"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","Prompt:Write python function count occurence elements list 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,98,28,0.001,1.286,2025/11/05 17:15:58,0.0,0.0,0.3588390501319261,52.281
"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])","Prompt:Write function find cubes individual elements 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,95,32,0.001,1.337,2025/11/05 17:15:58,0.0,0.0,0.4036939313984168,54.856
"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",Prompt:Write function calculate sum perrin numbers. Assesments:assert cal_sum 9 ==49 assert cal_sum 10 ==66 assert cal_sum 11 ==88,47,35,12,0.001,1.343,2025/11/05 17:15:58,0.0,0.0,0.4089709762532981,33.55
"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'","Prompt:Write python function check whether triangle is valid 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,81,8,0.001,1.099,2025/11/05 17:15:58,0.0,1.0,0.1943711521547932,36.133
"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']","Prompt:Write function extract specified size strings give list 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,93,9,0.001,1.097,2025/11/05 17:15:58,0.0,0.0,0.1926121372031662,47.771
"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'",Prompt:Write function remove whitespaces given string using regex. Assesments:assert remove_whitespaces Google Flutter == 'GoogleFlutter' assert remove_whitespaces Google Dart == 'GoogleDart' assert remove_whitespaces iOS Swift == 'iOSSwift',69,55,14,0.001,1.255,2025/11/05 17:15:58,0.0,0.0,0.3315743183817061,34.392
"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","Prompt:Write function 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,53,4,0.001,1.075,2025/11/05 17:15:58,0.0,1.5,0.1732629727352682,34.371
"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",Prompt:Write python function find sum even factors number. Assesments:assert sumofFactors 18 ==26 assert sumofFactors 30 ==48 assert sumofFactors 6 ==8,53,39,14,0.001,1.359,2025/11/05 17:15:58,0.0,0.0,0.4230430958663148,33.989
"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!')",Prompt:Write function matches word containing 'z'. Assesments:assert text_match_wordz pythonz. == 'Found match! assert text_match_wordz xyz. == 'Found match! assert text_match_wordz lang. == 'Not matched!,64,51,13,0.001,1.255,2025/11/05 17:15:58,0.0,0.0,0.3315743183817061,34.922
"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",Prompt:Write function check whether given month number contains 31 days not. Assesments:assert check_monthnumb_number 5 ==True assert check_monthnumb_number 2 ==False assert check_monthnumb_number 6 ==False,55,49,6,0.001,1.122,2025/11/05 17:15:58,0.0,0.0,0.2145998240985049,33.753
"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']",Prompt:Write function reverse strings given list 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,120,-5,0.001,0.958,2025/11/05 17:15:58,-0.0,0.0,0.0703605980650835,54.274
"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']","Prompt:Write python function find sublist 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,84,7,0.001,1.083,2025/11/05 17:15:58,0.0,0.0,0.1802990325417765,52.106
"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","Prompt:Write function find area rectangle. Assesments:assert rectangle_area 10,20 ==200 assert rectangle_area 10,5 ==50 assert rectangle_area 4,2 ==8",46,39,7,0.001,1.179,2025/11/05 17:15:58,0.0,0.0,0.2647317502198769,33.566
"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'",Prompt:Write function remove uppercase substrings given string using regex. Assesments:assert remove_uppercase 'cAstyoUrFavoRitETVshoWs' == 'cstyoravoitshos' assert remove_uppercase 'wAtchTheinTernEtrAdIo' == 'wtchheinerntrdo' assert remove_uppercase 'VoicESeaRchAndreComMendaTionS' == 'oiceachndreomendaion',105,100,5,0.001,1.05,2025/11/05 17:15:58,0.0,0.0,0.1512752858399296,34.083
"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]","Prompt:Write python function get first element 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,76,22,0.001,1.289,2025/11/05 17:15:58,0.0,0.0,0.3614775725593667,51.607
"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",Prompt:Write python function count upper case characters given string. Assesments:assert upper_ctr 'PYthon' ==1 assert upper_ctr 'BigData' ==1 assert upper_ctr 'program' ==0,52,42,10,0.001,1.238,2025/11/05 17:15:58,0.0,0.0,0.3166226912928759,33.753
"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']]",Prompt:Write function find possible combinations elements 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,837,13,0.018,1.016,2025/11/05 17:15:58,0.0,0.0,0.1213720316622691,572.501
"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",Prompt:Write function find maximum product subarray 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,73,25,0.001,1.342,2025/11/05 17:15:58,0.0,0.0,0.4080914687774846,42.553
"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","Prompt:Write function 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,114,25,0.001,1.219,2025/11/05 17:15:58,0.0,3.0,0.2999120492524187,44.354
"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'}",Prompt:Write function drop empty items 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,107,10,0.001,1.093,2025/11/05 17:15:58,0.0,0.0,0.189094107299912,40.745
"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 ",Prompt:Write function find peak element 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,100,69,31,0.001,1.449,2025/11/05 17:15:58,0.0,0.0,0.502198768689534,44.569
"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",Prompt:Write python function convert decimal number octal number. Assesments:assert decimal_to_Octal 10 ==12 assert decimal_to_Octal 2 ==2 assert decimal_to_Octal 33 ==41,54,43,11,0.001,1.256,2025/11/05 17:15:58,0.0,0.0,0.3324538258575197,33.536
"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 ",Prompt:Write function find maximum product formed multiplying numbers increasing subsequence 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,119,86,33,0.001,1.384,2025/11/05 17:15:58,0.0,0.0,0.4450307827616533,54.536
"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",Prompt:Write function find maximum profit earned maximum 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,77,34,0.001,1.442,2025/11/05 17:15:58,0.0,0.0,0.496042216358839,46.087
"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)",Prompt:Write function find pairwise addition elements 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,85,34,0.001,1.4,2025/11/05 17:15:58,0.0,0.0,0.4591029023746701,55.012
"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","Prompt:Write python function find remainder array multiplication divided 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,70,17,0.001,1.243,2025/11/05 17:15:58,0.0,0.0,0.3210202286719438,38.64
"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","Prompt:Write python function check whether given list contains consecutive numbers 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,65,9,0.001,1.138,2025/11/05 17:15:58,0.0,0.0,0.2286719437115214,34.36
"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)}",Prompt:Write function find tuple intersection elements given tuple list irrespective 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,157,73,0.003,1.465,2025/11/05 17:15:58,0.0,0.0,0.5162708883025506,78.546
"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"")",Prompt:Write function replace characters string. Assesments:assert replace_char polygon 'y' 'l' == pollgon assert replace_char character 'c' 'a' == aharaater assert replace_char python 'l' 'a' == python,60,51,9,0.001,1.176,2025/11/05 17:15:58,0.0,0.0,0.2620932277924361,37.756
"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)]",Prompt:Write function sort counter 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,115,24,0.001,1.209,2025/11/05 17:15:58,0.0,0.0,0.2911169744942832,54.916
"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","Prompt:Write python function find sum largest smallest value 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,52,16,0.001,1.308,2025/11/05 17:15:58,0.0,0.0,0.3781882145998241,35.673
"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""",Prompt:Write python function convert given string lower case. Assesments:assert is_lower InValid == invalid assert is_lower TruE == true assert is_lower SenTenCE == sentence,54,37,17,0.001,1.459,2025/11/05 17:15:58,0.0,0.0,0.5109938434476693,33.828
"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')",Prompt:Write function remove lowercase substrings given string. Assesments:assert remove_lowercase PYTHon == 'PYTH' assert remove_lowercase FInD == 'FID' assert remove_lowercase STRinG == 'STRG',57,50,7,0.001,1.14,2025/11/05 17:15:58,0.0,0.0,0.2304309586631485,34.425
"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",Prompt:Write python function find first digit given number. Assesments:assert first_Digit 123 ==1 assert first_Digit 456 ==4 assert first_Digit 12 ==1,52,39,13,0.001,1.333,2025/11/05 17:15:58,0.0,0.0,0.4001759014951626,33.688
"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""",Prompt:Write python function find maximum occurring character given string. Assesments:assert get_max_occuring_char data == assert get_max_occuring_char create ==e assert get_max_occuring_char brilliant girl ==,65,45,20,0.001,1.444,2025/11/05 17:15:58,0.0,0.0,0.497801231310466,33.847
"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",Prompt:Write function determine if there is a subset given set sum equal 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,87,33,0.001,1.379,2025/11/05 17:15:58,0.0,4.0,0.4406332453825857,56.572
"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'",Prompt:Write function find sequences one upper case letter followed lower case letters given string using regex. Assesments:assert match Geeks == 'Yes' assert match geeksforGeeks == 'Yes' assert match geeks == 'No',63,48,15,0.001,1.312,2025/11/05 17:15:58,0.0,0.0,0.3817062445030783,35.232
"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",Prompt:Write python function find first natural number whose factorial is divisible x. Assesments:assert first_Factorial_Divisible_Number 10 ==5 assert first_Factorial_Divisible_Number 15 ==5 assert first_Factorial_Divisible_Number 5 ==4,70,58,12,0.001,1.207,2025/11/05 17:15:58,0.0,1.0,0.2893579595426561,34.423
"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')]",Prompt:Write function remove matching tuples 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,152,22,0.002,1.145,2025/11/05 17:15:58,0.0,0.0,0.2348284960422163,75.824
"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",Prompt:Write function find largest palindromic number 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,76,28,0.001,1.368,2025/11/05 17:15:58,0.0,0.0,0.4309586631486368,42.867
"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",Prompt:Write function compute binomial probability 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,83,15,0.001,1.181,2025/11/05 17:15:58,0.0,0.0,0.266490765171504,35.692
"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)]",Prompt:Write function sort list tuples increasing order last element 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,101,48,0.002,1.475,2025/11/05 17:15:58,0.0,0.0,0.5250659630606861,70.417
"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",Prompt:Write function find area pentagon. Assesments:assert area_pentagon 5 ==43.01193501472417 assert area_pentagon 10 ==172.0477400588967 assert area_pentagon 15 ==387.10741513251753,65,58,7,0.001,1.121,2025/11/05 17:15:58,0.0,0.0,0.2137203166226912,33.556
"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","Prompt:Write python function find frequency largest value 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,70,15,0.001,1.214,2025/11/05 17:15:58,0.0,0.0,0.2955145118733508,35.881
"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)}",Prompt:Write function extract pairs which are symmetric 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,128,57,0.002,1.445,2025/11/05 17:15:58,0.0,2.0,0.4986807387862797,78.466
"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","Prompt:Write function find sum 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,47,6,0.001,1.128,2025/11/05 17:15:58,0.0,0.0,0.2198768689533859,33.629
"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","Prompt:Write function search element given array 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,69,23,0.001,1.333,2025/11/05 17:15:58,0.0,0.0,0.4001759014951627,42.637
"Prompt: Write a function to calculate a grid of hexagon coordinates where function returns a list of lists containing 6 tuples of x, y point coordinates. Assesments: assert calculate_polygons(1,1, 4, 4, 3)==[[(-5.0, -4.196152422706632), (-5.0, -0.7320508075688767), (-2.0, 1.0), (1.0, -0.7320508075688767), (1.0, -4.196152422706632), (-2.0, -5.928203230275509), (-5.0, -4.196152422706632)], [(1.0, -4.196152422706632), (1.0, -0.7320508075688767), (4.0, 1.0), (7.0, -0.7320508075688767), (7.0, -4.196152422706632), (4.0, -5.928203230275509), (1.0, -4.196152422706632)], [(7.0, -4.196152422706632), (7.0, -0.7320508075688767), (10.0, 1.0), (13.0, -0.7320508075688767), (13.0, -4.196152422706632), (10.0, -5.928203230275509), (7.0, -4.196152422706632)], [(-2.0, 1.0000000000000004), (-2.0, 4.464101615137755), (1.0, 6.196152422706632), (4.0, 4.464101615137755), (4.0, 1.0000000000000004), (1.0, -0.7320508075688767), (-2.0, 1.0000000000000004)], [(4.0, 1.0000000000000004), (4.0, 4.464101615137755), (7.0, 6.196152422706632), (10.0, 4.464101615137755), (10.0, 1.0000000000000004), (7.0, -0.7320508075688767), (4.0, 1.0000000000000004)], [(-5.0, 6.196152422706632), (-5.0, 9.660254037844387), (-2.0, 11.392304845413264), (1.0, 9.660254037844387), (1.0, 6.196152422706632), (-2.0, 4.464101615137755), (-5.0, 6.196152422706632)], [(1.0, 6.196152422706632), (1.0, 9.660254037844387), (4.0, 11.392304845413264), (7.0, 9.660254037844387), (7.0, 6.196152422706632), (4.0, 4.464101615137755), (1.0, 6.196152422706632)], [(7.0, 6.196152422706632), (7.0, 9.660254037844387), (10.0, 11.392304845413264), (13.0, 9.660254037844387), (13.0, 6.196152422706632), (10.0, 4.464101615137755), (7.0, 6.196152422706632)], [(-2.0, 11.392304845413264), (-2.0, 14.85640646055102), (1.0, 16.588457268119896), (4.0, 14.85640646055102), (4.0, 11.392304845413264), (1.0, 9.660254037844387), (-2.0, 11.392304845413264)], [(4.0, 11.392304845413264), (4.0, 14.85640646055102), (7.0, 16.588457268119896), (10.0, 14.85640646055102), (10.0, 11.392304845413264), (7.0, 9.660254037844387), (4.0, 11.392304845413264)]], assert calculate_polygons(5,4,7,9,8)==[[(-11.0, -9.856406460551018), (-11.0, -0.6188021535170058), (-3.0, 4.0), (5.0, -0.6188021535170058), (5.0, -9.856406460551018), (-3.0, -14.475208614068023), (-11.0, -9.856406460551018)], [(5.0, -9.856406460551018), (5.0, -0.6188021535170058), (13.0, 4.0), (21.0, -0.6188021535170058), (21.0, -9.856406460551018), (13.0, -14.475208614068023), (5.0, -9.856406460551018)], [(21.0, -9.856406460551018), (21.0, -0.6188021535170058), (29.0, 4.0), (37.0, -0.6188021535170058), (37.0, -9.856406460551018), (29.0, -14.475208614068023), (21.0, -9.856406460551018)], [(-3.0, 4.0), (-3.0, 13.237604307034012), (5.0, 17.856406460551018), (13.0, 13.237604307034012), (13.0, 4.0), (5.0, -0.6188021535170058), (-3.0, 4.0)], [(13.0, 4.0), (13.0, 13.237604307034012), (21.0, 17.856406460551018), (29.0, 13.237604307034012), (29.0, 4.0), (21.0, -0.6188021535170058), (13.0, 4.0)], [(-11.0, 17.856406460551018), (-11.0, 27.09401076758503), (-3.0, 31.712812921102035), (5.0, 27.09401076758503), (5.0, 17.856406460551018), (-3.0, 13.237604307034012), (-11.0, 17.856406460551018)], [(5.0, 17.856406460551018), (5.0, 27.09401076758503), (13.0, 31.712812921102035), (21.0, 27.09401076758503), (21.0, 17.856406460551018), (13.0, 13.237604307034012), (5.0, 17.856406460551018)], [(21.0, 17.856406460551018), (21.0, 27.09401076758503), (29.0, 31.712812921102035), (37.0, 27.09401076758503), (37.0, 17.856406460551018), (29.0, 13.237604307034012), (21.0, 17.856406460551018)], [(-3.0, 31.712812921102035), (-3.0, 40.95041722813605), (5.0, 45.569219381653056), (13.0, 40.95041722813605), (13.0, 31.712812921102035), (5.0, 27.09401076758503), (-3.0, 31.712812921102035)], [(13.0, 31.712812921102035), (13.0, 40.95041722813605), (21.0, 45.569219381653056), (29.0, 40.95041722813605), (29.0, 31.712812921102035), (21.0, 27.09401076758503), (13.0, 31.712812921102035)]], assert calculate_polygons(9,6,4,3,2)==[[(5.0, 2.5358983848622456), (5.0, 4.8452994616207485), (7.0, 6.0), (9.0, 4.8452994616207485), (9.0, 2.5358983848622456), (7.0, 1.3811978464829942), (5.0, 2.5358983848622456)], [(7.0, 6.0), (7.0, 8.309401076758503), (9.0, 9.464101615137753), (11.0, 8.309401076758503), (11.0, 6.0), (9.0, 4.8452994616207485), (7.0, 6.0)]]","Prompt:Write function calculate grid hexagon coordinates where function returns list lists containing 6 tuples x point coordinates. Assesments:assert calculate_polygons 1,1 4 4 3 == -5.0 -4.196152422706632 -5.0 -0.7320508075688767 -2.0 1.0 1.0 -0.7320508075688767 1.0 -4.196152422706632 -2.0 -5.928203230275509 -5.0 -4.196152422706632 1.0 -4.196152422706632 1.0 -0.7320508075688767 4.0 1.0 7.0 -0.7320508075688767 7.0 -4.196152422706632 4.0 -5.928203230275509 1.0 -4.196152422706632 7.0 -4.196152422706632 7.0 -0.7320508075688767 10.0 1.0 13.0 -0.7320508075688767 13.0 -4.196152422706632 10.0 -5.928203230275509 7.0 -4.196152422706632 -2.0 1.0000000000000004 -2.0 4.464101615137755 1.0 6.196152422706632 4.0 4.464101615137755 4.0 1.0000000000000004 1.0 -0.7320508075688767 -2.0 1.0000000000000004 4.0 1.0000000000000004 4.0 4.464101615137755 7.0 6.196152422706632 10.0 4.464101615137755 10.0 1.0000000000000004 7.0 -0.7320508075688767 4.0 1.0000000000000004 -5.0 6.196152422706632 -5.0 9.660254037844387 -2.0 11.392304845413264 1.0 9.660254037844387 1.0 6.196152422706632 -2.0 4.464101615137755 -5.0 6.196152422706632 1.0 6.196152422706632 1.0 9.660254037844387 4.0 11.392304845413264 7.0 9.660254037844387 7.0 6.196152422706632 4.0 4.464101615137755 1.0 6.196152422706632 7.0 6.196152422706632 7.0 9.660254037844387 10.0 11.392304845413264 13.0 9.660254037844387 13.0 6.196152422706632 10.0 4.464101615137755 7.0 6.196152422706632 -2.0 11.392304845413264 -2.0 14.85640646055102 1.0 16.588457268119896 4.0 14.85640646055102 4.0 11.392304845413264 1.0 9.660254037844387 -2.0 11.392304845413264 4.0 11.392304845413264 4.0 14.85640646055102 7.0 16.588457268119896 10.0 14.85640646055102 10.0 11.392304845413264 7.0 9.660254037844387 4.0 11.392304845413264 assert calculate_polygons 5,4,7,9,8 == -11.0 -9.856406460551018 -11.0 -0.6188021535170058 -3.0 4.0 5.0 -0.6188021535170058 5.0 -9.856406460551018 -3.0 -14.475208614068023 -11.0 -9.856406460551018 5.0 -9.856406460551018 5.0 -0.6188021535170058 13.0 4.0 21.0 -0.6188021535170058 21.0 -9.856406460551018 13.0 -14.475208614068023 5.0 -9.856406460551018 21.0 -9.856406460551018 21.0 -0.6188021535170058 29.0 4.0 37.0 -0.6188021535170058 37.0 -9.856406460551018 29.0 -14.475208614068023 21.0 -9.856406460551018 -3.0 4.0 -3.0 13.237604307034012 5.0 17.856406460551018 13.0 13.237604307034012 13.0 4.0 5.0 -0.6188021535170058 -3.0 4.0 13.0 4.0 13.0 13.237604307034012 21.0 17.856406460551018 29.0 13.237604307034012 29.0 4.0 21.0 -0.6188021535170058 13.0 4.0 -11.0 17.856406460551018 -11.0 27.09401076758503 -3.0 31.712812921102035 5.0 27.09401076758503 5.0 17.856406460551018 -3.0 13.237604307034012 -11.0 17.856406460551018 5.0 17.856406460551018 5.0 27.09401076758503 13.0 31.712812921102035 21.0 27.09401076758503 21.0 17.856406460551018 13.0 13.237604307034012 5.0 17.856406460551018 21.0 17.856406460551018 21.0 27.09401076758503 29.0 31.712812921102035 37.0 27.09401076758503 37.0 17.856406460551018 29.0 13.237604307034012 21.0 17.856406460551018 -3.0 31.712812921102035 -3.0 40.95041722813605 5.0 45.569219381653056 13.0 40.95041722813605 13.0 31.712812921102035 5.0 27.09401076758503 -3.0 31.712812921102035 13.0 31.712812921102035 13.0 40.95041722813605 21.0 45.569219381653056 29.0 40.95041722813605 29.0 31.712812921102035 21.0 27.09401076758503 13.0 31.712812921102035 assert calculate_polygons 9,6,4,3,2 == 5.0 2.5358983848622456 5.0 4.8452994616207485 7.0 6.0 9.0 4.8452994616207485 9.0 2.5358983848622456 7.0 1.3811978464829942 5.0 2.5358983848622456 7.0 6.0 7.0 8.309401076758503 9.0 9.464101615137753 11.0 8.309401076758503 11.0 6.0 9.0 4.8452994616207485 7.0 6.0",2216,1884,332,0.019,1.176,2025/11/05 17:15:58,0.0,1.0,0.2620932277924361,407.424
"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'",Prompt:Write function convert given binary tuple 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,80,25,0.001,1.312,2025/11/05 17:15:58,0.0,0.0,0.3817062445030783,47.688
"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'",Prompt:Write function remove lowercase substrings given string using regex. Assesments:assert remove_lowercase 'KDeoALOklOOHserfLoAJSIskdsf' == 'KDALOOOHLAJSI' assert remove_lowercase 'ProducTnamEstreAmIngMediAplAYer' == 'PTEAIMAAY' assert remove_lowercase 'maNufacTuredbYSheZenTechNolOGIes' == 'NTYSZTNOGI',113,108,5,0.001,1.046,2025/11/05 17:15:58,0.0,0.0,0.1477572559366755,34.064
"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]","Prompt:Write function find smallest integers given list 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,117,44,0.002,1.376,2025/11/05 17:15:58,0.0,0.0,0.437994722955145,72.343
"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","Prompt:Write function find surface area cone. Assesments:assert surfacearea_cone 5,12 ==282.7433388230814 assert surfacearea_cone 10,15 ==880.5179353159282 assert surfacearea_cone 19,17 ==2655.923961165254",71,64,7,0.001,1.109,2025/11/05 17:15:58,0.0,0.0,0.2031662269129287,33.713
"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","Prompt:Write python function find gcd two positive integers. Assesments:assert gcd 12 17 ==1 assert gcd 4,6 ==2 assert gcd 2,9 ==1",51,39,12,0.001,1.308,2025/11/05 17:15:58,0.0,0.0,0.3781882145998241,33.784
"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",Prompt:Write function find diameter circle. Assesments:assert diameter_circle 10 ==20 assert diameter_circle 40 ==80 assert diameter_circle 15 ==30,40,33,7,0.001,1.212,2025/11/05 17:15:58,0.0,0.0,0.2937554969217238,33.564
"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'",Prompt:Write function concatenate elements given list string. Assesments:assert concatenate_elements 'hello' 'there' 'have' 'a' 'rocky' 'day' == hello have a rocky day' assert concatenate_elements 'Hi' 'there' 'How' 'are' 'you' == Hi How are you' assert concatenate_elements 'Part' 'of' 'the' 'journey' 'is' 'end' == Part journey is end',110,95,15,0.001,1.158,2025/11/05 17:15:58,0.0,1.667,0.2462620932277923,57.807
"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","Prompt:Write python function find common divisor two numbers 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,47,13,0.001,1.277,2025/11/05 17:15:58,0.0,0.0,0.3509234828496041,33.848
"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","Prompt:Write python function find remainder two numbers. Assesments:assert find 3,3 ==0 assert find 10,3 ==1 assert find 16,5 ==1",49,38,11,0.001,1.289,2025/11/05 17:15:58,0.0,0.0,0.3614775725593667,33.371
"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]",Prompt:Write function add consecutive numbers 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,122,49,0.002,1.402,2025/11/05 17:15:58,0.0,0.0,0.4608619173262971,72.039
"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",Prompt:Write python function find cube sum first n natural numbers. Assesments:assert sum_Of_Series 5 == 225 assert sum_Of_Series 2 ==9 assert sum_Of_Series 3 ==36,59,48,11,0.001,1.229,2025/11/05 17:15:58,0.0,0.0,0.3087071240105541,33.734
"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]",Prompt:Write function move zeroes end 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,135,61,0.002,1.452,2025/11/05 17:15:58,0.0,0.0,0.5048372911169744,91.179
"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",Prompt:Write function calculate permutation coefficient givenp n k Assesments:assert permutation_coefficient 10 2 ==90 assert permutation_coefficient 10 3 == 720 assert permutation_coefficient 10 1 ==10,62,46,16,0.001,1.348,2025/11/05 17:15:58,0.0,0.0,0.4133685136323659,35.327
"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']",Prompt:Write function remove specific words 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,134,4,0.002,1.03,2025/11/05 17:15:58,0.0,0.0,0.1336851363236587,67.704
"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",Prompt:Write function check if the common elements two given lists are in the same order 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,65,39,0.001,1.6,2025/11/05 17:15:58,0.0,3.0,0.6350043975373791,57.935
"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",Prompt:Write python function find average odd numbers till given odd number. Assesments:assert average_Odd 9 ==5 assert average_Odd 5 ==3 assert average_Odd 11 ==6,55,42,13,0.001,1.31,2025/11/05 17:15:58,0.0,0.0,0.3799472295514512,33.983
"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","Prompt:Write function find number subsequences product smaller k 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,74,19,0.001,1.257,2025/11/05 17:15:58,0.0,0.0,0.3333333333333332,38.528
"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",Prompt:Write python function find minimum sum factors given number. Assesments:assert find_Min_Sum 12 ==7 assert find_Min_Sum 105 ==15 assert find_Min_Sum 2 ==2,56,43,13,0.001,1.302,2025/11/05 17:15:58,0.0,0.0,0.3729111697449428,33.712
"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}",Prompt:Write function count element frequency 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,138,62,0.002,1.449,2025/11/05 17:15:58,0.0,0.0,0.502198768689534,58.285
"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']",Prompt:Write function convert tuple list adding given string 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,142,43,0.002,1.303,2025/11/05 17:15:58,0.0,0.0,0.3737906772207563,72.67
"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","Prompt:Write function find summation tuple elements 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,66,26,0.001,1.394,2025/11/05 17:15:58,0.0,0.0,0.4538258575197888,42.189
"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",Prompt:Write function check if there is a subset sum divisible 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,61,20,0.001,1.328,2025/11/05 17:15:58,0.0,4.0,0.395778364116095,41.597
"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]",Prompt:Write function sort list 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,91,36,0.001,1.396,2025/11/05 17:15:58,0.0,0.0,0.4555848724714159,60.425
"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","Prompt:Write python function find largest postive number 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,62,13,0.001,1.21,2025/11/05 17:15:58,0.0,0.0,0.2919964819700967,34.996
"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",Prompt:Write function find square root perfect number. Assesments:assert sqrt_root 4 ==2 assert sqrt_root 16 ==4 assert sqrt_root 400 ==20,42,35,7,0.001,1.2,2025/11/05 17:15:58,0.0,0.0,0.2832014072119612,33.696
"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",Prompt:Write function calculate volume tetrahedron. Assesments:assert volume_tetrahedron 10 ==117.85 assert volume_tetrahedron 15 ==397.75 assert volume_tetrahedron 20 ==942.81,52,46,6,0.001,1.13,2025/11/05 17:15:58,0.0,0.0,0.2216358839050131,33.244
"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",Prompt:Write function find lcm 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,63,22,0.001,1.349,2025/11/05 17:15:58,0.0,0.0,0.4142480211081794,40.873
"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","Prompt:Write function print check if the triangle is scalene not. Assesments:assert check_isosceles 6,8,12 ==True assert check_isosceles 6,6,12 ==False assert check_isosceles 6,15,20 ==True",65,60,5,0.001,1.083,2025/11/05 17:15:58,0.0,1.5,0.1802990325417765,39.015
"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",Prompt:Write function find longest bitonic subsequence 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,89,40,0.001,1.449,2025/11/05 17:15:58,0.0,0.0,0.502198768689534,60.446
"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.']",Prompt:Write function check whether given string has a capital letter lower case letter number 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 atleast8.' assert check_string '123python' == 'String must have 1 upper case character.' assert check_string '123Python' == 'Valid string.',101,89,12,0.001,1.135,2025/11/05 17:15:58,0.0,1.667,0.2260334212840809,44.545
"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",Prompt:Write function find sum maximum increasing subsequence 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,81,28,0.001,1.346,2025/11/05 17:15:58,0.0,0.0,0.4116094986807388,43.594
"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","Prompt:Write python function check whether two given lines are parallel 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,65,10,0.001,1.154,2025/11/05 17:15:58,0.0,1.0,0.2427440633245381,35.613
"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""",Prompt:Write python function capitalize first last letters word 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,49,20,0.001,1.408,2025/11/05 17:15:58,0.0,0.0,0.4661389621811784,34.458
"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",Prompt:Write function find pairs integer array whose sum is equal 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,75,31,0.001,1.413,2025/11/05 17:15:58,0.0,1.0,0.4705364995602463,45.632
"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])","Prompt:Write function find list lists 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,80,26,0.001,1.325,2025/11/05 17:15:58,0.0,0.0,0.3931398416886543,54.195
"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",Prompt:Write function find nth jacobsthal-lucas number. Assesments:assert jacobsthal_lucas 5 ==31 assert jacobsthal_lucas 2 ==5 assert jacobsthal_lucas 4 ==17,66,55,11,0.001,1.2,2025/11/05 17:15:58,0.0,0.0,0.2832014072119612,33.265
"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",Prompt:Write function find ration negative numbers array 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,106,44,0.002,1.415,2025/11/05 17:15:58,0.0,0.0,0.4722955145118733,66.146
"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","Prompt:Write function find minimum number coins make 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,72,13,0.001,1.181,2025/11/05 17:15:58,0.0,0.0,0.266490765171504,38.6
"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",Prompt:Write function check if the two given strings are permutations other. Assesments:assert check_permutation abc cba == True assert check_permutation test ttew == False assert check_permutation xxyz yxzx == True,64,48,16,0.001,1.333,2025/11/05 17:15:58,0.0,1.5,0.4001759014951626,36.415
"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]",Prompt:Write function remove particular data type elements 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,85,28,0.001,1.329,2025/11/05 17:15:58,0.0,0.0,0.3966578715919084,46.311
"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)","Prompt:Write function search literals string string also find location within 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,72,5,0.001,1.069,2025/11/05 17:15:58,0.0,2.0,0.1679859278803869,41.372
"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",Prompt:Write function find top bottom surface area cylinder. Assesments:assert topbottom_surfacearea 10 ==314.15000000000003 assert topbottom_surfacearea 5 ==78.53750000000001 assert topbottom_surfacearea 4 ==50.264,64,56,8,0.001,1.143,2025/11/05 17:15:58,0.0,0.0,0.2330694810905892,34.099
"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]","Prompt:Write function select nth items 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,89,22,0.001,1.247,2025/11/05 17:15:58,0.0,0.0,0.3245382585751979,45.298
"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""",Prompt:Write python function find first repeated word given string. Assesments:assert first_repeated_word abcabcab ==ab assert first_repeated_word abcabc == 'None' assert first_repeated_word abcabcca abbc ==ca,67,49,18,0.001,1.367,2025/11/05 17:15:58,0.0,0.0,0.4300791556728232,34.638
"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')",Prompt:Write python function convert given string list 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,111,10,0.001,1.09,2025/11/05 17:15:58,0.0,0.0,0.1864555848724714,56.185
"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]",Prompt:Write function create list containing power said number bases raised corresponding number 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,313,79,0.003,1.252,2025/11/05 17:15:58,0.0,0.0,0.3289357959542656,97.65
"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","Prompt:Write python function find difference highest least frequencies 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,87,15,0.001,1.172,2025/11/05 17:15:58,0.0,0.0,0.258575197889182,36.433
"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",Prompt:Write function find if the given number is abundant not. Assesments:assert check_abundant 12 == True assert check_abundant 15 == False assert check_abundant 18 == True,49,41,8,0.001,1.195,2025/11/05 17:15:58,0.0,1.5,0.2788038698328936,34.353
"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'",Prompt:Write function replace occurrences spaces commas dots colon given string 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,77,15,0.001,1.195,2025/11/05 17:15:58,0.0,0.0,0.2788038698328936,39.511
"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)","Prompt:Write function add two numbers print number digits sum. Assesments:assert count_digits 9875,10 == 4 assert count_digits 98759853034,100 == 11 assert count_digits 1234567,500 == 7",60,52,8,0.001,1.154,2025/11/05 17:15:58,0.0,0.0,0.2427440633245381,34.881
"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'",Prompt:Write function flatten tuple list string. Assesments:assert flatten_tuple '1' '4' '6' '5' '8' '2' '9' '1' '10' =='146 5829 1 10' assert flatten_tuple '2' '3' '4' '6' '9' '3' '2' '2' '11' =='234 6932 2 11' assert flatten_tuple '14' '21' '9' '24' '19' '12' '29' '23' '17' == '14219 24191229 23 17',174,136,38,0.001,1.279,2025/11/05 17:15:58,0.0,0.0,0.3526824978012312,63.094
"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",Prompt:Write python function toggle first last bits 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,46,14,0.001,1.304,2025/11/05 17:15:58,0.0,0.0,0.3746701846965699,34.069
"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",Prompt:Write function find last occurrence character 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,51,12,0.001,1.235,2025/11/05 17:15:58,0.0,0.0,0.3139841688654354,35.873
"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",Prompt:Write python function find sum hamming distances consecutive numbers n. Assesments:assert Total_Hamming_Distance 4 ==7 assert Total_Hamming_Distance 2 ==3 assert Total_Hamming_Distance 5 ==8,65,48,17,0.001,1.354,2025/11/05 17:15:58,0.0,0.0,0.4186455584872472,34.61
"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 ",Prompt:Write function find length longest increasing subsequence 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,111,79,32,0.001,1.405,2025/11/05 17:15:58,0.0,0.0,0.4635004397537379,45.985
"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",Prompt:Write python function find sum fifth power 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,49,11,0.001,1.224,2025/11/05 17:15:58,0.0,0.0,0.3043095866314863,34.247
"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","Prompt:Write python function find maximum element sorted 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,69,14,0.001,1.203,2025/11/05 17:15:58,0.0,0.0,0.2858399296394019,35.99
"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]","Prompt:Write function extract specified column 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,119,45,0.002,1.378,2025/11/05 17:15:58,0.0,0.0,0.4397537379067721,66.822
"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""","Prompt:Write python function check whether given sequence is linear 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,63,13,0.001,1.206,2025/11/05 17:15:58,0.0,1.0,0.2884784520668425,34.821
"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",Prompt:Write function convert given tuple 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,54,13,0.001,1.241,2025/11/05 17:15:58,0.0,0.0,0.3192612137203167,34.681
"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]","Prompt:Write python function find odd numbers 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,68,10,0.001,1.147,2025/11/05 17:15:58,0.0,0.0,0.2365875109938434,34.551
"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",Prompt:Write python function find difference sum cubes first n natural numbers sum first n natural numbers. Assesments:assert difference 3 ==30 assert difference 5 == 210 assert difference 2 ==6,58,42,16,0.001,1.381,2025/11/05 17:15:58,0.0,0.0,0.4423922603342128,35.2
"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","Prompt:Write python function count pairs xor 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,75,14,0.001,1.187,2025/11/05 17:15:58,0.0,0.0,0.2717678100263853,36.008
"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"")",Prompt:Write function toggle characters case string. Assesments:assert toggle_string Python == pYTHON assert toggle_string Pangram == pANGRAM assert toggle_string LIttLE == liTTle,54,40,14,0.001,1.35,2025/11/05 17:15:58,0.0,0.0,0.415127528583993,34.256
"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","Prompt:Write python function find digit distance 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,45,12,0.001,1.267,2025/11/05 17:15:58,0.0,0.0,0.3421284080914686,33.742
"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",Prompt:Write function find largest sum contiguous subarray 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,92,38,0.001,1.413,2025/11/05 17:15:58,0.0,0.0,0.4705364995602463,44.047
"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)",Prompt:Write function find union elements 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,112,49,0.002,1.438,2025/11/05 17:15:58,0.0,0.0,0.4925241864555848,70.738
"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]}",Prompt:Write function assign element pair elements similar pairs 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,159,84,0.002,1.528,2025/11/05 17:15:58,0.0,0.0,0.5716798592788038,86.727
"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","Prompt:Write python function find maximum length 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,83,13,0.001,1.157,2025/11/05 17:15:58,0.0,0.0,0.2453825857519789,39.67
"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']",Prompt:Write function extract values quotation marks 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,72,12,0.001,1.167,2025/11/05 17:15:58,0.0,0.0,0.2541776605101143,44.371
"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","Prompt:Write python function count unequal element pairs 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,64,12,0.001,1.188,2025/11/05 17:15:58,0.0,0.0,0.2726473175021987,34.767
"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']",Prompt:Write python function split string 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,82,-10,0.001,0.878,2025/11/05 17:15:59,-0.0,0.0,0.0,44.302
"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",Prompt:Write function get sum non-negative integer. Assesments:assert sum_digits 345 ==12 assert sum_digits 12 ==3 assert sum_digits 97 ==16,42,35,7,0.001,1.2,2025/11/05 17:15:59,0.0,0.0,0.2832014072119612,33.596
"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","Prompt:Write function check whether specified list is sorted 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,92,23,0.001,1.25,2025/11/05 17:15:59,0.0,1.0,0.3271767810026385,43.051
"Prompt: Write a function to create a list of empty dictionaries. Assesments: assert empty_list(5)==[{},{},{},{},{}], assert empty_list(6)==[{},{},{},{},{},{}], assert empty_list(7)==[{},{},{},{},{},{},{}]",Prompt:Write function create list empty dictionaries. Assesments:assert empty_list 5 == assert empty_list 6 == assert empty_list 7 ==,59,31,28,0.001,1.903,2025/11/05 17:15:59,0.0,0.0,0.9014951627088827,36.049
"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']]",Prompt:Write function sort sublist strings given list 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,160,10,0.002,1.062,2025/11/05 17:15:59,0.0,0.0,0.1618293755496922,76.418
"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']",Prompt:Write function remove words given list strings containing character 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,120,28,0.002,1.233,2025/11/05 17:15:59,0.0,0.0,0.3122251539138083,68.542
"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",Prompt:Write function find maximum possible sum disjoint pairs given array integers numberk. 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,103,36,0.001,1.35,2025/11/05 17:15:59,0.0,0.0,0.415127528583993,53.489
"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]","Prompt:Write python function remove two duplicate numbers given number 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,92,20,0.001,1.217,2025/11/05 17:15:59,0.0,0.0,0.2981530343007916,41.441
"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",Prompt:Write python function calculate product unique numbers 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,70,31,0.001,1.443,2025/11/05 17:15:59,0.0,0.0,0.4969217238346526,44.034
"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","Prompt:Write function find surface area cylinder. Assesments:assert surfacearea_cylinder 10,5 ==942.45 assert surfacearea_cylinder 4,5 ==226.18800000000002 assert surfacearea_cylinder 4,10 ==351.848",63,56,7,0.001,1.125,2025/11/05 17:15:59,0.0,0.0,0.2172383465259454,33.722
"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","Prompt:Write python function find nth number sequence which is not a multiple 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,60,14,0.001,1.233,2025/11/05 17:15:59,0.0,4.0,0.3122251539138083,34.705
"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","Prompt:Write python function check whether array is subarray another 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,86,10,0.001,1.116,2025/11/05 17:15:59,0.0,1.0,0.2093227792436236,39.409
"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",Prompt:Write python function find last digit factorial given number. Assesments:assert last_Digit_Factorial 4 ==4 assert last_Digit_Factorial 21 ==0 assert last_Digit_Factorial 30 ==0,63,49,14,0.001,1.286,2025/11/05 17:15:59,0.0,0.0,0.3588390501319261,34.035
"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]","Prompt:Write function interleave lists 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,160,33,0.002,1.206,2025/11/05 17:15:59,0.0,0.0,0.2884784520668425,65.03
"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)",Prompt:Write function find dissimilar elements 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,106,41,0.002,1.387,2025/11/05 17:15:59,0.0,0.0,0.4476693051890941,64.592
"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)",Prompt:Write function extract even elements 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,107,45,0.002,1.421,2025/11/05 17:15:59,0.0,0.0,0.4775725593667546,67.381
"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","Prompt:Write python function find surface area square pyramid. Assesments:assert surface_Area 3,4 ==33 assert surface_Area 4,5 ==56 assert surface_Area 1,2 ==5",58,45,13,0.001,1.289,2025/11/05 17:15:59,0.0,0.0,0.3614775725593667,33.829
"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",Prompt:Write function check if a dictionary is empty not. Assesments:assert my_dict 10 ==False assert my_dict 11 ==False assert my_dict ==True,44,35,9,0.001,1.257,2025/11/05 17:15:59,0.0,1.5,0.3333333333333332,33.847
"Prompt: Write a function for nth catalan number. Assesments: assert catalan_number(10)==16796, assert catalan_number(9)==4862, assert catalan_number(7)==429",Prompt:Write function nth catalan number. Assesments:assert catalan_number 10 ==16796 assert catalan_number 9 ==4862 assert catalan_number 7 ==429,43,39,4,0.001,1.103,2025/11/05 17:15:59,0.0,0.0,0.1978891820580474,32.5
"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'",Prompt:Write function find adverbs positions given sentence using regex. Assesments:assert find_adverbs Clearly has no excuse behavior. == '0-7 Clearly' assert find_adverbs Please handle situation carefuly == '28-36 carefuly' assert find_adverbs Complete task quickly == '18-25 quickly',87,65,22,0.001,1.338,2025/11/05 17:15:59,0.0,2.0,0.4045734388742305,39.572
"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}]","Prompt:Write function find n expensive price items 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,233,22,0.002,1.094,2025/11/05 17:15:59,0.0,0.0,0.1899736147757256,59.142
"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]","Prompt:Write python function split array add first part 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,115,13,0.001,1.113,2025/11/05 17:15:59,0.0,0.0,0.2066842568161829,38.753
"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)","Prompt:Write function convert list 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,96,34,0.001,1.354,2025/11/05 17:15:59,0.0,0.0,0.4186455584872472,62.445
"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","Prompt:Write python function find difference largest smallest value 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,52,15,0.001,1.288,2025/11/05 17:15:59,0.0,0.0,0.3605980650835532,35.638
"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]","Prompt:Write function find perfect squares 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,68,16,0.001,1.235,2025/11/05 17:15:59,0.0,0.0,0.3139841688654354,41.269
"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))","Prompt:Write 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 -2+2.4492935982947064e-16j assert polar_rect 15,17 == 22.67156809750927 0.8478169733934057 -2+2.4492935982947064e-16j",142,130,12,0.001,1.092,2025/11/05 17:15:59,0.0,0.0,0.1882145998240985,39.054
"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]",Prompt:Write python function interchange first last elements 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,71,28,0.001,1.394,2025/11/05 17:15:59,0.0,0.0,0.4538258575197888,52.067
"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",Prompt:Write python function find sum product binomial co-efficients Assesments:assert sum_Of_product 3 ==15 assert sum_Of_product 4 ==56 assert sum_Of_product 1 ==1,57,44,13,0.001,1.295,2025/11/05 17:15:59,0.0,0.0,0.3667546174142479,33.575
"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') ",Prompt:Write function remove leading zeroes 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',85,78,7,0.001,1.09,2025/11/05 17:15:59,0.0,0.0,0.1864555848724714,39.464
"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","Prompt:Write function find difference first even odd number 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,84,12,0.001,1.143,2025/11/05 17:15:59,0.0,0.0,0.2330694810905892,35.553
"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""","Prompt:Write python function count minimum number swaps required convert one binary string another. Assesments:assert min_Swaps 1101,1110 ==1 assert min_Swaps 111,000 == Possible assert min_Swaps 111,110 == Possible",71,55,16,0.001,1.291,2025/11/05 17:15:59,0.0,0.0,0.3632365875109937,35.059
"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"")))",Prompt:Write function find size given tuple. Assesments:assert tuple_size 1 B 2 C 3 == sys.getsizeof 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,102,73,0.002,1.716,2025/11/05 17:15:59,0.0,0.0,0.7370272647317502,68.406
"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",Prompt:Write function find kth element 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,113,47,0.002,1.416,2025/11/05 17:15:59,0.0,0.0,0.4731750219876868,65.77
"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",Prompt:Write function check whether given number is armstrong not. Assesments:assert armstrong_number 153 ==True assert armstrong_number 259 ==False assert armstrong_number 4458 ==False,48,42,6,0.001,1.143,2025/11/05 17:15:59,0.0,1.0,0.2330694810905892,34.344
"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)",Prompt:Write function find sum average 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,52,10,0.001,1.192,2025/11/05 17:15:59,0.0,0.0,0.2761653474054529,37.92
"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",Prompt:Write python function check whether given number is even using bitwise operator. Assesments:assert is_Even 1 == False assert is_Even 2 == True assert is_Even 3 == False,54,44,10,0.001,1.227,2025/11/05 17:15:59,0.0,1.0,0.306948109058927,34.553
"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",Prompt:Write function find longest chain which can be formed given set 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,108,43,0.002,1.398,2025/11/05 17:15:59,0.0,3.0,0.457343887423043,78.358
"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""",Prompt:Write python function find first repeated character given string. Assesments:assert first_repeated_char abcabc == assert first_repeated_char abc == None assert first_repeated_char 123123 ==1,59,42,17,0.001,1.405,2025/11/05 17:15:59,0.0,0.0,0.4635004397537379,33.818
"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]",Prompt:Write function get lucid number smaller equal 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,97,38,0.001,1.392,2025/11/05 17:15:59,0.0,0.0,0.4520668425681617,62.244
"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"")",Prompt:Write function reverse words 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,37,14,0.001,1.378,2025/11/05 17:15:59,0.0,0.0,0.4397537379067721,34.926
"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",Prompt:Write function 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,40,4,0.001,1.1,2025/11/05 17:15:59,0.0,2.0,0.1952506596306069,33.737
"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",Prompt:Write function convert degrees radians. Assesments:assert radian_degree 90 ==1.5707963267948966 assert radian_degree 60 ==1.0471975511965976 assert radian_degree 120 ==2.0943951023931953,62,57,5,0.001,1.088,2025/11/05 17:15:59,0.0,0.0,0.1846965699208443,33.23
"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)",Prompt:Write function search literals string string also find location within original string where the pattern occurs using regex. Assesments:assert find_literals 'The quick brown fox jumps lazy dog.' 'fox' == 'fox' 16 19 assert find_literals 'Its crazy procedure right' 'crazy' == 'crazy' 16 21 assert find_literals 'Hardest choices required strongest will' 'will' == 'will' 35 39,112,92,20,0.001,1.217,2025/11/05 17:15:59,0.0,2.0,0.2981530343007916,49.188
"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",Prompt:Write python function find nth bell number. Assesments:assert bell_Number 2 ==2 assert bell_Number 3 ==5 assert bell_Number 4 ==15,45,35,10,0.001,1.286,2025/11/05 17:15:59,0.0,0.0,0.3588390501319261,32.804
"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","Prompt:Write python function find minimum possible value 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,50,12,0.001,1.24,2025/11/05 17:15:59,0.0,0.0,0.318381706244503,33.673
"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]","Prompt:Write python function remove k'th element 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,179,61,0.002,1.341,2025/11/05 17:15:59,0.0,0.0,0.407211961301671,86.917
"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",Prompt:Write function find maximum nth column 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,97,41,0.001,1.423,2025/11/05 17:15:59,0.0,0.0,0.4793315743183817,60.694
"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']]",Prompt:Write python function merge first last elements separately list 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,148,24,0.002,1.162,2025/11/05 17:15:59,0.0,0.0,0.2497801231310465,73.906
"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)]",Prompt:Write function find maximum value record list tuple attribute 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,169,46,0.002,1.272,2025/11/05 17:15:59,0.0,0.0,0.3465259454705365,80.579
"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",Prompt:Write function find cumulative sum values are present 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,81,35,0.001,1.432,2025/11/05 17:15:59,0.0,1.0,0.4872471416007035,53.222
"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]",Prompt:Write function find average value numbers given tuple 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,160,63,0.002,1.394,2025/11/05 17:15:59,0.0,0.0,0.4538258575197888,80.762
"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)",Prompt:Write function perfom modulo tuple elements 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,104,42,0.002,1.404,2025/11/05 17:15:59,0.0,0.0,0.4626209322779243,66.93
"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","Prompt:Write function check number jumps required given length reach point form 0 origin 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,63,18,0.001,1.286,2025/11/05 17:15:59,0.0,0.0,0.3588390501319261,38.506
"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]","Prompt:Write function divide two lists using map 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,89,13,0.001,1.146,2025/11/05 17:15:59,0.0,0.0,0.2357080035180298,39.456
"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'",Prompt:Write function move numbers given string. Assesments:assert move_num 'I1love143you55three3000thousand' == 'Iloveyouthreethousand1143553000' assert move_num 'Avengers124Assemble' == 'AvengersAssemble124' assert move_num 'Its11our12path13to14see15things16do17things' == 'Itsourpathtoseethingsdothings11121314151617',107,99,8,0.001,1.081,2025/11/05 17:15:59,0.0,0.0,0.1785400175901494,34.261
"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",Prompt:Write function find 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,72,29,0.001,1.403,2025/11/05 17:15:59,0.0,1.5,0.4617414248021108,46.078
"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']",Prompt:Write function increment numeric values given strings k. Assesments:assert increment_numerics MSM 234 98 123 best 4 6 == 'MSM' '240' 'is' '104' '129' 'best' '10' assert increment_numerics Dart 356 88 169 Super 6 12 == 'Dart' '368' 'is' '100' '181' 'Super' '18' assert increment_numerics Flutter 451 44 96 Magnificent 12 33 == 'Flutter' '484' 'is' '77' '129' 'Magnificent' '45',183,136,47,0.002,1.346,2025/11/05 17:15:59,0.0,0.0,0.4116094986807388,72.51
"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",Prompt:Write function find median two sorted arrays 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,108,41,0.001,1.38,2025/11/05 17:15:59,0.0,0.0,0.4415127528583992,65.545
"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])","Prompt:Write function find n-th power individual elements 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,102,30,0.001,1.294,2025/11/05 17:15:59,0.0,0.0,0.3658751099384345,62.086
"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""",Prompt:Write python function convert given string upper case. Assesments:assert is_upper person ==PERSON assert is_upper final == FINAL assert is_upper Valid == VALID,48,33,15,0.001,1.455,2025/11/05 17:15:59,0.0,0.0,0.5074758135444152,33.721
"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]","Prompt:Write python function interchange first last elements 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,72,11,0.001,1.153,2025/11/05 17:15:59,0.0,0.0,0.2418645558487247,34.907
"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",Prompt:Write python function find largest triangle can be inscribed semicircle. Assesments:assert triangle_area 0 ==0 assert triangle_area -1 ==-1 assert triangle_area 2 ==4,54,41,13,0.001,1.317,2025/11/05 17:15:59,0.0,2.0,0.3861037818821459,34.366
"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","Prompt:Write python function find smallest missing number 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,77,13,0.001,1.169,2025/11/05 17:15:59,0.0,0.0,0.2559366754617414,34.925
"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'",Prompt:Write function replace spaces given string character * list item * list item* list item * list item %20'. Assesments:assert replace_spaces Name is Dawood == 'My %20Name %20is %20Dawood' assert replace_spaces am a Programmer == 'I %20am %20a %20Programmer' assert replace_spaces love Coding == 'I %20love %20Coding',100,85,15,0.001,1.176,2025/11/05 17:15:59,0.0,1.5,0.2620932277924361,39.121
"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]","Prompt:Write python function find even numbers 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,72,10,0.001,1.139,2025/11/05 17:15:59,0.0,0.0,0.229551451187335,34.555
"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]]",Prompt:Write function extract adjacent coordinates 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,147,66,0.002,1.449,2025/11/05 17:15:59,0.0,0.0,0.502198768689534,90.801
"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'",Prompt:Write function replace whitespaces underscore vice versa given string using regex. Assesments:assert replace_spaces 'Jumanji Jungle' == 'Jumanji_The_Jungle' assert replace_spaces 'The Avengers' == 'The_Avengers' assert replace_spaces 'Fast Furious' == 'Fast_and_Furious',76,66,10,0.001,1.152,2025/11/05 17:15:59,0.0,0.0,0.240985048372911,36.59
"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]","Prompt:Write python function move zeroes end 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,108,13,0.001,1.12,2025/11/05 17:15:59,0.0,0.0,0.2128408091468778,35.955
"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","Prompt:Write python function find sum xor pairs numbers 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,62,17,0.001,1.274,2025/11/05 17:15:59,0.0,0.0,0.3482849604221636,38.286
"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",Prompt:Write python function find sum fourth power 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,54,10,0.001,1.185,2025/11/05 17:15:59,0.0,0.0,0.2700087950747581,34.316
"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]","Prompt:Write function push values heap pop smallest values one 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,121,55,0.002,1.455,2025/11/05 17:15:59,0.0,0.0,0.5074758135444152,73.261
"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""","Prompt:Write python function check if roots quadratic equation are reciprocal not. Assesments:assert Check_Solution 2,0,2 == Yes assert Check_Solution 2 -5,2 == Yes assert Check_Solution 1,2,3 ==",71,53,18,0.001,1.34,2025/11/05 17:15:59,0.0,1.0,0.4063324538258576,36.284
"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","Prompt:Write function check whether given amount has no profit loss Assesments:assert noprofit_noloss 1500,1200 ==False assert noprofit_noloss 100,100 ==True assert noprofit_noloss 2000,5000 ==False",66,59,7,0.001,1.119,2025/11/05 17:15:59,0.0,2.0,0.2119613016710642,34.349
"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","Prompt:Write function calculate wind chill index. Assesments:assert wind_chill 120,35 ==40 assert wind_chill 40,70 ==86 assert wind_chill 10,100 ==116",47,43,4,0.001,1.093,2025/11/05 17:15:59,0.0,0.0,0.189094107299912,32.651
"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",Prompt:Write function sum length names given list names removing names start 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,75,32,0.001,1.427,2025/11/05 17:15:59,0.0,0.0,0.4828496042216359,47.41
"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"")",Prompt:Write function remove parenthesis area string. Assesments:assert remove_parenthesis python chrome == python assert remove_parenthesis string.abc == string assert remove_parenthesis alpha num == alpha,60,39,21,0.001,1.538,2025/11/05 17:15:59,0.0,0.0,0.5804749340369393,37.438
"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",Prompt:Write function find nth nonagonal number. Assesments:assert is_nonagonal 10 == 325 assert is_nonagonal 15 == 750 assert is_nonagonal 18 == 1089,50,42,8,0.001,1.19,2025/11/05 17:15:59,0.0,0.0,0.2744063324538258,33.407
"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))}",Prompt:Write function remove similar rows 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,153,79,0.002,1.516,2025/11/05 17:15:59,0.0,0.0,0.5611257695690414,90.752
"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!')",Prompt:Write function matches word containing 'z' start end word. Assesments:assert text_match_wordz_middle pythonzabc. == 'Found match! assert text_match_wordz_middle xyzabc. == 'Found match! assert text_match_wordz_middle lang. == 'Not matched!,79,60,19,0.001,1.317,2025/11/05 17:15:59,0.0,0.0,0.3861037818821459,39.014
"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]","Prompt:Write python function reverse array upto 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,102,35,0.001,1.343,2025/11/05 17:15:59,0.0,0.0,0.4089709762532981,62.514
"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",Prompt:Write function find product kth index 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,96,40,0.001,1.417,2025/11/05 17:15:59,0.0,0.0,0.4740545294635004,60.937
"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","Prompt:Write python function count number cubes sizek cube sizen. Assesments:assert No_of_cubes 2,1 ==8 assert No_of_cubes 5,2 ==64 assert No_of_cubes 1,1 ==1",66,51,15,0.001,1.294,2025/11/05 17:15:59,0.0,0.0,0.3658751099384345,34.411
"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']",Prompt:Write function split string uppercase letters. Assesments:assert split_upperstring PythonProgramLanguage == 'Python' 'Program' 'Language' assert split_upperstring PythonProgram == 'Python' 'Program' assert split_upperstring ProgrammingLanguage == 'Programming' 'Language',59,56,3,0.001,1.054,2025/11/05 17:15:59,0.0,0.0,0.1547933157431838,37.342
"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] ","Prompt:Write function exchange position every n-th value n+1 th value n+1 th value n-th value 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",141,114,27,0.001,1.237,2025/11/05 17:15:59,0.0,0.0,0.3157431838170625,43.767
"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","Prompt:Write python function calculate sum numbers list indices 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,96,30,0.001,1.312,2025/11/05 17:15:59,0.0,0.0,0.3817062445030783,44.359
"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","Prompt:Write python function check whether given two arrays are equal 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,82,9,0.001,1.11,2025/11/05 17:15:59,0.0,1.0,0.2040457343887423,39.198
"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",Prompt:Write function check if one tuple is a subset 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,69,23,0.001,1.333,2025/11/05 17:15:59,0.0,1.5,0.4001759014951626,43.977
"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)]'",Prompt:Write function flatten given tuple matrix tuple list tuple representing 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,177,92,0.003,1.52,2025/11/05 17:15:59,0.0,0.0,0.5646437994722955,87.982
"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]})",Prompt:Write function group sequence key-value pairs dictionary 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,163,46,0.002,1.282,2025/11/05 17:15:59,0.0,0.0,0.3553210202286719,81.641
"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","Prompt:Write function find perimeter rectangle. Assesments:assert rectangle_perimeter 10,20 ==60 assert rectangle_perimeter 10,5 ==30 assert rectangle_perimeter 4,2 ==12",49,42,7,0.001,1.167,2025/11/05 17:15:59,0.0,0.0,0.2541776605101143,33.601
"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",Prompt:Write python function find sum fifth power n natural numbers. Assesments:assert fifth_Power_Sum 2 ==33 assert fifth_Power_Sum 4 == 1300 assert fifth_Power_Sum 3 == 276,61,50,11,0.001,1.22,2025/11/05 17:15:59,0.0,0.0,0.3007915567282321,34.052
"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","Prompt:Write python function find minimum sum absolute differences 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,84,13,0.001,1.155,2025/11/05 17:15:59,0.0,0.0,0.2436235708003518,38.917
"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",Prompt:Write python function find first digit factorial given number. Assesments:assert first_Digit 5 ==1 assert first_Digit 10 ==3 assert first_Digit 7 ==5,54,40,14,0.001,1.35,2025/11/05 17:15:59,0.0,0.0,0.415127528583993,33.942
"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","Prompt:Write function find item maximum occurrences 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,119,24,0.001,1.202,2025/11/05 17:15:59,0.0,0.0,0.2849604221635883,43.513
"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]",Prompt:Write python function print duplicants list 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,82,35,0.001,1.427,2025/11/05 17:15:59,0.0,0.0,0.4828496042216359,56.153
"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)","Prompt:Write python function choose points two ranges point lies 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,68,15,0.001,1.221,2025/11/05 17:15:59,0.0,0.0,0.3016710642040457,36.207
"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",Prompt:Write function find maximum sum 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,100,28,0.001,1.28,2025/11/05 17:15:59,0.0,2.5,0.3535620052770448,47.202
"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]}","Prompt:Write function sort list 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,204,50,0.002,1.245,2025/11/05 17:15:59,0.0,0.0,0.3227792436235708,83.89
"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",Prompt:Write function find largest possible value k k modulox isy. 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,56,19,0.001,1.339,2025/11/05 17:15:59,0.0,1.0,0.4054529463500439,39.041
"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",Prompt:Write python function find average even numbers till given even number. Assesments:assert average_Even 2 ==2 assert average_Even 4 ==3 assert average_Even 100 ==51,55,42,13,0.001,1.31,2025/11/05 17:15:59,0.0,0.0,0.3799472295514512,34.037
"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]","Prompt:Write python function shift first element end 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,88,11,0.001,1.125,2025/11/05 17:15:59,0.0,0.0,0.2172383465259454,34.875
"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",Prompt:Write function count occurrence character string. Assesments:assert count_char Python 'o' ==1 assert count_char little 't' ==2 assert count_char assert 's' ==2,51,40,11,0.001,1.275,2025/11/05 17:15:59,0.0,0.0,0.349164467897977,34.441
"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",Prompt:Write python function count number vowels string. Assesments:assert Check_Vow 'corner' 'AaEeIiOoUu' ==2 assert Check_Vow 'valid' 'AaEeIiOoUu' ==2 assert Check_Vow 'true' 'AaEeIiOoUu' ==2,71,65,6,0.001,1.092,2025/11/05 17:15:59,0.0,0.0,0.1882145998240985,34.687
"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'",Prompt:Write python function replace multiple occurence character single. Assesments:assert replace 'peep' 'e' == 'pep' assert replace 'Greek' 'e' == 'Grek' assert replace 'Moon' 'o' == 'Mon',55,54,1,0.001,1.019,2025/11/05 17:15:59,0.0,0.0,0.1240105540897096,34.854
"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'",Prompt:Write function check whether given ip address is valid 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,69,8,0.001,1.116,2025/11/05 17:15:59,0.0,1.0,0.2093227792436236,34.916
"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","Prompt:Write python function check whether sequence numbers has a decreasing trend 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,57,10,0.001,1.175,2025/11/05 17:15:59,0.0,2.0,0.2612137203166227,37.105
"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",Prompt:Write python function set right 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,53,12,0.001,1.226,2025/11/05 17:15:59,0.0,0.0,0.3060686015831134,33.78
"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","Prompt:Write function find maximum 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,49,5,0.001,1.102,2025/11/05 17:15:59,0.0,0.0,0.197009674582234,33.24
"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","Prompt:Write python function convert list multiple integers single integer. Assesments:assert convert 1,2,3 == 123 assert convert 4,5,6 == 456 assert convert 7,8,9 == 789",60,49,11,0.001,1.224,2025/11/05 17:15:59,0.0,0.0,0.3043095866314863,40.258
"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"")",Prompt:Write function remove duplicate words 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,56,13,0.001,1.232,2025/11/05 17:15:59,0.0,0.0,0.3113456464379946,37.931
"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","Prompt:Write function add two integers. however if the sum is between the given range will return20. 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,64,7,0.001,1.109,2025/11/05 17:15:59,0.0,2.0,0.2031662269129287,35.837
"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'",Prompt:Write function remove everything except alphanumeric characters given string 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,75,13,0.001,1.173,2025/11/05 17:15:59,0.0,0.0,0.2594547053649956,37.232
"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","Prompt:Write function check if the triangle is valid not. Assesments:assert validity_triangle 60,50,90 ==False assert validity_triangle 45,75,60 ==True assert validity_triangle 30,50,100 ==True",54,49,5,0.001,1.102,2025/11/05 17:15:59,0.0,1.5,0.197009674582234,34.308
"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""",Prompt:Write python function remove spaces given string. Assesments:assert remove_spaces bc == abc assert remove_spaces 123 == 123 assert remove_spaces bc ==bc,55,34,21,0.001,1.618,2025/11/05 17:15:59,0.0,0.0,0.6508355321020229,33.497
"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'","Prompt:Write function access dictionary keys element 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,74,14,0.001,1.189,2025/11/05 17:15:59,0.0,0.0,0.2735268249780123,39.116
"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","Prompt:Write python function check whether sequence numbers has an increasing trend 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,61,10,0.001,1.164,2025/11/05 17:15:59,0.0,2.0,0.2515391380826736,36.069
"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",Prompt:Write python function find smallest prime divisor number. Assesments:assert smallest_Divisor 10 ==2 assert smallest_Divisor 25 ==5 assert smallest_Divisor 31 ==31,55,42,13,0.001,1.31,2025/11/05 17:15:59,0.0,0.0,0.3799472295514512,33.768
"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]","Prompt:Write function multiply two lists using map 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,72,11,0.001,1.153,2025/11/05 17:15:59,0.0,0.0,0.2418645558487247,38.67
"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",Prompt:Write python function check whether given number can be represented sum two squares not. Assesments:assert sum_Square 25 == True assert sum_Square 24 == False assert sum_Square 17 == True,56,45,11,0.001,1.244,2025/11/05 17:15:59,0.0,2.0,0.3218997361477572,36.36
"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",Prompt:Write python function count occurences character repeated string. Assesments:assert count_Char abcac 'a' ==4 assert count_Char abca 'c' ==2 assert count_Char aba 'a' ==7,62,48,14,0.001,1.292,2025/11/05 17:15:59,0.0,0.0,0.3641160949868074,34.73
"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",Prompt:Write python function find sum prime numbers 1 n. Assesments:assert sum_Of_Primes 10 ==17 assert sum_Of_Primes 20 ==77 assert sum_Of_Primes 5 ==10,60,47,13,0.001,1.277,2025/11/05 17:15:59,0.0,0.0,0.3509234828496041,34.062
"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}'",Prompt:Write function find frequency element 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,146,70,0.002,1.479,2025/11/05 17:15:59,0.0,0.0,0.5285839929639402,78.535
"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","Prompt:Write function find greatest common divisor gcd two integers using recursion. Assesments:assert recur_gcd 12,14 ==2 assert recur_gcd 13,17 ==1 assert recur_gcd 9 3 ==3",65,48,17,0.001,1.354,2025/11/05 17:15:59,0.0,0.0,0.4186455584872472,34.795
"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","Prompt:Write function get length 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,54,7,0.001,1.13,2025/11/05 17:15:59,0.0,0.0,0.2216358839050131,33.627
"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",Prompt:##write function find minimum number jumps reach end array given array integers where each element represents max number steps can be made forward 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,118,54,0.002,1.458,2025/11/05 17:15:59,0.0,2.0,0.5101143359718557,77.757
"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]",Prompt:Write function multiply consecutive numbers 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,122,49,0.002,1.402,2025/11/05 17:15:59,0.0,0.0,0.4608619173262971,68.895
"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]}",Prompt:Write function group 1st elements basis 2nd elements 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,160,71,0.002,1.444,2025/11/05 17:15:59,0.0,0.0,0.497801231310466,85.542
"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",Prompt:Write python function find last two digits factorial given number. Assesments:assert last_Two_Digits 7 ==40 assert last_Two_Digits 5 ==20 assert last_Two_Digits 2 ==2,61,47,14,0.001,1.298,2025/11/05 17:15:59,0.0,0.0,0.3693931398416887,34.057
"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'",Prompt:Write function remove multiple spaces string 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,58,8,0.001,1.138,2025/11/05 17:15:59,0.0,0.0,0.2286719437115214,34.467
"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]",Prompt:Write function extract unique values 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,224,90,0.003,1.402,2025/11/05 17:15:59,0.0,0.0,0.4608619173262971,102.117
"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",Prompt:Write function check if each element second tuple is greater corresponding index 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,75,28,0.001,1.373,2025/11/05 17:15:59,0.0,1.5,0.4353562005277044,52.195
"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']]",Prompt:Write function zip two given lists 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,174,50,0.002,1.287,2025/11/05 17:15:59,0.0,0.0,0.3597185576077396,86.568
"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","Prompt:Write function find number even elements 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,73,21,0.001,1.288,2025/11/05 17:15:59,0.0,0.0,0.3605980650835532,41.646
"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}",Prompt:Write function sort dictionary items tuple product keys given dictionary 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,178,91,0.003,1.511,2025/11/05 17:15:59,0.0,0.0,0.5567282321899735,100.034
"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","Prompt:Write python function find minimum number swaps required convert one binary string another. Assesments:assert min_Swaps 1101,1110 ==1 assert min_Swaps 1111,0100 == Possible assert min_Swaps 1110000,0001101 ==3",76,61,15,0.001,1.246,2025/11/05 17:15:59,0.0,0.0,0.3236587510993843,35.135
"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","Prompt:Write function count number elements list which are within 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,103,2,0.001,1.019,2025/11/05 17:15:59,0.0,2.0,0.1240105540897096,41.982
"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",Prompt:Write function find equilibrium index 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,64,26,0.001,1.406,2025/11/05 17:15:59,0.0,0.0,0.4643799472295513,42.421
"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","Prompt:Write function find minimum number elements should be removed 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,88,37,0.001,1.42,2025/11/05 17:15:59,0.0,2.0,0.4766930518909409,54.502
"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","Prompt:Write function check whether given key is present dictionary 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,113,41,0.001,1.363,2025/11/05 17:15:59,0.0,1.0,0.426561125769569,58.37
"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 ",Prompt:Write function calculate harmonic sum n-1 Assesments:assert harmonic_sum 10 ==2.9289682539682538 assert harmonic_sum 4 ==2.083333333333333 assert harmonic_sum 7 ==2.5928571428571425,63,55,8,0.001,1.145,2025/11/05 17:15:59,0.0,0.0,0.2348284960422163,33.5
"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++']]",Prompt:Write function sort list lists length 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,143,60,0.002,1.42,2025/11/05 17:15:59,0.0,0.0,0.4766930518909409,84.808
"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",Prompt:Write function find whether array is subset 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,97,39,0.001,1.402,2025/11/05 17:15:59,0.0,1.0,0.4608619173262971,63.374
"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",Prompt:Write python function count total set bits 1 n. Assesments:assert count_Set_Bits 16 ==33 assert count_Set_Bits 2 ==2 assert count_Set_Bits 14 ==28,57,44,13,0.001,1.295,2025/11/05 17:15:59,0.0,0.0,0.3667546174142479,33.975
"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']",Prompt:Write python function convert string list. Assesments:assert Convert 'python program' == 'python' 'program' assert Convert 'Data Analysis' == 'Data' 'Analysis' assert Convert 'Hadoop Training' == 'Hadoop' 'Training',56,54,2,0.001,1.037,2025/11/05 17:15:59,0.0,0.0,0.1398416886543534,38.058
"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}'",Prompt:Write function count unique keys value present 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,187,89,0.003,1.476,2025/11/05 17:15:59,0.0,0.0,0.5259454705364995,101.499
"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)",Prompt:Write function access initial last data 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,76,27,0.001,1.355,2025/11/05 17:15:59,0.0,0.0,0.4195250659630606,45.853
"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",Prompt:Write python function check whether product digits number even odd places is equal not. Assesments:assert product_Equal 2841 == True assert product_Equal 1234 == False assert product_Equal 1212 == False,62,48,14,0.001,1.292,2025/11/05 17:15:59,0.0,1.0,0.3641160949868074,36.862
"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]",Prompt:Write function remove duplicates list 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 b c c == b c assert remove_duplicate 1 3 5 6 3 5 6 1 == 1 3 5 6,144,88,56,0.001,1.636,2025/11/05 17:15:59,0.0,0.0,0.6666666666666665,66.27
"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",Prompt:Write function check if the given tuple contains valid values 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,45,24,0.001,1.533,2025/11/05 17:15:59,0.0,2.0,0.5760773966578715,41.578
"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",Prompt:Write python function count number distinct power prime factor given number. Assesments:assert count_Fac 24 ==3 assert count_Fac 12 ==2 assert count_Fac 4 ==1,56,42,14,0.001,1.333,2025/11/05 17:15:59,0.0,0.0,0.4001759014951626,34.679
"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)",Prompt:Write function convert given string integers 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,93,38,0.001,1.409,2025/11/05 17:15:59,0.0,0.0,0.467018469656992,61.754
"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",Prompt:Write function find perimeter rombus. Assesments:assert rombus_perimeter 10 ==40 assert rombus_perimeter 5 ==20 assert rombus_perimeter 4 ==16,47,40,7,0.001,1.175,2025/11/05 17:15:59,0.0,0.0,0.2612137203166227,33.487
"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","Prompt:Write function calculate 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,82,12,0.001,1.146,2025/11/05 17:15:59,0.0,0.0,0.2357080035180298,35.374
"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]","Prompt:Write function create list taking alternate elements 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,103,40,0.002,1.388,2025/11/05 17:15:59,0.0,0.0,0.4485488126649075,64.844
"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!')",Prompt:Write function matches string has an a followed zero b's Assesments:assert text_match ac == 'Found match! assert text_match dc == 'Not matched! assert text_match abba == 'Found match!,60,45,15,0.001,1.333,2025/11/05 17:15:59,0.0,3.0,0.4001759014951626,38.83
"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})",Prompt:Write function add dictionary 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,133,80,0.002,1.602,2025/11/05 17:15:59,0.0,0.0,0.6367634124890063,66.613
"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 ",Prompt:Write function find path maximum average existing paths given square matrix sizen*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,154,111,43,0.001,1.387,2025/11/05 17:15:59,0.0,0.0,0.4476693051890941,62.664
"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)}","Prompt:Write function filter height width students which are stored 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,261,38,0.002,1.146,2025/11/05 17:15:59,0.0,2.0,0.2357080035180298,89.511
"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",Prompt:Write function count pair 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,163,68,0.002,1.417,2025/11/05 17:15:59,0.0,0.0,0.4740545294635004,84.69
"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","Prompt:Write function calculate sum digits base 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,45,11,0.001,1.244,2025/11/05 17:15:59,0.0,0.0,0.3218997361477572,34.427
"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']",Prompt:Write function extract values quotation marks given string using regex. Assesments:assert extract_quotation 'Cortex A53 Based multi tasking Processor' == 'A53' 'multi' 'Processor' assert extract_quotation 'Cast favorite entertainment apps' == 'favorite' 'apps' assert extract_quotation 'Watch content 4k Ultra HD resolution HDR 10 Support' == '4k Ultra HD' 'HDR 10',111,90,21,0.001,1.233,2025/11/05 17:15:59,0.0,0.0,0.3122251539138083,42.064
"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)",Prompt:Write function multiply adjacent elements 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,80,32,0.001,1.4,2025/11/05 17:15:59,0.0,0.0,0.4591029023746701,54.732
"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' ",Prompt:Write function remove characters except letters numbers using regex Assesments:assert remove_char 123abcjw:.@ eiw == '123abcjweiw' assert remove_char Hello1234:Howare33u == 'Hello1234Howare33u' assert remove_char Cool543Triks@ Make@987Trips == 'Cool543TriksMake987Trips',91,77,14,0.001,1.182,2025/11/05 17:15:59,0.0,0.0,0.2673702726473174,35.086
"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]","Prompt:Write function sum elements 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,79,9,0.001,1.114,2025/11/05 17:15:59,0.0,0.0,0.2075637642919965,36.221
"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]","Prompt:Write function add two lists using map 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,70,13,0.001,1.186,2025/11/05 17:15:59,0.0,0.0,0.2708883025505716,39.3
"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']",Prompt:Write function remove consecutive duplicates 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,152,52,0.002,1.342,2025/11/05 17:15:59,0.0,0.0,0.4080914687774846,72.618
"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","Prompt:Write function find lateral surface area cone. Assesments:assert lateralsurface_cone 5,12 ==204.20352248333654 assert lateralsurface_cone 10,15 ==566.3586699569488 assert lateralsurface_cone 19,17 ==1521.8090132193388",76,69,7,0.001,1.101,2025/11/05 17:15:59,0.0,0.0,0.1961301671064203,33.85
"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')",Prompt:Write function replace occurrences spaces commas dots colon. Assesments:assert replace_specialchar 'Python language Programming language.' == 'Python language::Programming language:assert replace_specialchar 'abc ef' == 'ab:c:d:e:f' assert replace_specialchar 'ram reshma ram rahim' == 'ram reshma:ram:rahim',92,72,20,0.001,1.278,2025/11/05 17:15:59,0.0,0.0,0.3518029903254178,43.171
"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",Prompt:Write function find index first occurrence given number 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,104,47,0.001,1.452,2025/11/05 17:15:59,0.0,0.0,0.5048372911169744,66.979
"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","Prompt:Write python function find sum products 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,70,13,0.001,1.186,2025/11/05 17:15:59,0.0,0.0,0.2708883025505716,34.998
"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",Prompt:Write python function toggle bits number except first last bit. Assesments:assert toggle_middle_bits 9 ==15 assert toggle_middle_bits 10 ==12 assert toggle_middle_bits 11 ==13,56,41,15,0.001,1.366,2025/11/05 17:15:59,0.0,0.0,0.4291996481970097,34.434
"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","Prompt:Write function locate left insertion point specified value 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,65,8,0.001,1.123,2025/11/05 17:15:59,0.0,0.0,0.2154793315743183,35.937
"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'",Prompt:Write function check whether given string is starting vowel using regex. Assesments:assert check_str annie == 'Valid' assert check_str dawood == 'Invalid' assert check_str Else == 'Valid',57,44,13,0.001,1.295,2025/11/05 17:15:59,0.0,1.0,0.3667546174142479,35.098
"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",Prompt:Write function calculate geometric sum n-1 Assesments:assert geometric_sum 7 == 1.9921875 assert geometric_sum 4 == 1.9375 assert geometric_sum 8 == 1.99609375,59,49,10,0.001,1.204,2025/11/05 17:15:59,0.0,0.0,0.2867194371152154,33.489
"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",Prompt:Write python function find index smallest triangular number n digits. Assesments:assert find_Index 2 ==4 assert find_Index 3 ==14 assert find_Index 4 ==45,51,38,13,0.001,1.342,2025/11/05 17:15:59,0.0,0.0,0.4080914687774846,33.988
"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}",Prompt:Write function convert given tuple 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,105,41,0.001,1.39,2025/11/05 17:15:59,0.0,0.0,0.4503078276165346,60.667
"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",Prompt:Write python function check whether 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,44,12,0.001,1.273,2025/11/05 17:15:59,0.0,3.0,0.3474054529463499,34.153
"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",Prompt:Write function caluclate area tetrahedron. Assesments:assert area_tetrahedron 3 ==15.588457268119894 assert area_tetrahedron 20 ==692.8203230275509 assert area_tetrahedron 10 ==173.20508075688772,67,60,7,0.001,1.117,2025/11/05 17:15:59,0.0,0.0,0.2102022867194371,33.585
"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]","Prompt:Write function rotate given list specified number items 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,165,66,0.002,1.4,2025/11/05 17:15:59,0.0,0.0,0.4591029023746701,82.979
"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",Prompt:Write function check if the given tuple has any none value 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,62,20,0.001,1.323,2025/11/05 17:15:59,0.0,2.0,0.3913808267370272,41.933
"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]","Prompt:Write function find numbers within given range where every number is divisible every digit 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,103,32,0.001,1.311,2025/11/05 17:16:00,0.0,1.0,0.3808267370272646,61.051
"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","Prompt:Write function find area sector. Assesments:assert sector_area 4,45 ==6.285714285714286 assert sector_area 9,45 ==31.82142857142857 assert sector_area 9,360 ==None",57,51,6,0.001,1.118,2025/11/05 17:16:00,0.0,0.0,0.2110817941952507,33.206
"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",Prompt:Write function find longest common subsequence 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,105,19,0.001,1.181,2025/11/05 17:16:00,0.0,0.0,0.266490765171504,43.456
"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'",Prompt:Write function put spaces words starting capital letters given string using regex. Assesments:assert capital_words_spaces Python == 'Python' assert capital_words_spaces PythonProgrammingExamples == 'Python Programming Examples' assert capital_words_spaces GetReadyToBeCodingFreak == 'Get Ready Coding Freak',74,59,15,0.001,1.254,2025/11/05 17:16:00,0.0,0.0,0.3306948109058927,36.58
"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]",Prompt:Write function sort given list strings 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,245,17,0.003,1.069,2025/11/05 17:16:00,0.0,0.0,0.1679859278803869,109.724
"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]",Prompt:Write function add given tuple 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,86,35,0.001,1.407,2025/11/05 17:16:00,0.0,0.0,0.465259454705365,59.083
"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",Prompt:Write function check if the given array represents min heap 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,78,26,0.001,1.333,2025/11/05 17:16:00,0.0,2.0,0.4001759014951626,44.737
"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",Prompt:Write function find nth jacobsthal number. Assesments:assert jacobsthal_num 5 ==11 assert jacobsthal_num 2 ==1 assert jacobsthal_num 4 ==5,57,46,11,0.001,1.239,2025/11/05 17:16:00,0.0,0.0,0.3175021987686896,33.198
"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)]",Prompt:Write function find minimum k records 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,145,27,0.002,1.186,2025/11/05 17:16:00,0.0,0.0,0.2708883025505716,69.35
"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]",Prompt:Write function find common index elements 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,168,66,0.002,1.393,2025/11/05 17:16:00,0.0,0.0,0.4529463500439754,92.711
"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","Prompt:Write function find second smallest number 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,68,19,0.001,1.279,2025/11/05 17:16:00,0.0,0.0,0.3526824978012312,40.644
"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!')",Prompt:Write function matches string has an a followed zero one 'b'. Assesments:assert text_match_zero_one ac == 'Found match! assert text_match_zero_one dc == 'Not matched! assert text_match_zero_one abbbba == 'Found match!,68,54,14,0.001,1.259,2025/11/05 17:16:00,0.0,3.0,0.3350923482849603,38.907
"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' ",Prompt:Write function count pairs reverse strings given string list. Assesments:assert count_reverse_pairs julia best tseb ailuj == '2' assert count_reverse_pairs geeks best skeeg == '1' assert count_reverse_pairs makes best sekam rof == '2',95,57,38,0.001,1.667,2025/11/05 17:16:00,0.0,0.0,0.6939313984168866,40.122
"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}",Prompt:Write function count number unique lists within 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,171,66,0.002,1.386,2025/11/05 17:16:00,0.0,0.0,0.4467897977132805,72.961
"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",Prompt:Write function check decimal precision 2. Assesments:assert is_decimal '123.11' ==True assert is_decimal 'e666.86' ==False assert is_decimal '3.124587' ==False,54,46,8,0.001,1.174,2025/11/05 17:16:00,0.0,0.0,0.2603342128408091,33.829
"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'","Prompt:Write python function check whether array contains one distinct element 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,69,8,0.001,1.116,2025/11/05 17:16:00,0.0,0.0,0.2093227792436236,36.343
"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","Prompt:Write function caluclate arc length angle. Assesments:assert arc_length 9,45 ==3.5357142857142856 assert arc_length 9,480 ==None assert arc_length 5,270 ==11.785714285714285",61,55,6,0.001,1.109,2025/11/05 17:16:00,0.0,0.0,0.2031662269129287,40.025
"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",Prompt:Write function check whether given month number contains 30 days not. Assesments:assert check_monthnumber_number 6 ==True assert check_monthnumber_number 2 ==False assert check_monthnumber_number 12 ==False,52,46,6,0.001,1.13,2025/11/05 17:16:00,0.0,0.0,0.2216358839050131,33.807
"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","Prompt:Write python function find minimum difference two elements 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,72,15,0.001,1.208,2025/11/05 17:16:00,0.0,0.0,0.2902374670184696,35.169
"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",Prompt:Write python function count numeric values given string. Assesments:assert number_ctr 'program2bedone' ==1 assert number_ctr '3wonders' ==1 assert number_ctr '123' ==3,52,44,8,0.001,1.182,2025/11/05 17:16:00,0.0,0.0,0.2673702726473174,33.436
"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",Prompt:Write function find nth polite number. Assesments:assert is_polite 7 ==11 assert is_polite 4 ==7 assert is_polite 9 ==13,47,37,10,0.001,1.27,2025/11/05 17:16:00,0.0,0.0,0.3447669305189094,32.676
"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)]","Prompt:Write function iterate pairs consecutive items 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,156,50,0.002,1.321,2025/11/05 17:16:00,0.0,0.0,0.3896218117854001,64.893
"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","Prompt:Write python function count number pairs whose sum is equal 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,75,14,0.001,1.187,2025/11/05 17:16:00,0.0,1.0,0.2717678100263853,38.72
"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",Prompt:Write python function check odd parity given number. Assesments:assert check_Odd_Parity 13 == True assert check_Odd_Parity 21 == True assert check_Odd_Parity 18 == False,55,45,10,0.001,1.222,2025/11/05 17:16:00,0.0,0.0,0.3025505716798592,33.859
"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]","Prompt:Write python function get difference 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,99,27,0.001,1.273,2025/11/05 17:16:00,0.0,0.0,0.3474054529463499,53.11
"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",Prompt:Write python function find sum fourth power 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,49,11,0.001,1.224,2025/11/05 17:16:00,0.0,0.0,0.3043095866314863,34.292
"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",Prompt:Write function check if the given expression is balanced not. Assesments:assert check_expression == True assert check_expression == False assert check_expression == True,56,32,24,0.001,1.75,2025/11/05 17:16:00,0.0,1.5,0.7669305189094107,36.108
"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'",Prompt:Write function remove words k length given string. Assesments:assert remove_length 'The person is most value tet' 3 == 'person is most value' assert remove_length 'If told ok' 4 == 'If ok' assert remove_length 'Forces darkeness is come play' 4 == 'Forces darkeness is the',94,73,21,0.001,1.288,2025/11/05 17:16:00,0.0,1.5,0.3605980650835532,44.838
"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)",Prompt:Write function find occurrence position substrings within 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,84,15,0.001,1.179,2025/11/05 17:16:00,0.0,0.0,0.2647317502198769,45.091
"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'",Prompt:Write function check if the string is a valid email address 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,63,10,0.001,1.159,2025/11/05 17:16:00,0.0,2.0,0.247141600703606,34.854
"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","Prompt:Write python function check whether every odd index contains odd numbers 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,63,9,0.001,1.143,2025/11/05 17:16:00,0.0,0.0,0.2330694810905892,34.157
"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",Prompt:Write function count characters which have vowels neighbors given string. Assesments:assert count_vowels 'bestinstareels' ==7 assert count_vowels 'partofthejourneyistheend' ==12 assert count_vowels 'amazonprime' ==5,67,55,12,0.001,1.218,2025/11/05 17:16:00,0.0,2.0,0.299032541776605,35.844
"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","Prompt:Write python function find sum non-repeated elements 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,94,14,0.001,1.149,2025/11/05 17:16:00,0.0,0.0,0.2383465259454705,36.153
"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']]",Prompt:Write function pack consecutive duplicates given list elements 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,183,61,0.002,1.333,2025/11/05 17:16:00,0.0,0.0,0.4001759014951626,77.874
"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}",Prompt:Write function count number unique lists within 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,161,61,0.002,1.379,2025/11/05 17:16:00,0.0,0.0,0.4406332453825857,82.737
"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)]",Prompt:Write function find combinations sums tuples 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,151,67,0.002,1.444,2025/11/05 17:16:00,0.0,0.0,0.497801231310466,84.046
"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""",Prompt:Write python function check whether count divisors is even odd. Assesments:assert count_Divisors 10 == Even assert count_Divisors 100 == Odd assert count_Divisors 125 == Even,62,48,14,0.001,1.292,2025/11/05 17:16:00,0.0,1.0,0.3641160949868074,34.881
"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","Prompt:Write python function find sum 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,55,13,0.001,1.236,2025/11/05 17:16:00,0.0,0.0,0.3148636763412489,34.0
"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)",Prompt:Write function convert rgb color 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,100,18,0.001,1.18,2025/11/05 17:16:00,0.0,0.0,0.2656112576956903,41.778
"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","Prompt:Write function find product first even odd number 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,84,12,0.001,1.143,2025/11/05 17:16:00,0.0,0.0,0.2330694810905892,35.545
"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)",Prompt:Write function convert tuple string 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,65,21,0.001,1.323,2025/11/05 17:16:00,0.0,0.0,0.3913808267370272,42.031
"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","Prompt:Write function locate right insertion point specified value 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,65,8,0.001,1.123,2025/11/05 17:16:00,0.0,0.0,0.2154793315743183,35.944
"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!')",Prompt:Write function matches string has an a followed three 'b'. Assesments:assert text_match_three ac == 'Not matched! assert text_match_three dc == 'Not matched! assert text_match_three abbbba == 'Found match!,62,50,12,0.001,1.24,2025/11/05 17:16:00,0.0,3.0,0.318381706244503,36.699
"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')","Prompt:Write function create new tuple given string list. Assesments:assert new_tuple WEB best == 'WEB' 'is' 'best' assert new_tuple are],Developers == 'We' 'are' 'Developers' assert new_tuple Part Wrong == 'Part' 'is' 'Wrong'",89,63,26,0.001,1.413,2025/11/05 17:16:00,0.0,3.0,0.4705364995602463,42.531
"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","Prompt:Write function calculate perimeter regular polygon. Assesments:assert perimeter_polygon 4,20 ==80 assert perimeter_polygon 10,15 ==150 assert perimeter_polygon 9,7 ==63",47,40,7,0.001,1.175,2025/11/05 17:16:00,0.0,0.0,0.2612137203166227,33.646
"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","Prompt:Write python function check whether every even index contains even numbers 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,53,9,0.001,1.17,2025/11/05 17:16:00,0.0,0.0,0.2568161829375548,34.159
"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)",Prompt:Write function remove nested record 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,86,35,0.001,1.407,2025/11/05 17:16:00,0.0,0.0,0.465259454705365,62.069
"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","Prompt:Write python function count number lists given number 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,69,23,0.001,1.333,2025/11/05 17:16:00,0.0,0.0,0.4001759014951626,48.927
"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","Prompt:Write python function find last position element 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,72,15,0.001,1.208,2025/11/05 17:16:00,0.0,0.0,0.2902374670184696,36.033
"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!')",Prompt:Write function matches string has an 'a' followed anything ending 'b'. Assesments:assert text_starta_endb aabbbb == 'Found match! assert text_starta_endb aabAbbbc == 'Not matched! assert text_starta_endb accddbbjjj == 'Not matched!,80,66,14,0.001,1.212,2025/11/05 17:16:00,0.0,2.0,0.2937554969217238,38.751
"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}]","Prompt:Write function find n cheap price items 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,218,21,0.002,1.096,2025/11/05 17:16:00,0.0,0.0,0.1917326297273527,57.229
"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",Prompt:Write function find sum items 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,68,20,0.001,1.294,2025/11/05 17:16:00,0.0,0.0,0.3658751099384345,38.751
"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","Prompt:Write python function find sum odd natural numbers within rangel r. Assesments:assert sum_in_Range 2,5 ==8 assert sum_in_Range 5,7 ==12 assert sum_in_Range 7,13 ==40",67,52,15,0.001,1.288,2025/11/05 17:16:00,0.0,0.0,0.3605980650835532,34.829
"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",Prompt:Write python function find sum array. Assesments:assert _sum 1 2 3 ==6 assert _sum 15 12 13 10 ==50 assert _sum 0 1 2 ==3,68,48,20,0.001,1.417,2025/11/05 17:16:00,0.0,0.0,0.4740545294635004,38.193
"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","Prompt:Write python function left rotate bits given number. Assesments:assert left_Rotate 16,2 ==64 assert left_Rotate 10,2 ==40 assert left_Rotate 99,3 == 792",58,46,12,0.001,1.261,2025/11/05 17:16:00,0.0,0.0,0.3368513632365874,33.823
"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')",Prompt:Write function remove whitespaces 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,55,9,0.001,1.164,2025/11/05 17:16:00,0.0,0.0,0.2515391380826736,34.571
"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","Prompt:Write python function count number equal numbers 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,53,13,0.001,1.245,2025/11/05 17:16:00,0.0,0.0,0.3227792436235708,34.909
"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","Prompt:Write python function count number rotations required generate 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,69,14,0.001,1.203,2025/11/05 17:16:00,0.0,0.0,0.2858399296394019,36.386
"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",Prompt:Write python function check whether given number is a perfect square not. Assesments:assert is_Perfect_Square 10 == False assert is_Perfect_Square 36 == True assert is_Perfect_Square 14 == False,58,49,9,0.001,1.184,2025/11/05 17:16:00,0.0,2.0,0.2691292875989445,34.545
"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","Prompt:Write python function check whether product numbers is even 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,62,10,0.001,1.161,2025/11/05 17:16:00,0.0,1.0,0.248900615655233,36.723
"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] ","Prompt:Write function find list list lists whose sum 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",123,100,23,0.001,1.23,2025/11/05 17:16:00,0.0,2.0,0.3095866314863676,50.137
"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",Prompt:Write function find maximum run uppercase characters given string. Assesments:assert max_run_uppercase 'GeMKSForGERksISBESt' ==5 assert max_run_uppercase 'PrECIOusMOVemENTSYT' ==6 assert max_run_uppercase 'GooGLEFluTTER' ==4,78,68,10,0.001,1.147,2025/11/05 17:16:00,0.0,0.0,0.2365875109938434,33.878
"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","Prompt:Write python function find first odd number given list 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,55,14,0.001,1.255,2025/11/05 17:16:00,0.0,0.0,0.3315743183817061,34.314
"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",Prompt:Write function check if the given tuples contain k 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,72,26,0.001,1.361,2025/11/05 17:16:00,0.0,2.0,0.4248021108179419,46.063
"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",Prompt:Write function check if each element second tuple is smaller corresponding index 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,75,26,0.001,1.347,2025/11/05 17:16:00,0.0,1.5,0.4124890061565523,52.062
"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']","Prompt:Write function iterate elements repeating many times 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,270,9,0.003,1.033,2025/11/05 17:16:00,0.0,0.0,0.1363236587510993,141.784
"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",Prompt:Write function check if two lists tuples are identical 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,83,30,0.001,1.361,2025/11/05 17:16:00,0.0,1.0,0.4248021108179419,56.995
"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.')",Prompt:Write function abbreviate 'road' 'rd.' given string. Assesments:assert road_rd ravipadu Road == 'ravipaduRd.' assert road_rd palnadu Road == 'palnaduRd.' assert road_rd eshwar enclave Road == 'eshwar enclaveRd.',71,62,9,0.001,1.145,2025/11/05 17:16:00,0.0,0.0,0.2348284960422163,35.579
"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",Prompt:Write function find length string. Assesments:assert string_length 'python' ==6 assert string_length 'program' ==7 assert string_length 'language' ==8,42,36,6,0.001,1.167,2025/11/05 17:16:00,0.0,0.0,0.2541776605101143,33.247
"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","Prompt:Write function find area rombus. Assesments:assert rombus_area 10,20 ==100 assert rombus_area 10,5 ==25 assert rombus_area 4,2 ==4",50,43,7,0.001,1.163,2025/11/05 17:16:00,0.0,0.0,0.2506596306068602,33.543
"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]","Prompt:Write function sort given array without using sorting algorithm. given array consists 0 1 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,166,45,0.002,1.271,2025/11/05 17:16:00,0.0,0.0,0.3456464379947228,76.191
"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)) == ()","Prompt:Write function clear values 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,55,21,0.001,1.382,2025/11/05 17:16:00,0.0,0.0,0.4432717678100262,39.329
"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]","Prompt:Write function find numbers divisible n list 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,119,36,0.001,1.303,2025/11/05 17:16:00,0.0,0.0,0.3737906772207563,63.806
"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",Prompt:Write python function count lower case letters given string. Assesments:assert lower_ctr 'abc' ==3 assert lower_ctr 'string' ==6 assert lower_ctr 'Python' ==5,49,40,9,0.001,1.225,2025/11/05 17:16:00,0.0,0.0,0.3051890941073,33.52
"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])","Prompt:Write function count frequency consecutive duplicate elements given list 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,186,56,0.002,1.301,2025/11/05 17:16:00,0.0,0.0,0.3720316622691292,73.637
"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",Prompt:Write function check whether given month number contains 28 days not. Assesments:assert check_monthnum_number 2 ==True assert check_monthnum_number 1 ==False assert check_monthnum_number 3 ==False,52,46,6,0.001,1.13,2025/11/05 17:16:00,0.0,0.0,0.2216358839050131,33.747
"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'}",Prompt:Write function merge two dictionaries 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,161,64,0.002,1.398,2025/11/05 17:16:00,0.0,0.0,0.457343887423043,66.429
"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",Prompt:Write function 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,41,7,0.001,1.171,2025/11/05 17:16:00,0.0,1.5,0.2576956904133685,33.702
"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'",Prompt:Write function check if the given string starts substring using regex. Assesments:assert check_substring dreams dreams makes life fun makes == 'string doesnt start given substring' assert check_substring Hi how are you Hi alex Hi == 'string starts given substring' assert check_substring long day == 'string doesnt start given substring',97,68,29,0.001,1.426,2025/11/05 17:16:00,0.0,2.5,0.4819700967458222,41.231
"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]","Prompt:Write python function remove even numbers 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,63,10,0.001,1.159,2025/11/05 17:16:00,0.0,0.0,0.247141600703606,34.578
"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]","Prompt:Write python function access multiple elements specified index 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,87,17,0.001,1.195,2025/11/05 17:16:00,0.0,0.0,0.2788038698328936,42.156
"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""","Prompt:Write python function find type triangle 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,70,16,0.001,1.229,2025/11/05 17:16:00,0.0,0.0,0.3087071240105541,34.501
"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","Prompt:Write function sum specific column list given list 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,109,16,0.001,1.147,2025/11/05 17:16:00,0.0,0.0,0.2365875109938434,41.859
"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)","Prompt:Write function count alphabets digits special charactes 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,79,18,0.001,1.228,2025/11/05 17:16:00,0.0,0.0,0.3078276165347405,38.386
"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'",Prompt:Write function find second repeated frequent string 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,102,-5,0.001,0.951,2025/11/05 17:16:00,-0.0,0.0,0.0642040457343887,45.907
"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","Prompt:Write function round number 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,53,7,0.001,1.132,2025/11/05 17:16:00,0.0,0.0,0.2233948988566401,33.611
"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","Prompt:Write python function count equal element pairs 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,66,12,0.001,1.182,2025/11/05 17:16:00,0.0,0.0,0.2673702726473174,34.722
"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",Prompt:Write function extract maximum numeric value string using regex. Assesments:assert extract_max '100klh564abc365bg' == 564 assert extract_max 'hello300how546mer231' == 546 assert extract_max 'its233beenalong343journey234' == 343,69,61,8,0.001,1.131,2025/11/05 17:16:00,0.0,0.0,0.2225153913808267,34.186
"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]","Prompt:Write function get dictionary keys 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,76,7,0.001,1.092,2025/11/05 17:16:00,0.0,0.0,0.1882145998240985,36.699
"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]]","Prompt:Write function generate square matrix filled elements 1 n raised power 2 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,165,70,0.002,1.424,2025/11/05 17:16:00,0.0,0.0,0.4802110817941952,88.054
"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","Prompt:Write python function find slope 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,52,12,0.001,1.231,2025/11/05 17:16:00,0.0,0.0,0.3104661389621812,33.562
"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","Prompt:Write function find length subarray 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,80,29,0.001,1.363,2025/11/05 17:16:00,0.0,0.0,0.426561125769569,46.295
"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",Prompt:Write python function find cube sum first n odd natural numbers. Assesments:assert cube_Sum 2 ==28 assert cube_Sum 3 == 153 assert cube_Sum 4 == 496,54,44,10,0.001,1.227,2025/11/05 17:16:00,0.0,0.0,0.306948109058927,33.899
"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","Prompt:Write python function find minimum number swaps required 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,57,11,0.001,1.193,2025/11/05 17:16:00,0.0,0.0,0.2770448548812665,33.879
"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)]",Prompt:Write function sort tuples alphabetically first item 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,169,73,0.003,1.432,2025/11/05 17:16:00,0.0,0.0,0.4872471416007035,77.963
"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""","Prompt:Write python function check whether roots quadratic equation are numerically equal opposite sign not. Assesments:assert Check_Solution 2,0 -1 == Yes assert Check_Solution 1 -5,6 == assert Check_Solution 2,0,2 == Yes",75,57,18,0.001,1.316,2025/11/05 17:16:00,0.0,1.0,0.3852242744063325,38.65
"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",Prompt:Write function count number inversions 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,63,26,0.001,1.413,2025/11/05 17:16:00,0.0,0.0,0.4705364995602463,41.552
"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",Prompt:Write function find number which occurs odd number times 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,105,42,0.001,1.4,2025/11/05 17:16:00,0.0,1.0,0.4591029023746701,63.256
"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","Prompt:Write function find nth super ugly number given prime list 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,81,11,0.001,1.136,2025/11/05 17:16:00,0.0,0.0,0.2269129287598943,36.46
"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","Prompt:Write python function find kth element array containing odd elements first even elements. Assesments:assert get_Number 8,5 ==2 assert get_Number 7,2 ==3 assert get_Number 5,2 ==3",62,47,15,0.001,1.319,2025/11/05 17:16:00,0.0,0.0,0.387862796833773,34.499
"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",Prompt:Write python function count number digits factorial given number. Assesments:assert find_Digits 7 ==4 assert find_Digits 5 ==3 assert find_Digits 4 ==2,55,40,15,0.001,1.375,2025/11/05 17:16:00,0.0,0.0,0.4371152154793316,34.235
"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","Prompt:Write function find minimum number platforms required 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,104,18,0.001,1.173,2025/11/05 17:16:00,0.0,0.0,0.2594547053649956,45.863
"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]
",Prompt:Write python function copy list 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,74,29,0.001,1.392,2025/11/05 17:16:00,0.0,0.0,0.4520668425681617,51.639
"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","Prompt:Write function find area trapezium. Assesments:assert area_trapezium 6,9,4 ==30 assert area_trapezium 10,20,30 ==450 assert area_trapezium 15,25,35 ==700",63,56,7,0.001,1.125,2025/11/05 17:16:00,0.0,0.0,0.2172383465259454,33.577
"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",Prompt:Write python function find sum prime divisors given number. Assesments:assert Sum 60 ==10 assert Sum 39 ==16 assert Sum 40 ==7,49,35,14,0.001,1.4,2025/11/05 17:16:00,0.0,0.0,0.4591029023746701,33.842
"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","Prompt:Write function check if a triangle positive area is possible 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,55,7,0.001,1.127,2025/11/05 17:16:00,0.0,1.5,0.2189973614775725,35.65
"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","Prompt:Write python function find sum inverse 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,63,11,0.001,1.175,2025/11/05 17:16:00,0.0,0.0,0.2612137203166227,33.747
"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]","Prompt:Write python function remove negative numbers 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,71,10,0.001,1.141,2025/11/05 17:16:00,0.0,0.0,0.2313104661389622,38.622
"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",Prompt:Write python function find sum odd factors number. Assesments:assert sum_of_odd_Factors 30 ==24 assert sum_of_odd_Factors 18 ==13 assert sum_of_odd_Factors 2 ==1,61,48,13,0.001,1.271,2025/11/05 17:16:00,0.0,0.0,0.3456464379947228,33.777
"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]",Prompt:Write function which accepts arbitrary list converts 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,111,46,0.002,1.414,2025/11/05 17:16:00,0.0,1.0,0.4714160070360597,55.973
"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",Prompt:Write python function check even parity given number. Assesments:assert check_Even_Parity 10 == True assert check_Even_Parity 11 == False assert check_Even_Parity 18 == True,55,45,10,0.001,1.222,2025/11/05 17:16:00,0.0,0.0,0.3025505716798592,33.867
"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","Prompt:Write python function find minimum adjacent swaps required 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,72,11,0.001,1.153,2025/11/05 17:16:00,0.0,0.0,0.2418645558487247,34.812
"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']]",Prompt:Write function list list 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,228,20,0.003,1.088,2025/11/05 17:16:00,0.0,0.0,0.1846965699208443,81.579
"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","Prompt:Write function count number lists given list lists square 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,90,37,0.001,1.411,2025/11/05 17:16:00,0.0,0.0,0.4687774846086192,56.606
"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]]","Prompt:Write function generate sublists 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,173,49,0.002,1.283,2025/11/05 17:16:00,0.0,0.0,0.3562005277044854,88.046
"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'",Prompt:Write function check whether given string is ending alphanumeric characters using regex. Assesments:assert check_alphanumeric dawood@ == 'Discard' assert check_alphanumeric skdmsam326 == 'Accept' assert check_alphanumeric cooltricks@ == 'Discard',70,56,14,0.001,1.25,2025/11/05 17:16:00,0.0,1.0,0.3271767810026385,36.212
"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""]",Prompt:Write function find anagrams string given list 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,70,33,0.001,1.471,2025/11/05 17:16:00,0.0,0.0,0.5215479331574319,53.187
"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)]","Prompt:Write function find occurrences n common words 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,88,20,0.001,1.227,2025/11/05 17:16:00,0.0,2.0,0.306948109058927,55.298
"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",Prompt:Write function find length longest sub-sequence elements 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,101,39,0.001,1.386,2025/11/05 17:16:00,0.0,1.0,0.4467897977132805,55.682
"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']",Prompt:Write function find palindromes given list 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,75,28,0.001,1.373,2025/11/05 17:16:00,0.0,0.0,0.4353562005277044,45.405
"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]","Prompt:Write function print n-times 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,121,42,0.002,1.347,2025/11/05 17:16:00,0.0,0.0,0.4124890061565523,54.981
"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",Prompt:Write function check whether given month name contains 31 days not. Assesments:assert check_monthnumb February ==False assert check_monthnumb January ==True assert check_monthnumb March ==True,52,43,9,0.001,1.209,2025/11/05 17:16:00,0.0,0.0,0.2911169744942832,33.847
"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","Prompt:Write python function add minimum number sum 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,78,15,0.001,1.192,2025/11/05 17:16:00,0.0,0.0,0.2761653474054529,36.104
"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",Prompt:Write python function find length last word 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,46,17,0.001,1.37,2025/11/05 17:16:00,0.0,0.0,0.4327176781002639,33.897
"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]]","Prompt:Write function remove sublists given list lists which are outside 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,187,74,0.003,1.396,2025/11/05 17:16:00,0.0,2.0,0.4555848724714159,99.945
"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","Prompt:Write function calculate sum positive numbers given list 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,95,29,0.001,1.305,2025/11/05 17:16:00,0.0,0.0,0.3755496921723834,53.731
"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",Prompt:Write python function check whether given strings are rotations not. Assesments:assert are_Rotations abc cba == False assert are_Rotations abcd cdba == False assert are_Rotations abacd cdaba == True,66,49,17,0.001,1.347,2025/11/05 17:16:00,0.0,1.0,0.4124890061565523,36.564
"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","Prompt:Write function check if a nested list is a subset 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,111,45,0.002,1.405,2025/11/05 17:16:00,0.0,2.0,0.4635004397537379,71.164
"Prompt: Write a function to solve the fibonacci sequence using recursion. Assesments: assert fibonacci(7) == 13, assert fibonacci(8) == 21, assert fibonacci(9) == 34",Prompt:Write function solve fibonacci sequence using recursion. Assesments:assert fibonacci 7 ==13 assert fibonacci 8 ==21 assert fibonacci 9 ==34,43,32,11,0.001,1.344,2025/11/05 17:16:00,0.0,0.0,0.4098504837291117,33.352
"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",Prompt:Write python function check if the string is a concatenation another string. Assesments:assert check_Concat abcabcabc abc == True assert check_Concat abcab abc == False assert check_Concat aba ab == False,61,47,14,0.001,1.298,2025/11/05 17:16:00,0.0,2.0,0.3693931398416887,35.517
"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",Prompt:Write function find minimum difference tuple pairs 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,79,35,0.001,1.443,2025/11/05 17:16:00,0.0,0.0,0.4969217238346526,55.137
"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","Prompt:Write python function find lcm two positive integers. Assesments:assert lcm 4,6 ==12 assert lcm 15,17 == 255 assert lcm 2,6 ==6",54,44,10,0.001,1.227,2025/11/05 17:16:00,0.0,0.0,0.306948109058927,33.501
"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""",Prompt:Write python function sort given string. Assesments:assert sort_String cba == abc assert sort_String data == aadt assert sort_String zxy == xyz,49,34,15,0.001,1.441,2025/11/05 17:16:00,0.0,0.0,0.4951627088830255,33.451
"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",Prompt:Write function check if the given tuple contains 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,89,32,0.001,1.36,2025/11/05 17:16:00,0.0,2.0,0.4239226033421285,57.456
"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!'",Prompt:Write function matches string has an 'a' followed anything ending 'b' using regex. Assesments:assert text_match aabbbbd == 'Not matched! assert text_match aabAbbbc == 'Not matched! assert text_match accddbbjjjb == 'Found match!,76,61,15,0.001,1.246,2025/11/05 17:16:00,0.0,2.0,0.3236587510993843,36.964
"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""","Prompt:Write python function find number solutions quadratic equation. Assesments:assert Check_Solution 2,5,2 == 2 solutions assert Check_Solution 1,1,1 == solutions assert Check_Solution 1,2,1 == 1 solution",67,55,12,0.001,1.218,2025/11/05 17:16:00,0.0,0.0,0.299032541776605,34.067
"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","Prompt:Write function find sum first even odd number 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,84,12,0.001,1.143,2025/11/05 17:16:00,0.0,0.0,0.2330694810905892,35.541
"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","Prompt:Write function caluclate perimeter parallelogram. Assesments:assert parallelogram_perimeter 10,20 ==400 assert parallelogram_perimeter 15,20 ==600 assert parallelogram_perimeter 8,9 ==144",58,52,6,0.001,1.115,2025/11/05 17:16:00,0.0,0.0,0.20844327176781,33.281
"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]","Prompt:Write function find numbers divisible n list 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,103,27,0.001,1.262,2025/11/05 17:16:00,0.0,0.0,0.337730870712401,55.105
"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 ","Prompt:Write python function check whether bits are within given range 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",90,78,12,0.001,1.154,2025/11/05 17:16:00,0.0,1.0,0.2427440633245381,35.18
"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",Prompt:Write python function check whether two given strings are isomorphic not. Assesments:assert is_Isomorphic paper title == True assert is_Isomorphic ab ba == True assert is_Isomorphic ab aa == False,61,43,18,0.001,1.419,2025/11/05 17:16:00,0.0,1.0,0.4758135444151275,36.528
"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","Prompt:Write function add numbers list divide length 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,63,20,0.001,1.317,2025/11/05 17:16:00,0.0,0.0,0.3861037818821459,39.278
"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",Prompt:Write python function check whether given number is odd using bitwise operator. Assesments:assert is_odd 5 == True assert is_odd 6 == False assert is_odd 7 == True,54,44,10,0.001,1.227,2025/11/05 17:16:00,0.0,1.0,0.306948109058927,34.543
"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))",Prompt:Write function substract elements 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,174,79,0.003,1.454,2025/11/05 17:16:00,0.0,0.0,0.5065963060686015,96.36
"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]]","Prompt:Write function reverse list given list 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,133,42,0.002,1.316,2025/11/05 17:16:00,0.0,0.0,0.3852242744063325,72.745
"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","Prompt:Write python function find index extra element present 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,96,14,0.001,1.146,2025/11/05 17:16:00,0.0,0.0,0.2357080035180298,38.766
"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","Prompt:Write python function check whether given two numbers have same number digits not. Assesments:assert same_Length 12,1 == False assert same_Length 2,2 == True assert same_Length 10,20 == True",57,47,10,0.001,1.213,2025/11/05 17:16:00,0.0,2.0,0.2946350043975374,35.169
"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')",Prompt:Write function remove multiple spaces 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,51,8,0.001,1.157,2025/11/05 17:16:00,0.0,0.0,0.2453825857519789,34.915
"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]",Prompt:Write python function get last element 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,98,26,0.001,1.265,2025/11/05 17:16:00,0.0,0.0,0.3403693931398416,62.353
"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)",Prompt:Write function convert given string float type 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,142,33,0.001,1.232,2025/11/05 17:16:00,0.0,0.0,0.3113456464379946,55.136
"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",Prompt:Write function find maximum sum subsequences given array 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,93,39,0.001,1.419,2025/11/05 17:16:00,0.0,0.0,0.4758135444151275,55.604
"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)] ","Prompt:Write function sort list increasing order last element tuple given list 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",189,140,49,0.002,1.35,2025/11/05 17:16:00,0.0,0.0,0.415127528583993,70.792
"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",Prompt:Write python function check whether word is present given sentence 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,50,17,0.001,1.34,2025/11/05 17:16:00,0.0,1.0,0.4063324538258576,35.926
"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]","Prompt:Write function extract specified number elements given list which follow 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,90,28,0.001,1.311,2025/11/05 17:16:00,0.0,1.0,0.3808267370272646,56.909
"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","Prompt:Write python function check whether array can be sorted picking 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,71,13,0.001,1.183,2025/11/05 17:16:00,0.0,2.0,0.268249780123131,37.064
"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",Prompt:Write function where a string will start specific number. Assesments:assert match_num '5-2345861' ==True assert match_num '6-2345861' ==False assert match_num '78910' ==False,54,49,5,0.001,1.102,2025/11/05 17:16:00,0.0,1.5,0.197009674582234,33.729
"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",Prompt:Write function find smallest multiple first n numbers. Assesments:assert smallest_multiple 13 ==360360 assert smallest_multiple 2 ==2 assert smallest_multiple 1 ==1,44,37,7,0.001,1.189,2025/11/05 17:16:00,0.0,0.0,0.2735268249780123,33.759
"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})",Prompt:Write function combine two dictionaries adding values 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,168,31,0.002,1.185,2025/11/05 17:16:00,0.0,0.0,0.2700087950747581,61.382
"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",Prompt:Write python function count total unset bits 1 n. Assesments:assert count_Unset_Bits 2 ==1 assert count_Unset_Bits 5 ==4 assert count_Unset_Bits 14 ==17,60,47,13,0.001,1.277,2025/11/05 17:16:00,0.0,0.0,0.3509234828496041,33.905
"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",Prompt:Write function 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,43,4,0.001,1.093,2025/11/05 17:16:00,0.0,1.5,0.189094107299912,33.95
"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",Prompt:Write python function find sum squares binomial co-efficients Assesments:assert sum_of_square 4 ==70 assert sum_of_square 5 == 252 assert sum_of_square 2 ==6,55,42,13,0.001,1.31,2025/11/05 17:16:00,0.0,0.0,0.3799472295514512,33.755
"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')]",Prompt:Write function extract year month date url 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,210,15,0.001,1.071,2025/11/05 17:16:00,0.0,0.0,0.169744942832014,41.694
"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]",Prompt:Write function print 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,78,27,0.001,1.346,2025/11/05 17:16:00,0.0,0.0,0.4116094986807388,46.733
"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","Prompt:Write function find fixed point 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,83,31,0.001,1.373,2025/11/05 17:16:00,0.0,0.0,0.4353562005277044,46.705
"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",Prompt:Write function find previous palindrome specified number. Assesments:assert previous_palindrome 99 ==88 assert previous_palindrome 1221 ==1111 assert previous_palindrome 120 ==111,47,40,7,0.001,1.175,2025/11/05 17:16:00,0.0,0.0,0.2612137203166227,33.823
"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","Prompt:Write function validate 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,52,3,0.001,1.058,2025/11/05 17:16:01,0.0,0.0,0.158311345646438,33.751
"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",Prompt:Write function compute maximum product three numbers given array 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,91,35,0.001,1.385,2025/11/05 17:16:01,0.0,0.0,0.445910290237467,56.365
"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",Prompt:Write function findln 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,47,15,0.001,1.319,2025/11/05 17:16:01,0.0,0.0,0.387862796833773,34.842
"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",Prompt:Write function check number end string. Assesments:assert end_num 'abcdef' ==False assert end_num 'abcdef7' ==True assert end_num 'abc' ==False,48,38,10,0.001,1.263,2025/11/05 17:16:01,0.0,0.0,0.3386103781882145,33.956
"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",Prompt:Write python function check whether given string is made two alternating characters not. Assesments:assert is_Two_Alter abab == True assert is_Two_Alter aaaa == False assert is_Two_Alter xyz == False,61,48,13,0.001,1.271,2025/11/05 17:16:01,0.0,1.0,0.3456464379947228,35.268
"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]","Prompt:Write function rearrange positive negative numbers 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,121,36,0.002,1.298,2025/11/05 17:16:01,0.0,0.0,0.3693931398416887,66.411
"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)",Prompt:Write function find if there is a triplet array whose sum is equal 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,105,38,0.001,1.362,2025/11/05 17:16:01,0.0,2.5,0.4256816182937555,63.217
"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!')",Prompt:Write function find sequences one upper case letter followed lower case letters. Assesments:assert text_uppercase_lowercase AaBbGg == 'Found match! assert text_uppercase_lowercase aA == 'Not matched! assert text_uppercase_lowercase PYTHON == 'Not matched!,72,60,12,0.001,1.2,2025/11/05 17:16:01,0.0,0.0,0.2832014072119612,38.334
"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","Prompt:Write function 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,69,6,0.001,1.087,2025/11/05 17:16:01,0.0,0.0,0.1838170624450307,34.34
"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","Prompt:Write python function multiply items 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,51,12,0.001,1.235,2025/11/05 17:16:01,0.0,0.0,0.3139841688654354,34.185
"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)]'","Prompt:Write function remove tuples none values 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,109,77,0.002,1.706,2025/11/05 17:16:01,0.0,0.0,0.7282321899736147,81.932
"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)]",Prompt:Write function perform chunking tuples sizen. 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,140,61,0.002,1.436,2025/11/05 17:16:01,0.0,0.0,0.4907651715039577,78.472
"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)","Prompt:Write function find pair highest product given array 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,82,32,0.001,1.39,2025/11/05 17:16:01,0.0,0.0,0.4503078276165346,54.56
"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",Prompt:Write function find length shortest string has both str1 str2 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,63,31,0.001,1.492,2025/11/05 17:16:01,0.0,2.0,0.5400175901495162,41.053
"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","Prompt:Write function find maximum 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,44,5,0.001,1.114,2025/11/05 17:16:01,0.0,0.0,0.2075637642919965,33.631
"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","Prompt:Write python function calculate product numbers 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,59,19,0.001,1.322,2025/11/05 17:16:01,0.0,0.0,0.3905013192612138,39.242
"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",Prompt:Write function 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,42,12,0.001,1.286,2025/11/05 17:16:01,0.0,0.0,0.3588390501319261,33.632
"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",Prompt:Write function calculate height given binary tree. Assesments:assert max_height root ==3 assert max_height root1 ==5 assert max_height root2 ==4,50,34,16,0.001,1.471,2025/11/05 17:16:01,0.0,0.0,0.5215479331574319,34.13
"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'",Prompt:Write function convert date yyyy-mm-dd format 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,79,5,0.001,1.063,2025/11/05 17:16:01,0.0,0.0,0.1627088830255056,34.15
"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","Prompt:Write function count repeated items 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,94,30,0.001,1.319,2025/11/05 17:16:01,0.0,0.0,0.387862796833773,43.963
"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!'",Prompt:Write function matches string has an a followed zero b's using regex. Assesments:assert text_match msb == 'Not matched! assert text_match a0c == 'Found match! assert text_match abbc == 'Found match!,67,51,16,0.001,1.314,2025/11/05 17:16:01,0.0,3.0,0.3834652594547054,37.021
"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",Prompt:Write function calculate sum series1³+2³+3³+….+n³. Assesments:assert sum_series 7 ==784 assert sum_series 5 ==225 assert sum_series 15 ==14400,54,47,7,0.001,1.149,2025/11/05 17:16:01,0.0,0.0,0.2383465259454705,34.072
"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']",Prompt:Write function remove duplicate words given list 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,99,38,0.001,1.384,2025/11/05 17:16:01,0.0,0.0,0.4450307827616533,66.348
"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'",Prompt:Write function convert camel case string snake case string 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,61,4,0.001,1.066,2025/11/05 17:16:01,0.0,0.0,0.1653474054529464,34.076
"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",Prompt:Write function find nth delannoy number. Assesments:assert dealnnoy_num 3 4 == 129 assert dealnnoy_num 3 3 ==63 assert dealnnoy_num 4 5 == 681,62,50,12,0.001,1.24,2025/11/05 17:16:01,0.0,0.0,0.318381706244503,33.751
"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",Prompt:Write function calculate sum series1²+2²+3²+….+n². Assesments:assert series_sum 6 ==91 assert series_sum 7 ==140 assert series_sum 12 ==650,53,46,7,0.001,1.152,2025/11/05 17:16:01,0.0,0.0,0.240985048372911,34.069
"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)]",Prompt:Write function re-arrange given tuples based 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,159,68,0.002,1.428,2025/11/05 17:16:01,0.0,0.0,0.4837291116974493,87.351
"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')",Prompt:Write function count common character given string. Assesments:assert max_char hello world == 'l' assert max_char hello == 'l' assert max_char pythonpr == 'p',50,40,10,0.001,1.25,2025/11/05 17:16:01,0.0,0.0,0.3271767810026385,34.519
"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)","Prompt:Write function find three closest elements 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,128,35,0.002,1.273,2025/11/05 17:16:01,0.0,0.0,0.3474054529463499,68.909
"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'}])",Prompt:Write function sort list 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,296,-1,0.002,0.997,2025/11/05 17:16:01,-0.0,0.0,0.1046613896218117,93.186
"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]",Prompt:Write function sort given array 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,95,38,0.001,1.4,2025/11/05 17:16:01,0.0,0.0,0.4591029023746701,62.377
"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","Prompt:Write function count elements list 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,70,13,0.001,1.186,2025/11/05 17:16:01,0.0,2.0,0.2708883025505716,40.93
"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",Prompt:Write function check if any list element is present 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,87,36,0.001,1.414,2025/11/05 17:16:01,0.0,1.5,0.4714160070360597,55.334
"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]","Prompt:Write function 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,142,38,0.002,1.268,2025/11/05 17:16:01,0.0,0.0,0.3430079155672823,64.448
"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",Prompt:Write function separate print numbers position given string. Assesments:assert num_position are 70 flats apartment ==10 assert num_position every adult have 32 teeth ==17 assert num_position isha has 79 chocolates bag ==9,65,48,17,0.001,1.354,2025/11/05 17:16:01,0.0,1.0,0.4186455584872472,39.062
"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'}",Prompt:Write function convert given tuples 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,82,7,0.001,1.085,2025/11/05 17:16:01,0.0,0.0,0.1820580474934036,43.516
"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)]","Prompt:Write function find common elements counts 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,129,24,0.001,1.186,2025/11/05 17:16:01,0.0,0.0,0.2708883025505716,56.255
"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","Prompt:Write python function find length shortest word. Assesments:assert len_log win lose great ==3 assert len_log ab abc ==1 assert len_log 12,12,1234 ==2",61,41,20,0.001,1.488,2025/11/05 17:16:01,0.0,0.0,0.5364995602462621,34.873
"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')","Prompt:Write function get item tuple. Assesments:assert get_item w 3 r e u r c e,3 == 'e' assert get_item w 3 r e u r c e -4 == 'u' assert get_item w 3 r e u r c e -3 == 'r'",133,66,67,0.001,2.015,2025/11/05 17:16:01,0.0,0.0,1.0,61.876
"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)]'",Prompt:Write function sort given tuple list basis total digits 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,149,70,0.002,1.47,2025/11/05 17:16:01,0.0,0.0,0.5206684256816182,83.144
"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')",Prompt:Write function display sign chinese zodiac given year. Assesments:assert chinese_zodiac 1997 == 'Ox' assert chinese_zodiac 1998 == 'Tiger' assert chinese_zodiac 1994 == 'Dog',53,48,5,0.001,1.104,2025/11/05 17:16:01,0.0,0.0,0.1987686895338611,34.759
"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)]",Prompt:Write function find maximum similar indices two lists 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,142,60,0.002,1.423,2025/11/05 17:16:01,0.0,0.0,0.4793315743183817,84.349
"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",Prompt:Write function compute value ncr modp. 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,54,18,0.001,1.333,2025/11/05 17:16:01,0.0,0.0,0.4001759014951626,36.874
"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","Prompt:Write python function find minimun number subsets 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,63,24,0.001,1.381,2025/11/05 17:16:01,0.0,0.0,0.4423922603342128,42.948
"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","Prompt:Write function 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,52,4,0.001,1.077,2025/11/05 17:16:01,0.0,1.5,0.1750219876868952,34.096
"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",Prompt:Write function find if the given number is abundant. Assesments:assert is_abundant 12 ==True assert is_abundant 13 ==False assert is_abundant 9 ==False,46,40,6,0.001,1.15,2025/11/05 17:16:01,0.0,1.5,0.2392260334212839,33.765
"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']",Prompt:Write function split given string uppercase letters 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,100,12,0.001,1.12,2025/11/05 17:16:01,0.0,0.0,0.2128408091468778,46.311
"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",Prompt:Write python function get position 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,49,12,0.001,1.245,2025/11/05 17:16:01,0.0,0.0,0.3227792436235708,33.689
"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"")",Prompt:Write function convert integer roman numeral. Assesments:assert int_to_roman 1 == assert int_to_roman 50 == L assert int_to_roman 4 == IV,51,39,12,0.001,1.308,2025/11/05 17:16:01,0.0,0.0,0.3781882145998241,34.226
"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","Prompt:Write python function find average 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,69,25,0.001,1.362,2025/11/05 17:16:01,0.0,0.0,0.4256816182937555,43.196
"Prompt: Write a function to solve tiling problem. Assesments: assert get_noOfways(4)==3, assert get_noOfways(3)==2, assert get_noOfways(5)==5",Prompt:Write function solve tiling problem. Assesments:assert get_noOfways 4 ==3 assert get_noOfways 3 ==2 assert get_noOfways 5 ==5,44,40,4,0.001,1.1,2025/11/05 17:16:01,0.0,0.0,0.1952506596306069,32.44
"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",Prompt:Write function convert roman numeral integer. Assesments:assert roman_to_int 'MMMCMLXXXVI' ==3986 assert roman_to_int 'MMMM' ==4000 assert roman_to_int 'C' ==100,53,46,7,0.001,1.152,2025/11/05 17:16:01,0.0,0.0,0.240985048372911,33.636
"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","Prompt:Write python function find sum even natural numbers within rangel r. Assesments:assert sum_Even 2,5 ==6 assert sum_Even 3,8 ==18 assert sum_Even 4,6 ==10",64,49,15,0.001,1.306,2025/11/05 17:16:01,0.0,0.0,0.376429199648197,34.807
"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)","Prompt:Write function calculate discriminant value. Assesments:assert discriminant_value 4,8,2 == Two solutions,32 assert discriminant_value 5,7,9 == real solution -131 assert discriminant_value 0,0,9 == one solution,0",68,58,10,0.001,1.172,2025/11/05 17:16:01,0.0,0.0,0.258575197889182,34.83
"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",Prompt:Write python function check whether length word is even not. Assesments:assert word_len program == False assert word_len solution == True assert word_len data == True,49,35,14,0.001,1.4,2025/11/05 17:16:01,0.0,1.0,0.4591029023746701,34.895
"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')",Prompt:Write function convert camel case string 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,59,3,0.001,1.051,2025/11/05 17:16:01,0.0,0.0,0.1521547933157431,34.557
"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"") ]  ",Prompt:Write function remove empty tuple list 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,122,68,54,0.001,1.794,2025/11/05 17:16:01,0.0,0.0,0.8056288478452067,60.832
"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""",Prompt:Write python function accept strings which contains vowels. Assesments:assert check SEEquoiaL == 'accepted' assert check 'program' == accepted assert check 'fine' == accepted,52,40,12,0.001,1.3,2025/11/05 17:16:01,0.0,1.0,0.3711521547933157,34.801
"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","Prompt:Write python function find maximum possible value 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,50,12,0.001,1.24,2025/11/05 17:16:01,0.0,0.0,0.318381706244503,33.627
"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)]",Prompt:Write function join 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,140,60,0.002,1.429,2025/11/05 17:16:01,0.0,3.0,0.484608619173263,68.155
"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","Prompt:Write function find minimum 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,44,5,0.001,1.114,2025/11/05 17:16:01,0.0,0.0,0.2075637642919965,33.631
"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",Prompt:Write function find maximum number segments lengths b c can be formed 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,59,27,0.001,1.458,2025/11/05 17:16:01,0.0,2.0,0.5101143359718557,42.732
"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)",Prompt:Write function concatenate given two tuples 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,75,29,0.001,1.387,2025/11/05 17:16:01,0.0,0.0,0.4476693051890941,51.999
"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"" ","Prompt:Write python function left rotate string. Assesments:assert left_rotate python,2 == thonpy assert left_rotate bigdata,3 == databig assert left_rotate hadoop,1 == adooph",62,43,19,0.001,1.442,2025/11/05 17:16:01,0.0,0.0,0.496042216358839,42.123
"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",Prompt:Write function find minimum total path sum 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,70,34,0.001,1.486,2025/11/05 17:16:01,0.0,0.0,0.534740545294635,49.893