Datasets:

ziwenyd

/

leetcode-standalone-words

like 0

<awangdev>Wildcard Matching_1.java

public boolean isMatch(String s, String p) { if (s == null || p == null) return false; int m = s.length(), n = p.length(); boolean[][] dp = new boolean[m + 1][n + 1]; char[] ss = s.toCharArray(); char[] pp = p.toCharArray(); for (int i = 0; i <= m; i++) { for (int j = 0; j <= n; j++) { if (i == 0 && j == 0) { dp[i][j] = true; continue; } if (j == 0) { dp[i][j] = false; continue; } dp[i][j] = false; if (pp[j - 1] != '*') { if (i >= 1 && (ss[i - 1] == pp[j - 1] || pp[j - 1] == '?')) { dp[i][j] |= dp[i - 1][j - 1]; } } else { dp[i][j] |= dp[i][j - 1]; if (i >= 1) { dp[i][j] |= dp[i - 1][j]; } } } } return dp[m][n]; }

public boolean var_0 ( String var_1 , String var_2 ) { if ( var_1 == null || var_2 == null ) return false ; int var_3 = var_1 . length ( ) , var_4 = var_2 . length ( ) ; boolean [ ] [ ] var_5 = new boolean [ var_3 + 1 ] [ var_4 + 1 ] ; char [ ] var_6 = var_1 . toCharArray ( ) ; char [ ] var_7 = var_2 . toCharArray ( ) ; for ( int var_8 = 0 ; var_8 <= var_3 ; var_8 ++ ) { for ( int var_9 = 0 ; var_9 <= var_4 ; var_9 ++ ) { if ( var_8 == 0 && var_9 == 0 ) { var_5 [ var_8 ] [ var_9 ] = true ; continue ; } if ( var_9 == 0 ) { var_5 [ var_8 ] [ var_9 ] = false ; continue ; } var_5 [ var_8 ] [ var_9 ] = false ; if ( var_7 [ var_9 - 1 ] != '*' ) { if ( var_8 >= 1 && ( var_6 [ var_8 - 1 ] == var_7 [ var_9 - 1 ] || var_7 [ var_9 - 1 ] == '?' ) ) { var_5 [ var_8 ] [ var_9 ] |= var_5 [ var_8 - 1 ] [ var_9 - 1 ] ; } } else { var_5 [ var_8 ] [ var_9 ] |= var_5 [ var_8 ] [ var_9 - 1 ] ; if ( var_8 >= 1 ) { var_5 [ var_8 ] [ var_9 ] |= var_5 [ var_8 - 1 ] [ var_9 ] ; } } } } return var_5 [ var_3 ] [ var_4 ] ; }

1<SEP>0<SEP><S_QUOTE>?<S_QUOTE><SEP><S_QUOTE>*<S_QUOTE>

<awangdev>Word Ladder_1.java

private List<String> transform(Set<String> words, String word) { List<String> candidates = new ArrayList<>(); StringBuffer sb = new StringBuffer(word); for (int i = 0; i < sb.length(); i++) { char temp = sb.charAt(i); for (char c = 'a'; c <= 'z'; c++) { if (temp == c) { continue; } sb.setCharAt(i, c); String newWord = sb.toString(); if (words.remove(newWord)) { candidates.add(newWord); } } sb.setCharAt(i, temp); } return candidates; }

private List < String > var_0 ( Set < String > var_1 , String var_2 ) { List < String > var_3 = new ArrayList < > ( ) ; StringBuffer var_4 = new StringBuffer ( var_2 ) ; for ( int var_5 = 0 ; var_5 < var_4 . length ( ) ; var_5 ++ ) { char var_6 = var_4 . charAt ( var_5 ) ; for ( char var_7 = 'a' ; var_7 <= 'z' ; var_7 ++ ) { if ( var_6 == var_7 ) { continue ; } var_4 . setCharAt ( var_5 , var_7 ) ; String var_8 = var_4 . toString ( ) ; if ( var_1 . remove ( var_8 ) ) { var_3 . add ( var_8 ) ; } } var_4 . setCharAt ( var_5 , var_6 ) ; } return var_3 ; }

<S_QUOTE>z<S_QUOTE><SEP>0<SEP><S_QUOTE>a<S_QUOTE>

<awangdev>Ugly Number II_3.java

public int nthUglyNumber(int n) { if (n <= 0) { return 0; } else if (n == 1) { return 1; } long[] dp = new long[n + 1]; dp[0] = 0; dp[1] = 1; PriorityQueue<Long> candidate = new PriorityQueue<Long>(); HashSet<Long> set = new HashSet<Long>(); set.add(dp[1]); for (int i = 2; i <= n; i++) { if (!set.contains(dp[i - 1] * 2)) { candidate.add(dp[i - 1] * 2); set.add(dp[i - 1] * 2); } if (!set.contains(dp[i - 1] * 3)) { candidate.add(dp[i - 1] * 3); set.add(dp[i - 1] * 3); } if (!set.contains(dp[i - 1] * 5)) { candidate.add(dp[i - 1] * 5); set.add(dp[i - 1] * 5); } dp[i] = candidate.poll(); } return (int)dp[n]; }

public int sample_funcname ( int var_0 ) { if ( var_0 <= 0 ) { return 0 ; } else if ( var_0 == 1 ) { return 1 ; } long [ ] var_1 = new long [ var_0 + 1 ] ; var_1 [ 0 ] = 0 ; var_1 [ 1 ] = 1 ; PriorityQueue < Long > var_2 = new PriorityQueue < Long > ( ) ; HashSet < Long > var_3 = new HashSet < Long > ( ) ; var_3 . add ( var_1 [ 1 ] ) ; for ( int var_4 = 2 ; var_4 <= var_0 ; var_4 ++ ) { if ( ! var_3 . contains ( var_1 [ var_4 - 1 ] * 2 ) ) { var_2 . add ( var_1 [ var_4 - 1 ] * 2 ) ; var_3 . add ( var_1 [ var_4 - 1 ] * 2 ) ; } if ( ! var_3 . contains ( var_1 [ var_4 - 1 ] * 3 ) ) { var_2 . add ( var_1 [ var_4 - 1 ] * 3 ) ; var_3 . add ( var_1 [ var_4 - 1 ] * 3 ) ; } if ( ! var_3 . contains ( var_1 [ var_4 - 1 ] * 5 ) ) { var_2 . add ( var_1 [ var_4 - 1 ] * 5 ) ; var_3 . add ( var_1 [ var_4 - 1 ] * 5 ) ; } var_1 [ var_4 ] = var_2 . poll ( ) ; } return ( int ) var_1 [ var_0 ] ; }

2<SEP>0<SEP>3<SEP>5<SEP>1

<awangdev>Palindrome Partitioning II_2.java

private boolean[][] calcPalindrome(char[] s) { int n = s.length; boolean[][] palindrome = new boolean[n][n]; for (int mid = 0; mid < n; mid++) { int i = mid, j = mid; while (i >= 0 && j < n && s[i] == s[j]) { palindrome[i][j] = true; i--; j++; } i = mid; j = mid + 1; while (i >= 0 && j < n && s[i] == s[j]) { palindrome[i][j] = true; i--; j++; } } return palindrome; }

private boolean [ ] [ ] var_0 ( char [ ] var_1 ) { int var_2 = var_1 . length ; boolean [ ] [ ] var_3 = new boolean [ var_2 ] [ var_2 ] ; for ( int var_4 = 0 ; var_4 < var_2 ; var_4 ++ ) { int var_5 = var_4 , var_6 = var_4 ; while ( var_5 >= 0 && var_6 < var_2 && var_1 [ var_5 ] == var_1 [ var_6 ] ) { var_3 [ var_5 ] [ var_6 ] = true ; var_5 -- ; var_6 ++ ; } var_5 = var_4 ; var_6 = var_4 + 1 ; while ( var_5 >= 0 && var_6 < var_2 && var_1 [ var_5 ] == var_1 [ var_6 ] ) { var_3 [ var_5 ] [ var_6 ] = true ; var_5 -- ; var_6 ++ ; } } return var_3 ; }

0<SEP>1

<awangdev>727. Minimum Window Subsequence_4.java

private int backtrack(char[] ss, char[] tt, int sIndex) { for (int i = tt.length - 1; i >= 0; i--) { while(ss[sIndex--] != tt[i]); } return ++sIndex; }

private int sample_funcname ( char [ ] var_0 , char [ ] var_1 , int var_2 ) { for ( int var_3 = var_1 . length - 1 ; var_3 >= 0 ; var_3 -- ) { while ( var_0 [ var_2 -- ] != var_1 [ var_3 ] ) ; } return ++ var_2 ; }

1<SEP>0

<awangdev>Backpack II_8.java

public int backPackII(int m, int[] A, int V[]) { if (A == null || V == null || A.length == 0 || V.length == 0 || A.length != V.length || m <= 0) { return 0; } int[]dp = new int[m + 1]; dp[0] = 0; for (int i = 1; i <= A.length; i++) { for (int j = m; j >= 0; j--) { if (j - A[i - 1] >= 0 && dp[j - A[i - 1]] + V[i - 1] > dp[j]) { dp[j] = dp[j - A[i - 1]] + V[i - 1]; } } } return dp[m]; }

public int sample_funcname ( int var_0 , int [ ] var_1 , int var_2 [ ] ) { if ( var_1 == null || var_2 == null || var_1 . length == 0 || var_2 . length == 0 || var_1 . length != var_2 . length || var_0 <= 0 ) { return 0 ; } int [ ] var_3 = new int [ var_0 + 1 ] ; var_3 [ 0 ] = 0 ; for ( int var_4 = 1 ; var_4 <= var_1 . length ; var_4 ++ ) { for ( int var_5 = var_0 ; var_5 >= 0 ; var_5 -- ) { if ( var_5 - var_1 [ var_4 - 1 ] >= 0 && var_3 [ var_5 - var_1 [ var_4 - 1 ] ] + var_2 [ var_4 - 1 ] > var_3 [ var_5 ] ) { var_3 [ var_5 ] = var_3 [ var_5 - var_1 [ var_4 - 1 ] ] + var_2 [ var_4 - 1 ] ; } } } return var_3 [ var_0 ] ; }

0<SEP>1

<awangdev>229. Majority Element II_2.java

private void addResult(List<Integer> result, int n, int value, int count) { if (!result.contains(value) && count > n / 3) { result.add(value); } }

private void var_0 ( List < Integer > var_1 , int var_2 , int var_3 , int var_4 ) { if ( ! var_1 . contains ( var_3 ) && var_4 > var_2 / 3 ) { var_1 . add ( var_3 ) ; } }

3

<awangdev>169. Majority Element_2.java

public int majorityElement(int[] nums) { if (nums == null || nums.length == 0) { return -1; } Arrays.sort(nums); return nums[nums.length / 2]; }

public int sample_funcname ( int [ ] var_0 ) { if ( var_0 == null || var_0 . length == 0 ) { return - 1 ; } Arrays . sort ( var_0 ) ; return var_0 [ var_0 . length / 2 ] ; }

2<SEP>0<SEP>1

<awangdev>Longest Common Subsequence_3.java

public int longestCommonSubsequence(String A, String B) { if (A == null || B == null || A.length() == 0 || B.length() == 0) { return 0; } int m = A.length(); int n = B.length(); int[][] dp = new int[m + 1][n + 1]; int[][] pi = new int[m + 1][n + 1]; for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) { if(i == 0 || j == 0) { dp[i][j] = 0; continue; } dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]); pi[i][j] = dp[i - 1][j] > dp[i][j - 1] ? 1 : 2; if (A.charAt(i - 1) == B.charAt(j - 1)) { dp[i][j] = Math.max(dp[i][j], dp[i - 1][j - 1] + 1); if (dp[i][j] == dp[i - 1][j - 1] + 1) { pi[i][j] = 3; } } } } char[] res = new char[dp[m][n]]; int i = m; int j = n; int w = dp[m][n] - 1; while (i > 0 && j > 0) { if (pi[i][j] == 1) { i--; } else if (pi[i][j] == 2) { j--; } else { res[w] = A.charAt(i - 1); i--; j--; w--; } } for (int k = 0; k < dp[m][n]; k++) { System.out.print(res[k]); } System.out.println(); return dp[m][n]; }

public int sample_funcname ( String var_0 , String var_1 ) { if ( var_0 == null || var_1 == null || var_0 . length ( ) == 0 || var_1 . length ( ) == 0 ) { return 0 ; } int var_2 = var_0 . length ( ) ; int var_3 = var_1 . length ( ) ; int [ ] [ ] var_4 = new int [ var_2 + 1 ] [ var_3 + 1 ] ; int [ ] [ ] var_5 = new int [ var_2 + 1 ] [ var_3 + 1 ] ; for ( int var_6 = 1 ; var_6 <= var_2 ; var_6 ++ ) { for ( int var_7 = 1 ; var_7 <= var_3 ; var_7 ++ ) { if ( var_6 == 0 || var_7 == 0 ) { var_4 [ var_6 ] [ var_7 ] = 0 ; continue ; } var_4 [ var_6 ] [ var_7 ] = Math . max ( var_4 [ var_6 - 1 ] [ var_7 ] , var_4 [ var_6 ] [ var_7 - 1 ] ) ; var_5 [ var_6 ] [ var_7 ] = var_4 [ var_6 - 1 ] [ var_7 ] > var_4 [ var_6 ] [ var_7 - 1 ] ? 1 : 2 ; if ( var_0 . charAt ( var_6 - 1 ) == var_1 . charAt ( var_7 - 1 ) ) { var_4 [ var_6 ] [ var_7 ] = Math . max ( var_4 [ var_6 ] [ var_7 ] , var_4 [ var_6 - 1 ] [ var_7 - 1 ] + 1 ) ; if ( var_4 [ var_6 ] [ var_7 ] == var_4 [ var_6 - 1 ] [ var_7 - 1 ] + 1 ) { var_5 [ var_6 ] [ var_7 ] = 3 ; } } } } char [ ] var_8 = new char [ var_4 [ var_2 ] [ var_3 ] ] ; int var_6 = var_2 ; int var_7 = var_3 ; int var_9 = var_4 [ var_2 ] [ var_3 ] - 1 ; while ( var_6 > 0 && var_7 > 0 ) { if ( var_5 [ var_6 ] [ var_7 ] == 1 ) { var_6 -- ; } else if ( var_5 [ var_6 ] [ var_7 ] == 2 ) { var_7 -- ; } else { var_8 [ var_9 ] = var_0 . charAt ( var_6 - 1 ) ; var_6 -- ; var_7 -- ; var_9 -- ; } } for ( int var_10 = 0 ; var_10 < var_4 [ var_2 ] [ var_3 ] ; var_10 ++ ) { System . out . print ( var_8 [ var_10 ] ) ; } System . out . println ( ) ; return var_4 [ var_2 ] [ var_3 ] ; }

2<SEP>0<SEP>3<SEP>1

<awangdev>Power of Three_2.java

public boolean isPowerOfThree(int n) { if (n <= 0) { return false; } if (n == 1) { return true; } if (n % 3 != 0) { return false; } return isPowerOfThree(n / 3); }

public boolean sample_funcname ( int n ) { if ( n <= 0 ) { return false ; } if ( n == 1 ) { return true ; } if ( n % 3 != 0 ) { return false ; } return isPowerOfThree ( n / 3 ) ; }

0<SEP>3<SEP>1

<awangdev>Group Shifted Strings_2.java

public List<List<String>> groupStrings(String[] strings) { List<List<String>> rst = new ArrayList<List<String>>(); if (strings == null || strings.length == 0) { return rst; } Arrays.sort(strings); HashMap<String, ArrayList<String>> map = new HashMap<String, ArrayList<String>>(); for (String s : strings) { char[] arr = s.toCharArray(); char head = arr[0]; for (int i = 0; i < arr.length; i++) { if (arr[i] - head < 0) { arr[i] = (char)((arr[i] - head) + 26); } else { arr[i] = (char)(arr[i] - head); } } String key = new String(arr); if (!map.containsKey(key)) { map.put(key, new ArrayList<String>()); } map.get(key).add(s); } for (Map.Entry<String, ArrayList<String>> entry : map.entrySet()) { rst.add(entry.getValue()); } return rst; }

public List < List < String >> var_0 ( String [ ] var_1 ) { List < List < String >> var_2 = new ArrayList < List < String >> ( ) ; if ( var_1 == null || var_1 . length == 0 ) { return var_2 ; } Arrays . sort ( var_1 ) ; HashMap < String , ArrayList < String >> var_3 = new HashMap < String , ArrayList < String >> ( ) ; for ( String var_4 : var_1 ) { char [ ] var_5 = var_4 . toCharArray ( ) ; char var_6 = var_5 [ 0 ] ; for ( int var_7 = 0 ; var_7 < var_5 . length ; var_7 ++ ) { if ( var_5 [ var_7 ] - var_6 < 0 ) { var_5 [ var_7 ] = ( char ) ( ( var_5 [ var_7 ] - var_6 ) + 26 ) ; } else { var_5 [ var_7 ] = ( char ) ( var_5 [ var_7 ] - var_6 ) ; } } String var_8 = new String ( var_5 ) ; if ( ! var_3 . containsKey ( var_8 ) ) { var_3 . put ( var_8 , new ArrayList < String > ( ) ) ; } var_3 . get ( var_8 ) . add ( var_4 ) ; } for ( Map . Entry < String , ArrayList < String >> var_9 : var_3 . entrySet ( ) ) { var_2 . add ( var_9 . getValue ( ) ) ; } return var_2 ; }

0<SEP>26

<awangdev>Shuffle an Array_1.java

private void swap(int[] nums, int x, int y) { int temp = nums[y]; nums[y] = nums[x]; nums[x] = temp; }

private void var_0 ( int [ ] var_1 , int var_2 , int var_3 ) { int var_4 = var_1 [ var_3 ] ; var_1 [ var_3 ] = var_1 [ var_2 ] ; var_1 [ var_2 ] = var_4 ; }

<awangdev>Distinct Subsequences_4.java

public int numDistinct(String S, String T) { if (S.length() == 0) { return T.length() == 0 ? 1 : 0; } if (T.length() == 0) { return 1; } int count = 0; for (int i = 0; i < S.length(); i++) { if (S.charAt(i) == T.charAt(0)) { count += numDistinct(S.substring(i + 1), T.substring(1)); } } return count; }

public int sample_funcname ( String S , String T ) { if ( S . length ( ) == 0 ) { return T . length ( ) == 0 ? 1 : 0 ; } if ( T . length ( ) == 0 ) { return 1 ; } int count = 0 ; for ( int i = 0 ; i < S . length ( ) ; i ++ ) { if ( S . charAt ( i ) == T . charAt ( 0 ) ) { count += numDistinct ( S . substring ( i + 1 ) , T . substring ( 1 ) ) ; } } return count ; }

0<SEP>1

<awangdev>305. Number of Islands II_2.java

private boolean validateInput(int m, int n, int[][] positions) { return m <= 0 || n <= 0 || positions == null || positions.length == 0 || positions[0] == null || positions[0].length == 0; }

private boolean var_0 ( int var_1 , int var_2 , int [ ] [ ] var_3 ) { return var_1 <= 0 || var_2 <= 0 || var_3 == null || var_3 . length == 0 || var_3 [ 0 ] == null || var_3 [ 0 ] . length == 0 ; }

0

<awangdev>485. Max Consecutive Ones_1.java

public int findMaxConsecutiveOnes(int[] nums) { if (nums == null || nums.length == 0) { return 0; } int maxCount = 0; int count = 0; for (int i = 0; i < nums.length; i++) { if (nums[i] == 0) { maxCount = Math.max(count, maxCount); count = 0; } else { count++; } } return Math.max(count, maxCount); }

public int sample_funcname ( int [ ] var_0 ) { if ( var_0 == null || var_0 . length == 0 ) { return 0 ; } int var_1 = 0 ; int var_2 = 0 ; for ( int var_3 = 0 ; var_3 < var_0 . length ; var_3 ++ ) { if ( var_0 [ var_3 ] == 0 ) { var_1 = Math . max ( var_2 , var_1 ) ; var_2 = 0 ; } else { var_2 ++ ; } } return Math . max ( var_2 , var_1 ) ; }

0

<awangdev>43. Multiply Strings_1.java

private char toChar(int num) { return (char)(num + '0'); }

private char sample_funcname ( int var_0 ) { return ( char ) ( var_0 + '0' ) ; }

<S_QUOTE>0<S_QUOTE>

<awangdev>Coins in a Line_4.java

public boolean firstWillWin(int n) { if (n <= 0) { return false; } if (n <= 2) { return true; } boolean[] dp = new boolean[n + 1]; dp[1] = true; dp[2] = true; dp[3] = false; for (int i = 4; i <= n; i++) { dp[i] = dp[i - 3]; } return dp[n]; }

public boolean var_0 ( int var_1 ) { if ( var_1 <= 0 ) { return false ; } if ( var_1 <= 2 ) { return true ; } boolean [ ] var_2 = new boolean [ var_1 + 1 ] ; var_2 [ 1 ] = true ; var_2 [ 2 ] = true ; var_2 [ 3 ] = false ; for ( int var_3 = 4 ; var_3 <= var_1 ; var_3 ++ ) { var_2 [ var_3 ] = var_2 [ var_3 - 3 ] ; } return var_2 [ var_1 ] ; }

4<SEP>2<SEP>0<SEP>3<SEP>1

<awangdev>140. Word Break II_4.java

public boolean[] validatePossibility(List<String> wordDict, boolean[][] isWord, String s) { int maxLen = 0; for (String word : wordDict) { maxLen = Math.max(maxLen, word.length()); } int n = s.length(); boolean[] isValid = new boolean[n + 1]; isValid[n] = true; for (int i = n - 1; i >= 0; i--) { for (int j = i; j < n; j++) { if (isWord[i][j] && isValid[j + 1]) { isValid[i] = true; break; } } } return isValid; }

public boolean [ ] var_0 ( List < String > var_1 , boolean [ ] [ ] var_2 , String var_3 ) { int var_4 = 0 ; for ( String var_5 : var_1 ) { var_4 = Math . max ( var_4 , var_5 . length ( ) ) ; } int var_6 = var_3 . length ( ) ; boolean [ ] var_7 = new boolean [ var_6 + 1 ] ; var_7 [ var_6 ] = true ; for ( int var_8 = var_6 - 1 ; var_8 >= 0 ; var_8 -- ) { for ( int var_9 = var_8 ; var_9 < var_6 ; var_9 ++ ) { if ( var_2 [ var_8 ] [ var_9 ] && var_7 [ var_9 + 1 ] ) { var_7 [ var_8 ] = true ; break ; } } } return var_7 ; }

0<SEP>1

<awangdev>15. 3Sum_2.java

public ArrayList<ArrayList<Integer>> calTwoSum(int[] num, int end, int target) { ArrayList<ArrayList<Integer>> rst = new ArrayList<ArrayList<Integer>>(); ArrayList<Integer> match; HashMap<Integer, Integer> map = new HashMap<Integer, Integer>(); for (int i = 0; i <= end; i++) { if (map.containsKey(num[i])) { match = new ArrayList<Integer>(); match.add(num[map.get(num[i])]); match.add(num[i]); if (!rst.contains(match)) { rst.add(new ArrayList<Integer>(match)); } } else { map.put(target - num[i], i); } if (i < end && num[i] == num[i + 1]) { continue; } } return rst; }

public ArrayList < ArrayList < Integer >> var_0 ( int [ ] var_1 , int var_2 , int var_3 ) { ArrayList < ArrayList < Integer >> var_4 = new ArrayList < ArrayList < Integer >> ( ) ; ArrayList < Integer > var_5 ; HashMap < Integer , Integer > var_6 = new HashMap < Integer , Integer > ( ) ; for ( int var_7 = 0 ; var_7 <= var_2 ; var_7 ++ ) { if ( var_6 . containsKey ( var_1 [ var_7 ] ) ) { var_5 = new ArrayList < Integer > ( ) ; var_5 . add ( var_1 [ var_6 . get ( var_1 [ var_7 ] ) ] ) ; var_5 . add ( var_1 [ var_7 ] ) ; if ( ! var_4 . contains ( var_5 ) ) { var_4 . add ( new ArrayList < Integer > ( var_5 ) ) ; } } else { var_6 . put ( var_3 - var_1 [ var_7 ] , var_7 ) ; } if ( var_7 < var_2 && var_1 [ var_7 ] == var_1 [ var_7 + 1 ] ) { continue ; } } return var_4 ; }

0<SEP>1

<awangdev>405. Convert a Number to Hexadecimal_1.java

private String convert(int digit) { if (digit <= 9) return String.valueOf((char)(digit + '0')); return String.valueOf((char)(digit - 10 + 'a')); }

private String var_0 ( int var_1 ) { if ( var_1 <= 9 ) return String . valueOf ( ( char ) ( var_1 + '0' ) ) ; return String . valueOf ( ( char ) ( var_1 - 10 + 'a' ) ) ; }

10<SEP><S_QUOTE>0<S_QUOTE><SEP>9<SEP><S_QUOTE>a<S_QUOTE>

<awangdev>496. Next Greater Element I_1.java

private Map<Integer, Integer> generateSubMap(int[] base) { Stack<Integer> stack = new Stack<>(); Map<Integer, Integer> baseMap = new HashMap<>(); for (int num : base) { while (!stack.isEmpty() && stack.peek() < num) { int pop = stack.pop(); baseMap.put(pop, num); } stack.push(num); } return baseMap; }

private Map < Integer , Integer > var_0 ( int [ ] var_1 ) { Stack < Integer > var_2 = new Stack < > ( ) ; Map < Integer , Integer > var_3 = new HashMap < > ( ) ; for ( int var_4 : var_1 ) { while ( ! var_2 . isEmpty ( ) && var_2 . peek ( ) < var_4 ) { int pop = var_2 . pop ( ) ; var_3 . put ( pop , var_4 ) ; } var_2 . push ( var_4 ) ; } return var_3 ; }

<gouthampradhan>two_pointers_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_1 , String var_2 ) { int var_3 = 0 , var_4 = 0 ; if ( var_2 . length ( ) > var_1 . length ( ) ) return false ; for ( ; ; ) { if ( var_4 >= var_2 . length ( ) ) return true ; else if ( var_3 >= var_1 . length ( ) ) return false ; else { if ( var_1 . charAt ( var_3 ) == var_2 . charAt ( var_4 ) ) { var_3 ++ ; var_4 ++ ; } else { var_3 ++ ; } } } }

0

<gouthampradhan>array_BattleshipsInABoard_1.java

public int countBattleships(char[][] board) { int count = 0; for (int i = 0; i < board.length; i++) { for (int j = 0; j < board[0].length; j++) { if (board[i][j] == 'X') { if (i - 1 >= 0) { if (board[i - 1][j] == 'X') continue; } if (j - 1 >= 0) { if (board[i][j - 1] == 'X') { continue; } } count++; } } } return count; }

public int sample_funcname ( char [ ] [ ] var_0 ) { int var_1 = 0 ; for ( int var_2 = 0 ; var_2 < var_0 . length ; var_2 ++ ) { for ( int var_3 = 0 ; var_3 < var_0 [ 0 ] . length ; var_3 ++ ) { if ( var_0 [ var_2 ] [ var_3 ] == 'X' ) { if ( var_2 - 1 >= 0 ) { if ( var_0 [ var_2 - 1 ] [ var_3 ] == 'X' ) continue ; } if ( var_3 - 1 >= 0 ) { if ( var_0 [ var_2 ] [ var_3 - 1 ] == 'X' ) { continue ; } } var_1 ++ ; } } } return var_1 ; }

<S_QUOTE>X<S_QUOTE><SEP>0<SEP>1

<gouthampradhan>binary_search_MedianOfTwoSortedArrays_1.java

public double findMedianSortedArrays(int[] nums1, int[] nums2) { if (nums1.length > nums2.length) return findMedianSortedArrays(nums2, nums1); int T = nums1.length + nums2.length, low = -1, high = -1; int median = (T - 1) / 2; boolean isOdd = false; if ((T % 2) != 0) isOdd = true; int s = 0, e = nums1.length - 1; while (s <= e) { int m = s + (e - s) / 2; if ((median - m - 1) < 0 || nums1[m] >= nums2[median - m - 1]) { e = m - 1; low = m; high = median - m; } else s = m + 1; } if (low == -1) { if (isOdd) return nums2[median - nums1.length]; else return (double) (nums2[median - nums1.length] + nums2[median - nums1.length + 1]) / 2.0D; } else { if (isOdd) return nums1[low] < nums2[high] ? nums1[low] : nums2[high]; else { List<Integer> list = new ArrayList<>(); list.add(nums1[low]); if (low + 1 < nums1.length) list.add(nums1[low + 1]); list.add(nums2[high]); if (high + 1 < nums2.length) list.add(nums2[high + 1]); Collections.sort(list); return (double) (list.get(0) + list.get(1)) / 2.0; } } }

public double sample_funcname ( int [ ] nums1 , int [ ] nums2 ) { if ( nums1 . length > nums2 . length ) return findMedianSortedArrays ( nums2 , nums1 ) ; int T = nums1 . length + nums2 . length , low = - 1 , high = - 1 ; int median = ( T - 1 ) / 2 ; boolean isOdd = false ; if ( ( T % 2 ) != 0 ) isOdd = true ; int s = 0 , e = nums1 . length - 1 ; while ( s <= e ) { int m = s + ( e - s ) / 2 ; if ( ( median - m - 1 ) < 0 || nums1 [ m ] >= nums2 [ median - m - 1 ] ) { e = m - 1 ; low = m ; high = median - m ; } else s = m + 1 ; } if ( low == - 1 ) { if ( isOdd ) return nums2 [ median - nums1 . length ] ; else return ( double ) ( nums2 [ median - nums1 . length ] + nums2 [ median - nums1 . length + 1 ] ) / 2.0D ; } else { if ( isOdd ) return nums1 [ low ] < nums2 [ high ] ? nums1 [ low ] : nums2 [ high ] ; else { List < Integer > list = new ArrayList < > ( ) ; list . add ( nums1 [ low ] ) ; if ( low + 1 < nums1 . length ) list . add ( nums1 [ low + 1 ] ) ; list . add ( nums2 [ high ] ) ; if ( high + 1 < nums2 . length ) list . add ( nums2 [ high + 1 ] ) ; Collections . sort ( list ) ; return ( double ) ( list . get ( 0 ) + list . get ( 1 ) ) / 2.0 ; } } }

2.0<SEP>1<SEP>0<SEP>2

<gouthampradhan>dynamic_programming_PaintHouseII_1.java

public int minCostII(int[][] costs) { if (costs.length == 0) return 0; int[][] lMin = new int[costs.length][costs[0].length]; int[][] rMin = new int[costs.length][costs[0].length]; for (int i = costs.length - 2; i >= 0; i--) { int min = Integer.MAX_VALUE; for (int j = 0; j < costs[0].length; j++) { lMin[i + 1][j] = min; min = Math.min(min, costs[i + 1][j]); } min = Integer.MAX_VALUE; for (int j = costs[0].length - 1; j >= 0; j--) { rMin[i + 1][j] = min; min = Math.min(min, costs[i + 1][j]); } for (int j = 0; j < costs[0].length; j++) { if (j == 0) { costs[i][j] = costs[i][j] + rMin[i + 1][j]; } else if (j == costs[0].length - 1) { costs[i][j] = costs[i][j] + lMin[i + 1][j]; } else { costs[i][j] = costs[i][j] + Math.min(lMin[i + 1][j], rMin[i + 1][j]); } } } int min = Integer.MAX_VALUE; for (int i = 0; i < costs[0].length; i++) { min = Math.min(min, costs[0][i]); } return min; }

public int sample_funcname ( int [ ] [ ] var_0 ) { if ( var_0 . length == 0 ) return 0 ; int [ ] [ ] var_1 = new int [ var_0 . length ] [ var_0 [ 0 ] . length ] ; int [ ] [ ] var_2 = new int [ var_0 . length ] [ var_0 [ 0 ] . length ] ; for ( int var_3 = var_0 . length - 2 ; var_3 >= 0 ; var_3 -- ) { int min = Integer . MAX_VALUE ; for ( int var_4 = 0 ; var_4 < var_0 [ 0 ] . length ; var_4 ++ ) { var_1 [ var_3 + 1 ] [ var_4 ] = min ; min = Math . min ( min , var_0 [ var_3 + 1 ] [ var_4 ] ) ; } min = Integer . MAX_VALUE ; for ( int var_4 = var_0 [ 0 ] . length - 1 ; var_4 >= 0 ; var_4 -- ) { var_2 [ var_3 + 1 ] [ var_4 ] = min ; min = Math . min ( min , var_0 [ var_3 + 1 ] [ var_4 ] ) ; } for ( int var_4 = 0 ; var_4 < var_0 [ 0 ] . length ; var_4 ++ ) { if ( var_4 == 0 ) { var_0 [ var_3 ] [ var_4 ] = var_0 [ var_3 ] [ var_4 ] + var_2 [ var_3 + 1 ] [ var_4 ] ; } else if ( var_4 == var_0 [ 0 ] . length - 1 ) { var_0 [ var_3 ] [ var_4 ] = var_0 [ var_3 ] [ var_4 ] + var_1 [ var_3 + 1 ] [ var_4 ] ; } else { var_0 [ var_3 ] [ var_4 ] = var_0 [ var_3 ] [ var_4 ] + Math . min ( var_1 [ var_3 + 1 ] [ var_4 ] , var_2 [ var_3 + 1 ] [ var_4 ] ) ; } } } int min = Integer . MAX_VALUE ; for ( int var_3 = 0 ; var_3 < var_0 [ 0 ] . length ; var_3 ++ ) { min = Math . min ( min , var_0 [ 0 ] [ var_3 ] ) ; } return min ; }

0<SEP>1<SEP>2

<gouthampradhan>dynamic_programming_LongestIncreasingSubsequence_1.java

public int lengthOfLIS(int[] nums) { if (nums.length == 0) return 0; int[] A = new int[nums.length]; int max = Integer.MIN_VALUE; for (int i = 0, l = nums.length; i < l; i++) { int lis = 1; for (int j = 0; j < i; j++) { if (nums[i] > nums[j]) lis = Math.max(lis, A[j] + 1); } A[i] = lis; max = Math.max(max, A[i]); } return max; }

public int sample_funcname ( int [ ] var_0 ) { if ( var_0 . length == 0 ) return 0 ; int [ ] var_1 = new int [ var_0 . length ] ; int max = Integer . MIN_VALUE ; for ( int var_2 = 0 , var_3 = var_0 . length ; var_2 < var_3 ; var_2 ++ ) { int var_4 = 1 ; for ( int var_5 = 0 ; var_5 < var_2 ; var_5 ++ ) { if ( var_0 [ var_2 ] > var_0 [ var_5 ] ) var_4 = Math . max ( var_4 , var_1 [ var_5 ] + 1 ) ; } var_1 [ var_2 ] = var_4 ; max = Math . max ( max , var_1 [ var_2 ] ) ; } return max ; }

0<SEP>1

<gouthampradhan>dynamic_programming_PalindromePartitioningIII_1.java

private int count(String s) { int cnt = 0; for (int i = 0, j = s.length() - 1; i < j; i++, j--) { if (s.charAt(i) != s.charAt(j)) { cnt++; } } return cnt; }

private int sample_funcname ( String var_0 ) { int var_1 = 0 ; for ( int var_2 = 0 , var_3 = var_0 . length ( ) - 1 ; var_2 < var_3 ; var_2 ++ , var_3 -- ) { if ( var_0 . charAt ( var_2 ) != var_0 . charAt ( var_3 ) ) { var_1 ++ ; } } return var_1 ; }

0<SEP>1

<gouthampradhan>binary_search_HIndexII_1.java

public int hIndex(int[] citations) { if (citations.length == 0) return 0; int s = 0, e = citations.length; int ans = -1; while (s < e) { int m = (s + e) >>> 1; int cit = citations.length - m; if (citations[m] > cit) { if (ans < cit) { ans = cit; } e = m; } else { if (ans < citations[m]) { ans = citations[m]; } s = m + 1; } } return ans; }

public int sample_funcname ( int [ ] var_0 ) { if ( var_0 . length == 0 ) return 0 ; int var_1 = 0 , var_2 = var_0 . length ; int var_3 = - 1 ; while ( var_1 < var_2 ) { int var_4 = ( var_1 + var_2 ) >>> 1 ; int var_5 = var_0 . length - var_4 ; if ( var_0 [ var_4 ] > var_5 ) { if ( var_3 < var_5 ) { var_3 = var_5 ; } var_2 = var_4 ; } else { if ( var_3 < var_0 [ var_4 ] ) { var_3 = var_0 [ var_4 ] ; } var_1 = var_4 + 1 ; } } return var_3 ; }

0<SEP>1

<gouthampradhan>array_IncreasingTripletSubsequence_1.java

public boolean increasingTriplet(int[] nums) { int[] A = new int[3]; Arrays.fill(A, Integer.MAX_VALUE); for (int num : nums) { if (num < A[0]) { A[0] = num; } else if (num < A[1] && num > A[0]) { A[1] = num; } else if (num < A[2] && num > A[1]) { return true; } } return false; }

public boolean var_0 ( int [ ] var_1 ) { int [ ] var_2 = new int [ 3 ] ; Arrays . fill ( var_2 , Integer . MAX_VALUE ) ; for ( int var_3 : var_1 ) { if ( var_3 < var_2 [ 0 ] ) { var_2 [ 0 ] = var_3 ; } else if ( var_3 < var_2 [ 1 ] && var_3 > var_2 [ 0 ] ) { var_2 [ 1 ] = var_3 ; } else if ( var_3 < var_2 [ 2 ] && var_3 > var_2 [ 1 ] ) { return true ; } } return false ; }

2<SEP>0<SEP>3<SEP>1

<gouthampradhan>string_ZigZagConversion_1.java

public String convert(String s, int numRows) { if (s == null || s.length() <= numRows || numRows == 1) return s; List<String> list = new ArrayList<>(); char[] A = new char[numRows]; int direction = 1; int n = 1; A[0] = s.charAt(0); for (int j = 1; j < numRows; ) { if (n >= s.length()) break; A[j] = s.charAt(n++); if (j == numRows - 1) { list.add(String.valueOf(A)); A = new char[numRows]; Arrays.fill(A, ' '); direction = 0; } else if (j == 0) { list.add(String.valueOf(A)); A = new char[numRows]; Arrays.fill(A, ' '); direction = 1; } j = direction == 1 ? j + 1 : j - 1; } if (!String.valueOf(A).trim().isEmpty()) list.add(String.valueOf(A)); char[] arr = new char[s.length()]; int k = 0; for (int j = 0; j < numRows; j++) { for (String aList : list) { if (aList.charAt(j) != ' ') arr[k++] = aList.charAt(j); } } return new String(arr).trim(); }

public String var_0 ( String var_1 , int var_2 ) { if ( var_1 == null || var_1 . length ( ) <= var_2 || var_2 == 1 ) return var_1 ; List < String > var_3 = new ArrayList < > ( ) ; char [ ] var_4 = new char [ var_2 ] ; int var_5 = 1 ; int var_6 = 1 ; var_4 [ 0 ] = var_1 . charAt ( 0 ) ; for ( int var_7 = 1 ; var_7 < var_2 ; ) { if ( var_6 >= var_1 . length ( ) ) break ; var_4 [ var_7 ] = var_1 . charAt ( var_6 ++ ) ; if ( var_7 == var_2 - 1 ) { var_3 . add ( String . valueOf ( var_4 ) ) ; var_4 = new char [ var_2 ] ; Arrays . fill ( var_4 , ' ' ) ; var_5 = 0 ; } else if ( var_7 == 0 ) { var_3 . add ( String . valueOf ( var_4 ) ) ; var_4 = new char [ var_2 ] ; Arrays . fill ( var_4 , ' ' ) ; var_5 = 1 ; } var_7 = var_5 == 1 ? var_7 + 1 : var_7 - 1 ; } if ( ! String . valueOf ( var_4 ) . trim ( ) . isEmpty ( ) ) var_3 . add ( String . valueOf ( var_4 ) ) ; char [ ] var_8 = new char [ var_1 . length ( ) ] ; int var_9 = 0 ; for ( int var_7 = 0 ; var_7 < var_2 ; var_7 ++ ) { for ( String var_10 : var_3 ) { if ( var_10 . charAt ( var_7 ) != ' ' ) var_8 [ var_9 ++ ] = var_10 . charAt ( var_7 ) ; } } return new String ( var_8 ) . trim ( ) ; }

1<SEP>0<SEP><S_QUOTE> <S_QUOTE>

<gouthampradhan>dynamic_programming_MaximumSubarray_1.java

public int maxSubArray(int[] nums) { if (nums.length == 1) return nums[0]; int max = nums[nums.length - 1]; for (int i = nums.length - 2; i >= 0; i--) { nums[i] = Math.max(nums[i], nums[i] + nums[i + 1]); max = Math.max(max, nums[i]); } return max; }

public int sample_funcname ( int [ ] var_0 ) { if ( var_0 . length == 1 ) return var_0 [ 0 ] ; int max = var_0 [ var_0 . length - 1 ] ; for ( int var_1 = var_0 . length - 2 ; var_1 >= 0 ; var_1 -- ) { var_0 [ var_1 ] = Math . max ( var_0 [ var_1 ] , var_0 [ var_1 ] + var_0 [ var_1 + 1 ] ) ; max = Math . max ( max , var_0 [ var_1 ] ) ; } return max ; }

1<SEP>0<SEP>2

<gouthampradhan>greedy_StringWithout3A3B_1.java

public String strWithout3a3b(int A, int B) { StringBuilder sb = new StringBuilder(); while (A > 0 || B > 0) { if (A > B && A > 1 && B > 0) { sb.append("a").append("a"); sb.append("b"); A -= 2; B -= 1; } else if (B > A && B > 1 && A > 0) { sb.append("b").append("b"); sb.append("a"); B -= 2; A -= 1; } else { if (A > B && A > 1) { sb.append("a"); sb.append("a"); A -= 2; } else if (A > B && A > 0) { sb.append("a"); A -= 1; } else if (B > A && B > 1) { sb.append("b"); sb.append("b"); B -= 2; } else { sb.append("b"); B -= 1; } } } return sb.toString(); }

public String var_0 ( int var_1 , int var_2 ) { StringBuilder var_3 = new StringBuilder ( ) ; while ( var_1 > 0 || var_2 > 0 ) { if ( var_1 > var_2 && var_1 > 1 && var_2 > 0 ) { var_3 . append ( "a" ) . append ( "a" ) ; var_3 . append ( "b" ) ; var_1 -= 2 ; var_2 -= 1 ; } else if ( var_2 > var_1 && var_2 > 1 && var_1 > 0 ) { var_3 . append ( "b" ) . append ( "b" ) ; var_3 . append ( "a" ) ; var_2 -= 2 ; var_1 -= 1 ; } else { if ( var_1 > var_2 && var_1 > 1 ) { var_3 . append ( "a" ) ; var_3 . append ( "a" ) ; var_1 -= 2 ; } else if ( var_1 > var_2 && var_1 > 0 ) { var_3 . append ( "a" ) ; var_1 -= 1 ; } else if ( var_2 > var_1 && var_2 > 1 ) { var_3 . append ( "b" ) ; var_3 . append ( "b" ) ; var_2 -= 2 ; } else { var_3 . append ( "b" ) ; var_2 -= 1 ; } } } return var_3 . toString ( ) ; }

2<SEP>0<SEP>1<SEP><D_QUOTE>b<D_QUOTE><SEP><D_QUOTE>a<D_QUOTE>

<gouthampradhan>string_ReverseWordsII_1.java

public void reverseWords(char[] s) { for (int i = 0, j = s.length - 1; i < j; i++, j--) { char temp = s[i]; s[i] = s[j]; s[j] = temp; } for (int i = 0, j = 0, l = s.length; i < l; ) { if (s[i] == ' ') { if (s[i - 1] == ' ') { j = i; i++; j++; } else { i = i - 1; for (int p = j, q = i; p < q; p++, q--) { char temp = s[p]; s[p] = s[q]; s[q] = temp; } i = i + 1; j = i; i++; j++; } } else if (i == l - 1) { for (int p = j, q = i; p < q; p++, q--) { char temp = s[p]; s[p] = s[q]; s[q] = temp; } j = i; i++; j++; } else { i++; } } }

public void var_0 ( char [ ] var_1 ) { for ( int var_2 = 0 , var_3 = var_1 . length - 1 ; var_2 < var_3 ; var_2 ++ , var_3 -- ) { char var_4 = var_1 [ var_2 ] ; var_1 [ var_2 ] = var_1 [ var_3 ] ; var_1 [ var_3 ] = var_4 ; } for ( int var_2 = 0 , var_3 = 0 , var_5 = var_1 . length ; var_2 < var_5 ; ) { if ( var_1 [ var_2 ] == ' ' ) { if ( var_1 [ var_2 - 1 ] == ' ' ) { var_3 = var_2 ; var_2 ++ ; var_3 ++ ; } else { var_2 = var_2 - 1 ; for ( int var_6 = var_3 , var_7 = var_2 ; var_6 < var_7 ; var_6 ++ , var_7 -- ) { char var_4 = var_1 [ var_6 ] ; var_1 [ var_6 ] = var_1 [ var_7 ] ; var_1 [ var_7 ] = var_4 ; } var_2 = var_2 + 1 ; var_3 = var_2 ; var_2 ++ ; var_3 ++ ; } } else if ( var_2 == var_5 - 1 ) { for ( int var_6 = var_3 , var_7 = var_2 ; var_6 < var_7 ; var_6 ++ , var_7 -- ) { char var_4 = var_1 [ var_6 ] ; var_1 [ var_6 ] = var_1 [ var_7 ] ; var_1 [ var_7 ] = var_4 ; } var_3 = var_2 ; var_2 ++ ; var_3 ++ ; } else { var_2 ++ ; } } }

0<SEP><S_QUOTE> <S_QUOTE><SEP>1

<gouthampradhan>math_NthMagicalNumber_1.java

private int check(int N, long num, int A, int B, long lcm) { long sum = (num / A) + (num / B); long common = num / lcm; sum -= common; if (sum == N) return 0; else if (sum > N) return 1; else return -1; }

private int sample_funcname ( int var_0 , long var_1 , int var_2 , int var_3 , long var_4 ) { long var_5 = ( var_1 / var_2 ) + ( var_1 / var_3 ) ; long var_6 = var_1 / var_4 ; var_5 -= var_6 ; if ( var_5 == var_0 ) return 0 ; else if ( var_5 > var_0 ) return 1 ; else return - 1 ; }

0<SEP>1

<gouthampradhan>string_OneEditDistance_1.java

private boolean hasDiffOne(String s, String t, boolean sameLength) { int count = 0, i = 0, j = 0; for (int l1 = s.length(), l2 = t.length(); i < l1 && j < l2; ) { if (s.charAt(i) == t.charAt(j)) { i++; j++; } else { if (count > 0) return false; count++; if (sameLength) { i++; j++; } else { i++; } } } if (i == j) { return true; } else { return (s.charAt(s.length() - 1) == t.charAt(t.length() - 1)); } }

private boolean var_0 ( String var_1 , String var_2 , boolean var_3 ) { int var_4 = 0 , var_5 = 0 , var_6 = 0 ; for ( int var_7 = var_1 . length ( ) , var_8 = var_2 . length ( ) ; var_5 < var_7 && var_6 < var_8 ; ) { if ( var_1 . charAt ( var_5 ) == var_2 . charAt ( var_6 ) ) { var_5 ++ ; var_6 ++ ; } else { if ( var_4 > 0 ) return false ; var_4 ++ ; if ( var_3 ) { var_5 ++ ; var_6 ++ ; } else { var_5 ++ ; } } } if ( var_5 == var_6 ) { return true ; } else { return ( var_1 . charAt ( var_1 . length ( ) - 1 ) == var_2 . charAt ( var_2 . length ( ) - 1 ) ) ; } }

0<SEP>1

<gouthampradhan>two_pointers_SubarraysWithKDifferentIntegers_1.java

private int calculate(int[] A, int K) { int count = 0; int[] frequency = new int[A.length + 1]; int currCount = 0; for (int i = 0, j = 0; i < A.length; i++) { frequency[A[i]]++; if (frequency[A[i]] == 1) { currCount++; } while (currCount > K) { frequency[A[j]]--; if (frequency[A[j]] == 0) { currCount--; } j++; } count += (i - j + 1); } return count; }

private int sample_funcname ( int [ ] var_0 , int var_1 ) { int var_2 = 0 ; int [ ] var_3 = new int [ var_0 . length + 1 ] ; int var_4 = 0 ; for ( int var_5 = 0 , var_6 = 0 ; var_5 < var_0 . length ; var_5 ++ ) { var_3 [ var_0 [ var_5 ] ] ++ ; if ( var_3 [ var_0 [ var_5 ] ] == 1 ) { var_4 ++ ; } while ( var_4 > var_1 ) { var_3 [ var_0 [ var_6 ] ] -- ; if ( var_3 [ var_0 [ var_6 ] ] == 0 ) { var_4 -- ; } var_6 ++ ; } var_2 += ( var_5 - var_6 + 1 ) ; } return var_2 ; }

0<SEP>1

<gouthampradhan>dynamic_programming_LargestSumOfAverages_1.java

public double largestSumOfAverages(int[] A, int K) { double[][] dp = new double[K][A.length]; for (int i = dp[0].length - 1; i >= 0; i--) { dp[0][i] = A[i]; if (i + 1 < dp[0].length) { dp[0][i] += dp[0][i + 1]; } } for (int i = dp[0].length - 1, j = 1; i >= 0; i--, j++) { dp[0][i] = dp[0][i] / j; } for (int i = dp[0].length - 1; i >= 0; i--) { for (int j = 1; j < dp.length; j++) { double sum = 0.0D; for (int k = i, c = 1; k < dp[0].length; k++, c++) { sum += A[k]; if (k + 1 < dp[0].length) { double avg = sum / c; avg += dp[j - 1][k + 1]; dp[j][i] = Math.max(dp[j][i], avg); } } } } return dp[K - 1][0]; }

public double sample_funcname ( int [ ] var_0 , int var_1 ) { double [ ] [ ] var_2 = new double [ var_1 ] [ var_0 . length ] ; for ( int var_3 = var_2 [ 0 ] . length - 1 ; var_3 >= 0 ; var_3 -- ) { var_2 [ 0 ] [ var_3 ] = var_0 [ var_3 ] ; if ( var_3 + 1 < var_2 [ 0 ] . length ) { var_2 [ 0 ] [ var_3 ] += var_2 [ 0 ] [ var_3 + 1 ] ; } } for ( int var_3 = var_2 [ 0 ] . length - 1 , var_4 = 1 ; var_3 >= 0 ; var_3 -- , var_4 ++ ) { var_2 [ 0 ] [ var_3 ] = var_2 [ 0 ] [ var_3 ] / var_4 ; } for ( int var_3 = var_2 [ 0 ] . length - 1 ; var_3 >= 0 ; var_3 -- ) { for ( int var_4 = 1 ; var_4 < var_2 . length ; var_4 ++ ) { double var_5 = 0.0D ; for ( int var_6 = var_3 , var_7 = 1 ; var_6 < var_2 [ 0 ] . length ; var_6 ++ , var_7 ++ ) { var_5 += var_0 [ var_6 ] ; if ( var_6 + 1 < var_2 [ 0 ] . length ) { double var_8 = var_5 / var_7 ; var_8 += var_2 [ var_4 - 1 ] [ var_6 + 1 ] ; var_2 [ var_4 ] [ var_3 ] = Math . max ( var_2 [ var_4 ] [ var_3 ] , var_8 ) ; } } } } return var_2 [ var_1 - 1 ] [ 0 ] ; }

0.0D<SEP>0<SEP>1

<gouthampradhan>hashing_StringTransformsIntoAnotherString_1.java

public boolean canConvert(String str1, String str2) { if (str1.length() != str2.length()) return false; if (str1.equals(str2)) return true; Map<Character, Character> mapping = new HashMap<>(); for (int i = 0; i < str1.length(); i++) { char c1 = str1.charAt(i); char c2 = str2.charAt(i); if (mapping.containsKey(c1)) { if (mapping.get(c1) != c2) return false; } else { mapping.put(c1, c2); } } Set<Character> set = new HashSet<>(); for (char k : mapping.keySet()) { set.add(mapping.get(k)); } return (set.size() < 26); }

public boolean var_0 ( String var_1 , String var_2 ) { if ( var_1 . length ( ) != var_2 . length ( ) ) return false ; if ( var_1 . equals ( var_2 ) ) return true ; Map < Character , Character > var_3 = new HashMap < > ( ) ; for ( int var_4 = 0 ; var_4 < var_1 . length ( ) ; var_4 ++ ) { char var_5 = var_1 . charAt ( var_4 ) ; char var_6 = var_2 . charAt ( var_4 ) ; if ( var_3 . containsKey ( var_5 ) ) { if ( var_3 . get ( var_5 ) != var_6 ) return false ; } else { var_3 . put ( var_5 , var_6 ) ; } } Set < Character > var_7 = new HashSet < > ( ) ; for ( char var_8 : var_3 . keySet ( ) ) { var_7 . add ( var_3 . get ( var_8 ) ) ; } return ( var_7 . size ( ) < 26 ) ; }

0<SEP>26

<gouthampradhan>backtracking_Subsets_1.java

public List<List<Integer>> subsets(int[] nums) { List<List<Integer>> result = new ArrayList<>(); result.add(new ArrayList<>()); for (int i = 0, l = nums.length; i < l; i++) { for (int j = 0, resLen = result.size(); j < resLen; j++) { List<Integer> newList = new ArrayList<>(result.get(j)); newList.add(nums[i]); result.add(newList); } } return result; }

public List < List < Integer >> var_0 ( int [ ] var_1 ) { List < List < Integer >> var_2 = new ArrayList < > ( ) ; var_2 . add ( new ArrayList < > ( ) ) ; for ( int var_3 = 0 , var_4 = var_1 . length ; var_3 < var_4 ; var_3 ++ ) { for ( int var_5 = 0 , var_6 = var_2 . size ( ) ; var_5 < var_6 ; var_5 ++ ) { List < Integer > var_7 = new ArrayList < > ( var_2 . get ( var_5 ) ) ; var_7 . add ( var_1 [ var_3 ] ) ; var_2 . add ( var_7 ) ; } } return var_2 ; }

0

<gouthampradhan>dynamic_programming_LongestPaliandromicSubstring_1.java

public String longestPalindrome(String s) { int l = s.length(); int startIndex = 0; int maxLen = 1; boolean[][] A = new boolean[l][l]; for (int i = 0, j = 0; i < l; i++, j++) A[i][j] = true; for (int i = 0, j = i + 1; j < l; i++, j++) { if (s.charAt(i) == s.charAt(j)) { A[i][j] = true; startIndex = i; maxLen = 2; } } for (int k = 3; k <= l; k++) { for (int i = 0, j = k - 1; j < l; i++, j++) { if (s.charAt(i) == s.charAt(j)) { A[i][j] = A[i + 1][j - 1]; if (A[i][j]) { if (k > maxLen) { startIndex = i; maxLen = k; } } } } } return s.substring(startIndex, startIndex + maxLen); }

public String var_0 ( String var_1 ) { int var_2 = var_1 . length ( ) ; int var_3 = 0 ; int var_4 = 1 ; boolean [ ] [ ] var_5 = new boolean [ var_2 ] [ var_2 ] ; for ( int var_6 = 0 , var_7 = 0 ; var_6 < var_2 ; var_6 ++ , var_7 ++ ) var_5 [ var_6 ] [ var_7 ] = true ; for ( int var_6 = 0 , var_7 = var_6 + 1 ; var_7 < var_2 ; var_6 ++ , var_7 ++ ) { if ( var_1 . charAt ( var_6 ) == var_1 . charAt ( var_7 ) ) { var_5 [ var_6 ] [ var_7 ] = true ; var_3 = var_6 ; var_4 = 2 ; } } for ( int var_8 = 3 ; var_8 <= var_2 ; var_8 ++ ) { for ( int var_6 = 0 , var_7 = var_8 - 1 ; var_7 < var_2 ; var_6 ++ , var_7 ++ ) { if ( var_1 . charAt ( var_6 ) == var_1 . charAt ( var_7 ) ) { var_5 [ var_6 ] [ var_7 ] = var_5 [ var_6 + 1 ] [ var_7 - 1 ] ; if ( var_5 [ var_6 ] [ var_7 ] ) { if ( var_8 > var_4 ) { var_3 = var_6 ; var_4 = var_8 ; } } } } } return var_1 . substring ( var_3 , var_3 + var_4 ) ; }

2<SEP>0<SEP>3<SEP>1

<gouthampradhan>dynamic_programming_StoneGameIV_2.java

private void genSquare(int sq, int limit, Set<Integer> perfectSquare) { if (!perfectSquare.contains(sq)) { perfectSquare.add(sq); if (((long) sq * sq) <= limit) { genSquare(sq * sq, limit, perfectSquare); } } }

private void sample_funcname ( int sq , int limit , Set < Integer > perfectSquare ) { if ( ! perfectSquare . contains ( sq ) ) { perfectSquare . add ( sq ) ; if ( ( ( long ) sq * sq ) <= limit ) { genSquare ( sq * sq , limit , perfectSquare ) ; } } }

<gouthampradhan>hashing_SubstringConcatenationOfWords_1.java

public List<Integer> findSubstring(String s, String[] words) { if (words.length == 0) return new ArrayList<>(); int wLen = words[0].length(); int sLen = wLen * words.length; List<Integer> result = new ArrayList<>(); if (sLen > s.length()) return result; Map<String, Integer> countMap = new HashMap<>(); for (String w : words) { countMap.putIfAbsent(w, 0); countMap.put(w, countMap.get(w) + 1); } for (int k = 0; (s.length() - k) >= sLen; k++) { Map<String, Integer> subSMap = new HashMap<>(); int i = k; for (int j = i + wLen; (i - k) < sLen; i = j, j += wLen) { String subS = s.substring(i, j); subSMap.putIfAbsent(subS, 0); subSMap.put(subS, subSMap.get(subS) + 1); if (!countMap.containsKey(subS) || subSMap.get(subS) > countMap.get(subS)) { break; } } if ((i - k) >= sLen) { result.add(k); } } return result; }

public List < Integer > var_0 ( String var_1 , String [ ] var_2 ) { if ( var_2 . length == 0 ) return new ArrayList < > ( ) ; int var_3 = var_2 [ 0 ] . length ( ) ; int var_4 = var_3 * var_2 . length ; List < Integer > var_5 = new ArrayList < > ( ) ; if ( var_4 > var_1 . length ( ) ) return var_5 ; Map < String , Integer > var_6 = new HashMap < > ( ) ; for ( String var_7 : var_2 ) { var_6 . putIfAbsent ( var_7 , 0 ) ; var_6 . put ( var_7 , var_6 . get ( var_7 ) + 1 ) ; } for ( int var_8 = 0 ; ( var_1 . length ( ) - var_8 ) >= var_4 ; var_8 ++ ) { Map < String , Integer > var_9 = new HashMap < > ( ) ; int var_10 = var_8 ; for ( int var_11 = var_10 + var_3 ; ( var_10 - var_8 ) < var_4 ; var_10 = var_11 , var_11 += var_3 ) { String var_12 = var_1 . substring ( var_10 , var_11 ) ; var_9 . putIfAbsent ( var_12 , 0 ) ; var_9 . put ( var_12 , var_9 . get ( var_12 ) + 1 ) ; if ( ! var_6 . containsKey ( var_12 ) || var_9 . get ( var_12 ) > var_6 . get ( var_12 ) ) { break ; } } if ( ( var_10 - var_8 ) >= var_4 ) { var_5 . add ( var_8 ) ; } } return var_5 ; }

0<SEP>1

<gouthampradhan>greedy_LemonadeChange_1.java

public boolean lemonadeChange(int[] bills) { int five = 0, ten = 0; for (int b : bills) { if (b == 5) { five++; } else if (b == 10) { ten++; if (five > 0) { five--; } else { return false; } } else { if (ten > 0 && five > 0) { ten--; five--; } else if (five > 2) { five -= 3; } else { return false; } } } return true; }

public boolean var_0 ( int [ ] var_1 ) { int var_2 = 0 , var_3 = 0 ; for ( int var_4 : var_1 ) { if ( var_4 == 5 ) { var_2 ++ ; } else if ( var_4 == 10 ) { var_3 ++ ; if ( var_2 > 0 ) { var_2 -- ; } else { return false ; } } else { if ( var_3 > 0 && var_2 > 0 ) { var_3 -- ; var_2 -- ; } else if ( var_2 > 2 ) { var_2 -= 3 ; } else { return false ; } } } return true ; }

2<SEP>0<SEP>3<SEP>5<SEP>10

<gouthampradhan>dynamic_programming_ContinuousSubarraySum_1.java

public boolean checkSubarraySum(int[] nums, int k) { Map<Integer, Integer> map = new HashMap<>(); int sum = 0; map.put(0, -1); for (int i = 0; i < nums.length; i++) { sum += nums[i]; int mod = (k == 0) ? sum : sum % k; if (map.containsKey(mod)) { if (i - map.get(mod) > 1) { return true; } } else { map.put(mod, i); } } return false; }

public boolean var_0 ( int [ ] var_1 , int var_2 ) { Map < Integer , Integer > var_3 = new HashMap < > ( ) ; int var_4 = 0 ; var_3 . put ( 0 , - 1 ) ; for ( int var_5 = 0 ; var_5 < var_1 . length ; var_5 ++ ) { var_4 += var_1 [ var_5 ] ; int var_6 = ( var_2 == 0 ) ? var_4 : var_4 % var_2 ; if ( var_3 . containsKey ( var_6 ) ) { if ( var_5 - var_3 . get ( var_6 ) > 1 ) { return true ; } } else { var_3 . put ( var_6 , var_5 ) ; } } return false ; }

0<SEP>1

<gouthampradhan>heap_Candy_1.java

public int candy(int[] ratings) { if (ratings.length == 1) return 1; PriorityQueue<Integer> pq = new PriorityQueue<>((o1, o2) -> Integer.compare(ratings[o1], ratings[o2])); for (int i = 0; i < ratings.length; i++) { pq.offer(i); } int[] count = new int[ratings.length]; while (!pq.isEmpty()) { int index = pq.poll(); if (index - 1 < 0) { if (ratings[index + 1] == ratings[index]) { count[index] = 1; } else { count[index] = count[index + 1] + 1; } } else if (index + 1 >= ratings.length) { if (ratings[index - 1] == ratings[index]) { count[index] = 1; } else { count[index] = count[index - 1] + 1; } } else { if ((ratings[index - 1] == ratings[index]) && (ratings[index + 1] == ratings[index])) { count[index] = 1; } else { if (((ratings[index - 1] == ratings[index]) && (ratings[index + 1] > ratings[index])) || ((ratings[index + 1] == ratings[index]) && (ratings[index - 1] > ratings[index]))) { count[index] = 1; } else if (((ratings[index - 1] == ratings[index]) && (ratings[index + 1] < ratings[index]))) { count[index] = count[index + 1] + 1; } else if (((ratings[index + 1] == ratings[index]) && (ratings[index - 1] < ratings[index]))) { count[index] = count[index - 1] + 1; } else { if (count[index - 1] > count[index + 1]) { count[index] = count[index - 1] + 1; } else { count[index] = count[index + 1] + 1; } } } } } int result = 0; for (int c : count) { result += c; } return result; }

public int sample_funcname ( int [ ] var_0 ) { if ( var_0 . length == 1 ) return 1 ; PriorityQueue < Integer > var_3 = new PriorityQueue < > ( ( var_1 , var_2 ) -> Integer . compare ( var_0 [ var_1 ] , var_0 [ var_2 ] ) ) ; for ( int var_4 = 0 ; var_4 < var_0 . length ; var_4 ++ ) { var_3 . offer ( var_4 ) ; } int [ ] var_5 = new int [ var_0 . length ] ; while ( ! var_3 . isEmpty ( ) ) { int var_6 = var_3 . poll ( ) ; if ( var_6 - 1 < 0 ) { if ( var_0 [ var_6 + 1 ] == var_0 [ var_6 ] ) { var_5 [ var_6 ] = 1 ; } else { var_5 [ var_6 ] = var_5 [ var_6 + 1 ] + 1 ; } } else if ( var_6 + 1 >= var_0 . length ) { if ( var_0 [ var_6 - 1 ] == var_0 [ var_6 ] ) { var_5 [ var_6 ] = 1 ; } else { var_5 [ var_6 ] = var_5 [ var_6 - 1 ] + 1 ; } } else { if ( ( var_0 [ var_6 - 1 ] == var_0 [ var_6 ] ) && ( var_0 [ var_6 + 1 ] == var_0 [ var_6 ] ) ) { var_5 [ var_6 ] = 1 ; } else { if ( ( ( var_0 [ var_6 - 1 ] == var_0 [ var_6 ] ) && ( var_0 [ var_6 + 1 ] > var_0 [ var_6 ] ) ) || ( ( var_0 [ var_6 + 1 ] == var_0 [ var_6 ] ) && ( var_0 [ var_6 - 1 ] > var_0 [ var_6 ] ) ) ) { var_5 [ var_6 ] = 1 ; } else if ( ( ( var_0 [ var_6 - 1 ] == var_0 [ var_6 ] ) && ( var_0 [ var_6 + 1 ] < var_0 [ var_6 ] ) ) ) { var_5 [ var_6 ] = var_5 [ var_6 + 1 ] + 1 ; } else if ( ( ( var_0 [ var_6 + 1 ] == var_0 [ var_6 ] ) && ( var_0 [ var_6 - 1 ] < var_0 [ var_6 ] ) ) ) { var_5 [ var_6 ] = var_5 [ var_6 - 1 ] + 1 ; } else { if ( var_5 [ var_6 - 1 ] > var_5 [ var_6 + 1 ] ) { var_5 [ var_6 ] = var_5 [ var_6 - 1 ] + 1 ; } else { var_5 [ var_6 ] = var_5 [ var_6 + 1 ] + 1 ; } } } } } int var_7 = 0 ; for ( int var_8 : var_5 ) { var_7 += var_8 ; } return var_7 ; }

1<SEP>0

<gouthampradhan>string_MultiplyStrings_1.java

private String add(String s1, String s2) { String result = ""; int carry = 0; int i = s1.length() - 1, j = s2.length() - 1; for (; i >= 0 || j >= 0; i--, j--) { int l = (i >= 0) ? Integer.parseInt(String.valueOf(s1.charAt(i))) : 0; int r = (j >= 0) ? Integer.parseInt(String.valueOf(s2.charAt(j))) : 0; int sum = l + r + carry; carry = sum / 10; result = sum % 10 + result; } if (carry > 0) { result = carry + result; } return result; }

private String var_0 ( String var_1 , String var_2 ) { String var_3 = "" ; int var_4 = 0 ; int var_5 = var_1 . length ( ) - 1 , var_6 = var_2 . length ( ) - 1 ; for ( ; var_5 >= 0 || var_6 >= 0 ; var_5 -- , var_6 -- ) { int var_7 = ( var_5 >= 0 ) ? Integer . parseInt ( String . valueOf ( var_1 . charAt ( var_5 ) ) ) : 0 ; int var_8 = ( var_6 >= 0 ) ? Integer . parseInt ( String . valueOf ( var_2 . charAt ( var_6 ) ) ) : 0 ; int var_9 = var_7 + var_8 + var_4 ; var_4 = var_9 / 10 ; var_3 = var_9 % 10 + var_3 ; } if ( var_4 > 0 ) { var_3 = var_4 + var_3 ; } return var_3 ; }

10<SEP>0<SEP><D_QUOTE><D_QUOTE><SEP>1

<gouthampradhan>dynamic_programming_NonNegativeIntegersWithoutConsecutiveOnes_1.java

public int findIntegers(int num) { int msbIndex = 0; for (int i = 0; i < 31; i++) { if (((1 << i) & num) > 0) { msbIndex = i; } } int[][] DP1 = new int[2][msbIndex + 1]; int[][] DP2 = new int[2][msbIndex + 2]; for (int i = msbIndex; i >= 0; i--) { if (i == msbIndex) { DP1[0][msbIndex] = 1; DP1[1][msbIndex] = 1; } else { DP1[0][i] = DP1[0][i + 1] + DP1[1][i + 1]; DP1[1][i] = DP1[0][i + 1]; } } int[] bits = new int[msbIndex + 1]; boolean bitFlipped = false; for (int i = msbIndex, j = 0; i >= 0; i--, j++) { if (j == 0) { bits[j] = 1; } else { if (bitFlipped) { bits[j] = bits[j - 1] == 0 ? 1 : 0; } else { if (((1 << i) & num) > 0) { if (bits[j - 1] > 0) { bits[j] = 0; bitFlipped = true; } else bits[j] = 1; } } } } DP2[0][msbIndex + 1] = 1; for (int i = bits.length - 1; i >= 0; i--) { if (bits[i] == 0) { DP2[0][i] = DP2[0][i + 1] + DP2[1][i + 1]; if (bits[i - 1] == 0) { DP2[1][i] = (i == bits.length - 1) ? 1 : DP1[0][i + 1]; } } else { DP2[1][i] = DP2[0][i + 1]; } } return (DP1[0][0] + DP1[1][0]) - (DP2[0][0] + DP2[1][0]) + 1; }

public int sample_funcname ( int var_0 ) { int var_1 = 0 ; for ( int var_2 = 0 ; var_2 < 31 ; var_2 ++ ) { if ( ( ( 1 << var_2 ) & var_0 ) > 0 ) { var_1 = var_2 ; } } int [ ] [ ] var_3 = new int [ 2 ] [ var_1 + 1 ] ; int [ ] [ ] var_4 = new int [ 2 ] [ var_1 + 2 ] ; for ( int var_2 = var_1 ; var_2 >= 0 ; var_2 -- ) { if ( var_2 == var_1 ) { var_3 [ 0 ] [ var_1 ] = 1 ; var_3 [ 1 ] [ var_1 ] = 1 ; } else { var_3 [ 0 ] [ var_2 ] = var_3 [ 0 ] [ var_2 + 1 ] + var_3 [ 1 ] [ var_2 + 1 ] ; var_3 [ 1 ] [ var_2 ] = var_3 [ 0 ] [ var_2 + 1 ] ; } } int [ ] var_5 = new int [ var_1 + 1 ] ; boolean var_7 = false ; for ( int var_2 = var_1 , var_6 = 0 ; var_2 >= 0 ; var_2 -- , var_6 ++ ) { if ( var_6 == 0 ) { var_5 [ var_6 ] = 1 ; } else { if ( var_7 ) { var_5 [ var_6 ] = var_5 [ var_6 - 1 ] == 0 ? 1 : 0 ; } else { if ( ( ( 1 << var_2 ) & var_0 ) > 0 ) { if ( var_5 [ var_6 - 1 ] > 0 ) { var_5 [ var_6 ] = 0 ; var_7 = true ; } else var_5 [ var_6 ] = 1 ; } } } } var_4 [ 0 ] [ var_1 + 1 ] = 1 ; for ( int var_2 = var_5 . length - 1 ; var_2 >= 0 ; var_2 -- ) { if ( var_5 [ var_2 ] == 0 ) { var_4 [ 0 ] [ var_2 ] = var_4 [ 0 ] [ var_2 + 1 ] + var_4 [ 1 ] [ var_2 + 1 ] ; if ( var_5 [ var_2 - 1 ] == 0 ) { var_4 [ 1 ] [ var_2 ] = ( var_2 == var_5 . length - 1 ) ? 1 : var_3 [ 0 ] [ var_2 + 1 ] ; } } else { var_4 [ 1 ] [ var_2 ] = var_4 [ 0 ] [ var_2 + 1 ] ; } } return ( var_3 [ 0 ] [ 0 ] + var_3 [ 1 ] [ 0 ] ) - ( var_4 [ 0 ] [ 0 ] + var_4 [ 1 ] [ 0 ] ) + 1 ; }

31<SEP>2<SEP>0<SEP>1

<gouthampradhan>dynamic_programming_BombEnemy_1.java

public int maxKilledEnemies(char[][] grid) { int[][] DP1 = new int[grid.length][grid[0].length]; int[][] DP2 = new int[grid.length][grid[0].length]; for (int i = 0; i < grid.length; i++) { for (int j = 0; j < grid[0].length; j++) { if (grid[i][j] == 'E') { DP1[i][j] = 1; } if (grid[i][j] != 'W') { if (j - 1 >= 0) { DP1[i][j] += DP1[i][j - 1]; } if (i - 1 >= 0) { DP1[i][j] += DP1[i - 1][j]; } } } } for (int i = grid.length - 1; i >= 0; i--) { for (int j = grid[0].length - 1; j >= 0; j--) { if (grid[i][j] == 'E') { DP2[i][j] = 1; } if (grid[i][j] != 'W') { if (j + 1 < grid[0].length) { DP2[i][j] += DP2[i][j + 1]; } if (i + 1 < grid.length) { DP2[i][j] += DP2[i + 1][j]; } } } } int max = 0; for (int i = 0; i < grid.length; i++) { for (int j = 0; j < grid[0].length; j++) { if (grid[i][j] == '0') { max = Math.max(max, DP1[i][j] + DP2[i][j]); } } } return max; }

public int sample_funcname ( char [ ] [ ] var_0 ) { int [ ] [ ] var_1 = new int [ var_0 . length ] [ var_0 [ 0 ] . length ] ; int [ ] [ ] var_2 = new int [ var_0 . length ] [ var_0 [ 0 ] . length ] ; for ( int var_3 = 0 ; var_3 < var_0 . length ; var_3 ++ ) { for ( int var_4 = 0 ; var_4 < var_0 [ 0 ] . length ; var_4 ++ ) { if ( var_0 [ var_3 ] [ var_4 ] == 'E' ) { var_1 [ var_3 ] [ var_4 ] = 1 ; } if ( var_0 [ var_3 ] [ var_4 ] != 'W' ) { if ( var_4 - 1 >= 0 ) { var_1 [ var_3 ] [ var_4 ] += var_1 [ var_3 ] [ var_4 - 1 ] ; } if ( var_3 - 1 >= 0 ) { var_1 [ var_3 ] [ var_4 ] += var_1 [ var_3 - 1 ] [ var_4 ] ; } } } } for ( int var_3 = var_0 . length - 1 ; var_3 >= 0 ; var_3 -- ) { for ( int var_4 = var_0 [ 0 ] . length - 1 ; var_4 >= 0 ; var_4 -- ) { if ( var_0 [ var_3 ] [ var_4 ] == 'E' ) { var_2 [ var_3 ] [ var_4 ] = 1 ; } if ( var_0 [ var_3 ] [ var_4 ] != 'W' ) { if ( var_4 + 1 < var_0 [ 0 ] . length ) { var_2 [ var_3 ] [ var_4 ] += var_2 [ var_3 ] [ var_4 + 1 ] ; } if ( var_3 + 1 < var_0 . length ) { var_2 [ var_3 ] [ var_4 ] += var_2 [ var_3 + 1 ] [ var_4 ] ; } } } } int max = 0 ; for ( int var_3 = 0 ; var_3 < var_0 . length ; var_3 ++ ) { for ( int var_4 = 0 ; var_4 < var_0 [ 0 ] . length ; var_4 ++ ) { if ( var_0 [ var_3 ] [ var_4 ] == '0' ) { max = Math . max ( max , var_1 [ var_3 ] [ var_4 ] + var_2 [ var_3 ] [ var_4 ] ) ; } } } return max ; }

0<SEP>1<SEP><S_QUOTE>E<S_QUOTE><SEP><S_QUOTE>0<S_QUOTE><SEP><S_QUOTE>W<S_QUOTE>

<gouthampradhan>hashing_MaximumSizeSubarraySumEqualsk_1.java

public int maxSubArrayLen(int[] nums, int k) { Map<Integer, Integer> index = new HashMap<>(); int sum = 0; for (int i = 0; i < nums.length; i++) { sum += nums[i]; index.putIfAbsent(sum, i); } sum = 0; int ans = 0; for (int i = 0; i < nums.length; i++) { sum += nums[i]; if (sum == k) { ans = Math.max(ans, i + 1); } else { int exp = sum - k; if (index.containsKey(exp)) { int farLeft = index.get(exp); if (farLeft < i) { ans = Math.max(ans, i - index.get(exp)); } } } } return ans; }

public int sample_funcname ( int [ ] var_0 , int var_1 ) { Map < Integer , Integer > var_2 = new HashMap < > ( ) ; int var_3 = 0 ; for ( int var_4 = 0 ; var_4 < var_0 . length ; var_4 ++ ) { var_3 += var_0 [ var_4 ] ; var_2 . putIfAbsent ( var_3 , var_4 ) ; } var_3 = 0 ; int var_5 = 0 ; for ( int var_4 = 0 ; var_4 < var_0 . length ; var_4 ++ ) { var_3 += var_0 [ var_4 ] ; if ( var_3 == var_1 ) { var_5 = Math . max ( var_5 , var_4 + 1 ) ; } else { int var_6 = var_3 - var_1 ; if ( var_2 . containsKey ( var_6 ) ) { int var_7 = var_2 . get ( var_6 ) ; if ( var_7 < var_4 ) { var_5 = Math . max ( var_5 , var_4 - var_2 . get ( var_6 ) ) ; } } } } return var_5 ; }

0<SEP>1

<gouthampradhan>string_RepeatedSubstringPattern_1.java

public boolean repeatedSubstringPattern(String s) { boolean found; for (int i = 1, l = s.length(); i < l; i++) { found = true; String subI = s.substring(0, i); int j = i; if (j >= l) return false; while (j < l) { if ((j + i) >= l + 1) return false; String subJ = s.substring(j, j + i); if (!subI.equals(subJ)) { found = false; break; } j += i; } if (found) return true; } return false; }

public boolean var_0 ( String var_1 ) { boolean var_2 ; for ( int var_3 = 1 , var_4 = var_1 . length ( ) ; var_3 < var_4 ; var_3 ++ ) { var_2 = true ; String var_5 = var_1 . substring ( 0 , var_3 ) ; int var_6 = var_3 ; if ( var_6 >= var_4 ) return false ; while ( var_6 < var_4 ) { if ( ( var_6 + var_3 ) >= var_4 + 1 ) return false ; String var_7 = var_1 . substring ( var_6 , var_6 + var_3 ) ; if ( ! var_5 . equals ( var_7 ) ) { var_2 = false ; break ; } var_6 += var_3 ; } if ( var_2 ) return true ; } return false ; }

1<SEP>0

<gouthampradhan>dynamic_programming_StoneGame_1.java

private int dp(int[][] A, int[] piles, int i, int j, int sum, int p, int sumA, int sumB) { if (A[p][sum] != -1) return A[p][sum]; else { if (p == 0) { if (i <= j) { int result = dp(A, piles, i + 1, j, sum - piles[i], (p + 1) % 2, sumA + piles[i], sumB); if (result == 0) { A[p][sum] = 1; return 1; } else { result = dp(A, piles, i, j - 1, sum - piles[j], (p + 1) % 2, sumA + piles[j], sumB); A[p][sum] = result; return result; } } else { if (sumA > sumB) return 1; else return 0; } } else { if (i <= j) { int result = dp(A, piles, i + 1, j, sum - piles[i], (p + 1) % 2, sumA, sumB + piles[i]); if (result == 0) { A[p][sum] = 1; return 1; } else { result = dp(A, piles, i, j - 1, sum - piles[j], (p + 1) % 2, sumA, sumB + piles[j]); A[p][sum] = result; return result; } } else { if (sumB > sumA) return 1; else return 0; } } } }

private int sample_funcname ( int [ ] [ ] A , int [ ] piles , int i , int j , int sum , int p , int sumA , int sumB ) { if ( A [ p ] [ sum ] != - 1 ) return A [ p ] [ sum ] ; else { if ( p == 0 ) { if ( i <= j ) { int result = dp ( A , piles , i + 1 , j , sum - piles [ i ] , ( p + 1 ) % 2 , sumA + piles [ i ] , sumB ) ; if ( result == 0 ) { A [ p ] [ sum ] = 1 ; return 1 ; } else { result = dp ( A , piles , i , j - 1 , sum - piles [ j ] , ( p + 1 ) % 2 , sumA + piles [ j ] , sumB ) ; A [ p ] [ sum ] = result ; return result ; } } else { if ( sumA > sumB ) return 1 ; else return 0 ; } } else { if ( i <= j ) { int result = dp ( A , piles , i + 1 , j , sum - piles [ i ] , ( p + 1 ) % 2 , sumA , sumB + piles [ i ] ) ; if ( result == 0 ) { A [ p ] [ sum ] = 1 ; return 1 ; } else { result = dp ( A , piles , i , j - 1 , sum - piles [ j ] , ( p + 1 ) % 2 , sumA , sumB + piles [ j ] ) ; A [ p ] [ sum ] = result ; return result ; } } else { if ( sumB > sumA ) return 1 ; else return 0 ; } } } }

1<SEP>0<SEP>2

<gouthampradhan>hashing_BrickWall_1.java

public int leastBricks(List<List<Integer>> wall) { for (List<Integer> row : wall) { int prefix = 0; for (int i = 0, l = row.size(); i < l; i++) { prefix += row.get(i); row.set(i, prefix); } } int result = Integer.MIN_VALUE; Map<Integer, Integer> map = new HashMap<>(); for (List<Integer> row : wall) { for (int i = 0, l = row.size(); i < l - 1; i++) { int prefix = row.get(i); if (map.containsKey(prefix)) { int plusOne = map.get(prefix) + 1; map.put(prefix, plusOne); result = Math.max(result, plusOne); } else { map.put(prefix, 1); result = Math.max(result, 1); } } } return (result == Integer.MIN_VALUE) ? wall.size() : wall.size() - result; }

public int sample_funcname ( List < List < Integer >> var_0 ) { for ( List < Integer > var_1 : var_0 ) { int var_2 = 0 ; for ( int var_3 = 0 , var_4 = var_1 . size ( ) ; var_3 < var_4 ; var_3 ++ ) { var_2 += var_1 . get ( var_3 ) ; var_1 . set ( var_3 , var_2 ) ; } } int var_5 = Integer . MIN_VALUE ; Map < Integer , Integer > var_6 = new HashMap < > ( ) ; for ( List < Integer > var_1 : var_0 ) { for ( int var_3 = 0 , var_4 = var_1 . size ( ) ; var_3 < var_4 - 1 ; var_3 ++ ) { int var_2 = var_1 . get ( var_3 ) ; if ( var_6 . containsKey ( var_2 ) ) { int var_7 = var_6 . get ( var_2 ) + 1 ; var_6 . put ( var_2 , var_7 ) ; var_5 = Math . max ( var_5 , var_7 ) ; } else { var_6 . put ( var_2 , 1 ) ; var_5 = Math . max ( var_5 , 1 ) ; } } } return ( var_5 == Integer . MIN_VALUE ) ? var_0 . size ( ) : var_0 . size ( ) - var_5 ; }

0<SEP>1

<gouthampradhan>backtracking_GenerateParentheses_1.java

private void backTrack(List<String> list, String str, int open, int close, int n) { if (str.length() == n * 2) { list.add(str); } else { if (open < n) backTrack(list, str.concat("("), open + 1, close, n); if (close < open) backTrack(list, str.concat(")"), open, close + 1, n); } }

private void sample_funcname ( List < String > list , String str , int open , int close , int n ) { if ( str . length ( ) == n * 2 ) { list . add ( str ) ; } else { if ( open < n ) backTrack ( list , str . concat ( "(" ) , open + 1 , close , n ) ; if ( close < open ) backTrack ( list , str . concat ( ")" ) , open , close + 1 , n ) ; } }

<D_QUOTE>(<D_QUOTE><SEP><D_QUOTE>)<D_QUOTE><SEP>1<SEP>2

<gouthampradhan>dynamic_programming_NumberOfLIS_1.java

public int findNumberOfLIS(int[] nums) { if (nums.length == 0) return 0; int[] length = new int[nums.length]; length[0] = 1; int maxVal = 1; for (int i = 1; i < nums.length; i++) { int max = 1; for (int j = 0; j < i; j++) { if (nums[i] > nums[j]) { max = Math.max(max, length[j] + 1); maxVal = Math.max(maxVal, max); } } length[i] = max; } int[] count = new int[nums.length]; count[0] = 1; for (int i = 1; i < length.length; i++) { for (int j = 0; j < i; j++) { if ((length[j] + 1 == length[i]) && (nums[j] < nums[i])) { count[i] += count[j]; } } if (count[i] == 0) { count[i] = 1; } } int ans = 0; for (int i = 0; i < length.length; i++) { if (length[i] == maxVal) { ans += count[i]; } } return ans; }

public int sample_funcname ( int [ ] var_0 ) { if ( var_0 . length == 0 ) return 0 ; int [ ] length = new int [ var_0 . length ] ; length [ 0 ] = 1 ; int var_1 = 1 ; for ( int var_2 = 1 ; var_2 < var_0 . length ; var_2 ++ ) { int max = 1 ; for ( int var_3 = 0 ; var_3 < var_2 ; var_3 ++ ) { if ( var_0 [ var_2 ] > var_0 [ var_3 ] ) { max = Math . max ( max , length [ var_3 ] + 1 ) ; var_1 = Math . max ( var_1 , max ) ; } } length [ var_2 ] = max ; } int [ ] var_4 = new int [ var_0 . length ] ; var_4 [ 0 ] = 1 ; for ( int var_2 = 1 ; var_2 < length . length ; var_2 ++ ) { for ( int var_3 = 0 ; var_3 < var_2 ; var_3 ++ ) { if ( ( length [ var_3 ] + 1 == length [ var_2 ] ) && ( var_0 [ var_3 ] < var_0 [ var_2 ] ) ) { var_4 [ var_2 ] += var_4 [ var_3 ] ; } } if ( var_4 [ var_2 ] == 0 ) { var_4 [ var_2 ] = 1 ; } } int var_5 = 0 ; for ( int var_2 = 0 ; var_2 < length . length ; var_2 ++ ) { if ( length [ var_2 ] == var_1 ) { var_5 += var_4 [ var_2 ] ; } } return var_5 ; }

0<SEP>1

<gouthampradhan>greedy_JumpGame_1.java

public boolean canJump(int[] nums) { if (nums.length == 0) return false; int min = nums.length - 1, max = nums.length - 1; for (int i = nums.length - 2; i >= 0; i--) { if ((nums[i] + i) >= min) min = i; } return (min == 0); }

public boolean var_0 ( int [ ] var_1 ) { if ( var_1 . length == 0 ) return false ; int var_2 = var_1 . length - 1 , var_3 = var_1 . length - 1 ; for ( int var_4 = var_1 . length - 2 ; var_4 >= 0 ; var_4 -- ) { if ( ( var_1 [ var_4 ] + var_4 ) >= var_2 ) var_2 = var_4 ; } return ( var_2 == 0 ) ; }

2<SEP>0<SEP>1

<gouthampradhan>dynamic_programming_ConcatenatedWords_1.java

private boolean concatenatedWordsPossible(String word, Set<String> dictionary) { boolean[] D = new boolean[word.length() + 1]; D[word.length()] = true; dictionary.remove(word); for (int i = word.length() - 1; i >= 0; i--) { for (int j = i, l = word.length(); j < l; j++) { String subStr = word.substring(i, j + 1); if (dictionary.contains(subStr) && D[j + 1]) { D[i] = true; break; } } } dictionary.add(word); return D[0]; }

private boolean var_0 ( String var_1 , Set < String > var_2 ) { boolean [ ] var_3 = new boolean [ var_1 . length ( ) + 1 ] ; var_3 [ var_1 . length ( ) ] = true ; var_2 . remove ( var_1 ) ; for ( int var_4 = var_1 . length ( ) - 1 ; var_4 >= 0 ; var_4 -- ) { for ( int var_5 = var_4 , var_6 = var_1 . length ( ) ; var_5 < var_6 ; var_5 ++ ) { String var_7 = var_1 . substring ( var_4 , var_5 + 1 ) ; if ( var_2 . contains ( var_7 ) && var_3 [ var_5 + 1 ] ) { var_3 [ var_4 ] = true ; break ; } } } var_2 . add ( var_1 ) ; return var_3 [ 0 ] ; }

1<SEP>0

<gouthampradhan>hashing_GroupsOfSpecialEquivalentStrings_1.java

public int numSpecialEquivGroups(String[] A) { Set<String> set = new HashSet<>(); for (String s : A) { StringBuilder temp1 = new StringBuilder(); for (int i = 0, l = s.length(); i < l; i += 2) { char c = s.charAt(i); temp1.append(c); } StringBuilder temp2 = new StringBuilder(); if (s.length() > 1) { for (int i = 1, l = s.length(); i < l; i += 2) { char c = s.charAt(i); temp2.append(c); } } char[] temp1Chars = temp1.toString().toCharArray(); char[] temp2Chars = temp2.toString().toCharArray(); Arrays.sort(temp1Chars); Arrays.sort(temp2Chars); set.add(String.valueOf(temp1Chars) + "+" + String.valueOf(temp2Chars)); } return set.size(); }

public int sample_funcname ( String [ ] var_0 ) { Set < String > var_1 = new HashSet < > ( ) ; for ( String var_2 : var_0 ) { StringBuilder var_3 = new StringBuilder ( ) ; for ( int var_4 = 0 , var_5 = var_2 . length ( ) ; var_4 < var_5 ; var_4 += 2 ) { char var_6 = var_2 . charAt ( var_4 ) ; var_3 . append ( var_6 ) ; } StringBuilder var_7 = new StringBuilder ( ) ; if ( var_2 . length ( ) > 1 ) { for ( int var_4 = 1 , var_5 = var_2 . length ( ) ; var_4 < var_5 ; var_4 += 2 ) { char var_6 = var_2 . charAt ( var_4 ) ; var_7 . append ( var_6 ) ; } } char [ ] var_8 = var_3 . toString ( ) . toCharArray ( ) ; char [ ] var_9 = var_7 . toString ( ) . toCharArray ( ) ; Arrays . sort ( var_8 ) ; Arrays . sort ( var_9 ) ; var_1 . add ( String . valueOf ( var_8 ) + "+" + String . valueOf ( var_9 ) ) ; } return var_1 . size ( ) ; }

<D_QUOTE>+<D_QUOTE><SEP>0<SEP>1<SEP>2

<gouthampradhan>string_ShortestPalindrome_1.java

boolean isPaliandrome(String s, int x, int y) { for (int i = x, j = y; i < j; i++, j--) { if (s.charAt(i) != s.charAt(j)) return false; } return true; }

boolean var_0 ( String 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 -- ) { if ( var_1 . charAt ( var_4 ) != var_1 . charAt ( var_5 ) ) return false ; } return true ; }

<gouthampradhan>string_SimplifyPath_1.java

public String simplifyPath(String path) { if (path == null || path.isEmpty()) return "/"; StringTokenizer st = new StringTokenizer(path, "/"); Deque<String> dQueue = new ArrayDeque<>(); while (st.hasMoreTokens()) { String token = st.nextToken(); if (token.trim().equals("..")) { if (!dQueue.isEmpty()) dQueue.pop(); } else if (token.trim().equals(".")) { } else dQueue.push(token); } if (dQueue.isEmpty()) return "/"; StringBuilder finalStr = new StringBuilder(); while (!dQueue.isEmpty()) { finalStr.append("/").append(dQueue.removeLast()); } return finalStr.toString(); }

public String var_0 ( String var_1 ) { if ( var_1 == null || var_1 . isEmpty ( ) ) return "/" ; StringTokenizer var_2 = new StringTokenizer ( var_1 , "/" ) ; Deque < String > var_3 = new ArrayDeque < > ( ) ; while ( var_2 . hasMoreTokens ( ) ) { String var_4 = var_2 . nextToken ( ) ; if ( var_4 . trim ( ) . equals ( ".." ) ) { if ( ! var_3 . isEmpty ( ) ) var_3 . pop ( ) ; } else if ( var_4 . trim ( ) . equals ( "." ) ) { } else var_3 . push ( var_4 ) ; } if ( var_3 . isEmpty ( ) ) return "/" ; StringBuilder var_5 = new StringBuilder ( ) ; while ( ! var_3 . isEmpty ( ) ) { var_5 . append ( "/" ) . append ( var_3 . removeLast ( ) ) ; } return var_5 . toString ( ) ; }

<D_QUOTE>.<D_QUOTE><SEP><D_QUOTE>/<D_QUOTE><SEP><D_QUOTE>..<D_QUOTE>

<gouthampradhan>binary_search_ArmstrongNumber_1.java

private long power(int n, int p) { long res = 1L; for (int i = 0; i < p; i++) { res *= n; } return res; }

private long sample_funcname ( int var_0 , int var_1 ) { long var_2 = 1L ; for ( int var_3 = 0 ; var_3 < var_1 ; var_3 ++ ) { var_2 *= var_0 ; } return var_2 ; }

0

<gouthampradhan>string_ReverseWordsInAString_1.java

public String reverseWords(String s) { if (s == null || s.isEmpty()) return ""; StringBuilder sb = new StringBuilder(s.trim()); String reverse = sb.reverse().toString(); StringTokenizer st = new StringTokenizer(reverse, " "); List<String> list = new ArrayList<>(); while (st.hasMoreTokens()) { list.add(st.nextToken()); } for (int i = 0, l = list.size(); i < l; i++) { String str = list.get(i); String newStr = new StringBuilder(str).reverse().toString(); list.set(i, newStr); } StringBuilder result = new StringBuilder(); for (String str : list) { result.append(str).append(" "); } return result.toString().trim(); }

public String var_0 ( String var_1 ) { if ( var_1 == null || var_1 . isEmpty ( ) ) return "" ; StringBuilder var_2 = new StringBuilder ( var_1 . trim ( ) ) ; String reverse = var_2 . reverse ( ) . toString ( ) ; StringTokenizer var_3 = new StringTokenizer ( reverse , " " ) ; List < String > var_4 = new ArrayList < > ( ) ; while ( var_3 . hasMoreTokens ( ) ) { var_4 . add ( var_3 . nextToken ( ) ) ; } for ( int var_5 = 0 , var_6 = var_4 . size ( ) ; var_5 < var_6 ; var_5 ++ ) { String var_7 = var_4 . get ( var_5 ) ; String var_8 = new StringBuilder ( var_7 ) . reverse ( ) . toString ( ) ; var_4 . set ( var_5 , var_8 ) ; } StringBuilder var_9 = new StringBuilder ( ) ; for ( String var_7 : var_4 ) { var_9 . append ( var_7 ) . append ( " " ) ; } return var_9 . toString ( ) . trim ( ) ; }

0<SEP><D_QUOTE> <D_QUOTE><SEP><D_QUOTE><D_QUOTE>

<gouthampradhan>math_NthDigit_1.java

public int findNthDigit(int n) { if (n >= 1 && n <= 9) return n; long sum = 0L; for (int i = 0; ; i++) { long pow = (9 * (new Double(Math.pow(10, i)).longValue())) * (i + 1); sum += pow; if (sum >= n) { long diff = (long) n - (sum - pow); long num = diff / (i + 1); long mod = diff % (i + 1); long result = new Double(Math.pow(10, i)).intValue() + (num - 1) + (mod > 0 ? 1 : 0); String resultStr = String.valueOf(result); return (mod == 0) ? Integer.parseInt(String.valueOf(resultStr.charAt(resultStr.length() - 1))) : Integer.parseInt(String.valueOf(resultStr.charAt((int) mod - 1))); } } }

public int sample_funcname ( int var_0 ) { if ( var_0 >= 1 && var_0 <= 9 ) return var_0 ; long var_1 = 0L ; for ( int var_2 = 0 ; ; var_2 ++ ) { long pow = ( 9 * ( new Double ( Math . pow ( 10 , var_2 ) ) . longValue ( ) ) ) * ( var_2 + 1 ) ; var_1 += pow ; if ( var_1 >= var_0 ) { long var_3 = ( long ) var_0 - ( var_1 - pow ) ; long var_4 = var_3 / ( var_2 + 1 ) ; long var_5 = var_3 % ( var_2 + 1 ) ; long var_6 = new Double ( Math . pow ( 10 , var_2 ) ) . intValue ( ) + ( var_4 - 1 ) + ( var_5 > 0 ? 1 : 0 ) ; String var_7 = String . valueOf ( var_6 ) ; return ( var_5 == 0 ) ? Integer . parseInt ( String . valueOf ( var_7 . charAt ( var_7 . length ( ) - 1 ) ) ) : Integer . parseInt ( String . valueOf ( var_7 . charAt ( ( int ) var_5 - 1 ) ) ) ; } } }

10<SEP>0<SEP>1<SEP>9

<gouthampradhan>array_SortArrayByParityII_1.java

public int[] sortArrayByParityII(int[] A) { int[] R = new int[A.length]; int i = 0, j = 1; for (int a : A) { if (a % 2 == 0) { R[i] = a; i += 2; } else { R[j] = a; j += 2; } } return R; }

public int [ ] sample_funcname ( int [ ] var_0 ) { int [ ] var_1 = new int [ var_0 . length ] ; int var_2 = 0 , var_3 = 1 ; for ( int var_4 : var_0 ) { if ( var_4 % 2 == 0 ) { var_1 [ var_2 ] = var_4 ; var_2 += 2 ; } else { var_1 [ var_3 ] = var_4 ; var_3 += 2 ; } } return var_1 ; }

2<SEP>0<SEP>1

<gouthampradhan>binary_search_FirstBadVersion_1.java

private boolean isBadVersion(int n) { if (n >= 1702766719) return true; return false; }

private boolean var_0 ( int var_1 ) { if ( var_1 >= 1702766719 ) return true ; return false ; }

1702766719

<gouthampradhan>greedy_CourseScheduleIII_1.java

public int scheduleCourse(int[][] courses) { Arrays.sort(courses, (a, b) -> a[1] - b[1]); Queue<Integer> pq = new PriorityQueue<>((a, b) -> b - a); int time = 0; for (int[] course : courses) { time += course[0]; pq.add(course[0]); if (time > course[1]) time -= pq.poll(); } return pq.size(); }

public int sample_funcname ( int [ ] [ ] var_0 ) { Arrays . sort ( var_0 , ( var_1 , var_2 ) -> var_1 [ 1 ] - var_2 [ 1 ] ) ; Queue < Integer > var_3 = new PriorityQueue < > ( ( var_1 , var_2 ) -> var_2 - var_1 ) ; int var_4 = 0 ; for ( int [ ] var_5 : var_0 ) { var_4 += var_5 [ 0 ] ; var_3 . add ( var_5 [ 0 ] ) ; if ( var_4 > var_5 [ 1 ] ) var_4 -= var_3 . poll ( ) ; } return var_3 . size ( ) ; }

1<SEP>0

<gouthampradhan>divide_and_conquer_TwentyFourGame_1.java

private void swap(int i, int j, int[] nums) { int temp = nums[i]; nums[i] = nums[j]; nums[j] = temp; }

private void var_0 ( int var_1 , int var_2 , int [ ] var_3 ) { int var_4 = var_3 [ var_1 ] ; var_3 [ var_1 ] = var_3 [ var_2 ] ; var_3 [ var_2 ] = var_4 ; }

<gouthampradhan>bit_manipulation_GrayCode_1.java

public List<Integer> grayCode(int n) { List<Integer> result = new ArrayList<>(); for (int i = 0; i <= ((1 << n) - 1); i++) result.add(i ^ (i >> 1)); return result; }

public List < Integer > var_0 ( int var_1 ) { List < Integer > var_2 = new ArrayList < > ( ) ; for ( int var_3 = 0 ; var_3 <= ( ( 1 << var_1 ) - 1 ) ; var_3 ++ ) var_2 . add ( var_3 ^ ( var_3 >> 1 ) ) ; return var_2 ; }

0<SEP>1

<gouthampradhan>binary_search_MinSortedRotatedArray_1.java

public int findMin(int[] nums) { if (nums.length == 0) return 0; else if (nums.length == 1) return nums[0]; int low = 0, high = nums.length - 1; while (low < high) { int mid = (low + high) / 2; if (mid > 0 && nums[mid] < nums[mid - 1]) return nums[mid]; if (nums[low] > nums[mid]) high = mid - 1; else if (nums[high] < nums[mid]) low = mid + 1; else high = mid - 1; } return nums[low]; }

public int sample_funcname ( int [ ] var_0 ) { if ( var_0 . length == 0 ) return 0 ; else if ( var_0 . length == 1 ) return var_0 [ 0 ] ; int var_1 = 0 , var_2 = var_0 . length - 1 ; while ( var_1 < var_2 ) { int var_3 = ( var_1 + var_2 ) / 2 ; if ( var_3 > 0 && var_0 [ var_3 ] < var_0 [ var_3 - 1 ] ) return var_0 [ var_3 ] ; if ( var_0 [ var_1 ] > var_0 [ var_3 ] ) var_2 = var_3 - 1 ; else if ( var_0 [ var_2 ] < var_0 [ var_3 ] ) var_1 = var_3 + 1 ; else var_2 = var_3 - 1 ; } return var_0 [ var_1 ] ; }

2<SEP>0<SEP>1

<gouthampradhan>string_TextJustification_1.java

public List<String> fullJustify(String[] words, int L) { int wCount = 0, charCount = 0; List<String> line = new ArrayList<>(); List<String> result = new ArrayList<>(); StringBuilder sb = new StringBuilder(); for (int i = 0, l = words.length; i < l; i++) { String next = words[i]; if ((L - (charCount + wCount)) >= next.length()) { line.add(next); charCount += next.length(); wCount++; } else { sb.append(line.get(0)); StringBuilder space = new StringBuilder(); if (line.size() > 1) { int spaceCount = (L - charCount) / (wCount - 1); int remaining = (L - charCount) % (wCount - 1); for (int j = 0; j < spaceCount; j++) space.append(' '); for (int k = 1, kl = line.size(); k < kl; k++) { sb.append(space); if (remaining > 0) { sb.append(' '); --remaining; } sb.append(line.get(k)); } } else { int balance = L - (charCount + (wCount - 1)); for (int j = 0; j < balance; j++) sb.append(' '); } result.add(sb.toString()); sb = new StringBuilder(); line.clear(); line.add(next); charCount = next.length(); wCount = 1; } } if (!line.isEmpty()) { sb.append(line.get(0)); for (int i = 1, l = line.size(); i < l; i++) { sb.append(' '); sb.append(line.get(i)); } } int balance = L - (charCount + (wCount - 1)); for (int i = 0; i < balance; i++) sb.append(' '); result.add(sb.toString()); return result; }

public List < String > var_0 ( String [ ] var_1 , int var_2 ) { int var_3 = 0 , var_4 = 0 ; List < String > var_5 = new ArrayList < > ( ) ; List < String > var_6 = new ArrayList < > ( ) ; StringBuilder var_7 = new StringBuilder ( ) ; for ( int var_8 = 0 , var_9 = var_1 . length ; var_8 < var_9 ; var_8 ++ ) { String var_10 = var_1 [ var_8 ] ; if ( ( var_2 - ( var_4 + var_3 ) ) >= var_10 . length ( ) ) { var_5 . add ( var_10 ) ; var_4 += var_10 . length ( ) ; var_3 ++ ; } else { var_7 . append ( var_5 . get ( 0 ) ) ; StringBuilder var_11 = new StringBuilder ( ) ; if ( var_5 . size ( ) > 1 ) { int var_12 = ( var_2 - var_4 ) / ( var_3 - 1 ) ; int var_13 = ( var_2 - var_4 ) % ( var_3 - 1 ) ; for ( int var_14 = 0 ; var_14 < var_12 ; var_14 ++ ) var_11 . append ( ' ' ) ; for ( int var_15 = 1 , var_16 = var_5 . size ( ) ; var_15 < var_16 ; var_15 ++ ) { var_7 . append ( var_11 ) ; if ( var_13 > 0 ) { var_7 . append ( ' ' ) ; -- var_13 ; } var_7 . append ( var_5 . get ( var_15 ) ) ; } } else { int var_17 = var_2 - ( var_4 + ( var_3 - 1 ) ) ; for ( int var_14 = 0 ; var_14 < var_17 ; var_14 ++ ) var_7 . append ( ' ' ) ; } var_6 . add ( var_7 . toString ( ) ) ; var_7 = new StringBuilder ( ) ; var_5 . clear ( ) ; var_5 . add ( var_10 ) ; var_4 = var_10 . length ( ) ; var_3 = 1 ; } } if ( ! var_5 . isEmpty ( ) ) { var_7 . append ( var_5 . get ( 0 ) ) ; for ( int var_8 = 1 , var_9 = var_5 . size ( ) ; var_8 < var_9 ; var_8 ++ ) { var_7 . append ( ' ' ) ; var_7 . append ( var_5 . get ( var_8 ) ) ; } } int var_17 = var_2 - ( var_4 + ( var_3 - 1 ) ) ; for ( int var_8 = 0 ; var_8 < var_17 ; var_8 ++ ) var_7 . append ( ' ' ) ; var_6 . add ( var_7 . toString ( ) ) ; return var_6 ; }

0<SEP><S_QUOTE> <S_QUOTE><SEP>1

<gouthampradhan>binary_search_KokoEatingBananas_1.java

private boolean check(int[] piles, int H, int k) { for (int p : piles) { if (p <= k) { H--; } else { int q = p / k; if ((p % k) > 0) { q++; } H -= q; } if (H < 0) { return false; } } return true; }

private boolean var_0 ( int [ ] var_1 , int var_2 , int var_3 ) { for ( int var_4 : var_1 ) { if ( var_4 <= var_3 ) { var_2 -- ; } else { int var_5 = var_4 / var_3 ; if ( ( var_4 % var_3 ) > 0 ) { var_5 ++ ; } var_2 -= var_5 ; } if ( var_2 < 0 ) { return false ; } } return true ; }

0

<gouthampradhan>string_FindWordsThatCanBeFormedbyCharacters_1.java

public int countCharacters(String[] words, String chars) { Map<Character, Integer> countMap = new HashMap<>(); for (char c : chars.toCharArray()) { countMap.putIfAbsent(c, 0); countMap.put(c, countMap.get(c) + 1); } int ans = 0; for (String s : words) { Map<Character, Integer> subMap = new HashMap<>(); for (char c : s.toCharArray()) { subMap.putIfAbsent(c, 0); subMap.put(c, subMap.get(c) + 1); } boolean possible = true; for (char k : subMap.keySet()) { if (!countMap.containsKey(k) || subMap.get(k) > countMap.get(k)) { possible = false; break; } } if (possible) { ans += s.length(); } } return ans; }

public int sample_funcname ( String [ ] var_0 , String var_1 ) { Map < Character , Integer > var_2 = new HashMap < > ( ) ; for ( char var_3 : var_1 . toCharArray ( ) ) { var_2 . putIfAbsent ( var_3 , 0 ) ; var_2 . put ( var_3 , var_2 . get ( var_3 ) + 1 ) ; } int var_4 = 0 ; for ( String var_5 : var_0 ) { Map < Character , Integer > var_6 = new HashMap < > ( ) ; for ( char var_3 : var_5 . toCharArray ( ) ) { var_6 . putIfAbsent ( var_3 , 0 ) ; var_6 . put ( var_3 , var_6 . get ( var_3 ) + 1 ) ; } boolean var_8 = true ; for ( char var_7 : var_6 . keySet ( ) ) { if ( ! var_2 . containsKey ( var_7 ) || var_6 . get ( var_7 ) > var_2 . get ( var_7 ) ) { var_8 = false ; break ; } } if ( var_8 ) { var_4 += var_5 . length ( ) ; } } return var_4 ; }

0<SEP>1

<gouthampradhan>string_ReverseStringII_1.java

public String reverseStr(String s, int k) { StringBuilder sb = new StringBuilder(); for (int i = 0, l = s.length(); i < l; i++) { if (i % (2 * k) == 0) { int count = 0; StringBuilder temp = new StringBuilder(); while (count < k && i < l) { temp.append(s.charAt(i)); count++; i++; } sb.append(temp.reverse()); } if (i < l) { sb.append(s.charAt(i)); } } return sb.toString(); }

public String var_0 ( String var_1 , int var_2 ) { StringBuilder var_3 = new StringBuilder ( ) ; for ( int var_4 = 0 , var_5 = var_1 . length ( ) ; var_4 < var_5 ; var_4 ++ ) { if ( var_4 % ( 2 * var_2 ) == 0 ) { int var_6 = 0 ; StringBuilder var_7 = new StringBuilder ( ) ; while ( var_6 < var_2 && var_4 < var_5 ) { var_7 . append ( var_1 . charAt ( var_4 ) ) ; var_6 ++ ; var_4 ++ ; } var_3 . append ( var_7 . reverse ( ) ) ; } if ( var_4 < var_5 ) { var_3 . append ( var_1 . charAt ( var_4 ) ) ; } } return var_3 . toString ( ) ; }

0<SEP>2

<gouthampradhan>depth_first_search_CrackingTheSafe_2.java

private String dfs( String num, StringBuilder result, Set<String> done, int k, int states, int count) { done.add(num); if (states == count) { return result.toString(); } else { for (int i = 0; i < k; i++) { String newNum = (num + String.valueOf(i)); String newState = newNum.substring(1); if (!done.contains(newState)) { String retValue = dfs(newState, result.append(String.valueOf(i)), done, k, states, count + 1); if (!retValue.isEmpty()) { return retValue; } else { result.deleteCharAt(result.length() - 1); } } } } done.remove(num); return ""; }

private String sample_funcname ( String num , StringBuilder result , Set < String > done , int k , int states , int count ) { done . add ( num ) ; if ( states == count ) { return result . toString ( ) ; } else { for ( int i = 0 ; i < k ; i ++ ) { String newNum = ( num + String . valueOf ( i ) ) ; String newState = newNum . substring ( 1 ) ; if ( ! done . contains ( newState ) ) { String retValue = dfs ( newState , result . append ( String . valueOf ( i ) ) , done , k , states , count + 1 ) ; if ( ! retValue . isEmpty ( ) ) { return retValue ; } else { result . deleteCharAt ( result . length ( ) - 1 ) ; } } } } done . remove ( num ) ; return "" ; }

0<SEP><D_QUOTE><D_QUOTE><SEP>1

<gouthampradhan>heap_TheSkylineProblem_1.java

private int[] makeNewPoint(int x, int y) { int[] point = new int[2]; point[0] = x; point[1] = y; return point; }

private int [ ] sample_funcname ( int var_0 , int var_1 ) { int [ ] var_2 = new int [ 2 ] ; var_2 [ 0 ] = var_0 ; var_2 [ 1 ] = var_1 ; return var_2 ; }

0<SEP>1<SEP>2

<gouthampradhan>array_SubarraySumEqualsK_1.java

public int subarraySum(int[] nums, int k) { Map<Integer, Integer> map = new HashMap<>(); int sum = 0; for (int i : nums) { sum += i; Integer count = map.get(sum); if (count == null) { map.put(sum, 1); } else { map.put(sum, count + 1); } } sum = 0; int result = 0; for (int i : nums) { int key = sum + k; if (map.containsKey(key)) { int count = map.get(key); result += count; } sum += i; if (map.containsKey(sum)) { int count = map.get(sum); if (count - 1 > 0) { map.put(sum, count - 1); } else { map.remove(sum); } } } return result; }

public int sample_funcname ( int [ ] var_0 , int var_1 ) { Map < Integer , Integer > var_2 = new HashMap < > ( ) ; int var_3 = 0 ; for ( int var_4 : var_0 ) { var_3 += var_4 ; Integer var_5 = var_2 . get ( var_3 ) ; if ( var_5 == null ) { var_2 . put ( var_3 , 1 ) ; } else { var_2 . put ( var_3 , var_5 + 1 ) ; } } var_3 = 0 ; int var_6 = 0 ; for ( int var_4 : var_0 ) { int var_7 = var_3 + var_1 ; if ( var_2 . containsKey ( var_7 ) ) { int var_5 = var_2 . get ( var_7 ) ; var_6 += var_5 ; } var_3 += var_4 ; if ( var_2 . containsKey ( var_3 ) ) { int var_5 = var_2 . get ( var_3 ) ; if ( var_5 - 1 > 0 ) { var_2 . put ( var_3 , var_5 - 1 ) ; } else { var_2 . remove ( var_3 ) ; } } } return var_6 ; }

0<SEP>1

<gouthampradhan>array_ArrayPartitionI_1.java

public int arrayPairSum(int[] nums) { Arrays.sort(nums); int sum = 0; for (int i = 1; i < nums.length; i += 2) { sum += Math.min(nums[i - 1], nums[i]); } return sum; }

public int sample_funcname ( int [ ] var_0 ) { Arrays . sort ( var_0 ) ; int var_1 = 0 ; for ( int var_2 = 1 ; var_2 < var_0 . length ; var_2 += 2 ) { var_1 += Math . min ( var_0 [ var_2 - 1 ] , var_0 [ var_2 ] ) ; } return var_1 ; }

2<SEP>0<SEP>1

<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_2 = var_1 [ 0 ] ; var_1 [ 0 ] = 1 ; int var_3 = 0 , var_4 = 0 ; for ( int var_5 = 1 ; var_5 < var_1 . length ; var_5 ++ ) { switch ( var_1 [ var_5 ] ) { case 0 : var_1 [ var_3 ] = 0 ; var_1 [ var_4 + 1 ] = 1 ; if ( var_4 + 1 != var_5 ) { var_1 [ var_5 ] = 2 ; } var_3 ++ ; var_4 ++ ; break ; case 1 : var_1 [ var_4 + 1 ] = 1 ; if ( var_4 + 1 != var_5 ) { var_1 [ var_5 ] = 2 ; } var_4 ++ ; break ; } } if ( var_2 == 0 ) var_1 [ var_3 ] = 0 ; else if ( var_2 == 2 ) var_1 [ var_4 ] = 2 ; }

2<SEP>0<SEP>1

<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_3 = 0 ; for ( int var_4 = 0 ; var_4 < 31 ; var_4 ++ ) { if ( ( var_2 & ( 1 << var_4 ) ) > 0 ) { var_3 ++ ; } } return var_3 ; }

31<SEP>0<SEP>1

<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_2 = 1 ; var_2 < var_1 . length ; var_2 ++ ) { if ( var_1 [ var_2 ] < max ) { return false ; } else { max = Math . max ( max , var_1 [ var_2 - 1 ] ) ; } } return true ; }

0<SEP>1

<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 ; }

<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_0 ) { if ( var_0 == null || var_0 . isEmpty ( ) ) return 0 ; Map < Character , Integer > var_1 = new HashMap < > ( ) ; int var_2 = 0 , max = Integer . MIN_VALUE ; for ( int var_3 = 0 , var_4 = var_0 . length ( ) ; var_3 < var_4 ; var_3 ++ ) { if ( var_1 . keySet ( ) . contains ( var_0 . charAt ( var_3 ) ) ) { var_2 = Math . max ( var_1 . get ( var_0 . charAt ( var_3 ) ) + 1 , var_2 ) ; } var_1 . put ( var_0 . charAt ( var_3 ) , var_3 ) ; max = Math . max ( max , ( var_3 - var_2 ) + 1 ) ; } return max ; }

0<SEP>1

<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_1 ) { int var_2 = var_1 . length ( ) - 1 ; StringBuilder var_3 = new StringBuilder ( ) ; var_3 . append ( "1" ) ; for ( int var_4 = 0 ; var_4 < var_2 ; var_4 ++ ) { var_3 . append ( "0" ) ; } var_3 . append ( "1" ) ; return var_3 . toString ( ) ; }

<D_QUOTE>0<D_QUOTE><SEP>1<SEP>0<SEP><D_QUOTE>1<D_QUOTE>

<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_3 = new double [ var_1 + 1 ] [ var_1 + 1 ] ; var_3 [ 0 ] [ 0 ] = var_0 ; for ( int var_4 = 1 ; var_4 <= var_1 ; var_4 ++ ) { for ( int var_5 = 0 ; var_5 <= var_1 ; var_5 ++ ) { if ( var_3 [ var_4 - 1 ] [ var_5 ] > 1.0 ) { var_3 [ var_4 ] [ var_5 ] += ( var_3 [ var_4 - 1 ] [ var_5 ] - 1.0 ) / 2 ; } if ( var_5 == 0 ) continue ; if ( var_3 [ var_4 - 1 ] [ var_5 - 1 ] > 1.0 ) { var_3 [ var_4 ] [ var_5 ] += ( var_3 [ var_4 - 1 ] [ var_5 - 1 ] - 1.0 ) / 2 ; } } } if ( var_3 [ var_1 ] [ var_2 ] > 1.0 ) return 1 ; else return var_3 [ var_1 ] [ var_2 ] ; }

1<SEP>0<SEP>1.0<SEP>2

<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 ] ; }

0<SEP>1

<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_1 ) { int var_2 = 0 ; int var_3 = - 1 ; int var_4 = 1 ; for ( int var_5 = 1 , var_6 = var_1 . length ( ) ; var_5 < var_6 ; var_5 ++ ) { if ( var_3 != - 1 ) { if ( var_1 . charAt ( var_5 ) == var_1 . charAt ( var_4 ) ) { var_4 ++ ; } else if ( var_1 . charAt ( var_5 ) > var_1 . charAt ( var_4 ) ) { if ( var_1 . charAt ( var_5 ) > var_1 . charAt ( var_3 ) ) { var_2 = var_5 ; var_3 = - 1 ; var_4 = var_2 + 1 ; } else if ( var_1 . charAt ( var_5 ) == var_1 . charAt ( var_3 ) ) { var_2 = var_3 ; var_3 = var_5 ; var_4 = var_2 + 1 ; } else { var_2 = var_3 ; var_3 = - 1 ; var_4 = var_2 + 1 ; } } else { var_3 = - 1 ; var_4 = var_2 + 1 ; } } else { if ( var_1 . charAt ( var_5 ) > var_1 . charAt ( var_2 ) ) { var_2 = var_5 ; var_3 = - 1 ; var_4 = var_2 + 1 ; } else if ( var_1 . charAt ( var_5 ) == var_1 . charAt ( var_2 ) ) { var_3 = var_5 ; } } } return var_1 . substring ( var_2 ) ; }

0<SEP>1

<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_1 , String var_2 ) { if ( var_2 . isEmpty ( ) || var_1 . isEmpty ( ) ) return "" ; Map < Character , TreeSet < Integer >> var_3 = new HashMap < > ( ) ; for ( int var_4 = 0 , var_5 = var_1 . length ( ) ; var_4 < var_5 ; var_4 ++ ) { char var_6 = var_1 . charAt ( var_4 ) ; var_3 . putIfAbsent ( var_6 , new TreeSet < > ( ) ) ; var_3 . get ( var_6 ) . add ( var_4 ) ; } int var_7 = Integer . MAX_VALUE ; int var_8 = - 1 , var_9 ; int var_10 = - 1 , var_11 = - 1 ; boolean var_15 = false ; while ( true ) { int var_12 = var_8 ; var_9 = - 1 ; for ( int var_4 = 0 , var_5 = var_2 . length ( ) ; var_4 < var_5 ; var_4 ++ ) { char var_6 = var_2 . charAt ( var_4 ) ; if ( ! var_3 . containsKey ( var_6 ) ) { return "" ; } else { TreeSet < Integer > var_13 = var_3 . get ( var_6 ) ; Integer var_14 = var_13 . higher ( var_12 ) ; if ( var_14 == null ) { var_15 = true ; break ; } else { var_12 = var_14 ; if ( var_4 == 0 ) { var_8 = var_12 ; } if ( var_4 == var_5 - 1 ) { var_9 = var_12 ; } } } } if ( var_8 != - 1 && var_9 != - 1 ) { if ( ( var_9 - var_8 ) < var_7 ) { var_7 = var_9 - var_8 ; var_10 = var_8 ; var_11 = var_9 ; } } if ( var_15 ) return var_10 == - 1 ? "" : var_1 . substring ( var_10 , var_11 + 1 ) ; } }

0<SEP><D_QUOTE><D_QUOTE><SEP>1

<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_1 = new int [ var_0 + 1 ] ; for ( int var_2 = 2 ; var_2 <= var_0 ; var_2 ++ ) { var_1 [ var_2 ] = var_2 ; for ( int var_3 = 2 ; var_3 < var_2 ; var_3 ++ ) { if ( ( var_2 % var_3 ) == 0 ) { var_1 [ var_2 ] = Math . min ( var_1 [ var_2 ] , var_1 [ var_3 ] + ( var_2 / var_3 ) ) ; } } } return var_1 [ var_0 ] ; }

1<SEP>0<SEP>2

<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_2 = new TreeMap < > ( ) ; int var_3 = 0 ; for ( int var_4 : var_0 ) { var_2 . putIfAbsent ( var_4 , 0 ) ; var_2 . put ( var_4 , var_2 . get ( var_4 ) + 1 ) ; } Arrays . sort ( var_0 ) ; for ( int var_4 : var_0 ) { if ( var_2 . containsKey ( var_4 ) ) { int var_5 = var_2 . remove ( var_4 ) ; -- var_5 ; if ( var_5 != 0 ) { var_2 . put ( var_4 , var_5 ) ; } int var_6 = var_1 - var_4 ; Map . Entry < Integer , Integer > var_7 = var_2 . floorEntry ( var_6 ) ; if ( var_7 != null ) { int var_8 = var_7 . getValue ( ) ; -- var_8 ; var_2 . remove ( var_7 . getKey ( ) ) ; if ( var_8 != 0 ) { var_2 . put ( var_7 . getKey ( ) , var_8 ) ; } } var_3 ++ ; } } return var_3 ; }

0<SEP>1

<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_1 , int var_2 ) { long var_3 = 0 ; char var_4 = var_1 . charAt ( 0 ) ; for ( int var_5 = 0 , var_6 = var_1 . length ( ) ; var_5 < var_6 ; ) { char var_7 = var_1 . charAt ( var_5 ) ; if ( Character . isLetter ( var_7 ) ) { var_4 = var_7 ; var_3 ++ ; var_5 ++ ; if ( var_2 == var_3 ) break ; } else { long var_8 = ( var_3 * Integer . parseInt ( String . valueOf ( var_7 ) ) ) ; if ( var_8 == var_2 ) break ; else { if ( var_8 > var_2 ) { long var_9 = ( var_2 / var_3 ) ; if ( ( var_3 * var_9 ) == var_2 ) break ; var_2 -= ( var_3 * var_9 ) ; var_5 = 0 ; var_3 = 0 ; } else { var_3 = var_8 ; var_5 ++ ; } } } } return String . valueOf ( var_4 ) ; }

0

<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 ; } }

<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_1 , int var_2 , int var_3 , int var_4 ) { if ( var_1 . getOrDefault ( var_2 , 0 ) < Math . max ( var_3 , var_4 ) ) { var_1 . put ( var_2 , Math . max ( var_3 , var_4 ) ) ; } }

0

<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_2 = 0 , var_3 = var_0 . length - 1 ; while ( var_2 < var_3 ) { int var_4 = ( var_2 + var_3 ) >>> 1 ; if ( var_0 [ var_4 ] == var_1 ) return var_4 ; if ( ( var_0 [ var_4 ] <= var_0 [ var_2 ] ) && ( var_1 > var_0 [ var_4 ] && var_1 <= var_0 [ var_3 ] ) || ( var_0 [ var_2 ] <= var_0 [ var_4 ] && ( var_1 < var_0 [ var_2 ] || var_1 > var_0 [ var_4 ] ) ) ) var_2 = var_4 + 1 ; else var_3 = var_4 - 1 ; } return ( var_0 [ var_2 ] == var_1 ) ? var_2 : - 1 ; }

0<SEP>1

<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_0 , boolean var_1 , int var_2 , int var_3 ) { int [ ] var_4 = new int [ 2 ] ; if ( var_0 . contains ( "x" ) ) { var_0 = var_0 . substring ( 0 , var_0 . length ( ) - 1 ) ; if ( var_1 ) { var_2 -= var_0 . isEmpty ( ) ? 1 : Integer . parseInt ( var_0 ) ; } else { var_2 += var_0 . isEmpty ( ) ? 1 : Integer . parseInt ( var_0 ) ; } } else { if ( var_1 ) { var_3 -= Integer . parseInt ( var_0 ) ; } else { var_3 += Integer . parseInt ( var_0 ) ; } } var_4 [ 0 ] = var_2 ; var_4 [ 1 ] = var_3 ; return var_4 ; }

<D_QUOTE>x<D_QUOTE><SEP>0<SEP>1<SEP>2

<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_0 ) { int [ ] [ ] var_1 = new int [ var_0 . length ( ) + 1 ] [ var_0 . length ( ) + 1 ] ; String var_2 = new StringBuilder ( var_0 ) . reverse ( ) . toString ( ) ; for ( int var_3 = 1 , var_4 = var_0 . length ( ) ; var_3 <= var_4 ; var_3 ++ ) for ( int var_5 = 1 ; var_5 <= var_4 ; var_5 ++ ) { var_1 [ var_3 ] [ var_5 ] = ( var_0 . charAt ( var_3 - 1 ) == var_2 . charAt ( var_5 - 1 ) ) ? var_1 [ var_3 - 1 ] [ var_5 - 1 ] + 1 : Math . max ( var_1 [ var_3 - 1 ] [ var_5 ] , var_1 [ var_3 ] [ var_5 - 1 ] ) ; } return var_1 [ var_0 . length ( ) ] [ var_0 . length ( ) ] ; }

1

<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 ; }

0<SEP>9

<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_1 = 0 , var_2 = Integer . MIN_VALUE ; for ( int var_3 = 0 ; var_3 < var_0 . length ; var_3 ++ ) { if ( var_0 [ var_3 ] > var_2 ) { var_2 = var_0 [ var_3 ] ; var_1 = var_3 ; } } for ( int var_3 = 0 ; var_3 < var_0 . length ; var_3 ++ ) { if ( var_3 == var_1 ) continue ; if ( ( ( long ) var_0 [ var_3 ] * 2 ) > var_2 ) { return - 1 ; } } return var_1 ; }

0<SEP>1<SEP>2

<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_0 ( int var_1 ) { int var_2 = var_1 ; if ( var_2 == 0 ) return Arrays . asList ( 1 ) ; else if ( var_2 == 1 ) return Arrays . asList ( 1 , 1 ) ; else if ( var_2 == 2 ) return Arrays . asList ( 1 , 2 , 1 ) ; List < Integer > var_3 = new ArrayList < > ( ) ; var_3 . add ( 2 ) ; var_2 = var_2 - 2 ; int var_4 , var_5 ; while ( var_2 -- > 0 ) { var_4 = 1 ; int var_6 = 0 ; for ( int var_7 = var_3 . size ( ) ; var_6 < var_7 ; var_6 ++ ) { var_5 = var_3 . get ( var_6 ) ; var_3 . set ( var_6 , var_4 + var_5 ) ; var_4 = var_5 ; } var_3 . add ( var_4 + 1 ) ; } var_3 . add ( 0 , 1 ) ; var_3 . add ( 1 ) ; return var_3 ; }

2<SEP>0<SEP>1

<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 ; }

<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_1 ; if ( ( var_0 . length % 2 ) == 1 ) { var_1 = ( var_0 . length / 2 ) ; int var_2 = 0 ; for ( int var_3 = 0 ; var_3 < var_0 . length ; var_3 ++ ) { var_2 += Math . abs ( var_0 [ var_3 ] - var_0 [ var_1 ] ) ; } return var_2 ; } else { var_1 = ( var_0 . length / 2 ) - 1 ; int var_2 = 0 ; int min ; for ( int var_3 = 0 ; var_3 < var_0 . length ; var_3 ++ ) { var_2 += Math . abs ( var_0 [ var_3 ] - var_0 [ var_1 ] ) ; } min = var_2 ; var_2 = 0 ; var_1 = ( var_0 . length / 2 ) ; for ( int var_3 = 0 ; var_3 < var_0 . length ; var_3 ++ ) { var_2 += Math . abs ( var_0 [ var_3 ] - var_0 [ var_1 ] ) ; } min = Math . min ( min , var_2 ) ; return min ; } }

1<SEP>0<SEP>2

<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_1 = 0 ; int var_2 = var_0 . length ; for ( int var_3 : var_0 ) { var_1 += var_3 ; } int var_4 = ( ( ( var_2 + 1 ) ) * var_2 ) / 2 ; if ( var_4 == var_1 ) return 0 ; else return var_4 - var_1 ; }

2<SEP>0<SEP>1