id
stringlengths 23
25
| content
stringlengths 46
1.27k
|
|---|---|
g-transeval-java_data_301
|
String getClosestVowel ( String word ) { String vowels = "AEIOUaeiou" ; for ( int i = word . length ( ) - 2 ; i > 0 ; i -- ) { if ( vowels . indexOf ( word . charAt ( i ) ) != - 1 && vowels . indexOf ( word . charAt ( i + 1 ) ) == - 1 && vowels . indexOf ( word . charAt ( i - 1 ) ) == - 1 ) { return String . valueOf ( word . charAt ( i ) ) ; } } return "" ; }
|
g-transeval-java_data_302
|
String matchParens ( List < String > lst ) { List < String > strings = Arrays . asList ( lst . get ( 0 ) + lst . get ( 1 ) , lst . get ( 1 ) + lst . get ( 0 ) ) ; for ( var l : strings ) { int count = 0 ; for ( char c : l . toCharArray ( ) ) { if ( c == '(' ) { count += 1 ; } else { count -= 1 ; } if ( count < 0 ) { break ; } } if ( count == 0 ) { return "Yes" ; } } return "No" ; }
|
g-transeval-java_data_303
|
List < Integer > maximum ( List < Integer > arr , int k ) { if ( k == 0 ) { return new ArrayList < > ( ) ; } Collections . sort ( arr ) ; return arr . subList ( arr . size ( ) - k , arr . size ( ) ) ; }
|
g-transeval-java_data_304
|
boolean validDate ( String date ) { if ( date . length ( ) != 10 ) { return false ; } for ( int i = 0 ; i < 10 ; i ++ ) { if ( i == 2 || i == 5 ) { if ( date . charAt ( i ) != '-' ) { return false ; } } else if ( ! Character . isDigit ( date . charAt ( i ) ) ) { return false ; } } int month = Integer . parseInt ( date . substring ( 0 , 2 ) ) ; int day = Integer . parseInt ( date . substring ( 3 , 5 ) ) ; int year = Integer . parseInt ( date . substring ( 6 , 10 ) ) ; if ( month < 1 || month > 12 ) { return false ; } if ( day < 1 || day > 31 ) { return false ; } if ( day == 31 && ( month == 4 || month == 6 || month == 9 || month == 11 || month == 2 ) ) { return false ; } if ( day == 30 && month == 2 ) { return false ; } return true ; }
|
g-transeval-java_data_305
|
Object splitWords ( String txt ) { StringBuilder current = new StringBuilder ( ) ; List < String > result = new ArrayList < > ( ) ; if ( txt . indexOf ( ' ' ) != - 1 ) { for ( int i = 0 ; i <= txt . length ( ) ; i ++ ) { if ( i == txt . length ( ) || txt . charAt ( i ) == ' ' ) { if ( current . length ( ) > 0 ) { result . add ( current . toString ( ) ) ; } current . setLength ( 0 ) ; } else { current . append ( txt . charAt ( i ) ) ; } } return result ; } if ( txt . indexOf ( ',' ) != - 1 ) { for ( int i = 0 ; i <= txt . length ( ) ; i ++ ) { if ( i == txt . length ( ) || txt . charAt ( i ) == ',' ) { if ( current . length ( ) > 0 ) { result . add ( current . toString ( ) ) ; } current . setLength ( 0 ) ; } else { current . append ( txt . charAt ( i ) ) ; } } return result ; } int num = 0 ; for ( char c : txt . toCharArray ( ) ) { if ( Character . isLowerCase ( c ) && c % 2 == 0 ) { num += 1 ; } } return Arrays . asList ( String . valueOf ( num ) ) ; }
|
g-transeval-java_data_306
|
List < Integer > tri ( int n ) { if ( n == 0 ) { return Arrays . asList ( 1 ) ; } List < Integer > tris = new ArrayList < > ( Arrays . asList ( 1 , 3 ) ) ; for ( int i = 2 ; i <= n ; i ++ ) { if ( i % 2 == 0 ) { tris . add ( i / 2 + 1 ) ; } else { tris . add ( tris . get ( i - 1 ) + tris . get ( i - 2 ) + ( i + 3 ) / 2 ) ; } } return tris ; }
|
g-transeval-java_data_307
|
boolean checkIfLastCharIsALetter ( String txt ) { if ( txt . isEmpty ( ) ) { return false ; } return Character . isLetter ( txt . charAt ( txt . length ( ) - 1 ) ) && ( txt . length ( ) == 1 || ! Character . isLetter ( txt . charAt ( txt . length ( ) - 2 ) ) ) ; }
|
g-transeval-java_data_308
|
List < Integer > orderByPoints ( List < Integer > nums ) { List < Integer > result = new ArrayList < > ( ) ; for ( int num : nums ) { String w = String . valueOf ( Math . abs ( num ) ) ; int sum = 0 ; for ( char c : w . toCharArray ( ) ) { sum += c - '0' ; } if ( num < 0 ) { sum -= 2 * ( w . charAt ( 0 ) - '0' ) ; } result . add ( sum ) ; } for ( int i = 0 ; i < nums . size ( ) ; i ++ ) { for ( int j = 1 ; j < nums . size ( ) ; j ++ ) { if ( result . get ( j - 1 ) > result . get ( j ) ) { Collections . swap ( result , j , j - 1 ) ; Collections . swap ( nums , j , j - 1 ) ; } } } return nums ; }
|
g-transeval-java_data_309
|
List < String > bf ( String planet1 , String planet2 ) { List < String > planets = Arrays . asList ( "Mercury" , "Venus" , "Earth" , "Mars" , "Jupiter" , "Saturn" , "Uranus" , "Neptune" ) ; int idx1 = planets . indexOf ( planet1 ) ; int idx2 = planets . indexOf ( planet2 ) ; if ( idx1 == - 1 || idx2 == - 1 || idx1 == idx2 ) { return new ArrayList < > ( ) ; } return idx1 > idx2 ? planets . subList ( idx2 + 1 , idx1 ) : planets . subList ( idx1 + 1 , idx2 ) ; }
|
g-transeval-java_data_310
|
List < String > sortedListSum ( List < String > lst ) { List < String > result = new ArrayList < > ( ) ; for ( var i : lst ) { if ( i . length ( ) % 2 == 0 ) { result . add ( i ) ; } } result . sort ( ( String l , String r ) -> { if ( l . length ( ) == r . length ( ) ) { return l . compareTo ( r ) ; } return l . length ( ) - r . length ( ) ; } ) ; return result ; }
|
g-transeval-java_data_311
|
boolean cycpatternCheck ( String a , String b ) { for ( int i = 0 ; i <= b . length ( ) ; i ++ ) { String rotate = b . substring ( i ) + b . substring ( 0 , i ) ; if ( a . contains ( rotate ) ) { return true ; } } return false ; }
|
g-transeval-java_data_312
|
List < Integer > evenOddCount ( int num ) { int evenCount = 0 , oddCount = 0 ; for ( char i : String . valueOf ( Math . abs ( num ) ) . toCharArray ( ) ) { if ( i % 2 == 0 ) { evenCount += 1 ; } else { oddCount += 1 ; } } return Arrays . asList ( evenCount , oddCount ) ; }
|
g-transeval-java_data_313
|
String findMax ( List < String > words ) { String max = "" ; int maxLength = 0 ; for ( var word : words ) { List < Character > unique = new ArrayList < > ( ) ; for ( char w : word . toCharArray ( ) ) { if ( ! unique . contains ( w ) ) { unique . add ( w ) ; } } if ( unique . size ( ) > maxLength || ( unique . size ( ) == maxLength && word . compareTo ( max ) < 0 ) ) { max = word ; maxLength = unique . size ( ) ; } } return max ; }
|
g-transeval-java_data_314
|
String solve ( String s ) { boolean noLetter = true ; StringBuilder result = new StringBuilder ( ) ; for ( char ch : s . toCharArray ( ) ) { if ( Character . isUpperCase ( ch ) ) { ch = Character . toLowerCase ( ch ) ; noLetter = false ; } else if ( Character . isLowerCase ( ch ) ) { ch = Character . toUpperCase ( ch ) ; noLetter = false ; } result . append ( ch ) ; } if ( noLetter ) { return result . reverse ( ) . toString ( ) ; } else { return result . toString ( ) ; } }
|
g-transeval-java_data_315
|
int mostFrequent ( List < Integer > arr , int n ) { Map < Integer , Integer > hp = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( hp . containsKey ( arr . get ( i ) ) ) { hp . put ( arr . get ( i ) , hp . get ( arr . get ( i ) ) + 1 ) ; } else { hp . put ( arr . get ( i ) , 1 ) ; } } int maxCount = 0 , res = - 1 ; for ( var entry : hp . entrySet ( ) ) { if ( maxCount < entry . getValue ( ) ) { res = entry . getKey ( ) ; maxCount = entry . getValue ( ) ; } } return res ; }
|
g-transeval-java_data_316
|
int find ( List < Integer > a , List < Integer > b , int k , int n1 , int n2 ) { Set < Integer > s = new HashSet < > ( ) ; for ( int i = 0 ; i < n2 ; i ++ ) { s . add ( b . get ( i ) ) ; } int missing = 0 ; for ( int i = 0 ; i < n1 ; i ++ ) { if ( ! s . contains ( a . get ( i ) ) ) { missing ++ ; } if ( missing == k ) { return a . get ( i ) ; } } return - 1 ; }
|
g-transeval-java_data_317
|
int solveQuery ( int start , int end , List < Integer > arr ) { Map < Integer , Integer > mp = new HashMap < > ( ) ; for ( int i = start ; i <= end ; i ++ ) { mp . put ( arr . get ( i ) , mp . getOrDefault ( arr . get ( i ) , 0 ) + 1 ) ; } int count = 0 ; for ( var entry : mp . entrySet ( ) ) { if ( entry . getKey ( ) == entry . getValue ( ) ) { count ++ ; } } return count ; }
|
g-transeval-java_data_318
|
int segregate ( List < Integer > arr , int size ) { int j = 0 ; for ( int i = 0 ; i < size ; i ++ ) { if ( arr . get ( i ) <= 0 ) { Collections . swap ( arr , i , j ) ; j ++ ; } } return j ; }
|
g-transeval-java_data_319
|
int countTriplets ( List < Integer > a , int n ) { Set < Integer > s = new HashSet < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { s . add ( a . get ( i ) ) ; } int count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = i + 1 ; j < n ; j ++ ) { int xr = a . get ( i ) ^ a . get ( j ) ; if ( s . contains ( xr ) && xr != a . get ( i ) && xr != a . get ( j ) ) { count ++ ; } } } return count / 3 ; }
|
g-transeval-java_data_320
|
int leastFrequent ( List < Integer > arr , int n ) { Map < Integer , Integer > hp = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( hp . containsKey ( arr . get ( i ) ) ) { hp . put ( arr . get ( i ) , hp . get ( arr . get ( i ) ) + 1 ) ; } else { hp . put ( arr . get ( i ) , 1 ) ; } } int minCount = n + 1 , res = - 1 ; for ( var entry : hp . entrySet ( ) ) { if ( minCount >= entry . getValue ( ) ) { res = entry . getKey ( ) ; minCount = entry . getValue ( ) ; } } return res ; }
|
g-transeval-java_data_321
|
int findPermutations ( List < Integer > arr ) { int cnt = 0 ; int maxInd = - 1 , minInd = 10000000 ; int n = arr . size ( ) ; Map < Integer , Integer > indexOf = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { indexOf . put ( arr . get ( i ) , i + 1 ) ; } for ( int i = 1 ; i <= n ; i ++ ) { maxInd = Math . max ( maxInd , indexOf . getOrDefault ( i , 0 ) ) ; minInd = Math . min ( minInd , indexOf . getOrDefault ( i , 0 ) ) ; if ( maxInd - minInd + 1 == i ) { cnt ++ ; } } return cnt ; }
|
g-transeval-java_data_322
|
int formQuadruplets ( List < Integer > arr , int n ) { int ans = 0 , pairs = 0 ; pairs = n / 4 ; arr . sort ( Collections . reverseOrder ( ) ) ; for ( int i = 0 ; i < n - pairs ; i += 3 ) { ans += arr . get ( i + 2 ) ; } return ans ; }
|
g-transeval-java_data_323
|
String lexicographicallyMaximum ( String s , int n ) { Map < Character , Integer > m = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; ++ i ) { if ( m . containsKey ( s . charAt ( i ) ) ) { m . put ( s . charAt ( i ) , m . get ( s . charAt ( i ) ) + 1 ) ; } else { m . put ( s . charAt ( i ) , 1 ) ; } } List < Character > v = new ArrayList < > ( ) ; for ( char i = 'a' ; i < 'a' + Math . min ( n , 25 ) ; ++ i ) { if ( ! m . containsKey ( i ) ) { v . add ( i ) ; } } int j = v . size ( ) - 1 ; for ( int i = 0 ; i < n ; ++ i ) { if ( s . charAt ( i ) >= 'a' + Math . min ( n , 25 ) || ( m . containsKey ( s . charAt ( i ) ) && m . get ( s . charAt ( i ) ) > 1 ) ) { if ( v . get ( j ) < s . charAt ( i ) ) { continue ; } m . put ( s . charAt ( i ) , m . get ( s . charAt ( i ) ) - 1 ) ; s = s . substring ( 0 , i ) + v . get ( j ) + s . substring ( i + 1 ) ; j -- ; } if ( j < 0 ) { break ; } } int l = 0 ; for ( int i = n - 1 ; i >= 0 ; i -- ) { if ( l > j ) { break ; } if ( s . charAt ( i ) >= 'a' + Math . min ( n , 25 ) || m . containsKey ( s . charAt ( i ) ) && m . get ( s . charAt ( i ) ) > 1 ) { m . put ( s . charAt ( i ) , m . get ( s . charAt ( i ) ) - 1 ) ; s = s . substring ( 0 , i ) + v . get ( l ) + s . substring ( i + 1 ) ; l ++ ; } } return s ; }
|
g-transeval-java_data_324
|
int noOfValidKbers ( int k , List < Integer > arr ) { Set < Integer > s = new HashSet < > ( ) ; while ( k != 0 ) { s . add ( k % 10 ) ; k = k / 10 ; } int count = 0 ; for ( int i = 0 ; i < arr . size ( ) ; i ++ ) { int no = arr . get ( i ) ; boolean flag = true ; while ( no != 0 ) { int digit = no % 10 ; if ( ! s . contains ( digit ) ) { flag = false ; break ; } no = no / 10 ; } if ( flag ) { count ++ ; } } return count ; }
|
g-transeval-java_data_325
|
int delCost ( String s , List < Integer > cost ) { int ans = 0 ; Map < Character , Integer > forMax = new HashMap < > ( ) ; Map < Character , Integer > forTot = new HashMap < > ( ) ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( ! forMax . containsKey ( s . charAt ( i ) ) ) { forMax . put ( s . charAt ( i ) , cost . get ( i ) ) ; } else { forMax . put ( s . charAt ( i ) , Math . max ( cost . get ( i ) , forMax . get ( s . charAt ( i ) ) ) ) ; } if ( ! forTot . containsKey ( s . charAt ( i ) ) ) { forTot . put ( s . charAt ( i ) , cost . get ( i ) ) ; } else { forTot . put ( s . charAt ( i ) , forTot . get ( s . charAt ( i ) ) + cost . get ( i ) ) ; } } for ( var i : forMax . entrySet ( ) ) { ans += forTot . get ( i . getKey ( ) ) - i . getValue ( ) ; } return ans ; }
|
g-transeval-java_data_326
|
List < String > replaceDuplicates ( List < String > names ) { Map < String , Integer > hash = new HashMap < > ( ) ; for ( int i = 0 ; i < names . size ( ) ; i ++ ) { if ( ! hash . containsKey ( names . get ( i ) ) ) { hash . put ( names . get ( i ) , 1 ) ; } else { int count = hash . get ( names . get ( i ) ) ; hash . put ( names . get ( i ) , hash . get ( names . get ( i ) ) + 1 ) ; names . set ( i , names . get ( i ) + Integer . toString ( count ) ) ; } } return names ; }
|
g-transeval-java_data_327
|
List < Integer > minmaxNumbers ( List < List < Integer > > matrix , List < Integer > res ) { Set < Integer > set = new HashSet < > ( ) ; for ( int i = 0 ; i < matrix . size ( ) ; i ++ ) { int minR = Integer . MAX_VALUE ; for ( int j = 0 ; j < matrix . get ( i ) . size ( ) ; j ++ ) { minR = Math . min ( minR , matrix . get ( i ) . get ( j ) ) ; } set . add ( minR ) ; } for ( int j = 0 ; j < matrix . get ( 0 ) . size ( ) ; j ++ ) { int maxC = Integer . MIN_VALUE ; for ( int i = 0 ; i < matrix . size ( ) ; i ++ ) { maxC = Math . max ( maxC , matrix . get ( i ) . get ( j ) ) ; } if ( set . contains ( maxC ) ) { res . add ( maxC ) ; } } return res ; }
|
g-transeval-java_data_328
|
int lengthOfLongestAP ( List < Integer > a , int n ) { Map < Integer , Map < Integer , Integer > > dp = new HashMap < Integer , Map < Integer , Integer > > ( ) ; int res = 2 ; for ( int i = 0 ; i < n ; ++ i ) { for ( int j = i + 1 ; j < n ; ++ j ) { int d = a . get ( j ) - a . get ( i ) ; if ( dp . containsKey ( d ) ) { if ( dp . get ( d ) . containsKey ( i ) ) { dp . get ( d ) . put ( j , dp . get ( d ) . get ( i ) + 1 ) ; } else { dp . get ( d ) . put ( j , 2 ) ; } } else { dp . put ( d , new HashMap < > ( ) ) ; dp . get ( d ) . put ( j , 2 ) ; } res = Math . max ( res , dp . get ( d ) . get ( j ) ) ; } } return res ; }
|
g-transeval-java_data_329
|
char findKthChar ( int n , int k ) { String prev = "A" ; String cur = "" ; if ( n == 1 ) { return 'A' ; } for ( int j = 2 ; j <= n ; j ++ ) { cur = prev + "B" ; for ( int i = 0 ; i < prev . length ( ) ; i ++ ) { if ( prev . charAt ( i ) == 'A' ) { prev = prev . substring ( 0 , i ) + 'B' + prev . substring ( i + 1 ) ; } else { prev = prev . substring ( 0 , i ) + 'A' + prev . substring ( i + 1 ) ; } } prev = new StringBuilder ( prev ) . reverse ( ) . toString ( ) ; cur += prev ; prev = cur ; } return cur . charAt ( k - 1 ) ; }
|
g-transeval-java_data_330
|
char findKthLargest ( String s , int k ) { List < Character > tmp = s . chars ( ) . mapToObj ( e -> ( char ) e ) . collect ( Collectors . toList ( ) ) ; Collections . sort ( tmp ) ; Collections . reverse ( tmp ) ; return tmp . get ( k - 1 ) ; }
|
g-transeval-java_data_331
|
int subArraylen ( List < Integer > arr , int n , int k ) { HashMap < Integer , Integer > mp = new HashMap < > ( ) ; mp . put ( arr . get ( 0 ) , 0 ) ; for ( int i = 1 ; i < n ; i ++ ) { arr . set ( i , arr . get ( i ) + arr . get ( i - 1 ) ) ; mp . put ( arr . get ( i ) , i ) ; } int len = Integer . MAX_VALUE ; for ( int i = 0 ; i < n ; i ++ ) { if ( arr . get ( i ) < k ) { continue ; } else { int x = arr . get ( i ) - k ; if ( x == 0 ) { len = Math . min ( len , i ) ; } if ( ! mp . containsKey ( x ) ) { continue ; } else { len = Math . min ( len , i - mp . get ( x ) ) ; } } } return len ; }
|
g-transeval-java_data_332
|
int findMaxLen ( List < Integer > a , int k ) { int n = a . size ( ) ; Collections . sort ( a ) ; List < Boolean > vis = new ArrayList < > ( Collections . nCopies ( n , false ) ) ; HashMap < Integer , Integer > mp = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { mp . put ( a . get ( i ) , i ) ; } int c = 0 ; for ( int i = 0 ; i < n ; ++ i ) { if ( ! vis . get ( i ) ) { int check = a . get ( i ) * k ; if ( mp . containsKey ( check ) ) { c ++ ; vis . set ( mp . get ( check ) , true ) ; } } } return n - c ; }
|
g-transeval-java_data_333
|
List < Integer > minDistancePoints ( List < Integer > a , int k , int n ) { Map < Integer , Integer > m = new HashMap < > ( ) ; Queue < Integer > q = new ArrayDeque < > ( ) ; for ( int i = 0 ; i < n ; ++ i ) { m . put ( a . get ( i ) , 1 ) ; q . add ( a . get ( i ) ) ; } List < Integer > ans = new ArrayList < > ( ) ; while ( k > 0 ) { int x = q . poll ( ) ; if ( ! m . containsKey ( x - 1 ) && k > 0 ) { m . put ( x - 1 , 1 ) ; q . add ( x - 1 ) ; ans . add ( x - 1 ) ; k -- ; } if ( ! m . containsKey ( x + 1 ) && k > 0 ) { m . put ( x + 1 , 1 ) ; q . add ( x + 1 ) ; ans . add ( x + 1 ) ; k -- ; } } return ans ; }
|
g-transeval-java_data_334
|
boolean isValidLen ( String s , int len , int k ) { int n = s . length ( ) ; Map < Character , Integer > mp = new HashMap < Character , Integer > ( ) ; int right = 0 ; while ( right < len ) { if ( mp . containsKey ( s . charAt ( right ) ) ) { mp . put ( s . charAt ( right ) , mp . get ( s . charAt ( right ) ) + 1 ) ; } else { mp . put ( s . charAt ( right ) , 1 ) ; } right ++ ; } if ( mp . size ( ) <= k ) { return true ; } while ( right < n ) { if ( mp . containsKey ( s . charAt ( right ) ) ) { mp . put ( s . charAt ( right ) , mp . get ( s . charAt ( right ) ) + 1 ) ; } else { mp . put ( s . charAt ( right ) , 1 ) ; } if ( mp . containsKey ( s . charAt ( right - len ) ) ) { mp . put ( s . charAt ( right - len ) , mp . get ( s . charAt ( right - len ) ) - 1 ) ; } if ( mp . get ( s . charAt ( right - len ) ) == 0 ) { mp . remove ( s . charAt ( right - len ) ) ; } if ( mp . size ( ) <= k ) { return true ; } right ++ ; } return mp . size ( ) <= k ; }
|
g-transeval-java_data_335
|
int partition ( List < Integer > arr , int low , int high ) { int pivot = arr . get ( high ) ; int i = ( low - 1 ) ; for ( int j = low ; j <= high - 1 ; j ++ ) { if ( arr . get ( j ) <= pivot ) { i ++ ; Collections . swap ( arr , i , j ) ; } } Collections . swap ( arr , i + 1 , high ) ; return i + 1 ; }
|
g-transeval-java_data_336
|
int strScore ( List < String > strs , String s , int n ) { HashMap < String , Integer > m = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { m . put ( strs . get ( i ) , i + 1 ) ; } if ( ! m . containsKey ( s ) ) { return 0 ; } int score = 0 ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { score += s . charAt ( i ) - 'a' + 1 ; } score = score * m . get ( s ) ; return score ; }
|
g-transeval-java_data_337
|
List < Integer > countEle ( List < Integer > s , List < Integer > a , int n ) { HashMap < Integer , Boolean > mp = new HashMap < > ( ) ; List < Integer > ans = new ArrayList < > ( ) ; for ( int i = 0 ; i < n ; ++ i ) { int num = a . get ( i ) ; if ( mp . containsKey ( num ) ) { ans . add ( 0 ) ; } else { int cnt = 0 ; while ( s . get ( 0 ) != num ) { mp . put ( s . get ( 0 ) , true ) ; s . remove ( 0 ) ; cnt ++ ; } s . remove ( 0 ) ; cnt ++ ; ans . add ( cnt ) ; } } return ans ; }
|
g-transeval-java_data_338
|
int maxDistinctChar ( String s , int n , int k ) { Map < Character , Integer > freq = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( freq . containsKey ( s . charAt ( i ) ) ) { freq . put ( s . charAt ( i ) , freq . get ( s . charAt ( i ) ) + 1 ) ; } else { freq . put ( s . charAt ( i ) , 1 ) ; } } List < Integer > v = new ArrayList < > ( ) ; for ( var it : freq . entrySet ( ) ) { v . add ( it . getValue ( ) ) ; } Collections . sort ( v ) ; for ( int i = 0 ; i < v . size ( ) ; i ++ ) { int mn = Math . min ( v . get ( i ) - 1 , k ) ; v . set ( i , v . get ( i ) - mn ) ; k -= mn ; } if ( k > 0 ) { for ( int i = 0 ; i < v . size ( ) ; i ++ ) { int mn = Math . min ( v . get ( i ) , k ) ; v . set ( i , v . get ( i ) - mn ) ; k -= mn ; } } int res = 0 ; for ( int i = 0 ; i < v . size ( ) ; i ++ ) { if ( v . get ( i ) == 1 ) { res ++ ; } } return res ; }
|
g-transeval-java_data_339
|
int findKth ( List < Integer > arr , int n , int k ) { HashSet < Integer > missing = new HashSet < > ( ) ; int count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { missing . add ( arr . get ( i ) ) ; } int maxM = Collections . max ( arr ) ; int minM = Collections . min ( arr ) ; for ( int i = minM + 1 ; i < maxM ; i ++ ) { if ( ! missing . contains ( i ) ) { count ++ ; } if ( count == k ) { return i ; } } return - 1 ; }
|
g-transeval-java_data_340
|
boolean almostSort ( List < Integer > a , int n ) { for ( int i = 0 ; i < n - 1 ; i ++ ) { if ( a . get ( i ) > a . get ( i + 1 ) ) { Collections . swap ( a , i , i + 1 ) ; i ++ ; } } for ( int i = 0 ; i < n - 1 ; i ++ ) { if ( a . get ( i ) > a . get ( i + 1 ) ) { return false ; } } return true ; }
|
g-transeval-java_data_341
|
int maximumSum ( String s , int n , int k ) { int sum = 0 ; List < Integer > freq = new ArrayList < > ( Collections . nCopies ( 256 , 0 ) ) ; for ( int i = 0 ; i < n ; i ++ ) { freq . set ( s . charAt ( i ) , freq . get ( s . charAt ( i ) ) + 1 ) ; } freq . sort ( Collections . reverseOrder ( ) ) ; for ( int i = 0 ; i < 256 ; i ++ ) { if ( k > freq . get ( i ) ) { sum += freq . get ( i ) * freq . get ( i ) ; k -= freq . get ( i ) ; } else { sum += freq . get ( i ) * k ; break ; } } return sum ; }
|
g-transeval-java_data_342
|
int findMinOperations ( List < Integer > arr , int N , int K ) { int operations = 0 ; for ( int i = 0 ; i < K ; i ++ ) { Map < Integer , Integer > freq = new HashMap < > ( ) ; for ( int j = i ; j < N ; j += K ) { freq . put ( arr . get ( j ) , freq . getOrDefault ( arr . get ( j ) , 0 ) + 1 ) ; } int max1 = 0 , num = 0 ; for ( var entry : freq . entrySet ( ) ) { if ( entry . getValue ( ) > max1 ) { max1 = entry . getValue ( ) ; num = entry . getKey ( ) ; } } for ( var entry : freq . entrySet ( ) ) { if ( entry . getKey ( ) != num ) { operations += entry . getValue ( ) ; } } } return operations ; }
|
g-transeval-java_data_343
|
List < String > subString ( String s , int n ) { List < String > v = new ArrayList < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { for ( int len = 1 ; len <= n - i ; len ++ ) { String find = s . substring ( i , i + len ) ; v . add ( find ) ; } } return v ; }
|
g-transeval-java_data_344
|
boolean checkUniqueFrequency ( List < Integer > arr , int n ) { Map < Integer , Integer > freq = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { freq . put ( arr . get ( i ) , freq . getOrDefault ( arr . get ( i ) , 0 ) + 1 ) ; } Set < Integer > uniqueFreq = new HashSet < > ( ) ; for ( var entry : freq . entrySet ( ) ) { if ( uniqueFreq . contains ( entry . getValue ( ) ) ) { return false ; } else { uniqueFreq . add ( entry . getValue ( ) ) ; } } return true ; }
|
g-transeval-java_data_345
|
int minCost ( String str1 , String str2 , int n ) { int cost = 0 ; char [ ] tmp = str1 . toCharArray ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( tmp [ i ] != str2 . charAt ( i ) ) { if ( i < n - 1 && tmp [ i + 1 ] != str2 . charAt ( i + 1 ) ) { char c = tmp [ i ] ; tmp [ i ] = tmp [ i + 1 ] ; tmp [ i + 1 ] = c ; cost ++ ; } else { cost ++ ; } } } return cost ; }
|
g-transeval-java_data_346
|
boolean isValidNum ( String x ) { Map < Integer , Integer > mp = new HashMap < > ( ) ; for ( int i = 0 ; i < x . length ( ) ; i ++ ) { if ( mp . containsKey ( x . charAt ( i ) - '0' ) ) { return false ; } else if ( x . charAt ( i ) - '0' > 5 ) { return false ; } else { mp . put ( x . charAt ( i ) - '0' , 1 ) ; } } return true ; }
|
g-transeval-java_data_347
|
int minimizeDiff ( List < Integer > arr , int n , int k ) { int max = Collections . max ( arr ) ; int min = Collections . min ( arr ) ; if ( max - min <= k ) { return max - min ; } int avg = ( max + min ) / 2 ; for ( int i = 0 ; i < n ; i ++ ) { if ( arr . get ( i ) > avg ) { arr . set ( i , arr . get ( i ) - k ) ; } else { arr . set ( i , arr . get ( i ) + k ) ; } } max = Collections . max ( arr ) ; min = Collections . min ( arr ) ; return max - min ; }
|
g-transeval-java_data_348
|
int getMinCost ( List < Integer > arr , int n ) { int minEle = Collections . min ( arr ) ; return minEle * ( n - 1 ) ; }
|
g-transeval-java_data_349
|
boolean possibility ( Map < Integer , Integer > m , int length , String s ) { int countOdd = 0 ; for ( int i = 0 ; i < length ; i ++ ) { if ( ( m . get ( s . charAt ( i ) - '0' ) & 1 ) != 0 ) { countOdd ++ ; } if ( countOdd > 1 ) { return false ; } } return true ; }
|
g-transeval-java_data_350
|
int minimumCostOfBreaking ( List < Integer > x , List < Integer > y , int m , int n ) { int res = 0 ; x . sort ( Collections . reverseOrder ( ) ) ; y . sort ( Collections . reverseOrder ( ) ) ; int hzntl = 1 , vert = 1 ; int i = 0 , j = 0 ; while ( i < m && j < n ) { if ( x . get ( i ) > y . get ( j ) ) { res += x . get ( i ) * vert ; hzntl ++ ; i ++ ; } else { res += y . get ( j ) * hzntl ; vert ++ ; j ++ ; } } int total = 0 ; while ( i < m ) { total += x . get ( i ++ ) ; } res += total * vert ; total = 0 ; while ( j < n ) { total += y . get ( j ++ ) ; } res += total * hzntl ; return res ; }
|
g-transeval-java_data_351
|
int findMaximumScore ( List < Integer > a , int n ) { Map < Integer , Integer > freq = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( freq . containsKey ( a . get ( i ) ) ) { freq . put ( a . get ( i ) , freq . get ( a . get ( i ) ) + 1 ) ; } else { freq . put ( a . get ( i ) , 1 ) ; } } int [ ] dp = new int [ Collections . max ( a ) + 1 ] ; dp [ 0 ] = 0 ; dp [ 1 ] = freq . getOrDefault ( 1 , 0 ) ; for ( int i = 2 ; i < dp . length ; i ++ ) { dp [ i ] = Math . max ( dp [ i - 1 ] , dp [ i - 2 ] + freq . getOrDefault ( i , 0 ) * i ) ; } return dp [ dp . length - 1 ] ; }
|
g-transeval-java_data_352
|
int countWays ( String s , String t , int k , int mod ) { int n = s . length ( ) ; int a = 0 , b = 0 ; for ( int i = 0 ; i < n ; i ++ ) { String p = s . substring ( i , n ) + s . substring ( 0 , i ) ; if ( p . equals ( t ) ) { a ++ ; } else { b ++ ; } } int [ ] dp1 = new int [ k + 1 ] ; int [ ] dp2 = new int [ k + 1 ] ; if ( s . equals ( t ) ) { dp1 [ 0 ] = 1 ; dp2 [ 0 ] = 0 ; } else { dp1 [ 0 ] = 0 ; dp2 [ 0 ] = 1 ; } for ( int i = 1 ; i <= k ; i ++ ) { dp1 [ i ] = ( ( dp1 [ i - 1 ] * ( a - 1 ) ) % mod + ( dp2 [ i - 1 ] * a ) % mod ) % mod ; dp2 [ i ] = ( ( dp1 [ i - 1 ] * ( b ) ) % mod + ( dp2 [ i - 1 ] * ( b - 1 ) ) % mod ) % mod ; } return dp1 [ k ] ; }
|
g-transeval-java_data_353
|
int findSubarraySum ( List < Integer > arr , int n , int k ) { Map < Integer , Integer > prevSum = new HashMap < > ( ) ; int res = 0 ; int currSum = 0 ; for ( int i = 0 ; i < n ; i ++ ) { currSum += arr . get ( i ) ; if ( currSum == k ) { res ++ ; } if ( prevSum . containsKey ( currSum - k ) ) { res += prevSum . get ( currSum - k ) ; } prevSum . put ( currSum , prevSum . getOrDefault ( currSum , 0 ) + 1 ) ; } return res ; }
|
g-transeval-java_data_354
|
int maximumOccurrence ( String s ) { int n = s . length ( ) ; Map < String , Integer > freq = new HashMap < > ( ) ; int i , j ; for ( i = 0 ; i < n ; i ++ ) { String temp = "" ; temp += s . charAt ( i ) ; freq . put ( temp , freq . getOrDefault ( temp , 0 ) + 1 ) ; } for ( i = 0 ; i < n ; i ++ ) { for ( j = i + 1 ; j < n ; j ++ ) { String temp = "" ; temp += s . charAt ( i ) ; temp += s . charAt ( j ) ; freq . put ( temp , freq . getOrDefault ( temp , 0 ) + 1 ) ; } } int answer = Integer . MIN_VALUE ; for ( var entry : freq . entrySet ( ) ) { answer = Math . max ( answer , entry . getValue ( ) ) ; } return answer ; }
|
g-transeval-java_data_355
|
int countCharacters ( List < String > strings , String chars ) { int res = 0 ; Map < Character , Integer > freq = new HashMap < > ( ) ; for ( int i = 0 ; i < chars . length ( ) ; i ++ ) { freq . put ( chars . charAt ( i ) , freq . getOrDefault ( chars . charAt ( i ) , 0 ) + 1 ) ; } for ( String st : strings ) { boolean flag = true ; for ( char c : st . toCharArray ( ) ) { if ( ! freq . containsKey ( c ) ) { flag = false ; break ; } } if ( flag ) { res += st . length ( ) ; } } return res ; }
|
g-transeval-java_data_356
|
int distinctSubstring ( String p , String q , int k , int n ) { Set < String > ss = new HashSet < > ( ) ; for ( int i = 0 ; i < n ; ++ i ) { int sum = 0 ; String s = "" ; for ( int j = i ; j < n ; ++ j ) { int pos = p . charAt ( j ) - 'a' ; sum += q . charAt ( pos ) - '0' ; s += p . charAt ( j ) ; if ( sum <= k ) { ss . add ( s ) ; } else { break ; } } } return ss . size ( ) ; }
|
g-transeval-java_data_357
|
int uniqueMorseRep ( List < String > arr ) { List < String > morseCode = Arrays . asList ( ".-" , "-..." , "-.-." , "-.." , "." , "..-." , "--." , "...." , ".." , ".---" , "-.-" , ".-.." , "--" , "-." , "---" , ".--." , "--.-" , ".-." , "..." , "-" , "..-" , "...-" , ".--" , "-..-" , "-.--" , "--.." ) ; Set < String > st = new HashSet < > ( ) ; int n = arr . size ( ) ; for ( int i = 0 ; i < n ; i ++ ) { String temp = "" ; int m = arr . get ( i ) . length ( ) ; for ( int j = 0 ; j < m ; j ++ ) { temp += morseCode . get ( arr . get ( i ) . charAt ( j ) - 'a' ) ; } st . add ( temp ) ; } return st . size ( ) ; }
|
g-transeval-java_data_358
|
int countSubstrings ( String st , int k ) { int n = st . length ( ) ; int answer = 0 ; Map < Character , Integer > map = new HashMap < > ( ) ; for ( int i = 0 ; i < k ; i ++ ) { if ( ! map . containsKey ( st . charAt ( i ) ) ) { map . put ( st . charAt ( i ) , 1 ) ; } else { map . put ( st . charAt ( i ) , map . get ( st . charAt ( i ) ) + 1 ) ; } } if ( map . size ( ) == k ) { answer ++ ; } for ( int i = k ; i < n ; i ++ ) { if ( ! map . containsKey ( st . charAt ( i ) ) ) { map . put ( st . charAt ( i ) , 1 ) ; } else { map . put ( st . charAt ( i ) , map . get ( st . charAt ( i ) ) + 1 ) ; } map . put ( st . charAt ( i - k ) , map . get ( st . charAt ( i - k ) ) - 1 ) ; if ( map . get ( st . charAt ( i - k ) ) == 0 ) { map . remove ( st . charAt ( i - k ) ) ; } if ( map . size ( ) == k ) { answer ++ ; } } return answer ; }
|
g-transeval-java_data_359
|
boolean canConstruct ( String s , int k ) { Map < Character , Integer > m = new HashMap < > ( ) ; int p = 0 ; if ( s . length ( ) == k ) { return true ; } for ( int i = 0 ; i < s . length ( ) ; i ++ ) { m . put ( s . charAt ( i ) , m . getOrDefault ( s . charAt ( i ) , 0 ) + 1 ) ; } if ( k > s . length ( ) ) { return false ; } else { for ( var h : m . entrySet ( ) ) { if ( h . getValue ( ) % 2 != 0 ) { p = p + 1 ; } } } if ( k < p ) { return false ; } return true ; }
|
g-transeval-java_data_360
|
boolean equalIgnoreCase ( String str1 , String str2 ) { str1 = str1 . toUpperCase ( ) ; str2 = str2 . toUpperCase ( ) ; return str1 . equals ( str2 ) ; }
|
g-transeval-java_data_361
|
int findLongestSub ( String bin ) { int n = bin . length ( ) , i ; int sum = 0 ; HashMap < Integer , Integer > prevSum = new HashMap < > ( ) ; int maxLen = 0 ; for ( i = 0 ; i < n ; i ++ ) { if ( bin . charAt ( i ) == '1' ) { sum ++ ; } else { sum -- ; } if ( sum > 0 ) { maxLen = i + 1 ; } else if ( sum <= 0 ) { if ( prevSum . containsKey ( sum - 1 ) ) { int currLen = i - prevSum . get ( sum - 1 ) ; maxLen = Math . max ( maxLen , currLen ) ; } } if ( ! prevSum . containsKey ( sum ) ) { prevSum . put ( sum , i ) ; } } return maxLen ; }
|
g-transeval-java_data_362
|
boolean hasAllCodes ( String s , int k ) { Set < String > us = new HashSet < > ( ) ; for ( int i = 0 ; i + k <= s . length ( ) ; i ++ ) { us . add ( s . substring ( i , i + k ) ) ; } return us . size ( ) == 1 << k ; }
|
g-transeval-java_data_363
|
boolean checkPalin ( String word ) { int n = word . length ( ) ; word = word . toLowerCase ( ) ; for ( int i = 0 ; i < n ; i ++ , n -- ) { if ( word . charAt ( i ) != word . charAt ( n - 1 ) ) { return false ; } } return true ; }
|
g-transeval-java_data_364
|
String convert ( String st ) { String w = "" , z = "" ; st = st . toUpperCase ( ) + " " ; for ( int i = 0 ; i < st . length ( ) ; i ++ ) { char ch = st . charAt ( i ) ; if ( ch != ' ' ) { w += ch ; } else { z += Character . toLowerCase ( w . charAt ( 0 ) ) + w . substring ( 1 ) + " " ; w = "" ; } } return z ; }
|
g-transeval-java_data_365
|
int maxLines ( int n , List < Integer > x1 , List < Integer > y1 , List < Integer > x2 , List < Integer > y2 ) { Set < Double > s = new HashSet < > ( ) ; double slope ; for ( int i = 0 ; i < n ; ++ i ) { if ( x1 . get ( i ) == x2 . get ( i ) ) { slope = Integer . MAX_VALUE ; } else { slope = ( y2 . get ( i ) - y1 . get ( i ) ) * 1.0 / ( x2 . get ( i ) - x1 . get ( i ) ) ; } s . add ( slope ) ; } return s . size ( ) ; }
|
g-transeval-java_data_366
|
HashMap < Integer , Integer > PrimeFactor ( int n ) { HashMap < Integer , Integer > primef = new HashMap < > ( ) ; while ( n % 2 == 0 ) { if ( primef . containsKey ( 2 ) ) { primef . put ( 2 , primef . get ( 2 ) + 1 ) ; } else { primef . put ( 2 , 1 ) ; } n /= 2 ; } for ( int i = 3 ; i <= Math . sqrt ( n ) ; i ++ ) { while ( n % i == 0 ) { if ( primef . containsKey ( i ) ) { primef . put ( i , primef . get ( i ) + 1 ) ; } else { primef . put ( i , 1 ) ; } n /= i ; } } if ( n > 2 ) { primef . put ( n , 1 ) ; } return primef ; }
|
g-transeval-java_data_367
|
String isDivisibleByDivisor ( int s , int d ) { s %= d ; Set < Integer > hashMap = new HashSet < > ( ) ; hashMap . add ( s ) ; for ( int i = 0 ; i <= d ; i ++ ) { s += s % d ; s %= d ; if ( hashMap . contains ( s ) ) { if ( s == 0 ) { return "Yes" ; } return "No" ; } else { hashMap . add ( s ) ; } } return "Yes" ; }
|
g-transeval-java_data_368
|
boolean oddSum ( List < Integer > a , int n , int k ) { Set < Integer > odd = new HashSet < > ( ) ; Set < Integer > even = new HashSet < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( a . get ( i ) % 2 == 0 ) { even . add ( a . get ( i ) ) ; } else { odd . add ( a . get ( i ) ) ; } } if ( odd . size ( ) >= k ) { return true ; } boolean flag = false ; for ( int i = 1 ; i < k ; i += 2 ) { int needed = k - i ; if ( needed <= even . size ( ) ) { return true ; } } return flag ; }
|
g-transeval-java_data_369
|
int dayOfYear ( String date ) { List < Integer > days = Arrays . asList ( 31 , 28 , 31 , 30 , 31 , 30 , 31 , 31 , 30 , 31 , 30 , 31 ) ; int year = Integer . parseInt ( date . substring ( 0 , 4 ) ) ; int month = Integer . parseInt ( date . substring ( 5 , 7 ) ) ; int day = Integer . parseInt ( date . substring ( 8 ) ) ; if ( month > 2 && year % 4 == 0 && ( year % 100 != 0 || year % 400 == 0 ) ) { ++ day ; } while ( month > 1 ) { day = day + days . get ( month - 2 ) ; -- month ; } return day ; }
|
g-transeval-java_data_370
|
boolean isPerfectSquare ( List < Integer > arr , int n ) { HashMap < Integer , Integer > umap = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { umap . put ( arr . get ( i ) , umap . getOrDefault ( arr . get ( i ) , 0 ) + 1 ) ; } for ( var itr : umap . entrySet ( ) ) { if ( itr . getValue ( ) % 2 == 1 ) { return false ; } } return true ; }
|
g-transeval-java_data_371
|
int minMoves ( int n ) { String s = Integer . toString ( n ) ; int ans = Integer . MAX_VALUE ; int length = s . length ( ) ; for ( int i = 0 ; i < length ; ++ i ) { for ( int j = 0 ; j < length ; ++ j ) { if ( i == j ) { continue ; } char [ ] t = s . toCharArray ( ) ; int cur = 0 ; for ( int k = i ; k < length - 1 ; ++ k ) { char c = t [ k ] ; t [ k ] = t [ k + 1 ] ; t [ k + 1 ] = c ; ++ cur ; } for ( int k = j - ( j > i ? 1 : 0 ) ; k < length - 2 ; ++ k ) { char c = t [ k ] ; t [ k ] = t [ k + 1 ] ; t [ k + 1 ] = c ; ++ cur ; } int pos = - 1 ; for ( int k = 0 ; k < length ; ++ k ) { if ( t [ k ] != '0' ) { pos = k ; break ; } } for ( int k = pos ; k > 0 ; -- k ) { char c = t [ k ] ; t [ k ] = t [ k - 1 ] ; t [ k - 1 ] = c ; ++ cur ; } int nn = Integer . parseInt ( String . valueOf ( t ) ) ; if ( nn % 25 == 0 ) { ans = Math . min ( ans , cur ) ; } } } if ( ans == Integer . MAX_VALUE ) { return - 1 ; } return ans ; }
|
g-transeval-java_data_372
|
int minimumOperations ( List < Integer > a , int n ) { HashMap < Integer , Integer > mp = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { mp . put ( a . get ( i ) , mp . getOrDefault ( a . get ( i ) , 0 ) + 1 ) ; } int count = 0 ; for ( var entry : mp . entrySet ( ) ) { if ( entry . getValue ( ) > 1 ) { count += entry . getValue ( ) - 1 ; } } return count ; }
|
g-transeval-java_data_373
|
int kaprekarRec ( int n , int prev ) { if ( n == 0 ) { return 0 ; } prev = n ; int [ ] digits = new int [ 4 ] ; for ( int i = 0 ; i < 4 ; i ++ ) { digits [ i ] = n % 10 ; n = n / 10 ; } Arrays . sort ( digits ) ; int asc = 0 ; for ( int i = 0 ; i < 4 ; i ++ ) { asc = asc * 10 + digits [ i ] ; } Arrays . sort ( digits ) ; int desc = 0 ; for ( int i = 3 ; i >= 0 ; i -- ) { desc = desc * 10 + digits [ i ] ; } int diff = Math . abs ( asc - desc ) ; if ( diff == prev ) { return diff ; } return kaprekarRec ( diff , prev ) ; }
|
g-transeval-java_data_374
|
String fractionToDecimal ( int numr , int denr ) { String res = "" ; HashMap < Integer , Integer > mp = new HashMap < > ( ) ; int rem = numr % denr ; while ( rem != 0 && ! mp . containsKey ( rem ) ) { mp . put ( rem , res . length ( ) ) ; rem = rem * 10 ; int resPart = rem / denr ; res += String . valueOf ( resPart ) ; rem = rem % denr ; } if ( rem == 0 ) { return "" ; } if ( mp . containsKey ( rem ) ) { return res . substring ( mp . get ( rem ) ) ; } return "" ; }
|
g-transeval-java_data_375
|
boolean isFancy ( String num ) { Map < Character , Character > fp = new HashMap < Character , Character > ( ) ; fp . put ( '0' , '0' ) ; fp . put ( '1' , '1' ) ; fp . put ( '6' , '9' ) ; fp . put ( '8' , '8' ) ; fp . put ( '9' , '6' ) ; int n = num . length ( ) ; int l = 0 , r = n - 1 ; while ( l <= r ) { if ( ! fp . containsKey ( num . charAt ( l ) ) || fp . get ( num . charAt ( l ) ) != num . charAt ( r ) ) { return false ; } l ++ ; r -- ; } return true ; }
|
g-transeval-java_data_376
|
double distinctOddRatio ( List < Integer > numbers ) { int distinctCount = ( int ) numbers . stream ( ) . distinct ( ) . count ( ) ; int distinctOddCount = ( int ) numbers . stream ( ) . distinct ( ) . filter ( n -> n % 2 == 1 ) . count ( ) ; return ( double ) distinctOddCount / distinctCount ; }
|
g-transeval-java_data_377
|
int compareSum ( List < Integer > numbers , List < String > words ) { int intSum = numbers . stream ( ) . mapToInt ( n -> n ) . sum ( ) ; int wordLengthSum = words . stream ( ) . mapToInt ( String :: length ) . sum ( ) ; if ( intSum < wordLengthSum ) { return - 1 ; } if ( intSum > wordLengthSum ) { return 1 ; } return 0 ; }
|
g-transeval-java_data_378
|
boolean allLongerThan ( List < String > shortWords , List < String > longWords ) { int maxOfShort = shortWords . stream ( ) . mapToInt ( String :: length ) . max ( ) . getAsInt ( ) ; int minOfLong = longWords . stream ( ) . mapToInt ( String :: length ) . min ( ) . getAsInt ( ) ; return minOfLong > maxOfShort ; }
|
g-transeval-java_data_379
|
int compareOddEvenRange ( List < Integer > numbers ) { int rangeOdd = numbers . stream ( ) . filter ( n -> n % 2 == 1 ) . mapToInt ( n -> n ) . max ( ) . getAsInt ( ) - numbers . stream ( ) . filter ( n -> n % 2 == 1 ) . mapToInt ( n -> n ) . min ( ) . getAsInt ( ) ; int rangeEven = numbers . stream ( ) . filter ( n -> n % 2 == 0 ) . mapToInt ( n -> n ) . max ( ) . getAsInt ( ) - numbers . stream ( ) . filter ( n -> n % 2 == 0 ) . mapToInt ( n -> n ) . min ( ) . getAsInt ( ) ; if ( rangeOdd < rangeEven ) { return - 1 ; } if ( rangeOdd > rangeEven ) { return 1 ; } return 0 ; }
|
g-transeval-java_data_380
|
double averageDistinctLength ( List < String > words ) { double averageLen = words . stream ( ) . distinct ( ) . mapToInt ( String :: length ) . average ( ) . getAsDouble ( ) ; return averageLen ; }
|
g-transeval-java_data_381
|
int withDrawBalance ( int start , List < Integer > withdrawals ) { int end = withdrawals . stream ( ) . reduce ( start , ( balance , nextWithdrawal ) -> nextWithdrawal <= balance ? balance - nextWithdrawal : balance ) ; return end ; }
|
g-transeval-java_data_382
|
String firstShortAndStartsWithO ( List < String > words ) { String matchedElement = words . stream ( ) . filter ( w -> w . length ( ) < 5 ) . filter ( w -> w . charAt ( 0 ) == 'o' ) . findFirst ( ) . orElse ( "" ) ; return matchedElement ; }
|
g-transeval-java_data_383
|
int bigNumberAtIndex ( List < Integer > numbers , int index ) { int targetNum = numbers . stream ( ) . filter ( n -> n > 5 ) . skip ( index ) . findFirst ( ) . get ( ) ; return targetNum ; }
|
g-transeval-java_data_384
|
boolean containsSquareInRange ( int rangeStart , int rangeLength ) { boolean containsSquare = IntStream . range ( rangeStart , rangeStart + rangeLength ) . anyMatch ( n -> Math . pow ( ( int ) Math . sqrt ( n ) , 2 ) == n ) ; return containsSquare ; }
|
g-transeval-java_data_385
|
Map < Integer , List < Integer > > groupNumbersByMod ( List < Integer > numbers , int mod ) { var numberGroups = numbers . stream ( ) . collect ( Collectors . groupingBy ( n -> n % mod ) ) ; return numberGroups ; }
|
g-transeval-java_data_386
|
Map < Character , List < String > > groupWordsByFirstChar ( List < String > words ) { var wordGroups = words . stream ( ) . collect ( Collectors . groupingBy ( w -> w . charAt ( 0 ) ) ) ; return wordGroups ; }
|
g-transeval-java_data_387
|
List < String > orderByLengthAndDescending ( List < String > words ) { var sortedWords = words . stream ( ) . sorted ( Comparator . comparingInt ( String :: length ) . thenComparing ( Comparator . reverseOrder ( ) ) ) . collect ( Collectors . toList ( ) ) ; return sortedWords ; }
|
g-transeval-java_data_388
|
List < String > orderFirstCharDescendingReverse ( List < String > words ) { var sortedWords = words . stream ( ) . sorted ( Comparator . comparing ( ( String w ) -> w . charAt ( 0 ) ) . reversed ( ) . thenComparing ( Comparator . naturalOrder ( ) ) ) . collect ( Collectors . toList ( ) ) ; Collections . reverse ( sortedWords ) ; return sortedWords ; }
|
g-transeval-java_data_389
|
List < Integer > getSubListOfNegative ( List < Integer > numbers , int start , int length ) { List < Integer > subList = numbers . stream ( ) . skip ( start ) . filter ( n -> n < 0 ) . limit ( length ) . collect ( Collectors . toList ( ) ) ; return subList ; }
|
g-transeval-java_data_390
|
List < Integer > getPositiveSequence ( List < Integer > numbers ) { List < Integer > subSequence = numbers . stream ( ) . dropWhile ( n -> n <= 0 ) . takeWhile ( n -> n >= 0 ) . collect ( Collectors . toList ( ) ) ; return subSequence ; }
|
g-transeval-java_data_391
|
List < Integer > getLargerThanIndexSequence ( List < Integer > numbers ) { List < Integer > subSequence = IntStream . range ( 0 , numbers . size ( ) ) . dropWhile ( i -> numbers . get ( i ) < i ) . takeWhile ( i -> numbers . get ( i ) >= i ) . mapToObj ( i -> numbers . get ( i ) ) . collect ( Collectors . toList ( ) ) ; return subSequence ; }
|
g-transeval-java_data_392
|
List < String > rearrangeWordByIndexes ( List < String > words , List < Integer > indexes ) { List < Integer > newIndexes = indexes . stream ( ) . filter ( n -> n >= words . size ( ) ) . map ( n -> n % words . size ( ) ) . toList ( ) ; List < String > newWords = newIndexes . stream ( ) . map ( n -> words . get ( n ) ) . toList ( ) ; return newWords ; }
|
g-transeval-java_data_393
|
List < List < String > > getWordsUpperLower ( List < String > words ) { var upperLowerWords = words . stream ( ) . map ( w -> Arrays . asList ( w . toUpperCase ( ) , w . toLowerCase ( ) ) ) . collect ( Collectors . toList ( ) ) ; return upperLowerWords ; }
|
g-transeval-java_data_394
|
List < Boolean > selectIfInPlace ( List < Integer > numbers ) { List < Boolean > numsInPlace = IntStream . range ( 0 , numbers . size ( ) ) . mapToObj ( index -> numbers . get ( index ) == index ) . collect ( Collectors . toList ( ) ) ; return numsInPlace ; }
|
g-transeval-java_data_395
|
List < List < Integer > > selectPairs ( List < Integer > numbersA , List < Integer > numbersB ) { List < List < Integer > > pairs = numbersA . stream ( ) . flatMap ( a -> numbersB . stream ( ) . filter ( b -> a < b ) . map ( b -> Arrays . asList ( a , b ) ) ) . collect ( Collectors . toList ( ) ) ; return pairs ; }
|
g-transeval-java_data_396
|
List < String > stringCrossJoin ( List < String > endWords , List < String > beginWords ) { List < String > crossStrings = beginWords . stream ( ) . flatMap ( b -> endWords . stream ( ) . filter ( e -> b . charAt ( 0 ) == e . charAt ( e . length ( ) - 1 ) ) . map ( e -> e + " " + b ) ) . collect ( Collectors . toList ( ) ) ; return crossStrings ; }
|
g-transeval-java_data_397
|
int elementsContainSubword ( List < String > words , String subword ) { if ( words . stream ( ) . limit ( 5 ) . allMatch ( w -> w . contains ( subword ) ) ) { return 1 ; } else if ( words . stream ( ) . limit ( 5 ) . anyMatch ( w -> w . contains ( subword ) ) ) { return 0 ; } else { return - 1 ; } }
|
g-transeval-java_data_398
|
List < Integer > ConcatLargeNumbers ( List < Integer > numbersA , List < Integer > numbersB , int flag ) { List < Integer > allNumbers = Stream . concat ( numbersA . stream ( ) . filter ( n -> n > flag ) , numbersB . stream ( ) . filter ( n -> n > flag ) ) . collect ( Collectors . toList ( ) ) ; return allNumbers ; }
|
g-transeval-java_data_399
|
int DotProduct ( List < Integer > vectorA , List < Integer > vectorB ) { int dotProduct = IntStream . range ( 0 , vectorA . size ( ) ) . map ( i -> vectorA . get ( i ) * vectorB . get ( i ) ) . sum ( ) ; return dotProduct ; }
|
g-transeval-java_data_400
|
List < Integer > SetDifference ( List < Integer > setA , List < Integer > setB ) { List < Integer > difference = new ArrayList < > ( setA ) ; difference . addAll ( setB ) ; List < Integer > intersection = new ArrayList < > ( setA ) ; intersection . retainAll ( setB ) ; difference . removeAll ( intersection ) ; Collections . sort ( difference ) ; return difference ; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.