id
stringlengths 25
27
| content
stringlengths 66
1.28k
|
|---|---|
g-transeval-python_data_301
|
def get_closest_vowel ( word ) : NEW_LINE INDENT vowels = "AEIOUaeiou" NEW_LINE for i in range ( len ( word ) - 2 , 0 , - 1 ) : NEW_LINE INDENT if word [ i ] in vowels and word [ i + 1 ] not in vowels and word [ i - 1 ] not in vowels : NEW_LINE INDENT return word [ i ] NEW_LINE DEDENT DEDENT return "" NEW_LINE DEDENT
|
g-transeval-python_data_302
|
def match_parens ( lst ) : NEW_LINE INDENT strings = [ lst [ 0 ] + lst [ 1 ] , lst [ 1 ] + lst [ 0 ] ] NEW_LINE for l in strings : NEW_LINE INDENT count = 0 NEW_LINE for c in l : NEW_LINE INDENT if c == "(" : NEW_LINE INDENT count += 1 NEW_LINE DEDENT if c == ")" : NEW_LINE INDENT count -= 1 NEW_LINE DEDENT if count < 0 : NEW_LINE INDENT break NEW_LINE DEDENT DEDENT if count == 0 : NEW_LINE INDENT return "Yes" NEW_LINE DEDENT DEDENT return "No" NEW_LINE DEDENT
|
g-transeval-python_data_303
|
def maximum ( arr , k ) : NEW_LINE INDENT if k == 0 : NEW_LINE INDENT return [ ] NEW_LINE DEDENT arr . sort ( ) NEW_LINE return arr [ - k : ] NEW_LINE DEDENT
|
g-transeval-python_data_304
|
def valid_date ( date ) : NEW_LINE INDENT if len ( date ) != 10 : NEW_LINE INDENT return False NEW_LINE DEDENT for i in range ( 10 ) : NEW_LINE INDENT if i == 2 or i == 5 : NEW_LINE INDENT if date [ i ] != "-" : NEW_LINE INDENT return False NEW_LINE DEDENT DEDENT elif not date [ i ] . isdigit ( ) : NEW_LINE INDENT return False NEW_LINE DEDENT DEDENT month = int ( date [ 0 : 2 ] ) NEW_LINE day = int ( date [ 3 : 5 ] ) NEW_LINE year = int ( date [ 6 : 10 ] ) NEW_LINE if month < 1 or month > 12 : NEW_LINE INDENT return False NEW_LINE DEDENT if day < 1 or day > 31 : NEW_LINE INDENT return False NEW_LINE DEDENT if day == 31 and ( month == 4 or month == 6 or month == 9 or month == 11 or month == 2 ) : NEW_LINE INDENT return False NEW_LINE DEDENT if day == 30 and month == 2 : NEW_LINE INDENT return False NEW_LINE DEDENT return True NEW_LINE DEDENT
|
g-transeval-python_data_305
|
def split_words ( txt ) : NEW_LINE INDENT current = [ ] NEW_LINE result = [ ] NEW_LINE if " " in txt : NEW_LINE INDENT for i in range ( len ( txt ) + 1 ) : NEW_LINE INDENT if i == len ( txt ) or txt [ i ] == " " : NEW_LINE INDENT if len ( current ) > 0 : NEW_LINE INDENT result . append ( "" . join ( current ) ) NEW_LINE current . clear ( ) NEW_LINE DEDENT DEDENT else : NEW_LINE INDENT current . append ( txt [ i ] ) NEW_LINE DEDENT DEDENT return result NEW_LINE DEDENT if "," in txt : NEW_LINE INDENT for i in range ( len ( txt ) + 1 ) : NEW_LINE INDENT if i == len ( txt ) or txt [ i ] == "," : NEW_LINE INDENT if len ( current ) > 0 : NEW_LINE INDENT result . append ( "" . join ( current ) ) NEW_LINE current . clear ( ) NEW_LINE DEDENT DEDENT else : NEW_LINE INDENT current . append ( txt [ i ] ) NEW_LINE DEDENT DEDENT return result NEW_LINE DEDENT num = 0 NEW_LINE for c in txt : NEW_LINE INDENT if c . islower ( ) and ord ( c ) % 2 == 0 : NEW_LINE INDENT num += 1 NEW_LINE DEDENT DEDENT return [ str ( num ) ] NEW_LINE DEDENT
|
g-transeval-python_data_306
|
def tri ( n ) : NEW_LINE INDENT if n == 0 : NEW_LINE INDENT return [ 1 ] NEW_LINE DEDENT tris = [ 1 , 3 ] NEW_LINE for i in range ( 2 , n + 1 ) : NEW_LINE INDENT if i % 2 == 0 : NEW_LINE INDENT tris . append ( i // 2 + 1 ) NEW_LINE DEDENT else : NEW_LINE INDENT tris . append ( tris [ i - 1 ] + tris [ i - 2 ] + ( i + 3 ) // 2 ) NEW_LINE DEDENT DEDENT return tris NEW_LINE DEDENT
|
g-transeval-python_data_307
|
def check_if_last_char_is_a_letter ( txt ) : NEW_LINE INDENT if not txt : NEW_LINE INDENT return False NEW_LINE DEDENT return txt [ - 1 ] . isalpha ( ) and ( len ( txt ) == 1 or not txt [ - 2 ] . isalpha ( ) ) NEW_LINE DEDENT
|
g-transeval-python_data_308
|
def order_by_points ( nums ) : NEW_LINE INDENT result = [ ] NEW_LINE for num in nums : NEW_LINE INDENT w = str ( abs ( num ) ) NEW_LINE sum = 0 NEW_LINE for c in w : NEW_LINE INDENT sum += ord ( c ) - ord ( '0' ) NEW_LINE DEDENT if num < 0 : NEW_LINE INDENT sum -= 2 * ( ord ( w [ 0 ] ) - ord ( '0' ) ) NEW_LINE DEDENT result . append ( sum ) NEW_LINE DEDENT for i in range ( len ( nums ) ) : NEW_LINE INDENT for j in range ( 1 , len ( nums ) ) : NEW_LINE INDENT if result [ j - 1 ] > result [ j ] : NEW_LINE INDENT result [ j ] , result [ j - 1 ] = result [ j - 1 ] , result [ j ] NEW_LINE nums [ j ] , nums [ j - 1 ] = nums [ j - 1 ] , nums [ j ] NEW_LINE DEDENT DEDENT DEDENT return nums NEW_LINE DEDENT
|
g-transeval-python_data_309
|
def bf ( planet1 , planet2 ) : NEW_LINE INDENT planets = [ "Mercury" , "Venus" , "Earth" , "Mars" , "Jupiter" , "Saturn" , "Uranus" , "Neptune" ] NEW_LINE idx1 = planets . index ( planet1 ) if planet1 in planets else - 1 NEW_LINE idx2 = planets . index ( planet2 ) if planet2 in planets else - 1 NEW_LINE if idx1 == - 1 or idx2 == - 1 or idx1 == idx2 : NEW_LINE INDENT return [ ] NEW_LINE DEDENT return planets [ idx2 + 1 : idx1 ] if idx1 > idx2 else planets [ idx1 + 1 : idx2 ] NEW_LINE DEDENT
|
g-transeval-python_data_310
|
def sorted_list_sum ( lst ) : NEW_LINE INDENT result = [ ] NEW_LINE for i in lst : NEW_LINE INDENT if len ( i ) % 2 == 0 : NEW_LINE INDENT result . append ( i ) NEW_LINE DEDENT DEDENT result . sort ( key = lambda s : ( len ( s ) , s ) ) NEW_LINE return result NEW_LINE DEDENT
|
g-transeval-python_data_311
|
def cycpattern_check ( a , b ) : NEW_LINE INDENT for i in range ( len ( b ) ) : NEW_LINE INDENT rotate = b [ i : ] + b [ 0 : i ] NEW_LINE if rotate in a : NEW_LINE INDENT return True NEW_LINE DEDENT DEDENT return False NEW_LINE DEDENT
|
g-transeval-python_data_312
|
def even_odd_count ( num ) : NEW_LINE INDENT even_count , odd_count = 0 , 0 NEW_LINE for i in str ( abs ( num ) ) : NEW_LINE INDENT if int ( i ) % 2 == 0 : NEW_LINE INDENT even_count += 1 NEW_LINE DEDENT else : NEW_LINE INDENT odd_count += 1 NEW_LINE DEDENT DEDENT return [ even_count , odd_count ] NEW_LINE DEDENT
|
g-transeval-python_data_313
|
def find_max ( words ) : NEW_LINE INDENT max = "" NEW_LINE max_length = 0 NEW_LINE for word in words : NEW_LINE INDENT unique = [ ] NEW_LINE for w in word : NEW_LINE INDENT if w not in unique : NEW_LINE INDENT unique . append ( w ) NEW_LINE DEDENT if len ( unique ) > max_length or ( len ( unique ) == max_length and word < max ) : NEW_LINE INDENT max = word NEW_LINE max_length = len ( unique ) NEW_LINE DEDENT DEDENT DEDENT return max NEW_LINE DEDENT
|
g-transeval-python_data_314
|
def solve ( s ) : NEW_LINE INDENT no_letter = True NEW_LINE result = [ ] NEW_LINE for ch in s : NEW_LINE INDENT if ch . isupper ( ) : NEW_LINE INDENT ch = ch . lower ( ) NEW_LINE no_letter = False NEW_LINE DEDENT elif ch . islower ( ) : NEW_LINE INDENT ch = ch . upper ( ) NEW_LINE no_letter = False NEW_LINE DEDENT result . append ( ch ) NEW_LINE DEDENT if no_letter : NEW_LINE INDENT return "" . join ( result ) [ : : - 1 ] NEW_LINE DEDENT else : NEW_LINE INDENT return "" . join ( result ) NEW_LINE DEDENT DEDENT
|
g-transeval-python_data_315
|
def most_frequent ( arr , n ) : NEW_LINE INDENT hp = { } NEW_LINE for i in range ( n ) : NEW_LINE INDENT if arr [ i ] in hp : NEW_LINE INDENT hp [ arr [ i ] ] += 1 NEW_LINE DEDENT else : NEW_LINE INDENT hp [ arr [ i ] ] = 1 NEW_LINE DEDENT DEDENT max_count , res = 0 , - 1 NEW_LINE for key , value in hp . items ( ) : NEW_LINE INDENT if max_count < value : NEW_LINE INDENT res = key NEW_LINE max_count = value NEW_LINE DEDENT DEDENT return res NEW_LINE DEDENT
|
g-transeval-python_data_316
|
def find ( a , b , k , n1 , n2 ) : NEW_LINE INDENT s = set ( ) NEW_LINE for i in range ( n2 ) : NEW_LINE INDENT s . add ( b [ i ] ) NEW_LINE DEDENT missing = 0 NEW_LINE for i in range ( n1 ) : NEW_LINE INDENT if a [ i ] not in s : NEW_LINE INDENT missing += 1 NEW_LINE DEDENT if missing == k : NEW_LINE INDENT return a [ i ] NEW_LINE DEDENT DEDENT return - 1 NEW_LINE DEDENT
|
g-transeval-python_data_317
|
def solve_query ( start , end , arr ) : NEW_LINE INDENT frequency = dict ( ) NEW_LINE for i in range ( start , end + 1 ) : NEW_LINE INDENT frequency [ arr [ i ] ] = frequency . get ( arr [ i ] , 0 ) + 1 NEW_LINE DEDENT count = 0 NEW_LINE for key , value in frequency . items ( ) : NEW_LINE INDENT if key == value : NEW_LINE INDENT count += 1 NEW_LINE DEDENT DEDENT return count NEW_LINE DEDENT
|
g-transeval-python_data_318
|
def segregate ( arr , size ) : NEW_LINE INDENT j = 0 NEW_LINE for i in range ( size ) : NEW_LINE INDENT if arr [ i ] <= 0 : NEW_LINE INDENT arr [ i ] , arr [ j ] = arr [ j ] , arr [ i ] NEW_LINE j += 1 NEW_LINE DEDENT DEDENT return j NEW_LINE DEDENT
|
g-transeval-python_data_319
|
def count_triplets ( a , n ) : NEW_LINE INDENT s = set ( ) NEW_LINE for i in range ( n ) : NEW_LINE INDENT s . add ( a [ i ] ) NEW_LINE DEDENT count = 0 NEW_LINE for i in range ( n ) : NEW_LINE INDENT for j in range ( i + 1 , n , 1 ) : NEW_LINE INDENT xr = a [ i ] ^ a [ j ] NEW_LINE if xr in s and xr != a [ i ] and xr != a [ j ] : NEW_LINE INDENT count += 1 NEW_LINE DEDENT DEDENT DEDENT return int ( count / 3 ) NEW_LINE DEDENT
|
g-transeval-python_data_320
|
def least_frequent ( arr , n ) : NEW_LINE INDENT hp = { } NEW_LINE for i in range ( n ) : NEW_LINE INDENT if arr [ i ] in hp : NEW_LINE INDENT hp [ arr [ i ] ] += 1 NEW_LINE DEDENT else : NEW_LINE INDENT hp [ arr [ i ] ] = 1 NEW_LINE DEDENT DEDENT min_count = n + 1 NEW_LINE res = - 1 NEW_LINE for key , value in hp . items ( ) : NEW_LINE INDENT if min_count >= value : NEW_LINE INDENT res = key NEW_LINE min_count = value NEW_LINE DEDENT DEDENT return res NEW_LINE DEDENT
|
g-transeval-python_data_321
|
def find_permutations ( arr ) : NEW_LINE INDENT cnt = 0 NEW_LINE max_ind , min_ind = - 1 , 10000000 NEW_LINE n = len ( arr ) NEW_LINE index_of = { } NEW_LINE for i in range ( n ) : NEW_LINE INDENT index_of [ arr [ i ] ] = i + 1 NEW_LINE DEDENT for i in range ( 1 , n + 1 ) : NEW_LINE INDENT max_ind = max ( max_ind , index_of . get ( i , 0 ) ) NEW_LINE min_ind = min ( min_ind , index_of . get ( i , 0 ) ) NEW_LINE if max_ind - min_ind + 1 == i : NEW_LINE INDENT cnt += 1 NEW_LINE DEDENT DEDENT return cnt NEW_LINE DEDENT
|
g-transeval-python_data_322
|
def form_quadruplets ( arr , n ) : NEW_LINE INDENT ans , pairs = 0 , 0 NEW_LINE pairs = n // 4 NEW_LINE arr . sort ( reverse = True ) NEW_LINE for i in range ( 0 , n - pairs , 3 ) : NEW_LINE INDENT ans += arr [ i + 2 ] NEW_LINE DEDENT return ans NEW_LINE DEDENT
|
g-transeval-python_data_323
|
def lexicographically_maximum ( s , n ) : NEW_LINE INDENT m = { } NEW_LINE for i in range ( n ) : NEW_LINE INDENT if s [ i ] in m : NEW_LINE INDENT m [ s [ i ] ] += 1 NEW_LINE DEDENT else : NEW_LINE INDENT m [ s [ i ] ] = 1 NEW_LINE DEDENT DEDENT v = [ ] NEW_LINE for i in range ( ord ( "a" ) , ord ( "a" ) + min ( n , 25 ) ) : NEW_LINE INDENT if chr ( i ) not in m : NEW_LINE INDENT v . append ( chr ( i ) ) NEW_LINE DEDENT DEDENT j = len ( v ) - 1 NEW_LINE for i in range ( n ) : NEW_LINE INDENT if ord ( s [ i ] ) >= ord ( "a" ) + min ( n , 25 ) or ( s [ i ] in m and m [ s [ i ] ] > 1 ) : NEW_LINE INDENT if ord ( v [ j ] ) < ord ( s [ i ] ) : NEW_LINE INDENT continue NEW_LINE DEDENT m [ s [ i ] ] -= 1 NEW_LINE s = s [ 0 : i ] + v [ j ] + s [ i + 1 : ] NEW_LINE j -= 1 NEW_LINE DEDENT if j < 0 : NEW_LINE INDENT break NEW_LINE DEDENT DEDENT l = 0 NEW_LINE for i in range ( n - 1 , - 1 , - 1 ) : NEW_LINE INDENT if l > j : NEW_LINE INDENT break NEW_LINE DEDENT if ord ( s [ i ] ) >= ord ( "a" ) + min ( n , 25 ) or s [ i ] in m and m [ s [ i ] ] > 1 : NEW_LINE INDENT m [ s [ i ] ] -= 1 NEW_LINE s = s [ 0 : i ] + v [ l ] + s [ i + 1 : ] NEW_LINE l += 1 NEW_LINE DEDENT DEDENT return s NEW_LINE DEDENT
|
g-transeval-python_data_324
|
def no_of_valid_kbers ( k , arr ) : NEW_LINE INDENT st = set ( ) NEW_LINE while k != 0 : NEW_LINE INDENT st . add ( k % 10 ) NEW_LINE k = k // 10 NEW_LINE DEDENT count = 0 NEW_LINE for i in range ( len ( arr ) ) : NEW_LINE INDENT no = arr [ i ] NEW_LINE flag = True NEW_LINE while no != 0 : NEW_LINE INDENT digit = no % 10 NEW_LINE if digit not in st : NEW_LINE INDENT flag = False NEW_LINE break NEW_LINE DEDENT no = no // 10 NEW_LINE DEDENT if flag == True : NEW_LINE INDENT count += 1 NEW_LINE DEDENT DEDENT return count NEW_LINE DEDENT
|
g-transeval-python_data_325
|
def del_cost ( s , cost ) : NEW_LINE INDENT ans = 0 NEW_LINE for_max = { } NEW_LINE for_tot = { } NEW_LINE for i in range ( len ( s ) ) : NEW_LINE INDENT if s [ i ] not in for_max : NEW_LINE INDENT for_max [ s [ i ] ] = cost [ i ] NEW_LINE DEDENT else : NEW_LINE INDENT for_max [ s [ i ] ] = max ( cost [ i ] , for_max [ s [ i ] ] ) NEW_LINE DEDENT if s [ i ] not in for_tot : NEW_LINE INDENT for_tot [ s [ i ] ] = cost [ i ] NEW_LINE DEDENT else : NEW_LINE INDENT for_tot [ s [ i ] ] += cost [ i ] NEW_LINE DEDENT DEDENT for key , value in for_max . items ( ) : NEW_LINE INDENT ans += for_tot [ key ] - value NEW_LINE DEDENT return ans NEW_LINE DEDENT
|
g-transeval-python_data_326
|
def replace_duplicates ( names ) : NEW_LINE INDENT hash = { } NEW_LINE for i in range ( len ( names ) ) : NEW_LINE INDENT if names [ i ] not in hash : NEW_LINE INDENT hash [ names [ i ] ] = 1 NEW_LINE DEDENT else : NEW_LINE INDENT count = hash [ names [ i ] ] NEW_LINE hash [ names [ i ] ] += 1 NEW_LINE names [ i ] += str ( count ) NEW_LINE DEDENT DEDENT return names NEW_LINE DEDENT
|
g-transeval-python_data_327
|
def minmax_numbers ( matrix , res ) : NEW_LINE INDENT s = set ( ) NEW_LINE for i in range ( len ( matrix ) ) : NEW_LINE INDENT min_r = sys . maxsize NEW_LINE for j in range ( len ( matrix [ i ] ) ) : NEW_LINE INDENT min_r = min ( min_r , matrix [ i ] [ j ] ) NEW_LINE DEDENT s . add ( min_r ) NEW_LINE DEDENT for j in range ( len ( matrix [ 0 ] ) ) : NEW_LINE INDENT max_c = - sys . maxsize NEW_LINE for i in range ( len ( matrix ) ) : NEW_LINE INDENT max_c = max ( max_c , matrix [ i ] [ j ] ) NEW_LINE DEDENT if max_c in s : NEW_LINE INDENT res . append ( max_c ) NEW_LINE DEDENT DEDENT return res NEW_LINE DEDENT
|
g-transeval-python_data_328
|
def length_of_longest_ap ( a , n ) : NEW_LINE INDENT dp = { } NEW_LINE res = 2 NEW_LINE for i in range ( n ) : NEW_LINE INDENT for j in range ( i + 1 , n ) : NEW_LINE INDENT d = a [ j ] - a [ i ] NEW_LINE if d in dp : NEW_LINE INDENT if i in dp [ d ] : NEW_LINE INDENT dp [ d ] [ j ] = dp [ d ] [ i ] + 1 NEW_LINE DEDENT else : NEW_LINE INDENT dp [ d ] [ j ] = 2 NEW_LINE DEDENT DEDENT else : NEW_LINE INDENT dp [ d ] = { } NEW_LINE dp [ d ] [ j ] = 2 NEW_LINE DEDENT res = max ( res , dp [ d ] [ j ] ) NEW_LINE DEDENT DEDENT return res NEW_LINE DEDENT
|
g-transeval-python_data_329
|
def find_kth_char ( n , k ) : NEW_LINE INDENT prev = "A" NEW_LINE cur = "" NEW_LINE if n == 1 : NEW_LINE INDENT return "A" NEW_LINE DEDENT for i in range ( 2 , n + 1 ) : NEW_LINE INDENT cur = prev + "B" NEW_LINE for i in range ( len ( prev ) ) : NEW_LINE INDENT if prev [ i ] == "A" : NEW_LINE INDENT prev = prev [ 0 : i ] + "B" + prev [ i + 1 : ] NEW_LINE DEDENT else : NEW_LINE INDENT prev = prev [ 0 : i ] + "A" + prev [ i + 1 : ] NEW_LINE DEDENT DEDENT prev = prev [ : : - 1 ] NEW_LINE cur += prev NEW_LINE prev = cur NEW_LINE DEDENT return cur [ k - 1 ] NEW_LINE DEDENT
|
g-transeval-python_data_330
|
def find_kth_largest ( s , k ) : NEW_LINE INDENT tmp = list ( s ) NEW_LINE tmp . sort ( reverse = True ) NEW_LINE return tmp [ k - 1 ] NEW_LINE DEDENT
|
g-transeval-python_data_331
|
def sub_arraylen ( arr , n , k ) : NEW_LINE INDENT mp = { } NEW_LINE mp [ arr [ 0 ] ] = 0 NEW_LINE for i in range ( 1 , n ) : NEW_LINE INDENT arr [ i ] = arr [ i ] + arr [ i - 1 ] NEW_LINE mp [ arr [ i ] ] = i NEW_LINE DEDENT len = sys . maxsize NEW_LINE for i in range ( n ) : NEW_LINE INDENT if arr [ i ] < k : NEW_LINE INDENT continue NEW_LINE DEDENT else : NEW_LINE INDENT x = arr [ i ] - k NEW_LINE if x == 0 : NEW_LINE INDENT len = min ( len , i ) NEW_LINE DEDENT if x not in mp : NEW_LINE INDENT continue NEW_LINE DEDENT else : NEW_LINE INDENT len = min ( len , i - mp . get ( x , 0 ) ) NEW_LINE DEDENT DEDENT DEDENT return len NEW_LINE DEDENT
|
g-transeval-python_data_332
|
def find_max_len ( a , k ) : NEW_LINE INDENT n = len ( a ) NEW_LINE a . sort ( ) NEW_LINE vis = [ False ] * n NEW_LINE mp = { } NEW_LINE for i in range ( n ) : NEW_LINE INDENT mp [ a [ i ] ] = i NEW_LINE DEDENT c = 0 NEW_LINE for i in range ( n ) : NEW_LINE INDENT if not vis [ i ] : NEW_LINE INDENT check = a [ i ] * k NEW_LINE if check in mp : NEW_LINE INDENT c += 1 NEW_LINE vis [ mp [ check ] ] = True NEW_LINE DEDENT DEDENT DEDENT return n - c NEW_LINE DEDENT
|
g-transeval-python_data_333
|
def min_distance_points ( a , k , n ) : NEW_LINE INDENT m = { } NEW_LINE q = [ ] NEW_LINE for i in range ( n ) : NEW_LINE INDENT m [ a [ i ] ] = 1 NEW_LINE q . append ( a [ i ] ) NEW_LINE DEDENT ans = [ ] NEW_LINE while k > 0 : NEW_LINE INDENT x = q [ 0 ] NEW_LINE q = q [ 1 : : ] NEW_LINE if ( x - 1 ) not in m and k > 0 : NEW_LINE INDENT m [ x - 1 ] = 1 NEW_LINE q . append ( x - 1 ) NEW_LINE ans . append ( x - 1 ) NEW_LINE k -= 1 NEW_LINE DEDENT if ( x + 1 ) not in m and k > 0 : NEW_LINE INDENT m [ x + 1 ] = 1 NEW_LINE q . append ( x + 1 ) NEW_LINE ans . append ( x + 1 ) NEW_LINE k -= 1 NEW_LINE DEDENT DEDENT return ans NEW_LINE DEDENT
|
g-transeval-python_data_334
|
def isValidLen ( s , length , k ) : NEW_LINE INDENT n = len ( s ) NEW_LINE mp = dict ( ) NEW_LINE right = 0 NEW_LINE while right < length : NEW_LINE INDENT if s [ right ] in mp : NEW_LINE INDENT mp [ s [ right ] ] += 1 NEW_LINE DEDENT else : NEW_LINE INDENT mp [ s [ right ] ] = 1 NEW_LINE DEDENT right += 1 NEW_LINE DEDENT if len ( mp ) <= k : NEW_LINE INDENT return True NEW_LINE DEDENT while right < n : NEW_LINE INDENT if s [ right ] in mp : NEW_LINE INDENT mp [ s [ right ] ] += 1 NEW_LINE DEDENT else : NEW_LINE INDENT mp [ s [ right ] ] = 1 NEW_LINE DEDENT mp [ s [ right - length ] ] -= 1 NEW_LINE if mp [ s [ right - length ] ] == 0 : NEW_LINE INDENT del mp [ s [ right - length ] ] NEW_LINE DEDENT if len ( mp ) <= k : NEW_LINE INDENT return True NEW_LINE DEDENT right += 1 NEW_LINE DEDENT return len ( mp ) <= k NEW_LINE DEDENT
|
g-transeval-python_data_335
|
def partition ( arr , low , high ) : NEW_LINE INDENT pivot = arr [ high ] NEW_LINE i = ( low - 1 ) NEW_LINE for j in range ( low , high ) : NEW_LINE INDENT if arr [ j ] <= pivot : NEW_LINE INDENT i += 1 NEW_LINE arr [ i ] , arr [ j ] = arr [ j ] , arr [ i ] NEW_LINE DEDENT DEDENT arr [ i + 1 ] , arr [ high ] = arr [ high ] , arr [ i + 1 ] NEW_LINE return i + 1 NEW_LINE DEDENT
|
g-transeval-python_data_336
|
def str_score ( strs , s , n ) : NEW_LINE INDENT m = { } NEW_LINE for i in range ( n ) : NEW_LINE INDENT m [ strs [ i ] ] = i + 1 NEW_LINE DEDENT if s not in m . keys ( ) : NEW_LINE INDENT return 0 NEW_LINE DEDENT score = 0 NEW_LINE for i in range ( len ( s ) ) : NEW_LINE INDENT score += ord ( s [ i ] ) - ord ( "a" ) + 1 NEW_LINE DEDENT score = score * m [ s ] NEW_LINE return score NEW_LINE DEDENT
|
g-transeval-python_data_337
|
def count_ele ( s , a , n ) : NEW_LINE INDENT mp = { } NEW_LINE ans = [ ] NEW_LINE for i in range ( n ) : NEW_LINE INDENT num = a [ i ] NEW_LINE if num in mp : NEW_LINE INDENT ans . append ( 0 ) NEW_LINE DEDENT else : NEW_LINE INDENT cnt = 0 NEW_LINE while s [ 0 ] != num : NEW_LINE INDENT mp [ s [ 0 ] ] = True NEW_LINE s . pop ( 0 ) NEW_LINE cnt += 1 NEW_LINE DEDENT s . pop ( 0 ) NEW_LINE cnt += 1 NEW_LINE ans . append ( cnt ) NEW_LINE DEDENT DEDENT return ans NEW_LINE DEDENT
|
g-transeval-python_data_338
|
def maxDistinctChar ( s , n , k ) : NEW_LINE INDENT freq = { } NEW_LINE for i in range ( n ) : NEW_LINE INDENT if s [ i ] in freq : NEW_LINE INDENT freq [ s [ i ] ] += 1 NEW_LINE DEDENT else : NEW_LINE INDENT freq [ s [ i ] ] = 1 NEW_LINE DEDENT DEDENT v = [ ] NEW_LINE for key , value in freq . items ( ) : NEW_LINE INDENT v . append ( value ) NEW_LINE DEDENT v . sort ( ) NEW_LINE for i in range ( len ( v ) ) : NEW_LINE INDENT mn = min ( v [ i ] - 1 , k ) NEW_LINE v [ i ] = v [ i ] - mn NEW_LINE k -= mn NEW_LINE DEDENT if k > 0 : NEW_LINE INDENT for i in range ( len ( v ) ) : NEW_LINE INDENT mn = min ( v [ i ] , k ) NEW_LINE v [ i ] = v [ i ] - mn NEW_LINE k -= mn NEW_LINE DEDENT DEDENT res = 0 NEW_LINE for i in range ( len ( v ) ) : NEW_LINE INDENT if v [ i ] == 1 : NEW_LINE INDENT res += 1 NEW_LINE DEDENT DEDENT return res NEW_LINE DEDENT
|
g-transeval-python_data_339
|
def find_kth ( arr , n , k ) : NEW_LINE INDENT missing = { } NEW_LINE count = 0 NEW_LINE for i in range ( n ) : NEW_LINE INDENT missing [ arr [ i ] ] = 1 NEW_LINE DEDENT max_m = max ( arr ) NEW_LINE min_m = min ( arr ) NEW_LINE for i in range ( min_m + 1 , max_m ) : NEW_LINE INDENT if i not in missing : NEW_LINE INDENT count += 1 NEW_LINE DEDENT if count == k : NEW_LINE INDENT return i NEW_LINE DEDENT DEDENT return - 1 NEW_LINE DEDENT
|
g-transeval-python_data_340
|
def almost_sort ( a , n ) : NEW_LINE INDENT for i in range ( n - 1 ) : NEW_LINE INDENT if a [ i ] > a [ i + 1 ] : NEW_LINE INDENT a [ i ] , a [ i + 1 ] = a [ i + 1 ] , a [ i ] NEW_LINE i += 1 NEW_LINE DEDENT DEDENT for i in range ( n - 1 ) : NEW_LINE INDENT if a [ i ] > a [ i + 1 ] : NEW_LINE INDENT return False NEW_LINE DEDENT DEDENT return True NEW_LINE DEDENT
|
g-transeval-python_data_341
|
def maximum_sum ( s , n , k ) : NEW_LINE INDENT sum = 0 NEW_LINE freq = [ 0 ] * 256 NEW_LINE for i in range ( n ) : NEW_LINE INDENT freq [ ord ( s [ i ] ) ] += 1 NEW_LINE DEDENT freq . sort ( reverse = True ) NEW_LINE for i in range ( 256 ) : NEW_LINE INDENT if k > freq [ i ] : NEW_LINE INDENT sum += freq [ i ] * freq [ i ] NEW_LINE k -= freq [ i ] NEW_LINE DEDENT else : NEW_LINE INDENT sum += freq [ i ] * k NEW_LINE break NEW_LINE DEDENT DEDENT return sum NEW_LINE DEDENT
|
g-transeval-python_data_342
|
def find_min_operations ( arr , n , k ) : NEW_LINE INDENT operations = 0 NEW_LINE for i in range ( k ) : NEW_LINE INDENT freq = { } NEW_LINE for j in range ( i , n , k ) : NEW_LINE INDENT freq [ arr [ j ] ] = freq . get ( arr [ j ] , 0 ) + 1 NEW_LINE DEDENT max1 = 0 NEW_LINE num = 0 NEW_LINE for key , value in freq . items ( ) : NEW_LINE INDENT if value > max1 : NEW_LINE INDENT max1 = value NEW_LINE num = key NEW_LINE DEDENT DEDENT for key , value in freq . items ( ) : NEW_LINE INDENT if key != num : NEW_LINE INDENT operations += value NEW_LINE DEDENT DEDENT DEDENT return operations NEW_LINE DEDENT
|
g-transeval-python_data_343
|
def sub_string ( s , n ) : NEW_LINE INDENT v = [ ] NEW_LINE for i in range ( n ) : NEW_LINE INDENT for len in range ( 1 , n - i + 1 ) : NEW_LINE INDENT find = s [ i : i + len ] NEW_LINE v . append ( find ) NEW_LINE DEDENT DEDENT return v NEW_LINE DEDENT
|
g-transeval-python_data_344
|
def check_unique_frequency ( arr , n ) : NEW_LINE INDENT freq = { } NEW_LINE for i in range ( n ) : NEW_LINE INDENT freq [ arr [ i ] ] = freq . get ( arr [ i ] , 0 ) + 1 NEW_LINE DEDENT unique_freq = set ( ) NEW_LINE for i in freq : NEW_LINE INDENT if freq [ i ] in unique_freq : NEW_LINE INDENT return False NEW_LINE DEDENT else : NEW_LINE INDENT unique_freq . add ( freq [ i ] ) NEW_LINE DEDENT DEDENT return True NEW_LINE DEDENT
|
g-transeval-python_data_345
|
def min_cost ( str1 , str2 , n ) : NEW_LINE INDENT cost = 0 NEW_LINE tmp = list ( str1 ) NEW_LINE for i in range ( n ) : NEW_LINE INDENT if tmp [ i ] != str2 [ i ] : NEW_LINE INDENT if i < n - 1 and tmp [ i + 1 ] != str2 [ i + 1 ] : NEW_LINE INDENT tmp [ i ] , tmp [ i + 1 ] = tmp [ i + 1 ] , tmp [ i ] NEW_LINE cost += 1 NEW_LINE DEDENT else : NEW_LINE INDENT cost += 1 NEW_LINE DEDENT DEDENT DEDENT return cost NEW_LINE DEDENT
|
g-transeval-python_data_346
|
def is_valid_num ( x ) : NEW_LINE INDENT mp = dict ( ) NEW_LINE for i in range ( len ( x ) ) : NEW_LINE INDENT if ord ( x [ i ] ) - ord ( "0" ) in mp : NEW_LINE INDENT return False NEW_LINE DEDENT elif ord ( x [ i ] ) - ord ( "0" ) > 5 : NEW_LINE INDENT return False NEW_LINE DEDENT else : NEW_LINE INDENT mp [ ord ( x [ i ] ) - ord ( "0" ) ] = 1 NEW_LINE DEDENT DEDENT return True NEW_LINE DEDENT
|
g-transeval-python_data_347
|
def minimize_diff ( arr , n , k ) : NEW_LINE INDENT max_element = max ( arr ) NEW_LINE min_element = min ( arr ) NEW_LINE if max_element - min_element <= k : NEW_LINE INDENT return max_element - min_element NEW_LINE DEDENT avg = ( max_element + min_element ) // 2 NEW_LINE for i in range ( n ) : NEW_LINE INDENT if arr [ i ] > avg : NEW_LINE INDENT arr [ i ] -= k NEW_LINE DEDENT else : NEW_LINE INDENT arr [ i ] += k NEW_LINE DEDENT DEDENT max_element = max ( arr ) NEW_LINE min_element = min ( arr ) NEW_LINE return max_element - min_element NEW_LINE DEDENT
|
g-transeval-python_data_348
|
def get_min_cost ( arr , n ) : NEW_LINE INDENT min_ele = min ( arr ) NEW_LINE return min_ele * ( n - 1 ) NEW_LINE DEDENT
|
g-transeval-python_data_349
|
def possibility ( m , length , s ) : NEW_LINE INDENT count_odd = 0 NEW_LINE for i in range ( length ) : NEW_LINE INDENT if m [ ord ( s [ i ] ) - ord ( '0' ) ] & 1 : NEW_LINE INDENT count_odd += 1 NEW_LINE DEDENT if count_odd > 1 : NEW_LINE INDENT return False NEW_LINE DEDENT DEDENT return True NEW_LINE DEDENT
|
g-transeval-python_data_350
|
def minimum_cost_of_breaking ( x , y , m , n ) : NEW_LINE INDENT res = 0 NEW_LINE x . sort ( reverse = True ) NEW_LINE y . sort ( reverse = True ) NEW_LINE hzntl , vert = 1 , 1 NEW_LINE i , j = 0 , 0 NEW_LINE while i < m and j < n : NEW_LINE INDENT if x [ i ] > y [ j ] : NEW_LINE INDENT res += x [ i ] * vert NEW_LINE hzntl += 1 NEW_LINE i += 1 NEW_LINE DEDENT else : NEW_LINE INDENT res += y [ j ] * hzntl NEW_LINE vert += 1 NEW_LINE j += 1 NEW_LINE DEDENT DEDENT total = 0 NEW_LINE while i < m : NEW_LINE INDENT total += x [ i ] NEW_LINE i += 1 NEW_LINE DEDENT res += total * vert NEW_LINE total = 0 NEW_LINE while j < n : NEW_LINE INDENT total += y [ j ] NEW_LINE j += 1 NEW_LINE DEDENT res += total * hzntl NEW_LINE return res NEW_LINE DEDENT
|
g-transeval-python_data_351
|
def find_maximum_score ( a , n ) : NEW_LINE INDENT freq = { } NEW_LINE for i in range ( n ) : NEW_LINE INDENT if a [ i ] in freq : NEW_LINE INDENT freq [ a [ i ] ] += 1 NEW_LINE DEDENT else : NEW_LINE INDENT freq [ a [ i ] ] = 1 NEW_LINE DEDENT DEDENT dp = [ 0 ] * ( max ( a ) + 1 ) NEW_LINE dp [ 0 ] = 0 NEW_LINE dp [ 1 ] = freq . get ( 1 , 0 ) NEW_LINE for i in range ( 2 , len ( dp ) ) : NEW_LINE INDENT dp [ i ] = max ( dp [ i - 1 ] , dp [ i - 2 ] + freq . get ( i , 0 ) * i ) NEW_LINE DEDENT return dp [ - 1 ] NEW_LINE DEDENT
|
g-transeval-python_data_352
|
def count_ways ( s , t , k , mod ) : NEW_LINE INDENT n = len ( s ) NEW_LINE a = 0 NEW_LINE b = 0 NEW_LINE for i in range ( n ) : NEW_LINE INDENT p = s [ i : n ] + s [ : i ] NEW_LINE if p == t : NEW_LINE INDENT a += 1 NEW_LINE DEDENT else : NEW_LINE INDENT b += 1 NEW_LINE DEDENT DEDENT dp1 = [ 0 ] * ( k + 1 ) NEW_LINE dp2 = [ 0 ] * ( k + 1 ) NEW_LINE if s == t : NEW_LINE INDENT dp1 [ 0 ] = 1 NEW_LINE dp2 [ 0 ] = 0 NEW_LINE DEDENT else : NEW_LINE INDENT dp1 [ 0 ] = 0 NEW_LINE dp2 [ 0 ] = 1 NEW_LINE DEDENT for i in range ( 1 , k + 1 ) : NEW_LINE INDENT dp1 [ i ] = ( ( dp1 [ i - 1 ] * ( a - 1 ) ) % mod + ( dp2 [ i - 1 ] * a ) % mod ) % mod NEW_LINE dp2 [ i ] = ( ( dp1 [ i - 1 ] * b ) % mod + ( dp2 [ i - 1 ] * ( b - 1 ) ) % mod ) % mod NEW_LINE DEDENT return dp1 [ k ] NEW_LINE DEDENT
|
g-transeval-python_data_353
|
def find_subarray_sum ( arr , n , k ) : NEW_LINE INDENT prev_sum = { } NEW_LINE res = 0 NEW_LINE curr_sum = 0 NEW_LINE for i in range ( n ) : NEW_LINE INDENT curr_sum += arr [ i ] NEW_LINE if curr_sum == k : NEW_LINE INDENT res += 1 NEW_LINE DEDENT if ( curr_sum - k ) in prev_sum : NEW_LINE INDENT res += prev_sum [ curr_sum - k ] NEW_LINE DEDENT prev_sum [ curr_sum ] = prev_sum . get ( curr_sum , 0 ) + 1 NEW_LINE DEDENT return res NEW_LINE DEDENT
|
g-transeval-python_data_354
|
def maximum_occurrence ( s ) : NEW_LINE INDENT n = len ( s ) NEW_LINE freq = { } NEW_LINE for i in range ( len ( s ) ) : NEW_LINE INDENT temp = "" NEW_LINE temp += s [ i ] NEW_LINE freq [ temp ] = freq . get ( temp , 0 ) + 1 NEW_LINE DEDENT for i in range ( n ) : NEW_LINE INDENT for j in range ( i + 1 , n ) : NEW_LINE INDENT temp = "" NEW_LINE temp += s [ i ] NEW_LINE temp += s [ j ] NEW_LINE freq [ temp ] = freq . get ( temp , 0 ) + 1 NEW_LINE DEDENT DEDENT answer = - sys . maxsize NEW_LINE for key , value in freq . items ( ) : NEW_LINE INDENT answer = max ( answer , value ) NEW_LINE DEDENT return answer NEW_LINE DEDENT
|
g-transeval-python_data_355
|
def count_characters ( strings , chars ) : NEW_LINE INDENT res = 0 NEW_LINE freq = { } NEW_LINE for i in range ( len ( chars ) ) : NEW_LINE INDENT freq [ chars [ i ] ] = freq . get ( chars [ i ] , 0 ) + 1 NEW_LINE DEDENT for st in strings : NEW_LINE INDENT flag = True NEW_LINE for c in list ( st ) : NEW_LINE INDENT if c not in freq : NEW_LINE INDENT flag = False NEW_LINE break NEW_LINE DEDENT DEDENT if flag : NEW_LINE INDENT res += len ( st ) NEW_LINE DEDENT DEDENT return res NEW_LINE DEDENT
|
g-transeval-python_data_356
|
def distinct_substring ( p , q , k , n ) : NEW_LINE INDENT ss = set ( ) NEW_LINE for i in range ( n ) : NEW_LINE INDENT sum = 0 NEW_LINE s = "" NEW_LINE for j in range ( i , n ) : NEW_LINE INDENT pos = ord ( p [ j ] ) - ord ( 'a' ) NEW_LINE sum += ord ( q [ pos ] ) - ord ( '0' ) NEW_LINE s += p [ j ] NEW_LINE if sum <= k : NEW_LINE INDENT ss . add ( s ) NEW_LINE DEDENT else : NEW_LINE INDENT break NEW_LINE DEDENT DEDENT DEDENT return len ( ss ) NEW_LINE DEDENT
|
g-transeval-python_data_357
|
def unique_morse_rep ( arr ) : NEW_LINE INDENT morse_code = [ ".-" , "-..." , "-.-." , "-.." , "." , "..-." , "--." , "...." , ".." , ".---" , "-.-" , ".-.." , "--" , "-." , "---" , ".--." , "--.-" , ".-." , "..." , "-" , "..-" , "...-" , ".--" , "-..-" , "-.--" , "--.." ] NEW_LINE st = set ( ) NEW_LINE n = len ( arr ) NEW_LINE for i in range ( n ) : NEW_LINE INDENT temp = "" NEW_LINE m = len ( arr [ i ] ) NEW_LINE for j in range ( m ) : NEW_LINE INDENT temp += morse_code [ ord ( arr [ i ] [ j ] ) - ord ( "a" ) ] NEW_LINE DEDENT st . add ( temp ) NEW_LINE DEDENT return len ( st ) NEW_LINE DEDENT
|
g-transeval-python_data_358
|
def count_substrings ( str , k ) : NEW_LINE INDENT n = len ( str ) NEW_LINE answer = 0 NEW_LINE map = { } NEW_LINE for i in range ( k ) : NEW_LINE INDENT if str [ i ] not in map : NEW_LINE INDENT map [ str [ i ] ] = 1 NEW_LINE DEDENT else : NEW_LINE INDENT map [ str [ i ] ] += 1 NEW_LINE DEDENT DEDENT if len ( map ) == k : NEW_LINE INDENT answer += 1 NEW_LINE DEDENT for i in range ( k , n ) : NEW_LINE INDENT if str [ i ] not in map : NEW_LINE INDENT map [ str [ i ] ] = 1 NEW_LINE DEDENT else : NEW_LINE INDENT map [ str [ i ] ] += 1 NEW_LINE DEDENT map [ str [ i - k ] ] -= 1 NEW_LINE if map [ str [ i - k ] ] == 0 : NEW_LINE INDENT del map [ str [ i - k ] ] NEW_LINE DEDENT if len ( map ) == k : NEW_LINE INDENT answer += 1 NEW_LINE DEDENT DEDENT return answer NEW_LINE DEDENT
|
g-transeval-python_data_359
|
def can_construct ( s , k ) : NEW_LINE INDENT m = dict ( ) NEW_LINE p = 0 NEW_LINE if len ( s ) == k : NEW_LINE INDENT return True NEW_LINE DEDENT for i in range ( len ( s ) ) : NEW_LINE INDENT m [ s [ i ] ] = m . get ( s [ i ] , 0 ) + 1 NEW_LINE DEDENT if k > len ( s ) : NEW_LINE INDENT return False NEW_LINE DEDENT else : NEW_LINE INDENT for key , value in m . items ( ) : NEW_LINE INDENT if value % 2 != 0 : NEW_LINE INDENT p = p + 1 NEW_LINE DEDENT DEDENT DEDENT if k < p : NEW_LINE INDENT return False NEW_LINE DEDENT return True NEW_LINE DEDENT
|
g-transeval-python_data_360
|
def equal_ignore_case ( str1 , str2 ) : NEW_LINE INDENT str1 = str1 . upper ( ) NEW_LINE str2 = str2 . upper ( ) NEW_LINE return str1 == str2 NEW_LINE DEDENT
|
g-transeval-python_data_361
|
def find_longest_sub ( bin ) : NEW_LINE INDENT n = len ( bin ) NEW_LINE sum = 0 NEW_LINE prev_sum = { } NEW_LINE max_len = 0 NEW_LINE for i in range ( n ) : NEW_LINE INDENT if bin [ i ] == "1" : NEW_LINE INDENT sum += 1 NEW_LINE DEDENT else : NEW_LINE INDENT sum -= 1 NEW_LINE DEDENT if sum > 0 : NEW_LINE INDENT max_len = i + 1 NEW_LINE DEDENT elif sum <= 0 : NEW_LINE INDENT if ( sum - 1 ) in prev_sum : NEW_LINE INDENT curr_len = i - prev_sum [ sum - 1 ] NEW_LINE max_len = max ( max_len , curr_len ) NEW_LINE DEDENT DEDENT if sum not in prev_sum : NEW_LINE INDENT prev_sum [ sum ] = i NEW_LINE DEDENT DEDENT return max_len NEW_LINE DEDENT
|
g-transeval-python_data_362
|
def has_all_codes ( s , k ) : NEW_LINE INDENT us = set ( ) NEW_LINE for i in range ( len ( s ) + 1 ) : NEW_LINE INDENT us . add ( s [ i : k ] ) NEW_LINE DEDENT return len ( us ) == 1 << k NEW_LINE DEDENT
|
g-transeval-python_data_363
|
def check_palin ( word ) : NEW_LINE INDENT n = len ( word ) NEW_LINE word = word . lower ( ) NEW_LINE for i in range ( n ) : NEW_LINE INDENT if word [ i ] != word [ n - 1 ] : NEW_LINE INDENT return False NEW_LINE DEDENT n -= 1 NEW_LINE DEDENT return True NEW_LINE DEDENT
|
g-transeval-python_data_364
|
def convert ( st ) : NEW_LINE INDENT w = "" NEW_LINE z = "" NEW_LINE st = st . upper ( ) + " " NEW_LINE for i in range ( len ( st ) ) : NEW_LINE INDENT ch = st [ i ] NEW_LINE if ch != " " : NEW_LINE INDENT w += ch NEW_LINE DEDENT else : NEW_LINE INDENT z += w [ 0 ] . lower ( ) + w [ 1 : len ( w ) ] + " " NEW_LINE w = "" NEW_LINE DEDENT DEDENT return z NEW_LINE DEDENT
|
g-transeval-python_data_365
|
def max_lines ( n , x1 , y1 , x2 , y2 ) : NEW_LINE INDENT s = set ( ) NEW_LINE slope = 0 NEW_LINE for i in range ( n ) : NEW_LINE INDENT if x1 [ i ] == x2 [ i ] : NEW_LINE INDENT slope = sys . maxsize NEW_LINE DEDENT else : NEW_LINE INDENT slope = ( y2 [ i ] - y1 [ i ] ) * 1.0 / ( x2 [ i ] - x1 [ i ] ) NEW_LINE DEDENT s . add ( slope ) NEW_LINE DEDENT return len ( s ) NEW_LINE DEDENT
|
g-transeval-python_data_366
|
def prime_factor ( n ) : NEW_LINE INDENT primef = { } NEW_LINE while n % 2 == 0 : NEW_LINE INDENT if 2 in primef : NEW_LINE INDENT primef [ 2 ] += 1 NEW_LINE DEDENT else : NEW_LINE INDENT primef [ 2 ] = 1 NEW_LINE DEDENT n = n // 2 NEW_LINE DEDENT for i in range ( 3 , int ( math . sqrt ( n ) ) + 1 , 2 ) : NEW_LINE INDENT while n % i == 0 : NEW_LINE INDENT if i in primef : NEW_LINE INDENT primef [ i ] += 1 NEW_LINE DEDENT else : NEW_LINE INDENT primef [ i ] = 1 NEW_LINE DEDENT n = n // i NEW_LINE DEDENT DEDENT if n > 2 : NEW_LINE INDENT primef [ n ] = 1 NEW_LINE DEDENT return primef NEW_LINE DEDENT
|
g-transeval-python_data_367
|
def is_divisible_by_divisor ( s , d ) : NEW_LINE INDENT s %= d NEW_LINE hash_map = set ( ) NEW_LINE hash_map . add ( s ) NEW_LINE for i in range ( d + 1 ) : NEW_LINE INDENT s += s % d NEW_LINE s %= d NEW_LINE if s in hash_map : NEW_LINE INDENT if s == 0 : NEW_LINE INDENT return "Yes" NEW_LINE DEDENT return "No" NEW_LINE DEDENT else : NEW_LINE INDENT hash_map . add ( s ) NEW_LINE DEDENT DEDENT return "Yes" NEW_LINE DEDENT
|
g-transeval-python_data_368
|
def odd_sum ( a , n , k ) : NEW_LINE INDENT odd = set ( ) NEW_LINE even = set ( ) NEW_LINE for i in range ( n ) : NEW_LINE INDENT if a [ i ] % 2 == 0 : NEW_LINE INDENT even . add ( a [ i ] ) NEW_LINE DEDENT else : NEW_LINE INDENT odd . add ( a [ i ] ) NEW_LINE DEDENT DEDENT if len ( odd ) >= k : NEW_LINE INDENT return True NEW_LINE DEDENT flag = False NEW_LINE for i in range ( 1 , k , 2 ) : NEW_LINE INDENT needed = k - i NEW_LINE if needed <= len ( even ) : NEW_LINE INDENT return True NEW_LINE DEDENT DEDENT return flag NEW_LINE DEDENT
|
g-transeval-python_data_369
|
def day_of_year ( date ) : NEW_LINE INDENT days = [ 31 , 28 , 31 , 30 , 31 , 30 , 31 , 31 , 30 , 31 , 30 , 31 ] NEW_LINE year = int ( date [ 0 : 4 ] ) NEW_LINE month = int ( date [ 5 : 7 ] ) NEW_LINE day = int ( date [ 8 : ] ) NEW_LINE if month > 2 and year % 4 == 0 and ( year % 100 != 0 or year % 400 == 0 ) : NEW_LINE INDENT day += 1 NEW_LINE DEDENT while month > 1 : NEW_LINE INDENT day = day + days [ month - 2 ] NEW_LINE month -= 1 NEW_LINE DEDENT return day NEW_LINE DEDENT
|
g-transeval-python_data_370
|
def is_perfect_square ( arr , n ) : NEW_LINE INDENT umap = { } NEW_LINE for i in range ( n ) : NEW_LINE INDENT umap [ arr [ i ] ] = umap . get ( arr [ i ] , 0 ) + 1 NEW_LINE DEDENT for key , value in umap . items ( ) : NEW_LINE INDENT if value % 2 == 1 : NEW_LINE INDENT return False NEW_LINE DEDENT DEDENT return True NEW_LINE DEDENT
|
g-transeval-python_data_371
|
def min_moves ( n ) : NEW_LINE INDENT s = str ( n ) NEW_LINE ans = sys . maxsize NEW_LINE length = len ( s ) NEW_LINE for i in range ( length ) : NEW_LINE INDENT for j in range ( length ) : NEW_LINE INDENT if i == j : NEW_LINE INDENT continue NEW_LINE DEDENT t = list ( s ) NEW_LINE cur = 0 NEW_LINE for k in range ( i , length - 1 ) : NEW_LINE INDENT t [ k ] , t [ k + 1 ] = t [ k + 1 ] , t [ k ] NEW_LINE cur += 1 NEW_LINE DEDENT for k in range ( j - ( j > i ) , length - 2 ) : NEW_LINE INDENT t [ k ] , t [ k + 1 ] = t [ k + 1 ] , t [ k ] NEW_LINE cur += 1 NEW_LINE DEDENT pos = - 1 NEW_LINE for k in range ( length ) : NEW_LINE INDENT if t [ k ] != "0" : NEW_LINE INDENT pos = k NEW_LINE break NEW_LINE DEDENT DEDENT for k in range ( pos , 0 , - 1 ) : NEW_LINE INDENT t [ k ] , t [ k - 1 ] = t [ k - 1 ] , t [ k ] NEW_LINE cur += 1 NEW_LINE DEDENT nn = int ( "" . join ( t ) ) NEW_LINE if nn % 25 == 0 : NEW_LINE INDENT ans = min ( ans , cur ) NEW_LINE DEDENT DEDENT DEDENT if ans == sys . maxsize : NEW_LINE INDENT return - 1 NEW_LINE DEDENT return ans NEW_LINE DEDENT
|
g-transeval-python_data_372
|
def minimum_operations ( a , n ) : NEW_LINE INDENT mp = { } NEW_LINE for i in range ( n ) : NEW_LINE INDENT mp [ a [ i ] ] = mp . get ( a [ i ] , 0 ) + 1 NEW_LINE DEDENT count = 0 NEW_LINE for key , value in mp . items ( ) : NEW_LINE INDENT if value > 1 : NEW_LINE INDENT count += value - 1 NEW_LINE DEDENT DEDENT return count NEW_LINE DEDENT
|
g-transeval-python_data_373
|
def kaprekar_rec ( n , prev ) : NEW_LINE INDENT if n == 0 : NEW_LINE INDENT return 0 NEW_LINE DEDENT prev = n NEW_LINE digits = [ 0 ] * 4 NEW_LINE for i in range ( 4 ) : NEW_LINE INDENT digits [ i ] = n % 10 NEW_LINE n = n // 10 NEW_LINE DEDENT digits . sort ( ) NEW_LINE asc = 0 NEW_LINE for i in range ( 4 ) : NEW_LINE INDENT asc = asc * 10 + digits [ i ] NEW_LINE DEDENT digits . sort ( ) NEW_LINE desc = 0 NEW_LINE for i in range ( 3 , - 1 , - 1 ) : NEW_LINE INDENT desc = desc * 10 + digits [ i ] NEW_LINE DEDENT diff = abs ( asc - desc ) NEW_LINE if diff == prev : NEW_LINE INDENT return diff NEW_LINE DEDENT return kaprekar_rec ( diff , prev ) NEW_LINE DEDENT
|
g-transeval-python_data_374
|
def fraction_to_decimal ( numr , denr ) : NEW_LINE INDENT res = "" NEW_LINE mp = { } NEW_LINE rem = numr % denr NEW_LINE while rem != 0 and rem not in mp : NEW_LINE INDENT mp [ rem ] = len ( res ) NEW_LINE rem = rem * 10 NEW_LINE res_part = rem // denr NEW_LINE res += str ( res_part ) NEW_LINE rem = rem % denr NEW_LINE DEDENT if rem == 0 : NEW_LINE INDENT return "" NEW_LINE DEDENT if rem in mp : NEW_LINE INDENT return res [ mp [ rem ] : ] NEW_LINE DEDENT return "" NEW_LINE DEDENT
|
g-transeval-python_data_375
|
def is_fancy ( num ) : NEW_LINE INDENT fp = { } NEW_LINE fp [ "0" ] = "0" NEW_LINE fp [ "1" ] = "1" NEW_LINE fp [ "6" ] = "9" NEW_LINE fp [ "8" ] = "8" NEW_LINE fp [ "9" ] = "6" NEW_LINE n = len ( num ) NEW_LINE l , r = 0 , n - 1 NEW_LINE while l <= r : NEW_LINE INDENT if num [ l ] not in fp or fp [ num [ l ] ] != num [ r ] : NEW_LINE INDENT return False NEW_LINE DEDENT l += 1 NEW_LINE r -= 1 NEW_LINE DEDENT return True NEW_LINE DEDENT
|
g-transeval-python_data_376
|
def distinct_odd_ratio ( numbers ) : NEW_LINE INDENT distinct_count = len ( set ( numbers ) ) NEW_LINE distinct_odd_count = len ( [ n for n in set ( numbers ) if n % 2 == 1 ] ) NEW_LINE return distinct_odd_count / distinct_count NEW_LINE DEDENT
|
g-transeval-python_data_377
|
def compare_sum ( numbers , words ) : NEW_LINE INDENT int_sum = sum ( numbers ) NEW_LINE word_length_sum = sum ( [ len ( word ) for word in words ] ) NEW_LINE if int_sum < word_length_sum : NEW_LINE INDENT return - 1 NEW_LINE DEDENT elif int_sum > word_length_sum : NEW_LINE INDENT return 1 NEW_LINE DEDENT else : NEW_LINE INDENT return 0 NEW_LINE DEDENT DEDENT
|
g-transeval-python_data_378
|
def all_longer_than ( short_words , long_words ) : NEW_LINE INDENT max_of_short = max ( [ len ( w ) for w in short_words ] ) NEW_LINE min_of_long = min ( [ len ( w ) for w in long_words ] ) NEW_LINE return min_of_long > max_of_short NEW_LINE DEDENT
|
g-transeval-python_data_379
|
def compare_odd_even_range ( numbers ) : NEW_LINE INDENT range_odd = max ( [ n for n in numbers if n % 2 == 1 ] ) - min ( [ n for n in numbers if n % 2 == 1 ] ) NEW_LINE range_even = max ( [ n for n in numbers if n % 2 == 0 ] ) - min ( [ n for n in numbers if n % 2 == 0 ] ) NEW_LINE if range_odd < range_even : NEW_LINE INDENT return - 1 NEW_LINE DEDENT if range_odd > range_even : NEW_LINE INDENT return 1 NEW_LINE DEDENT return 0 NEW_LINE DEDENT
|
g-transeval-python_data_380
|
def average_distinct_length ( words ) : NEW_LINE INDENT distinct_words = set ( words ) NEW_LINE average_len = sum ( [ len ( w ) for w in distinct_words ] ) / len ( distinct_words ) if distinct_words else 0 NEW_LINE return average_len NEW_LINE DEDENT
|
g-transeval-python_data_381
|
def withdraw_balance ( start , withdrawals ) : NEW_LINE INDENT end = functools . reduce ( lambda balance , nextWithdrawal : balance - nextWithdrawal if nextWithdrawal <= balance else balance , withdrawals , start ) NEW_LINE return end NEW_LINE DEDENT
|
g-transeval-python_data_382
|
def first_short_and_starts_with_o ( words ) : NEW_LINE INDENT matched_element = next ( iter ( [ w for w in [ w1 for w1 in words if len ( w1 ) < 5 ] if w . startswith ( 'o' ) ] ) , "" ) NEW_LINE return matched_element NEW_LINE DEDENT
|
g-transeval-python_data_383
|
def big_number_at_index ( numbers , index ) : NEW_LINE INDENT target_num = [ n for n in numbers if n > 5 ] [ index ] NEW_LINE return target_num NEW_LINE DEDENT
|
g-transeval-python_data_384
|
def contains_square_in_range ( range_start , range_length ) : NEW_LINE INDENT contains_square = any ( [ int ( math . sqrt ( n ) ) ** 2 == n for n in range ( range_start , range_start + range_length ) ] ) NEW_LINE return contains_square NEW_LINE DEDENT
|
g-transeval-python_data_385
|
def group_numbers_by_mod ( numbers , mod ) : NEW_LINE INDENT number_groups = { } NEW_LINE for k , g in itertools . groupby ( numbers , lambda n : n % mod ) : NEW_LINE INDENT number_groups [ k ] = number_groups . get ( k , [ ] ) + list ( g ) NEW_LINE DEDENT return number_groups NEW_LINE DEDENT
|
g-transeval-python_data_386
|
def group_words_by_first_char ( words ) : NEW_LINE INDENT word_groups = { } NEW_LINE for k , g in itertools . groupby ( words , lambda w : w [ 0 ] ) : NEW_LINE INDENT word_groups [ k ] = word_groups . get ( k , [ ] ) + list ( g ) NEW_LINE DEDENT return word_groups NEW_LINE DEDENT
|
g-transeval-python_data_387
|
def order_by_length_and_descending ( words ) : NEW_LINE INDENT sorted_words = sorted ( sorted ( words , key = lambda w : w , reverse = True ) , key = lambda w : len ( w ) ) NEW_LINE return sorted_words NEW_LINE DEDENT
|
g-transeval-python_data_388
|
def order_first_char_descending_reverse ( words ) : NEW_LINE INDENT sorted_words = sorted ( words , key = lambda w : ( - ord ( w [ 0 ] ) , w ) , reverse = True ) NEW_LINE return sorted_words NEW_LINE DEDENT
|
g-transeval-python_data_389
|
def get_sublist_of_negative ( numbers , start , length ) : NEW_LINE INDENT sub_list = [ n for n in numbers [ start : ] if n < 0 ] [ : length ] NEW_LINE return sub_list NEW_LINE DEDENT
|
g-transeval-python_data_390
|
def get_positive_sequence ( numbers ) : NEW_LINE INDENT sub_sequence = list ( itertools . takewhile ( lambda n : n > 0 , itertools . dropwhile ( lambda n : n <= 0 , numbers ) ) ) NEW_LINE return sub_sequence NEW_LINE DEDENT
|
g-transeval-python_data_391
|
def get_larger_than_index_sequence ( numbers ) : NEW_LINE INDENT sub_sequence = [ x [ 1 ] for x in itertools . takewhile ( lambda x : x [ 1 ] >= x [ 0 ] , itertools . dropwhile ( lambda x : x [ 1 ] < x [ 0 ] , enumerate ( numbers ) ) ) ] NEW_LINE return sub_sequence NEW_LINE DEDENT
|
g-transeval-python_data_392
|
def rearrange_word_by_indexes ( words , indexes ) : NEW_LINE INDENT new_indexes = [ n % len ( words ) for n in indexes if n >= len ( words ) ] NEW_LINE new_words = [ words [ n ] for n in new_indexes ] NEW_LINE return new_words NEW_LINE DEDENT
|
g-transeval-python_data_393
|
def get_words_upper_lower ( words ) : NEW_LINE INDENT upper_lower_words = [ [ w . upper ( ) , w . lower ( ) ] for w in words ] NEW_LINE return upper_lower_words NEW_LINE DEDENT
|
g-transeval-python_data_394
|
def select_if_in_place ( numbers ) : NEW_LINE INDENT nums_in_place = [ num == index for index , num in enumerate ( numbers ) ] NEW_LINE return nums_in_place NEW_LINE DEDENT
|
g-transeval-python_data_395
|
def select_pairs ( numbers_a , numbers_b ) : NEW_LINE INDENT pairs = [ [ a , b ] for a in numbers_a for b in numbers_b if a < b ] NEW_LINE return pairs NEW_LINE DEDENT
|
g-transeval-python_data_396
|
def string_cross_join ( end_words , begin_words ) : NEW_LINE INDENT cross_strings = [ e + ' ' + b for b in begin_words for e in end_words if b [ 0 ] == e [ - 1 ] ] NEW_LINE return cross_strings NEW_LINE DEDENT
|
g-transeval-python_data_397
|
def elements_contain_subword ( words , subword ) : NEW_LINE INDENT if all ( subword in w for w in words [ : 5 ] ) : NEW_LINE INDENT return 1 NEW_LINE DEDENT elif any ( subword in w for w in words [ : 5 ] ) : NEW_LINE INDENT return 0 NEW_LINE DEDENT else : NEW_LINE INDENT return - 1 NEW_LINE DEDENT DEDENT
|
g-transeval-python_data_398
|
def concat_large_numbers ( numbers_a , numbers_b , flag ) : NEW_LINE INDENT all_numbers = [ n for n in numbers_a if n > flag ] + [ n for n in numbers_b if n > flag ] NEW_LINE return all_numbers NEW_LINE DEDENT
|
g-transeval-python_data_399
|
def dot_product ( vector_a , vector_b ) : NEW_LINE INDENT dot_product = sum ( [ a * b for a , b in zip ( vector_a , vector_b ) ] ) NEW_LINE return dot_product NEW_LINE DEDENT
|
g-transeval-python_data_400
|
def set_difference ( set_a , set_b ) : NEW_LINE INDENT difference = sorted ( list ( set ( set_a ) . symmetric_difference ( set ( set_b ) ) ) ) NEW_LINE return difference NEW_LINE DEDENT
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.