id
int64 0
1.17k
| comefrom
stringlengths 21
84
| code
stringlengths 50
1.89k
| masked
stringlengths 63
2.47k
|
|---|---|---|---|
1,100 | <gouthampradhan>string_FindTheClosestPalindrome_1.java | private String getLow(String s) {
int n = s.length() - 1;
StringBuilder sb = new StringBuilder();
for (int i = 0; i < n; i++) {
sb.append("9");
}
return sb.toString();
} | private String var_0 ( String var_2 ) {
int var_5 = var_2 . length ( ) - 1 ;
StringBuilder var_7 = new StringBuilder ( ) ;
for ( int var_9 = 0 ;
var_9 < var_5 ;
var_9 ++ ) {
var_7 . append ( "9" ) ;
}
return var_7 . toString ( ) ;
}
|
1,101 | <gouthampradhan>dynamic_programming_LengthofLongestFibonacciSubsequence_1.java | public int lenLongestFibSubseq(int[] A) {
if (A.length < 3) return 0;
Map<Integer, Map<Integer, Integer>> indexMap = new HashMap<>();
int max = 0;
for (int i = A.length - 1; i >= 0; i--) {
Map<Integer, Integer> subHashMap = new HashMap<>();
for (int j = 0; j < i; j++) {
int sum = A[i] + A[j];
if (indexMap.containsKey(sum)) {
if (indexMap.get(sum).containsKey(A[i])) {
int value = 1 + indexMap.get(sum).get(A[i]);
subHashMap.put(A[j], value);
max = Math.max(max, value);
} else {
subHashMap.put(A[j], 1);
max = Math.max(max, 1);
}
}
}
indexMap.put(A[i], subHashMap);
}
return max == 0 ? 0 : max + 2;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length < 3 ) return 0 ;
Map < Integer , Map < Integer , Integer >> var_7 = new HashMap < > ( ) ;
int max = 0 ;
for ( int var_10 = var_0 . length - 1 ;
var_10 >= 0 ;
var_10 -- ) {
Map < Integer , Integer > var_11 = new HashMap < > ( ) ;
for ( int var_12 = 0 ;
var_12 < var_10 ;
var_12 ++ ) {
int var_13 = var_0 [ var_10 ] + var_0 [ var_12 ] ;
if ( var_7 . containsKey ( var_13 ) ) {
if ( var_7 . get ( var_13 ) . containsKey ( var_0 [ var_10 ] ) ) {
int var_16 = 1 + var_7 . get ( var_13 ) . get ( var_0 [ var_10 ] ) ;
var_11 . put ( var_0 [ var_12 ] , var_16 ) ;
max = Math . max ( max , var_16 ) ;
}
else {
var_11 . put ( var_0 [ var_12 ] , 1 ) ;
max = Math . max ( max , 1 ) ;
}
}
}
var_7 . put ( var_0 [ var_10 ] , var_11 ) ;
}
return max == 0 ? 0 : max + 2 ;
}
|
1,102 | <gouthampradhan>dynamic_programming_PalindromicSubstrings_1.java | public int countSubstrings(String s) {
boolean[][] T = new boolean[s.length()][s.length()];
int count = s.length();
for (int i = 0, j = 0; i < T.length; i++, j++) {
T[i][j] = true;
}
for (int k = 1, col = s.length(); k < col; k++) {
for (int i = 0, j = k; i < col && j < col; i++, j++) {
if (k == 1) {
if (s.charAt(i) == s.charAt(j)) {
T[i][j] = true;
count++;
}
} else {
if (s.charAt(i) == s.charAt(j) && T[i + 1][j - 1]) {
T[i][j] = true;
count++;
}
}
}
}
return count;
} | public int sample_funcname ( String var_1 ) {
boolean [ ] [ ] var_4 = new boolean [ var_1 . length ( ) ] [ var_1 . length ( ) ] ;
int var_5 = var_1 . length ( ) ;
for ( int var_7 = 0 , var_8 = 0 ;
var_7 < var_4 . length ;
var_7 ++ , var_8 ++ ) {
var_4 [ var_7 ] [ var_8 ] = true ;
}
for ( int var_10 = 1 , var_11 = var_1 . length ( ) ;
var_10 < var_11 ;
var_10 ++ ) {
for ( int var_7 = 0 , var_8 = var_10 ;
var_7 < var_11 && var_8 < var_11 ;
var_7 ++ , var_8 ++ ) {
if ( var_10 == 1 ) {
if ( var_1 . charAt ( var_7 ) == var_1 . charAt ( var_8 ) ) {
var_4 [ var_7 ] [ var_8 ] = true ;
var_5 ++ ;
}
}
else {
if ( var_1 . charAt ( var_7 ) == var_1 . charAt ( var_8 ) && var_4 [ var_7 + 1 ] [ var_8 - 1 ] ) {
var_4 [ var_7 ] [ var_8 ] = true ;
var_5 ++ ;
}
}
}
}
return var_5 ;
}
|
1,103 | <gouthampradhan>array_KEmptySlots_1.java | public int kEmptySlots(int[] flowers, int k) {
TreeSet<Integer> set = new TreeSet<>();
for (int i = 0; i < flowers.length; i++) {
Integer lowerBound = set.floor(flowers[i]);
Integer upperBound = set.ceiling(flowers[i]);
if (lowerBound != null) {
if ((Math.abs(flowers[i] - lowerBound) + 1) == k) {
return i + 1;
}
}
if (upperBound != null) {
if ((Math.abs(flowers[i] - upperBound) + 1) == k) {
return i + 1;
}
}
set.add(flowers[i]);
}
return -1;
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
TreeSet < Integer > var_4 = new TreeSet < > ( ) ;
for ( int var_6 = 0 ;
var_6 < var_0 . length ;
var_6 ++ ) {
Integer var_9 = var_4 . floor ( var_0 [ var_6 ] ) ;
Integer var_11 = var_4 . ceiling ( var_0 [ var_6 ] ) ;
if ( var_9 != null ) {
if ( ( Math . abs ( var_0 [ var_6 ] - var_9 ) + 1 ) == var_1 ) {
return var_6 + 1 ;
}
}
if ( var_11 != null ) {
if ( ( Math . abs ( var_0 [ var_6 ] - var_11 ) + 1 ) == var_1 ) {
return var_6 + 1 ;
}
}
var_4 . add ( var_0 [ var_6 ] ) ;
}
return - 1 ;
}
|
1,104 | <gouthampradhan>array_RevealCardsInIncreasingOrder_1.java | public int[] deckRevealedIncreasing(int[] deck) {
Arrays.sort(deck);
ArrayDeque<Integer> queue = new ArrayDeque<>();
for (int i = deck.length - 1; i >= 0; i--) {
queue.offer(deck[i]);
if (i == 0) break;
int temp = queue.pollFirst();
queue.offer(temp);
}
int[] answer = new int[deck.length];
int i = 0;
while (!queue.isEmpty()) {
answer[i++] = queue.pollLast();
}
return answer;
} | public int [ ] sample_funcname ( int [ ] var_0 ) {
Arrays . sort ( var_0 ) ;
ArrayDeque < Integer > var_5 = new ArrayDeque < > ( ) ;
for ( int var_8 = var_0 . length - 1 ;
var_8 >= 0 ;
var_8 -- ) {
var_5 . offer ( var_0 [ var_8 ] ) ;
if ( var_8 == 0 ) break ;
int var_12 = var_5 . pollFirst ( ) ;
var_5 . offer ( var_12 ) ;
}
int [ ] var_13 = new int [ var_0 . length ] ;
int var_8 = 0 ;
while ( ! var_5 . isEmpty ( ) ) {
var_13 [ var_8 ++ ] = var_5 . pollLast ( ) ;
}
return var_13 ;
}
|
1,105 | <gouthampradhan>two_pointers_TrappingRainWater_1.java | private int trap(int[] height) {
if (height.length == 0) return 0;
int[] left = new int[height.length];
int[] right = new int[height.length];
int max = 0;
left[0] = 0;
right[height.length - 1] = 0;
int total = 0;
for (int i = 1, l = height.length; i < l; i++) {
left[i] = Math.max(max, height[i - 1]);
max = left[i];
}
max = 0;
for (int i = height.length - 2; i >= 0; i--) {
right[i] = Math.max(max, height[i + 1]);
max = right[i];
}
for (int i = 0, l = height.length; i < l; i++) {
int min = Math.min(left[i], right[i]);
if (min > height[i]) {
total += (min - height[i]);
}
}
return total;
} | private int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 0 ) return 0 ;
int [ ] var_3 = new int [ var_0 . length ] ;
int [ ] var_4 = new int [ var_0 . length ] ;
int max = 0 ;
var_3 [ 0 ] = 0 ;
var_4 [ var_0 . length - 1 ] = 0 ;
int var_7 = 0 ;
for ( int var_8 = 1 , var_9 = var_0 . length ;
var_8 < var_9 ;
var_8 ++ ) {
var_3 [ var_8 ] = Math . max ( max , var_0 [ var_8 - 1 ] ) ;
max = var_3 [ var_8 ] ;
}
max = 0 ;
for ( int var_8 = var_0 . length - 2 ;
var_8 >= 0 ;
var_8 -- ) {
var_4 [ var_8 ] = Math . max ( max , var_0 [ var_8 + 1 ] ) ;
max = var_4 [ var_8 ] ;
}
for ( int var_8 = 0 , var_9 = var_0 . length ;
var_8 < var_9 ;
var_8 ++ ) {
int min = Math . min ( var_3 [ var_8 ] , var_4 [ var_8 ] ) ;
if ( min > var_0 [ var_8 ] ) {
var_7 += ( min - var_0 [ var_8 ] ) ;
}
}
return var_7 ;
}
|
1,106 | <gouthampradhan>greedy_BurstBalloons_1.java | public int findMinArrowShots(int[][] points) {
if (points.length == 0) return 0;
Arrays.sort(points, ((o1, o2) -> o1[1] - o2[1]));
int count = 0;
int leftMost = points[0][1];
for (int i = 1; i < points.length; i++) {
if (leftMost < points[i][0]) {
count++;
leftMost = points[i][1];
}
}
return count + 1;
} | public int sample_funcname ( int [ ] [ ] var_0 ) {
if ( var_0 . length == 0 ) return 0 ;
Arrays . sort ( var_0 , ( ( var_5 , var_6 ) -> var_5 [ 1 ] - var_6 [ 1 ] ) ) ;
int var_8 = 0 ;
int var_9 = var_0 [ 0 ] [ 1 ] ;
for ( int var_10 = 1 ;
var_10 < var_0 . length ;
var_10 ++ ) {
if ( var_9 < var_0 [ var_10 ] [ 0 ] ) {
var_8 ++ ;
var_9 = var_0 [ var_10 ] [ 1 ] ;
}
}
return var_8 + 1 ;
}
|
1,107 | <gouthampradhan>array_MergeSortedArray_1.java | public void merge(int[] nums1, int m, int[] nums2, int n) {
int i = m + n - 1, j = m - 1, k = n - 1;
while (j >= 0 && k >= 0) nums1[i--] = (nums1[j] > nums2[k]) ? nums1[j--] : nums2[k--];
while (k >= 0) nums1[i--] = nums2[k--];
} | public void var_0 ( int [ ] var_1 , int var_2 , int [ ] var_3 , int var_4 ) {
int var_6 = var_2 + var_4 - 1 , var_7 = var_2 - 1 , var_8 = var_4 - 1 ;
while ( var_7 >= 0 && var_8 >= 0 ) var_1 [ var_6 -- ] = ( var_1 [ var_7 ] > var_3 [ var_8 ] ) ? var_1 [ var_7 -- ] : var_3 [ var_8 -- ] ;
while ( var_8 >= 0 ) var_1 [ var_6 -- ] = var_3 [ var_8 -- ] ;
}
|
1,108 | <gouthampradhan>binary_search_SearchForARange_1.java | private int findIndex(int[] nums, int target, boolean isLowerIndex) {
int result = -1;
int s = 0, e = nums.length - 1;
while (s <= e) {
int m = s + (e - s) / 2;
if (nums[m] == target) {
result = m;
if (isLowerIndex)
e = m - 1;
else s = m + 1;
} else if (nums[m] < target) {
s = m + 1;
} else e = m - 1;
}
return result;
} | private int sample_funcname ( int [ ] var_0 , int var_1 , boolean var_3 ) {
int var_5 = - 1 ;
int var_7 = 0 , var_9 = var_0 . length - 1 ;
while ( var_7 <= var_9 ) {
int var_11 = var_7 + ( var_9 - var_7 ) / 2 ;
if ( var_0 [ var_11 ] == var_1 ) {
var_5 = var_11 ;
if ( var_3 ) var_9 = var_11 - 1 ;
else var_7 = var_11 + 1 ;
}
else if ( var_0 [ var_11 ] < var_1 ) {
var_7 = var_11 + 1 ;
}
else var_9 = var_11 - 1 ;
}
return var_5 ;
}
|
1,109 | <gouthampradhan>string_CountAndSay_1.java | public String countAndSay(int n) {
String result = "1";
for (int i = 1; i < n; i++) {
int count = 1;
char num = result.charAt(0);
StringBuilder temp = new StringBuilder();
for (int j = 1, l = result.length(); j < l; j++) {
if (result.charAt(j) == num) {
count++;
} else {
temp = temp.append(String.valueOf(count)).append(String.valueOf(num));
num = result.charAt(j);
count = 1;
}
}
temp = temp.append(String.valueOf(count)).append(String.valueOf(num));
result = temp.toString();
}
return result;
} | public String var_0 ( int var_1 ) {
String var_4 = "1" ;
for ( int var_6 = 1 ;
var_6 < var_1 ;
var_6 ++ ) {
int var_7 = 1 ;
char var_10 = var_4 . charAt ( 0 ) ;
StringBuilder var_12 = new StringBuilder ( ) ;
for ( int var_13 = 1 , var_15 = var_4 . length ( ) ;
var_13 < var_15 ;
var_13 ++ ) {
if ( var_4 . charAt ( var_13 ) == var_10 ) {
var_7 ++ ;
}
else {
var_12 = var_12 . append ( String . valueOf ( var_7 ) ) . append ( String . valueOf ( var_10 ) ) ;
var_10 = var_4 . charAt ( var_13 ) ;
var_7 = 1 ;
}
}
var_12 = var_12 . append ( String . valueOf ( var_7 ) ) . append ( String . valueOf ( var_10 ) ) ;
var_4 = var_12 . toString ( ) ;
}
return var_4 ;
}
|
1,110 | <gouthampradhan>hashing_PartitionLabels_1.java | public List<Integer> partitionLabels(String S) {
if (S == null || S.trim().isEmpty()) return new ArrayList<>();
Map<Character, Integer> map = new HashMap<>();
for (int i = S.length() - 1; i >= 0; i--) {
char c = S.charAt(i);
map.putIfAbsent(c, i);
}
List<Integer> result = new ArrayList<>();
int start = 0;
int max = map.get(S.charAt(0));
for (int i = 0; i < S.length(); i++) {
char c = S.charAt(i);
if (map.get(c) > max) {
max = map.get(c);
} else if (i == max) {
result.add(max - start + 1);
if (i < S.length() - 1) {
start = i + 1;
max = map.get(S.charAt(i + 1));
}
}
}
return result;
} | public List < Integer > var_1 ( String var_3 ) {
if ( var_3 == null || var_3 . trim ( ) . isEmpty ( ) ) return new ArrayList < > ( ) ;
Map < Character , Integer > var_11 = new HashMap < > ( ) ;
for ( int var_14 = var_3 . length ( ) - 1 ;
var_14 >= 0 ;
var_14 -- ) {
char var_17 = var_3 . charAt ( var_14 ) ;
var_11 . putIfAbsent ( var_17 , var_14 ) ;
}
List < Integer > var_20 = new ArrayList < > ( ) ;
int var_21 = 0 ;
int var_23 = var_11 . get ( var_3 . charAt ( 0 ) ) ;
for ( int var_14 = 0 ;
var_14 < var_3 . length ( ) ;
var_14 ++ ) {
char var_17 = var_3 . charAt ( var_14 ) ;
if ( var_11 . get ( var_17 ) > var_23 ) {
var_23 = var_11 . get ( var_17 ) ;
}
else if ( var_14 == var_23 ) {
var_20 . add ( var_23 - var_21 + 1 ) ;
if ( var_14 < var_3 . length ( ) - 1 ) {
var_21 = var_14 + 1 ;
var_23 = var_11 . get ( var_3 . charAt ( var_14 + 1 ) ) ;
}
}
}
return var_20 ;
}
|
1,111 | <gouthampradhan>two_pointers_RemoveDuplicatesII_1.java | public int removeDuplicates(int[] nums) {
if (nums.length == 0) return 0;
int j = 0;
int count = 1;
for (int i = 1; i < nums.length; i++) {
if (nums[i - 1] == nums[i]) {
count++;
} else {
count = 1;
}
if (count == 1 || count == 2) {
j++;
nums[j] = nums[i];
}
}
return j + 1;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 0 ) return 0 ;
int var_3 = 0 ;
int var_5 = 1 ;
for ( int var_6 = 1 ;
var_6 < var_0 . length ;
var_6 ++ ) {
if ( var_0 [ var_6 - 1 ] == var_0 [ var_6 ] ) {
var_5 ++ ;
}
else {
var_5 = 1 ;
}
if ( var_5 == 1 || var_5 == 2 ) {
var_3 ++ ;
var_0 [ var_3 ] = var_0 [ var_6 ] ;
}
}
return var_3 + 1 ;
}
|
1,112 | <gouthampradhan>dynamic_programming_DecodeWays_1.java | public int numDecodings(String s) {
if (s == null || s.isEmpty()) return 0;
int[] dp = new int[s.length() + 2];
dp[s.length()] = 1;
dp[s.length() + 1] = 1;
for (int i = s.length() - 1; i >= 0; i--) {
for (int j = i + 1; j < i + 3; j++) {
if (j <= s.length()) {
String subStr = s.substring(i, j);
if (!subStr.startsWith("0")) {
int intVal = Integer.parseInt(subStr);
if (intVal <= 26) {
dp[i] += dp[j];
}
}
}
}
}
return dp[0];
} | public int sample_funcname ( String var_1 ) {
if ( var_1 == null || var_1 . isEmpty ( ) ) return 0 ;
int [ ] var_7 = new int [ var_1 . length ( ) + 2 ] ;
var_7 [ var_1 . length ( ) ] = 1 ;
var_7 [ var_1 . length ( ) + 1 ] = 1 ;
for ( int var_9 = var_1 . length ( ) - 1 ;
var_9 >= 0 ;
var_9 -- ) {
for ( int var_10 = var_9 + 1 ;
var_10 < var_9 + 3 ;
var_10 ++ ) {
if ( var_10 <= var_1 . length ( ) ) {
String var_13 = var_1 . substring ( var_9 , var_10 ) ;
if ( ! var_13 . startsWith ( "0" ) ) {
int var_18 = Integer . parseInt ( var_13 ) ;
if ( var_18 <= 26 ) {
var_7 [ var_9 ] += var_7 [ var_10 ] ;
}
}
}
}
}
return var_7 [ 0 ] ;
}
|
1,113 | <gouthampradhan>string_RotateString_1.java | public boolean rotateString(String A, String B) {
if (A.length() == 1 || A.isEmpty() || B.length() == 1 || B.isEmpty()) {
return A.equals(B);
} else if (A.length() != B.length()) {
return false;
}
for (int i = 0, l = A.length(); i < l; i++) {
char s = A.charAt(0);
A = A.substring(1) + s;
if (A.equals(B)) return true;
}
return false;
} | public boolean var_0 ( String var_2 , String var_3 ) {
if ( var_2 . length ( ) == 1 || var_2 . isEmpty ( ) || var_3 . length ( ) == 1 || var_3 . isEmpty ( ) ) {
return var_2 . equals ( var_3 ) ;
}
else if ( var_2 . length ( ) != var_3 . length ( ) ) {
return false ;
}
for ( int var_9 = 0 , var_10 = var_2 . length ( ) ;
var_9 < var_10 ;
var_9 ++ ) {
char var_12 = var_2 . charAt ( 0 ) ;
var_2 = var_2 . substring ( 1 ) + var_12 ;
if ( var_2 . equals ( var_3 ) ) return true ;
}
return false ;
}
|
1,114 | <gouthampradhan>dynamic_programming_CornerRectangles_1.java | public int countCornerRectangles(int[][] grid) {
int[][] count = new int[grid[0].length][grid[0].length];
int result = 0;
for (int[] row : grid) {
for (int i = 0; i < row.length; i++) {
if (row[i] == 1) {
for (int j = i + 1; j < row.length; j++) {
if (row[j] == 1) {
if (count[i][j] > 0) {
result += count[i][j];
}
count[i][j]++;
}
}
}
}
}
return result;
} | public int sample_funcname ( int [ ] [ ] var_0 ) {
int [ ] [ ] var_3 = new int [ var_0 [ 0 ] . length ] [ var_0 [ 0 ] . length ] ;
int var_4 = 0 ;
for ( int [ ] var_5 : var_0 ) {
for ( int var_6 = 0 ;
var_6 < var_5 . length ;
var_6 ++ ) {
if ( var_5 [ var_6 ] == 1 ) {
for ( int var_8 = var_6 + 1 ;
var_8 < var_5 . length ;
var_8 ++ ) {
if ( var_5 [ var_8 ] == 1 ) {
if ( var_3 [ var_6 ] [ var_8 ] > 0 ) {
var_4 += var_3 [ var_6 ] [ var_8 ] ;
}
var_3 [ var_6 ] [ var_8 ] ++ ;
}
}
}
}
}
return var_4 ;
}
|
1,115 | <gouthampradhan>dynamic_programming_CombinationSumIV_1.java | private int backtrack(int[] nums, int[] dp, int sum) {
int total = 0;
if (sum < 0) return 0;
if (dp[sum] != -1) return dp[sum];
else {
for (int num : nums) {
total += backtrack(nums, dp, sum - num);
}
}
dp[sum] = total;
return dp[sum];
} | private int sample_funcname ( int [ ] nums , int [ ] dp , int sum ) {
int total = 0 ;
if ( sum < 0 ) return 0 ;
if ( dp [ sum ] != - 1 ) return dp [ sum ] ;
else {
for ( int num : nums ) {
total += backtrack ( nums , dp , sum - num ) ;
}
}
dp [ sum ] = total ;
return dp [ sum ] ;
}
|
1,116 | <gouthampradhan>dynamic_programming_BestTimeToBuyAndSellStockIII_1.java | public int maxProfit(int[] prices) {
if (prices.length == 0 || prices.length == 1) return 0;
int[] dp = new int[prices.length];
int min = prices[0];
int max = prices[prices.length - 1];
for (int i = prices.length - 2; i >= 0; i--) {
dp[i] = Math.max(max - prices[i], dp[i + 1]);
max = Math.max(max, prices[i]);
}
max = Integer.MIN_VALUE;
for (int i = 0; i < prices.length; i++) {
max = Math.max(max, prices[i] - min + dp[i]);
min = Math.min(min, prices[i]);
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 0 || var_0 . length == 1 ) return 0 ;
int [ ] var_4 = new int [ var_0 . length ] ;
int min = var_0 [ 0 ] ;
int max = var_0 [ var_0 . length - 1 ] ;
for ( int var_8 = var_0 . length - 2 ;
var_8 >= 0 ;
var_8 -- ) {
var_4 [ var_8 ] = Math . max ( max - var_0 [ var_8 ] , var_4 [ var_8 + 1 ] ) ;
max = Math . max ( max , var_0 [ var_8 ] ) ;
}
max = Integer . MIN_VALUE ;
for ( int var_8 = 0 ;
var_8 < var_0 . length ;
var_8 ++ ) {
max = Math . max ( max , var_0 [ var_8 ] - min + var_4 [ var_8 ] ) ;
min = Math . min ( min , var_0 [ var_8 ] ) ;
}
return max ;
}
|
1,117 | <gouthampradhan>math_CountPrimes_1.java | public int countPrimes(int n) {
if (n == 0 || n == 1 || n == 2) return 0;
else if (n == 3) return 1;
BitSet set = new BitSet();
n = n - 1;
int sqRt = (int) Math.sqrt(n);
int count = n;
for (int i = 2; i <= sqRt; i++) {
if (!set.get(i)) {
for (int j = 2; (i * j) <= n; j++) {
if (!set.get(i * j)) {
count--;
set.set(i * j);
}
}
}
}
return count - 1;
} | public int sample_funcname ( int var_0 ) {
if ( var_0 == 0 || var_0 == 1 || var_0 == 2 ) return 0 ;
else if ( var_0 == 3 ) return 1 ;
BitSet set = new BitSet ( ) ;
var_0 = var_0 - 1 ;
int var_9 = ( int ) Math . sqrt ( var_0 ) ;
int var_10 = var_0 ;
for ( int var_11 = 2 ;
var_11 <= var_9 ;
var_11 ++ ) {
if ( ! set . get ( var_11 ) ) {
for ( int var_13 = 2 ;
( var_11 * var_13 ) <= var_0 ;
var_13 ++ ) {
if ( ! set . get ( var_11 * var_13 ) ) {
var_10 -- ;
set . set ( var_11 * var_13 ) ;
}
}
}
}
return var_10 - 1 ;
}
|
1,118 | <gouthampradhan>depth_first_search_CrackingTheSafe_1.java | private int getStates(int n, int k) {
if (n == 0) return 1;
if (n == 1) return k;
int result = 1;
for (int i = 0; i < n; i++) {
result *= k;
}
return result;
} | private int sample_funcname ( int var_0 , int var_1 ) {
if ( var_0 == 0 ) return 1 ;
if ( var_0 == 1 ) return var_1 ;
int var_4 = 1 ;
for ( int var_5 = 0 ;
var_5 < var_0 ;
var_5 ++ ) {
var_4 *= var_1 ;
}
return var_4 ;
}
|
1,119 | <gouthampradhan>array_AddToArrayFormOfInteger_1.java | public List<Integer> addToArrayForm(int[] A, int K) {
StringBuilder sb = new StringBuilder();
for (int a : A) {
sb.append(a);
}
BigInteger big = new BigInteger(sb.toString());
BigInteger result = big.add(BigInteger.valueOf(K));
String resultStr = result.toString();
List<Integer> list = new ArrayList<>();
for (char a : resultStr.toCharArray()) {
list.add(Integer.parseInt(String.valueOf(a)));
}
return list;
} | public List < Integer > var_1 ( int [ ] var_2 , int var_3 ) {
StringBuilder var_5 = new StringBuilder ( ) ;
for ( int var_6 : var_2 ) {
var_5 . append ( var_6 ) ;
}
BigInteger var_10 = new BigInteger ( var_5 . toString ( ) ) ;
BigInteger var_13 = var_10 . add ( BigInteger . valueOf ( var_3 ) ) ;
String var_15 = var_13 . toString ( ) ;
List < Integer > var_18 = new ArrayList < > ( ) ;
for ( char var_6 : var_15 . toCharArray ( ) ) {
var_18 . add ( Integer . parseInt ( String . valueOf ( var_6 ) ) ) ;
}
return var_18 ;
}
|
1,120 | <gouthampradhan>dynamic_programming_TossStrangeCoins_1.java | public double probabilityOfHeads(double[] prob, int target) {
double[][] DP = new double[target + 1][prob.length];
DP[0][0] = 1 - prob[0];
DP[1][0] = prob[0];
for (int c = 1; c < prob.length; c++) {
for (int t = 0; t <= target; t++) {
if (t == 0) DP[t][c] = DP[t][c - 1] * (1 - prob[c]);
else DP[t][c] = DP[t][c - 1] * (1 - prob[c]) + DP[t - 1][c - 1] * (prob[c]);
}
}
return DP[target][prob.length - 1];
} | public double sample_funcname ( double [ ] var_0 , int var_1 ) {
double [ ] [ ] var_4 = new double [ var_1 + 1 ] [ var_0 . length ] ;
var_4 [ 0 ] [ 0 ] = 1 - var_0 [ 0 ] ;
var_4 [ 1 ] [ 0 ] = var_0 [ 0 ] ;
for ( int var_6 = 1 ;
var_6 < var_0 . length ;
var_6 ++ ) {
for ( int var_7 = 0 ;
var_7 <= var_1 ;
var_7 ++ ) {
if ( var_7 == 0 ) var_4 [ var_7 ] [ var_6 ] = var_4 [ var_7 ] [ var_6 - 1 ] * ( 1 - var_0 [ var_6 ] ) ;
else var_4 [ var_7 ] [ var_6 ] = var_4 [ var_7 ] [ var_6 - 1 ] * ( 1 - var_0 [ var_6 ] ) + var_4 [ var_7 - 1 ] [ var_6 - 1 ] * ( var_0 [ var_6 ] ) ;
}
}
return var_4 [ var_1 ] [ var_0 . length - 1 ] ;
}
|
1,121 | <gouthampradhan>hashing_CustomSortString_1.java | public String customSortString(String S, String T) {
Map<Character, Integer> map = new HashMap<>();
for (int i = 0; i < T.length(); i++) {
if (!map.containsKey(T.charAt(i))) {
map.put(T.charAt(i), 1);
} else {
map.put(T.charAt(i), map.get(T.charAt(i)) + 1);
}
}
StringBuilder result = new StringBuilder();
for (char c : S.toCharArray()) {
if (map.containsKey(c)) {
int count = map.remove(c);
for (int i = 0; i < count; i++) {
result.append(c);
}
}
}
for (char c : map.keySet()) {
int count = map.get(c);
for (int i = 0; i < count; i++) {
result.append(c);
}
}
return result.toString();
} | public String var_0 ( String var_2 , String var_3 ) {
Map < Character , Integer > var_8 = new HashMap < > ( ) ;
for ( int var_10 = 0 ;
var_10 < var_3 . length ( ) ;
var_10 ++ ) {
if ( ! var_8 . containsKey ( var_3 . charAt ( var_10 ) ) ) {
var_8 . put ( var_3 . charAt ( var_10 ) , 1 ) ;
}
else {
var_8 . put ( var_3 . charAt ( var_10 ) , var_8 . get ( var_3 . charAt ( var_10 ) ) + 1 ) ;
}
}
StringBuilder var_18 = new StringBuilder ( ) ;
for ( char var_20 : var_2 . toCharArray ( ) ) {
if ( var_8 . containsKey ( var_20 ) ) {
int var_22 = var_8 . remove ( var_20 ) ;
for ( int var_10 = 0 ;
var_10 < var_22 ;
var_10 ++ ) {
var_18 . append ( var_20 ) ;
}
}
}
for ( char var_20 : var_8 . keySet ( ) ) {
int var_22 = var_8 . get ( var_20 ) ;
for ( int var_10 = 0 ;
var_10 < var_22 ;
var_10 ++ ) {
var_18 . append ( var_20 ) ;
}
}
return var_18 . toString ( ) ;
}
|
1,122 | <gouthampradhan>array_ProductOfArrayExceptSelf_1.java | public int[] productExceptSelf(int[] nums) {
int[] result = new int[nums.length];
for (int i = 0, temp = 1, l = nums.length; i < l; i++) {
result[i] = temp;
temp *= nums[i];
}
for (int i = nums.length - 1, temp = 1; i >= 0; i--) {
result[i] = result[i] * temp;
temp *= nums[i];
}
return result;
} | public int [ ] sample_funcname ( int [ ] var_0 ) {
int [ ] var_2 = new int [ var_0 . length ] ;
for ( int var_4 = 0 , var_6 = 1 , var_7 = var_0 . length ;
var_4 < var_7 ;
var_4 ++ ) {
var_2 [ var_4 ] = var_6 ;
var_6 *= var_0 [ var_4 ] ;
}
for ( int var_4 = var_0 . length - 1 , var_6 = 1 ;
var_4 >= 0 ;
var_4 -- ) {
var_2 [ var_4 ] = var_2 [ var_4 ] * var_6 ;
var_6 *= var_0 [ var_4 ] ;
}
return var_2 ;
}
|
1,123 | <gouthampradhan>backtracking_LetterCasePermutation_1.java | private void backtrack(String s, List<String> result, int i, String r) {
if (i == s.length()) {
result.add(r);
} else {
if (Character.isAlphabetic(s.charAt(i))) {
backtrack(s, result, i + 1, r + s.charAt(i));
if (Character.isLowerCase(s.charAt(i))) {
backtrack(s, result, i + 1, r + Character.toUpperCase(s.charAt(i)));
} else {
backtrack(s, result, i + 1, r + Character.toLowerCase(s.charAt(i)));
}
} else {
backtrack(s, result, i + 1, r + s.charAt(i));
}
}
} | private void sample_funcname ( String s , List < String > result , int i , String r ) {
if ( i == s . length ( ) ) {
result . add ( r ) ;
}
else {
if ( Character . isAlphabetic ( s . charAt ( i ) ) ) {
backtrack ( s , result , i + 1 , r + s . charAt ( i ) ) ;
if ( Character . isLowerCase ( s . charAt ( i ) ) ) {
backtrack ( s , result , i + 1 , r + Character . toUpperCase ( s . charAt ( i ) ) ) ;
}
else {
backtrack ( s , result , i + 1 , r + Character . toLowerCase ( s . charAt ( i ) ) ) ;
}
}
else {
backtrack ( s , result , i + 1 , r + s . charAt ( i ) ) ;
}
}
}
|
1,124 | <gouthampradhan>string_SplitConcatenatedStrings_1.java | private String findMax(String[] strs, int i) {
int c = 1;
StringBuilder sb = new StringBuilder();
for (int j = i, l = strs.length; c < l; j = (j + 1) % l, c++) {
String nextStr = strs[j];
String reverse = new StringBuilder(nextStr).reverse().toString();
String result = nextStr.compareTo(reverse) > 0 ? nextStr : reverse;
sb.append(result);
}
return sb.toString();
} | private String var_0 ( String [ ] var_2 , int var_3 ) {
int var_5 = 1 ;
StringBuilder var_7 = new StringBuilder ( ) ;
for ( int var_8 = var_3 , var_10 = var_2 . length ;
var_5 < var_10 ;
var_8 = ( var_8 + 1 ) % var_10 , var_5 ++ ) {
String var_11 = var_2 [ var_8 ] ;
String reverse = new StringBuilder ( var_11 ) . reverse ( ) . toString ( ) ;
String var_16 = var_11 . compareTo ( reverse ) > 0 ? var_11 : reverse ;
var_7 . append ( var_16 ) ;
}
return var_7 . toString ( ) ;
}
|
1,125 | <gouthampradhan>array_CardFilipGame_1.java | public int flipgame(int[] fronts, int[] backs) {
List<Integer> numbers = new ArrayList<>();
for (int i = 0; i < fronts.length; i++) {
numbers.add(fronts[i]);
numbers.add(backs[i]);
}
Collections.sort(numbers);
for (int n : numbers) {
boolean success = true;
for (int i = 0; i < fronts.length; i++) {
if (n == fronts[i] && n == backs[i]) {
success = false;
break;
}
}
if (success) {
return n;
}
}
return 0;
} | public int sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
List < Integer > var_5 = new ArrayList < > ( ) ;
for ( int var_7 = 0 ;
var_7 < var_0 . length ;
var_7 ++ ) {
var_5 . add ( var_0 [ var_7 ] ) ;
var_5 . add ( var_1 [ var_7 ] ) ;
}
Collections . sort ( var_5 ) ;
for ( int var_12 : var_5 ) {
boolean var_14 = true ;
for ( int var_7 = 0 ;
var_7 < var_0 . length ;
var_7 ++ ) {
if ( var_12 == var_0 [ var_7 ] && var_12 == var_1 [ var_7 ] ) {
var_14 = false ;
break ;
}
}
if ( var_14 ) {
return var_12 ;
}
}
return 0 ;
}
|
1,126 | <gouthampradhan>string_MonotoneIncreasingDigits_1.java | public int monotoneIncreasingDigits(int N) {
String s = String.valueOf(N);
if (s.length() == 1) return N;
int p = -1;
int prev = N % 10;
for (int i = s.length() - 2; i >= 0; i--) {
int curr = Integer.parseInt(String.valueOf(s.charAt(i)));
if (curr > prev) {
p = i;
prev = curr - 1;
} else {
prev = curr;
}
}
if (p == -1) return N;
StringBuilder result = new StringBuilder();
for (int i = 0; i < s.length(); i++) {
if (i == p) {
int pV = Integer.parseInt(String.valueOf(s.charAt(i)));
result.append(pV - 1);
break;
}
result.append(String.valueOf(s.charAt(i)));
}
for (int i = p + 1; i < s.length(); i++) {
result.append("9");
}
return Integer.parseInt(result.toString());
} | public int sample_funcname ( int var_0 ) {
String var_3 = String . valueOf ( var_0 ) ;
if ( var_3 . length ( ) == 1 ) return var_0 ;
int var_6 = - 1 ;
int var_8 = var_0 % 10 ;
for ( int var_10 = var_3 . length ( ) - 2 ;
var_10 >= 0 ;
var_10 -- ) {
int var_15 = Integer . parseInt ( String . valueOf ( var_3 . charAt ( var_10 ) ) ) ;
if ( var_15 > var_8 ) {
var_6 = var_10 ;
var_8 = var_15 - 1 ;
}
else {
var_8 = var_15 ;
}
}
if ( var_6 == - 1 ) return var_0 ;
StringBuilder var_17 = new StringBuilder ( ) ;
for ( int var_10 = 0 ;
var_10 < var_3 . length ( ) ;
var_10 ++ ) {
if ( var_10 == var_6 ) {
int var_18 = Integer . parseInt ( String . valueOf ( var_3 . charAt ( var_10 ) ) ) ;
var_17 . append ( var_18 - 1 ) ;
break ;
}
var_17 . append ( String . valueOf ( var_3 . charAt ( var_10 ) ) ) ;
}
for ( int var_10 = var_6 + 1 ;
var_10 < var_3 . length ( ) ;
var_10 ++ ) {
var_17 . append ( "9" ) ;
}
return Integer . parseInt ( var_17 . toString ( ) ) ;
}
|
1,127 | <gouthampradhan>backtracking_ExpressionAddOperators_1.java | private void backTrack(
String exp, List<String> list, int curr, String num, int target, long total, long prod) {
if (curr == num.length()) {
if (total == target) {
list.add(exp);
}
} else {
for (int i = curr, l = num.length(); i < l; i++) {
String newNum = num.substring(curr, i + 1);
if (newNum.length() > 1 && newNum.startsWith("0")) {
break;
}
long newNumL = Long.parseLong(newNum);
if (curr == 0) {
backTrack(newNum, list, i + 1, num, target, newNumL, newNumL);
} else {
backTrack(exp + "+" + newNum, list, i + 1, num, target, total + newNumL, newNumL);
backTrack(exp + "-" + newNum, list, i + 1, num, target, total - newNumL, newNumL * -1L);
backTrack(
exp + "*" + newNum,
list,
i + 1,
num,
target,
(total - prod + (prod * newNumL)),
prod * newNumL);
}
}
}
} | private void sample_funcname ( String exp , List < String > list , int curr , String num , int target , long total , long prod ) {
if ( curr == num . length ( ) ) {
if ( total == target ) {
list . add ( exp ) ;
}
}
else {
for ( int i = curr , l = num . length ( ) ;
i < l ;
i ++ ) {
String newNum = num . substring ( curr , i + 1 ) ;
if ( newNum . length ( ) > 1 && newNum . startsWith ( "0" ) ) {
break ;
}
long newNumL = Long . parseLong ( newNum ) ;
if ( curr == 0 ) {
backTrack ( newNum , list , i + 1 , num , target , newNumL , newNumL ) ;
}
else {
backTrack ( exp + "+" + newNum , list , i + 1 , num , target , total + newNumL , newNumL ) ;
backTrack ( exp + "-" + newNum , list , i + 1 , num , target , total - newNumL , newNumL * - 1L ) ;
backTrack ( exp + "*" + newNum , list , i + 1 , num , target , ( total - prod + ( prod * newNumL ) ) , prod * newNumL ) ;
}
}
}
}
|
1,128 | <gouthampradhan>math_ReachingPoints_1.java | private int[] reduce(int x, int y) {
int t = x - y;
int q = t / y;
x -= (y * q);
if ((t % y) != 0) {
x -= y;
}
return new int[] {x, y};
} | private int [ ] sample_funcname ( int var_0 , int var_1 ) {
int var_2 = var_0 - var_1 ;
int var_3 = var_2 / var_1 ;
var_0 -= ( var_1 * var_3 ) ;
if ( ( var_2 % var_1 ) != 0 ) {
var_0 -= var_1 ;
}
return new int [ ] {
var_0 , var_1 };
}
|
1,129 | <gouthampradhan>dynamic_programming_LargestPlusSign_1.java | public int orderOfLargestPlusSign(int N, int[][] mines) {
int[][] A = new int[N][N];
int[][] B = new int[N][N];
for (int[] row : mines) {
int r = row[0];
int c = row[1];
A[r][c] = 1;
}
for (int i = 0; i < A.length; i++) {
for (int j = 0; j < A[0].length; j++) {
if (A[i][j] == 0) {
A[i][j] = 1;
} else {
A[i][j] = 0;
}
B[i][j] = Integer.MAX_VALUE;
}
}
for (int i = 0; i < A.length; i++) {
int prev = 0;
for (int j = 0; j < A[0].length; j++) {
if (A[i][j] == 0) {
prev = 0;
B[i][j] = 0;
} else {
prev++;
B[i][j] = Math.min(B[i][j], prev);
}
}
prev = 0;
for (int j = N - 1; j >= 0; j--) {
if (A[i][j] == 0) {
prev = 0;
B[i][j] = 0;
} else {
prev++;
B[i][j] = Math.min(B[i][j], prev);
}
}
}
for (int j = 0; j < B[0].length; j++) {
int prev = 0;
for (int i = 0; i < B.length; i++) {
if (A[i][j] == 0) {
prev = 0;
B[i][j] = 0;
} else {
prev++;
B[i][j] = Math.min(B[i][j], prev);
}
}
prev = 0;
for (int i = N - 1; i >= 0; i--) {
if (A[i][j] == 0) {
prev = 0;
B[i][j] = 0;
} else {
prev++;
B[i][j] = Math.min(B[i][j], prev);
}
}
}
int result = 0;
for (int i = 0; i < B.length; i++) {
for (int j = 0; j < B[0].length; j++) {
result = Math.max(result, B[i][j]);
}
}
return result;
} | public int sample_funcname ( int var_0 , int [ ] [ ] var_1 ) {
int [ ] [ ] var_2 = new int [ var_0 ] [ var_0 ] ;
int [ ] [ ] var_3 = new int [ var_0 ] [ var_0 ] ;
for ( int [ ] var_4 : var_1 ) {
int var_6 = var_4 [ 0 ] ;
int var_8 = var_4 [ 1 ] ;
var_2 [ var_6 ] [ var_8 ] = 1 ;
}
for ( int var_9 = 0 ;
var_9 < var_2 . length ;
var_9 ++ ) {
for ( int var_11 = 0 ;
var_11 < var_2 [ 0 ] . length ;
var_11 ++ ) {
if ( var_2 [ var_9 ] [ var_11 ] == 0 ) {
var_2 [ var_9 ] [ var_11 ] = 1 ;
}
else {
var_2 [ var_9 ] [ var_11 ] = 0 ;
}
var_3 [ var_9 ] [ var_11 ] = Integer . MAX_VALUE ;
}
}
for ( int var_9 = 0 ;
var_9 < var_2 . length ;
var_9 ++ ) {
int var_14 = 0 ;
for ( int var_11 = 0 ;
var_11 < var_2 [ 0 ] . length ;
var_11 ++ ) {
if ( var_2 [ var_9 ] [ var_11 ] == 0 ) {
var_14 = 0 ;
var_3 [ var_9 ] [ var_11 ] = 0 ;
}
else {
var_14 ++ ;
var_3 [ var_9 ] [ var_11 ] = Math . min ( var_3 [ var_9 ] [ var_11 ] , var_14 ) ;
}
}
var_14 = 0 ;
for ( int var_11 = var_0 - 1 ;
var_11 >= 0 ;
var_11 -- ) {
if ( var_2 [ var_9 ] [ var_11 ] == 0 ) {
var_14 = 0 ;
var_3 [ var_9 ] [ var_11 ] = 0 ;
}
else {
var_14 ++ ;
var_3 [ var_9 ] [ var_11 ] = Math . min ( var_3 [ var_9 ] [ var_11 ] , var_14 ) ;
}
}
}
for ( int var_11 = 0 ;
var_11 < var_3 [ 0 ] . length ;
var_11 ++ ) {
int var_14 = 0 ;
for ( int var_9 = 0 ;
var_9 < var_3 . length ;
var_9 ++ ) {
if ( var_2 [ var_9 ] [ var_11 ] == 0 ) {
var_14 = 0 ;
var_3 [ var_9 ] [ var_11 ] = 0 ;
}
else {
var_14 ++ ;
var_3 [ var_9 ] [ var_11 ] = Math . min ( var_3 [ var_9 ] [ var_11 ] , var_14 ) ;
}
}
var_14 = 0 ;
for ( int var_9 = var_0 - 1 ;
var_9 >= 0 ;
var_9 -- ) {
if ( var_2 [ var_9 ] [ var_11 ] == 0 ) {
var_14 = 0 ;
var_3 [ var_9 ] [ var_11 ] = 0 ;
}
else {
var_14 ++ ;
var_3 [ var_9 ] [ var_11 ] = Math . min ( var_3 [ var_9 ] [ var_11 ] , var_14 ) ;
}
}
}
int var_17 = 0 ;
for ( int var_9 = 0 ;
var_9 < var_3 . length ;
var_9 ++ ) {
for ( int var_11 = 0 ;
var_11 < var_3 [ 0 ] . length ;
var_11 ++ ) {
var_17 = Math . max ( var_17 , var_3 [ var_9 ] [ var_11 ] ) ;
}
}
return var_17 ;
}
|
1,130 | <gouthampradhan>stack_DecodeString_1.java | public String decodeString(String s) {
Stack<Character> stack = new Stack<>();
for (int i = 0; i < s.length(); i++) {
if (s.charAt(i) == ']') {
StringBuilder stackBuff = new StringBuilder();
while (stack.peek() != '[') {
stackBuff.append(stack.pop());
}
stack.pop();
String num = "";
while (!stack.isEmpty() && !Character.isAlphabetic(stack.peek()) && stack.peek() != '[') {
num = stack.pop() + num;
}
String str = stackBuff.reverse().toString();
StringBuilder stringMultiple = new StringBuilder();
int N = Integer.parseInt(num);
while (N-- > 0) {
stringMultiple.append(str);
}
for (int j = 0; j < stringMultiple.length(); j++) {
stack.push(stringMultiple.charAt(j));
}
} else stack.push(s.charAt(i));
}
StringBuilder result = new StringBuilder();
while (!stack.isEmpty()) {
result.append(stack.pop());
}
return result.reverse().toString();
} | public String var_0 ( String var_2 ) {
Stack < Character > var_5 = new Stack < > ( ) ;
for ( int var_7 = 0 ;
var_7 < var_2 . length ( ) ;
var_7 ++ ) {
if ( var_2 . charAt ( var_7 ) == ']' ) {
StringBuilder var_12 = new StringBuilder ( ) ;
while ( var_5 . peek ( ) != '[' ) {
var_12 . append ( var_5 . pop ( ) ) ;
}
var_5 . pop ( ) ;
String var_18 = "" ;
while ( ! var_5 . isEmpty ( ) && ! Character . isAlphabetic ( var_5 . peek ( ) ) && var_5 . peek ( ) != '[' ) {
var_18 = var_5 . pop ( ) + var_18 ;
}
String var_23 = var_12 . reverse ( ) . toString ( ) ;
StringBuilder var_24 = new StringBuilder ( ) ;
int var_27 = Integer . parseInt ( var_18 ) ;
while ( var_27 -- > 0 ) {
var_24 . append ( var_23 ) ;
}
for ( int var_28 = 0 ;
var_28 < var_24 . length ( ) ;
var_28 ++ ) {
var_5 . push ( var_24 . charAt ( var_28 ) ) ;
}
}
else var_5 . push ( var_2 . charAt ( var_7 ) ) ;
}
StringBuilder var_30 = new StringBuilder ( ) ;
while ( ! var_5 . isEmpty ( ) ) {
var_30 . append ( var_5 . pop ( ) ) ;
}
return var_30 . reverse ( ) . toString ( ) ;
}
|
1,131 | <gouthampradhan>dynamic_programming_OddEvenJump_1.java | private int dp(int[] A, int i, int[][] next, int[][] possible, int oddOrEven) {
if (i == A.length - 1) return 1;
else if (possible[oddOrEven][i] == 1 || possible[oddOrEven][i] == 0) {
return possible[oddOrEven][i];
} else {
int nextPos = oddOrEven == 0 ? next[0][i] : next[1][i];
if (nextPos == -1) {
possible[oddOrEven][i] = 0;
return possible[oddOrEven][i];
} else {
possible[oddOrEven][i] = dp(A, nextPos, next, possible, ((oddOrEven + 1) % 2));
return possible[oddOrEven][i];
}
}
} | private int sample_funcname ( int [ ] A , int i , int [ ] [ ] next , int [ ] [ ] possible , int oddOrEven ) {
if ( i == A . length - 1 ) return 1 ;
else if ( possible [ oddOrEven ] [ i ] == 1 || possible [ oddOrEven ] [ i ] == 0 ) {
return possible [ oddOrEven ] [ i ] ;
}
else {
int nextPos = oddOrEven == 0 ? next [ 0 ] [ i ] : next [ 1 ] [ i ] ;
if ( nextPos == - 1 ) {
possible [ oddOrEven ] [ i ] = 0 ;
return possible [ oddOrEven ] [ i ] ;
}
else {
possible [ oddOrEven ] [ i ] = dp ( A , nextPos , next , possible , ( ( oddOrEven + 1 ) % 2 ) ) ;
return possible [ oddOrEven ] [ i ] ;
}
}
}
|
1,132 | <gouthampradhan>math_BulbSwitcherII_1.java | public int flipLights(int n, int m) {
if (n == 0 || m == 0) return 1;
if (n == 1 && m >= 1) return 2;
if (n == 2) {
if (m == 1) return 3;
if (m >= 2) return 4;
} else if (n >= 3) {
if (m == 1) return 4;
if (m == 2) return 7;
}
return 8;
} | public int sample_funcname ( int var_0 , int var_1 ) {
if ( var_0 == 0 || var_1 == 0 ) return 1 ;
if ( var_0 == 1 && var_1 >= 1 ) return 2 ;
if ( var_0 == 2 ) {
if ( var_1 == 1 ) return 3 ;
if ( var_1 >= 2 ) return 4 ;
}
else if ( var_0 >= 3 ) {
if ( var_1 == 1 ) return 4 ;
if ( var_1 == 2 ) return 7 ;
}
return 8 ;
}
|
1,133 | <gouthampradhan>stack_LargestRectangleInHistogram_1.java | public int largestRectangleArea(int[] heights) {
if (heights.length == 0) return 0;
int maxArea = Integer.MIN_VALUE;
Stack<Integer> stack = new Stack<>();
int i = 0;
for (; i < heights.length; i++) {
while (!stack.isEmpty() && heights[stack.peek()] >= heights[i]) {
int top = stack.pop();
int base = stack.isEmpty() ? i : i - stack.peek() - 1;
maxArea = Math.max(maxArea, base * heights[top]);
}
stack.push(i);
}
while (!stack.isEmpty()) {
int top = stack.pop();
int base = stack.isEmpty() ? i : i - stack.peek() - 1;
maxArea = Math.max(maxArea, base * heights[top]);
}
return maxArea;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 0 ) return 0 ;
int var_5 = Integer . MIN_VALUE ;
Stack < Integer > var_7 = new Stack < > ( ) ;
int var_8 = 0 ;
for ( ;
var_8 < var_0 . length ;
var_8 ++ ) {
while ( ! var_7 . isEmpty ( ) && var_0 [ var_7 . peek ( ) ] >= var_0 [ var_8 ] ) {
int var_12 = var_7 . pop ( ) ;
int var_14 = var_7 . isEmpty ( ) ? var_8 : var_8 - var_7 . peek ( ) - 1 ;
var_5 = Math . max ( var_5 , var_14 * var_0 [ var_12 ] ) ;
}
var_7 . push ( var_8 ) ;
}
while ( ! var_7 . isEmpty ( ) ) {
int var_12 = var_7 . pop ( ) ;
int var_14 = var_7 . isEmpty ( ) ? var_8 : var_8 - var_7 . peek ( ) - 1 ;
var_5 = Math . max ( var_5 , var_14 * var_0 [ var_12 ] ) ;
}
return var_5 ;
}
|
1,134 | <gouthampradhan>hashing_DistributeCandies_1.java | public int distributeCandies(int[] candies) {
int N = candies.length;
Set<Integer> set = new HashSet<>();
for (int c : candies) {
set.add(c);
}
int n = set.size();
return Math.min(N / 2, set.size());
} | public int sample_funcname ( int [ ] var_0 ) {
int var_2 = var_0 . length ;
Set < Integer > var_6 = new HashSet < > ( ) ;
for ( int var_7 : var_0 ) {
var_6 . add ( var_7 ) ;
}
int var_10 = var_6 . size ( ) ;
return Math . min ( var_2 / 2 , var_6 . size ( ) ) ;
}
|
1,135 | <gouthampradhan>greedy_PartitionLabels_1.java | public List<Integer> partitionLabels(String S) {
Map<Character, Integer> map = new HashMap<>();
for (int i = 0; i < S.length(); i++) {
char c = S.charAt(i);
map.putIfAbsent(c, i);
map.remove(c);
map.put(c, i);
}
char start = S.charAt(0);
int currMax = map.get(start);
int startIndex = 0;
List<Integer> list = new ArrayList<>();
while (true) {
int i = startIndex;
for (; i <= currMax; i++) {
char c = S.charAt(i);
int pos = map.get(c);
currMax = Math.max(currMax, pos);
}
if (i > currMax && i < S.length()) {
list.add(i - startIndex);
startIndex = i;
currMax = map.get(S.charAt(i));
} else {
if (i == S.length()) {
list.add(i - startIndex);
break;
}
}
}
return list;
} | public List < Integer > var_1 ( String var_3 ) {
Map < Character , Integer > var_7 = new HashMap < > ( ) ;
for ( int var_9 = 0 ;
var_9 < var_3 . length ( ) ;
var_9 ++ ) {
char var_12 = var_3 . charAt ( var_9 ) ;
var_7 . putIfAbsent ( var_12 , var_9 ) ;
var_7 . remove ( var_12 ) ;
var_7 . put ( var_12 , var_9 ) ;
}
char var_16 = var_3 . charAt ( 0 ) ;
int var_18 = var_7 . get ( var_16 ) ;
int var_19 = 0 ;
List < Integer > var_22 = new ArrayList < > ( ) ;
while ( true ) {
int var_9 = var_19 ;
for ( ;
var_9 <= var_18 ;
var_9 ++ ) {
char var_12 = var_3 . charAt ( var_9 ) ;
int var_23 = var_7 . get ( var_12 ) ;
var_18 = Math . max ( var_18 , var_23 ) ;
}
if ( var_9 > var_18 && var_9 < var_3 . length ( ) ) {
var_22 . add ( var_9 - var_19 ) ;
var_19 = var_9 ;
var_18 = var_7 . get ( var_3 . charAt ( var_9 ) ) ;
}
else {
if ( var_9 == var_3 . length ( ) ) {
var_22 . add ( var_9 - var_19 ) ;
break ;
}
}
}
return var_22 ;
}
|
1,136 | <gouthampradhan>array_MinimumSwapsToGroupAll1Together_1.java | public int minSwaps(int[] data) {
int one = 0;
int zero = 0;
for (int i = 0; i < data.length; i++) {
if (data[i] == 1) {
one++;
} else zero++;
}
if (one == 0) return 0;
int window = one;
one = 0;
zero = 0;
int i = 0, j = window - 1;
for (int k = i; k <= j; k++) {
if (data[k] == 1) {
one++;
} else zero++;
}
i++;
j++;
int min = zero;
for (; j < data.length; i++, j++) {
if (data[j] == 0) {
zero++;
} else one++;
if (data[i - 1] == 0) {
zero--;
} else one--;
min = Math.min(min, zero);
}
return min;
} | public int sample_funcname ( int [ ] var_0 ) {
int var_2 = 0 ;
int var_3 = 0 ;
for ( int var_4 = 0 ;
var_4 < var_0 . length ;
var_4 ++ ) {
if ( var_0 [ var_4 ] == 1 ) {
var_2 ++ ;
}
else var_3 ++ ;
}
if ( var_2 == 0 ) return 0 ;
int var_7 = var_2 ;
var_2 = 0 ;
var_3 = 0 ;
int var_4 = 0 , var_8 = var_7 - 1 ;
for ( int var_9 = var_4 ;
var_9 <= var_8 ;
var_9 ++ ) {
if ( var_0 [ var_9 ] == 1 ) {
var_2 ++ ;
}
else var_3 ++ ;
}
var_4 ++ ;
var_8 ++ ;
int min = var_3 ;
for ( ;
var_8 < var_0 . length ;
var_4 ++ , var_8 ++ ) {
if ( var_0 [ var_8 ] == 0 ) {
var_3 ++ ;
}
else var_2 ++ ;
if ( var_0 [ var_4 - 1 ] == 0 ) {
var_3 -- ;
}
else var_2 -- ;
min = Math . min ( min , var_3 ) ;
}
return min ;
}
|
1,137 | <gouthampradhan>array_HIndex_1.java | public int hIndex(int[] citations) {
int n = citations.length;
int[] count = new int[n + 1];
int[] S = new int[n + 1];
for (int i = 0; i < citations.length; i++) {
if (citations[i] > n) {
citations[i] = n;
}
}
for (int citation : citations) {
count[citation]++;
}
S[n] = count[n];
for (int i = n - 1; i >= 0; i--) {
S[i] = count[i] + S[i + 1];
}
for (int i = n; i >= 0; i--) {
if (i <= S[i]) {
return i;
}
}
return 0;
} | public int sample_funcname ( int [ ] var_0 ) {
int var_2 = var_0 . length ;
int [ ] var_4 = new int [ var_2 + 1 ] ;
int [ ] var_5 = new int [ var_2 + 1 ] ;
for ( int var_7 = 0 ;
var_7 < var_0 . length ;
var_7 ++ ) {
if ( var_0 [ var_7 ] > var_2 ) {
var_0 [ var_7 ] = var_2 ;
}
}
for ( int var_8 : var_0 ) {
var_4 [ var_8 ] ++ ;
}
var_5 [ var_2 ] = var_4 [ var_2 ] ;
for ( int var_7 = var_2 - 1 ;
var_7 >= 0 ;
var_7 -- ) {
var_5 [ var_7 ] = var_4 [ var_7 ] + var_5 [ var_7 + 1 ] ;
}
for ( int var_7 = var_2 ;
var_7 >= 0 ;
var_7 -- ) {
if ( var_7 <= var_5 [ var_7 ] ) {
return var_7 ;
}
}
return 0 ;
}
|
1,138 | <gouthampradhan>math_WaterAndJugProblem_1.java | public boolean canMeasureWater(int x, int y, int z) {
if (x == y && y == z) return true;
if (z > (x + y)) return false;
BigInteger b1 = new BigInteger(String.valueOf(x));
BigInteger b2 = new BigInteger(String.valueOf(y));
BigInteger b3 = b1.gcd(b2);
return b3.intValue() != 0 && (z % b3.intValue()) == 0;
} | public boolean var_0 ( int var_1 , int var_2 , int var_3 ) {
if ( var_1 == var_2 && var_2 == var_3 ) return true ;
if ( var_3 > ( var_1 + var_2 ) ) return false ;
BigInteger var_7 = new BigInteger ( String . valueOf ( var_1 ) ) ;
BigInteger var_8 = new BigInteger ( String . valueOf ( var_2 ) ) ;
BigInteger var_10 = var_7 . gcd ( var_8 ) ;
return var_10 . intValue ( ) != 0 && ( var_3 % var_10 . intValue ( ) ) == 0 ;
}
|
1,139 | <gouthampradhan>array_ThirdMaximumNumber_1.java | public int thirdMax(int[] nums) {
long[] max = {Long.MIN_VALUE, Long.MIN_VALUE, Long.MIN_VALUE};
int count = 0;
for (int num : nums) {
for (int j = 0; j < 3; j++) {
if (max[j] > num) continue;
else if (max[j] == num) break;
int k = j;
long temp1, temp2;
temp1 = num;
count++;
while (k < 3) {
temp2 = max[k];
max[k] = temp1;
temp1 = temp2;
k++;
}
break;
}
}
System.out.println(Integer.MIN_VALUE);
return (count >= 3) ? (int) max[2] : (int) max[0];
} | public int sample_funcname ( int [ ] var_0 ) {
long [ ] var_3 = {
Long . MIN_VALUE , Long . MIN_VALUE , Long . MIN_VALUE };
int var_5 = 0 ;
for ( int var_6 : var_0 ) {
for ( int var_7 = 0 ;
var_7 < 3 ;
var_7 ++ ) {
if ( var_3 [ var_7 ] > var_6 ) continue ;
else if ( var_3 [ var_7 ] == var_6 ) break ;
int var_9 = var_7 ;
long var_10 , var_11 ;
var_10 = var_6 ;
var_5 ++ ;
while ( var_9 < 3 ) {
var_11 = var_3 [ var_9 ] ;
var_3 [ var_9 ] = var_10 ;
var_10 = var_11 ;
var_9 ++ ;
}
break ;
}
}
System . out . println ( Integer . MIN_VALUE ) ;
return ( var_5 >= 3 ) ? ( int ) var_3 [ 2 ] : ( int ) var_3 [ 0 ] ;
}
|
1,140 | <gouthampradhan>math_Base7_1.java | public String convertToBase7(int num) {
Integer.toString(7, 7);
if (num == 0) return "0";
int q = Math.abs(num), r;
StringBuilder sb = new StringBuilder();
while (q != 0) {
r = q % 7;
sb.append(r);
q /= 7;
}
if (num < 0) {
return "-" + sb.reverse().toString();
} else return sb.reverse().toString();
} | public String var_0 ( int var_1 ) {
Integer . toString ( 7 , 7 ) ;
if ( var_1 == 0 ) return "0" ;
int var_9 = Math . abs ( var_1 ) , var_10 ;
StringBuilder var_12 = new StringBuilder ( ) ;
while ( var_9 != 0 ) {
var_10 = var_9 % 7 ;
var_12 . append ( var_10 ) ;
var_9 /= 7 ;
}
if ( var_1 < 0 ) {
return "-" + var_12 . reverse ( ) . toString ( ) ;
}
else return var_12 . reverse ( ) . toString ( ) ;
}
|
1,141 | <gouthampradhan>math_RomanToInteger_1.java | public int romanToInt(String s) {
Map<Character, Integer> map = new HashMap<>();
map.put('I', 1);
map.put('V', 5);
map.put('X', 10);
map.put('L', 50);
map.put('C', 100);
map.put('D', 500);
map.put('M', 1000);
String str = new StringBuilder(s).reverse().toString();
int sum = 0, prev = -1;
for (int i = 0, l = str.length(); i < l; i++) {
int curr = map.get(str.charAt(i));
if (curr < prev) {
sum -= curr;
} else {
sum += curr;
}
prev = curr;
}
return sum;
} | public int sample_funcname ( String var_1 ) {
Map < Character , Integer > var_6 = new HashMap < > ( ) ;
var_6 . put ( 'I' , 1 ) ;
var_6 . put ( 'V' , 5 ) ;
var_6 . put ( 'X' , 10 ) ;
var_6 . put ( 'L' , 50 ) ;
var_6 . put ( 'C' , 100 ) ;
var_6 . put ( 'D' , 500 ) ;
var_6 . put ( 'M' , 1000 ) ;
String var_25 = new StringBuilder ( var_1 ) . reverse ( ) . toString ( ) ;
int var_27 = 0 , var_28 = - 1 ;
for ( int var_29 = 0 , var_31 = var_25 . length ( ) ;
var_29 < var_31 ;
var_29 ++ ) {
int var_34 = var_6 . get ( var_25 . charAt ( var_29 ) ) ;
if ( var_34 < var_28 ) {
var_27 -= var_34 ;
}
else {
var_27 += var_34 ;
}
var_28 = var_34 ;
}
return var_27 ;
}
|
1,142 | <gouthampradhan>bit_manipulation_BinaryNumberWithAlternatingBits_1.java | public boolean hasAlternatingBits(int n) {
int curr = n & 1;
int pos = 0;
for (int i = 0; i < 32; i++) {
if ((n & (1 << i)) > 0) {
pos = i;
}
}
for (int i = 1; i <= pos; i++) {
int temp = (1 << i) & n;
if ((temp > 0 && curr > 0) || (temp == 0 && curr == 0)) return false;
curr = temp;
}
return true;
} | public boolean var_0 ( int var_1 ) {
int var_3 = var_1 & 1 ;
int var_5 = 0 ;
for ( int var_6 = 0 ;
var_6 < 32 ;
var_6 ++ ) {
if ( ( var_1 & ( 1 << var_6 ) ) > 0 ) {
var_5 = var_6 ;
}
}
for ( int var_6 = 1 ;
var_6 <= var_5 ;
var_6 ++ ) {
int var_8 = ( 1 << var_6 ) & var_1 ;
if ( ( var_8 > 0 && var_3 > 0 ) || ( var_8 == 0 && var_3 == 0 ) ) return false ;
var_3 = var_8 ;
}
return true ;
}
|
1,143 | <gouthampradhan>dynamic_programming_OnesAndZeroes_1.java | public int findMaxForm(String[] strs, int m, int n) {
int[][][] dp = new int[strs.length + 1][m + 1][n + 1];
for (int i = strs.length - 1; i >= 0; i--) {
String string = strs[i];
int zero = 0;
int one = 0;
for (char c : string.toCharArray()) {
if (c == '0') {
zero++;
} else {
one++;
}
}
for (int p = m; p >= 0; p--) {
for (int q = n; q >= 0; q--) {
dp[i][p][q] = dp[i + 1][p][q];
if (p - zero >= 0 && q - one >= 0) {
dp[i][p][q] = Math.max(dp[i][p][q], dp[i + 1][p - zero][q - one] + 1);
}
}
}
}
return dp[0][m][n];
} | public int sample_funcname ( String [ ] var_1 , int var_2 , int var_3 ) {
int [ ] [ ] [ ] var_6 = new int [ var_1 . length + 1 ] [ var_2 + 1 ] [ var_3 + 1 ] ;
for ( int var_7 = var_1 . length - 1 ;
var_7 >= 0 ;
var_7 -- ) {
String var_9 = var_1 [ var_7 ] ;
int var_10 = 0 ;
int var_11 = 0 ;
for ( char var_13 : var_9 . toCharArray ( ) ) {
if ( var_13 == '0' ) {
var_10 ++ ;
}
else {
var_11 ++ ;
}
}
for ( int var_15 = var_2 ;
var_15 >= 0 ;
var_15 -- ) {
for ( int var_16 = var_3 ;
var_16 >= 0 ;
var_16 -- ) {
var_6 [ var_7 ] [ var_15 ] [ var_16 ] = var_6 [ var_7 + 1 ] [ var_15 ] [ var_16 ] ;
if ( var_15 - var_10 >= 0 && var_16 - var_11 >= 0 ) {
var_6 [ var_7 ] [ var_15 ] [ var_16 ] = Math . max ( var_6 [ var_7 ] [ var_15 ] [ var_16 ] , var_6 [ var_7 + 1 ] [ var_15 - var_10 ] [ var_16 - var_11 ] + 1 ) ;
}
}
}
}
return var_6 [ 0 ] [ var_2 ] [ var_3 ] ;
}
|
1,144 | <gouthampradhan>dynamic_programming_InterleavingString_1.java | public boolean isInterleave(String s1, String s2, String s3) {
boolean[][] DP = new boolean[s1.length() + 1][s2.length() + 1];
DP[0][0] = true;
if (s3.length() != (s2.length() + s1.length())) return false;
for (int i = 0; i <= s1.length(); i++) {
for (int j = 0; j <= s2.length(); j++) {
if (i == 0 && j == 0) continue;
int index = (i + j);
if (j > 0) {
if (s3.charAt(index - 1) == s2.charAt(j - 1) && DP[i][j - 1]) {
DP[i][j] = true;
}
}
if (i > 0) {
if (s3.charAt(index - 1) == s1.charAt(i - 1) && DP[i - 1][j]) {
DP[i][j] = true;
}
}
}
}
return DP[s1.length()][s2.length()];
} | public boolean var_0 ( String var_2 , String var_3 , String var_4 ) {
boolean [ ] [ ] var_8 = new boolean [ var_2 . length ( ) + 1 ] [ var_3 . length ( ) + 1 ] ;
var_8 [ 0 ] [ 0 ] = true ;
if ( var_4 . length ( ) != ( var_3 . length ( ) + var_2 . length ( ) ) ) return false ;
for ( int var_10 = 0 ;
var_10 <= var_2 . length ( ) ;
var_10 ++ ) {
for ( int var_11 = 0 ;
var_11 <= var_3 . length ( ) ;
var_11 ++ ) {
if ( var_10 == 0 && var_11 == 0 ) continue ;
int var_12 = ( var_10 + var_11 ) ;
if ( var_11 > 0 ) {
if ( var_4 . charAt ( var_12 - 1 ) == var_3 . charAt ( var_11 - 1 ) && var_8 [ var_10 ] [ var_11 - 1 ] ) {
var_8 [ var_10 ] [ var_11 ] = true ;
}
}
if ( var_10 > 0 ) {
if ( var_4 . charAt ( var_12 - 1 ) == var_2 . charAt ( var_10 - 1 ) && var_8 [ var_10 - 1 ] [ var_11 ] ) {
var_8 [ var_10 ] [ var_11 ] = true ;
}
}
}
}
return var_8 [ var_2 . length ( ) ] [ var_3 . length ( ) ] ;
}
|
1,145 | <gouthampradhan>array_SparseMatrixMultiplication_1.java | public int[][] multiply(int[][] A, int[][] B) {
boolean[] AH = new boolean[A.length];
boolean[] BH = new boolean[B[0].length];
for (int i = 0; i < A.length; i++) {
for (int j = 0; j < A[0].length; j++) {
if (A[i][j] != 0) {
AH[i] = true;
break;
}
}
}
for (int i = 0; i < B[0].length; i++) {
for (int j = 0; j < B.length; j++) {
if (B[j][i] != 0) {
BH[i] = true;
break;
}
}
}
int[][] C = new int[A.length][B[0].length];
for (int i = 0; i < C.length; i++) {
if (AH[i]) {
for (int j = 0; j < C[0].length; j++) {
if (BH[j]) {
int sum = 0;
for (int k = 0; k < A[0].length; k++) {
sum += A[i][k] * B[k][j];
}
C[i][j] = sum;
}
}
}
}
return C;
} | public int [ ] [ ] sample_funcname ( int [ ] [ ] var_0 , int [ ] [ ] var_1 ) {
boolean [ ] var_4 = new boolean [ var_0 . length ] ;
boolean [ ] var_6 = new boolean [ var_1 [ 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 ] != 0 ) {
var_4 [ var_7 ] = true ;
break ;
}
}
}
for ( int var_7 = 0 ;
var_7 < var_1 [ 0 ] . length ;
var_7 ++ ) {
for ( int var_8 = 0 ;
var_8 < var_1 . length ;
var_8 ++ ) {
if ( var_1 [ var_8 ] [ var_7 ] != 0 ) {
var_6 [ var_7 ] = true ;
break ;
}
}
}
int [ ] [ ] var_9 = new int [ var_0 . length ] [ var_1 [ 0 ] . length ] ;
for ( int var_7 = 0 ;
var_7 < var_9 . length ;
var_7 ++ ) {
if ( var_4 [ var_7 ] ) {
for ( int var_8 = 0 ;
var_8 < var_9 [ 0 ] . length ;
var_8 ++ ) {
if ( var_6 [ var_8 ] ) {
int var_10 = 0 ;
for ( int var_11 = 0 ;
var_11 < var_0 [ 0 ] . length ;
var_11 ++ ) {
var_10 += var_0 [ var_7 ] [ var_11 ] * var_1 [ var_11 ] [ var_8 ] ;
}
var_9 [ var_7 ] [ var_8 ] = var_10 ;
}
}
}
}
return var_9 ;
}
|
1,146 | <gouthampradhan>math_MinimumIndexSumOfTwoLists_1.java | public String[] findRestaurant(String[] list1, String[] list2) {
Map<String, Integer> index = new HashMap<>();
for (int i = 0; i < list2.length; i++) {
String s = list2[i];
index.put(s, i);
}
int min = Integer.MAX_VALUE;
List<String> list = new ArrayList<>();
for (int i = 0; i < list1.length; i++) {
if (index.containsKey(list1[i])) {
if (i + index.get(list1[i]) <= min) {
min = i + index.get(list1[i]);
}
}
}
for (int i = 0; i < list1.length; i++) {
if (index.containsKey(list1[i])) {
if (i + index.get(list1[i]) == min) {
list.add(list1[i]);
}
}
}
String[] ans = new String[list.size()];
int i = 0;
for (String s : list) {
ans[i++] = s;
}
return ans;
} | public String [ ] var_0 ( String [ ] var_2 , String [ ] var_3 ) {
Map < String , Integer > var_7 = new HashMap < > ( ) ;
for ( int var_9 = 0 ;
var_9 < var_3 . length ;
var_9 ++ ) {
String var_11 = var_3 [ var_9 ] ;
var_7 . put ( var_11 , var_9 ) ;
}
int var_14 = Integer . MAX_VALUE ;
List < String > var_17 = new ArrayList < > ( ) ;
for ( int var_9 = 0 ;
var_9 < var_2 . length ;
var_9 ++ ) {
if ( var_7 . containsKey ( var_2 [ var_9 ] ) ) {
if ( var_9 + var_7 . get ( var_2 [ var_9 ] ) <= var_14 ) {
var_14 = var_9 + var_7 . get ( var_2 [ var_9 ] ) ;
}
}
}
for ( int var_9 = 0 ;
var_9 < var_2 . length ;
var_9 ++ ) {
if ( var_7 . containsKey ( var_2 [ var_9 ] ) ) {
if ( var_9 + var_7 . get ( var_2 [ var_9 ] ) == var_14 ) {
var_17 . add ( var_2 [ var_9 ] ) ;
}
}
}
String [ ] var_22 = new String [ var_17 . size ( ) ] ;
int var_9 = 0 ;
for ( String var_11 : var_17 ) {
var_22 [ var_9 ++ ] = var_11 ;
}
return var_22 ;
}
|
1,147 | <gouthampradhan>string_ValidPalindrome_1.java | public boolean isPalindrome(String s) {
if (s == null || s.isEmpty()) return true;
s = s.toLowerCase();
for (int i = 0, j = s.length() - 1; i < j; ) {
char f = s.charAt(i);
char l = s.charAt(j);
if (!(f >= 'a' && f <= 'z') && !(f >= '0' && f <= '9')) {
i++;
continue;
}
if (!(l >= 'a' && l <= 'z') && !(l >= '0' && l <= '9')) {
j--;
continue;
}
if (f != l) return false;
i++;
j--;
}
return true;
} | public boolean var_0 ( String var_2 ) {
if ( var_2 == null || var_2 . isEmpty ( ) ) return true ;
var_2 = var_2 . toLowerCase ( ) ;
for ( int var_7 = 0 , var_10 = var_2 . length ( ) - 1 ;
var_7 < var_10 ;
) {
char var_12 = var_2 . charAt ( var_7 ) ;
char var_13 = var_2 . charAt ( var_10 ) ;
if ( ! ( var_12 >= 'a' && var_12 <= 'z' ) && ! ( var_12 >= '0' && var_12 <= '9' ) ) {
var_7 ++ ;
continue ;
}
if ( ! ( var_13 >= 'a' && var_13 <= 'z' ) && ! ( var_13 >= '0' && var_13 <= '9' ) ) {
var_10 -- ;
continue ;
}
if ( var_12 != var_13 ) return false ;
var_7 ++ ;
var_10 -- ;
}
return true ;
}
|
1,148 | <gouthampradhan>dynamic_programming_StoneGameIV_1.java | private int dp(int n, int p, int[] perfectSquares, int[] DP) {
if (n == 0) return 1;
else if (DP[n] != 0) return DP[n];
else {
int result = 1;
for (int sq : perfectSquares) {
if (n < sq) break;
int r = dp(n - sq, ((p + 1) % 2), perfectSquares, DP);
if (r == 1) {
result = 2;
break;
}
}
DP[n] = result;
return result;
}
} | private int sample_funcname ( int n , int p , int [ ] perfectSquares , int [ ] DP ) {
if ( n == 0 ) return 1 ;
else if ( DP [ n ] != 0 ) return DP [ n ] ;
else {
int result = 1 ;
for ( int sq : perfectSquares ) {
if ( n < sq ) break ;
int r = dp ( n - sq , ( ( p + 1 ) % 2 ) , perfectSquares , DP ) ;
if ( r == 1 ) {
result = 2 ;
break ;
}
}
DP [ n ] = result ;
return result ;
}
}
|
1,149 | <gouthampradhan>string_LongestWordInDictonary_1.java | public String findLongestWord(String s, List<String> d) {
Collections.sort(
d, Comparator.comparing(String::length).reversed().thenComparing(String::compareTo));
for (String str : d) {
if (str.length() <= s.length()) {
int i = 0, j = 0;
for (int l1 = s.length(), l2 = str.length(); i < l1 && j < l2; ) {
if (s.charAt(i) == str.charAt(j)) {
i++;
j++;
} else {
i++;
}
}
if (j >= str.length()) return str;
}
}
return "";
} | public String var_0 ( String var_2 , List < String > var_4 ) {
Collections . sort ( var_4 , Comparator . comparing ( String :: length ) . reversed ( ) . thenComparing ( String :: compareTo ) ) ;
for ( String var_13 : var_4 ) {
if ( var_13 . length ( ) <= var_2 . length ( ) ) {
int var_15 = 0 , var_16 = 0 ;
for ( int var_17 = var_2 . length ( ) , var_18 = var_13 . length ( ) ;
var_15 < var_17 && var_16 < var_18 ;
) {
if ( var_2 . charAt ( var_15 ) == var_13 . charAt ( var_16 ) ) {
var_15 ++ ;
var_16 ++ ;
}
else {
var_15 ++ ;
}
}
if ( var_16 >= var_13 . length ( ) ) return var_13 ;
}
}
return "" ;
}
|
1,150 | <gouthampradhan>backtracking_SubsetsII_1.java | public List<List<Integer>> subsetsWithDup(int[] nums) {
List<List<Integer>> result = new ArrayList<>();
result.add(new ArrayList<>());
int start = 0, newStart = 0;
Arrays.sort(nums);
for (int i = 0, l = nums.length; i < l; i++) {
newStart = result.size();
if (i == 0 || nums[i] != nums[i - 1]) {
start = 0;
}
for (int j = start, resLen = result.size(); j < resLen; j++) {
List<Integer> newList = new ArrayList<>(result.get(j));
newList.add(nums[i]);
result.add(newList);
}
start = newStart;
}
return result;
} | public List < List < Integer >> var_2 ( int [ ] var_3 ) {
List < List < Integer >> var_5 = new ArrayList < > ( ) ;
var_5 . add ( new ArrayList < > ( ) ) ;
int var_8 = 0 , var_9 = 0 ;
Arrays . sort ( var_3 ) ;
for ( int var_12 = 0 , var_14 = var_3 . length ;
var_12 < var_14 ;
var_12 ++ ) {
var_9 = var_5 . size ( ) ;
if ( var_12 == 0 || var_3 [ var_12 ] != var_3 [ var_12 - 1 ] ) {
var_8 = 0 ;
}
for ( int var_17 = var_8 , var_18 = var_5 . size ( ) ;
var_17 < var_18 ;
var_17 ++ ) {
List < Integer > var_20 = new ArrayList < > ( var_5 . get ( var_17 ) ) ;
var_20 . add ( var_3 [ var_12 ] ) ;
var_5 . add ( var_20 ) ;
}
var_8 = var_9 ;
}
return var_5 ;
}
|
1,151 | <gouthampradhan>array_TwoSumII_1.java | public int[] twoSum(int[] numbers, int target) {
int i = 0, j = numbers.length - 1;
while (i < j) {
int x = (numbers[i] + numbers[j]);
if (x == target) {
int[] result = new int[2];
result[0] = i + 1;
result[1] = j + 1;
return result;
} else if (x < target) i++;
else j--;
}
return new int[2];
} | public int [ ] sample_funcname ( int [ ] var_0 , int var_1 ) {
int var_3 = 0 , var_6 = var_0 . length - 1 ;
while ( var_3 < var_6 ) {
int var_7 = ( var_0 [ var_3 ] + var_0 [ var_6 ] ) ;
if ( var_7 == var_1 ) {
int [ ] var_9 = new int [ 2 ] ;
var_9 [ 0 ] = var_3 + 1 ;
var_9 [ 1 ] = var_6 + 1 ;
return var_9 ;
}
else if ( var_7 < var_1 ) var_3 ++ ;
else var_6 -- ;
}
return new int [ 2 ] ;
}
|
1,152 | <gouthampradhan>dynamic_programming_MaximumProductSubarray_1.java | public int maxProduct(int[] nums) {
if (nums.length == 1) return nums[0];
int min = nums[0];
int max = nums[0];
int result = max;
for (int i = 1; i < nums.length; i++) {
int prevMin = min, prevMax = max;
min = Math.min(nums[i], Math.min(nums[i] * prevMin, nums[i] * prevMax));
max = Math.max(nums[i], Math.max(nums[i] * prevMin, nums[i] * prevMax));
result = Math.max(result, max);
}
return result;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 1 ) return var_0 [ 0 ] ;
int min = var_0 [ 0 ] ;
int max = var_0 [ 0 ] ;
int var_6 = max ;
for ( int var_7 = 1 ;
var_7 < var_0 . length ;
var_7 ++ ) {
int var_8 = min , var_9 = max ;
min = Math . min ( var_0 [ var_7 ] , Math . min ( var_0 [ var_7 ] * var_8 , var_0 [ var_7 ] * var_9 ) ) ;
max = Math . max ( var_0 [ var_7 ] , Math . max ( var_0 [ var_7 ] * var_8 , var_0 [ var_7 ] * var_9 ) ) ;
var_6 = Math . max ( var_6 , max ) ;
}
return var_6 ;
}
|
1,153 | <gouthampradhan>dynamic_programming_BestTimeToBuyAndSellStocks_1.java | public int maxProfit(int[] prices) {
if (prices.length == 0) return 0;
int[] max = new int[prices.length];
max[prices.length - 1] = prices[prices.length - 1];
for (int i = prices.length - 2; i >= 0; i--) {
max[i] = Math.max(prices[i], max[i + 1]);
}
int result = Integer.MIN_VALUE;
for (int i = 0, l = max.length; i < l; i++) {
result = Math.max(result, max[i] - prices[i]);
}
return result;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 0 ) return 0 ;
int [ ] max = new int [ var_0 . length ] ;
max [ var_0 . length - 1 ] = var_0 [ var_0 . length - 1 ] ;
for ( int var_6 = var_0 . length - 2 ;
var_6 >= 0 ;
var_6 -- ) {
max [ var_6 ] = Math . max ( var_0 [ var_6 ] , max [ var_6 + 1 ] ) ;
}
int var_10 = Integer . MIN_VALUE ;
for ( int var_6 = 0 , var_11 = max . length ;
var_6 < var_11 ;
var_6 ++ ) {
var_10 = Math . max ( var_10 , max [ var_6 ] - var_0 [ var_6 ] ) ;
}
return var_10 ;
}
|
1,154 | <gouthampradhan>array_FindPivotIndex_1.java | public int pivotIndex(int[] nums) {
if (nums.length == 1) return 0;
int[] left = new int[nums.length];
int[] right = new int[nums.length];
left[0] = nums[0];
for (int i = 1; i < nums.length; i++) {
left[i] = left[i - 1] + nums[i];
}
right[nums.length - 1] = nums[nums.length - 1];
for (int i = nums.length - 2; i >= 0; i--) {
right[i] = right[i + 1] + nums[i];
}
for (int i = 0; i < nums.length; i++) {
int l, r;
if (i == 0) {
l = 0;
} else {
l = left[i - 1];
}
if (i == nums.length - 1) {
r = 0;
} else {
r = right[i + 1];
}
if (l == r) return i;
}
return -1;
} | public int sample_funcname ( int [ ] var_0 ) {
if ( var_0 . length == 1 ) return 0 ;
int [ ] var_4 = new int [ var_0 . length ] ;
int [ ] var_5 = new int [ var_0 . length ] ;
var_4 [ 0 ] = var_0 [ 0 ] ;
for ( int var_6 = 1 ;
var_6 < var_0 . length ;
var_6 ++ ) {
var_4 [ var_6 ] = var_4 [ var_6 - 1 ] + var_0 [ var_6 ] ;
}
var_5 [ var_0 . length - 1 ] = var_0 [ var_0 . length - 1 ] ;
for ( int var_6 = var_0 . length - 2 ;
var_6 >= 0 ;
var_6 -- ) {
var_5 [ var_6 ] = var_5 [ var_6 + 1 ] + var_0 [ var_6 ] ;
}
for ( int var_6 = 0 ;
var_6 < var_0 . length ;
var_6 ++ ) {
int var_8 , var_9 ;
if ( var_6 == 0 ) {
var_8 = 0 ;
}
else {
var_8 = var_4 [ var_6 - 1 ] ;
}
if ( var_6 == var_0 . length - 1 ) {
var_9 = 0 ;
}
else {
var_9 = var_5 [ var_6 + 1 ] ;
}
if ( var_8 == var_9 ) return var_6 ;
}
return - 1 ;
}
|
1,155 | <gouthampradhan>string_ValidWordSquare_1.java | public boolean validWordSquare(List<String> words) {
List<String> newList = new ArrayList<>();
int max = 0;
for (int i = 0; i < words.size(); i++) {
max = Math.max(max, words.get(i).length());
}
for (int i = 0; i < max; i++) {
StringBuilder sb = new StringBuilder();
for (String w : words) {
if (i < w.length()) {
sb.append(w.charAt(i));
} else break;
}
newList.add(sb.toString());
}
if (words.size() != newList.size()) return false;
for (int i = 0, l = words.size(); i < l; i++) {
if (!words.get(i).equals(newList.get(i))) return false;
}
return true;
} | public boolean var_0 ( List < String > var_3 ) {
List < String > var_5 = new ArrayList < > ( ) ;
int max = 0 ;
for ( int var_8 = 0 ;
var_8 < var_3 . size ( ) ;
var_8 ++ ) {
max = Math . max ( max , var_3 . get ( var_8 ) . length ( ) ) ;
}
for ( int var_8 = 0 ;
var_8 < max ;
var_8 ++ ) {
StringBuilder var_14 = new StringBuilder ( ) ;
for ( String var_15 : var_3 ) {
if ( var_8 < var_15 . length ( ) ) {
var_14 . append ( var_15 . charAt ( var_8 ) ) ;
}
else break ;
}
var_5 . add ( var_14 . toString ( ) ) ;
}
if ( var_3 . size ( ) != var_5 . size ( ) ) return false ;
for ( int var_8 = 0 , var_20 = var_3 . size ( ) ;
var_8 < var_20 ;
var_8 ++ ) {
if ( ! var_3 . get ( var_8 ) . equals ( var_5 . get ( var_8 ) ) ) return false ;
}
return true ;
}
|
1,156 | <gouthampradhan>dynamic_programming_WordBreak_1.java | private boolean dp(int i, String s, Map<Integer, Boolean> dic, Set<String> dictionary) {
if (i == s.length()) return true;
else if (dic.containsKey(i)) return dic.get(i);
else {
for (int j = i, l = s.length(); j < l; j++) {
String subStr = s.substring(i, j + 1);
if (dictionary.contains(subStr)) {
if (dp(j + 1, s, dic, dictionary)) {
dic.put(i, true);
break;
}
}
}
}
if (!dic.containsKey(i)) dic.put(i, false);
return dic.get(i);
} | private boolean sample_funcname ( int i , String s , Map < Integer , Boolean > dic , Set < String > dictionary ) {
if ( i == s . length ( ) ) return true ;
else if ( dic . containsKey ( i ) ) return dic . get ( i ) ;
else {
for ( int j = i , l = s . length ( ) ;
j < l ;
j ++ ) {
String subStr = s . substring ( i , j + 1 ) ;
if ( dictionary . contains ( subStr ) ) {
if ( dp ( j + 1 , s , dic , dictionary ) ) {
dic . put ( i , true ) ;
break ;
}
}
}
}
if ( ! dic . containsKey ( i ) ) dic . put ( i , false ) ;
return dic . get ( i ) ;
}
|
1,157 | <gouthampradhan>hashing_LargestUniqueNumber_1.java | public int largestUniqueNumber(int[] A) {
Map<Integer, Integer> map = new HashMap<>();
for (int i : A) {
map.putIfAbsent(i, 0);
int v = map.get(i) + 1;
map.put(i, v);
}
int max = -1;
for (int k : map.keySet()) {
if (map.get(k) == 1) {
max = Math.max(max, k);
}
}
return max;
} | public int sample_funcname ( int [ ] var_0 ) {
Map < Integer , Integer > var_4 = new HashMap < > ( ) ;
for ( int var_5 : var_0 ) {
var_4 . putIfAbsent ( var_5 , 0 ) ;
int var_10 = var_4 . get ( var_5 ) + 1 ;
var_4 . put ( var_5 , var_10 ) ;
}
int max = - 1 ;
for ( int var_14 : var_4 . keySet ( ) ) {
if ( var_4 . get ( var_14 ) == 1 ) {
max = Math . max ( max , var_14 ) ;
}
}
return max ;
}
|
1,158 | <gouthampradhan>dynamic_programming_CountVowelsPermutation_1.java | public int countVowelPermutation(int n) {
if (n == 1) return 5;
Map<Character, List<Character>> graph = new HashMap<>();
List<Character> vowels = Arrays.asList('a', 'e', 'i', 'o', 'u');
Map<Character, Integer> count = new HashMap<>();
vowels.forEach(v -> graph.put(v, new ArrayList<>()));
graph.get('a').add('e');
graph.get('e').add('a');
graph.get('e').add('i');
graph.get('i').add('a');
graph.get('i').add('e');
graph.get('i').add('o');
graph.get('i').add('u');
graph.get('u').add('a');
graph.get('o').add('i');
graph.get('o').add('u');
count.put('a', 1);
count.put('e', 2);
count.put('i', 4);
count.put('o', 2);
count.put('u', 1);
int[] charCount = new int[5];
for (int i = 2; i < n; i++) {
int j = 0;
Arrays.fill(charCount, 0);
for (char c : vowels) {
List<Character> children = graph.get(c);
for (char child : children) {
charCount[j] = ((charCount[j] + count.get(child)) % 1000000007);
}
j++;
}
j = 0;
for (char c : vowels) {
count.put(c, charCount[j++]);
}
}
int sum = 0;
for (char c : vowels) {
sum = ((sum + (count.get(c))) % 1000000007);
}
return sum;
} | public int sample_funcname ( int var_0 ) {
if ( var_0 == 1 ) return 5 ;
Map < Character , List < Character >> var_7 = new HashMap < > ( ) ;
List < Character > var_15 = Arrays . asList ( 'a' , 'e' , 'i' , 'o' , 'u' ) ;
Map < Character , Integer > var_17 = new HashMap < > ( ) ;
var_15 . forEach ( var_19 -> var_7 . put ( var_19 , new ArrayList < > ( ) ) ) ;
var_7 . get ( 'a' ) . add ( 'e' ) ;
var_7 . get ( 'e' ) . add ( 'a' ) ;
var_7 . get ( 'e' ) . add ( 'i' ) ;
var_7 . get ( 'i' ) . add ( 'a' ) ;
var_7 . get ( 'i' ) . add ( 'e' ) ;
var_7 . get ( 'i' ) . add ( 'o' ) ;
var_7 . get ( 'i' ) . add ( 'u' ) ;
var_7 . get ( 'u' ) . add ( 'a' ) ;
var_7 . get ( 'o' ) . add ( 'i' ) ;
var_7 . get ( 'o' ) . add ( 'u' ) ;
var_17 . put ( 'a' , 1 ) ;
var_17 . put ( 'e' , 2 ) ;
var_17 . put ( 'i' , 4 ) ;
var_17 . put ( 'o' , 2 ) ;
var_17 . put ( 'u' , 1 ) ;
int [ ] var_26 = new int [ 5 ] ;
for ( int var_27 = 2 ;
var_27 < var_0 ;
var_27 ++ ) {
int var_29 = 0 ;
Arrays . fill ( var_26 , 0 ) ;
for ( char var_31 : var_15 ) {
List < Character > var_32 = var_7 . get ( var_31 ) ;
for ( char var_33 : var_32 ) {
var_26 [ var_29 ] = ( ( var_26 [ var_29 ] + var_17 . get ( var_33 ) ) % 1000000007 ) ;
}
var_29 ++ ;
}
var_29 = 0 ;
for ( char var_31 : var_15 ) {
var_17 . put ( var_31 , var_26 [ var_29 ++ ] ) ;
}
}
int var_35 = 0 ;
for ( char var_31 : var_15 ) {
var_35 = ( ( var_35 + ( var_17 . get ( var_31 ) ) ) % 1000000007 ) ;
}
return var_35 ;
}
|
1,159 | <gouthampradhan>greedy_MinimumTimeToBuildBlocks_1.java | public int minBuildTime(int[] blocks, int split) {
PriorityQueue<Integer> queue = new PriorityQueue<>();
for (int b : blocks) queue.offer(b);
while (queue.size() != 1) {
int a = queue.poll();
int b = queue.poll();
queue.offer(Math.max(a, b) + split);
}
return queue.poll();
} | public int sample_funcname ( int [ ] var_0 , int var_1 ) {
PriorityQueue < Integer > var_4 = new PriorityQueue < > ( ) ;
for ( int var_5 : var_0 ) var_4 . offer ( var_5 ) ;
while ( var_4 . size ( ) != 1 ) {
int var_10 = var_4 . poll ( ) ;
int var_5 = var_4 . poll ( ) ;
var_4 . offer ( Math . max ( var_10 , var_5 ) + var_1 ) ;
}
return var_4 . poll ( ) ;
}
|
1,160 | <gouthampradhan>bit_manipulation_BinaryWatch_1.java | public List<String> readBinaryWatch(int num) {
int H = 11, M = 59;
List<String> result = new ArrayList<>();
if (num == 0) {
result.add("0:00");
return result;
}
for (int i = 0; i <= H; i++) {
for (int j = 0; j <= M; j++) {
int count = 0;
for (int k = 0; k < 4; k++) {
if (((1 << k) & i) > 0) {
count++;
}
}
for (int k = 0; k < 6; k++) {
if (((1 << k) & j) > 0) {
count++;
}
}
if (count == num) {
result.add(i + ":" + ((String.valueOf(j).length() == 1) ? ("0" + j) : j));
}
}
}
return result;
} | public List < String > var_1 ( int var_2 ) {
int var_4 = 11 , var_6 = 59 ;
List < String > var_9 = new ArrayList < > ( ) ;
if ( var_2 == 0 ) {
var_9 . add ( "0:00" ) ;
return var_9 ;
}
for ( int var_13 = 0 ;
var_13 <= var_4 ;
var_13 ++ ) {
for ( int var_14 = 0 ;
var_14 <= var_6 ;
var_14 ++ ) {
int var_15 = 0 ;
for ( int var_16 = 0 ;
var_16 < 4 ;
var_16 ++ ) {
if ( ( ( 1 << var_16 ) & var_13 ) > 0 ) {
var_15 ++ ;
}
}
for ( int var_16 = 0 ;
var_16 < 6 ;
var_16 ++ ) {
if ( ( ( 1 << var_16 ) & var_14 ) > 0 ) {
var_15 ++ ;
}
}
if ( var_15 == var_2 ) {
var_9 . add ( var_13 + ":" + ( ( String . valueOf ( var_14 ) . length ( ) == 1 ) ? ( "0" + var_14 ) : var_14 ) ) ;
}
}
}
return var_9 ;
}
|
1,161 | <gouthampradhan>bit_manipulation_TotalHammingDistance_1.java | public int totalHammingDistance(int[] nums) {
int sum = 0;
for (int i = 0; i < 32; i++) {
int numOfOnes = 0;
int p = (1 << i);
for (int num : nums) {
if ((num & p) > 0) {
numOfOnes++;
}
}
sum += ((nums.length - numOfOnes) * numOfOnes);
}
return sum;
} | public int sample_funcname ( int [ ] var_0 ) {
int var_2 = 0 ;
for ( int var_3 = 0 ;
var_3 < 32 ;
var_3 ++ ) {
int var_5 = 0 ;
int var_7 = ( 1 << var_3 ) ;
for ( int var_8 : var_0 ) {
if ( ( var_8 & var_7 ) > 0 ) {
var_5 ++ ;
}
}
var_2 += ( ( var_0 . length - var_5 ) * var_5 ) ;
}
return var_2 ;
}
|
1,162 | <gouthampradhan>greedy_MaximumLengthOfPairChain_1.java | public int findLongestChain(int[][] pairs) {
Arrays.sort(
pairs,
(o1, o2) -> o1[1] == o2[1] ? Integer.compare(o1[0], o2[0]) : Integer.compare(o1[1], o2[1]));
int count = 1;
int[] curr = pairs[0];
for (int i = 1; i < pairs.length; i++) {
if (pairs[i][0] > curr[1]) {
count++;
curr = pairs[i];
}
}
return count;
} | public int sample_funcname ( int [ ] [ ] var_0 ) {
Arrays . sort ( var_0 , ( var_3 , var_4 ) -> var_3 [ 1 ] == var_4 [ 1 ] ? Integer . compare ( var_3 [ 0 ] , var_4 [ 0 ] ) : Integer . compare ( var_3 [ 1 ] , var_4 [ 1 ] ) ) ;
int var_9 = 1 ;
int [ ] var_10 = var_0 [ 0 ] ;
for ( int var_11 = 1 ;
var_11 < var_0 . length ;
var_11 ++ ) {
if ( var_0 [ var_11 ] [ 0 ] > var_10 [ 1 ] ) {
var_9 ++ ;
var_10 = var_0 [ var_11 ] ;
}
}
return var_9 ;
}
|
1,163 | <gouthampradhan>string_StudentAttendanceRecordI_1.java | public boolean checkRecord(String s) {
int count = 0;
for (int c : s.toCharArray()) {
if (c == 'A') {
count++;
}
if (count > 1) return false;
}
if (s.contains("LLL")) return false;
return true;
} | public boolean var_0 ( String var_2 ) {
int var_4 = 0 ;
for ( int var_6 : var_2 . toCharArray ( ) ) {
if ( var_6 == 'A' ) {
var_4 ++ ;
}
if ( var_4 > 1 ) return false ;
}
if ( var_2 . contains ( "LLL" ) ) return false ;
return true ;
}
|
1,164 | <gouthampradhan>dynamic_programming_MakeArrayStrictlyIncreasing_1.java | private int binarySearch(int[] A, int k) {
int l = 0, h = A.length;
int ans = -1;
while (l < h) {
int m = l + (h - l) / 2;
if (A[m] > k) {
ans = m;
h = m;
} else l = m + 1;
}
return ans;
} | private int sample_funcname ( int [ ] var_0 , int var_1 ) {
int var_3 = 0 , var_5 = var_0 . length ;
int var_7 = - 1 ;
while ( var_3 < var_5 ) {
int var_9 = var_3 + ( var_5 - var_3 ) / 2 ;
if ( var_0 [ var_9 ] > var_1 ) {
var_7 = var_9 ;
var_5 = var_9 ;
}
else var_3 = var_9 + 1 ;
}
return var_7 ;
}
|
1,165 | <gouthampradhan>math_RectangleOverlap_1.java | public boolean isRectangleOverlap(int[] rec1, int[] rec2) {
boolean x =
((rec1[0] >= rec2[0] && rec1[0] < rec2[2]) || (rec2[0] >= rec1[0] && rec2[0] < rec1[2]));
boolean y =
((rec1[1] >= rec2[1] && rec1[1] < rec2[3]) || (rec2[1] >= rec1[1] && rec2[1] < rec1[3]));
return x && y;
} | public boolean var_0 ( int [ ] var_1 , int [ ] var_2 ) {
boolean var_6 = ( ( var_1 [ 0 ] >= var_2 [ 0 ] && var_1 [ 0 ] < var_2 [ 2 ] ) || ( var_2 [ 0 ] >= var_1 [ 0 ] && var_2 [ 0 ] < var_1 [ 2 ] ) ) ;
boolean var_9 = ( ( var_1 [ 1 ] >= var_2 [ 1 ] && var_1 [ 1 ] < var_2 [ 3 ] ) || ( var_2 [ 1 ] >= var_1 [ 1 ] && var_2 [ 1 ] < var_1 [ 3 ] ) ) ;
return var_6 && var_9 ;
}
|
1,166 | <gouthampradhan>string_AddBinary_1.java | private String calculate(String a, String b) {
int carry = 0;
int d = a.length() - b.length();
StringBuilder sb = new StringBuilder();
for (int i = a.length() - 1; i >= 0; i--) {
int first = Integer.parseInt(String.valueOf(a.charAt(i)));
int second = i - d >= 0 ? Integer.parseInt(String.valueOf(b.charAt(i - d))) : 0;
int sum = (first + second + carry);
carry = sum / 2;
sb.append(sum % 2);
}
if (carry != 0) sb.append(carry);
return sb.reverse().toString();
} | private String var_0 ( String var_2 , String var_3 ) {
int var_5 = 0 ;
int var_7 = var_2 . length ( ) - var_3 . length ( ) ;
StringBuilder var_9 = new StringBuilder ( ) ;
for ( int var_11 = var_2 . length ( ) - 1 ;
var_11 >= 0 ;
var_11 -- ) {
int var_16 = Integer . parseInt ( String . valueOf ( var_2 . charAt ( var_11 ) ) ) ;
int var_17 = var_11 - var_7 >= 0 ? Integer . parseInt ( String . valueOf ( var_3 . charAt ( var_11 - var_7 ) ) ) : 0 ;
int var_18 = ( var_16 + var_17 + var_5 ) ;
var_5 = var_18 / 2 ;
var_9 . append ( var_18 % 2 ) ;
}
if ( var_5 != 0 ) var_9 . append ( var_5 ) ;
return var_9 . reverse ( ) . toString ( ) ;
}
|
1,167 | <gouthampradhan>dynamic_programming_MaximumVacationDays_1.java | public int maxVacationDays(int[][] flights, int[][] days) {
int N = days.length;
int W = days[0].length;
int[][] DP = new int[N][W + 1];
for (int w = W - 1; w >= 0; w--) {
for (int n = 0; n < N; n++) {
DP[n][w] = days[n][w] + DP[n][w + 1];
}
for (int n = 0; n < N; n++) {
int max = Integer.MIN_VALUE;
int[] F = flights[n];
for (int i = 0; i < F.length; i++) {
if (F[i] == 1) {
max = Math.max(max, days[i][w] + DP[i][w + 1]);
}
}
DP[n][w] = Math.max(DP[n][w], max);
}
}
return DP[0][0];
} | public int sample_funcname ( int [ ] [ ] var_0 , int [ ] [ ] var_1 ) {
int var_3 = var_1 . length ;
int var_5 = var_1 [ 0 ] . length ;
int [ ] [ ] var_7 = new int [ var_3 ] [ var_5 + 1 ] ;
for ( int var_8 = var_5 - 1 ;
var_8 >= 0 ;
var_8 -- ) {
for ( int var_9 = 0 ;
var_9 < var_3 ;
var_9 ++ ) {
var_7 [ var_9 ] [ var_8 ] = var_1 [ var_9 ] [ var_8 ] + var_7 [ var_9 ] [ var_8 + 1 ] ;
}
for ( int var_9 = 0 ;
var_9 < var_3 ;
var_9 ++ ) {
int max = Integer . MIN_VALUE ;
int [ ] var_13 = var_0 [ var_9 ] ;
for ( int var_14 = 0 ;
var_14 < var_13 . length ;
var_14 ++ ) {
if ( var_13 [ var_14 ] == 1 ) {
max = Math . max ( max , var_1 [ var_14 ] [ var_8 ] + var_7 [ var_14 ] [ var_8 + 1 ] ) ;
}
}
var_7 [ var_9 ] [ var_8 ] = Math . max ( var_7 [ var_9 ] [ var_8 ] , max ) ;
}
}
return var_7 [ 0 ] [ 0 ] ;
}
|
1,168 | <gouthampradhan>dynamic_programming_MaximalSquare_1.java | public int maximalSquare(char[][] matrix) {
if (matrix.length == 0) return 0;
int[][] dp = new int[matrix.length][matrix[0].length];
for (int i = 0; i < matrix.length; i++) {
for (int j = 0; j < matrix[0].length; j++) {
if (j - 1 >= 0 && i - 1 >= 0) {
if (matrix[i][j] == '1') {
dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]);
dp[i][j] = Math.min(dp[i][j], dp[i - 1][j - 1]) + 1;
}
} else {
dp[i][j] = matrix[i][j] == '1' ? 1 : 0;
}
}
}
int max = 0;
for (int i = 0; i < dp.length; i++) {
for (int j = 0; j < dp[0].length; j++) {
max = Math.max(max, dp[i][j]);
}
}
return max * max;
} | public int sample_funcname ( char [ ] [ ] var_0 ) {
if ( var_0 . length == 0 ) return 0 ;
int [ ] [ ] var_3 = new int [ var_0 . length ] [ var_0 [ 0 ] . length ] ;
for ( int var_4 = 0 ;
var_4 < var_0 . length ;
var_4 ++ ) {
for ( int var_5 = 0 ;
var_5 < var_0 [ 0 ] . length ;
var_5 ++ ) {
if ( var_5 - 1 >= 0 && var_4 - 1 >= 0 ) {
if ( var_0 [ var_4 ] [ var_5 ] == '1' ) {
var_3 [ var_4 ] [ var_5 ] = Math . min ( var_3 [ var_4 - 1 ] [ var_5 ] , var_3 [ var_4 ] [ var_5 - 1 ] ) ;
var_3 [ var_4 ] [ var_5 ] = Math . min ( var_3 [ var_4 ] [ var_5 ] , var_3 [ var_4 - 1 ] [ var_5 - 1 ] ) + 1 ;
}
}
else {
var_3 [ var_4 ] [ var_5 ] = var_0 [ var_4 ] [ var_5 ] == '1' ? 1 : 0 ;
}
}
}
int max = 0 ;
for ( int var_4 = 0 ;
var_4 < var_3 . length ;
var_4 ++ ) {
for ( int var_5 = 0 ;
var_5 < var_3 [ 0 ] . length ;
var_5 ++ ) {
max = Math . max ( max , var_3 [ var_4 ] [ var_5 ] ) ;
}
}
return max * max ;
}
|
1,169 | <gouthampradhan>string_CompareVersionNumbers_1.java | public int compareVersion(String version1, String version2) {
StringTokenizer st1 = new StringTokenizer(version1, ".");
StringTokenizer st2 = new StringTokenizer(version2, ".");
while (st1.hasMoreTokens() & st2.hasMoreTokens()) {
int token1 = Integer.parseInt(st1.nextToken());
int token2 = Integer.parseInt(st2.nextToken());
if (token1 > token2) return 1;
else if (token2 > token1) return -1;
}
if (st1.countTokens() > st2.countTokens()) {
while (st1.hasMoreTokens()) {
if (Integer.parseInt(st1.nextToken()) > 0) return 1;
}
} else if (st2.countTokens() > st1.countTokens()) {
while (st2.hasMoreTokens()) {
if (Integer.parseInt(st2.nextToken()) > 0) return -1;
}
}
return 0;
} | public int sample_funcname ( String var_1 , String var_2 ) {
StringTokenizer var_5 = new StringTokenizer ( var_1 , "." ) ;
StringTokenizer var_6 = new StringTokenizer ( var_2 , "." ) ;
while ( var_5 . hasMoreTokens ( ) & var_6 . hasMoreTokens ( ) ) {
int var_11 = Integer . parseInt ( var_5 . nextToken ( ) ) ;
int var_12 = Integer . parseInt ( var_6 . nextToken ( ) ) ;
if ( var_11 > var_12 ) return 1 ;
else if ( var_12 > var_11 ) return - 1 ;
}
if ( var_5 . countTokens ( ) > var_6 . countTokens ( ) ) {
while ( var_5 . hasMoreTokens ( ) ) {
if ( Integer . parseInt ( var_5 . nextToken ( ) ) > 0 ) return 1 ;
}
}
else if ( var_6 . countTokens ( ) > var_5 . countTokens ( ) ) {
while ( var_6 . hasMoreTokens ( ) ) {
if ( Integer . parseInt ( var_6 . nextToken ( ) ) > 0 ) return - 1 ;
}
}
return 0 ;
}
|
1,170 | <gouthampradhan>stack_MaximalRectangle_1.java | private int getMaxRectangle(int[] heights) {
int maxArea = Integer.MIN_VALUE;
Stack<Integer> stack = new Stack<>();
int i = 0;
for (; i < heights.length; i++) {
while (!stack.isEmpty() && heights[stack.peek()] >= heights[i]) {
int top = stack.pop();
int base = stack.isEmpty() ? i : i - stack.peek() - 1;
maxArea = Math.max(maxArea, base * heights[top]);
}
stack.push(i);
}
while (!stack.isEmpty()) {
int top = stack.pop();
int base = stack.isEmpty() ? i : i - stack.peek() - 1;
maxArea = Math.max(maxArea, base * heights[top]);
}
return maxArea;
} | private int sample_funcname ( int [ ] var_0 ) {
int var_3 = Integer . MIN_VALUE ;
Stack < Integer > var_5 = new Stack < > ( ) ;
int var_7 = 0 ;
for ( ;
var_7 < var_0 . length ;
var_7 ++ ) {
while ( ! var_5 . isEmpty ( ) && var_0 [ var_5 . peek ( ) ] >= var_0 [ var_7 ] ) {
int var_12 = var_5 . pop ( ) ;
int var_14 = var_5 . isEmpty ( ) ? var_7 : var_7 - var_5 . peek ( ) - 1 ;
var_3 = Math . max ( var_3 , var_14 * var_0 [ var_12 ] ) ;
}
var_5 . push ( var_7 ) ;
}
while ( ! var_5 . isEmpty ( ) ) {
int var_12 = var_5 . pop ( ) ;
int var_14 = var_5 . isEmpty ( ) ? var_7 : var_7 - var_5 . peek ( ) - 1 ;
var_3 = Math . max ( var_3 , var_14 * var_0 [ var_12 ] ) ;
}
return var_3 ;
}
|
Subsets and Splits