id
stringlengths 23
25
| content
stringlengths 46
1.27k
|
|---|---|
g-transeval-java_data_201
|
String intToMiniRoman ( int number ) { List < Integer > num = Arrays . asList ( 1000 , 900 , 500 , 400 , 100 , 90 , 50 , 40 , 10 , 9 , 5 , 4 , 1 ) ; List < String > sym = Arrays . asList ( "m" , "cm" , "d" , "cd" , "c" , "xc" , "l" , "xl" , "x" , "ix" , "v" , "iv" , "i" ) ; int pos = 0 ; StringBuilder res = new StringBuilder ( ) ; while ( number > 0 ) { while ( number >= num . get ( pos ) ) { res . append ( sym . get ( pos ) ) ; number -= num . get ( pos ) ; } if ( number > 0 ) { pos += 1 ; } } return res . toString ( ) ; }
|
g-transeval-java_data_202
|
List < Integer > eat ( int number , int need , int remaining ) { return need > remaining ? Arrays . asList ( number + remaining , 0 ) : Arrays . asList ( number + need , remaining - need ) ; }
|
g-transeval-java_data_203
|
int doAlgebra ( List < String > ops , List < Integer > operands ) { List < Integer > nums = new ArrayList < > ( operands ) ; List < String > currentOps = new ArrayList < > ( ops ) ; int i = currentOps . size ( ) - 1 ; while ( i >= 0 ) { if ( currentOps . get ( i ) . equals ( "**" ) ) { nums . set ( i , ( int ) Math . pow ( nums . get ( i ) , nums . get ( i + 1 ) ) ) ; nums . remove ( i + 1 ) ; currentOps . remove ( i ) ; } i -- ; } i = 0 ; while ( i < currentOps . size ( ) ) { if ( currentOps . get ( i ) . equals ( "*" ) ) { nums . set ( i , nums . get ( i ) * nums . get ( i + 1 ) ) ; nums . remove ( i + 1 ) ; currentOps . remove ( i ) ; } else if ( currentOps . get ( i ) . equals ( "//" ) ) { nums . set ( i , nums . get ( i ) / nums . get ( i + 1 ) ) ; nums . remove ( i + 1 ) ; currentOps . remove ( i ) ; } else { i ++ ; } } i = 0 ; while ( i < currentOps . size ( ) ) { if ( currentOps . get ( i ) . equals ( "+" ) ) { nums . set ( i , nums . get ( i ) + nums . get ( i + 1 ) ) ; nums . remove ( i + 1 ) ; currentOps . remove ( i ) ; } else if ( currentOps . get ( i ) . equals ( "-" ) ) { nums . set ( i , nums . get ( i ) - nums . get ( i + 1 ) ) ; nums . remove ( i + 1 ) ; currentOps . remove ( i ) ; } else { i ++ ; } } return nums . get ( 0 ) ; }
|
g-transeval-java_data_204
|
List < Integer > generateIntegers ( int a , int b ) { int lower = Math . max ( 2 , Math . min ( a , b ) ) ; int upper = Math . min ( 8 , Math . max ( a , b ) ) ; List < Integer > result = new ArrayList < > ( ) ; for ( int i = lower ; i <= upper ; i += 2 ) { result . add ( i ) ; } return result ; }
|
g-transeval-java_data_205
|
boolean isStepNum ( int n ) { int prevDigit = - 1 ; while ( n > 0 ) { int curDigit = n % 10 ; if ( prevDigit != - 1 ) { if ( Math . abs ( curDigit - prevDigit ) != 1 ) { return false ; } } n /= 10 ; prevDigit = curDigit ; } return true ; }
|
g-transeval-java_data_206
|
int numOfWays ( int n , int k ) { int p = 1 ; if ( k % 2 != 0 ) { p = - 1 ; } return ( int ) ( Math . pow ( n - 1 , k ) + p * ( n - 1 ) ) / n ; }
|
g-transeval-java_data_207
|
List < Integer > findDivisors ( int n ) { List < Integer > v = new ArrayList < > ( ) ; for ( int i = 1 ; i <= Math . sqrt ( n ) ; i ++ ) { if ( n % i == 0 ) { if ( n / i == i ) { v . add ( i ) ; } else { v . add ( i ) ; v . add ( n / i ) ; } } } return v ; }
|
g-transeval-java_data_208
|
int eggDrop ( int n , int k ) { if ( k == 1 || k == 0 ) { return k ; } if ( n == 1 ) { return k ; } int min = Integer . MAX_VALUE ; int x , res ; for ( x = 1 ; x <= k ; x ++ ) { res = Math . max ( eggDrop ( n - 1 , x - 1 ) , eggDrop ( n , k - x ) ) ; if ( res < min ) { min = res ; } } return min + 1 ; }
|
g-transeval-java_data_209
|
boolean isPowerOfTwo ( int n ) { if ( n == 0 ) { return false ; } return Math . ceil ( Math . log ( n ) / Math . log ( 2 ) ) == Math . floor ( Math . log ( n ) / Math . log ( 2 ) ) ; }
|
g-transeval-java_data_210
|
String shortestPalindrome ( String s ) { int n = s . length ( ) ; List < String > v = new ArrayList < String > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { int l = i ; int r = i ; String ans1 = "" ; String ans2 = "" ; while ( l >= 0 && r < n && s . charAt ( l ) == s . charAt ( r ) ) { ans1 += s . charAt ( l ) ; l -- ; r ++ ; } l = i - 1 ; r = i ; while ( l >= 0 && r < n && s . charAt ( l ) == s . charAt ( r ) ) { ans2 += s . charAt ( l ) ; l -- ; r ++ ; } v . add ( ans1 ) ; v . add ( ans2 ) ; } String ans = v . get ( 0 ) ; for ( int i = 0 ; i < v . size ( ) ; i ++ ) { if ( v . get ( i ) != "" ) { if ( ans . charAt ( 0 ) >= v . get ( i ) . charAt ( 0 ) ) { ans = v . get ( i ) ; } } } return ans ; }
|
g-transeval-java_data_211
|
int minimumAdjacentDifference ( List < Integer > a , int n , int k ) { int minDiff = Integer . MAX_VALUE ; for ( int i = 0 ; i <= k ; i ++ ) { int maxDiff = Integer . MIN_VALUE ; for ( int j = 0 ; j < n - k - 1 ; j ++ ) { for ( int p = i ; p <= i + j ; p ++ ) { maxDiff = Math . max ( maxDiff , a . get ( p + 1 ) - a . get ( p ) ) ; } } minDiff = Math . min ( minDiff , maxDiff ) ; } return minDiff ; }
|
g-transeval-java_data_212
|
int cal ( List < Integer > arr , int mid ) { int chocolate = 0 ; for ( var i : arr ) { if ( i >= mid ) { chocolate += i - mid ; } } return chocolate ; }
|
g-transeval-java_data_213
|
boolean check ( int v , List < Integer > a , int m ) { int tec = 0 , ans = 0 ; List < Integer > b = new ArrayList < > ( Collections . nCopies ( a . size ( ) + 3 , 0 ) ) ; for ( int i = 0 ; i < a . size ( ) ; i ++ ) { tec -= b . get ( i ) ; if ( a . get ( i ) + tec < v ) { int mov = v - a . get ( i ) - tec ; ans = ans + mov ; tec += mov ; b . set ( i + 2 , mov ) ; } } return ans <= m ; }
|
g-transeval-java_data_214
|
int largestNum ( List < Integer > arr ) { int res = 0 ; Collections . sort ( arr ) ; int l = 0 , r = arr . size ( ) - 1 ; while ( l < r ) { int sum = arr . get ( l ) + arr . get ( r ) ; if ( sum == 0 ) { res = Math . max ( res , Math . max ( arr . get ( l ) , arr . get ( r ) ) ) ; return res ; } else if ( sum < 0 ) { l ++ ; } else { r -- ; } } return res ; }
|
g-transeval-java_data_215
|
int binarySearch ( List < Integer > p , int n ) { int i = 0 ; int j = p . size ( ) - 1 ; int index = - 1 ; while ( i <= j ) { int mid = i + ( j - i ) / 2 ; if ( p . get ( mid ) >= n ) { index = mid ; j = mid - 1 ; } else { i = mid + 1 ; } } return index ; }
|
g-transeval-java_data_216
|
int findMinLength ( List < Integer > arr ) { int index = arr . size ( ) - 1 ; while ( index > 0 && arr . get ( index ) >= arr . get ( index - 1 ) ) { index -- ; } return index ; }
|
g-transeval-java_data_217
|
int minDigits ( int n , int k ) { int digitsNum = ( int ) Math . floor ( Math . log ( n ) + 1 ) ; int tempSum = 0 ; int temp = digitsNum ; int result = 0 ; int x , v ; int sum = 0 ; int num2 = n ; while ( num2 != 0 ) { sum += num2 % 10 ; num2 /= 10 ; } if ( sum <= k ) { x = 0 ; } else { while ( temp > 0 ) { v = n / ( int ) Math . pow ( 10 , temp - 1 ) ; tempSum += v % 10 ; if ( tempSum >= k ) { v /= 10 ; v ++ ; result = v * ( int ) Math . pow ( 10 , temp ) ; break ; } temp -- ; } x = result - n ; return x ; } return - 1 ; }
|
g-transeval-java_data_218
|
int checkForPerfectSquare ( List < Integer > arr , int i , int j ) { int mid , sum = 0 ; for ( int m = i ; m <= j ; m ++ ) { sum += arr . get ( m ) ; } int low = 0 , high = sum / 2 ; while ( low <= high ) { mid = low + ( high - low ) / 2 ; if ( mid * mid == sum ) { return mid ; } else if ( mid * mid > sum ) { high = mid - 1 ; } else { low = mid + 1 ; } } return - 1 ; }
|
g-transeval-java_data_219
|
int minFlips ( List < List < Integer > > mat , String s ) { int n = mat . size ( ) ; int m = mat . get ( 0 ) . size ( ) ; int count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = 0 ; j < m ; j ++ ) { if ( mat . get ( i ) . get ( j ) != s . charAt ( i + j ) - '0' ) { count ++ ; } } } return count ; }
|
g-transeval-java_data_220
|
List < List < Integer > > constructTree ( int n , List < List < Integer > > edges ) { List < List < Integer > > adjl = new ArrayList < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { adjl . add ( new ArrayList < > ( ) ) ; } for ( var e : edges ) { int u = e . get ( 0 ) ; int v = e . get ( 1 ) ; adjl . get ( u ) . add ( v ) ; adjl . get ( v ) . add ( u ) ; } return adjl ; }
|
g-transeval-java_data_221
|
int findSumOfValues ( int v , List < Integer > parent , List < Integer > valuesChildren ) { int curNode = v ; int sum = 0 ; while ( curNode != - 1 ) { sum += valuesChildren . get ( curNode ) ; curNode = parent . get ( curNode ) ; } return sum ; }
|
g-transeval-java_data_222
|
int getDistinct ( int d , int count ) { int num = 0 ; count = ( int ) Math . pow ( 10 , count - 1 ) ; while ( count > 0 ) { num += count * d ; count /= 10 ; } return num ; }
|
g-transeval-java_data_223
|
boolean isIncreasing ( List < Integer > arr ) { for ( int i = 0 ; i < arr . size ( ) - 1 ; i ++ ) { if ( arr . get ( i ) > arr . get ( i + 1 ) ) { return false ; } } return true ; }
|
g-transeval-java_data_224
|
int minAdjSwaps ( List < List < Integer > > mat ) { int n = mat . size ( ) ; List < Integer > cntZero = new ArrayList < > ( Collections . nCopies ( n , 0 ) ) ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = n - 1 ; j >= 0 && mat . get ( i ) . get ( j ) == 0 ; j -- ) { cntZero . set ( i , cntZero . get ( i ) + 1 ) ; } } int cntSwaps = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( cntZero . get ( i ) < ( n - i - 1 ) ) { int first = i ; while ( first < n && cntZero . get ( first ) < ( n - i - 1 ) ) { first ++ ; } if ( first == n ) { return - 1 ; } while ( first > i ) { Collections . swap ( cntZero , first , first - 1 ) ; first -- ; cntSwaps ++ ; } } } return cntSwaps ; }
|
g-transeval-java_data_225
|
int solve ( List < Integer > values , List < Integer > salary , int mod ) { int ret = 1 ; int amt = 0 ; Collections . sort ( values ) ; Collections . sort ( salary ) ; while ( salary . size ( ) > 0 ) { while ( values . size ( ) > 0 && values . get ( values . size ( ) - 1 ) >= salary . get ( salary . size ( ) - 1 ) ) { amt ++ ; values . remove ( values . size ( ) - 1 ) ; } if ( amt == 0 ) { return 0 ; } ret *= amt -- ; ret %= mod ; salary . remove ( salary . size ( ) - 1 ) ; } return ret ; }
|
g-transeval-java_data_226
|
List < Integer > organizeInOrder ( List < Integer > vec , List < Character > op , int n ) { List < Integer > result = new ArrayList < > ( Collections . nCopies ( n , 0 ) ) ; Collections . sort ( vec ) ; int i = 0 , j = n - 1 , k = 0 ; while ( i <= j && k <= n - 2 ) { if ( op . get ( k ) == '<' ) { result . set ( k , vec . get ( i ++ ) ) ; } else { result . set ( k , vec . get ( j -- ) ) ; } k ++ ; } result . set ( n - 1 , vec . get ( i ) ) ; return result ; }
|
g-transeval-java_data_227
|
int countPoints ( int n , int m , List < Integer > a , List < Integer > b , int x , int y ) { Collections . sort ( a ) ; Collections . sort ( b ) ; int j = 0 ; int count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { while ( j < m ) { if ( a . get ( i ) + y < b . get ( j ) ) { break ; } if ( b . get ( j ) >= a . get ( i ) - x && b . get ( j ) <= a . get ( i ) + y ) { count ++ ; j ++ ; break ; } else { j ++ ; } } } return count ; }
|
g-transeval-java_data_228
|
boolean areSame ( List < Integer > a , List < Integer > b ) { Collections . sort ( a ) ; Collections . sort ( b ) ; return a . equals ( b ) ; }
|
g-transeval-java_data_229
|
int countNumberOfStrings ( String s ) { int n = s . length ( ) - 1 ; int count = ( int ) Math . pow ( 2 , n ) ; return count ; }
|
g-transeval-java_data_230
|
List < Integer > primePower ( int x ) { List < Integer > primePow = new ArrayList < > ( ) ; for ( int i = 2 ; i * i <= x ; i ++ ) { if ( x % i == 0 ) { int p = 1 ; while ( x % i == 0 ) { x /= i ; p *= i ; } primePow . add ( p ) ; } } if ( x > 1 ) { primePow . add ( x ) ; } return primePow ; }
|
g-transeval-java_data_231
|
boolean isPerfect ( int n0 ) { double n = Math . sqrt ( n0 ) ; if ( Math . floor ( n ) != Math . ceil ( n ) ) { return false ; } return true ; }
|
g-transeval-java_data_232
|
int findSum ( int l , int r ) { List < Integer > arr = new ArrayList < > ( ) ; int i = 0 ; int x = 2 ; while ( i <= r ) { arr . add ( i + x ) ; if ( i + 1 <= r ) { arr . add ( i + 1 + x ) ; } x *= - 1 ; i += 2 ; } int sum = 0 ; for ( i = l ; i <= r ; ++ i ) { sum += arr . get ( i ) ; } return sum ; }
|
g-transeval-java_data_233
|
int results ( int n , int k ) { return ( int ) Math . round ( Math . pow ( n , 1.0 / Math . pow ( 2.0 , k ) ) ) ; }
|
g-transeval-java_data_234
|
List < Integer > factors ( int n ) { List < Integer > v = new ArrayList < > ( ) ; v . add ( 1 ) ; for ( int i = 2 ; i <= Math . sqrt ( n ) ; i ++ ) { if ( n % i == 0 ) { v . add ( i ) ; if ( n / i != i ) { v . add ( n / i ) ; } } } return v ; }
|
g-transeval-java_data_235
|
int smallestNum ( int n ) { double x = Math . pow ( 10 , ( n - 1 ) / 2.0 ) ; return ( int ) Math . ceil ( x ) ; }
|
g-transeval-java_data_236
|
int smallest ( String s ) { List < Integer > a = new ArrayList < > ( Collections . nCopies ( s . length ( ) , 0 ) ) ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { a . set ( i , s . charAt ( i ) - '0' ) ; } List < Integer > b = new ArrayList < > ( ) ; for ( int i = 0 ; i < a . size ( ) ; i ++ ) { if ( a . get ( i ) % 2 != 0 ) { b . add ( a . get ( i ) ) ; } } Collections . sort ( b ) ; if ( b . size ( ) > 1 ) { return b . get ( 0 ) * 10 + b . get ( 1 ) ; } return - 1 ; }
|
g-transeval-java_data_237
|
List < Double > Diagonals ( double a , double b , double c , double d ) { List < Double > ans = new ArrayList < > ( ) ; ans . add ( Math . sqrt ( ( a * c + b * d ) * ( a * d + b * c ) / ( a * b + c * d ) ) ) ; ans . add ( Math . sqrt ( ( a * c + b * d ) * ( a * b + c * d ) / ( a * d + b * c ) ) ) ; return ans ; }
|
g-transeval-java_data_238
|
int findNumberOfDigits ( int n , int bas ) { int dig = ( int ) Math . floor ( Math . log ( n ) / Math . log ( bas ) ) + 1 ; return dig ; }
|
g-transeval-java_data_239
|
double nGon ( int n ) { double proAngleVar ; if ( n % 4 == 0 ) { proAngleVar = Math . PI * ( 180.0 / n ) / 180 ; } else { proAngleVar = Math . PI * ( 180.0 / ( 2 * n ) ) / 180 ; } double negX = 1.0e+99 , posX = - 1.0e+99 , negY = 1.0e+99 , posY = - 1.0e+99 ; for ( int j = 0 ; j < n ; ++ j ) { double px = Math . cos ( 2 * Math . PI * j / n + proAngleVar ) ; double py = Math . sin ( 2 * Math . PI * j / n + proAngleVar ) ; negX = Math . min ( negX , px ) ; posX = Math . max ( posX , px ) ; negY = Math . min ( negY , py ) ; posY = Math . max ( posY , py ) ; } double opt2 = Math . max ( posX - negX , posY - negY ) ; return opt2 / Math . sin ( Math . PI / n ) / 2 ; }
|
g-transeval-java_data_240
|
int findMaxK ( int n ) { int p = ( int ) ( Math . log ( n ) / Math . log ( 2 ) ) ; return ( int ) Math . pow ( 2 , p ) ; }
|
g-transeval-java_data_241
|
int nthFibo ( int n ) { double a = ( Math . pow ( 5 , 0.5 ) + 1 ) / 2 ; double b = ( - 1 * Math . pow ( 5 , 0.5 ) + 1 ) / 2 ; double r = Math . pow ( 5 , 0.5 ) ; double ans = ( Math . pow ( a , n ) - Math . pow ( b , n ) ) / r ; return ( int ) ans ; }
|
g-transeval-java_data_242
|
double findProb ( int l , int r ) { double countOfPs = Math . floor ( Math . sqrt ( r ) ) - Math . ceil ( Math . sqrt ( l ) ) + 1 ; double total = r - l + 1 ; double prob = countOfPs / total ; return prob ; }
|
g-transeval-java_data_243
|
int previousFibonacci ( int n ) { double a = n / ( ( 1 + Math . sqrt ( 5 ) ) / 2.0 ) ; return ( int ) Math . round ( a ) ; }
|
g-transeval-java_data_244
|
List < Integer > distPrime ( List < Integer > arr , List < Integer > allPrimes ) { List < Integer > list1 = new ArrayList < > ( ) ; for ( int i : allPrimes ) { for ( int j : arr ) { if ( j % i == 0 ) { list1 . add ( i ) ; break ; } } } return list1 ; }
|
g-transeval-java_data_245
|
List < Integer > getArray ( int n ) { List < Integer > ans = new ArrayList < > ( ) ; int p2 = 1 ; while ( n > 0 ) { if ( n % 2 == 1 ) { ans . add ( p2 ) ; } n >>= 1 ; p2 *= 2 ; } return ans ; }
|
g-transeval-java_data_246
|
int maximumLength ( List < Integer > a ) { List < Integer > counts = new ArrayList < > ( Collections . nCopies ( 11 , 0 ) ) ; int ans = 0 ; for ( int index = 0 ; index < a . size ( ) ; index ++ ) { counts . set ( a . get ( index ) , counts . get ( a . get ( index ) ) + 1 ) ; List < Integer > k = new ArrayList < > ( ) ; for ( var i : counts ) { if ( i != 0 ) { k . add ( i ) ; } } Collections . sort ( k ) ; if ( k . size ( ) == 1 || ( k . get ( 0 ) == k . get ( k . size ( ) - 2 ) && k . get ( k . size ( ) - 1 ) - k . get ( k . size ( ) - 2 ) == 1 ) || ( k . get ( 0 ) == 1 && k . get ( 1 ) == k . get ( k . size ( ) - 1 ) ) ) { ans = index ; } } return ans + 1 ; }
|
g-transeval-java_data_247
|
int maxEdges ( double n ) { double edges = Math . floor ( n * n / 4 ) ; return ( int ) edges ; }
|
g-transeval-java_data_248
|
int findK ( int n , int k ) { List < Integer > a = new ArrayList < > ( ) ; for ( int i = 1 ; i < n ; i ++ ) { if ( i % 2 == 1 ) { a . add ( i ) ; } } for ( int i = 1 ; i < n ; i ++ ) { if ( i % 2 == 0 ) { a . add ( i ) ; } } return a . get ( k - 1 ) ; }
|
g-transeval-java_data_249
|
boolean isKeith ( int x , int temp ) { List < Integer > terms = new ArrayList < > ( ) ; int n = 0 ; while ( temp > 0 ) { terms . add ( temp % 10 ) ; temp = temp / 10 ; n ++ ; } Collections . reverse ( terms ) ; int nextTerm = 0 , i = n ; while ( nextTerm < x ) { nextTerm = 0 ; for ( int j = 1 ; j <= n ; j ++ ) { nextTerm += terms . get ( i - j ) ; } terms . add ( nextTerm ) ; i ++ ; } return nextTerm == x ; }
|
g-transeval-java_data_250
|
boolean factors ( int n , int k ) { List < Integer > v = new ArrayList < > ( ) ; while ( n % 2 == 0 ) { v . add ( 2 ) ; n /= 2 ; } if ( v . size ( ) >= k ) { return true ; } for ( int i = 3 ; i * i <= n ; i += 2 ) { while ( n % i == 0 ) { n = n / i ; v . add ( i ) ; } if ( v . size ( ) >= k ) { return true ; } } if ( n > 2 ) { v . add ( n ) ; } if ( v . size ( ) >= k ) { return true ; } return false ; }
|
g-transeval-java_data_251
|
List < String > separateParenGroups ( String parenString ) { List < String > allParens = new ArrayList < > ( ) ; StringBuilder currentParen = new StringBuilder ( ) ; int currentDepth = 0 ; for ( var c : parenString . toCharArray ( ) ) { if ( c == '(' ) { currentDepth += 1 ; currentParen . append ( c ) ; } else if ( c == ')' ) { currentDepth -= 1 ; currentParen . append ( c ) ; if ( currentDepth == 0 ) { allParens . add ( currentParen . toString ( ) ) ; currentParen . setLength ( 0 ) ; } } } return allParens ; }
|
g-transeval-java_data_252
|
List < Integer > parseNestedParens ( String parenString ) { List < Integer > allLevels = new ArrayList < > ( ) ; int level = 0 ; int maxLevel = 0 ; for ( int i = 0 ; i < parenString . length ( ) ; i ++ ) { char chr = parenString . charAt ( i ) ; if ( chr == '(' ) { level += 1 ; if ( level > maxLevel ) { maxLevel = level ; } } if ( chr == ')' ) { level -= 1 ; if ( level == 0 ) { allLevels . add ( maxLevel ) ; maxLevel = 0 ; } } } return allLevels ; }
|
g-transeval-java_data_253
|
List < String > filterBySubstring ( List < String > strings , String substring ) { List < String > result = new ArrayList < > ( ) ; for ( var s : strings ) { if ( s . contains ( substring ) ) { result . add ( s ) ; } } return result ; }
|
g-transeval-java_data_254
|
List < Integer > rollingMax ( List < Integer > numbers ) { List < Integer > result = new ArrayList < > ( ) ; int runningMax = 0 ; for ( Integer n : numbers ) { if ( n > runningMax ) { runningMax = n ; } result . add ( runningMax ) ; } return result ; }
|
g-transeval-java_data_255
|
String makePalindrome ( String s ) { if ( s . isEmpty ( ) ) { return "" ; } for ( int i = 0 ; i < s . length ( ) ; i ++ ) { String rStr = s . substring ( i ) ; if ( rStr . equals ( new StringBuilder ( rStr ) . reverse ( ) . toString ( ) ) ) { String nStr = s . substring ( 0 , i ) ; String n2Str = new StringBuilder ( nStr ) . reverse ( ) . toString ( ) ; return s + n2Str ; } } return s . substring ( 0 , s . length ( ) - 1 ) + new StringBuilder ( s ) . reverse ( ) . toString ( ) ; }
|
g-transeval-java_data_256
|
String stringXor ( String a , String b ) { StringBuilder result = new StringBuilder ( ) ; for ( int i = 0 ; i < a . length ( ) ; i ++ ) { if ( a . charAt ( i ) == b . charAt ( i ) ) { result . append ( '0' ) ; } else { result . append ( '1' ) ; } } return result . toString ( ) ; }
|
g-transeval-java_data_257
|
String longest ( List < String > strings ) { if ( strings . isEmpty ( ) ) return "" ; int maxLen = strings . stream ( ) . mapToInt ( String :: length ) . max ( ) . getAsInt ( ) ; for ( String s : strings ) { if ( s . length ( ) == maxLen ) { return s ; } } return "" ; }
|
g-transeval-java_data_258
|
String StringSequence ( int n ) { StringBuilder s = new StringBuilder ( ) ; for ( int i = 0 ; i < n ; i ++ ) { s . append ( i ) ; s . append ( " " ) ; } s . append ( n ) ; return s . toString ( ) ; }
|
g-transeval-java_data_259
|
int countDistinctCharacters ( String s ) { Set < Character > distinct = new HashSet < > ( ) ; for ( char c : s . toLowerCase ( ) . toCharArray ( ) ) { distinct . add ( c ) ; } return distinct . size ( ) ; }
|
g-transeval-java_data_260
|
int howManyTimes ( String s , String sub ) { int times = 0 ; for ( int i = 0 ; i <= s . length ( ) - sub . length ( ) ; i ++ ) { if ( s . startsWith ( sub , i ) ) { times += 1 ; } } return times ; }
|
g-transeval-java_data_261
|
String sortNumbers ( String numbers ) { Map < String , Integer > toNum = Map . of ( "zero" , 0 , "one" , 1 , "two" , 2 , "three" , 3 , "four" , 4 , "five" , 5 , "six" , 6 , "seven" , 7 , "eight" , 8 , "nine" , 9 ) ; Map < Integer , String > fromNum = Map . of ( 0 , "zero" , 1 , "one" , 2 , "two" , 3 , "three" , 4 , "four" , 5 , "five" , 6 , "six" , 7 , "seven" , 8 , "eight" , 9 , "nine" ) ; List < Integer > ints = new ArrayList < > ( ) ; StringBuilder current = new StringBuilder ( ) ; for ( int i = 0 ; i <= numbers . length ( ) ; i ++ ) { if ( i == numbers . length ( ) || numbers . charAt ( i ) == ' ' ) { if ( toNum . containsKey ( current . toString ( ) ) ) { ints . add ( toNum . get ( current . toString ( ) ) ) ; current . setLength ( 0 ) ; } } else { current . append ( numbers . charAt ( i ) ) ; } } Collections . sort ( ints ) ; StringBuilder result = new StringBuilder ( ) ; for ( int i = 0 ; i < ints . size ( ) ; i ++ ) { result . append ( fromNum . get ( ints . get ( i ) ) ) ; if ( i != ints . size ( ) - 1 ) { result . append ( " " ) ; } } return result . toString ( ) ; }
|
g-transeval-java_data_262
|
List < Double > findClosestElements ( List < Double > numbers ) { List < Double > closestPair = new ArrayList < > ( Arrays . asList ( numbers . get ( 0 ) , numbers . get ( 1 ) ) ) ; double distance = Math . abs ( numbers . get ( 0 ) - numbers . get ( 1 ) ) ; for ( int i = 0 ; i < numbers . size ( ) ; i ++ ) { for ( int j = i + 1 ; j < numbers . size ( ) ; j ++ ) { if ( Math . abs ( numbers . get ( i ) - numbers . get ( j ) ) < distance ) { closestPair . set ( 0 , numbers . get ( i ) ) ; closestPair . set ( 1 , numbers . get ( j ) ) ; distance = Math . abs ( numbers . get ( i ) - numbers . get ( j ) ) ; } } } Collections . sort ( closestPair ) ; return closestPair ; }
|
g-transeval-java_data_263
|
List < Double > rescaleToUnit ( List < Double > numbers ) { double minNum = Collections . min ( numbers ) ; double maxNum = Collections . max ( numbers ) ; List < Double > result = new ArrayList < > ( ) ; for ( double n : numbers ) { result . add ( ( n - minNum ) / ( maxNum - minNum ) ) ; } return result ; }
|
g-transeval-java_data_264
|
List < Integer > filterIntegers ( List < Object > values ) { List < Integer > result = new ArrayList < > ( ) ; for ( var e : values ) { if ( e instanceof Integer ) { result . add ( ( Integer ) e ) ; } } return result ; }
|
g-transeval-java_data_265
|
List < Integer > removeDuplicates ( List < Integer > numbers ) { Map < Integer , Integer > c = new HashMap < > ( ) ; for ( int i : numbers ) { c . put ( i , c . getOrDefault ( i , 0 ) + 1 ) ; } List < Integer > result = new ArrayList < > ( ) ; for ( int i : numbers ) { if ( c . get ( i ) == 1 ) { result . add ( i ) ; } } return result ; }
|
g-transeval-java_data_266
|
String flipCase ( String s ) { StringBuilder result = new StringBuilder ( ) ; for ( char c : s . toCharArray ( ) ) { if ( Character . isLowerCase ( c ) ) { result . append ( Character . toUpperCase ( c ) ) ; } else { result . append ( Character . toLowerCase ( c ) ) ; } } return result . toString ( ) ; }
|
g-transeval-java_data_267
|
List < String > filterByPrefix ( List < String > strings , String prefix ) { List < String > result = new ArrayList < > ( ) ; for ( int i = 0 ; i < strings . size ( ) ; i ++ ) { if ( strings . get ( i ) . startsWith ( prefix ) ) { result . add ( strings . get ( i ) ) ; } } return result ; }
|
g-transeval-java_data_268
|
double findZero ( List < Double > xs ) { double ans = 0 ; double value = 0 ; for ( int i = 0 ; i < xs . size ( ) ; i ++ ) { value += xs . get ( i ) * Math . pow ( ans , i ) ; } while ( Math . abs ( value ) > 1e-6 ) { double driv = 0 ; for ( int i = 1 ; i < xs . size ( ) ; i ++ ) { driv += xs . get ( i ) * Math . pow ( ans , i - 1 ) * i ; } ans -= value / driv ; value = 0 ; for ( int i = 0 ; i < xs . size ( ) ; i ++ ) { value += xs . get ( i ) * Math . pow ( ans , i ) ; } } return ans ; }
|
g-transeval-java_data_269
|
List < Integer > sortThird ( List < Integer > l ) { List < Integer > thirds = new ArrayList < > ( ) ; for ( int i = 0 ; i < l . size ( ) ; i += 3 ) { thirds . add ( l . get ( i ) ) ; } Collections . sort ( thirds ) ; List < Integer > result = new ArrayList < > ( ) ; for ( int i = 0 ; i < l . size ( ) ; i ++ ) { if ( i % 3 == 0 ) { result . add ( thirds . get ( i / 3 ) ) ; } else { result . add ( l . get ( i ) ) ; } } return result ; }
|
g-transeval-java_data_270
|
List < Integer > unique ( List < Integer > l ) { List < Integer > result = new ArrayList < > ( new HashSet < > ( l ) ) ; Collections . sort ( result ) ; return result ; }
|
g-transeval-java_data_271
|
double maxElement ( List < Double > l ) { return Collections . max ( l ) ; }
|
g-transeval-java_data_272
|
boolean triplesSumToZero ( List < Integer > l ) { for ( int i = 0 ; i < l . size ( ) ; i ++ ) { for ( int j = i + 1 ; j < l . size ( ) ; j ++ ) { for ( int k = j + 1 ; k < l . size ( ) ; k ++ ) { if ( l . get ( i ) + l . get ( j ) + l . get ( k ) == 0 ) { return true ; } } } } return false ; }
|
g-transeval-java_data_273
|
int fib4 ( int n ) { List < Integer > results = new ArrayList < > ( Arrays . asList ( 0 , 0 , 2 , 0 ) ) ; for ( int i = 4 ; i <= n ; i ++ ) { results . add ( results . get ( i - 4 ) + results . get ( i - 3 ) + results . get ( i - 2 ) + results . get ( i - 1 ) ) ; } return results . get ( n ) ; }
|
g-transeval-java_data_274
|
boolean isPalindrome ( String text ) { String pr = new StringBuilder ( text ) . reverse ( ) . toString ( ) ; return pr . equals ( text ) ; }
|
g-transeval-java_data_275
|
String removeVowels ( String text ) { StringBuilder result = new StringBuilder ( ) ; String vowels = "aeiou" ; for ( char ch : text . toCharArray ( ) ) { if ( vowels . indexOf ( Character . toLowerCase ( ch ) ) == - 1 ) { result . append ( ch ) ; } } return result . toString ( ) ; }
|
g-transeval-java_data_276
|
boolean sameChars ( String s0 , String s1 ) { Set < Character > set0 = new HashSet < > ( ) ; for ( char c : s0 . toCharArray ( ) ) { set0 . add ( c ) ; } Set < Character > set1 = new HashSet < > ( ) ; for ( char c : s1 . toCharArray ( ) ) { set1 . add ( c ) ; } return set0 . equals ( set1 ) ; }
|
g-transeval-java_data_277
|
List < Integer > common ( List < Integer > l1 , List < Integer > l2 ) { Set < Integer > us = new HashSet < > ( ) ; for ( int e1 : l1 ) { for ( int e2 : l2 ) { if ( e1 == e2 ) { us . add ( e1 ) ; } } } List < Integer > ret = new ArrayList < > ( us ) ; Collections . sort ( ret ) ; return ret ; }
|
g-transeval-java_data_278
|
boolean correctBracketing ( String brackets ) { int depth = 0 ; for ( char b : brackets . toCharArray ( ) ) { if ( b == '(' ) { depth += 1 ; } if ( b == ')' ) { depth -= 1 ; } if ( depth < 0 ) { return false ; } } return depth == 0 ; }
|
g-transeval-java_data_279
|
String circularShift ( int x , int shift ) { String xs = String . valueOf ( x ) ; if ( shift > xs . length ( ) ) { return new StringBuilder ( xs ) . reverse ( ) . toString ( ) ; } return xs . substring ( xs . length ( ) - shift ) + xs . substring ( 0 , xs . length ( ) - shift ) ; }
|
g-transeval-java_data_280
|
int search ( List < Integer > lst ) { Map < Integer , Integer > counter = new HashMap < > ( ) ; for ( int i : lst ) { counter . put ( i , counter . getOrDefault ( i , 0 ) + 1 ) ; } int ans = - 1 ; for ( var item : counter . entrySet ( ) ) { if ( item . getValue ( ) >= item . getKey ( ) && item . getKey ( ) > ans ) { ans = item . getKey ( ) ; } } return ans ; }
|
g-transeval-java_data_281
|
int smallestChange ( List < Integer > arr ) { int ans = 0 ; for ( int i = 0 ; i < arr . size ( ) / 2 ; i ++ ) { if ( ! arr . get ( i ) . equals ( arr . get ( arr . size ( ) - i - 1 ) ) ) { ans += 1 ; } } return ans ; }
|
g-transeval-java_data_282
|
List < String > totalMatch ( List < String > lst1 , List < String > lst2 ) { int sum1 = 0 ; for ( var st : lst1 ) { sum1 += st . length ( ) ; } int sum2 = 0 ; for ( String st : lst2 ) { sum2 += st . length ( ) ; } return sum1 > sum2 ? lst2 : lst1 ; }
|
g-transeval-java_data_283
|
boolean isHappy ( String s ) { if ( s . length ( ) < 3 ) { return false ; } for ( int i = 0 ; i < s . length ( ) - 2 ; i ++ ) { if ( s . charAt ( i ) == s . charAt ( i + 1 ) || s . charAt ( i ) == s . charAt ( i + 2 ) || s . charAt ( i + 1 ) == s . charAt ( i + 2 ) ) { return false ; } } return true ; }
|
g-transeval-java_data_284
|
List < String > numericalLetterGrade ( List < Double > grades ) { List < String > letterGrade = new ArrayList < > ( ) ; for ( double gpa : grades ) { if ( gpa == 4.0 ) { letterGrade . add ( "A+" ) ; } else if ( gpa > 3.7 ) { letterGrade . add ( "A" ) ; } else if ( gpa > 3.3 ) { letterGrade . add ( "A-" ) ; } else if ( gpa > 3.0 ) { letterGrade . add ( "B+" ) ; } else if ( gpa > 2.7 ) { letterGrade . add ( "B" ) ; } else if ( gpa > 2.3 ) { letterGrade . add ( "B-" ) ; } else if ( gpa > 2.0 ) { letterGrade . add ( "C+" ) ; } else if ( gpa > 1.7 ) { letterGrade . add ( "C" ) ; } else if ( gpa > 1.3 ) { letterGrade . add ( "C-" ) ; } else if ( gpa > 1.0 ) { letterGrade . add ( "D+" ) ; } else if ( gpa > 0.7 ) { letterGrade . add ( "D" ) ; } else if ( gpa > 0.0 ) { letterGrade . add ( "D-" ) ; } else { letterGrade . add ( "E" ) ; } } return letterGrade ; }
|
g-transeval-java_data_285
|
String solve ( int n ) { StringBuilder biStr = new StringBuilder ( ) ; int sum = 0 ; for ( char c : String . valueOf ( n ) . toCharArray ( ) ) { sum += c - '0' ; } while ( sum > 0 ) { biStr . insert ( 0 , sum % 2 ) ; sum /= 2 ; } return biStr . toString ( ) ; }
|
g-transeval-java_data_286
|
String antiShuffle ( String s ) { StringBuilder ret = new StringBuilder ( ) ; StringBuilder current = new StringBuilder ( ) ; for ( int i = 0 ; i <= s . length ( ) ; i ++ ) { if ( i == s . length ( ) || s . charAt ( i ) == ' ' ) { char [ ] tmp = current . toString ( ) . toCharArray ( ) ; Arrays . sort ( tmp ) ; if ( ! ret . isEmpty ( ) ) { ret . append ( ' ' ) ; } ret . append ( String . valueOf ( tmp ) ) ; current . setLength ( 0 ) ; } else { current . append ( s . charAt ( i ) ) ; } } return ret . toString ( ) ; }
|
g-transeval-java_data_287
|
List < Integer > sortArray ( List < Integer > array ) { if ( array . isEmpty ( ) ) { return array ; } if ( ( array . get ( 0 ) + array . get ( array . size ( ) - 1 ) ) % 2 == 1 ) { Collections . sort ( array ) ; } else { array . sort ( Collections . reverseOrder ( ) ) ; } return array ; }
|
g-transeval-java_data_288
|
String encrypt ( String s ) { StringBuilder ans = new StringBuilder ( ) ; for ( char c : s . toCharArray ( ) ) { if ( Character . isLetter ( c ) ) { ans . append ( ( char ) ( 'a' + ( c - 'a' + 4 ) % 26 ) ) ; } else { ans . append ( c ) ; } } return ans . toString ( ) ; }
|
g-transeval-java_data_289
|
int isBored ( String s ) { boolean isStart = true ; int sum = 0 ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( s . charAt ( i ) == '.' || s . charAt ( i ) == '?' || s . charAt ( i ) == '!' ) { isStart = true ; } else if ( isStart ) { if ( s . charAt ( i ) == ' ' ) { continue ; } if ( s . startsWith ( "I " , i ) ) { sum += 1 ; } isStart = false ; } } return sum ; }
|
g-transeval-java_data_290
|
String encode ( String message ) { String vowels = "aeiouAEIOU" ; StringBuilder ret = new StringBuilder ( ) ; for ( char c : message . toCharArray ( ) ) { if ( Character . isUpperCase ( c ) ) { c = Character . toLowerCase ( c ) ; if ( vowels . indexOf ( c ) != - 1 ) { c = ( char ) ( 'a' + ( c - 'a' + 2 ) % 26 ) ; } } else if ( Character . isLowerCase ( c ) ) { c = Character . toUpperCase ( c ) ; if ( vowels . indexOf ( c ) != - 1 ) { c = ( char ) ( 'A' + ( c - 'A' + 2 ) % 26 ) ; } } ret . append ( c ) ; } return ret . toString ( ) ; }
|
g-transeval-java_data_291
|
int skjkasdkd ( List < Integer > lst ) { int largest = 0 ; for ( int n : lst ) { if ( n > largest ) { boolean prime = true ; for ( int i = 2 ; i < n ; i ++ ) { if ( n % i == 0 ) { prime = false ; } } if ( prime ) { largest = n ; } } } int sum = 0 ; String s = String . valueOf ( largest ) ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { sum += s . charAt ( i ) - '0' ; } return sum ; }
|
g-transeval-java_data_292
|
boolean checkDictCase ( Map < String , String > dict ) { if ( dict . isEmpty ( ) ) { return false ; } int isLower = 0 ; int isUpper = 0 ; for ( var key : dict . keySet ( ) ) { for ( char c : key . toCharArray ( ) ) { if ( Character . isLowerCase ( c ) ) { isLower = 1 ; } else if ( Character . isUpperCase ( c ) ) { isUpper = 1 ; } else { return false ; } } } return isLower + isUpper == 1 ; }
|
g-transeval-java_data_293
|
int multiply ( int a , int b ) { return ( Math . abs ( a ) % 10 ) * ( Math . abs ( b ) % 10 ) ; }
|
g-transeval-java_data_294
|
int countUpper ( String s ) { String uVowel = "AEIOU" ; int count = 0 ; for ( int i = 0 ; i < s . length ( ) ; i += 2 ) { if ( uVowel . indexOf ( s . charAt ( i ) ) != - 1 ) { count += 1 ; } } return count ; }
|
g-transeval-java_data_295
|
List < String > byLength ( List < Integer > arr ) { Map < Integer , String > numTo = Map . of ( 1 , "One" , 2 , "Two" , 3 , "Three" , 4 , "Four" , 5 , "Five" , 6 , "Six" , 7 , "Seven" , 8 , "Eight" , 9 , "Nine" ) ; List < Integer > sortedArr = new ArrayList < > ( arr ) ; sortedArr . sort ( Collections . reverseOrder ( ) ) ; List < String > newArr = new ArrayList < > ( ) ; for ( int n : sortedArr ) { if ( n >= 1 && n <= 9 ) { newArr . add ( numTo . get ( n ) ) ; } } return newArr ; }
|
g-transeval-java_data_296
|
List < Integer > f ( int n ) { int sum = 0 ; int prod = 1 ; List < Integer > result = new ArrayList < > ( ) ; for ( int i = 1 ; i <= n ; i ++ ) { sum += i ; prod *= i ; if ( i % 2 == 0 ) { result . add ( prod ) ; } else { result . add ( sum ) ; } } return result ; }
|
g-transeval-java_data_297
|
List < Integer > evenOddPalindrome ( int n ) { int evenCount = 0 , oddCount = 0 ; for ( int i = 1 ; i <= n ; i ++ ) { String s = String . valueOf ( i ) ; String rStr = new StringBuilder ( s ) . reverse ( ) . toString ( ) ; if ( s . equals ( rStr ) ) { if ( i % 2 == 1 ) { oddCount += 1 ; } else { evenCount += 1 ; } } } return Arrays . asList ( evenCount , oddCount ) ; }
|
g-transeval-java_data_298
|
Map < Character , Integer > histogram ( String test ) { Map < Character , Integer > count = new HashMap < > ( ) ; int max = 0 ; for ( int i = 0 ; i < test . length ( ) ; i ++ ) { if ( test . charAt ( i ) != ' ' ) { count . put ( test . charAt ( i ) , count . getOrDefault ( test . charAt ( i ) , 0 ) + 1 ) ; if ( count . get ( test . charAt ( i ) ) > max ) { max = count . get ( test . charAt ( i ) ) ; } } } Map < Character , Integer > result = new HashMap < > ( ) ; for ( var item : count . entrySet ( ) ) { if ( item . getValue ( ) == max ) { result . put ( item . getKey ( ) , item . getValue ( ) ) ; } } return result ; }
|
g-transeval-java_data_299
|
List < String > reverseDelete ( String s , String c ) { StringBuilder ret = new StringBuilder ( ) ; for ( char ch : s . toCharArray ( ) ) { if ( c . indexOf ( ch ) == - 1 ) { ret . append ( ch ) ; } } String flag = "False" ; if ( ret . toString ( ) . equals ( new StringBuilder ( ret ) . reverse ( ) . toString ( ) ) ) { flag = "True" ; } return Arrays . asList ( ret . toString ( ) , flag ) ; }
|
g-transeval-java_data_300
|
List < Integer > sortArray ( List < Integer > arr ) { List < Integer > bin = new ArrayList < > ( ) ; for ( int i : arr ) { int b = 0 ; int n = Math . abs ( i ) ; while ( n > 0 ) { b += n % 2 ; n /= 2 ; } bin . add ( b ) ; } for ( int i = 0 ; i < arr . size ( ) ; i ++ ) { for ( int j = 1 ; j < arr . size ( ) ; j ++ ) { if ( bin . get ( j ) < bin . get ( j - 1 ) || ( bin . get ( j ) == bin . get ( j - 1 ) && arr . get ( j ) < arr . get ( j - 1 ) ) ) { Collections . swap ( bin , j , j - 1 ) ; Collections . swap ( arr , j , j - 1 ) ; } } } return arr ; }
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.