id
int64 0
1.17k
| comefrom
stringlengths 21
84
| code
stringlengths 50
1.89k
| masked
stringlengths 63
2.47k
|
|---|---|---|---|
1,000 | <gouthampradhan>array_SortColors_1.java | public void sortColors(int[] nums) {
int s = nums[0];
nums[0] = 1;
int l = 0, r = 0;
for (int i = 1; i < nums.length; i++) {
switch (nums[i]) {
case 0:
nums[l] = 0;
nums[r + 1] = 1;
if (r + 1 != i) {
nums[i] = 2;
}
l++;
r++;
break;
case 1:
nums[r + 1] = 1;
if (r + 1 != i) {
nums[i] = 2;
}
r++;
break;
}
}
if (s == 0) nums[l] = 0;
else if (s == 2) nums[r] = 2;
} | public void var_0 ( int [ ] var_1 ) {
int var_3 = var_1 [ 0 ] ;
var_1 [ 0 ] = 1 ;
int var_5 = 0 , var_6 = 0 ;
for ( int var_7 = 1 ;
var_7 < var_1 . length ;
var_7 ++ ) {
switch ( var_1 [ var_7 ] ) {
case 0 : var_1 [ var_5 ] = 0 ;
var_1 [ var_6 + 1 ] = 1 ;
if ( var_6 + 1 != var_7 ) {
var_1 [ var_7 ] = 2 ;
}
var_5 ++ ;
var_6 ++ ;
break ;
case 1 : var_1 [ var_6 + 1 ] = 1 ;
if ( var_6 + 1 != var_7 ) {
var_1 [ var_7 ] = 2 ;
}
var_6 ++ ;
break ;
}
}
if ( var_3 == 0 ) var_1 [ var_5 ] = 0 ;
else if ( var_3 == 2 ) var_1 [ var_6 ] = 2 ;
}
|
1,001 | <gouthampradhan>bit_manipulation_HammingDistance_1.java | public int hammingDistance(int x, int y) {
int z = (x ^ y);
int count = 0;
for (int i = 0; i < 31; i++) {
if ((z & (1 << i)) > 0) {
count++;
}
}
return count;
} | public int sample_funcname ( int var_0 , int var_1 ) {
int var_2 = ( var_0 ^ var_1 ) ;
int var_4 = 0 ;
for ( int var_5 = 0 ;
var_5 < 31 ;
var_5 ++ ) {
if ( ( var_2 & ( 1 << var_5 ) ) > 0 ) {
var_4 ++ ;
}
}
return var_4 ;
}
|
1,002 | <gouthampradhan>math_GlobalAndLocalInversions_1.java | public boolean isIdealPermutation(int[] A) {
if (A.length == 0 || A.length == 1) return true;
int max = Integer.MIN_VALUE;
for (int i = 1; i < A.length; i++) {
if (A[i] < max) {
return false;
} else {
max = Math.max(max, A[i - 1]);
}
}
return true;
} | public boolean var_0 ( int [ ] var_1 ) {
if ( var_1 . length == 0 || var_1 . length == 1 ) return true ;
int max = Integer . MIN_VALUE ;
for ( int var_8 = 1 ;
var_8 < var_1 . length ;
var_8 ++ ) {
if ( var_1 [ var_8 ] < max ) {
return false ;
}
else {
max = Math . max ( max , var_1 [ var_8 - 1 ] ) ;
}
}
return true ;
}
|
1,003 | <gouthampradhan>backtracking_PermutationsII_1.java | private void swap(int[] a, int i, int j) {
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
} | private void var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
int var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_4 ;
}
|
1,004 | <gouthampradhan>two_pointers_LongestSubstringWitoutRepeats_1.java | private int lengthOfLongestSubstring(String s) {
if (s == null || s.isEmpty()) return 0;
Map<Character, Integer> map = new HashMap<>();
int i = 0, max = Integer.MIN_VALUE;
for (int j = 0, l = s.length(); j < l; j++) {
if (map.keySet().contains(s.charAt(j))) {
i = Math.max(map.get(s.charAt(j)) + 1, i);
}
map.put(s.charAt(j), j);
max = Math.max(max, (j - i) + 1);
}
return max;
} | private int sample_funcname ( String var_1 ) {
if ( var_1 == null || var_1 . isEmpty ( ) ) return 0 ;
Map < Character , Integer > var_9 = new HashMap < > ( ) ;
int var_10 = 0 , max = Integer . MIN_VALUE ;
for ( int var_13 = 0 , var_15 = var_1 . length ( ) ;
var_13 < var_15 ;
var_13 ++ ) {
if ( var_9 . keySet ( ) . contains ( var_1 . charAt ( var_13 ) ) ) {
var_10 = Math . max ( var_9 . get ( var_1 . charAt ( var_13 ) ) + 1 , var_10 ) ;
}
var_9 . put ( var_1 . charAt ( var_13 ) , var_13 ) ;
max = Math . max ( max , ( var_13 - var_10 ) + 1 ) ;
}
return max ;
}
|
1,005 | <gouthampradhan>string_FindTheClosestPalindrome_2.java | private String getHigh(String s) {
int n = s.length() - 1;
StringBuilder sb = new StringBuilder();
sb.append("1");
for (int i = 0; i < n; i++) {
sb.append("0");
}
sb.append("1");
return sb.toString();
} | private String var_0 ( String var_2 ) {
int var_5 = var_2 . length ( ) - 1 ;
StringBuilder var_7 = new StringBuilder ( ) ;
var_7 . append ( "1" ) ;
for ( int var_11 = 0 ;
var_11 < var_5 ;
var_11 ++ ) {
var_7 . append ( "0" ) ;
}
var_7 . append ( "1" ) ;
return var_7 . toString ( ) ;
}
|
1,006 | <gouthampradhan>array_ChampagneTower_1.java | public double champagneTower(int poured, int query_row, int query_glass) {
double[][] A = new double[query_row + 1][query_row + 1];
A[0][0] = poured;
for (int i = 1; i <= query_row; i++) {
for (int j = 0; j <= query_row; j++) {
if (A[i - 1][j] > 1.0) {
A[i][j] += (A[i - 1][j] - 1.0) / 2;
}
if (j == 0) continue;
if (A[i - 1][j - 1] > 1.0) {
A[i][j] += (A[i - 1][j - 1] - 1.0) / 2;
}
}
}
if (A[query_row][query_glass] > 1.0) return 1;
else return A[query_row][query_glass];
} | public double sample_funcname ( int var_0 , int var_1 , int var_2 ) {
double [ ] [ ] var_4 = new double [ var_1 + 1 ] [ var_1 + 1 ] ;
var_4 [ 0 ] [ 0 ] = var_0 ;
for ( int var_6 = 1 ;
var_6 <= var_1 ;
var_6 ++ ) {
for ( int var_7 = 0 ;
var_7 <= var_1 ;
var_7 ++ ) {
if ( var_4 [ var_6 - 1 ] [ var_7 ] > 1.0 ) {
var_4 [ var_6 ] [ var_7 ] += ( var_4 [ var_6 - 1 ] [ var_7 ] - 1.0 ) / 2 ;
}
if ( var_7 == 0 ) continue ;
if ( var_4 [ var_6 - 1 ] [ var_7 - 1 ] > 1.0 ) {
var_4 [ var_6 ] [ var_7 ] += ( var_4 [ var_6 - 1 ] [ var_7 - 1 ] - 1.0 ) / 2 ;
}
}
}
if ( var_4 [ var_1 ] [ var_2 ] > 1.0 ) return 1 ;
else return var_4 [ var_1 ] [ var_2 ] ;
}
|
1,007 | <gouthampradhan>dynamic_programming_CoinChange2_1.java | private int dp(int[][] dp, int i, int[] coins, int l, int n) {
if (n == 0) return 1;
else if (i >= l) return 0;
if (n < 0) return 0;
if (dp[i][n] != -1) return dp[i][n];
dp[i][n] = dp(dp, i + 1, coins, l, n) + dp(dp, i, coins, l, n - coins[i]);
return dp[i][n];
} | private int sample_funcname ( int [ ] [ ] dp , int i , int [ ] coins , int l , int n ) {
if ( n == 0 ) return 1 ;
else if ( i >= l ) return 0 ;
if ( n < 0 ) return 0 ;
if ( dp [ i ] [ n ] != - 1 ) return dp [ i ] [ n ] ;
dp [ i ] [ n ] = dp ( dp , i + 1 , coins , l , n ) + dp ( dp , i , coins , l , n - coins [ i ] ) ;
return dp [ i ] [ n ] ;
}
|
1,008 | <gouthampradhan>two_pointers_LastSubstringInLexicographicalOrder_1.java | public String lastSubstring(String s) {
int currAns = 0;
int candidate = -1;
int prevIndex = 1;
for (int i = 1, l = s.length(); i < l; i++) {
if (candidate != -1) {
if (s.charAt(i) == s.charAt(prevIndex)) {
prevIndex++;
} else if (s.charAt(i) > s.charAt(prevIndex)) {
if (s.charAt(i) > s.charAt(candidate)) {
currAns = i;
candidate = -1;
prevIndex = currAns + 1;
} else if (s.charAt(i) == s.charAt(candidate)) {
currAns = candidate;
candidate = i;
prevIndex = currAns + 1;
} else {
currAns = candidate;
candidate = -1;
prevIndex = currAns + 1;
}
} else {
candidate = -1;
prevIndex = currAns + 1;
}
} else {
if (s.charAt(i) > s.charAt(currAns)) {
currAns = i;
candidate = -1;
prevIndex = currAns + 1;
} else if (s.charAt(i) == s.charAt(currAns)) {
candidate = i;
}
}
}
return s.substring(currAns);
} | public String var_0 ( String var_2 ) {
int var_4 = 0 ;
int var_6 = - 1 ;
int var_7 = 1 ;
for ( int var_8 = 1 , var_10 = var_2 . length ( ) ;
var_8 < var_10 ;
var_8 ++ ) {
if ( var_6 != - 1 ) {
if ( var_2 . charAt ( var_8 ) == var_2 . charAt ( var_7 ) ) {
var_7 ++ ;
}
else if ( var_2 . charAt ( var_8 ) > var_2 . charAt ( var_7 ) ) {
if ( var_2 . charAt ( var_8 ) > var_2 . charAt ( var_6 ) ) {
var_4 = var_8 ;
var_6 = - 1 ;
var_7 = var_4 + 1 ;
}
else if ( var_2 . charAt ( var_8 ) == var_2 . charAt ( var_6 ) ) {
var_4 = var_6 ;
var_6 = var_8 ;
var_7 = var_4 + 1 ;
}
else {
var_4 = var_6 ;
var_6 = - 1 ;
var_7 = var_4 + 1 ;
}
}
else {
var_6 = - 1 ;
var_7 = var_4 + 1 ;
}
}
else {
if ( var_2 . charAt ( var_8 ) > var_2 . charAt ( var_4 ) ) {
var_4 = var_8 ;
var_6 = - 1 ;
var_7 = var_4 + 1 ;
}
else if ( var_2 . charAt ( var_8 ) == var_2 . charAt ( var_4 ) ) {
var_6 = var_8 ;
}
}
}
return var_2 . substring ( var_4 ) ;
}
|
1,009 | <gouthampradhan>binary_search_MinimumWindowSubsequence_1.java | public String minWindow(String S, String T) {
if (T.isEmpty() || S.isEmpty()) return "";
Map<Character, TreeSet<Integer>> charMap = new HashMap<>();
for (int i = 0, l = S.length(); i < l; i++) {
char c = S.charAt(i);
charMap.putIfAbsent(c, new TreeSet<>());
charMap.get(c).add(i);
}
int min = Integer.MAX_VALUE;
int start = -1, end;
int ansStart = -1, ansEnd = -1;
boolean finished = false;
while (true) {
int index = start;
end = -1;
for (int i = 0, l = T.length(); i < l; i++) {
char c = T.charAt(i);
if (!charMap.containsKey(c)) {
return "";
} else {
TreeSet<Integer> indicies = charMap.get(c);
Integer found = indicies.higher(index);
if (found == null) {
finished = true;
break;
} else {
index = found;
if (i == 0) {
start = index;
}
if (i == l - 1) {
end = index;
}
}
}
}
if (start != -1 && end != -1) {
if ((end - start) < min) {
min = end - start;
ansStart = start;
ansEnd = end;
}
}
if (finished) return ansStart == -1 ? "" : S.substring(ansStart, ansEnd + 1);
}
} | public String var_0 ( String var_2 , String var_3 ) {
if ( var_3 . isEmpty ( ) || var_2 . isEmpty ( ) ) return "" ;
Map < Character , TreeSet < Integer >> var_11 = new HashMap < > ( ) ;
for ( int var_13 = 0 , var_15 = var_2 . length ( ) ;
var_13 < var_15 ;
var_13 ++ ) {
char var_17 = var_2 . charAt ( var_13 ) ;
var_11 . putIfAbsent ( var_17 , new TreeSet < > ( ) ) ;
var_11 . get ( var_17 ) . add ( var_13 ) ;
}
int var_22 = Integer . MAX_VALUE ;
int var_24 = - 1 , var_25 ;
int var_26 = - 1 , var_27 = - 1 ;
boolean var_35 = false ;
while ( true ) {
int var_29 = var_24 ;
var_25 = - 1 ;
for ( int var_13 = 0 , var_15 = var_3 . length ( ) ;
var_13 < var_15 ;
var_13 ++ ) {
char var_17 = var_3 . charAt ( var_13 ) ;
if ( ! var_11 . containsKey ( var_17 ) ) {
return "" ;
}
else {
TreeSet < Integer > var_31 = var_11 . get ( var_17 ) ;
Integer var_33 = var_31 . higher ( var_29 ) ;
if ( var_33 == null ) {
var_35 = true ;
break ;
}
else {
var_29 = var_33 ;
if ( var_13 == 0 ) {
var_24 = var_29 ;
}
if ( var_13 == var_15 - 1 ) {
var_25 = var_29 ;
}
}
}
}
if ( var_24 != - 1 && var_25 != - 1 ) {
if ( ( var_25 - var_24 ) < var_22 ) {
var_22 = var_25 - var_24 ;
var_26 = var_24 ;
var_27 = var_25 ;
}
}
if ( var_35 ) return var_26 == - 1 ? "" : var_2 . substring ( var_26 , var_27 + 1 ) ;
}
}
|
1,010 | <gouthampradhan>dynamic_programming_TwoKeysKeyboard_1.java | public int minSteps(int n) {
int[] DP = new int[n + 1];
for (int i = 2; i <= n; i++) {
DP[i] = i;
for (int j = 2; j < i; j++) {
if ((i % j) == 0) {
DP[i] = Math.min(DP[i], DP[j] + (i / j));
}
}
}
return DP[n];
} | public int sample_funcname ( int var_0 ) {
int [ ] var_2 = new int [ var_0 + 1 ] ;
for ( int var_4 = 2 ;
var_4 <= var_0 ;
var_4 ++ ) {
var_2 [ var_4 ] = var_4 ;
for ( int var_5 = 2 ;
var_5 < var_4 ;
var_5 ++ ) {
if ( ( var_4 % var_5 ) == 0 ) {
var_2 [ var_4 ] = Math . min ( var_2 [ var_4 ] , var_2 [ var_5 ] + ( var_4 / var_5 ) ) ;
}
}
}
return var_2 [ var_0 ] ;
}
|
1,011 | <gouthampradhan>greedy_BoatsToSavePeople_1.java | public int numRescueBoats(int[] people, int limit) {
TreeMap<Integer, Integer> treeMap = new TreeMap<>();
int boats = 0;
for (int p : people) {
treeMap.putIfAbsent(p, 0);
treeMap.put(p, treeMap.get(p) + 1);
}
Arrays.sort(people);
for (int p : people) {
if (treeMap.containsKey(p)) {
int count = treeMap.remove(p);
--count;
if (count != 0) {
treeMap.put(p, count);
}
int balance = limit - p;
Map.Entry<Integer, Integer> floor = treeMap.floorEntry(balance);
if (floor != null) {
int c = floor.getValue();
--c;
treeMap.remove(floor.getKey());
if (c != 0) {
treeMap.put(floor.getKey(), c);
}
}
boats++;
}
}
return boats;
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
TreeMap < Integer , Integer > var_4 = new TreeMap < > ( ) ;
int var_6 = 0 ;
for ( int var_7 : var_0 ) {
var_4 . putIfAbsent ( var_7 , 0 ) ;
var_4 . put ( var_7 , var_4 . get ( var_7 ) + 1 ) ;
}
Arrays . sort ( var_0 ) ;
for ( int var_7 : var_0 ) {
if ( var_4 . containsKey ( var_7 ) ) {
int var_16 = var_4 . remove ( var_7 ) ;
-- var_16 ;
if ( var_16 != 0 ) {
var_4 . put ( var_7 , var_16 ) ;
}
int var_17 = var_1 - var_7 ;
Map . Entry < Integer , Integer > var_21 = var_4 . floorEntry ( var_17 ) ;
if ( var_21 != null ) {
int var_24 = var_21 . getValue ( ) ;
-- var_24 ;
var_4 . remove ( var_21 . getKey ( ) ) ;
if ( var_24 != 0 ) {
var_4 . put ( var_21 . getKey ( ) , var_24 ) ;
}
}
var_6 ++ ;
}
}
return var_6 ;
}
|
1,012 | <gouthampradhan>math_DecodedStringAtIndex_1.java | public String decodeAtIndex(String S, int K) {
long product = 0;
char lastC = S.charAt(0);
for (int i = 0, l = S.length(); i < l; ) {
char c = S.charAt(i);
if (Character.isLetter(c)) {
lastC = c;
product++;
i++;
if (K == product) break;
} else {
long temp = (product * Integer.parseInt(String.valueOf(c)));
if (temp == K) break;
else {
if (temp > K) {
long x = (K / product);
if ((product * x) == K) break;
K -= (product * x);
i = 0;
product = 0;
} else {
product = temp;
i++;
}
}
}
}
return String.valueOf(lastC);
} | public String var_0 ( String var_2 , int var_3 ) {
long var_5 = 0 ;
char var_7 = var_2 . charAt ( 0 ) ;
for ( int var_8 = 0 , var_10 = var_2 . length ( ) ;
var_8 < var_10 ;
) {
char var_11 = var_2 . charAt ( var_8 ) ;
if ( Character . isLetter ( var_11 ) ) {
var_7 = var_11 ;
var_5 ++ ;
var_8 ++ ;
if ( var_3 == var_5 ) break ;
}
else {
long var_17 = ( var_5 * Integer . parseInt ( String . valueOf ( var_11 ) ) ) ;
if ( var_17 == var_3 ) break ;
else {
if ( var_17 > var_3 ) {
long var_18 = ( var_3 / var_5 ) ;
if ( ( var_5 * var_18 ) == var_3 ) break ;
var_3 -= ( var_5 * var_18 ) ;
var_8 = 0 ;
var_5 = 0 ;
}
else {
var_5 = var_17 ;
var_8 ++ ;
}
}
}
}
return String . valueOf ( var_7 ) ;
}
|
1,013 | <gouthampradhan>array_RotateArray_1.java | private void reverse(int[] nums, int s, int e) {
for (int i = s, j = e; i < j; i++, j--) {
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
}
} | private void var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
for ( int var_4 = var_2 , var_5 = var_3 ;
var_4 < var_5 ;
var_4 ++ , var_5 -- ) {
int var_6 = var_1 [ var_4 ] ;
var_1 [ var_4 ] = var_1 [ var_5 ] ;
var_1 [ var_5 ] = var_6 ;
}
}
|
1,014 | <gouthampradhan>dynamic_programming_TallestBillboard_1.java | private void update(Map<Integer, Integer> map, int diff, int rod1, int rod2) {
if (map.getOrDefault(diff, 0) < Math.max(rod1, rod2)) {
map.put(diff, Math.max(rod1, rod2));
}
} | private void var_0 ( Map < Integer , Integer > var_3 , int var_4 , int var_5 , int var_6 ) {
if ( var_3 . getOrDefault ( var_4 , 0 ) < Math . max ( var_5 , var_6 ) ) {
var_3 . put ( var_4 , Math . max ( var_5 , var_6 ) ) ;
}
}
|
1,015 | <gouthampradhan>string_KeyboardRow_1.java | public String[] findWords(String[] words) {
String R1 = "qwertyuiop";
String R2 = "asdfghjkl";
String R3 = "zxcvbnm";
List<String> answer = new ArrayList<>();
for (String s : words) {
Set<Character> set = new HashSet<>();
for (char c : s.toCharArray()) {
if (R1.indexOf(c) != -1) {
set.add('1');
} else if (R2.indexOf(c) != -1) {
set.add('2');
} else if (R3.indexOf(c) != -1) {
set.add('3');
}
}
if (set.size() == 1) {
answer.add(s);
}
}
String[] ans = new String[answer.size()];
int i = 0;
for (String s : answer) {
ans[i++] = s;
}
return ans;
} | public String [ ] var_0 ( String [ ] var_2 ) {
String var_4 = "qwertyuiop" ;
String var_6 = "asdfghjkl" ;
String var_8 = "zxcvbnm" ;
List < String > var_11 = new ArrayList < > ( ) ;
for ( String var_12 : var_2 ) {
Set < Character > var_16 = new HashSet < > ( ) ;
for ( char var_18 : var_12 . toCharArray ( ) ) {
if ( var_4 . indexOf ( var_18 ) != - 1 ) {
var_16 . add ( '1' ) ;
}
else if ( var_6 . indexOf ( var_18 ) != - 1 ) {
var_16 . add ( '2' ) ;
}
else if ( var_8 . indexOf ( var_18 ) != - 1 ) {
var_16 . add ( '3' ) ;
}
}
if ( var_16 . size ( ) == 1 ) {
var_11 . add ( var_12 ) ;
}
}
String [ ] var_26 = new String [ var_11 . size ( ) ] ;
int var_28 = 0 ;
for ( String var_12 : var_11 ) {
var_26 [ var_28 ++ ] = var_12 ;
}
return var_26 ;
}
|
1,016 | <gouthampradhan>binary_search_SearchRotatedSortedArray_1.java | public int search(int[] nums, int target) {
if (nums.length == 0) return -1;
if (nums.length == 1) {
return (nums[0] == target) ? 0 : -1;
}
int low = 0, high = nums.length - 1;
while (low < high) {
int mid = (low + high) >>> 1;
if (nums[mid] == target) return mid;
if ((nums[mid] <= nums[low]) && (target > nums[mid] && target <= nums[high])
|| (nums[low] <= nums[mid] && (target < nums[low] || target > nums[mid]))) low = mid + 1;
else high = mid - 1;
}
return (nums[low] == target) ? low : -1;
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
if ( var_0 . length == 0 ) return - 1 ;
if ( var_0 . length == 1 ) {
return ( var_0 [ 0 ] == var_1 ) ? 0 : - 1 ;
}
int var_5 = 0 , var_6 = var_0 . length - 1 ;
while ( var_5 < var_6 ) {
int var_7 = ( var_5 + var_6 ) >>> 1 ;
if ( var_0 [ var_7 ] == var_1 ) return var_7 ;
if ( ( var_0 [ var_7 ] <= var_0 [ var_5 ] ) && ( var_1 > var_0 [ var_7 ] && var_1 <= var_0 [ var_6 ] ) || ( var_0 [ var_5 ] <= var_0 [ var_7 ] && ( var_1 < var_0 [ var_5 ] || var_1 > var_0 [ var_7 ] ) ) ) var_5 = var_7 + 1 ;
else var_6 = var_7 - 1 ;
}
return ( var_0 [ var_5 ] == var_1 ) ? var_5 : - 1 ;
}
|
1,017 | <gouthampradhan>math_SolveTheEquation_1.java | private int[] calculate(String num, boolean isNeg, int xSum, int rest) {
int[] A = new int[2];
if (num.contains("x")) {
num = num.substring(0, num.length() - 1);
if (isNeg) {
xSum -= num.isEmpty() ? 1 : Integer.parseInt(num);
} else {
xSum += num.isEmpty() ? 1 : Integer.parseInt(num);
}
} else {
if (isNeg) {
rest -= Integer.parseInt(num);
} else {
rest += Integer.parseInt(num);
}
}
A[0] = xSum;
A[1] = rest;
return A;
} | private int [ ] sample_funcname ( String var_1 , boolean var_3 , int var_4 , int var_5 ) {
int [ ] var_7 = new int [ 2 ] ;
if ( var_1 . contains ( "x" ) ) {
var_1 = var_1 . substring ( 0 , var_1 . length ( ) - 1 ) ;
if ( var_3 ) {
var_4 -= var_1 . isEmpty ( ) ? 1 : Integer . parseInt ( var_1 ) ;
}
else {
var_4 += var_1 . isEmpty ( ) ? 1 : Integer . parseInt ( var_1 ) ;
}
}
else {
if ( var_3 ) {
var_5 -= Integer . parseInt ( var_1 ) ;
}
else {
var_5 += Integer . parseInt ( var_1 ) ;
}
}
var_7 [ 0 ] = var_4 ;
var_7 [ 1 ] = var_5 ;
return var_7 ;
}
|
1,018 | <gouthampradhan>dynamic_programming_LongestPalindromicSubsequence_1.java | public int longestPalindromeSubseq(String s) {
int[][] dp = new int[s.length() + 1][s.length() + 1];
String sI = new StringBuilder(s).reverse().toString();
for (int i = 1, l = s.length(); i <= l; i++)
for (int j = 1; j <= l; j++) {
dp[i][j] =
(s.charAt(i - 1) == sI.charAt(j - 1))
? dp[i - 1][j - 1] + 1
: Math.max(dp[i - 1][j], dp[i][j - 1]);
}
return dp[s.length()][s.length()];
} | public int sample_funcname ( String var_1 ) {
int [ ] [ ] var_4 = new int [ var_1 . length ( ) + 1 ] [ var_1 . length ( ) + 1 ] ;
String var_8 = new StringBuilder ( var_1 ) . reverse ( ) . toString ( ) ;
for ( int var_9 = 1 , var_10 = var_1 . length ( ) ;
var_9 <= var_10 ;
var_9 ++ ) for ( int var_11 = 1 ;
var_11 <= var_10 ;
var_11 ++ ) {
var_4 [ var_9 ] [ var_11 ] = ( var_1 . charAt ( var_9 - 1 ) == var_8 . charAt ( var_11 - 1 ) ) ? var_4 [ var_9 - 1 ] [ var_11 - 1 ] + 1 : Math . max ( var_4 [ var_9 - 1 ] [ var_11 ] , var_4 [ var_9 ] [ var_11 - 1 ] ) ;
}
return var_4 [ var_1 . length ( ) ] [ var_1 . length ( ) ] ;
}
|
1,019 | <gouthampradhan>math_AddDigits_1.java | public int addDigits(int num) {
if (num == 0) return 0;
return num % 9 == 0 ? 9 : num % 9;
} | public int sample_funcname ( int var_0 ) {
if ( var_0 == 0 ) return 0 ;
return var_0 % 9 == 0 ? 9 : var_0 % 9 ;
}
|
1,020 | <gouthampradhan>array_LargestNumberAtLeastTwice_1.java | public int dominantIndex(int[] nums) {
int index = 0, max = Integer.MIN_VALUE;
for (int i = 0; i < nums.length; i++) {
if (nums[i] > max) {
max = nums[i];
index = i;
}
}
for (int i = 0; i < nums.length; i++) {
if (i == index) continue;
if (((long) nums[i] * 2) > max) {
return -1;
}
}
return index;
} | public int sample_funcname ( int [ ] var_0 ) {
int var_2 = 0 , var_5 = Integer . MIN_VALUE ;
for ( int var_6 = 0 ;
var_6 < var_0 . length ;
var_6 ++ ) {
if ( var_0 [ var_6 ] > var_5 ) {
var_5 = var_0 [ var_6 ] ;
var_2 = var_6 ;
}
}
for ( int var_6 = 0 ;
var_6 < var_0 . length ;
var_6 ++ ) {
if ( var_6 == var_2 ) continue ;
if ( ( ( long ) var_0 [ var_6 ] * 2 ) > var_5 ) {
return - 1 ;
}
}
return var_2 ;
}
|
1,021 | <gouthampradhan>array_PascalsTriangle_1.java | public List<Integer> getRow(int rowIndex) {
int k = rowIndex;
if (k == 0) return Arrays.asList(1);
else if (k == 1) return Arrays.asList(1, 1);
else if (k == 2) return Arrays.asList(1, 2, 1);
List<Integer> result = new ArrayList<>();
result.add(2);
k = k - 2;
int p, c;
while (k-- > 0) {
p = 1;
int i = 0;
for (int l = result.size(); i < l; i++) {
c = result.get(i);
result.set(i, p + c);
p = c;
}
result.add(p + 1);
}
result.add(0, 1);
result.add(1);
return result;
} | public List < Integer > var_1 ( int var_2 ) {
int var_3 = var_2 ;
if ( var_3 == 0 ) return Arrays . asList ( 1 ) ;
else if ( var_3 == 1 ) return Arrays . asList ( 1 , 1 ) ;
else if ( var_3 == 2 ) return Arrays . asList ( 1 , 2 , 1 ) ;
List < Integer > var_11 = new ArrayList < > ( ) ;
var_11 . add ( 2 ) ;
var_3 = var_3 - 2 ;
int var_13 , var_14 ;
while ( var_3 -- > 0 ) {
var_13 = 1 ;
int var_15 = 0 ;
for ( int var_17 = var_11 . size ( ) ;
var_15 < var_17 ;
var_15 ++ ) {
var_14 = var_11 . get ( var_15 ) ;
var_11 . set ( var_15 , var_13 + var_14 ) ;
var_13 = var_14 ;
}
var_11 . add ( var_13 + 1 ) ;
}
var_11 . add ( 0 , 1 ) ;
var_11 . add ( 1 ) ;
return var_11 ;
}
|
1,022 | <gouthampradhan>math_CouplesHoldingHands_2.java | private void swap(int[] A, int i, int j) {
int temp = A[i];
A[i] = A[j];
A[j] = temp;
} | private void var_0 ( int [ ] var_1 , int var_2 , int var_3 ) {
int var_4 = var_1 [ var_2 ] ;
var_1 [ var_2 ] = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_4 ;
}
|
1,023 | <gouthampradhan>array_MinimumMovesToEqualArray_1.java | public int minMoves2(int[] nums) {
if (nums.length == 1) return 0;
else if (nums.length == 2) return Math.abs(nums[0] - nums[1]);
Arrays.sort(nums);
int median;
if ((nums.length % 2) == 1) {
median = (nums.length / 2);
int sum = 0;
for (int i = 0; i < nums.length; i++) {
sum += Math.abs(nums[i] - nums[median]);
}
return sum;
} else {
median = (nums.length / 2) - 1;
int sum = 0;
int min;
for (int i = 0; i < nums.length; i++) {
sum += Math.abs(nums[i] - nums[median]);
}
min = sum;
sum = 0;
median = (nums.length / 2);
for (int i = 0; i < nums.length; i++) {
sum += Math.abs(nums[i] - nums[median]);
}
min = Math.min(min, sum);
return min;
}
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 1 ) return 0 ;
else if ( var_0 . length == 2 ) return Math . abs ( var_0 [ 0 ] - var_0 [ 1 ] ) ;
Arrays . sort ( var_0 ) ;
int var_9 ;
if ( ( var_0 . length % 2 ) == 1 ) {
var_9 = ( var_0 . length / 2 ) ;
int var_10 = 0 ;
for ( int var_11 = 0 ;
var_11 < var_0 . length ;
var_11 ++ ) {
var_10 += Math . abs ( var_0 [ var_11 ] - var_0 [ var_9 ] ) ;
}
return var_10 ;
}
else {
var_9 = ( var_0 . length / 2 ) - 1 ;
int var_10 = 0 ;
int min ;
for ( int var_11 = 0 ;
var_11 < var_0 . length ;
var_11 ++ ) {
var_10 += Math . abs ( var_0 [ var_11 ] - var_0 [ var_9 ] ) ;
}
min = var_10 ;
var_10 = 0 ;
var_9 = ( var_0 . length / 2 ) ;
for ( int var_11 = 0 ;
var_11 < var_0 . length ;
var_11 ++ ) {
var_10 += Math . abs ( var_0 [ var_11 ] - var_0 [ var_9 ] ) ;
}
min = Math . min ( min , var_10 ) ;
return min ;
}
}
|
1,024 | <gouthampradhan>array_MissingNumber_1.java | public int missingNumber(int[] nums) {
int sum = 0;
int n = nums.length;
for (int num : nums) {
sum += num;
}
int arrSum = (((n + 1)) * n) / 2;
if (arrSum == sum) return 0;
else return arrSum - sum;
} | public int sample_funcname ( int [ ] var_0 ) {
int var_2 = 0 ;
int var_4 = var_0 . length ;
for ( int var_5 : var_0 ) {
var_2 += var_5 ;
}
int var_8 = ( ( ( var_4 + 1 ) ) * var_4 ) / 2 ;
if ( var_8 == var_2 ) return 0 ;
else return var_8 - var_2 ;
}
|
1,025 | <gouthampradhan>math_RotateFunction_1.java | public int maxRotateFunction(int[] A) {
if (A.length == 0 || A.length == 1) return 0;
int max = Integer.MIN_VALUE;
int l = A.length;
int sum = 0, prodSum = 0;
for (int i = 0; i < l; i++) {
prodSum += (A[i] * i);
sum += A[i];
}
max = Math.max(max, prodSum);
for (int i = 0; i < l - 1; i++) {
prodSum = (prodSum - sum + A[i] + ((l - 1) * A[i]));
max = Math.max(max, prodSum);
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 0 || var_0 . length == 1 ) return 0 ;
int max = Integer . MIN_VALUE ;
int var_7 = var_0 . length ;
int var_8 = 0 , var_9 = 0 ;
for ( int var_10 = 0 ;
var_10 < var_7 ;
var_10 ++ ) {
var_9 += ( var_0 [ var_10 ] * var_10 ) ;
var_8 += var_0 [ var_10 ] ;
}
max = Math . max ( max , var_9 ) ;
for ( int var_10 = 0 ;
var_10 < var_7 - 1 ;
var_10 ++ ) {
var_9 = ( var_9 - var_8 + var_0 [ var_10 ] + ( ( var_7 - 1 ) * var_0 [ var_10 ] ) ) ;
max = Math . max ( max , var_9 ) ;
}
return max ;
}
|
1,026 | <gouthampradhan>backtracking_Combinations_1.java | private void getNext(int i, int count, int n, int k, int[] subArr, List<List<Integer>> result) {
if (k == 0) {
List<Integer> subList = new ArrayList<>();
for (int a : subArr) subList.add(a);
result.add(subList);
} else {
for (int j = i + 1; j <= n; j++) {
subArr[count] = j;
getNext(j, count + 1, n, k - 1, subArr, result);
}
}
} | private void sample_funcname ( int i , int count , int n , int k , int [ ] subArr , List < List < Integer >> result ) {
if ( k == 0 ) {
List < Integer > subList = new ArrayList < > ( ) ;
for ( int a : subArr ) subList . add ( a ) ;
result . add ( subList ) ;
}
else {
for ( int j = i + 1 ;
j <= n ;
j ++ ) {
subArr [ count ] = j ;
getNext ( j , count + 1 , n , k - 1 , subArr , result ) ;
}
}
}
|
1,027 | <gouthampradhan>depth_first_search_AllPathsFromSourceToTarget_1.java | private void dfs(
List<List<Integer>> result, Set<Integer> done, int i, Stack<Integer> stack, int[][] graph) {
done.add(i);
stack.push(i);
int[] children = graph[i];
if (children.length == 0) {
List<Integer> childList = new ArrayList<>(stack);
result.add(childList);
} else {
for (int c : children) {
dfs(result, done, c, stack, graph);
}
}
stack.pop();
done.remove(i);
} | private void sample_funcname ( List < List < Integer >> result , Set < Integer > done , int i , Stack < Integer > stack , int [ ] [ ] graph ) {
done . add ( i ) ;
stack . push ( i ) ;
int [ ] children = graph [ i ] ;
if ( children . length == 0 ) {
List < Integer > childList = new ArrayList < > ( stack ) ;
result . add ( childList ) ;
}
else {
for ( int c : children ) {
dfs ( result , done , c , stack , graph ) ;
}
}
stack . pop ( ) ;
done . remove ( i ) ;
}
|
1,028 | <gouthampradhan>stack_BasicCalculator_1.java | public int calculate(String s) {
Stack<String> stack = new Stack<>();
String num = "";
s = "(" + s + ")";
for (char c : s.toCharArray()) {
switch (c) {
case ' ':
case '(':
case '+':
case '-':
if (!num.equals("")) {
stack.push(String.valueOf(num));
num = "";
}
if (c != ' ') {
stack.push(String.valueOf(c));
}
break;
case ')':
if (!num.equals("")) {
stack.push(String.valueOf(num));
num = "";
}
int sum = 0;
int prev = 0;
while (!stack.isEmpty()) {
String top = stack.pop();
if (top.equals("-")) {
sum -= (prev * 2);
prev = 0;
} else if (top.equals("+")) {
} else if (top.equals("(")) {
stack.push(String.valueOf(sum));
break;
} else {
sum += Integer.parseInt(top);
prev = Integer.parseInt(top);
}
}
break;
default:
num += String.valueOf(c);
break;
}
}
return Integer.parseInt(stack.peek());
} | public int sample_funcname ( String var_1 ) {
Stack < String > var_3 = new Stack < > ( ) ;
String var_5 = "" ;
var_1 = "(" + var_1 + ")" ;
for ( char var_9 : var_1 . toCharArray ( ) ) {
switch ( var_9 ) {
case ' ' : case '(' : case '+' : case '-' : if ( ! var_5 . equals ( "" ) ) {
var_3 . push ( String . valueOf ( var_5 ) ) ;
var_5 = "" ;
}
if ( var_9 != ' ' ) {
var_3 . push ( String . valueOf ( var_9 ) ) ;
}
break ;
case ')' : if ( ! var_5 . equals ( "" ) ) {
var_3 . push ( String . valueOf ( var_5 ) ) ;
var_5 = "" ;
}
int var_19 = 0 ;
int var_20 = 0 ;
while ( ! var_3 . isEmpty ( ) ) {
String var_23 = var_3 . pop ( ) ;
if ( var_23 . equals ( "-" ) ) {
var_19 -= ( var_20 * 2 ) ;
var_20 = 0 ;
}
else if ( var_23 . equals ( "+" ) ) {
}
else if ( var_23 . equals ( "(" ) ) {
var_3 . push ( String . valueOf ( var_19 ) ) ;
break ;
}
else {
var_19 += Integer . parseInt ( var_23 ) ;
var_20 = Integer . parseInt ( var_23 ) ;
}
}
break ;
default : var_5 += String . valueOf ( var_9 ) ;
break ;
}
}
return Integer . parseInt ( var_3 . peek ( ) ) ;
}
|
1,029 | <gouthampradhan>array_MaxProductOfThreeNumbers_1.java | public int maximumProduct(int[] nums) {
Arrays.sort(nums);
int prod1 = nums[nums.length - 1] * nums[nums.length - 2] * nums[nums.length - 3];
int prod2 = nums[nums.length - 1] * nums[0] * nums[1];
return prod1 > prod2 ? prod1 : prod2;
} | public int sample_funcname ( int [ ] var_0 ) {
Arrays . sort ( var_0 ) ;
int var_7 = var_0 [ var_0 . length - 1 ] * var_0 [ var_0 . length - 2 ] * var_0 [ var_0 . length - 3 ] ;
int var_9 = var_0 [ var_0 . length - 1 ] * var_0 [ 0 ] * var_0 [ 1 ] ;
return var_7 > var_9 ? var_7 : var_9 ;
}
|
1,030 | <gouthampradhan>two_pointers_ThreeSumClosest_1.java | public int threeSumClosest(int[] a, int target) {
Arrays.sort(a);
int min = Integer.MAX_VALUE, ans = -1;
for (int i = 0, l = a.length; i < l - 2; i++) {
if (i == 0 || !(a[i] == a[i - 1])) {
int j = i + 1, k = l - 1;
while (k > j) {
if (j != i + 1 && (a[j] == a[j - 1])) {
j++;
continue;
}
int sum = a[i] + a[j] + a[k];
if (sum < target) {
int diff = Math.abs(sum - target);
if (diff < min) {
min = diff;
ans = sum;
}
j++;
} else if (sum > target) {
int diff = Math.abs(sum - target);
if (diff < min) {
min = diff;
ans = sum;
}
k--;
} else {
return sum;
}
}
}
}
return ans;
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
Arrays . sort ( var_0 ) ;
int var_6 = Integer . MAX_VALUE , var_8 = - 1 ;
for ( int var_10 = 0 , var_12 = var_0 . length ;
var_10 < var_12 - 2 ;
var_10 ++ ) {
if ( var_10 == 0 || ! ( var_0 [ var_10 ] == var_0 [ var_10 - 1 ] ) ) {
int var_14 = var_10 + 1 , var_15 = var_12 - 1 ;
while ( var_15 > var_14 ) {
if ( var_14 != var_10 + 1 && ( var_0 [ var_14 ] == var_0 [ var_14 - 1 ] ) ) {
var_14 ++ ;
continue ;
}
int var_16 = var_0 [ var_10 ] + var_0 [ var_14 ] + var_0 [ var_15 ] ;
if ( var_16 < var_1 ) {
int var_19 = Math . abs ( var_16 - var_1 ) ;
if ( var_19 < var_6 ) {
var_6 = var_19 ;
var_8 = var_16 ;
}
var_14 ++ ;
}
else if ( var_16 > var_1 ) {
int var_19 = Math . abs ( var_16 - var_1 ) ;
if ( var_19 < var_6 ) {
var_6 = var_19 ;
var_8 = var_16 ;
}
var_15 -- ;
}
else {
return var_16 ;
}
}
}
}
return var_8 ;
}
|
1,031 | <gouthampradhan>string_StringToInteger_1.java | public int myAtoi(String str) {
boolean isPositive = true;
if (str == null || str.trim().isEmpty()) return 0;
str = str.trim();
if (str.charAt(0) == '+') {
isPositive = true;
str = str.substring(1, str.length());
} else if (str.charAt(0) == '-') {
isPositive = false;
str = str.substring(1, str.length());
} else if (str.charAt(0) > '9' || str.charAt(0) < '0') return 0;
int i = 0;
for (int l = str.length(); i < l; i++) {
if (str.charAt(i) > '9' || str.charAt(i) < '0') break;
}
str = str.substring(0, i);
long num = 0;
for (int j = 0, l = str.length(); j < l; j++) {
int n = (str.charAt(j) - '0');
num *= 10;
num += n;
if (isPositive) {
if (num > Integer.MAX_VALUE) return Integer.MAX_VALUE;
} else {
if ((num * -1) < Integer.MIN_VALUE) return Integer.MIN_VALUE;
}
}
if (isPositive) return (int) num;
else return (int) (num * -1);
} | public int sample_funcname ( String var_1 ) {
boolean var_21 = true ;
if ( var_1 == null || var_1 . trim ( ) . isEmpty ( ) ) return 0 ;
var_1 = var_1 . trim ( ) ;
if ( var_1 . charAt ( 0 ) == '+' ) {
var_21 = true ;
var_1 = var_1 . substring ( 1 , var_1 . length ( ) ) ;
}
else if ( var_1 . charAt ( 0 ) == '-' ) {
var_21 = false ;
var_1 = var_1 . substring ( 1 , var_1 . length ( ) ) ;
}
else if ( var_1 . charAt ( 0 ) > '9' || var_1 . charAt ( 0 ) < '0' ) return 0 ;
int var_15 = 0 ;
for ( int var_16 = var_1 . length ( ) ;
var_15 < var_16 ;
var_15 ++ ) {
if ( var_1 . charAt ( var_15 ) > '9' || var_1 . charAt ( var_15 ) < '0' ) break ;
}
var_1 = var_1 . substring ( 0 , var_15 ) ;
long var_17 = 0 ;
for ( int var_18 = 0 , var_16 = var_1 . length ( ) ;
var_18 < var_16 ;
var_18 ++ ) {
int var_19 = ( var_1 . charAt ( var_18 ) - '0' ) ;
var_17 *= 10 ;
var_17 += var_19 ;
if ( var_21 ) {
if ( var_17 > Integer . MAX_VALUE ) return Integer . MAX_VALUE ;
}
else {
if ( ( var_17 * - 1 ) < Integer . MIN_VALUE ) return Integer . MIN_VALUE ;
}
}
if ( var_21 ) return ( int ) var_17 ;
else return ( int ) ( var_17 * - 1 ) ;
}
|
1,032 | <gouthampradhan>string_ValidWordAbbreviation_1.java | public boolean validWordAbbreviation(String word, String abbr) {
if (abbr.length() > word.length()) return false;
StringBuilder num = new StringBuilder();
int j = 0;
for (int i = 0; i < abbr.length() && j < word.length(); i++) {
char curr = abbr.charAt(i);
if (curr == '0' && num.toString().isEmpty()) return false;
if (curr >= '0' && curr <= '9') {
num.append(curr);
} else {
if (num.toString().isEmpty()) {
if (word.charAt(j) != abbr.charAt(i)) {
return false;
}
j++;
} else {
int next = Integer.parseInt(num.toString());
j += next;
if (word.length() <= j) {
return false;
}
if (word.charAt(j) != abbr.charAt(i)) {
return false;
}
num = new StringBuilder();
j++;
}
}
}
if (!num.toString().isEmpty()) {
int next = Integer.parseInt(num.toString());
j += next;
if (j > word.length() || j < word.length()) {
return false;
}
}
return true;
} | public boolean var_0 ( String var_2 , String var_3 ) {
if ( var_3 . length ( ) > var_2 . length ( ) ) return false ;
StringBuilder var_6 = new StringBuilder ( ) ;
int var_8 = 0 ;
for ( int var_9 = 0 ;
var_9 < var_3 . length ( ) && var_8 < var_2 . length ( ) ;
var_9 ++ ) {
char var_11 = var_3 . charAt ( var_9 ) ;
if ( var_11 == '0' && var_6 . toString ( ) . isEmpty ( ) ) return false ;
if ( var_11 >= '0' && var_11 <= '9' ) {
var_6 . append ( var_11 ) ;
}
else {
if ( var_6 . toString ( ) . isEmpty ( ) ) {
if ( var_2 . charAt ( var_8 ) != var_3 . charAt ( var_9 ) ) {
return false ;
}
var_8 ++ ;
}
else {
int var_19 = Integer . parseInt ( var_6 . toString ( ) ) ;
var_8 += var_19 ;
if ( var_2 . length ( ) <= var_8 ) {
return false ;
}
if ( var_2 . charAt ( var_8 ) != var_3 . charAt ( var_9 ) ) {
return false ;
}
var_6 = new StringBuilder ( ) ;
var_8 ++ ;
}
}
}
if ( ! var_6 . toString ( ) . isEmpty ( ) ) {
int var_19 = Integer . parseInt ( var_6 . toString ( ) ) ;
var_8 += var_19 ;
if ( var_8 > var_2 . length ( ) || var_8 < var_2 . length ( ) ) {
return false ;
}
}
return true ;
}
|
1,033 | <gouthampradhan>greedy_GasStation_1.java | public int canCompleteCircuit(int[] gas, int[] cost) {
int debt = 0, sum = 0, start = 0;
for (int i = 0; i < gas.length; i++) {
sum += gas[i] - cost[i];
if (sum < 0) {
debt += sum;
sum = 0;
start = i + 1;
}
}
debt += sum;
return debt >= 0 ? start : -1;
} | public int sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
int var_3 = 0 , var_4 = 0 , var_5 = 0 ;
for ( int var_6 = 0 ;
var_6 < var_0 . length ;
var_6 ++ ) {
var_4 += var_0 [ var_6 ] - var_1 [ var_6 ] ;
if ( var_4 < 0 ) {
var_3 += var_4 ;
var_4 = 0 ;
var_5 = var_6 + 1 ;
}
}
var_3 += var_4 ;
return var_3 >= 0 ? var_5 : - 1 ;
}
|
1,034 | <gouthampradhan>dynamic_programming_HouseRobberII_1.java | public int rob(int[] nums) {
if (nums.length == 0) return 0;
if (nums.length == 1) return nums[0];
else if (nums.length == 2) {
if (nums[0] > nums[1]) return nums[0];
return nums[1];
} else if (nums.length == 3) return Math.max(Math.max(nums[0], nums[1]), nums[2]);
int[] DP = new int[nums.length];
for (int i = nums.length - 1; i > 0; i--) {
if (i + 3 < nums.length) DP[i] = Math.max(nums[i] + DP[i + 2], nums[i] + DP[i + 3]);
else if (i + 2 < nums.length) DP[i] = nums[i] + DP[i + 2];
else DP[i] = nums[i];
}
int max = Math.max(DP[1], DP[2]);
Arrays.fill(DP, 0);
for (int i = nums.length - 2; i >= 0; i--) {
if (i + 3 < nums.length) DP[i] = Math.max(nums[i] + DP[i + 2], nums[i] + DP[i + 3]);
else if (i + 2 < nums.length) DP[i] = nums[i] + DP[i + 2];
else DP[i] = nums[i];
}
max = Math.max(max, Math.max(DP[0], DP[1]));
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 0 ) return 0 ;
if ( var_0 . length == 1 ) return var_0 [ 0 ] ;
else if ( var_0 . length == 2 ) {
if ( var_0 [ 0 ] > var_0 [ 1 ] ) return var_0 [ 0 ] ;
return var_0 [ 1 ] ;
}
else if ( var_0 . length == 3 ) return Math . max ( Math . max ( var_0 [ 0 ] , var_0 [ 1 ] ) , var_0 [ 2 ] ) ;
int [ ] var_8 = new int [ var_0 . length ] ;
for ( int var_9 = var_0 . length - 1 ;
var_9 > 0 ;
var_9 -- ) {
if ( var_9 + 3 < var_0 . length ) var_8 [ var_9 ] = Math . max ( var_0 [ var_9 ] + var_8 [ var_9 + 2 ] , var_0 [ var_9 ] + var_8 [ var_9 + 3 ] ) ;
else if ( var_9 + 2 < var_0 . length ) var_8 [ var_9 ] = var_0 [ var_9 ] + var_8 [ var_9 + 2 ] ;
else var_8 [ var_9 ] = var_0 [ var_9 ] ;
}
int max = Math . max ( var_8 [ 1 ] , var_8 [ 2 ] ) ;
Arrays . fill ( var_8 , 0 ) ;
for ( int var_9 = var_0 . length - 2 ;
var_9 >= 0 ;
var_9 -- ) {
if ( var_9 + 3 < var_0 . length ) var_8 [ var_9 ] = Math . max ( var_0 [ var_9 ] + var_8 [ var_9 + 2 ] , var_0 [ var_9 ] + var_8 [ var_9 + 3 ] ) ;
else if ( var_9 + 2 < var_0 . length ) var_8 [ var_9 ] = var_0 [ var_9 ] + var_8 [ var_9 + 2 ] ;
else var_8 [ var_9 ] = var_0 [ var_9 ] ;
}
max = Math . max ( max , Math . max ( var_8 [ 0 ] , var_8 [ 1 ] ) ) ;
return max ;
}
|
1,035 | <gouthampradhan>array_LongestIncreasingSubsequence_1.java | public int findLengthOfLCIS(int[] nums) {
int max = 1, count = 1;
if (nums.length == 1) return max;
if (nums.length == 0) return 0;
for (int i = 0, j = i + 1; j < nums.length; ) {
if (nums[j] > nums[i]) {
count++;
i++;
j++;
} else {
max = Math.max(max, count);
count = 0;
i = j;
j = i + 1;
}
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
int max = 1 , var_3 = 1 ;
if ( var_0 . length == 1 ) return max ;
if ( var_0 . length == 0 ) return 0 ;
for ( int var_6 = 0 , var_7 = var_6 + 1 ;
var_7 < var_0 . length ;
) {
if ( var_0 [ var_7 ] > var_0 [ var_6 ] ) {
var_3 ++ ;
var_6 ++ ;
var_7 ++ ;
}
else {
max = Math . max ( max , var_3 ) ;
var_3 = 0 ;
var_6 = var_7 ;
var_7 = var_6 + 1 ;
}
}
return max ;
}
|
1,036 | <gouthampradhan>greedy_JumpGameII_1.java | public int jump(int[] nums) {
int step = 0;
int e = 0, max = 0;
for (int i = 0; i < nums.length - 1; i++) {
max = Math.max(max, i + nums[i]);
if (i == e) {
step++;
e = max;
}
}
return step;
} | public int sample_funcname ( int [ ] var_0 ) {
int var_2 = 0 ;
int var_3 = 0 , max = 0 ;
for ( int var_5 = 0 ;
var_5 < var_0 . length - 1 ;
var_5 ++ ) {
max = Math . max ( max , var_5 + var_0 [ var_5 ] ) ;
if ( var_5 == var_3 ) {
var_2 ++ ;
var_3 = max ;
}
}
return var_2 ;
}
|
1,037 | <gouthampradhan>dynamic_programming_ClimbingStairs_1.java | public int climbStairs(int n) {
if (n == 0 || n == 1) return 1;
int[] A = new int[n + 1];
A[n] = 1;
A[n - 1] = 1;
for (int i = n - 2; i >= 0; i--) A[i] = A[i + 1] + A[i + 2];
return A[0];
} | public int sample_funcname ( int var_0 ) {
if ( var_0 == 0 || var_0 == 1 ) return 1 ;
int [ ] var_3 = new int [ var_0 + 1 ] ;
var_3 [ var_0 ] = 1 ;
var_3 [ var_0 - 1 ] = 1 ;
for ( int var_5 = var_0 - 2 ;
var_5 >= 0 ;
var_5 -- ) var_3 [ var_5 ] = var_3 [ var_5 + 1 ] + var_3 [ var_5 + 2 ] ;
return var_3 [ 0 ] ;
}
|
1,038 | <gouthampradhan>array_MaximumSwap_1.java | public int maximumSwap(int num) {
int[] D = new int[10];
char[] A = String.valueOf(num).toCharArray();
for (int i = 0; i < A.length; i++) {
D[A[i] - '0'] = i;
}
boolean found = false;
for (int i = 0; i < A.length; i++) {
int digit = A[i] - '0';
for (int j = 9; j > digit; j--) {
if (D[j] > i) {
char temp = A[i];
A[i] = (char) (j + '0');
A[D[j]] = temp;
found = true;
break;
}
}
if (found) break;
}
return Integer.parseInt(String.valueOf(A));
} | public int sample_funcname ( int var_0 ) {
int [ ] var_2 = new int [ 10 ] ;
char [ ] var_6 = String . valueOf ( var_0 ) . toCharArray ( ) ;
for ( int var_8 = 0 ;
var_8 < var_6 . length ;
var_8 ++ ) {
var_2 [ var_6 [ var_8 ] - '0' ] = var_8 ;
}
boolean var_16 = false ;
for ( int var_8 = 0 ;
var_8 < var_6 . length ;
var_8 ++ ) {
int var_12 = var_6 [ var_8 ] - '0' ;
for ( int var_14 = 9 ;
var_14 > var_12 ;
var_14 -- ) {
if ( var_2 [ var_14 ] > var_8 ) {
char var_15 = var_6 [ var_8 ] ;
var_6 [ var_8 ] = ( char ) ( var_14 + '0' ) ;
var_6 [ var_2 [ var_14 ] ] = var_15 ;
var_16 = true ;
break ;
}
}
if ( var_16 ) break ;
}
return Integer . parseInt ( String . valueOf ( var_6 ) ) ;
}
|
1,039 | <gouthampradhan>backtracking_CombinationSumII_1.java | private void combination(
int i, int target, int[] candidates, List<Integer> row, List<List<Integer>> result) {
if (target == 0) {
result.add(new ArrayList<>(row));
} else if (target > 0) {
for (int j = i, l = candidates.length; j < l; j++) {
if (j > i && candidates[j] == candidates[j - 1]) continue;
row.add(candidates[j]);
combination(j + 1, target - candidates[j], candidates, row, result);
row.remove(row.size() - 1);
}
}
} | private void sample_funcname ( int i , int target , int [ ] candidates , List < Integer > row , List < List < Integer >> result ) {
if ( target == 0 ) {
result . add ( new ArrayList < > ( row ) ) ;
}
else if ( target > 0 ) {
for ( int j = i , l = candidates . length ;
j < l ;
j ++ ) {
if ( j > i && candidates [ j ] == candidates [ j - 1 ] ) continue ;
row . add ( candidates [ j ] ) ;
combination ( j + 1 , target - candidates [ j ] , candidates , row , result ) ;
row . remove ( row . size ( ) - 1 ) ;
}
}
}
|
1,040 | <gouthampradhan>greedy_ScoreAfterFlippingMatrix_2.java | private void flip(int[] A) {
for (int i = 0; i < A.length; i++) {
if (A[i] == 1) {
A[i] = 0;
} else {
A[i] = 1;
}
}
} | private void var_0 ( int [ ] var_1 ) {
for ( int var_3 = 0 ;
var_3 < var_1 . length ;
var_3 ++ ) {
if ( var_1 [ var_3 ] == 1 ) {
var_1 [ var_3 ] = 0 ;
}
else {
var_1 [ var_3 ] = 1 ;
}
}
}
|
1,041 | <gouthampradhan>string_ImplementStrStr_1.java | private boolean isEqual(String haystack, String needle, int i) {
int hL = haystack.length();
int nL = needle.length();
int j = 0;
while (i < hL && j < nL) {
if (haystack.charAt(i) != needle.charAt(j)) return false;
i++;
j++;
}
return j >= nL;
} | private boolean var_0 ( String var_2 , String var_3 , int var_4 ) {
int var_6 = var_2 . length ( ) ;
int var_7 = var_3 . length ( ) ;
int var_9 = 0 ;
while ( var_4 < var_6 && var_9 < var_7 ) {
if ( var_2 . charAt ( var_4 ) != var_3 . charAt ( var_9 ) ) return false ;
var_4 ++ ;
var_9 ++ ;
}
return var_9 >= var_7 ;
}
|
1,042 | <gouthampradhan>array_RelativeSortArray_1.java | public int[] relativeSortArray(int[] arr1, int[] arr2) {
List<Integer> notPresent = new ArrayList<>();
Map<Integer, Integer> map = new HashMap<>();
Set<Integer> set = new HashSet<>();
for (int i : arr2) {
set.add(i);
}
for (int i : arr1) {
map.putIfAbsent(i, 0);
map.put(i, map.get(i) + 1);
}
List<Integer> result = new ArrayList<>();
for (int i : arr2) {
int count = map.get(i);
for (int j = 0; j < count; j++) {
result.add(i);
}
}
for (int k : map.keySet()) {
if (!set.contains(k)) {
int count = map.get(k);
for (int i = 0; i < count; i++) {
notPresent.add(k);
}
}
}
notPresent.sort(Comparator.comparingInt(o -> o));
result.addAll(notPresent);
int[] resA = new int[result.size()];
for (int i = 0; i < result.size(); i++) {
resA[i] = result.get(i);
}
return resA;
} | public int [ ] sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
List < Integer > var_5 = new ArrayList < > ( ) ;
Map < Integer , Integer > var_8 = new HashMap < > ( ) ;
Set < Integer > var_11 = new HashSet < > ( ) ;
for ( int var_12 : var_1 ) {
var_11 . add ( var_12 ) ;
}
for ( int var_12 : var_0 ) {
var_8 . putIfAbsent ( var_12 , 0 ) ;
var_8 . put ( var_12 , var_8 . get ( var_12 ) + 1 ) ;
}
List < Integer > var_19 = new ArrayList < > ( ) ;
for ( int var_12 : var_1 ) {
int var_20 = var_8 . get ( var_12 ) ;
for ( int var_21 = 0 ;
var_21 < var_20 ;
var_21 ++ ) {
var_19 . add ( var_12 ) ;
}
}
for ( int var_23 : var_8 . keySet ( ) ) {
if ( ! var_11 . contains ( var_23 ) ) {
int var_20 = var_8 . get ( var_23 ) ;
for ( int var_12 = 0 ;
var_12 < var_20 ;
var_12 ++ ) {
var_5 . add ( var_23 ) ;
}
}
}
var_5 . sort ( Comparator . comparingInt ( var_28 -> var_28 ) ) ;
var_19 . addAll ( var_5 ) ;
int [ ] var_31 = new int [ var_19 . size ( ) ] ;
for ( int var_12 = 0 ;
var_12 < var_19 . size ( ) ;
var_12 ++ ) {
var_31 [ var_12 ] = var_19 . get ( var_12 ) ;
}
return var_31 ;
}
|
1,043 | <gouthampradhan>binary_search_SqrtX_1.java | public int mySqrt(int x) {
int s = 0, e = x;
long ans = 0L;
while (s <= e) {
long m = s + (e - s) / 2;
long prod = m * m;
if (prod <= x) {
s = (int) (m + 1);
ans = m;
} else e = (int) m - 1;
}
return (int) ans;
} | public int sample_funcname ( int var_0 ) {
int var_2 = 0 , var_3 = var_0 ;
long var_5 = 0L ;
while ( var_2 <= var_3 ) {
long var_7 = var_2 + ( var_3 - var_2 ) / 2 ;
long var_8 = var_7 * var_7 ;
if ( var_8 <= var_0 ) {
var_2 = ( int ) ( var_7 + 1 ) ;
var_5 = var_7 ;
}
else var_3 = ( int ) var_7 - 1 ;
}
return ( int ) var_5 ;
}
|
1,044 | <gouthampradhan>breadth_first_search_SlidingPuzzle_1.java | private int[][] clone(int[][] original) {
int[][] cloned = new int[2][3];
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 3; j++) {
cloned[i][j] = original[i][j];
}
}
return cloned;
} | private int [ ] [ ] sample_funcname ( int [ ] [ ] var_0 ) {
int [ ] [ ] var_3 = new int [ 2 ] [ 3 ] ;
for ( int var_5 = 0 ;
var_5 < 2 ;
var_5 ++ ) {
for ( int var_6 = 0 ;
var_6 < 3 ;
var_6 ++ ) {
var_3 [ var_5 ] [ var_6 ] = var_0 [ var_5 ] [ var_6 ] ;
}
}
return var_3 ;
}
|
1,045 | <gouthampradhan>array_SubArraysWithBoundedMaximum_1.java | public int numSubarrayBoundedMax(int[] A, int L, int R) {
int[] DP = new int[A.length];
int v = -1;
for (int i = A.length - 1; i >= 0; i--) {
if (A[i] >= L && A[i] <= R) {
if (v != -1) {
DP[i] = v - i + 1;
} else {
DP[i] = 1;
v = i;
}
} else if (A[i] < L) {
if (v == -1) {
v = i;
}
if (i + 1 < A.length) {
if (A[i + 1] < L || (A[i + 1] >= L && A[i + 1] <= R)) {
DP[i] = DP[i + 1];
} else {
DP[i] = 0;
}
}
} else {
v = -1;
}
}
int sum = 0;
for (int i = 0; i < DP.length; i++) {
sum += DP[i];
}
return sum;
} | public int sample_funcname ( int [ ] var_0 , int var_1 , int var_2 ) {
int [ ] var_4 = new int [ var_0 . length ] ;
int var_6 = - 1 ;
for ( int var_7 = var_0 . length - 1 ;
var_7 >= 0 ;
var_7 -- ) {
if ( var_0 [ var_7 ] >= var_1 && var_0 [ var_7 ] <= var_2 ) {
if ( var_6 != - 1 ) {
var_4 [ var_7 ] = var_6 - var_7 + 1 ;
}
else {
var_4 [ var_7 ] = 1 ;
var_6 = var_7 ;
}
}
else if ( var_0 [ var_7 ] < var_1 ) {
if ( var_6 == - 1 ) {
var_6 = var_7 ;
}
if ( var_7 + 1 < var_0 . length ) {
if ( var_0 [ var_7 + 1 ] < var_1 || ( var_0 [ var_7 + 1 ] >= var_1 && var_0 [ var_7 + 1 ] <= var_2 ) ) {
var_4 [ var_7 ] = var_4 [ var_7 + 1 ] ;
}
else {
var_4 [ var_7 ] = 0 ;
}
}
}
else {
var_6 = - 1 ;
}
}
int var_9 = 0 ;
for ( int var_7 = 0 ;
var_7 < var_4 . length ;
var_7 ++ ) {
var_9 += var_4 [ var_7 ] ;
}
return var_9 ;
}
|
1,046 | <gouthampradhan>two_pointers_MinimumSizeSubarraySum_1.java | public int minSubArrayLen(int s, int[] nums) {
int sum = 0, count = 0, min = Integer.MAX_VALUE;
for (int i = 0, j = 0; j < nums.length; ) {
if (nums[j] >= s) {
return 1;
} else {
sum += nums[j];
count++;
if (sum >= s) {
min = Math.min(min, count);
while (j > i) {
sum -= nums[i];
count--;
i++;
if (sum < s) break;
min = Math.min(min, count);
}
}
}
j++;
}
if (min == Integer.MAX_VALUE) {
return 0;
}
return min;
} | public int sample_funcname ( int var_0 , int [ ] var_1 ) {
int var_3 = 0 , var_4 = 0 , min = Integer . MAX_VALUE ;
for ( int var_8 = 0 , var_9 = 0 ;
var_9 < var_1 . length ;
) {
if ( var_1 [ var_9 ] >= var_0 ) {
return 1 ;
}
else {
var_3 += var_1 [ var_9 ] ;
var_4 ++ ;
if ( var_3 >= var_0 ) {
min = Math . min ( min , var_4 ) ;
while ( var_9 > var_8 ) {
var_3 -= var_1 [ var_8 ] ;
var_4 -- ;
var_8 ++ ;
if ( var_3 < var_0 ) break ;
min = Math . min ( min , var_4 ) ;
}
}
}
var_9 ++ ;
}
if ( min == Integer . MAX_VALUE ) {
return 0 ;
}
return min ;
}
|
1,047 | <gouthampradhan>string_MinimumAddtoMakeParenthesesValid_1.java | public int minAddToMakeValid(String S) {
int result = 0;
int open = 0;
for (char c : S.toCharArray()) {
if (c == '(') {
open++;
} else if (c == ')') {
if (open > 0) {
open--;
} else result++;
}
}
return result + open;
} | public int sample_funcname ( String var_1 ) {
int var_3 = 0 ;
int var_4 = 0 ;
for ( char var_6 : var_1 . toCharArray ( ) ) {
if ( var_6 == '(' ) {
var_4 ++ ;
}
else if ( var_6 == ')' ) {
if ( var_4 > 0 ) {
var_4 -- ;
}
else var_3 ++ ;
}
}
return var_3 + var_4 ;
}
|
1,048 | <gouthampradhan>two_pointers_RemoveDuplicates_1.java | public int removeDuplicates(int[] nums) {
if (nums.length == 1) return 1;
int size = 1;
for (int j = 0, i = 1; i < nums.length; i++) {
if (nums[i] != nums[i - 1]) {
size++;
j++;
nums[j] = nums[i];
}
}
return size;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 1 ) return 1 ;
int var_3 = 1 ;
for ( int var_5 = 0 , var_6 = 1 ;
var_6 < var_0 . length ;
var_6 ++ ) {
if ( var_0 [ var_6 ] != var_0 [ var_6 - 1 ] ) {
var_3 ++ ;
var_5 ++ ;
var_0 [ var_5 ] = var_0 [ var_6 ] ;
}
}
return var_3 ;
}
|
1,049 | <gouthampradhan>math_LargestComponentSizebyCommonFactor_1.java | private List<Integer> primes(int N, int[] A) {
boolean[] P = new boolean[N + 1];
int[] pF = new int[N + 1];
int sqRt = (int) Math.sqrt(N);
for (int i = 2; i <= sqRt; i++) {
if (!P[i]) {
for (int j = 2; ; j++) {
if (i * j > N) break;
P[i * j] = true;
if (pF[i * j] == 0) {
pF[i * j] = i;
}
}
}
}
Map<Integer, Integer> result = new HashMap<>();
for (int a : A) {
if (a == 1) continue;
int n = pF[a];
while (n != 0) {
result.putIfAbsent(n, 0);
result.put(n, result.get(n) + 1);
a /= n;
n = pF[a];
}
result.putIfAbsent(a, 0);
result.put(a, result.get(a) + 1);
}
return result.keySet().stream().filter(x -> result.get(x) > 1).collect(Collectors.toList());
} | private List < Integer > var_1 ( int var_2 , int [ ] var_3 ) {
boolean [ ] var_6 = new boolean [ var_2 + 1 ] ;
int [ ] var_7 = new int [ var_2 + 1 ] ;
int var_10 = ( int ) Math . sqrt ( var_2 ) ;
for ( int var_12 = 2 ;
var_12 <= var_10 ;
var_12 ++ ) {
if ( ! var_6 [ var_12 ] ) {
for ( int var_13 = 2 ;
;
var_13 ++ ) {
if ( var_12 * var_13 > var_2 ) break ;
var_6 [ var_12 * var_13 ] = true ;
if ( var_7 [ var_12 * var_13 ] == 0 ) {
var_7 [ var_12 * var_13 ] = var_12 ;
}
}
}
}
Map < Integer , Integer > var_17 = new HashMap < > ( ) ;
for ( int var_18 : var_3 ) {
if ( var_18 == 1 ) continue ;
int var_19 = var_7 [ var_18 ] ;
while ( var_19 != 0 ) {
var_17 . putIfAbsent ( var_19 , 0 ) ;
var_17 . put ( var_19 , var_17 . get ( var_19 ) + 1 ) ;
var_18 /= var_19 ;
var_19 = var_7 [ var_18 ] ;
}
var_17 . putIfAbsent ( var_18 , 0 ) ;
var_17 . put ( var_18 , var_17 . get ( var_18 ) + 1 ) ;
}
return var_17 . keySet ( ) . stream ( ) . filter ( var_26 -> var_17 . get ( var_26 ) > 1 ) . collect ( Collectors . toList ( ) ) ;
}
|
1,050 | <gouthampradhan>string_StringCompression_1.java | public int compress(char[] chars) {
int count = 0;
int i = 0;
int p = 0;
for (int j = 0; j < chars.length; j++) {
if (chars[i] == chars[j]) {
count++;
} else {
chars[p] = chars[i];
p++;
if (count > 1) {
String countStr = String.valueOf(count);
for (int l = 0; l < countStr.length(); l++) {
chars[p++] = countStr.charAt(l);
}
}
i = j;
count = 1;
}
}
chars[p] = chars[i];
p++;
if (count > 1) {
String countStr = String.valueOf(count);
for (int l = 0; l < countStr.length(); l++) {
chars[p++] = countStr.charAt(l);
}
}
return p;
} | public int sample_funcname ( char [ ] var_0 ) {
int var_2 = 0 ;
int var_3 = 0 ;
int var_4 = 0 ;
for ( int var_5 = 0 ;
var_5 < var_0 . length ;
var_5 ++ ) {
if ( var_0 [ var_3 ] == var_0 [ var_5 ] ) {
var_2 ++ ;
}
else {
var_0 [ var_4 ] = var_0 [ var_3 ] ;
var_4 ++ ;
if ( var_2 > 1 ) {
String var_10 = String . valueOf ( var_2 ) ;
for ( int var_11 = 0 ;
var_11 < var_10 . length ( ) ;
var_11 ++ ) {
var_0 [ var_4 ++ ] = var_10 . charAt ( var_11 ) ;
}
}
var_3 = var_5 ;
var_2 = 1 ;
}
}
var_0 [ var_4 ] = var_0 [ var_3 ] ;
var_4 ++ ;
if ( var_2 > 1 ) {
String var_10 = String . valueOf ( var_2 ) ;
for ( int var_11 = 0 ;
var_11 < var_10 . length ( ) ;
var_11 ++ ) {
var_0 [ var_4 ++ ] = var_10 . charAt ( var_11 ) ;
}
}
return var_4 ;
}
|
1,051 | <gouthampradhan>string_FindTheClosestPalindrome_3.java | private boolean isPaliandrome(String s) {
for (int i = 0, j = s.length() - 1; i < j; i++, j--) {
if (s.charAt(i) != s.charAt(j)) {
return false;
}
}
return true;
} | private boolean var_0 ( String var_2 ) {
for ( int var_4 = 0 , var_7 = var_2 . length ( ) - 1 ;
var_4 < var_7 ;
var_4 ++ , var_7 -- ) {
if ( var_2 . charAt ( var_4 ) != var_2 . charAt ( var_7 ) ) {
return false ;
}
}
return true ;
}
|
1,052 | <gouthampradhan>array_CanPlaceFlowers_1.java | public boolean canPlaceFlowers(int[] flowerbed, int n) {
int[] T = new int[flowerbed.length + 4];
for (int i = 0, j = 2; i < flowerbed.length; i++) T[j++] = flowerbed[i];
T[0] = 1;
T[T.length - 1] = 1;
int total = 0, count = 0;
for (int i = 1; i < T.length; i++) {
if (T[i] == 0) count++;
else {
if ((count % 2) == 0) total += ((count / 2) - 1);
else total += (count / 2);
count = 0;
}
}
return (total >= n);
} | public boolean var_0 ( int [ ] var_1 , int var_2 ) {
int [ ] var_5 = new int [ var_1 . length + 4 ] ;
for ( int var_7 = 0 , var_9 = 2 ;
var_7 < var_1 . length ;
var_7 ++ ) var_5 [ var_9 ++ ] = var_1 [ var_7 ] ;
var_5 [ 0 ] = 1 ;
var_5 [ var_5 . length - 1 ] = 1 ;
int var_11 = 0 , var_12 = 0 ;
for ( int var_7 = 1 ;
var_7 < var_5 . length ;
var_7 ++ ) {
if ( var_5 [ var_7 ] == 0 ) var_12 ++ ;
else {
if ( ( var_12 % 2 ) == 0 ) var_11 += ( ( var_12 / 2 ) - 1 ) ;
else var_11 += ( var_12 / 2 ) ;
var_12 = 0 ;
}
}
return ( var_11 >= var_2 ) ;
}
|
1,053 | <gouthampradhan>dynamic_programming_BestTimeToBuyAndSellStocksWithFee_1.java | public int maxProfit(int[] prices, int fee) {
int cash = 0, stock = -prices[0];
for (int i = 1; i < prices.length; i++) {
cash = Math.max(cash, prices[i] + stock - fee);
stock = Math.max(stock, cash - prices[i]);
}
return cash;
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
int var_3 = 0 , var_4 = - var_0 [ 0 ] ;
for ( int var_6 = 1 ;
var_6 < var_0 . length ;
var_6 ++ ) {
var_3 = Math . max ( var_3 , var_0 [ var_6 ] + var_4 - var_1 ) ;
var_4 = Math . max ( var_4 , var_3 - var_0 [ var_6 ] ) ;
}
return var_3 ;
}
|
1,054 | <gouthampradhan>array_LargestTimeForGivenDigits_1.java | public String largestTimeFromDigits(int[] A) {
int max = -1;
String result = "";
for (int i = 0; i < A.length; i++) {
if (A[i] > 2) continue;
for (int j = 0; j < A.length; j++) {
if (j == i) continue;
if (A[i] == 2 && A[j] > 3) continue;
for (int k = 0; k < A.length; k++) {
if (k == i || k == j) continue;
if (A[k] > 5) continue;
for (int l = 0; l < A.length; l++) {
if (l == i || l == j || l == k) continue;
int value = ((A[i] * 10 + A[j]) * 60) + A[k] * 10 + A[l];
if (value > max) {
max = value;
result = A[i] + "" + A[j] + ":" + A[k] + "" + A[l];
}
}
}
}
}
return result;
} | public String var_0 ( int [ ] var_1 ) {
int var_3 = - 1 ;
String var_6 = "" ;
for ( int var_8 = 0 ;
var_8 < var_1 . length ;
var_8 ++ ) {
if ( var_1 [ var_8 ] > 2 ) continue ;
for ( int var_11 = 0 ;
var_11 < var_1 . length ;
var_11 ++ ) {
if ( var_11 == var_8 ) continue ;
if ( var_1 [ var_8 ] == 2 && var_1 [ var_11 ] > 3 ) continue ;
for ( int var_13 = 0 ;
var_13 < var_1 . length ;
var_13 ++ ) {
if ( var_13 == var_8 || var_13 == var_11 ) continue ;
if ( var_1 [ var_13 ] > 5 ) continue ;
for ( int var_15 = 0 ;
var_15 < var_1 . length ;
var_15 ++ ) {
if ( var_15 == var_8 || var_15 == var_11 || var_15 == var_13 ) continue ;
int var_18 = ( ( var_1 [ var_8 ] * 10 + var_1 [ var_11 ] ) * 60 ) + var_1 [ var_13 ] * 10 + var_1 [ var_15 ] ;
if ( var_18 > var_3 ) {
var_3 = var_18 ;
var_6 = var_1 [ var_8 ] + "" + var_1 [ var_11 ] + ":" + var_1 [ var_13 ] + "" + var_1 [ var_15 ] ;
}
}
}
}
}
return var_6 ;
}
|
1,055 | <gouthampradhan>greedy_ScoreAfterFlippingMatrix_1.java | private int makeNum(int[] a) {
int n = 0;
for (int i = 0; i < a.length; i++) {
if (a[i] == 1) {
n |= (1 << (a.length - i - 1));
}
}
return n;
} | private int sample_funcname ( int [ ] var_0 ) {
int var_2 = 0 ;
for ( int var_3 = 0 ;
var_3 < var_0 . length ;
var_3 ++ ) {
if ( var_0 [ var_3 ] == 1 ) {
var_2 |= ( 1 << ( var_0 . length - var_3 - 1 ) ) ;
}
}
return var_2 ;
}
|
1,056 | <gouthampradhan>math_SmallestRangeI_1.java | public int smallestRangeI(int[] A, int K) {
Arrays.sort(A);
if (A.length == 0 || A.length == 1) return 0;
else {
int low = A[0];
int high = A[A.length - 1];
int l = low + (K);
int r = high - (K);
if (r > l) return r - l;
else return 0;
}
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
Arrays . sort ( var_0 ) ;
if ( var_0 . length == 0 || var_0 . length == 1 ) return 0 ;
else {
int var_7 = var_0 [ 0 ] ;
int var_8 = var_0 [ var_0 . length - 1 ] ;
int var_9 = var_7 + ( var_1 ) ;
int var_10 = var_8 - ( var_1 ) ;
if ( var_10 > var_9 ) return var_10 - var_9 ;
else return 0 ;
}
}
|
1,057 | <gouthampradhan>array_ReadNCharacters_1.java | private int read4(char[] buf) {
return 1;
} | private int sample_funcname ( char [ ] var_0 ) {
return 1 ;
}
|
1,058 | <gouthampradhan>dynamic_programming_MinimumNumberOfRefuelingStops_1.java | public int minRefuelStops(int target, int startFuel, int[][] stations) {
long[] dp = new long[stations.length + 1];
dp[0] = startFuel;
for (int i = 0; i < stations.length; i++) {
int d = stations[i][0];
int f = stations[i][1];
for (int j = i; j >= 0; j--) {
if (dp[j] >= d) {
dp[j + 1] = Math.max(dp[j + 1], dp[j] + f);
}
}
}
for (int i = 0; i < dp.length; i++) {
if (dp[i] >= target) {
return i;
}
}
return -1;
} | public int sample_funcname ( int var_0 , int var_1 , int [ ] [ ] var_2 ) {
long [ ] var_5 = new long [ var_2 . length + 1 ] ;
var_5 [ 0 ] = var_1 ;
for ( int var_7 = 0 ;
var_7 < var_2 . length ;
var_7 ++ ) {
int var_8 = var_2 [ var_7 ] [ 0 ] ;
int var_9 = var_2 [ var_7 ] [ 1 ] ;
for ( int var_10 = var_7 ;
var_10 >= 0 ;
var_10 -- ) {
if ( var_5 [ var_10 ] >= var_8 ) {
var_5 [ var_10 + 1 ] = Math . max ( var_5 [ var_10 + 1 ] , var_5 [ var_10 ] + var_9 ) ;
}
}
}
for ( int var_7 = 0 ;
var_7 < var_5 . length ;
var_7 ++ ) {
if ( var_5 [ var_7 ] >= var_0 ) {
return var_7 ;
}
}
return - 1 ;
}
|
1,059 | <gouthampradhan>array_MaxConsecutiveOnesII_1.java | public int findMaxConsecutiveOnes(int[] nums) {
int[] L = new int[nums.length];
int[] R = new int[nums.length];
boolean flag = false;
int count = 0;
int max = 0;
for (int j = 0; j < nums.length; j++) {
if (nums[j] == 1) {
if (!flag) {
flag = true;
}
count++;
L[j] = count;
} else {
count = 0;
flag = false;
L[j] = count;
}
max = Math.max(max, count);
}
flag = false;
count = 0;
for (int j = nums.length - 1; j >= 0; j--) {
if (nums[j] == 1) {
if (!flag) {
flag = true;
}
count++;
R[j] = count;
} else {
count = 0;
flag = false;
R[j] = count;
}
}
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 0) {
int l = i == 0 ? 0 : L[i - 1];
int r = i == nums.length - 1 ? 0 : R[i + 1];
max = Math.max(max, l + r + 1);
}
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
int [ ] var_2 = new int [ var_0 . length ] ;
int [ ] var_3 = new int [ var_0 . length ] ;
boolean var_10 = false ;
int var_6 = 0 ;
int max = 0 ;
for ( int var_8 = 0 ;
var_8 < var_0 . length ;
var_8 ++ ) {
if ( var_0 [ var_8 ] == 1 ) {
if ( ! var_10 ) {
var_10 = true ;
}
var_6 ++ ;
var_2 [ var_8 ] = var_6 ;
}
else {
var_6 = 0 ;
var_10 = false ;
var_2 [ var_8 ] = var_6 ;
}
max = Math . max ( max , var_6 ) ;
}
var_10 = false ;
var_6 = 0 ;
for ( int var_8 = var_0 . length - 1 ;
var_8 >= 0 ;
var_8 -- ) {
if ( var_0 [ var_8 ] == 1 ) {
if ( ! var_10 ) {
var_10 = true ;
}
var_6 ++ ;
var_3 [ var_8 ] = var_6 ;
}
else {
var_6 = 0 ;
var_10 = false ;
var_3 [ var_8 ] = var_6 ;
}
}
for ( int var_12 = 0 ;
var_12 < var_0 . length ;
var_12 ++ ) {
if ( var_0 [ var_12 ] == 0 ) {
int var_13 = var_12 == 0 ? 0 : var_2 [ var_12 - 1 ] ;
int var_14 = var_12 == var_0 . length - 1 ? 0 : var_3 [ var_12 + 1 ] ;
max = Math . max ( max , var_13 + var_14 + 1 ) ;
}
}
return max ;
}
|
1,060 | <gouthampradhan>dynamic_programming_MinCostClimbingStairs_1.java | public int minCostClimbingStairs(int[] cost) {
for (int i = cost.length - 1; i >= 0; i--) {
if (i + 1 < cost.length && i + 2 < cost.length) {
cost[i] = Math.min(cost[i] + cost[i + 1], cost[i] + cost[i + 2]);
}
}
return Math.min(cost[0], cost[1]);
} | public int sample_funcname ( int [ ] var_0 ) {
for ( int var_3 = var_0 . length - 1 ;
var_3 >= 0 ;
var_3 -- ) {
if ( var_3 + 1 < var_0 . length && var_3 + 2 < var_0 . length ) {
var_0 [ var_3 ] = Math . min ( var_0 [ var_3 ] + var_0 [ var_3 + 1 ] , var_0 [ var_3 ] + var_0 [ var_3 + 2 ] ) ;
}
}
return Math . min ( var_0 [ 0 ] , var_0 [ 1 ] ) ;
}
|
1,061 | <gouthampradhan>math_ProjectionAreaOf3DShapes_1.java | public int projectionArea(int[][] grid) {
int area = 0;
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid.length; j++) {
area += (grid[i][j] > 0 ? 1 : 0);
}
}
for (int i = 0; i < grid.length; i++) {
int max = 0;
for (int j = 0; j < grid[0].length; j++) {
max = Math.max(max, grid[i][j]);
}
area += max;
}
for (int i = 0; i < grid[0].length; i++) {
int max = 0;
for (int j = 0; j < grid.length; j++) {
max = Math.max(max, grid[j][i]);
}
area += max;
}
return area;
} | public int sample_funcname ( int [ ] [ ] var_0 ) {
int var_2 = 0 ;
for ( int var_3 = 0 ;
var_3 < var_0 . length ;
var_3 ++ ) {
for ( int var_5 = 0 ;
var_5 < var_0 . length ;
var_5 ++ ) {
var_2 += ( var_0 [ var_3 ] [ var_5 ] > 0 ? 1 : 0 ) ;
}
}
for ( int var_3 = 0 ;
var_3 < var_0 . length ;
var_3 ++ ) {
int max = 0 ;
for ( int var_5 = 0 ;
var_5 < var_0 [ 0 ] . length ;
var_5 ++ ) {
max = Math . max ( max , var_0 [ var_3 ] [ var_5 ] ) ;
}
var_2 += max ;
}
for ( int var_3 = 0 ;
var_3 < var_0 [ 0 ] . length ;
var_3 ++ ) {
int max = 0 ;
for ( int var_5 = 0 ;
var_5 < var_0 . length ;
var_5 ++ ) {
max = Math . max ( max , var_0 [ var_5 ] [ var_3 ] ) ;
}
var_2 += max ;
}
return var_2 ;
}
|
1,062 | <gouthampradhan>two_pointers_SubarrayProductLessThanK_1.java | public int numSubarrayProductLessThanK(int[] nums, int k) {
long prod = 1;
int count = 0;
Queue<Integer> queue = new ArrayDeque<>();
for (int i = 0; i < nums.length; i++) {
if (nums[i] < k) {
count++;
if ((prod * nums[i]) < k) {
prod *= nums[i];
if (!queue.isEmpty()) {
count += (i - queue.peek());
}
} else {
while (!queue.isEmpty()) {
int last = queue.poll();
prod /= nums[last];
if ((prod * nums[i]) < k) {
prod = prod * nums[i];
if (!queue.isEmpty()) {
count += (i - queue.peek());
}
break;
}
}
}
if (queue.isEmpty()) {
prod = nums[i];
}
queue.offer(i);
} else {
queue.clear();
}
}
return count;
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
long var_3 = 1 ;
int var_5 = 0 ;
Queue < Integer > var_9 = new ArrayDeque < > ( ) ;
for ( int var_10 = 0 ;
var_10 < var_0 . length ;
var_10 ++ ) {
if ( var_0 [ var_10 ] < var_1 ) {
var_5 ++ ;
if ( ( var_3 * var_0 [ var_10 ] ) < var_1 ) {
var_3 *= var_0 [ var_10 ] ;
if ( ! var_9 . isEmpty ( ) ) {
var_5 += ( var_10 - var_9 . peek ( ) ) ;
}
}
else {
while ( ! var_9 . isEmpty ( ) ) {
int var_15 = var_9 . poll ( ) ;
var_3 /= var_0 [ var_15 ] ;
if ( ( var_3 * var_0 [ var_10 ] ) < var_1 ) {
var_3 = var_3 * var_0 [ var_10 ] ;
if ( ! var_9 . isEmpty ( ) ) {
var_5 += ( var_10 - var_9 . peek ( ) ) ;
}
break ;
}
}
}
if ( var_9 . isEmpty ( ) ) {
var_3 = var_0 [ var_10 ] ;
}
var_9 . offer ( var_10 ) ;
}
else {
var_9 . clear ( ) ;
}
}
return var_5 ;
}
|
1,063 | <gouthampradhan>backtracking_RegularExpressionMatching_1.java | private boolean backTrack(int si, int pi, String s, String p) {
if (si >= s.length() && pi >= p.length())
return true;
else {
if (pi >= p.length()) return false;
else if (si >= s.length()) {
if (pi + 1 < p.length() && p.charAt(pi + 1) == '*') {
return backTrack(si, pi + 2, s, p);
} else
return false;
} else if (s.charAt(si) == p.charAt(pi) || p.charAt(pi) == '.') {
if (pi + 1 < p.length() && p.charAt(pi + 1) == '*') {
if (backTrack(si, pi + 2, s, p)) return true;
for (int i = si, l = s.length(); i < l; i++) {
if (s.charAt(i) == p.charAt(pi) || p.charAt(pi) == '.') {
if (backTrack(i + 1, pi + 2, s, p)) return true;
} else {
return false;
}
}
return backTrack(s.length(), pi, s, p);
} else {
return backTrack(si + 1, pi + 1, s, p);
}
} else {
if (pi + 1 < p.length() && p.charAt(pi + 1) == '*') {
return backTrack(si, pi + 2, s, p);
} else return false;
}
}
} | private boolean sample_funcname ( int si , int pi , String s , String p ) {
if ( si >= s . length ( ) && pi >= p . length ( ) ) return true ;
else {
if ( pi >= p . length ( ) ) return false ;
else if ( si >= s . length ( ) ) {
if ( pi + 1 < p . length ( ) && p . charAt ( pi + 1 ) == '*' ) {
return backTrack ( si , pi + 2 , s , p ) ;
}
else return false ;
}
else if ( s . charAt ( si ) == p . charAt ( pi ) || p . charAt ( pi ) == '.' ) {
if ( pi + 1 < p . length ( ) && p . charAt ( pi + 1 ) == '*' ) {
if ( backTrack ( si , pi + 2 , s , p ) ) return true ;
for ( int i = si , l = s . length ( ) ;
i < l ;
i ++ ) {
if ( s . charAt ( i ) == p . charAt ( pi ) || p . charAt ( pi ) == '.' ) {
if ( backTrack ( i + 1 , pi + 2 , s , p ) ) return true ;
}
else {
return false ;
}
}
return backTrack ( s . length ( ) , pi , s , p ) ;
}
else {
return backTrack ( si + 1 , pi + 1 , s , p ) ;
}
}
else {
if ( pi + 1 < p . length ( ) && p . charAt ( pi + 1 ) == '*' ) {
return backTrack ( si , pi + 2 , s , p ) ;
}
else return false ;
}
}
}
|
1,064 | <gouthampradhan>array_BestMeetingPoint_1.java | public int minTotalDistance(int[][] grid) {
int[] countR = new int[grid.length];
int[] countC = new int[grid[0].length];
int[] distR = new int[grid.length];
int[] distC = new int[grid[0].length];
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[0].length; j++) {
if (grid[i][j] == 1) {
countR[i]++;
countC[j]++;
}
}
}
for (int i = 0; i < distR.length; i++) {
for (int j = 0; j < distR.length; j++) {
if (countR[j] != 0) {
distR[i] += Math.abs(j - i) * countR[j];
}
}
}
for (int i = 0; i < distC.length; i++) {
for (int j = 0; j < distC.length; j++) {
if (countC[j] != 0) {
distC[i] += Math.abs(j - i) * countC[j];
}
}
}
int min = Integer.MAX_VALUE;
for (int i = 0; i < distR.length; i++) {
for (int j = 0; j < distC.length; j++) {
min = Math.min(min, distR[i] + distC[j]);
}
}
return min;
} | public int sample_funcname ( int [ ] [ ] var_0 ) {
int [ ] var_2 = new int [ var_0 . length ] ;
int [ ] var_4 = new int [ var_0 [ 0 ] . length ] ;
int [ ] var_5 = new int [ var_0 . length ] ;
int [ ] var_6 = new int [ var_0 [ 0 ] . length ] ;
for ( int var_7 = 0 ;
var_7 < var_0 . length ;
var_7 ++ ) {
for ( int var_8 = 0 ;
var_8 < var_0 [ 0 ] . length ;
var_8 ++ ) {
if ( var_0 [ var_7 ] [ var_8 ] == 1 ) {
var_2 [ var_7 ] ++ ;
var_4 [ var_8 ] ++ ;
}
}
}
for ( int var_7 = 0 ;
var_7 < var_5 . length ;
var_7 ++ ) {
for ( int var_8 = 0 ;
var_8 < var_5 . length ;
var_8 ++ ) {
if ( var_2 [ var_8 ] != 0 ) {
var_5 [ var_7 ] += Math . abs ( var_8 - var_7 ) * var_2 [ var_8 ] ;
}
}
}
for ( int var_7 = 0 ;
var_7 < var_6 . length ;
var_7 ++ ) {
for ( int var_8 = 0 ;
var_8 < var_6 . length ;
var_8 ++ ) {
if ( var_4 [ var_8 ] != 0 ) {
var_6 [ var_7 ] += Math . abs ( var_8 - var_7 ) * var_4 [ var_8 ] ;
}
}
}
int min = Integer . MAX_VALUE ;
for ( int var_7 = 0 ;
var_7 < var_5 . length ;
var_7 ++ ) {
for ( int var_8 = 0 ;
var_8 < var_6 . length ;
var_8 ++ ) {
min = Math . min ( min , var_5 [ var_7 ] + var_6 [ var_8 ] ) ;
}
}
return min ;
}
|
1,065 | <gouthampradhan>two_pointers_MoveZeroes_1.java | public void moveZeroes(int[] nums) {
int i = 0;
for (int j = 0, l = nums.length; j < l; ) {
if (nums[j] == 0) j++;
else {
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
i++;
j++;
}
}
while (i < nums.length) nums[i++] = 0;
} | public void var_0 ( int [ ] var_1 ) {
int var_3 = 0 ;
for ( int var_4 = 0 , var_6 = var_1 . length ;
var_4 < var_6 ;
) {
if ( var_1 [ var_4 ] == 0 ) var_4 ++ ;
else {
int var_7 = var_1 [ var_3 ] ;
var_1 [ var_3 ] = var_1 [ var_4 ] ;
var_1 [ var_4 ] = var_7 ;
var_3 ++ ;
var_4 ++ ;
}
}
while ( var_3 < var_1 . length ) var_1 [ var_3 ++ ] = 0 ;
}
|
1,066 | <gouthampradhan>breadth_first_search_BusRoutes_1.java | private boolean intersect(int[] A, int[] B) {
for (int i = 0, j = 0; i < A.length && j < B.length; ) {
if (A[i] == B[j]) return true;
else if (A[i] < B[j]) i++;
else j++;
}
return false;
} | private boolean var_0 ( int [ ] var_1 , int [ ] var_2 ) {
for ( int var_4 = 0 , var_5 = 0 ;
var_4 < var_1 . length && var_5 < var_2 . length ;
) {
if ( var_1 [ var_4 ] == var_2 [ var_5 ] ) return true ;
else if ( var_1 [ var_4 ] < var_2 [ var_5 ] ) var_4 ++ ;
else var_5 ++ ;
}
return false ;
}
|
1,067 | <gouthampradhan>backtracking_PalindromePartitioning_1.java | private boolean isPalindrome(String s) {
int i = 0, j = s.length() - 1;
while (i <= j) {
if (s.charAt(i) != s.charAt(j)) return false;
i++;
j--;
}
return true;
} | private boolean var_0 ( String var_2 ) {
int var_4 = 0 , var_7 = var_2 . length ( ) - 1 ;
while ( var_4 <= var_7 ) {
if ( var_2 . charAt ( var_4 ) != var_2 . charAt ( var_7 ) ) return false ;
var_4 ++ ;
var_7 -- ;
}
return true ;
}
|
1,068 | <gouthampradhan>bit_manipulation_DivideTwoIntegers_1.java | public int divide(int dividend, int divisor) {
if (divisor == 0) return Integer.MAX_VALUE;
else if (dividend == Integer.MIN_VALUE && divisor == -1) return Integer.MAX_VALUE;
else if (divisor == 1) return dividend;
boolean isNegative = ((dividend < 0 && divisor > 0) || (dividend > 0 && divisor < 0));
dividend = (dividend < 0) ? -dividend : dividend;
divisor = (divisor < 0) ? -divisor : divisor;
int sum, result = 0;
while (true) {
int d1 = divisor;
sum = 0;
if (dividend - d1 == 0) {
sum += 1;
result += sum;
break;
}
if (dividend - d1 < 0) break;
while (dividend - (d1 << 1) > 0) {
d1 <<= 1;
sum += 1;
}
result += (1 << sum);
dividend = dividend - d1;
}
return isNegative ? -result : result;
} | public int sample_funcname ( int var_0 , int var_1 ) {
if ( var_1 == 0 ) return Integer . MAX_VALUE ;
else if ( var_0 == Integer . MIN_VALUE && var_1 == - 1 ) return Integer . MAX_VALUE ;
else if ( var_1 == 1 ) return var_0 ;
boolean var_8 = ( ( var_0 < 0 && var_1 > 0 ) || ( var_0 > 0 && var_1 < 0 ) ) ;
var_0 = ( var_0 < 0 ) ? - var_0 : var_0 ;
var_1 = ( var_1 < 0 ) ? - var_1 : var_1 ;
int var_9 , var_10 = 0 ;
while ( true ) {
int var_11 = var_1 ;
var_9 = 0 ;
if ( var_0 - var_11 == 0 ) {
var_9 += 1 ;
var_10 += var_9 ;
break ;
}
if ( var_0 - var_11 < 0 ) break ;
while ( var_0 - ( var_11 << 1 ) > 0 ) {
var_11 <<= 1 ;
var_9 += 1 ;
}
var_10 += ( 1 << var_9 ) ;
var_0 = var_0 - var_11 ;
}
return var_8 ? - var_10 : var_10 ;
}
|
1,069 | <gouthampradhan>dynamic_programming_SplitArrayLargestSum_1.java | public int splitArray(int[] nums, int m) {
int[][] dp = new int[m][nums.length];
for (int i = nums.length - 1; i >= 0; i--) {
int sum = 0;
for (int j = i; j < nums.length; j++) {
sum += nums[j];
if (j + 1 >= nums.length) break;
for (int k = 0; k < m - 1; k++) {
dp[k + 1][i] = (dp[k + 1][i] == 0) ? Integer.MAX_VALUE : dp[k + 1][i];
int temp = Math.max(sum, dp[k][j + 1]);
dp[k + 1][i] = Math.min(dp[k + 1][i], temp);
}
}
dp[0][i] = sum;
}
return dp[m - 1][0];
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
int [ ] [ ] var_3 = new int [ var_1 ] [ var_0 . length ] ;
for ( int var_5 = var_0 . length - 1 ;
var_5 >= 0 ;
var_5 -- ) {
int var_7 = 0 ;
for ( int var_8 = var_5 ;
var_8 < var_0 . length ;
var_8 ++ ) {
var_7 += var_0 [ var_8 ] ;
if ( var_8 + 1 >= var_0 . length ) break ;
for ( int var_9 = 0 ;
var_9 < var_1 - 1 ;
var_9 ++ ) {
var_3 [ var_9 + 1 ] [ var_5 ] = ( var_3 [ var_9 + 1 ] [ var_5 ] == 0 ) ? Integer . MAX_VALUE : var_3 [ var_9 + 1 ] [ var_5 ] ;
int var_14 = Math . max ( var_7 , var_3 [ var_9 ] [ var_8 + 1 ] ) ;
var_3 [ var_9 + 1 ] [ var_5 ] = Math . min ( var_3 [ var_9 + 1 ] [ var_5 ] , var_14 ) ;
}
}
var_3 [ 0 ] [ var_5 ] = var_7 ;
}
return var_3 [ var_1 - 1 ] [ 0 ] ;
}
|
1,070 | <gouthampradhan>backtracking_Permutations_1.java | private void nextPermutation(int i, int[] nums, List<List<Integer>> result) {
if (i == nums.length - 1) {
List<Integer> list = new ArrayList<>();
for (int n : nums) list.add(n);
result.add(list);
} else {
for (int j = i, l = nums.length; j < l; j++) {
int temp = nums[j];
nums[j] = nums[i];
nums[i] = temp;
nextPermutation(i + 1, nums, result);
temp = nums[j];
nums[j] = nums[i];
nums[i] = temp;
}
}
} | private void sample_funcname ( int i , int [ ] nums , List < List < Integer >> result ) {
if ( i == nums . length - 1 ) {
List < Integer > list = new ArrayList < > ( ) ;
for ( int n : nums ) list . add ( n ) ;
result . add ( list ) ;
}
else {
for ( int j = i , l = nums . length ;
j < l ;
j ++ ) {
int temp = nums [ j ] ;
nums [ j ] = nums [ i ] ;
nums [ i ] = temp ;
nextPermutation ( i + 1 , nums , result ) ;
temp = nums [ j ] ;
nums [ j ] = nums [ i ] ;
nums [ i ] = temp ;
}
}
}
|
1,071 | <gouthampradhan>string_NumberOfMatchingSubsequences_1.java | private boolean isSubsequence(String S, String P) {
int i = 0, j = 0;
if (P.length() > S.length()) return false;
for (; ; ) {
if (j >= P.length()) return true;
else if (i >= S.length()) return false;
else {
if (S.charAt(i) == P.charAt(j)) {
i++;
j++;
} else {
i++;
}
}
}
} | private boolean var_0 ( String var_2 , String var_3 ) {
int var_5 = 0 , var_6 = 0 ;
if ( var_3 . length ( ) > var_2 . length ( ) ) return false ;
for ( ;
;
) {
if ( var_6 >= var_3 . length ( ) ) return true ;
else if ( var_5 >= var_2 . length ( ) ) return false ;
else {
if ( var_2 . charAt ( var_5 ) == var_3 . charAt ( var_6 ) ) {
var_5 ++ ;
var_6 ++ ;
}
else {
var_5 ++ ;
}
}
}
}
|
1,072 | <gouthampradhan>math_RangeAdditionII_1.java | public int maxCount(int m, int n, int[][] ops) {
int minR = m;
int minC = n;
for (int[] v : ops) {
minR = Math.min(minR, v[0]);
minC = Math.min(minC, v[1]);
}
return minR * minC;
} | public int sample_funcname ( int var_0 , int var_1 , int [ ] [ ] var_2 ) {
int var_3 = var_0 ;
int var_4 = var_1 ;
for ( int [ ] var_5 : var_2 ) {
var_3 = Math . min ( var_3 , var_5 [ 0 ] ) ;
var_4 = Math . min ( var_4 , var_5 [ 1 ] ) ;
}
return var_3 * var_4 ;
}
|
1,073 | <gouthampradhan>math_SuperWashingMachines_1.java | public int findMinMoves(int[] machines) {
long sum = Arrays.stream(machines).asLongStream().sum();
if (((sum / machines.length) < 0) || ((sum % machines.length) != 0)) return -1;
int n = (int) (sum / machines.length);
int count = 0, moves = Integer.MIN_VALUE;
for (int i = 0; i < machines.length; i++) {
count += (machines[i] - n);
moves = Math.max(moves, Math.max(Math.abs(count), (machines[i] - n)));
}
return moves;
} | public int sample_funcname ( int [ ] var_0 ) {
long sum = Arrays . stream ( var_0 ) . asLongStream ( ) . sum ( ) ;
if ( ( ( sum / var_0 . length ) < 0 ) || ( ( sum % var_0 . length ) != 0 ) ) return - 1 ;
int var_8 = ( int ) ( sum / var_0 . length ) ;
int var_9 = 0 , var_12 = Integer . MIN_VALUE ;
for ( int var_13 = 0 ;
var_13 < var_0 . length ;
var_13 ++ ) {
var_9 += ( var_0 [ var_13 ] - var_8 ) ;
var_12 = Math . max ( var_12 , Math . max ( Math . abs ( var_9 ) , ( var_0 [ var_13 ] - var_8 ) ) ) ;
}
return var_12 ;
}
|
1,074 | <gouthampradhan>dynamic_programming_CherryPickup_1.java | private int dp(int N, int r1, int c1, int c2, int[][][] DP, int[][] grid) {
int r2 = r1 + (c1 - c2);
if (r1 >= N || c1 >= N || c2 >= N || r2 >= N || grid[r1][c1] == -1 || grid[r2][c2] == -1)
return Integer.MIN_VALUE;
else if (DP[r1][c1][c2] != -1) return DP[r1][c1][c2];
else if (r1 == N - 1 && c1 == N - 1) return grid[N - 1][N - 1];
else {
int max = (c1 == c2) ? grid[r1][c1] : (grid[r1][c1] + grid[r2][c2]);
max +=
Math.max(
Math.max(
Math.max(dp(N, r1 + 1, c1, c2, DP, grid), dp(N, r1 + 1, c1, c2 + 1, DP, grid)),
dp(N, r1, c1 + 1, c2, DP, grid)),
dp(N, r1, c1 + 1, c2 + 1, DP, grid));
DP[r1][c1][c2] = max;
return max;
}
} | private int sample_funcname ( int N , int r1 , int c1 , int c2 , int [ ] [ ] [ ] DP , int [ ] [ ] grid ) {
int r2 = r1 + ( c1 - c2 ) ;
if ( r1 >= N || c1 >= N || c2 >= N || r2 >= N || grid [ r1 ] [ c1 ] == - 1 || grid [ r2 ] [ c2 ] == - 1 ) return Integer . MIN_VALUE ;
else if ( DP [ r1 ] [ c1 ] [ c2 ] != - 1 ) return DP [ r1 ] [ c1 ] [ c2 ] ;
else if ( r1 == N - 1 && c1 == N - 1 ) return grid [ N - 1 ] [ N - 1 ] ;
else {
int max = ( c1 == c2 ) ? grid [ r1 ] [ c1 ] : ( grid [ r1 ] [ c1 ] + grid [ r2 ] [ c2 ] ) ;
max += Math . max ( Math . max ( Math . max ( dp ( N , r1 + 1 , c1 , c2 , DP , grid ) , dp ( N , r1 + 1 , c1 , c2 + 1 , DP , grid ) ) , dp ( N , r1 , c1 + 1 , c2 , DP , grid ) ) , dp ( N , r1 , c1 + 1 , c2 + 1 , DP , grid ) ) ;
DP [ r1 ] [ c1 ] [ c2 ] = max ;
return max ;
}
}
|
1,075 | <gouthampradhan>backtracking_WildcardMatching_1.java | public boolean isMatch(String s, String p) {
int starIdx = -1;
int starPosAtStr = -1;
int j = 0;
for (int i = 0, l = s.length(); i < l; ) {
if (j < p.length()) {
if (s.charAt(i) == p.charAt(j) || p.charAt(j) == '?') {
i++;
j++;
} else if (p.charAt(j) == '*') {
starIdx = j;
starPosAtStr = i;
j++;
} else if (starIdx != -1) {
i = ++starPosAtStr;
j = starIdx + 1;
} else return false;
} else if (starIdx != -1) {
i = ++starPosAtStr;
j = starIdx + 1;
} else return false;
}
while (j < p.length()) {
if (p.charAt(j) == '*') {
j++;
} else break;
}
return j == p.length();
} | public boolean var_0 ( String var_2 , String var_3 ) {
int var_5 = - 1 ;
int var_6 = - 1 ;
int var_8 = 0 ;
for ( int var_9 = 0 , var_11 = var_2 . length ( ) ;
var_9 < var_11 ;
) {
if ( var_8 < var_3 . length ( ) ) {
if ( var_2 . charAt ( var_9 ) == var_3 . charAt ( var_8 ) || var_3 . charAt ( var_8 ) == '?' ) {
var_9 ++ ;
var_8 ++ ;
}
else if ( var_3 . charAt ( var_8 ) == '*' ) {
var_5 = var_8 ;
var_6 = var_9 ;
var_8 ++ ;
}
else if ( var_5 != - 1 ) {
var_9 = ++ var_6 ;
var_8 = var_5 + 1 ;
}
else return false ;
}
else if ( var_5 != - 1 ) {
var_9 = ++ var_6 ;
var_8 = var_5 + 1 ;
}
else return false ;
}
while ( var_8 < var_3 . length ( ) ) {
if ( var_3 . charAt ( var_8 ) == '*' ) {
var_8 ++ ;
}
else break ;
}
return var_8 == var_3 . length ( ) ;
}
|
1,076 | <gouthampradhan>string_PushDominoes_1.java | public String pushDominoes(String dominoes) {
int R = -1, L = -1;
char[] A = dominoes.toCharArray();
for (int i = 0; i < A.length; i++) {
if (A[i] == 'L') {
if (R > L) {
int d = (i - R);
int st;
st = R + d / 2;
if ((d % 2) == 0) {
A[st] = '.';
}
for (int j = st + 1; j < i; j++) {
A[j] = 'L';
}
} else {
for (int j = (L == -1 ? 0 : L); j < i; j++) {
A[j] = 'L';
}
}
L = i;
} else {
if (A[i] == 'R') {
R = i;
} else {
if (R > L) {
A[i] = 'R';
}
}
}
}
return String.valueOf(A);
} | public String var_0 ( String var_2 ) {
int var_4 = - 1 , var_5 = - 1 ;
char [ ] var_7 = var_2 . toCharArray ( ) ;
for ( int var_9 = 0 ;
var_9 < var_7 . length ;
var_9 ++ ) {
if ( var_7 [ var_9 ] == 'L' ) {
if ( var_4 > var_5 ) {
int var_12 = ( var_9 - var_4 ) ;
int var_13 ;
var_13 = var_4 + var_12 / 2 ;
if ( ( var_12 % 2 ) == 0 ) {
var_7 [ var_13 ] = '.' ;
}
for ( int var_16 = var_13 + 1 ;
var_16 < var_9 ;
var_16 ++ ) {
var_7 [ var_16 ] = 'L' ;
}
}
else {
for ( int var_16 = ( var_5 == - 1 ? 0 : var_5 ) ;
var_16 < var_9 ;
var_16 ++ ) {
var_7 [ var_16 ] = 'L' ;
}
}
var_5 = var_9 ;
}
else {
if ( var_7 [ var_9 ] == 'R' ) {
var_4 = var_9 ;
}
else {
if ( var_4 > var_5 ) {
var_7 [ var_9 ] = 'R' ;
}
}
}
}
return String . valueOf ( var_7 ) ;
}
|
1,077 | <gouthampradhan>array_NextGreaterElementI_1.java | public int[] nextGreaterElement(int[] nums1, int[] nums2) {
int[] result = new int[nums1.length];
for (int i = 0; i < nums1.length; i++) {
int n = nums1[i];
boolean found = false;
int nF = 0;
for (int j = 0; j < nums2.length; j++) {
if (nums2[j] == n) {
found = true;
}
if (found) {
if (nums2[j] > n) {
nF = nums2[j];
break;
}
}
}
if (found) {
result[i] = nF;
} else {
result[i] = -1;
}
}
return result;
} | public int [ ] sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
int [ ] var_3 = new int [ var_0 . length ] ;
for ( int var_5 = 0 ;
var_5 < var_0 . length ;
var_5 ++ ) {
int var_6 = var_0 [ var_5 ] ;
boolean var_10 = false ;
int var_8 = 0 ;
for ( int var_9 = 0 ;
var_9 < var_1 . length ;
var_9 ++ ) {
if ( var_1 [ var_9 ] == var_6 ) {
var_10 = true ;
}
if ( var_10 ) {
if ( var_1 [ var_9 ] > var_6 ) {
var_8 = var_1 [ var_9 ] ;
break ;
}
}
}
if ( var_10 ) {
var_3 [ var_5 ] = var_8 ;
}
else {
var_3 [ var_5 ] = - 1 ;
}
}
return var_3 ;
}
|
1,078 | <gouthampradhan>hashing_NumberOfAtoms_1.java | private Map<String, Integer> merge(Map<String, Integer> left, Map<String, Integer> right) {
for (String k : left.keySet()) {
if (right.containsKey(k)) {
right.put(k, right.get(k) + left.get(k));
} else right.put(k, left.get(k));
}
return right;
} | private Map < String , Integer > var_2 ( Map < String , Integer > var_4 , Map < String , Integer > var_5 ) {
for ( String var_7 : var_4 . keySet ( ) ) {
if ( var_5 . containsKey ( var_7 ) ) {
var_5 . put ( var_7 , var_5 . get ( var_7 ) + var_4 . get ( var_7 ) ) ;
}
else var_5 . put ( var_7 , var_4 . get ( var_7 ) ) ;
}
return var_5 ;
}
|
1,079 | <gouthampradhan>array_MaxConsecutiveOnes_1.java | public int findMaxConsecutiveOnes(int[] nums) {
int max = 0;
boolean flag = false;
int count = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 1) {
if (!flag) {
flag = true;
}
count++;
max = Math.max(max, count);
} else {
count = 0;
flag = false;
}
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
int max = 0 ;
boolean var_8 = false ;
int var_4 = 0 ;
for ( int var_5 = 0 ;
var_5 < var_0 . length ;
var_5 ++ ) {
if ( var_0 [ var_5 ] == 1 ) {
if ( ! var_8 ) {
var_8 = true ;
}
var_4 ++ ;
max = Math . max ( max , var_4 ) ;
}
else {
var_4 = 0 ;
var_8 = false ;
}
}
return max ;
}
|
1,080 | <gouthampradhan>binary_search_SearchInsertPosition_1.java | public int searchInsert(int[] nums, int target) {
int pos = nums.length;
int s = 0, e = nums.length - 1;
while (s <= e) {
int m = s + (e - s) / 2;
if (nums[m] >= target) {
pos = m;
e = m - 1;
} else s = m + 1;
}
return pos;
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
int var_3 = var_0 . length ;
int var_5 = 0 , var_7 = var_0 . length - 1 ;
while ( var_5 <= var_7 ) {
int var_9 = var_5 + ( var_7 - var_5 ) / 2 ;
if ( var_0 [ var_9 ] >= var_1 ) {
var_3 = var_9 ;
var_7 = var_9 - 1 ;
}
else var_5 = var_9 + 1 ;
}
return var_3 ;
}
|
1,081 | <gouthampradhan>math_SquirrelSimulation_1.java | public int minDistance(int height, int width, int[] tree, int[] squirrel, int[][] nuts) {
int dist = 0;
for (int[] n : nuts) {
dist += Math.abs(n[0] - tree[0]) + Math.abs(n[1] - tree[1]);
}
dist *= 2;
int ans = Integer.MAX_VALUE;
for (int[] n : nuts) {
int nutDist = Math.abs(n[0] - squirrel[0]) + Math.abs(n[1] - squirrel[1]);
ans = Math.min(ans, dist - (Math.abs(n[0] - tree[0]) + Math.abs(n[1] - tree[1])) + nutDist);
}
return ans;
} | public int sample_funcname ( int var_0 , int var_1 , int [ ] var_2 , int [ ] var_3 , int [ ] [ ] var_4 ) {
int var_6 = 0 ;
for ( int [ ] var_7 : var_4 ) {
var_6 += Math . abs ( var_7 [ 0 ] - var_2 [ 0 ] ) + Math . abs ( var_7 [ 1 ] - var_2 [ 1 ] ) ;
}
var_6 *= 2 ;
int var_14 = Integer . MAX_VALUE ;
for ( int [ ] var_7 : var_4 ) {
int var_15 = Math . abs ( var_7 [ 0 ] - var_3 [ 0 ] ) + Math . abs ( var_7 [ 1 ] - var_3 [ 1 ] ) ;
var_14 = Math . min ( var_14 , var_6 - ( Math . abs ( var_7 [ 0 ] - var_2 [ 0 ] ) + Math . abs ( var_7 [ 1 ] - var_2 [ 1 ] ) ) + var_15 ) ;
}
return var_14 ;
}
|
1,082 | <gouthampradhan>string_ReconstructOriginalDigitsFromEnglish_1.java | private void update(
Map<Character, Integer> map,
Map<Integer, Integer> intMap,
int num,
char id,
List<Character> list) {
if (map.containsKey(id)) {
int count = map.get(id);
intMap.put(num, count);
while (count-- > 0) {
for (char c : list) {
map.put(c, map.get(c) - 1);
}
}
}
} | private void var_0 ( Map < Character , Integer > var_4 , Map < Integer , Integer > var_5 , int var_6 , char var_7 , List < Character > var_9 ) {
if ( var_4 . containsKey ( var_7 ) ) {
int var_12 = var_4 . get ( var_7 ) ;
var_5 . put ( var_6 , var_12 ) ;
while ( var_12 -- > 0 ) {
for ( char var_15 : var_9 ) {
var_4 . put ( var_15 , var_4 . get ( var_15 ) - 1 ) ;
}
}
}
}
|
1,083 | <gouthampradhan>math_CouplesHoldingHands_1.java | private int find(int[] A, int n) {
for (int i = 0; i < A.length; i++) {
if (A[i] == n) {
return i;
}
}
return -1;
} | private int sample_funcname ( int [ ] var_0 , int var_1 ) {
for ( int var_3 = 0 ;
var_3 < var_0 . length ;
var_3 ++ ) {
if ( var_0 [ var_3 ] == var_1 ) {
return var_3 ;
}
}
return - 1 ;
}
|
1,084 | <gouthampradhan>string_LongestCommonPrefix_1.java | public String longestCommonPrefix(String[] strs) {
if (strs.length == 0) return "";
String result = strs[0];
for (int i = 1; i < strs.length; i++) {
String s = strs[i];
for (int j = 0; j < result.length(); j++) {
if (j >= s.length() || result.charAt(j) != s.charAt(j)) {
result = result.substring(0, j);
break;
}
}
}
return result;
} | public String var_0 ( String [ ] var_2 ) {
if ( var_2 . length == 0 ) return "" ;
String var_6 = var_2 [ 0 ] ;
for ( int var_8 = 1 ;
var_8 < var_2 . length ;
var_8 ++ ) {
String var_9 = var_2 [ var_8 ] ;
for ( int var_10 = 0 ;
var_10 < var_6 . length ( ) ;
var_10 ++ ) {
if ( var_10 >= var_9 . length ( ) || var_6 . charAt ( var_10 ) != var_9 . charAt ( var_10 ) ) {
var_6 = var_6 . substring ( 0 , var_10 ) ;
break ;
}
}
}
return var_6 ;
}
|
1,085 | <gouthampradhan>binary_search_SingleElementInASortedArray_1.java | public int singleNonDuplicate(int[] nums) {
if (nums.length == 1) return nums[0];
int l = 0, h = nums.length - 1;
while (l <= h) {
int m = l + ((h - l) / 2);
int N = nums[m];
if (m + 1 >= nums.length) {
if (nums[m - 1] != N) {
return N;
}
h = m - 1;
} else if (m - 1 < 0) {
if (nums[m + 1] != N) {
return N;
}
l = m + 1;
} else {
if (m % 2 == 0) {
if (nums[m + 1] != N && nums[m - 1] != N) {
return N;
} else if (nums[m + 1] != N) {
h = m - 1;
} else l = m + 1;
} else {
if (nums[m + 1] != N && nums[m - 1] != N) {
return N;
} else if (nums[m - 1] != N) {
h = m - 1;
} else l = m + 1;
}
}
}
return -1;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 1 ) return var_0 [ 0 ] ;
int var_4 = 0 , var_5 = var_0 . length - 1 ;
while ( var_4 <= var_5 ) {
int var_7 = var_4 + ( ( var_5 - var_4 ) / 2 ) ;
int var_8 = var_0 [ var_7 ] ;
if ( var_7 + 1 >= var_0 . length ) {
if ( var_0 [ var_7 - 1 ] != var_8 ) {
return var_8 ;
}
var_5 = var_7 - 1 ;
}
else if ( var_7 - 1 < 0 ) {
if ( var_0 [ var_7 + 1 ] != var_8 ) {
return var_8 ;
}
var_4 = var_7 + 1 ;
}
else {
if ( var_7 % 2 == 0 ) {
if ( var_0 [ var_7 + 1 ] != var_8 && var_0 [ var_7 - 1 ] != var_8 ) {
return var_8 ;
}
else if ( var_0 [ var_7 + 1 ] != var_8 ) {
var_5 = var_7 - 1 ;
}
else var_4 = var_7 + 1 ;
}
else {
if ( var_0 [ var_7 + 1 ] != var_8 && var_0 [ var_7 - 1 ] != var_8 ) {
return var_8 ;
}
else if ( var_0 [ var_7 - 1 ] != var_8 ) {
var_5 = var_7 - 1 ;
}
else var_4 = var_7 + 1 ;
}
}
}
return - 1 ;
}
|
1,086 | <gouthampradhan>array_ValidTicTacToeState_1.java | private boolean hasWon(String[] board, char c) {
boolean diagnol =
((board[0].charAt(0) == c && board[1].charAt(1) == c && board[2].charAt(2) == c)
|| (board[0].charAt(2) == c && board[1].charAt(1) == c && board[2].charAt(0) == c));
if (diagnol) return true;
for (int i = 0; i < 3; i++) {
if (board[i].charAt(0) == c && board[i].charAt(1) == c && board[i].charAt(2) == c)
return true;
}
for (int i = 0; i < 3; i++) {
if (board[0].charAt(i) == c && board[1].charAt(i) == c && board[2].charAt(i) == c)
return true;
}
return false;
} | private boolean var_0 ( String [ ] var_2 , char var_3 ) {
boolean var_9 = ( ( var_2 [ 0 ] . charAt ( 0 ) == var_3 && var_2 [ 1 ] . charAt ( 1 ) == var_3 && var_2 [ 2 ] . charAt ( 2 ) == var_3 ) || ( var_2 [ 0 ] . charAt ( 2 ) == var_3 && var_2 [ 1 ] . charAt ( 1 ) == var_3 && var_2 [ 2 ] . charAt ( 0 ) == var_3 ) ) ;
if ( var_9 ) return true ;
for ( int var_10 = 0 ;
var_10 < 3 ;
var_10 ++ ) {
if ( var_2 [ var_10 ] . charAt ( 0 ) == var_3 && var_2 [ var_10 ] . charAt ( 1 ) == var_3 && var_2 [ var_10 ] . charAt ( 2 ) == var_3 ) return true ;
}
for ( int var_10 = 0 ;
var_10 < 3 ;
var_10 ++ ) {
if ( var_2 [ 0 ] . charAt ( var_10 ) == var_3 && var_2 [ 1 ] . charAt ( var_10 ) == var_3 && var_2 [ 2 ] . charAt ( var_10 ) == var_3 ) return true ;
}
return false ;
}
|
1,087 | <gouthampradhan>greedy_ReducingDishes_1.java | public int maxSatisfaction(int[] satisfaction) {
Queue<Integer> pq = new PriorityQueue<>(((o1, o2) -> o2 - o1));
Arrays.stream(satisfaction).forEach(pq::offer);
int max = 0, sum = 0;
while (!pq.isEmpty()) {
if ((max + sum) >= max) {
max += sum;
sum += pq.poll();
} else break;
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
Queue < Integer > var_6 = new PriorityQueue < > ( ( ( var_3 , var_4 ) -> var_4 - var_3 ) ) ;
Arrays . stream ( var_0 ) . forEach ( var_6 :: offer ) ;
int var_12 = 0 , var_13 = 0 ;
while ( ! var_6 . isEmpty ( ) ) {
if ( ( var_12 + var_13 ) >= var_12 ) {
var_12 += var_13 ;
var_13 += var_6 . poll ( ) ;
}
else break ;
}
return var_12 ;
}
|
1,088 | <gouthampradhan>string_ValidPalindromeII_1.java | private boolean isPaliandrome(String s) {
for (int i = 0, j = s.length() - 1; i < j; ) {
if (s.charAt(i) == s.charAt(j)) {
i++;
j--;
} else return false;
}
return true;
} | private boolean var_0 ( String var_2 ) {
for ( int var_4 = 0 , var_7 = var_2 . length ( ) - 1 ;
var_4 < var_7 ;
) {
if ( var_2 . charAt ( var_4 ) == var_2 . charAt ( var_7 ) ) {
var_4 ++ ;
var_7 -- ;
}
else return false ;
}
return true ;
}
|
1,089 | <gouthampradhan>two_pointers_ThreeSum_1.java | public List<List<Integer>> threeSum(int[] nums) {
List<List<Integer>> result = new ArrayList<>();
if (nums.length < 3) return result;
Arrays.sort(nums);
for (int i = 0, l = nums.length; i < l - 2; i++) {
if (i == 0 || nums[i] != nums[i - 1]) {
int j = i + 1, k = l - 1;
while (k > j) {
if (j != i + 1 && nums[j] == nums[j - 1]) {
j++;
continue;
}
int sum = nums[i] + nums[j] + nums[k];
if (sum == 0) {
result.add(Arrays.asList(nums[i], nums[j], nums[k]));
k--;
j++;
} else if (sum > 0) k--;
else j++;
}
}
}
return result;
} | public List < List < Integer >> var_2 ( int [ ] var_3 ) {
List < List < Integer >> var_5 = new ArrayList < > ( ) ;
if ( var_3 . length < 3 ) return var_5 ;
Arrays . sort ( var_3 ) ;
for ( int var_11 = 0 , var_12 = var_3 . length ;
var_11 < var_12 - 2 ;
var_11 ++ ) {
if ( var_11 == 0 || var_3 [ var_11 ] != var_3 [ var_11 - 1 ] ) {
int var_15 = var_11 + 1 , var_16 = var_12 - 1 ;
while ( var_16 > var_15 ) {
if ( var_15 != var_11 + 1 && var_3 [ var_15 ] == var_3 [ var_15 - 1 ] ) {
var_15 ++ ;
continue ;
}
int var_17 = var_3 [ var_11 ] + var_3 [ var_15 ] + var_3 [ var_16 ] ;
if ( var_17 == 0 ) {
var_5 . add ( Arrays . asList ( var_3 [ var_11 ] , var_3 [ var_15 ] , var_3 [ var_16 ] ) ) ;
var_16 -- ;
var_15 ++ ;
}
else if ( var_17 > 0 ) var_16 -- ;
else var_15 ++ ;
}
}
}
return var_5 ;
}
|
1,090 | <gouthampradhan>string_LongestPalindrome_1.java | public int longestPalindrome(String s) {
Map<Character, Integer> map = new HashMap<>();
for (char c : s.toCharArray()) {
map.putIfAbsent(c, 0);
int count = map.get(c);
map.put(c, count + 1);
}
int max = 0;
boolean odd = false;
for (char c : map.keySet()) {
int count = map.get(c);
max += count;
if ((count % 2) != 0) {
max--;
odd = true;
}
}
if (odd) max++;
return max;
} | public int sample_funcname ( String var_1 ) {
Map < Character , Integer > var_6 = new HashMap < > ( ) ;
for ( char var_8 : var_1 . toCharArray ( ) ) {
var_6 . putIfAbsent ( var_8 , 0 ) ;
int var_12 = var_6 . get ( var_8 ) ;
var_6 . put ( var_8 , var_12 + 1 ) ;
}
int var_15 = 0 ;
boolean var_19 = false ;
for ( char var_8 : var_6 . keySet ( ) ) {
int var_12 = var_6 . get ( var_8 ) ;
var_15 += var_12 ;
if ( ( var_12 % 2 ) != 0 ) {
var_15 -- ;
var_19 = true ;
}
}
if ( var_19 ) var_15 ++ ;
return var_15 ;
}
|
1,091 | <gouthampradhan>binary_search_PowXN_1.java | public double solve(double x, long n) {
if (n == 1) return x;
double val = solve(x, n / 2);
return val * val * ((n % 2) == 0 ? 1 : x);
} | public double sample_funcname ( double x , long n ) {
if ( n == 1 ) return x ;
double val = solve ( x , n / 2 ) ;
return val * val * ( ( n % 2 ) == 0 ? 1 : x ) ;
}
|
1,092 | <gouthampradhan>array_MinimumTimeDifference_1.java | public int findMinDifference(List<String> timePoints) {
List<Integer> timeInMinutes =
timePoints
.stream()
.map(
t -> {
String[] strings = t.split(":");
return Integer.parseInt(strings[0]) * 60 + Integer.parseInt(strings[1]);
})
.sorted(Integer::compareTo)
.collect(Collectors.toList());
int min = Integer.MAX_VALUE;
for (int i = 1, l = timeInMinutes.size(); i < l; i++) {
int prev = timeInMinutes.get(i - 1);
int curr = timeInMinutes.get(i);
min = Math.min(min, curr - prev);
min = Math.min(min, ((24 * 60) - curr) + prev);
}
int prev = timeInMinutes.get(0);
int curr = timeInMinutes.get(timeInMinutes.size() - 1);
min = Math.min(min, curr - prev);
min = Math.min(min, ((24 * 60) - curr) + prev);
return min;
} | public int sample_funcname ( List < String > var_2 ) {
List < Integer > var_19 = var_2 . stream ( ) . map ( var_10 -> {
String [ ] var_14 = var_10 . split ( ":" ) ;
return Integer . parseInt ( var_14 [ 0 ] ) * 60 + Integer . parseInt ( var_14 [ 1 ] ) ;
}
) . sorted ( Integer :: compareTo ) . collect ( Collectors . toList ( ) ) ;
int min = Integer . MAX_VALUE ;
for ( int var_22 = 1 , var_24 = var_19 . size ( ) ;
var_22 < var_24 ;
var_22 ++ ) {
int var_26 = var_19 . get ( var_22 - 1 ) ;
int var_27 = var_19 . get ( var_22 ) ;
min = Math . min ( min , var_27 - var_26 ) ;
min = Math . min ( min , ( ( 24 * 60 ) - var_27 ) + var_26 ) ;
}
int var_26 = var_19 . get ( 0 ) ;
int var_27 = var_19 . get ( var_19 . size ( ) - 1 ) ;
min = Math . min ( min , var_27 - var_26 ) ;
min = Math . min ( min , ( ( 24 * 60 ) - var_27 ) + var_26 ) ;
return min ;
}
|
1,093 | <gouthampradhan>hashing_ContiguousArray_1.java | public int findMaxLength(int[] nums) {
Map<Integer, Integer> map = new HashMap<>();
int count = 0;
int max = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 0) {
count--;
} else count++;
if (count == 0) {
max = Math.max(max, i + 1);
} else {
if (map.containsKey(count)) {
int index = map.get(count);
max = Math.max(max, i - index);
} else {
map.put(count, i);
}
}
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
Map < Integer , Integer > var_4 = new HashMap < > ( ) ;
int var_6 = 0 ;
int max = 0 ;
for ( int var_8 = 0 ;
var_8 < var_0 . length ;
var_8 ++ ) {
if ( var_0 [ var_8 ] == 0 ) {
var_6 -- ;
}
else var_6 ++ ;
if ( var_6 == 0 ) {
max = Math . max ( max , var_8 + 1 ) ;
}
else {
if ( var_4 . containsKey ( var_6 ) ) {
int var_14 = var_4 . get ( var_6 ) ;
max = Math . max ( max , var_8 - var_14 ) ;
}
else {
var_4 . put ( var_6 , var_8 ) ;
}
}
}
return max ;
}
|
1,094 | <gouthampradhan>heap_SlidingWindowMaximum_1.java | public int[] maxSlidingWindow(int[] nums, int k) {
int[] result = new int[nums.length - (k - 1)];
if (nums.length == 0) return new int[0];
Deque<Integer> queue = new ArrayDeque<>();
for (int i = 0, j = 0, l = nums.length; i < l; i++) {
int head = i - (k - 1);
if (head >= 0) {
if (queue.peek() != null && queue.peek() < head) queue.poll();
}
while (queue.peekLast() != null && nums[queue.peekLast()] <= nums[i]) {
queue.pollLast();
}
queue.offer(i);
if (i >= k - 1) result[j++] = nums[queue.peek()];
}
return result;
} | public int [ ] sample_funcname ( int [ ] var_0 , int var_1 ) {
int [ ] var_4 = new int [ var_0 . length - ( var_1 - 1 ) ] ;
if ( var_0 . length == 0 ) return new int [ 0 ] ;
Deque < Integer > var_9 = new ArrayDeque < > ( ) ;
for ( int var_10 = 0 , var_11 = 0 , var_12 = var_0 . length ;
var_10 < var_12 ;
var_10 ++ ) {
int var_13 = var_10 - ( var_1 - 1 ) ;
if ( var_13 >= 0 ) {
if ( var_9 . peek ( ) != null && var_9 . peek ( ) < var_13 ) var_9 . poll ( ) ;
}
while ( var_9 . peekLast ( ) != null && var_0 [ var_9 . peekLast ( ) ] <= var_0 [ var_10 ] ) {
var_9 . pollLast ( ) ;
}
var_9 . offer ( var_10 ) ;
if ( var_10 >= var_1 - 1 ) var_4 [ var_11 ++ ] = var_0 [ var_9 . peek ( ) ] ;
}
return var_4 ;
}
|
1,095 | <gouthampradhan>greedy_BrokenCalculator_1.java | public int brokenCalc(int X, int Y) {
if (X == Y) return 0;
else if (Y < X) return X - Y;
else {
int count = 0;
while (Y > X) {
if (Y % 2 == 0) {
Y /= 2;
count++;
} else {
Y += 1;
Y /= 2;
count += 2;
}
}
if (X == Y) return count;
else return count + (X - Y);
}
} | public int sample_funcname ( int var_0 , int var_1 ) {
if ( var_0 == var_1 ) return 0 ;
else if ( var_1 < var_0 ) return var_0 - var_1 ;
else {
int var_3 = 0 ;
while ( var_1 > var_0 ) {
if ( var_1 % 2 == 0 ) {
var_1 /= 2 ;
var_3 ++ ;
}
else {
var_1 += 1 ;
var_1 /= 2 ;
var_3 += 2 ;
}
}
if ( var_0 == var_1 ) return var_3 ;
else return var_3 + ( var_0 - var_1 ) ;
}
}
|
1,096 | <gouthampradhan>binary_search_FindPeakElement_1.java | public int findPeakElement(int[] nums) {
if (nums.length == 1) return 0;
if (nums[0] > nums[1]) return 0;
else if (nums[nums.length - 1] > nums[nums.length - 2]) return nums.length - 1;
int l = 0, h = nums.length - 1;
int ans = 0;
while (l <= h) {
int m = l + (h - l) / 2;
if (m - 1 >= 0 && m + 1 < nums.length) {
if (nums[m] > nums[m - 1] && nums[m] > nums[m + 1]) {
return m;
}
}
if (m - 1 >= 0 && nums[m - 1] > nums[m]) {
h = m - 1;
} else {
ans = l;
l = m + 1;
}
}
return ans;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 1 ) return 0 ;
if ( var_0 [ 0 ] > var_0 [ 1 ] ) return 0 ;
else if ( var_0 [ var_0 . length - 1 ] > var_0 [ var_0 . length - 2 ] ) return var_0 . length - 1 ;
int var_5 = 0 , var_6 = var_0 . length - 1 ;
int var_7 = 0 ;
while ( var_5 <= var_6 ) {
int var_8 = var_5 + ( var_6 - var_5 ) / 2 ;
if ( var_8 - 1 >= 0 && var_8 + 1 < var_0 . length ) {
if ( var_0 [ var_8 ] > var_0 [ var_8 - 1 ] && var_0 [ var_8 ] > var_0 [ var_8 + 1 ] ) {
return var_8 ;
}
}
if ( var_8 - 1 >= 0 && var_0 [ var_8 - 1 ] > var_0 [ var_8 ] ) {
var_6 = var_8 - 1 ;
}
else {
var_7 = var_5 ;
var_5 = var_8 + 1 ;
}
}
return var_7 ;
}
|
1,097 | <gouthampradhan>string_IsomorphicStrings_1.java | public boolean isIsomorphic(String s, String t) {
if (s.length() != t.length()) return false;
Map<Character, Character> first = new HashMap<>();
Map<Character, Character> second = new HashMap<>();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
if (first.containsKey(c)) {
char secondC = first.get(c);
if (t.charAt(i) != secondC) return false;
} else {
first.put(c, t.charAt(i));
if (second.containsKey(t.charAt(i))) return false;
second.put(t.charAt(i), c);
}
}
return true;
} | public boolean var_0 ( String var_2 , String var_3 ) {
if ( var_2 . length ( ) != var_3 . length ( ) ) return false ;
Map < Character , Character > var_8 = new HashMap < > ( ) ;
Map < Character , Character > var_9 = new HashMap < > ( ) ;
for ( int var_11 = 0 ;
var_11 < var_2 . length ( ) ;
var_11 ++ ) {
char var_13 = var_2 . charAt ( var_11 ) ;
if ( var_8 . containsKey ( var_13 ) ) {
char var_16 = var_8 . get ( var_13 ) ;
if ( var_3 . charAt ( var_11 ) != var_16 ) return false ;
}
else {
var_8 . put ( var_13 , var_3 . charAt ( var_11 ) ) ;
if ( var_9 . containsKey ( var_3 . charAt ( var_11 ) ) ) return false ;
var_9 . put ( var_3 . charAt ( var_11 ) , var_13 ) ;
}
}
return true ;
}
|
1,098 | <gouthampradhan>two_pointers_FourSum_1.java | public List<List<Integer>> fourSum(int[] nums, int target) {
List<List<Integer>> result = new ArrayList<>();
if (nums.length < 4) return result;
Arrays.sort(nums);
for (int i = 0; i < nums.length - 3; i++) {
if (i == 0 || nums[i] != nums[i - 1]) {
for (int j = i + 1; j < nums.length - 2; j++) {
if (j == i + 1 || nums[j] != nums[j - 1]) {
int k = j + 1, l = nums.length - 1;
while (k < l) {
if (k != j + 1 && nums[k] == nums[k + 1]) {
k++;
continue;
}
int sum = nums[i] + nums[j] + nums[k] + nums[l];
if (sum == target) {
result.add(Arrays.asList(nums[i], nums[j], nums[k], nums[l]));
k++;
l--;
} else if (sum < target) {
k++;
} else {
l--;
}
}
}
}
}
}
return result;
} | public List < List < Integer >> var_2 ( int [ ] var_3 , int var_4 ) {
List < List < Integer >> var_6 = new ArrayList < > ( ) ;
if ( var_3 . length < 4 ) return var_6 ;
Arrays . sort ( var_3 ) ;
for ( int var_12 = 0 ;
var_12 < var_3 . length - 3 ;
var_12 ++ ) {
if ( var_12 == 0 || var_3 [ var_12 ] != var_3 [ var_12 - 1 ] ) {
for ( int var_15 = var_12 + 1 ;
var_15 < var_3 . length - 2 ;
var_15 ++ ) {
if ( var_15 == var_12 + 1 || var_3 [ var_15 ] != var_3 [ var_15 - 1 ] ) {
int var_17 = var_15 + 1 , var_18 = var_3 . length - 1 ;
while ( var_17 < var_18 ) {
if ( var_17 != var_15 + 1 && var_3 [ var_17 ] == var_3 [ var_17 + 1 ] ) {
var_17 ++ ;
continue ;
}
int var_19 = var_3 [ var_12 ] + var_3 [ var_15 ] + var_3 [ var_17 ] + var_3 [ var_18 ] ;
if ( var_19 == var_4 ) {
var_6 . add ( Arrays . asList ( var_3 [ var_12 ] , var_3 [ var_15 ] , var_3 [ var_17 ] , var_3 [ var_18 ] ) ) ;
var_17 ++ ;
var_18 -- ;
}
else if ( var_19 < var_4 ) {
var_17 ++ ;
}
else {
var_18 -- ;
}
}
}
}
}
}
return var_6 ;
}
|
1,099 | <gouthampradhan>dynamic_programming_MinimumCostForTickets_1.java | public int mincostTickets(int[] days, int[] costs) {
int[] min = new int[days.length];
Arrays.fill(min, Integer.MAX_VALUE);
for (int i = days.length - 1; i >= 0; i--) {
for (int j = 0; j < costs.length; j++) {
if (j == 0) {
min[i] = Math.min(min[i], costs[j] + ((i + 1 >= min.length) ? 0 : min[i + 1]));
} else if (j == 1) {
int c = 0;
for (int k = i + 1; k < days.length; k++) {
if (days[k] >= (days[i] + 7)) {
c = min[k];
break;
}
}
min[i] = Math.min(min[i], costs[j] + c);
} else {
int c = 0;
for (int k = i + 1; k < days.length; k++) {
if (days[k] >= (days[i] + 30)) {
c = min[k];
break;
}
}
min[i] = Math.min(min[i], costs[j] + c);
}
}
}
return min[0];
} | public int sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
int [ ] min = new int [ var_0 . length ] ;
Arrays . fill ( min , Integer . MAX_VALUE ) ;
for ( int var_9 = var_0 . length - 1 ;
var_9 >= 0 ;
var_9 -- ) {
for ( int var_11 = 0 ;
var_11 < var_1 . length ;
var_11 ++ ) {
if ( var_11 == 0 ) {
min [ var_9 ] = Math . min ( min [ var_9 ] , var_1 [ var_11 ] + ( ( var_9 + 1 >= min . length ) ? 0 : min [ var_9 + 1 ] ) ) ;
}
else if ( var_11 == 1 ) {
int var_13 = 0 ;
for ( int var_14 = var_9 + 1 ;
var_14 < var_0 . length ;
var_14 ++ ) {
if ( var_0 [ var_14 ] >= ( var_0 [ var_9 ] + 7 ) ) {
var_13 = min [ var_14 ] ;
break ;
}
}
min [ var_9 ] = Math . min ( min [ var_9 ] , var_1 [ var_11 ] + var_13 ) ;
}
else {
int var_13 = 0 ;
for ( int var_14 = var_9 + 1 ;
var_14 < var_0 . length ;
var_14 ++ ) {
if ( var_0 [ var_14 ] >= ( var_0 [ var_9 ] + 30 ) ) {
var_13 = min [ var_14 ] ;
break ;
}
}
min [ var_9 ] = Math . min ( min [ var_9 ] , var_1 [ var_11 ] + var_13 ) ;
}
}
}
return min [ 0 ] ;
}
|
Subsets and Splits