SYMBOL INDEX (3448 symbols across 589 files) FILE: src/AccountsMerge721.java class AccountsMerge721 (line 38) | public class AccountsMerge721 { method accountsMerge (line 39) | public List> accountsMerge(List> accounts) { method accountsMerge (line 94) | public List> accountsMerge(List> accounts) { method initDSU (line 116) | private DSU initDSU(List> accounts, Map e... class DSU (line 139) | class DSU { method DSU (line 142) | public DSU(int size) { method find (line 147) | public int find(int x) { method union (line 152) | public void union(int x, int y) { method accountsMerge3 (line 161) | public List> accountsMerge3(List> accounts) { method initGraph (line 181) | private Map> initGraph(List> accounts... method dfs (line 202) | private void dfs(Map> graph, String email, Set merge(List intervals) { method addBoldTag5 (line 206) | public String addBoldTag5(String s, String[] dict) { method addBoldTag6 (line 230) | public String addBoldTag6(String s, String[] dict) { class Trie (line 258) | class Trie { method addWord (line 262) | public void addWord(String word) { method addWord (line 266) | public void addWord(char[] chars, int i) { method search (line 281) | public int search(char[] chars, int i) { method search (line 285) | private int search(char[] chars, int i, int x, int len) { FILE: src/AddOneRowToTree623.java class AddOneRowToTree623 (line 78) | public class AddOneRowToTree623 { method addOneRow (line 79) | public TreeNode addOneRow(TreeNode root, int v, int d) { method insert (line 91) | private void insert(TreeNode root, int v, int d) { method addOneRow3 (line 111) | public TreeNode addOneRow3(TreeNode root, int v, int d) { FILE: src/AddStrings415.java class AddStrings415 (line 13) | public class AddStrings415 { method addStrings (line 14) | public String addStrings(String num1, String num2) { method addStrings2 (line 39) | public String addStrings2(String num1, String num2) { FILE: src/AddTwoNumbers2.java class AddTwoNumbers2 (line 14) | public class AddTwoNumbers2 { method addTwoNumbers (line 15) | public ListNode addTwoNumbers(ListNode l1, ListNode l2) { method addTwoNumbers2 (line 36) | public ListNode addTwoNumbers2(ListNode l1, ListNode l2) { FILE: src/AddTwoNumbersII445.java class AddTwoNumbersII445 (line 28) | public class AddTwoNumbersII445 { method addTwoNumbers (line 29) | public ListNode addTwoNumbers(ListNode l1, ListNode l2) { method addTwoNumbers2 (line 82) | public ListNode addTwoNumbers2(ListNode l1, ListNode l2) { method addTwoNumbers0 (line 89) | public ListNode addTwoNumbers0(ListNode l1, ListNode l2) { method reverseList (line 110) | public ListNode reverseList(ListNode head) { FILE: src/AlienDictionary269.java class AlienDictionary269 (line 51) | public class AlienDictionary269 { method alienOrder (line 59) | public String alienOrder(String[] words) { method helper (line 74) | private boolean helper(Character key, Set path, boolean[] v... method initMap (line 88) | private void initMap(String[] words) { method updateOn (line 99) | private void updateOn(String word1, String word2) { method updateOrderMap (line 109) | private void updateOrderMap(String[] dicts) { method alienOrder2 (line 121) | public String alienOrder2(String[] words) { method alienOrder3 (line 164) | public String alienOrder3(String[] words) { method dfs (line 178) | public boolean dfs(boolean[][] adj, int[] visited, StringBuilder sb, i... method buildGraph (line 193) | public void buildGraph(String[] words, boolean[][] adj, int[] visited) { FILE: src/AllNodesDistanceKInBinaryTree863.java class AllNodesDistanceKInBinaryTree863 (line 38) | public class AllNodesDistanceKInBinaryTree863 { method distanceK (line 39) | public List distanceK(TreeNode root, TreeNode target, int K) { method distanceToRoot (line 50) | private int distanceToRoot(TreeNode root, TreeNode target, int K, List... method distanceKChildren (line 75) | private void distanceKChildren(TreeNode root, int K, List res) { method distanceK2 (line 99) | public List distanceK2(TreeNode root, TreeNode target, int K) { method dfs (line 143) | public void dfs(TreeNode node, TreeNode par) { method distanceK3 (line 158) | public List distanceK3(TreeNode root, TreeNode target, int K) { method dfs (line 167) | public int dfs(TreeNode node) { method subtree_add (line 190) | public void subtree_add(TreeNode node, int dist) { method distanceK4 (line 202) | public List distanceK4(TreeNode root, TreeNode target, int K) { method find (line 210) | private int find(TreeNode root, TreeNode target, int K) { method dfs (line 229) | private void dfs(TreeNode root, TreeNode target, int K, int length, Li... FILE: src/AllOOneDataStructure432.java class AllOOneDataStructure432 (line 18) | public class AllOOneDataStructure432 { class AllOne (line 20) | class AllOne { method AllOne (line 26) | public AllOne() { method inc (line 35) | public void inc(String key) { method dislink (line 65) | private void dislink(KeyNode node) { method dislink (line 70) | private void dislink(FreqNode node) { method addAfter (line 75) | private void addAfter(KeyNode node, KeyNode newNode) { method addAfter (line 82) | private void addAfter(FreqNode node, FreqNode newNode) { method dec (line 90) | public void dec(String key) { method addBefore (line 114) | private void addBefore(FreqNode node, FreqNode newNode) { method getMaxKey (line 122) | public String getMaxKey() { method getMinKey (line 128) | public String getMinKey() { method isEmpty (line 133) | private boolean isEmpty() { method isEmpty (line 137) | private boolean isEmpty(KeyNode node) { method isEmpty (line 141) | private boolean isEmpty(FreqNode node) { class KeyNode (line 145) | class KeyNode { method KeyNode (line 150) | KeyNode() { method KeyNode (line 152) | KeyNode(String key) { method KeyNode (line 156) | KeyNode(String key, int freq) { class FreqNode (line 162) | class FreqNode { method FreqNode (line 167) | FreqNode () { method FreqNode (line 169) | FreqNode (int freq) { FILE: src/AllPathsFromSourceToTarget797.java class AllPathsFromSourceToTarget797 (line 24) | public class AllPathsFromSourceToTarget797 { method allPathsSourceTarget (line 25) | public List> allPathsSourceTarget(int[][] graph) { method backtrace (line 33) | private void backtrace(int[][] graph, int current, int dest, List> allPathsSourceTarget2(int[][] graph) { method backtrace2 (line 59) | private void backtrace2(int[][] graph, int current, int dest, List averageOfLevels(TreeNode root) { FILE: src/BackspaceStringCompare844.java class BackspaceStringCompare844 (line 34) | public class BackspaceStringCompare844 { method backspaceCompare (line 35) | public boolean backspaceCompare(String S, String T) { method backspaceCompare2 (line 98) | public boolean backspaceCompare2(String S, String T) { method build (line 102) | public String build(String S) { method backspaceCompare3 (line 117) | public boolean backspaceCompare3(String S, String T) { FILE: src/BalancedBinaryTree110.java class BalancedBinaryTree110 (line 21) | public class BalancedBinaryTree110 { method isBalanced (line 23) | public boolean isBalanced(TreeNode root) { method depth (line 35) | private int depth(TreeNode node) { method isBalanced2 (line 50) | public boolean isBalanced2(TreeNode root) { method height (line 58) | public int height(TreeNode node){ method main (line 81) | public static void main(String[] args) { FILE: src/BaseballGame682.java class BaseballGame682 (line 42) | public class BaseballGame682 { method calPoints (line 43) | public int calPoints(String[] ops) { FILE: src/BasicCalculator224.java class BasicCalculator224 (line 18) | public class BasicCalculator224 { method calculate (line 19) | public int calculate(String s) { method calculate (line 55) | private List calculate(String s, int from, int L) { method doCal (line 94) | private int doCal(String s, int previous, int start, int end, boolean ... method doCal (line 99) | private int doCal(int previous, int num, boolean doPlus) { method isPlus (line 107) | private boolean isPlus(char c) { method isMunis (line 110) | private boolean isMunis(char c) { method isOpen (line 113) | private boolean isOpen(char c) { method isClose (line 116) | private boolean isClose(char c) { method isDigit (line 119) | private boolean isDigit(char c) { method isSpace (line 122) | private boolean isSpace(char c) { method calculate2 (line 130) | public int calculate2(String s) { method calculate3 (line 166) | public int calculate3(String s) { method getNum (line 214) | private int getNum(char[] chars, int i) { method calculate4 (line 223) | public int calculate4(String s) { FILE: src/BasicCalculatorII227.java class BasicCalculatorII227 (line 25) | public class BasicCalculatorII227 { method calculate (line 26) | public int calculate(String s) { method getNum (line 60) | private int getNum(char[] chars, int i) { FILE: src/Bench.java class Bench (line 9) | public class Bench { method sitFarestFromPeople (line 10) | public static void sitFarestFromPeople(boolean[] bench, int k) { class Range (line 45) | static class Range { method Range (line 48) | Range (int l, int r) { method main (line 55) | public static void main(String[] args) { FILE: src/BestMeetingPoint296.java class BestMeetingPoint296 (line 24) | public class BestMeetingPoint296 { method minTotalDistance (line 28) | public int minTotalDistance(int[][] grid) { method getMin (line 44) | private int getMin(List list){ FILE: src/BestTimeToBuyAndSellStock121.java class BestTimeToBuyAndSellStock121 (line 24) | public class BestTimeToBuyAndSellStock121 { method maxProfit (line 25) | public int maxProfit(int[] prices) { method maxProfit2 (line 42) | public int maxProfit2(int[] prices) { FILE: src/BestTimeToBuyAndSellStockII122.java class BestTimeToBuyAndSellStockII122 (line 13) | public class BestTimeToBuyAndSellStockII122 { method maxProfit (line 14) | public int maxProfit(int[] prices) { method maxProfit2 (line 31) | public int maxProfit2(int[] prices) { method maxProfit3 (line 53) | public int maxProfit3(int[] prices) { FILE: src/BestTimeToBuyAndSellStockIII123.java class BestTimeToBuyAndSellStockIII123 (line 14) | public class BestTimeToBuyAndSellStockIII123 { method maxProfit (line 15) | public int maxProfit(int[] prices) { method maxProfit2 (line 33) | public int maxProfit2(int[] prices) { method maxProfit (line 37) | public int maxProfit(int k, int[] prices) { FILE: src/BestTimeToBuyAndSellStockIV188.java class BestTimeToBuyAndSellStockIV188 (line 29) | public class BestTimeToBuyAndSellStockIV188 { method maxProfit (line 30) | public int maxProfit(int k, int[] prices) { method maxProfit2 (line 61) | public int maxProfit2(int k, int[] prices) { method quickSolve (line 76) | private int quickSolve(int[] prices) { FILE: src/BestTimeToBuyAndSellStockWithCooldown309.java class BestTimeToBuyAndSellStockWithCooldown309 (line 24) | public class BestTimeToBuyAndSellStockWithCooldown309 { method maxProfit (line 28) | public int maxProfit(int[] prices) { method maxProfit2 (line 43) | public int maxProfit2(int[] prices) { FILE: src/BestTimeToBuyAndSellStockWithTransactionFee714.java class BestTimeToBuyAndSellStockWithTransactionFee714 (line 30) | public class BestTimeToBuyAndSellStockWithTransactionFee714 { method maxProfit (line 31) | public int maxProfit(int[] prices, int fee) { method maxProfit2 (line 47) | public int maxProfit2(int[] prices, int fee) { FILE: src/BinarySearchTreeIterator173.java class BinarySearchTreeIterator173 (line 23) | public class BinarySearchTreeIterator173 { class BSTIterator (line 24) | class BSTIterator { method BSTIterator (line 27) | public BSTIterator(TreeNode root) { method addAllLeft (line 33) | private void addAllLeft(TreeNode node) { method hasNext (line 42) | public boolean hasNext() { method next (line 47) | public int next() { FILE: src/BinaryTreeInorderTraversal94.java class BinaryTreeInorderTraversal94 (line 33) | public class BinaryTreeInorderTraversal94 { method inorderTraversal (line 34) | public List inorderTraversal(TreeNode root) { method inorderTraversal2 (line 56) | public List inorderTraversal2(TreeNode root) { method inorderTraversal3 (line 76) | public List inorderTraversal3(TreeNode root) { method inorderTraversal (line 82) | private void inorderTraversal(TreeNode root, List res) { FILE: src/BinaryTreeLevelOrderTraversal102.java class BinaryTreeLevelOrderTraversal102 (line 38) | public class BinaryTreeLevelOrderTraversal102 { method levelOrder (line 39) | public List> levelOrder(TreeNode root) { method helper (line 57) | private void helper(Queue q, List> result, int... method addLevel (line 82) | private void addLevel(List> result, int level) { method levelOrder2 (line 92) | public List> levelOrder2(TreeNode root) { method levelOrder3 (line 113) | public List> levelOrder3(TreeNode root) { method levelOrder (line 140) | public List> levelOrder(TreeNode root) { method levelHelper (line 146) | public void levelHelper(List> res, TreeNode root, int he... FILE: src/BinaryTreeLevelOrderTraversalII107.java class BinaryTreeLevelOrderTraversalII107 (line 30) | public class BinaryTreeLevelOrderTraversalII107 { method levelOrderBottom (line 31) | public List> levelOrderBottom(TreeNode root) { method levelOrderBottom2 (line 51) | public List> levelOrderBottom2(TreeNode root) { method levelOrder (line 58) | private void levelOrder(TreeNode root, int level, LinkedList binaryTreePaths(TreeNode root) { method binaryTreePaths (line 34) | public void binaryTreePaths(TreeNode root, StringBuilder path, List binaryTreePaths2(TreeNode root) { FILE: src/BinaryTreePreorderTraversal144.java class BinaryTreePreorderTraversal144 (line 27) | public class BinaryTreePreorderTraversal144 { method preorderTraversal (line 28) | public List preorderTraversal(TreeNode root) { method helper (line 34) | private void helper(TreeNode root, List res) { method preorderTraversal2 (line 42) | public List preorderTraversal2(TreeNode root) { FILE: src/BinaryTreeRightSideView199.java class BinaryTreeRightSideView199 (line 29) | public class BinaryTreeRightSideView199 { method rightSideView (line 30) | public List rightSideView(TreeNode root) { method rightSideView (line 36) | public void rightSideView(TreeNode root, List res, int level) { FILE: src/BinaryTreeVerticalOrderTraversal314.java class BinaryTreeVerticalOrderTraversal314 (line 76) | public class BinaryTreeVerticalOrderTraversal314 { method verticalOrder (line 77) | public List> verticalOrder(TreeNode root) { method verticalOrder2 (line 111) | public List> verticalOrder2(TreeNode root) { method verticalOrder3 (line 151) | public List> verticalOrder3(TreeNode root) { method getRange (line 189) | public void getRange(TreeNode root, int[] range, int col) { FILE: src/BinaryTreeZigzagLevelOrderTraversal103.java class BinaryTreeZigzagLevelOrderTraversal103 (line 33) | public class BinaryTreeZigzagLevelOrderTraversal103 { method zigzagLevelOrder (line 34) | public List> zigzagLevelOrder(TreeNode root) { method zigzagLevelOrder (line 43) | private void zigzagLevelOrder(LinkedList level, boolean left... FILE: src/BinaryTreesWithFactors823.java class BinaryTreesWithFactors823 (line 28) | public class BinaryTreesWithFactors823 { method numFactoredBinaryTrees (line 30) | public int numFactoredBinaryTrees(int[] A) { method numFactoredBinaryTrees2 (line 61) | public int numFactoredBinaryTrees2(int[] A) { FILE: src/BitwiseANDOfNumbersRange201.java class BitwiseANDOfNumbersRange201 (line 14) | public class BitwiseANDOfNumbersRange201 { method rangeBitwiseAnd (line 15) | public int rangeBitwiseAnd(int m, int n) { method setBit (line 29) | private int setBit(int num, int pos) { method getBit (line 33) | private int getBit(int num, int pos) { method rangeBitwiseAnd2 (line 41) | public int rangeBitwiseAnd2(int m, int n) { method rangeBitwiseAnd3 (line 58) | public int rangeBitwiseAnd3(int m, int n) { FILE: src/BoatsToSavePeople885.java class BoatsToSavePeople885 (line 31) | public class BoatsToSavePeople885 { method numRescueBoats (line 32) | public int numRescueBoats(int[] people, int limit) { FILE: src/BombEnemy361.java class BombEnemy361 (line 18) | public class BombEnemy361 { method maxKilledEnemies (line 19) | public int maxKilledEnemies(char[][] grid) { method killedByBomb (line 34) | private int killedByBomb(char[][] grid, int i, int j, int n, int m) { method maxKilledEnemies2 (line 63) | public int maxKilledEnemies2(char[][] grid) { method killedByBomb2 (line 81) | private int killedByBomb2(char[][] grid, int i, int j, int n, int m) { method maxKilledEnemies3 (line 131) | public int maxKilledEnemies3(char[][] grid) { method maxKilledEnemies4 (line 171) | public int maxKilledEnemies4(char[][] grid) { FILE: src/BoundaryOfBinaryTree545.java class BoundaryOfBinaryTree545 (line 66) | public class BoundaryOfBinaryTree545 { method boundaryOfBinaryTree (line 67) | public List boundaryOfBinaryTree(TreeNode root) { method dfsLeft (line 80) | private void dfsLeft(TreeNode root, boolean[] flag, List res) { method dfsRight (line 92) | private void dfsRight(TreeNode root, boolean[] flag, List res) { FILE: src/BrickWall554.java class BrickWall554 (line 39) | public class BrickWall554 { method leastBricks (line 40) | public int leastBricks(List> wall) { FILE: src/BricksFallingWhenHit803.java class BricksFallingWhenHit803 (line 42) | public class BricksFallingWhenHit803 { method hitBricks (line 46) | public int[] hitBricks(int[][] grid, int[][] hits) { class DSU (line 97) | class DSU { method DSU (line 102) | public DSU(int N) { method find (line 111) | public int find(int x) { method union (line 116) | public void union(int x, int y) { method size (line 133) | public int size(int x) { method top (line 137) | public int top() { method hitBricks2 (line 146) | public int[] hitBricks2(int[][] grid, int[][] hits) { method markRemainBricks (line 153) | private void markRemainBricks(int[][] grid) { method removeHitBrick (line 159) | private void removeHitBrick(int[][] grid, int[][] hits) { method searchFallingBrick (line 165) | private int[] searchFallingBrick(int[][] grid, int[][] hits) { method isConnectToTop (line 180) | private boolean isConnectToTop(int[][] grid, int i, int j) { method deepSearch (line 198) | private int deepSearch(int[][] data, int row, int column) { FILE: src/BuddyStrings859.java class BuddyStrings859 (line 31) | public class BuddyStrings859 { method buddyStrings (line 32) | public boolean buddyStrings(String A, String B) { FILE: src/BullsAndCows299.java class BullsAndCows299 (line 35) | public class BullsAndCows299 { method getHint (line 36) | public String getHint(String secret, String guess) { method getHint2 (line 69) | public String getHint2(String secret, String guess) { method getHint3 (line 106) | public String getHint3(String secret, String guess) { FILE: src/BurstBalloons312.java class BurstBalloons312 (line 29) | public class BurstBalloons312 { method maxCoins (line 30) | public int maxCoins(int[] nums) { method maxCoins1 (line 49) | public int maxCoins1(int[] nums) { method dp (line 57) | private int dp(int[] nums, Set key, Map, Integer... method maxCoins2 (line 86) | public int maxCoins2(int[] nums) { method maxCoins3 (line 112) | public int maxCoins3(int[] iNums) { method maxCoins4 (line 132) | public int maxCoins4(int[] iNums) { method burst (line 142) | public int burst(int[][] memo, int[] nums, int left, int right) { FILE: src/CanIWin464.java class CanIWin464 (line 33) | public class CanIWin464 { method canIWin (line 34) | public boolean canIWin(int maxChoosableInteger, int desiredTotal) { method helper (line 42) | private boolean helper(boolean[] set, int desiredTotal, Map{ method City (line 142) | public City(int id, int costFromSrc, int stopFromSrc){ method equals (line 147) | public boolean equals(City c){ method compareTo (line 152) | public int compareTo(City c){ method findCheapestPrice4 (line 157) | public int findCheapestPrice4(int n, int[][] flights, int src, int dst... method findCheapestPrice5 (line 200) | public int findCheapestPrice5(int n, int[][] flights, int src, int dst... method findCheapestPrice6 (line 220) | public int findCheapestPrice6(int n, int[][] flights, int src, int dst... method findCheapestPrice7 (line 234) | public int findCheapestPrice7(int n, int[][] flights, int src, int dst... FILE: src/ClimbingStairs70.java class ClimbingStairs70 (line 32) | public class ClimbingStairs70 { method climbStairs (line 33) | public int climbStairs(int n) { method climbStairs2 (line 45) | public int climbStairs2(int n) { FILE: src/CloneGraph133.java class CloneGraph133 (line 36) | public class CloneGraph133 { method cloneGraph (line 37) | public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) { method clone (line 42) | private UndirectedGraphNode clone(UndirectedGraphNode node, HashMap closestKValues(TreeNode root, double target, int ... method helper (line 45) | private void helper(TreeNode root, double target, int k, LinkedList res) { FILE: src/CoinChange322.java class CoinChange322 (line 20) | public class CoinChange322 { method coinChange (line 21) | public int coinChange(int[] coins, int amount) { method helper (line 26) | private int helper(int idx, int[] coins, int left) { method coinChange2 (line 52) | public int coinChange2(int[] coins, int amount) { method dp (line 57) | private int dp(int[] coins, int left, int[] amounts) { method coinChange3 (line 75) | public int coinChange3(int[] coins, int amount) { method coinChange4 (line 90) | public int coinChange4(int[] coins, int amount) { method coinChange5 (line 105) | public int coinChange5(int[] coins, int amount) { method coinChange6 (line 118) | public int coinChange6(int[] coins, int amount) { method coinChange (line 125) | public void coinChange(int[] coins, int amount, int idx, int[] res, in... FILE: src/CoinChangeII518.java class CoinChangeII518 (line 39) | public class CoinChangeII518 { method change (line 40) | public int change(int amount, int[] coins) { method change2 (line 54) | public int change2(int amount, int[] coins) { method change3 (line 66) | public int change3(int amount, int[] coins) { FILE: src/CollatzConjecture.java class CollatzConjecture (line 5) | public class CollatzConjecture { method maxSteps (line 28) | public int maxSteps(int n) { method steps (line 38) | public int steps(int i, int[] memo) { FILE: src/CombinationSum39.java class CombinationSum39 (line 30) | public class CombinationSum39 { method combinationSum (line 31) | public List> combinationSum(int[] candidates, int target) { method helper (line 37) | private void helper(int[] candidates, int target, int start, List> combinationSum3(int k, int n) { method combinationSum3 (line 26) | private void combinationSum3(int k, int n, List path, int sum... FILE: src/CombinationSumIV377.java class CombinationSumIV377 (line 29) | public class CombinationSumIV377 { method combinationSum4 (line 30) | public int combinationSum4(int[] nums, int target) { method combinationSum42 (line 55) | public int combinationSum42(int[] nums, int target) { method helper (line 62) | private int helper(int[] nums, int target) { method combinationSum43 (line 77) | public int combinationSum43(int[] nums, int target) { FILE: src/CompareVersionNumbers165.java class CompareVersionNumbers165 (line 29) | public class CompareVersionNumbers165 { method compareVersion (line 30) | public int compareVersion(String version1, String version2) { method compareVersion2 (line 58) | public int compareVersion2(String version1, String version2) { FILE: src/ConcatenatedWords472.java class ConcatenatedWords472 (line 23) | public class ConcatenatedWords472 { method findAllConcatenatedWordsInADict (line 24) | public List findAllConcatenatedWordsInADict(String[] words) { method count (line 35) | private int count(Trie trie, char[] chars, int i, Trie root, int cnt) { method constructTrie (line 49) | private Trie constructTrie(String[] words) { class Trie (line 55) | class Trie { method add (line 59) | void add(String word) { method add (line 63) | void add(char[] chars, int i) { FILE: src/ConstructBinaryTreeFromInorderAndPostorderTraversal106.java class ConstructBinaryTreeFromInorderAndPostorderTraversal106 (line 30) | public class ConstructBinaryTreeFromInorderAndPostorderTraversal106 { method buildTree (line 31) | public TreeNode buildTree(int[] inorder, int[] postorder) { method buildTree (line 37) | private TreeNode buildTree(int[] inorder, int ii, int ij, int[] postor... FILE: src/ConstructBinaryTreeFromPreorderAndInorderTraversal105.java class ConstructBinaryTreeFromPreorderAndInorderTraversal105 (line 20) | public class ConstructBinaryTreeFromPreorderAndInorderTraversal105 { method buildTree (line 21) | public TreeNode buildTree(int[] preorder, int[] inorder) { method search (line 32) | private int search(int[] order, int val) { method buildTree2 (line 41) | public TreeNode buildTree2(int[] preorder, int[] inorder) { method buildTree (line 47) | public TreeNode buildTree(int[] preorder, int s1, int e1, int[] inorde... method search (line 59) | private int search(int[] order, int val, int start, int end) { method buildTree3 (line 68) | public TreeNode buildTree3(int[] preorder, int[] inorder) { method buildTree (line 73) | private TreeNode buildTree(int[] preorder, int p, int[] inorder, int i... method buildTree4 (line 93) | public TreeNode buildTree4(int[] preorder, int[] inorder) { method buildTree (line 104) | public TreeNode buildTree(int[] preorder, int preStart, int preEnd, in... FILE: src/ConstructBinaryTreeFromString536.java class ConstructBinaryTreeFromString536 (line 38) | public class ConstructBinaryTreeFromString536 { method str2tree (line 39) | public TreeNode str2tree(String s) { method str2tree (line 44) | public TreeNode str2tree(char[] chars, int i, int j) { FILE: src/ConstructQuadTree427.java class ConstructQuadTree427 (line 54) | public class ConstructQuadTree427 { method construct (line 55) | public Node construct(int[][] grid) { method construct (line 61) | public Node construct(int[][] grid, int xi, int xj, int yi, int yj) { method allLeaves (line 88) | private boolean allLeaves(Node n) { method allSame (line 95) | private boolean allSame(Node n) { FILE: src/ContainerWithMostWater11.java class ContainerWithMostWater11 (line 10) | public class ContainerWithMostWater11 { method maxArea (line 38) | public int maxArea(int[] height) { FILE: src/ContainsDuplicate217.java class ContainsDuplicate217 (line 7) | public class ContainsDuplicate217 { method containsDuplicate (line 8) | public boolean containsDuplicate(int[] nums) { method containsDuplicate2 (line 21) | public boolean containsDuplicate2(int[] nums) { FILE: src/ContainsDuplicateIII220.java class ContainsDuplicateIII220 (line 8) | public class ContainsDuplicateIII220 { method containsNearbyAlmostDuplicate (line 24) | public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) { method getID (line 49) | private long getID(long x, long w) { method containsNearbyAlmostDuplicate (line 53) | public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) { FILE: src/ContainsDuplicatesII219.java class ContainsDuplicatesII219 (line 14) | public class ContainsDuplicatesII219 { method containsNearbyDuplicate (line 16) | public boolean containsNearbyDuplicate(int[] nums, int k) { method containsNearbyDuplicate2 (line 33) | public boolean containsNearbyDuplicate2(int[] nums, int k) { method containsNearbyDuplicate3 (line 55) | public boolean containsNearbyDuplicate3(int[] nums, int k) { method main (line 70) | public static void main(String[] args) { FILE: src/ContiguousArray525.java class ContiguousArray525 (line 22) | public class ContiguousArray525 { method findMaxLength (line 26) | public int findMaxLength(int[] nums) { method findMaxLength2 (line 44) | public int findMaxLength2(int[] nums) { method findMaxLength3 (line 61) | public int findMaxLength3(int[] nums) { FILE: src/ContinuousSubarraySum523.java class ContinuousSubarraySum523 (line 26) | public class ContinuousSubarraySum523 { method checkSubarraySum (line 27) | public boolean checkSubarraySum(int[] nums, int k) { method kIsNotZero (line 32) | public boolean kIsNotZero(int[] nums, int k) { method kIsZero (line 48) | public boolean kIsZero(int[] nums) { method checkSubarraySum2 (line 65) | public boolean checkSubarraySum2(int[] nums, int k) { FILE: src/ConvertANumberToHexadecimal405.java class ConvertANumberToHexadecimal405 (line 28) | public class ConvertANumberToHexadecimal405 { method toHex (line 29) | public String toHex(int num) { method toHex2 (line 45) | public String toHex2(int num) { FILE: src/ConvertBSTToGreaterTree538.java class ConvertBSTToGreaterTree538 (line 30) | public class ConvertBSTToGreaterTree538 { method convertBST (line 31) | public TreeNode convertBST(TreeNode root) { method convertBST (line 35) | private TreeNode convertBST(TreeNode root, int[] sum) { method convertBST2 (line 45) | public TreeNode convertBST2(TreeNode root) { FILE: src/ConvertBinarySearchTreeToSortedDoublyLinkedList.java class ConvertBinarySearchTreeToSortedDoublyLinkedList (line 51) | public class ConvertBinarySearchTreeToSortedDoublyLinkedList { method treeToDoublyList (line 52) | public Node treeToDoublyList(Node root) { method dfs (line 60) | private Node[] dfs(Node n) { FILE: src/ConvertSortedArrayToBinarySearchTree108.java class ConvertSortedArrayToBinarySearchTree108 (line 35) | class ConvertSortedArrayToBinarySearchTree108 { method sortedArrayToBST (line 36) | public TreeNode sortedArrayToBST(int[] nums) { method sortedArrayToBST (line 40) | public TreeNode sortedArrayToBST(int[] nums, int i, int j) { FILE: src/ConvertSortedListToBST109.java class ConvertSortedListToBST109 (line 32) | public class ConvertSortedListToBST109 { method sortedListToBST (line 33) | public TreeNode sortedListToBST(ListNode head) { method storeBSTNodes (line 41) | private void storeBSTNodes(ListNode head, List nodes) { method buildBST (line 48) | private TreeNode buildBST(List nodes, int start, int end) { method sortedListToBST2 (line 67) | public TreeNode sortedListToBST2(ListNode head) { method toBST (line 72) | public TreeNode toBST(ListNode head, ListNode tail){ method sortedListToBST3 (line 96) | public TreeNode sortedListToBST3(ListNode head) { method inorderHelper (line 113) | public TreeNode inorderHelper(int start, int end){ method sortedListToBST4 (line 132) | public TreeNode sortedListToBST4(ListNode head) { method sortedListToBST5 (line 153) | public TreeNode sortedListToBST5(ListNode head) { FILE: src/CopyListWithRandomPointer138.java class CopyListWithRandomPointer138 (line 18) | public class CopyListWithRandomPointer138 { method copyRandomList (line 19) | public RandomListNode copyRandomList(RandomListNode head) { method deepCopy (line 23) | public RandomListNode deepCopy(RandomListNode node, Map countSmaller(int[] nums) { method countSmaller2 (line 38) | public List countSmaller2(int[] nums) { method countSmaller3 (line 72) | public List countSmaller3(int[] nums) { method mergeSort (line 88) | private void mergeSort(int[][] arr, Integer[] count, int l, int r) { method merge (line 98) | private void merge(int[][] arr, Integer[] count, int l, int m, int r) { method countSmaller4 (line 142) | public List countSmaller4(int[] nums) { method insert (line 151) | private Node insert(int num, Node node, Integer[] ans, int i, int preS... class Node (line 167) | class Node { method Node (line 170) | public Node(int v, int s) { method Node (line 304) | Node(int v) { method countSmaller5 (line 179) | public List countSmaller5(int[] nums) { method findIndex (line 190) | private int findIndex(List sorted, int target) { method countSmaller6 (line 209) | public List countSmaller6(int[] nums) { class BinaryIndexedTree (line 232) | class BinaryIndexedTree { method BinaryIndexedTree (line 236) | BinaryIndexedTree(int N) { method update (line 241) | void update(int i, int delta) { method query (line 249) | int query(int i) { method lowBit (line 259) | private int lowBit(int x) { method countSmaller7 (line 265) | public List countSmaller7(int[] nums) { method insert (line 277) | private int insert(Node root, int val) { class Node (line 298) | class Node { method Node (line 170) | public Node(int v, int s) { method Node (line 304) | Node(int v) { FILE: src/CountPrimes204.java class CountPrimes204 (line 8) | public class CountPrimes204 { method countPrimes (line 9) | public int countPrimes(int n) { FILE: src/CountingBits338.java class CountingBits338 (line 21) | public class CountingBits338 { method countBits (line 22) | public int[] countBits(int num) { method countBits (line 45) | public int[] countBits(int num) { FILE: src/CouplesHoldingHands765.java class CouplesHoldingHands765 (line 37) | public class CouplesHoldingHands765 { method minSwapsCouples (line 38) | public int minSwapsCouples(int[] row) { method swap (line 55) | private void swap(int[] arr, int i, int j) { FILE: src/CourseSchedule207.java class CourseSchedule207 (line 40) | public class CourseSchedule207 { method canFinish (line 41) | public boolean canFinish(int numCourses, int[][] prerequisites) { method dfs (line 52) | private boolean dfs(Map> graph, Set vis... method initGraph (line 66) | private Map> initGraph(int[][] prerequisites) { method addEdge (line 74) | private void addEdge(Map> graph, int[] p) { method canFinish2s (line 84) | public boolean canFinish2s(int numCourses, int[][] prerequisites) { method canFinish3 (line 126) | public boolean canFinish3(int numCourses, int[][] prerequisites) { method canFinish4 (line 157) | public boolean canFinish4(int numCourses, int[][] prerequisites) { method isCyclic (line 166) | private boolean isCyclic(Set[] graph, int numCourses) { method isCyclic (line 175) | private boolean isCyclic(Set[] graph, int start, boolean[] vi... FILE: src/CourseScheduleII210.java class CourseScheduleII210 (line 44) | public class CourseScheduleII210 { method findOrder (line 45) | public int[] findOrder(int numCourses, int[][] prerequisites) { method helper (line 67) | private boolean helper(Set[] graph, int curr, int numCourses,... method findOrder2 (line 83) | public int[] findOrder2(int numCourses, int[][] prerequisites) { FILE: src/CutOffTreesForGolfEvent675.java class CutOffTreesForGolfEvent675 (line 56) | public class CutOffTreesForGolfEvent675 { method cutOffTree (line 58) | public int cutOffTree(List> forest) { method minDistance (line 93) | private int minDistance(int[][] golf, Point start, Point end, int M, i... class Point (line 120) | class Point { method Point (line 123) | Point(int xx, int yy) { class TreePoint (line 129) | class TreePoint { method TreePoint (line 133) | TreePoint(int xx, int yy, int hh) { FILE: src/DailyTemperatures739.java class DailyTemperatures739 (line 14) | public class DailyTemperatures739 { method dailyTemperatures (line 15) | public int[] dailyTemperatures(int[] temperatures) { method dailyTemperatures2 (line 36) | public int[] dailyTemperatures2(int[] temperatures) { method dailyTemperatures3 (line 54) | public int[] dailyTemperatures3(int[] temperatures) { FILE: src/DataStreamAsDisjointIntervals352.java class DataStreamAsDisjointIntervals352 (line 29) | public class DataStreamAsDisjointIntervals352 { class SummaryRanges (line 30) | class SummaryRanges { method SummaryRanges (line 34) | public SummaryRanges() { method addNum (line 37) | public void addNum(int val) { method getIntervals (line 71) | public List getIntervals() { class SummaryRanges2 (line 81) | class SummaryRanges2 { method SummaryRanges2 (line 85) | public SummaryRanges2() { method addNum (line 88) | public void addNum(int val) { method remove (line 112) | private Node remove(Node node, Interval inv) { method findMin (line 127) | private Node findMin(Node node) { method findNode (line 132) | private Node findNode(Node node, int val) { method addNode (line 138) | private Node addNode(Node node, int val) { method getIntervals (line 146) | public List getIntervals() { method inorder (line 152) | private void inorder(Node node, List res) { class Node (line 160) | class Node { method Node (line 164) | Node(Interval inv) { FILE: src/DecodeString394.java class DecodeString394 (line 24) | public class DecodeString394 { method decodeString (line 25) | public String decodeString(String s) { method decodeString (line 61) | public Res decodeString(String s, int start) { class Res (line 100) | class Res { method Res (line 103) | Res (int next, String in) { method decodeString2 (line 113) | public String decodeString2(String s) { method decodeString3 (line 146) | public String decodeString3(String s) { FILE: src/DecodeWays91.java class DecodeWays91 (line 23) | public class DecodeWays91 { method numDecodings (line 24) | public int numDecodings(String s) { method numDecodings2 (line 65) | public int numDecodings2(String s) { method numDecodings3 (line 84) | public int numDecodings3(String s) { method numDecodings4 (line 105) | public int numDecodings4(String s) { method numDecodings5 (line 127) | public int numDecodings5(String s) { FILE: src/DecodeWaysII639.java class DecodeWaysII639 (line 34) | public class DecodeWaysII639 { method numDecodings (line 35) | public int numDecodings(String s) { method numDecodings2 (line 62) | public int numDecodings2(String s) { FILE: src/DecodedStringAtIndex884.java class DecodedStringAtIndex884 (line 40) | public class DecodedStringAtIndex884 { method decodeAtIndex (line 41) | public String decodeAtIndex(String S, int K) { FILE: src/DeleteAndEarn740.java class DeleteAndEarn740 (line 31) | public class DeleteAndEarn740 { method deleteAndEarn (line 32) | public int deleteAndEarn(int[] nums) { method deleteAndEarn2 (line 54) | public int deleteAndEarn2(int[] nums) { FILE: src/DeleteNodeInABST450.java class DeleteNodeInABST450 (line 55) | public class DeleteNodeInABST450 { method deleteNode (line 56) | public TreeNode deleteNode(TreeNode root, int key) { method delete (line 72) | private TreeNode delete(TreeNode node) { method moveNext (line 78) | private TreeNode moveNext(TreeNode node) { method deleteNode2 (line 98) | public TreeNode deleteNode2(TreeNode root, int key) { method minValue (line 126) | private int minValue(TreeNode root) { FILE: src/DeleteNodeInALinkedList237.java class DeleteNodeInALinkedList237 (line 19) | public class DeleteNodeInALinkedList237 { method deleteNode (line 20) | public void deleteNode(ListNode node) { FILE: src/DesignCircularDeque641.java class DesignCircularDeque641 (line 36) | public class DesignCircularDeque641 { class MyCircularDeque (line 38) | class MyCircularDeque { method MyCircularDeque (line 44) | public MyCircularDeque(int k) { method insertFront (line 53) | public boolean insertFront(int value) { method insertLast (line 65) | public boolean insertLast(int value) { method deleteFront (line 77) | public boolean deleteFront() { method deleteLast (line 86) | public boolean deleteLast() { method dislink (line 94) | private void dislink(Node node) { method getFront (line 100) | public int getFront() { method getRear (line 106) | public int getRear() { method isEmpty (line 112) | public boolean isEmpty() { method isFull (line 117) | public boolean isFull() { class Node (line 121) | class Node { method Node (line 125) | Node(int value) { class MyCircularDeque2 (line 132) | class MyCircularDeque2 { method MyCircularDeque (line 139) | public MyCircularDeque(int k) { method insertFront (line 147) | public boolean insertFront(int value) { method insertLast (line 156) | public boolean insertLast(int value) { method deleteFront (line 164) | public boolean deleteFront() { method deleteLast (line 173) | public boolean deleteLast() { method getFront (line 180) | public int getFront() { method getRear (line 186) | public int getRear() { method isEmpty (line 192) | public boolean isEmpty() { method isFull (line 197) | public boolean isFull() { FILE: src/DesignCircularQueue622.java class DesignCircularQueue622 (line 42) | public class DesignCircularQueue622 { class MyCircularQueue (line 44) | class MyCircularQueue { method MyCircularQueue (line 50) | public MyCircularQueue(int k) { method enQueue (line 59) | public boolean enQueue(int value) { method deQueue (line 71) | public boolean deQueue() { method dislink (line 78) | private void dislink(Node node) { method Front (line 84) | public int Front() { method Rear (line 90) | public int Rear() { method isEmpty (line 96) | public boolean isEmpty() { method isFull (line 101) | public boolean isFull() { class Node (line 105) | class Node { method Node (line 109) | Node() { method Node (line 112) | Node(int value) { class MyCircularQueue2 (line 119) | class MyCircularQueue2 { method MyCircularQueue (line 126) | public MyCircularQueue(int k) { method enQueue (line 134) | public boolean enQueue(int value) { method deQueue (line 142) | public boolean deQueue() { method Front (line 151) | public int Front() { method Rear (line 157) | public int Rear() { method isEmpty (line 163) | public boolean isEmpty() { method isFull (line 168) | public boolean isFull() { FILE: src/DesignCompressedStringIterator604.java class DesignCompressedStringIterator604 (line 35) | public class DesignCompressedStringIterator604 { class StringIterator (line 37) | class StringIterator { method StringIterator (line 45) | public StringIterator(String compressedString) { method next (line 52) | public char next() { method hasNext (line 63) | public boolean hasNext() { method move (line 67) | private void move() { method isNumeric (line 78) | private boolean isNumeric(char c) { class StringIterator2 (line 88) | class StringIterator2 { method StringIterator (line 91) | public StringIterator(String s) { method next (line 101) | public char next() { method hasNext (line 108) | public boolean hasNext() { FILE: src/DesignHashMap706.java class DesignHashMap706 (line 32) | public class DesignHashMap706 { class MyHashMap (line 33) | class MyHashMap { method MyHashMap (line 37) | public MyHashMap() { method put (line 41) | public void put(int key, int value) { method get (line 46) | public int get(int key) { method remove (line 52) | public void remove(int key) { class MyHashMap2 (line 58) | class MyHashMap2 { method MyHashMap (line 64) | public MyHashMap() { method put (line 68) | public void put(int key, int value) { method get (line 91) | public int get(int key) { method remove (line 107) | public void remove(int key) { class ListNode (line 128) | class ListNode { method ListNode (line 133) | ListNode (int key, int value) { class MyHashMap3 (line 141) | class MyHashMap3 { method MyHashMap (line 147) | public MyHashMap() { method put (line 151) | public void put(int key, int value) { method get (line 181) | public int get(int key) { method remove (line 205) | public void remove(int key) { method delete (line 210) | private TreeNode delete(TreeNode head, int key) { method minValue (line 231) | private int minValue(TreeNode head) { class TreeNode (line 240) | class TreeNode { method TreeNode (line 245) | TreeNode (int key, int value) { FILE: src/DesignHashSet705.java class DesignHashSet705 (line 27) | public class DesignHashSet705 { class MyHashSet (line 29) | class MyHashSet { method MyHashSet (line 34) | public MyHashSet() { method add (line 38) | public void add(int key) { method remove (line 50) | public void remove(int key) { method contains (line 64) | public boolean contains(int key) { class MyHashSet2 (line 77) | class MyHashSet2 { method MyHashSet2 (line 82) | public MyHashSet2() { method add (line 86) | public void add(int key) { method addNode (line 91) | TreeNode addNode(TreeNode root, int key) { method remove (line 101) | public void remove(int key) { method removeNode (line 106) | TreeNode removeNode(TreeNode root, int key) { method findMin (line 125) | int findMin(TreeNode root) { method contains (line 133) | public boolean contains(int key) { method containNode (line 137) | boolean containNode(TreeNode root, int key) { class TreeNode (line 143) | class TreeNode { method TreeNode (line 147) | TreeNode(int key) { FILE: src/DesignHitCounter362.java class DesignHitCounter362 (line 42) | public class DesignHitCounter362 { class HitCounter (line 43) | class HitCounter { method HitCounter (line 48) | public HitCounter() { method hit (line 53) | public void hit(int timestamp) { method getHits (line 60) | public int getHits(int timestamp) { method removeOldHits (line 65) | private void removeOldHits(int timestamp) { class HitCounter2 (line 73) | class HitCounter2 { method HitCounter (line 80) | public HitCounter() { method hit (line 85) | public void hit(int timestamp) { method getHits (line 94) | public int getHits(int timestamp) { method removeOldHits (line 100) | private void removeOldHits(int timestamp) { method bucketIndex (line 110) | private int bucketIndex(int timestamp) { class HitCounter3 (line 119) | class HitCounter3 { method HitCounter (line 123) | public HitCounter() { method hit (line 130) | public void hit(int timestamp) { method getHits (line 142) | public int getHits(int timestamp) { FILE: src/DesignInMemoryFileSystem588.java class DesignInMemoryFileSystem588 (line 42) | public class DesignInMemoryFileSystem588 { class FileSystem (line 44) | class FileSystem { method FileSystem (line 47) | public FileSystem() { method ls (line 50) | public List ls(String path) { method mkdir (line 54) | public void mkdir(String path) { method addContentToFile (line 58) | public void addContentToFile(String filePath, String content) { method readContentFromFile (line 62) | public String readContentFromFile(String filePath) { class Trie (line 66) | class Trie { method startPos (line 72) | private int startPos(String[] path) { method find (line 76) | List find(String[] path) { method find (line 80) | List find(String[] path, int i) { method addDir (line 98) | void addDir(String[] path) { method addDir (line 102) | void addDir(String[] path, int i) { method addFile (line 110) | void addFile(String[] path, String content) { method addFile (line 114) | void addFile(String[] path, int i, String content) { method retrieve (line 124) | String retrieve(String[] path) { method retrieve (line 128) | String retrieve(String[] path, int i) { FILE: src/DesignLinkedList707.java class DesignLinkedList707 (line 41) | public class DesignLinkedList707 { class MyLinkedList (line 42) | class MyLinkedList { method MyLinkedList (line 46) | public MyLinkedList() { method get (line 51) | public int get(int index) { method addAtHead (line 63) | public void addAtHead(int val) { method addAtTail (line 70) | public void addAtTail(int val) { method addAtIndex (line 81) | public void addAtIndex(int index, int val) { method deleteAtIndex (line 95) | public void deleteAtIndex(int index) { class Node (line 106) | class Node { method Node (line 109) | Node (int x) { class MyLinkedList2 (line 117) | class MyLinkedList2 { method MyLinkedList (line 121) | public MyLinkedList() { method get (line 126) | public int get(int index) { method addAtHead (line 138) | public void addAtHead(int val) { method addAtTail (line 147) | public void addAtTail(int val) { method addAtIndex (line 160) | public void addAtIndex(int index, int val) { method deleteAtIndex (line 176) | public void deleteAtIndex(int index) { class Node (line 188) | class Node { method Node (line 192) | Node (int x) { FILE: src/DesignLogStorageSystem635.java class DesignLogStorageSystem635 (line 41) | public class DesignLogStorageSystem635 { class LogSystem (line 42) | class LogSystem { method LogSystem (line 47) | public LogSystem() { method put (line 52) | public void put(int id, String timestamp) { method retrieve (line 56) | public List retrieve(String s, String e, String gra) { method roundLeft (line 67) | private String roundLeft(String timestamp, String gra) { method roundLeft (line 72) | private String roundLeft(String timestamp, TimeUnit unit) { method plus (line 80) | private String plus(String timestamp, TimeUnit unit) { method roundRight (line 85) | private String roundRight(String timestamp, String gra) { type TimeUnit (line 92) | enum TimeUnit { method TimeUnit (line 102) | TimeUnit(int position, String chrono) { class LogSystem2 (line 112) | class LogSystem2 { method put (line 117) | public void put(int id, String timestamp) { timestamps.add(new Strin... method retrieve (line 119) | public List retrieve(String s, String e, String gra) { FILE: src/DesignSearchAutocompleteSystem642.java class DesignSearchAutocompleteSystem642 (line 82) | public class DesignSearchAutocompleteSystem642 { class AutocompleteSystem (line 84) | class AutocompleteSystem { method AutocompleteSystem (line 90) | public AutocompleteSystem(String[] sentences, int[] times) { method input (line 101) | public List input(char c) { method getAllSents (line 130) | private void getAllSents(Trie t, PriorityQueue pq) { method asciiOrder (line 142) | private int asciiOrder(String s1, String s2) { method charPos (line 158) | private int charPos(char ch) { class Trie (line 163) | class Trie { method add (line 167) | void add(String sen) { method add (line 171) | void add(char[] chars, int i) { class AutocompleteSystem2 (line 187) | class AutocompleteSystem2 { method AutocompleteSystem2 (line 199) | public AutocompleteSystem2(String[] sentences, int[] times) { method addNode (line 210) | private Node addNode(Node n, String s) { method addNode (line 214) | private Node addNode(Node n, char[] chars, int i) { method input (line 237) | public List input(char c) { method next (line 269) | private Node next(Node n, char c) { method getAllSents (line 280) | private void getAllSents(Node n, PriorityQueue pq) { class Node (line 291) | class Node { method Node (line 297) | Node (char c) { FILE: src/DesignSnakeGame353.java class DesignSnakeGame353 (line 58) | public class DesignSnakeGame353 { class SnakeGame (line 60) | class SnakeGame { method SnakeGame (line 77) | public SnakeGame(int width, int height, int[][] food) { method move (line 96) | public int move(String direction) { method moveNextFood (line 119) | private void moveNextFood() { method isFood (line 125) | private boolean isFood(int nextX, int nextY) { class Node (line 130) | class Node { method Node (line 135) | Node(int i, int j) { FILE: src/DesignTicTacToe348.java class DesignTicTacToe348 (line 56) | public class DesignTicTacToe348 { class TicTacToe (line 57) | class TicTacToe { method TicTacToe (line 69) | public TicTacToe(int n) { method move (line 94) | public int move(int row, int col, int player) { class TicTacToe2 (line 130) | class TicTacToe2 { method TicTacToe (line 137) | public TicTacToe(int n) { method move (line 150) | public int move(int row, int col, int player) { class TicTacToe3 (line 182) | class TicTacToe3 { method TicTacToe (line 183) | public TicTacToe(int n) { method move (line 187) | public int move(int row, int col, int player) { class TicTacToe4 (line 198) | class TicTacToe4 { method TicTacToe4 (line 206) | public TicTacToe4(int n) { method move (line 222) | public int move(int row, int col, int player) { FILE: src/DesignTwitter355.java class DesignTwitter355 (line 46) | public class DesignTwitter355 { class Twitter (line 47) | class Twitter { method Twitter (line 53) | public Twitter() { method postTweet (line 57) | public void postTweet(int userId, int tweetId) { method getNewsFeed (line 68) | public List getNewsFeed(int userId) { method follow (line 88) | public void follow(int followerId, int followeeId) { method unfollow (line 99) | public void unfollow(int followerId, int followeeId) { class User (line 106) | class User { method User (line 110) | User(int i) { method addTweet (line 114) | public void addTweet(int i, int ts) { method follow (line 121) | public void follow(int userId) { method unfollow (line 125) | public void unfollow(int userId) { class Tweet (line 132) | class Tweet { method Tweet (line 135) | Tweet(int i, int ts) { FILE: src/DiagonalTraverse498.java class DiagonalTraverse498 (line 22) | public class DiagonalTraverse498 { method findDiagonalOrder (line 23) | public int[] findDiagonalOrder(int[][] matrix) { method next (line 39) | private int[] next(int[] pos, int M, int N) { method isEven (line 65) | private boolean isEven(int x) { FILE: src/DiameterOfBinaryTree543.java class DiameterOfBinaryTree543 (line 30) | public class DiameterOfBinaryTree543 { method diameterOfBinaryTree (line 31) | public int diameterOfBinaryTree(TreeNode root) { method helper (line 35) | private int[] helper(TreeNode root) { FILE: src/DifferentWaysToAddParentheses241.java class DifferentWaysToAddParentheses241 (line 27) | public class DifferentWaysToAddParentheses241 { method diffWaysToCompute (line 28) | public List diffWaysToCompute(String input) { method cal (line 47) | private Integer cal(Integer int1, Integer int2, Character op) { FILE: src/DivideTwoIntegers29.java class DivideTwoIntegers29 (line 7) | public class DivideTwoIntegers29 { method divide (line 8) | public int divide(int dividend, int divisor) { method helper (line 15) | public long helper(long dividend, long divisor) { FILE: src/DominoAndTrominoTiling790.java class DominoAndTrominoTiling790 (line 27) | public class DominoAndTrominoTiling790 { method numTilings (line 31) | public int numTilings(int N) { method numTilings2 (line 44) | public int numTilings2(int N) { method numTilings3 (line 56) | public int numTilings3(int N) { method numTilings4 (line 68) | public int numTilings4(int N) { method numTilings5 (line 82) | public int numTilings5(int N) { method numTilings6 (line 99) | public int numTilings6(int N) { FILE: src/EditDistance72.java class EditDistance72 (line 14) | public class EditDistance72 { method minDistance (line 16) | public int minDistance(String word1, String word2) { method minDistance2 (line 39) | public int minDistance2(String word1, String word2) { method minDistance3 (line 71) | public int minDistance3(String word1, String word2) { method main (line 94) | public static void main(String[] args) { FILE: src/EmployeeFreeTime759.java class EmployeeFreeTime759 (line 45) | public class EmployeeFreeTime759 { method employeeFreeTime (line 46) | public List employeeFreeTime(List> schedule) { method employeeFreeTime2 (line 81) | public List employeeFreeTime2(List> schedule) { FILE: src/EncodeAndDecodeStrings271.java class EncodeAndDecodeStrings271 (line 41) | public class EncodeAndDecodeStrings271 { class Codec (line 42) | public class Codec { method encode (line 45) | public String encode(List strs) { method decode (line 54) | public List decode(String s) { FILE: src/EncodeAndDecodeTinyURL535.java class EncodeAndDecodeTinyURL535 (line 16) | public class EncodeAndDecodeTinyURL535 { class Codec (line 17) | public class Codec { method encode (line 31) | public String encode(String longUrl) { method decode (line 42) | public String decode(String shortUrl) { class Codec2 (line 48) | public class Codec2 { method encode (line 62) | public String encode(String longUrl) { method decode (line 79) | public String decode(String shortUrl) { FILE: src/EqualTreePartition663.java class EqualTreePartition663 (line 56) | public class EqualTreePartition663 { method checkEqualTree (line 57) | public boolean checkEqualTree(TreeNode root) { method sum (line 63) | private int sum(TreeNode root, Set set, boolean isRoot) { FILE: src/EvaluateDivision399.java class EvaluateDivision399 (line 29) | public class EvaluateDivision399 { method calcEquation (line 30) | public double[] calcEquation(String[][] equations, double[] values, St... method dfs (line 49) | private double dfs(Map> graph, Map> weights, S... method addToValueSet (line 88) | private void addToValueSet(Map> graph, String from... method calcEquation2 (line 95) | public double[] calcEquation2(String[][] equations, double[] values, S... class UnionFind (line 119) | class UnionFind { method find (line 122) | private Parent find(String A) { method union (line 133) | private void union(String A, String B, double times) { class Parent (line 152) | class Parent { method Parent (line 155) | Parent(String parent, Double times) { FILE: src/EvaluateReversePolishNotation150.java class EvaluateReversePolishNotation150 (line 35) | public class EvaluateReversePolishNotation150 { method evalRPN (line 36) | public int evalRPN(String[] tokens) { FILE: src/ExamRoom855.java class ExamRoom855 (line 35) | public class ExamRoom855 { class ExamRoom (line 36) | class ExamRoom { method ExamRoom (line 42) | public ExamRoom(int N) { method seat (line 61) | public int seat() { method leave (line 84) | public void leave(int p) { method sitPos (line 96) | private int sitPos(Range r) { method sitPos (line 100) | private int sitPos(int left, int right) { method dis (line 107) | private int dis(Range r) { method dis (line 111) | private int dis(int left, int right) { class Range (line 118) | class Range { method Range (line 121) | Range (int l, int r) { FILE: src/ExclusiveTimeOfFunctions636.java class ExclusiveTimeOfFunctions636 (line 46) | public class ExclusiveTimeOfFunctions636 { method exclusiveTime (line 47) | public int[] exclusiveTime(int n, List logs) { FILE: src/ExpressionAddOperators282.java class ExpressionAddOperators282 (line 16) | public class ExpressionAddOperators282 { method addOperators (line 17) | public List addOperators(String num, int target) { method helper (line 31) | private void helper(String num, int target, List res, String s... method addOperators2 (line 51) | public List addOperators2(String num, int target) { method dfs (line 66) | private void dfs(List ret, char[] path, int len, long left, lo... FILE: src/FindAllAnagramsInAString438.java class FindAllAnagramsInAString438 (line 30) | public class FindAllAnagramsInAString438 { method findAnagrams (line 31) | public List findAnagrams(String s, String p) { method findAnagrams2 (line 63) | public List findAnagrams2(String s, String p) { method compare (line 87) | private boolean compare(int[] map, int[] window) { method findAnagrams3 (line 98) | public List findAnagrams3(String s, String p) { method findAnagrams4 (line 130) | public List findAnagrams4(String s, String t) { method findAnagrams5 (line 167) | public List findAnagrams5(String s, String p) { FILE: src/FindAllNumbersDisappearedInAnArray448.java class FindAllNumbersDisappearedInAnArray448 (line 19) | public class FindAllNumbersDisappearedInAnArray448 { method findDisappearedNumbers (line 20) | public List findDisappearedNumbers(int[] nums) { method swap (line 43) | private void swap(int[] nums, int i, int j) { FILE: src/FindAnagramMappings760.java class FindAnagramMappings760 (line 26) | public class FindAnagramMappings760 { method anagramMappings (line 30) | public int[] anagramMappings(int[] A, int[] B) { FILE: src/FindAndReplacePattern890.java class FindAndReplacePattern890 (line 29) | public class FindAndReplacePattern890 { method findAndReplacePattern (line 30) | public List findAndReplacePattern(String[] words, String patte... method isPermutation (line 42) | public boolean isPermutation(char[] word, char[] pattern, int N) { method findAndReplacePattern2 (line 56) | public List findAndReplacePattern2(String[] words, String patt... method encode (line 67) | public int encode(String s) { FILE: src/FindBottomLeftTreeValue513.java class FindBottomLeftTreeValue513 (line 43) | public class FindBottomLeftTreeValue513 { method findBottomLeftValue (line 44) | public int findBottomLeftValue(TreeNode root) { method findBottomLeftValue2 (line 65) | public int findBottomLeftValue2(TreeNode root) { method helper (line 72) | private int helper(TreeNode node, int level, Map lef... method findBottomLeftValue3 (line 83) | public int findBottomLeftValue3(TreeNode root) { method findBottomLeftValue (line 86) | public int findBottomLeftValue(TreeNode root, int depth, int[] res) { FILE: src/FindCenterOfMassInA2DArray.java class FindCenterOfMassInA2DArray (line 6) | public class FindCenterOfMassInA2DArray { method findCenterOfMass (line 7) | public int[] findCenterOfMass(int[][] weightMap) { FILE: src/FindDuplicateSubtrees652.java class FindDuplicateSubtrees652 (line 40) | public class FindDuplicateSubtrees652 { method findDuplicateSubtrees (line 41) | public List findDuplicateSubtrees(TreeNode root) { method findDuplicates (line 49) | private String findDuplicates(TreeNode root, Map visi... FILE: src/FindEventualSafeStates802.java class FindEventualSafeStates802 (line 32) | public class FindEventualSafeStates802 { method eventualSafeNodes (line 33) | public List eventualSafeNodes(int[][] graph) { method checkTermial (line 46) | private boolean checkTermial(int[][] graph, int now, boolean[] visited... method eventualSafeNodes2 (line 62) | public List eventualSafeNodes2(int[][] graph) { method dfs (line 74) | public boolean dfs(int node, int[] color, int[][] graph) { FILE: src/FindKClosestElements658.java class FindKClosestElements658 (line 26) | public class FindKClosestElements658 { method findClosestElements (line 27) | public List findClosestElements(int[] arr, int k, int x) { method binarySearch (line 51) | public int binarySearch(int[] arr, int x, int lo, int hi) { method updatePos (line 63) | private int updatePos(int[] arr, int x, int pos) { method findClosestElements3 (line 79) | public List findClosestElements3(int[] arr, int k, int x) { method findClosestElements4 (line 115) | public List findClosestElements4(int[] arr, int k, int x) { method binarySearch (line 142) | private int binarySearch(int[] arr, int x) { FILE: src/FindKPairsWithSmallestSums373.java class FindKPairsWithSmallestSums373 (line 38) | public class FindKPairsWithSmallestSums373 { method kSmallestPairs (line 42) | public List kSmallestPairs(int[] nums1, int[] nums2, int k) { method kSmallestPairs2 (line 59) | public List kSmallestPairs2(int[] nums1, int[] nums2, int k) { class Pair (line 79) | class Pair{ method Pair (line 83) | Pair(int idx, int n1, int n2){ class CompPair (line 90) | class CompPair implements Comparator { method compare (line 91) | public int compare(Pair p1, Pair p2){ method kSmallestPairs3 (line 99) | public List kSmallestPairs3(int[] nums1, int[] nums2, int k) { class Tuple (line 114) | class Tuple implements Comparable { method Tuple (line 116) | public Tuple (int x, int y, int val) { method compareTo (line 122) | @Override FILE: src/FindKthSmallestPairDistance719.java class FindKthSmallestPairDistance719 (line 26) | public class FindKthSmallestPairDistance719 { method smallestDistancePair (line 27) | public int smallestDistancePair(int[] nums, int k) { method smallestDistancePair3 (line 49) | public int smallestDistancePair3(int[] nums, int k) { method count (line 67) | private int count(int[] nums, int x) { FILE: src/FindLargestValueInEachTreeRow515.java class FindLargestValueInEachTreeRow515 (line 26) | public class FindLargestValueInEachTreeRow515 { method largestValues (line 27) | public List largestValues(TreeNode root) { method largestValues2 (line 50) | public List largestValues2(TreeNode root) { method helper (line 56) | private void helper(TreeNode root, List res, int d){ FILE: src/FindMedianFromDataStream295.java class FindMedianFromDataStream295 (line 25) | public class FindMedianFromDataStream295 { class MedianFinder (line 26) | class MedianFinder { method MedianFinder (line 31) | public MedianFinder() { method addNum (line 35) | public void addNum(int num) { method findMedian (line 59) | public double findMedian() { class MedianFinder2 (line 71) | class MedianFinder2 { method MedianFinder (line 76) | public MedianFinder() { method addNum (line 81) | public void addNum(int num) { method findMedian (line 89) | public double findMedian() { class MedianFinder3 (line 104) | class MedianFinder3 { class TreeNode (line 105) | class TreeNode{ method TreeNode (line 108) | TreeNode(int val, TreeNode p){ method add (line 114) | void add(int num){ method next (line 127) | TreeNode next(){ method prev (line 141) | TreeNode prev(){ method addNum (line 159) | public void addNum(int num) { method findMedian (line 177) | public double findMedian() { class MedianFinder4 (line 186) | class MedianFinder4 { method MedianFinder (line 191) | public MedianFinder() { method addNum (line 196) | public void addNum(int num) { method findMedian (line 211) | public double findMedian() { FILE: src/FindMinimumInRotatedSortedArray153.java class FindMinimumInRotatedSortedArray153 (line 23) | public class FindMinimumInRotatedSortedArray153 { method findMin (line 24) | public int findMin(int[] nums) { method findMin (line 28) | public int findMin(int[] nums, int s, int e) { method findMin2 (line 35) | public int findMin2(int[] nums) { method findMin3 (line 50) | public int findMin3(int[] nums) { method findMin4 (line 68) | public int findMin4(int[] nums) { FILE: src/FindMinimumInRotatedSortedArrayII154.java class FindMinimumInRotatedSortedArrayII154 (line 25) | public class FindMinimumInRotatedSortedArrayII154 { method findMin (line 26) | public int findMin(int[] nums) { method findMin2 (line 34) | public int findMin2(int[] nums) { method findMin (line 38) | private int findMin(int[] nums, int i, int j) { method findMin3 (line 46) | public int findMin3(int[] nums) { FILE: src/FindModeInBinarySearchTree501.java class FindModeInBinarySearchTree501 (line 36) | public class FindModeInBinarySearchTree501 { method findMode (line 37) | public int[] findMode(TreeNode root) { method findMode (line 48) | private void findMode(TreeNode root, Result result) { class Result (line 79) | class Result { method Result (line 84) | Result() { method findMode2 (line 96) | public int[] findMode2(TreeNode root) { method handleValue (line 112) | private void handleValue(int val) { method inorder (line 128) | private void inorder(TreeNode root) { FILE: src/FindPeakElement162.java class FindPeakElement162 (line 19) | public class FindPeakElement162 { method findPeakElement (line 20) | public int findPeakElement(int[] nums) { method findPeakElement2 (line 40) | public int findPeakElement2(int[] nums) { method findPeakElement3 (line 49) | public int findPeakElement3(int[] nums) { method search (line 52) | public int search(int[] nums, int l, int r) { method findPeakElement4 (line 62) | public int findPeakElement4(int[] nums) { FILE: src/FindTheCelebrity277.java class FindTheCelebrity277 (line 24) | public class FindTheCelebrity277 { method findCelebrity (line 26) | public int findCelebrity(int n) { method findCelebrity2 (line 48) | public int findCelebrity2(int n) { method findCelebrity3 (line 77) | public int findCelebrity3(int n) { method findCelebrity4 (line 93) | public int findCelebrity4(int n) { method findCelebrity5 (line 102) | public int findCelebrity5(int n) { FILE: src/FindTheDuplicateNumber287.java class FindTheDuplicateNumber287 (line 22) | public class FindTheDuplicateNumber287 { method findDuplicate (line 23) | public int findDuplicate(int[] nums) { method findDuplicate2 (line 37) | public int findDuplicate2(int[] nums) { FILE: src/FirstBadVersion278.java class FirstBadVersion278 (line 20) | public class FirstBadVersion278 extends VersionControl { method firstBadVersion (line 22) | public int firstBadVersion(int n) { method firstBadVersion (line 26) | private int firstBadVersion(int i, int j) { method firstBadVersion2 (line 36) | public int firstBadVersion2(int n) { FILE: src/FirstMissingPositive41.java class FirstMissingPositive41 (line 16) | public class FirstMissingPositive41 { method firstMissingPositive (line 17) | public int firstMissingPositive(int[] nums) { method firstMissingPositive2 (line 64) | public int firstMissingPositive2(int[] nums) { method firstMissingPositive3 (line 93) | public int firstMissingPositive3(int[] A) { method swap (line 105) | private void swap(int[] A, int i, int j){ method firstMissingPositive4 (line 112) | public int firstMissingPositive4(int[] nums) { FILE: src/FirstUniqueCharacterInAString387.java class FirstUniqueCharacterInAString387 (line 18) | public class FirstUniqueCharacterInAString387 { method firstUniqChar (line 19) | public int firstUniqChar(String s) { method firstUniqChar2 (line 52) | public int firstUniqChar2(String s) { method firstUniqChar3 (line 71) | public int firstUniqChar3(String s) { method firstUniqChar4 (line 97) | public static int firstUniqChar4(String s) { method firstUniqChar5 (line 107) | public int firstUniqChar5(String s) { method firstUniqChar6 (line 123) | public int firstUniqChar6(String s) { FILE: src/FizzBuzz412.java class FizzBuzz412 (line 29) | public class FizzBuzz412 { method fizzBuzz (line 30) | public List fizzBuzz(int n) { FILE: src/Flatten2DVector251.java class Flatten2DVector251 (line 21) | public class Flatten2DVector251 { class Vector2D (line 22) | class Vector2D implements Iterator { method Vector2D (line 26) | public Vector2D(List> vec2d) { method next (line 35) | @Override method hasNext (line 41) | @Override FILE: src/FlattenBinaryTreeToLinkedList114.java class FlattenBinaryTreeToLinkedList114 (line 37) | public class FlattenBinaryTreeToLinkedList114 { method flatten (line 38) | public void flatten(TreeNode root) { method flattenNode (line 42) | private TreeNode flattenNode(TreeNode root) { method flatten2 (line 67) | public void flatten2(TreeNode root) { method helper (line 71) | private TreeNode helper(TreeNode root) { method flatten3 (line 89) | public void flatten3(TreeNode root) { method flatten4 (line 107) | public void flatten4(TreeNode root) { method flatten (line 111) | private TreeNode flatten(TreeNode root, TreeNode pre) { method main (line 122) | public static void main(String[] args) { FILE: src/FlipGame293.java class FlipGame293 (line 21) | public class FlipGame293 { method generatePossibleNextMoves (line 22) | public List generatePossibleNextMoves(String s) { FILE: src/FlippingAnImage832.java class FlippingAnImage832 (line 28) | public class FlippingAnImage832 { method flipAndInvertImage (line 29) | public int[][] flipAndInvertImage(int[][] A) { method flipAndInvertImage2 (line 41) | public int[][] flipAndInvertImage2(int[][] A) { method reverseAndFlip (line 48) | private void reverseAndFlip(int[] row) { method swapAndFlip (line 56) | private void swapAndFlip(int[] row, int i, int j) { FILE: src/FourSum18.java class FourSum18 (line 22) | public class FourSum18 { method fourSum (line 23) | public List> fourSum(int[] nums, int target) { method fourSum2 (line 58) | public List> fourSum2(int[] num, int target) { method fourSum3 (line 94) | public List> fourSum3(int[] nums, int target) { method kSum (line 99) | private ArrayList> kSum(int[] nums, int target, int k, i... FILE: src/FourSumII454.java class FourSumII454 (line 24) | public class FourSumII454 { method fourSumCount (line 25) | public int fourSumCount(int[] A, int[] B, int[] C, int[] D) { method invalid (line 48) | private boolean invalid(int[] arr) { method fourSumCount2 (line 53) | public int fourSumCount2(int[] A, int[] B, int[] C, int[] D) { FILE: src/FractionToRecurringDecimal166.java class FractionToRecurringDecimal166 (line 16) | public class FractionToRecurringDecimal166 { method fractionToDecimal (line 17) | public String fractionToDecimal(int numerator, int denominator) { method fractionToDecimal2 (line 63) | public String fractionToDecimal2(int numerator, int denominator) { FILE: src/FriendCircles547.java class FriendCircles547 (line 40) | public class FriendCircles547 { method findCircleNum (line 41) | public int findCircleNum(int[][] M) { method helper (line 55) | private void helper(int[][] M, boolean[] visited, int i) { FILE: src/FrogJump403.java class FrogJump403 (line 42) | public class FrogJump403 { method canCross (line 43) | public boolean canCross(int[] stones) { FILE: src/GameOfLife289.java class GameOfLife289 (line 29) | public class GameOfLife289 { method gameOfLife (line 30) | public void gameOfLife(int[][] board) { method countLive (line 54) | private int countLive(int[][] board, int x, int y) { method gameOfLife2 (line 71) | public void gameOfLife2(int[][] board) { method liveNeighbors (line 97) | public int liveNeighbors(int[][] board, int m, int n, int i, int j) { method gameOfLife3 (line 109) | public void gameOfLife3(int[][] board) { method update (line 124) | private void update(int[][] board, int i, int j, int M, int N) { method refresh (line 145) | private void refresh(int[][] board, int i, int j) { FILE: src/GeneralizedAbbreviation320.java class GeneralizedAbbreviation320 (line 13) | public class GeneralizedAbbreviation320 { method generateAbbreviations (line 14) | public List generateAbbreviations(String word) { method backtrace (line 23) | private void backtrace(char[] word, List res, boolean prevIsWo... method generateAbbreviations2 (line 48) | public List generateAbbreviations2(String word) { method abbr (line 56) | private String abbr(String word, int x) { FILE: src/GenerateParentheses22.java class GenerateParentheses22 (line 20) | public class GenerateParentheses22 { method generateParenthesis (line 21) | public List generateParenthesis(int n) { method addOnePair (line 34) | private List addOnePair(List source, Integer n) { method generateParenthesis2 (line 51) | public List generateParenthesis2(int n) { method backtrack (line 57) | private void backtrack(List list, String str, int open, int cl... method generateParenthesis3 (line 75) | public List generateParenthesis3(int n) { method helper (line 81) | private void helper(List res, StringBuilder sb, int open, int ... method main (line 100) | public static void main(String[] args) { FILE: src/GraphValidTree261.java class GraphValidTree261 (line 18) | public class GraphValidTree261 { method validTree (line 22) | public boolean validTree(int n, int[][] edges) { method isValid (line 37) | private boolean isValid(Map> graph, boolean[] vi... method constructGraph (line 50) | private Map> constructGraph(int n, int[][] edges) { method validTree2 (line 63) | public boolean validTree2(int n, int[][] edges) { class DisjointSet (line 78) | class DisjointSet { method DisjointSet (line 82) | public DisjointSet(int n) { method find (line 88) | public int find(int x) { method union (line 95) | public void union(int x, int y) { method validTree3 (line 113) | public boolean validTree3(int n, int[][] edges) { method find (line 134) | int find(int nums[], int i) { FILE: src/GroupAnagrams49.java class GroupAnagrams49 (line 15) | public class GroupAnagrams49 { method groupAnagrams (line 16) | public List> groupAnagrams(String[] strs) { method getSortedString (line 29) | private String getSortedString(String s) { method groupAnagrams2 (line 38) | public static List> groupAnagrams2(String[] strs) { FILE: src/GroupShiftedStrings249.java class GroupShiftedStrings249 (line 21) | public class GroupShiftedStrings249 { method groupStrings (line 22) | public List> groupStrings(String[] strings) { method getDiff (line 50) | private int getDiff(char c1, char c2) { method groupStrings2 (line 61) | public List> groupStrings2(String[] strings) { FILE: src/GuessNumberHigherOrLowerII375.java class GuessNumberHigherOrLowerII375 (line 25) | public class GuessNumberHigherOrLowerII375 { method getMoneyAmount (line 46) | public int getMoneyAmount(int n) { method getMoneyAmount (line 50) | public int getMoneyAmount(int l, int r, int[][] memo) { method getMoneyAmount2 (line 64) | public int getMoneyAmount2(int n) { method getMoneyAmount3 (line 82) | public int getMoneyAmount3(int n) { FILE: src/GuessTheWord843.java class GuessTheWord843 (line 47) | public class GuessTheWord843 { method findSecretWord (line 51) | public void findSecretWord(String[] wordlist, Master master) { method match (line 61) | public int match(String a, String b) { method findSecretWord2 (line 71) | public void findSecretWord2(String[] wordlist, Master master) { class Pair (line 84) | class Pair { method Pair (line 87) | Pair (String s, Integer i) { FILE: src/HIndex274.java class HIndex274 (line 19) | public class HIndex274 { method hIndex (line 20) | public int hIndex(int[] citations) { method hIndex2 (line 42) | public int hIndex2(int[] citations) { method hIndex3 (line 59) | public int hIndex3(int[] citations) { method hIndex4 (line 99) | public int hIndex4(int[] citations) { method hIndex5 (line 129) | public int hIndex5(int[] citations) { method hIndex6 (line 141) | public int hIndex6(int[] citations) { method hIndex7 (line 154) | public int hIndex7(int[] citations) { FILE: src/HandOfStraights846.java class HandOfStraights846 (line 25) | public class HandOfStraights846 { method isNStraightHand (line 26) | public boolean isNStraightHand(int[] hand, int W) { method isNStraightHand2 (line 51) | public boolean isNStraightHand2(int[] hand, int W) { method isNStraightHand3 (line 77) | public boolean isNStraightHand3(int[] hands, int W) { FILE: src/HappyNumber202.java class HappyNumber202 (line 21) | public class HappyNumber202 { method isHappy (line 22) | public boolean isHappy(int n) { method next (line 35) | private int next(int n) { method isHappy2 (line 49) | public boolean isHappy2(int n) { method digitSquareSum (line 61) | private int digitSquareSum(int n) { FILE: src/HighestPopulationYear.java class HighestPopulationYear (line 9) | public class HighestPopulationYear { method find (line 12) | public static int find(int[][] people) { method find2 (line 37) | public static int find2(int[][] people) { method find3 (line 62) | public static int find3(int[][] people) { method main (line 91) | public static void main(String[] args) { FILE: src/HouseRobber198.java class HouseRobber198 (line 14) | public class HouseRobber198 { method rob (line 15) | public int rob(int[] nums) { method rob2 (line 36) | public int rob2(int[] nums) { FILE: src/HouseRobberII213.java class HouseRobberII213 (line 16) | public class HouseRobberII213 { method rob (line 17) | public int rob(int[] nums) { method rob2 (line 38) | public int rob2(int[] nums) { method rob (line 43) | private int rob(int[] num, int lo, int hi) { method rob3 (line 54) | public int rob3(int[] nums) { method rob3 (line 61) | public int rob3(int[] nums, int i, int j) { FILE: src/HouseRobberIII337.java class HouseRobberIII337 (line 43) | public class HouseRobberIII337 { method rob (line 44) | public int rob(TreeNode root) { method helper (line 48) | private DP helper(TreeNode root) { class DP (line 65) | class DP { method DP (line 68) | DP(Integer last, Integer prev) { method rob2 (line 75) | public int rob2(TreeNode root) { method helper2 (line 80) | public int[] helper2(TreeNode root) { FILE: src/ImageSmoother661.java class ImageSmoother661 (line 29) | public class ImageSmoother661 { method imageSmoother (line 31) | public int[][] imageSmoother(int[][] M) { FILE: src/ImplementMagicDictionary676.java class ImplementMagicDictionary676 (line 28) | public class ImplementMagicDictionary676 { class MagicDictionary (line 30) | class MagicDictionary { method MagicDictionary (line 34) | public MagicDictionary() { method buildDict (line 38) | public void buildDict(String[] dict) { method search (line 45) | public boolean search(String word) { class Trie (line 49) | class Trie { method add (line 53) | void add(String word) { method add (line 58) | void add(char[] word, int i) { method search (line 69) | boolean search(String word) { method search (line 74) | boolean search(char[] word, int start, boolean modified) { class MagicDictionary2 (line 97) | class MagicDictionary2 { method MagicDictionary (line 99) | public MagicDictionary() { method buildDict (line 103) | public void buildDict(String[] words) { method search (line 109) | public boolean search(String word) { class MagicDictionary3 (line 128) | public class MagicDictionary3 { method MagicDictionary (line 132) | public MagicDictionary() { method generalizedNeighbors (line 137) | private ArrayList generalizedNeighbors(String word) { method buildDict (line 150) | public void buildDict(String[] words) { method search (line 159) | public boolean search(String word) { FILE: src/ImplementQueueUsingStacks232.java class ImplementQueueUsingStacks232 (line 31) | public class ImplementQueueUsingStacks232 { class MyQueue (line 33) | class MyQueue { method MyQueue (line 37) | public MyQueue() { method push (line 42) | public void push(int x) { method pop (line 55) | public int pop() { method peek (line 60) | public int peek() { method empty (line 65) | public boolean empty() { FILE: src/ImplementStackusingQueues225.java class ImplementStackUsingQueues225 (line 20) | public class ImplementStackUsingQueues225 { class MyStack (line 22) | public class MyStack { method MyStack (line 28) | public MyStack() { method push (line 33) | public void push(int x) { method pop (line 47) | public int pop() { method top (line 66) | public int top() { method empty (line 71) | public boolean empty() { class MyStack2 (line 77) | public class MyStack2 { method MyStack (line 82) | public MyStack() { method push (line 87) | public void push(int x) { method pop (line 97) | public int pop() { method top (line 102) | public int top() { method empty (line 107) | public boolean empty() { FILE: src/ImplementStrStr28.java class ImplementStrStr28 (line 18) | public class ImplementStrStr28 { method strStr (line 19) | public int strStr(String haystack, String needle) { method strStr2 (line 42) | public int strStr2(String haystack, String needle) { FILE: src/ImplementTriePrefixTree208.java class ImplementTriePrefixTree208 (line 21) | public class ImplementTriePrefixTree208 { class Trie (line 23) | class Trie { method Trie (line 29) | public Trie() { method insert (line 34) | public void insert(String word) { method insert (line 38) | private void insert(char[] chars, int i) { method search (line 50) | public boolean search(String word) { method search (line 54) | private boolean search(char[] chars, int i) { method startsWith (line 61) | public boolean startsWith(String prefix) { method startsWith (line 65) | private boolean startsWith(char[] chars, int i) { class Trie2 (line 77) | class Trie2 { method Trie (line 81) | public Trie() { method insert (line 86) | public void insert(String word) { method search (line 99) | public boolean search(String word) { method startsWith (line 112) | public boolean startsWith(String prefix) { class TrieNode (line 125) | class TrieNode { method TrieNode (line 133) | public TrieNode() { method containsKey (line 137) | public boolean containsKey(char c) { method get (line 140) | public TrieNode get(char c) { method put (line 143) | public void put(char c, TrieNode node) { method setLeaf (line 146) | public void setLeaf() { method isLeaf (line 149) | public boolean isLeaf() { FILE: src/IncreasingSubsequences491.java class IncreasingSubsequences491 (line 17) | public class IncreasingSubsequences491 { method findSubsequences (line 18) | public List> findSubsequences(int[] nums) { method helper (line 24) | private void helper(int[] nums, int pre, int start, List path... FILE: src/IncreasingTripletSubsequence334.java class IncreasingTripletSubsequence334 (line 19) | public class IncreasingTripletSubsequence334 { method increasingTriplet (line 20) | public boolean increasingTriplet(int[] nums) { method increasingTriplet2 (line 32) | public boolean increasingTriplet2(int[] nums) { method increasingTriplet3 (line 52) | public boolean increasingTriplet3(int[] nums) { FILE: src/InorderSuccessorInBST285.java class InorderSuccessorInBST285 (line 18) | public class InorderSuccessorInBST285 { method inorderSuccessor (line 20) | public TreeNode inorderSuccessor(TreeNode root, TreeNode p) { method findMin (line 37) | private TreeNode findMin(TreeNode n) { method inorderSuccessor2 (line 46) | public TreeNode inorderSuccessor2(TreeNode root, TreeNode x) { method inorderSuccessor2 (line 52) | public TreeNode inorderSuccessor2(TreeNode root, TreeNode x, TreeNode ... method inorderSuccessor3 (line 62) | public TreeNode inorderSuccessor3(TreeNode root, TreeNode p) { method inorderSuccessor3 (line 66) | public TreeNode inorderSuccessor3(TreeNode root, TreeNode p, TreeNode ... method inorderSuccessor4 (line 84) | public TreeNode inorderSuccessor4(TreeNode root, TreeNode p) { FILE: src/InsertDeleteGetRandomOOne380.java class InsertDeleteGetRandomOOne380 (line 39) | public class InsertDeleteGetRandomOOne380 { class RandomizedSet (line 40) | public class RandomizedSet { method RandomizedSet (line 45) | public RandomizedSet() { method insert (line 51) | public boolean insert(int val) { method remove (line 56) | public boolean remove(int val) { method getRandom (line 61) | public int getRandom() { class RandomizedSet2 (line 67) | public class RandomizedSet2 { method RandomizedSet (line 74) | public RandomizedSet() { method insert (line 81) | public boolean insert(int val) { method remove (line 89) | public boolean remove(int val) { method getRandom (line 107) | public int getRandom() { class RandomizedSet3 (line 113) | class RandomizedSet3 { method RandomizedSet (line 121) | public RandomizedSet() { method insert (line 126) | public boolean insert(int val) { method remove (line 141) | public boolean remove(int val) { method getRandom (line 150) | public int getRandom() { FILE: src/InsertInterval57.java class InsertInterval57 (line 30) | public class InsertInterval57 { method insert (line 31) | public List insert(List intervals, Interval newInt... method main (line 62) | public static void main(String[] args) { FILE: src/InsertIntoACyclicSortedList.java class InsertIntoACyclicSortedList (line 43) | public class InsertIntoACyclicSortedList { method insert (line 44) | public Node insert(Node head, int insertVal) { method insert2 (line 71) | public Node insert2(Node head, int insertVal) { FILE: src/InsertionSortList147.java class InsertionSortList147 (line 14) | public class InsertionSortList147 { method insertionSortList (line 15) | public ListNode insertionSortList(ListNode head) { method insert (line 37) | private void insert(ListNode dummy, ListNode newNode) { method insertionSortList2 (line 55) | public ListNode insertionSortList2(ListNode head) { FILE: src/IntegerBreak343.java class IntegerBreak343 (line 18) | public class IntegerBreak343 { method integerBreak (line 19) | public int integerBreak(int n) { method integerBreak2 (line 38) | public int integerBreak2(int n) { FILE: src/IntegerToEnglishWords273.java class IntegerToEnglishWords273 (line 12) | public class IntegerToEnglishWords273 { method numberToWords (line 21) | public String numberToWords(int num) { method threeDigits (line 38) | private String threeDigits(int num) { method twoDigits (line 47) | private String twoDigits(int num) { FILE: src/IntegerToRoman12.java class IntegerToRoman12 (line 54) | public class IntegerToRoman12 { method intToRoman (line 57) | public String intToRoman(int num) { method curr (line 72) | private char[] curr(int digit, int base) { method intToRoman2 (line 95) | public static String intToRoman2(int num) { FILE: src/InterleavingString97.java class InterleavingString97 (line 18) | public class InterleavingString97 { class Pair (line 20) | class Pair { method Pair (line 24) | Pair(int i, int j, int k) { method isInterleave (line 31) | public boolean isInterleave(String s1, String s2, String s3) { method isInterleave2 (line 71) | public boolean isInterleave2(String s1, String s2, String s3) { method isInterleave3 (line 102) | public boolean isInterleave3(String s1, String s2, String s3) { method isInterleave4 (line 144) | public boolean isInterleave4(String s1, String s2, String s3) { method dfs (line 151) | public boolean dfs(char[] c1, char[] c2, char[] c3, int i, int j, int ... FILE: src/IntersectionOfTwoArrays349.java class IntersectionOfTwoArrays349 (line 15) | public class IntersectionOfTwoArrays349 { method intersection (line 17) | public static int[] intersection(int[] nums1, int[] nums2) { method intersection2 (line 46) | public int[] intersection2(int[] nums1, int[] nums2) { FILE: src/IntersectionOfTwoArraysII350.java class IntersectionOfTwoArraysII350 (line 20) | public class IntersectionOfTwoArraysII350 { method intersect (line 21) | public int[] intersect(int[] nums1, int[] nums2) { method intersect2 (line 58) | public int[] intersect2(int[] nums1, int[] nums2) { method intersect3 (line 81) | public int[] intersect3(int[] nums1, int[] nums2) { FILE: src/IntersectionOfTwoLinkedLists160.java class IntersectionOfTwoLinkedLists160 (line 35) | public class IntersectionOfTwoLinkedLists160 { method getIntersectionNode (line 36) | public ListNode getIntersectionNode(ListNode headA, ListNode headB) { method getIntersectionNode2 (line 69) | public ListNode getIntersectionNode2(ListNode headA, ListNode headB) { method getIntersectionNode3 (line 112) | public ListNode getIntersectionNode3(ListNode headA, ListNode headB) { method getIntersectionNode4 (line 130) | public ListNode getIntersectionNode4(ListNode headA, ListNode headB) { FILE: src/Interval.java class Interval (line 5) | public class Interval { method Interval (line 8) | Interval() { start = 0; end = 0; } method Interval (line 9) | Interval(int s, int e) { start = s; end = e; } FILE: src/InvertBinaryTree226.java class InvertBinaryTree226 (line 30) | public class InvertBinaryTree226 { method invertTree (line 31) | public TreeNode invertTree(TreeNode root) { FILE: src/IsGraphBipartite785.java class IsGraphBipartite785 (line 43) | public class IsGraphBipartite785 { method isBipartite (line 44) | public boolean isBipartite(int[][] graph) { method helper (line 54) | private boolean helper(int[][] graph, int curr, int[] visited, int pre) { method isBipartite2 (line 67) | public boolean isBipartite2(int[][] graph) { method isBipartite3 (line 97) | public boolean isBipartite3(int[][] graph) { method findParent (line 118) | private int findParent(int[]parent, int p){ FILE: src/IsSubsequence392.java class IsSubsequence392 (line 27) | public class IsSubsequence392 { method isSubsequence (line 28) | public boolean isSubsequence(String s, String t) { method isSubsequence2 (line 52) | public boolean isSubsequence2(String s, String t) { method isSubsequence3 (line 64) | public boolean isSubsequence3(String s, String t) { FILE: src/IslandPerimeter463.java class IslandPerimeter463 (line 24) | public class IslandPerimeter463 { method islandPerimeter (line 26) | public int islandPerimeter(int[][] grid) { method perimeter (line 39) | private int perimeter(int[][] grid, int i, int j, int n, int m) { method islandPerimeter2 (line 55) | public int islandPerimeter2(int[][] grid) { FILE: src/IsomorphicStrings205.java class IsomorphicStrings205 (line 26) | public class IsomorphicStrings205 { method isIsomorphic (line 27) | public boolean isIsomorphic(String s, String t) { method isIsomorphic2 (line 50) | public boolean isIsomorphic2(String s1, String s2) { method isIsomorphic3 (line 60) | public boolean isIsomorphic3(String sString, String tString) { method isIsomorphic4 (line 86) | public boolean isIsomorphic4(String sString, String tString) { method encode (line 90) | private int encode(char[] chars) { FILE: src/JewelsAndStones771.java class JewelsAndStones771 (line 24) | public class JewelsAndStones771 { method numJewelsInStones (line 25) | public int numJewelsInStones(String J, String S) { FILE: src/JudgeRouteCircle657.java class JudgeRouteCircle657 (line 21) | public class JudgeRouteCircle657 { method judgeCircle (line 22) | public boolean judgeCircle(String s) { FILE: src/JumpGame55.java class JumpGame55 (line 17) | public class JumpGame55 { method canJump (line 18) | public boolean canJump(int[] nums) { method canJump2 (line 43) | public boolean canJump2(int[] nums) { method canJumpHelper (line 47) | boolean canJumpHelper(int A[], int n) { method canJump3 (line 59) | public boolean canJump3(int[] A) { method canJump4 (line 72) | public boolean canJump4(int[] nums) { FILE: src/JumpGameII45.java class JumpGameII45 (line 19) | public class JumpGameII45 { method jump (line 20) | public int jump(int[] nums) { method jump2 (line 38) | public int jump2(int[] A) { FILE: src/KEmptySlots683.java class KEmptySlots683 (line 36) | public class KEmptySlots683 { method kEmptySlots (line 37) | public int kEmptySlots(int[] flowers, int k) { method kEmptySlots2 (line 75) | public int kEmptySlots2(int[] flowers, int k) { FILE: src/KMP.java class KMP (line 5) | public class KMP { method find (line 10) | public static int find(String txt, String pat, int[] next) { method getNext (line 27) | public static int[] getNext(String pat) { method main (line 46) | public static void main(String[] args) { FILE: src/KeysAndRooms841.java class KeysAndRooms841 (line 36) | public class KeysAndRooms841 { method canVisitAllRooms (line 37) | public boolean canVisitAllRooms(List> rooms) { method canVisitAllRooms2 (line 63) | public boolean canVisitAllRooms2(List> rooms) { method enterRoom (line 68) | private void enterRoom(int roomId, List> rooms) { FILE: src/KillProcess582.java class KillProcess582 (line 38) | public class KillProcess582 { method killProcess (line 39) | public List killProcess(List pid, List ppid... method constructTree (line 46) | private TreeNode constructTree(List pid, List ppid) { method findNode (line 79) | private void findNode(TreeNode root, int kill, List res) { method gatherResults (line 94) | private void gatherResults(TreeNode found, List res) { class TreeNode (line 102) | class TreeNode { method TreeNode (line 105) | TreeNode(int x) { method killProcess2 (line 111) | public List killProcess2(List pid, List ppi... method findKill (line 118) | private TreeNode findKill(List pid, List ppid, int k... class Node (line 155) | class Node { method killProcess3 (line 159) | public List < Integer > killProcess3(List < Integer > pid, List < Inte... method getAllChildren (line 177) | public void getAllChildren(Node pn, List < Integer > l) { method killProcess4 (line 188) | public List killProcess4(List pid, List ppi... method traverse (line 207) | private void traverse(Map> tree, List r... method killProcess5 (line 222) | public List < Integer > killProcess5(List < Integer > pid, List < Inte... FILE: src/KokoEatingBananas875.java class KokoEatingBananas875 (line 33) | public class KokoEatingBananas875 { method minEatingSpeed (line 34) | public int minEatingSpeed(int[] piles, int H) { method countHours (line 46) | private int countHours(int[] piles, int K) { FILE: src/KthLargestElementInAnArray215.java class KthLargestElementInAnArray215 (line 13) | public class KthLargestElementInAnArray215 { method findKthLargest (line 14) | public int findKthLargest(int[] nums, int k) { method findKthLargest2 (line 22) | public int findKthLargest2(int[] nums, int k) { method findKthLargest3 (line 38) | public int findKthLargest3(int[] nums, int k) { method partition (line 56) | private int partition(int[] a, int lo, int hi) { method exch (line 72) | private void exch(int[] a, int i, int j) { method less (line 78) | private boolean less(int v, int w) { method findKthLargest4 (line 85) | public int findKthLargest4(int[] nums, int k) { method shuffle (line 104) | private void shuffle(int a[]) { method findKthLargest5 (line 113) | public int findKthLargest5(int[] nums, int k) { method count (line 134) | private int count(int[] nums, int mid) { method findKthLargest6 (line 142) | public int findKthLargest6(int[] nums, int k) { method partition2 (line 160) | private int partition2(int[] nums, int lo, int hi) { method swap (line 176) | private void swap(int[] nums, int i, int j) { FILE: src/KthSmallestElementInABST230.java class KthSmallestElementInABST230 (line 26) | public class KthSmallestElementInABST230 { method kthSmallest (line 27) | public int kthSmallest(TreeNode root, int k) { method kthSmallest (line 33) | public void kthSmallest(TreeNode root, int k, Stack st) { method kthSmallest2 (line 46) | public int kthSmallest2(TreeNode root, int k) { method kthSmallest (line 52) | public void kthSmallest(TreeNode root, int k, int[] i) { method kthSmallest3 (line 64) | public int kthSmallest3(TreeNode root, int k) { method kth (line 75) | public int kth(TreeNode root) { FILE: src/KthSmallestElementInASortedMatrix378.java class KthSmallestElementInASortedMatrix378 (line 25) | public class KthSmallestElementInASortedMatrix378 { method kthSmallest (line 41) | public int kthSmallest(int[][] matrix, int k) { method kthSmallest2 (line 69) | public int kthSmallest2(int[][] matrix, int k) { class Tuple (line 81) | class Tuple implements Comparable { method Tuple (line 83) | public Tuple (int x, int y, int val) { method compareTo (line 89) | @Override FILE: src/KthSmallestPrimeFraction786.java class KthSmallestPrimeFraction786 (line 28) | public class KthSmallestPrimeFraction786 { method kthSmallestPrimeFraction (line 29) | public int[] kthSmallestPrimeFraction(int[] A, int K) { method kthSmallestPrimeFraction2 (line 65) | public int[] kthSmallestPrimeFraction2(int[] a, int k) { method kthSmallestPrimeFraction3 (line 96) | public int[] kthSmallestPrimeFraction3(int[] A, int K) { FILE: src/KthSymbolInGrammar779.java class KthSymbolInGrammar779 (line 33) | public class KthSymbolInGrammar779 { method kthGrammar (line 34) | public int kthGrammar(int N, int K) { FILE: src/LFUCache460.java class LFUCache460 (line 31) | public class LFUCache460 { class LFUCache (line 32) | class LFUCache { method LFUCache (line 39) | public LFUCache(int capacity) { method get (line 43) | public int get(int key) { method deleteFromList (line 52) | private void deleteFromList(Node node) { method addToListEnd (line 57) | private void addToListEnd(Node head, Node node) { method addOnTreeMap (line 64) | private void addOnTreeMap(Node node) { method deleteFromTreeMap (line 73) | private void deleteFromTreeMap(Node node) { method put (line 81) | public void put(int key, int value) { method newHead (line 103) | private Node newHead() { class Node (line 110) | class Node { method Node (line 116) | Node(int key, int val, int freq) { class LFUCache2 (line 125) | class LFUCache2 { method LFUCache (line 131) | public LFUCache(int capacity) { method get (line 138) | public int get(int key) { method updateNodeFreq (line 145) | private void updateNodeFreq(ItemNode item) { method itemNodeIsEmpty (line 163) | private boolean itemNodeIsEmpty(ItemNode node) { method removeNode (line 167) | private void removeNode(FreqNode node) { method removeNode (line 172) | private void removeNode(ItemNode node) { method dislinkNode (line 177) | private void dislinkNode(FreqNode node) { method dislinkNode (line 182) | private void dislinkNode(ItemNode node) { method addAfter (line 187) | private void addAfter(FreqNode currNode, FreqNode newNode) { method addAfter (line 194) | private void addAfter(ItemNode currNode, ItemNode newNode) { method addBefore (line 201) | private void addBefore(ItemNode currNode, ItemNode newNode) { method put (line 208) | public void put(int key, int value) { method newItemHead (line 237) | private ItemNode newItemHead() { class ItemNode (line 244) | class ItemNode { method ItemNode (line 250) | ItemNode(int key, int val, int freq) { method ItemNode (line 255) | ItemNode() { class FreqNode (line 262) | class FreqNode { method FreqNode (line 267) | FreqNode(int freq) { method FreqNode (line 271) | FreqNode() { FILE: src/LRUCache146.java class LRUCache (line 41) | public class LRUCache { class Node (line 42) | private class Node{ method Node (line 45) | Node(int k, int v){ method Node (line 49) | Node(){ method LRUCache (line 57) | public LRUCache(int capacity) { method get (line 66) | public int get(int key) { method put (line 75) | public void put(int key, int value) { method update (line 93) | private void update(Node node){ method add (line 97) | private void add(Node node){ method remove (line 105) | private void remove(Node node){ method LRUCache (line 126) | public LRUCache(int capacity) { method get (line 136) | public int get(int key) { method put (line 146) | public void put(int key, int value) { class LRUCache (line 122) | public class LRUCache { class Node (line 42) | private class Node{ method Node (line 45) | Node(int k, int v){ method Node (line 49) | Node(){ method LRUCache (line 57) | public LRUCache(int capacity) { method get (line 66) | public int get(int key) { method put (line 75) | public void put(int key, int value) { method update (line 93) | private void update(Node node){ method add (line 97) | private void add(Node node){ method remove (line 105) | private void remove(Node node){ method LRUCache (line 126) | public LRUCache(int capacity) { method get (line 136) | public int get(int key) { method put (line 146) | public void put(int key, int value) { FILE: src/LargestBSTSubtree333.java class LargestBSTSubtree333 (line 34) | public class LargestBSTSubtree333 { method largestBSTSubtree (line 35) | public int largestBSTSubtree(TreeNode root) { method helper (line 40) | public int[] helper(TreeNode root) { FILE: src/LargestDivisibleSubset368.java class LargestDivisibleSubset368 (line 17) | public class LargestDivisibleSubset368 { method largestDivisibleSubset (line 18) | public List largestDivisibleSubset(int[] nums) { FILE: src/LargestNumber179.java class LargestNumber179 (line 13) | public class LargestNumber179 { method largestNumber (line 14) | public String largestNumber(int[] nums) { method largestNumber2 (line 39) | public String largestNumber2(int[] num) { FILE: src/LargestRectangleInHistogram84.java class LargestRectangleInHistogram84 (line 18) | public class LargestRectangleInHistogram84 { method largestRectangleArea (line 22) | public int largestRectangleArea(int[] height) { method largestRectangleArea2 (line 43) | public int largestRectangleArea2(int[] height) { method largestRectangleArea3 (line 82) | public int largestRectangleArea3(int[] height) { method largestRectangleArea4 (line 111) | public int largestRectangleArea4(int[] heights) { method getMax (line 115) | private int getMax(int[] heights, int s, int e) { FILE: src/LemonadeChange860.java class LemonadeChange860 (line 46) | public class LemonadeChange860 { method lemonadeChange (line 47) | public boolean lemonadeChange(int[] bills) { FILE: src/LengthOfLongestFibonacciSubsequence873.java class LengthOfLongestFibonacciSubsequence873 (line 36) | public class LengthOfLongestFibonacciSubsequence873 { method lenLongestFibSubseq (line 37) | public int lenLongestFibSubseq(int[] A) { method lenLongestFibSubseq2 (line 63) | public int lenLongestFibSubseq2(int[] A) { method lenLongestFibSubseq3 (line 86) | public int lenLongestFibSubseq3(int[] A) { method lenLongestFibSubseq4 (line 114) | public int lenLongestFibSubseq4(int[] A) { method lenLongestFibSubseq5 (line 141) | public int lenLongestFibSubseq5(int[] A) { method lenLongestFibSubseq6 (line 163) | public int lenLongestFibSubseq6(int[] A) { FILE: src/LetterCombinationsOfAPhoneNumber17.java class LetterCombinationsOfAPhoneNumber17 (line 20) | public class LetterCombinationsOfAPhoneNumber17 { method letterCombinations (line 24) | public List letterCombinations(String digits) { method letterCombinations2 (line 48) | public List letterCombinations2(String digits) { method combination (line 56) | private void combination(String prefix, String digits, int offset, Lis... method letterCombinations4 (line 71) | public List letterCombinations4(String digits) { method helper (line 83) | private void helper(List res, String[] letters, int i, StringB... FILE: src/LexicographicalNumbers386.java class LexicographicalNumbers386 (line 10) | public class LexicographicalNumbers386 { method lexicalOrder (line 11) | public List lexicalOrder(int n) { method helper (line 19) | private void helper(int curr, List res, int n) { method lexicalOrder2 (line 31) | public List lexicalOrder2(int n) { method dfs (line 39) | private void dfs(int start, int end, int n, List res){ method lexicalOrder3 (line 55) | public List lexicalOrder3(int n) { FILE: src/LicenseKeyFormatting482.java class LicenseKeyFormatting482 (line 35) | public class LicenseKeyFormatting482 { method licenseKeyFormatting (line 36) | public String licenseKeyFormatting(String S, int K) { FILE: src/LinkedListCycle141.java class LinkedListCycle141 (line 22) | public class LinkedListCycle141 { method hasCycle (line 23) | public boolean hasCycle(ListNode head) { FILE: src/LinkedListCycleII142.java class LinkedListCycleII142 (line 23) | public class LinkedListCycleII142 { method detectCycle (line 24) | public ListNode detectCycle(ListNode head) { FILE: src/LinkedListRandomNode382.java class LinkedListRandomNode382 (line 31) | public class LinkedListRandomNode382 { class Solution (line 32) | class Solution { method Solution (line 37) | public Solution(ListNode head) { method getRandom (line 42) | public int getRandom() { FILE: src/ListNode.java class ListNode (line 5) | public class ListNode { method ListNode (line 8) | ListNode(int x) { val = x; } FILE: src/LoggerRateLimiter359.java class LoggerRateLimiter359 (line 35) | public class LoggerRateLimiter359 { class Logger (line 36) | class Logger { method Logger (line 40) | public Logger() { method shouldPrintMessage (line 47) | public boolean shouldPrintMessage(int timestamp, String message) { class Logger2 (line 59) | class Logger2 { method Logger (line 64) | public Logger() { method shouldPrintMessage (line 75) | public boolean shouldPrintMessage(int timestamp, String message) { FILE: src/LonelyPixelI531.java class LonelyPixelI531 (line 23) | public class LonelyPixelI531 { method findLonelyPixel (line 24) | public int findLonelyPixel(char[][] picture) { FILE: src/LongestAbsoluteFilePath388.java class LongestAbsoluteFilePath388 (line 48) | public class LongestAbsoluteFilePath388 { method lengthLongestPath (line 49) | public int lengthLongestPath(String input) { method levelOf (line 73) | private int levelOf(String path) { method lengthLongestPath2 (line 86) | public int lengthLongestPath2(String input) { method lengthLongestPath3 (line 101) | public int lengthLongestPath3(String input) { FILE: src/LongestCommonPrefix14.java class LongestCommonPrefix14 (line 6) | public class LongestCommonPrefix14 { method longestCommonPrefix (line 7) | public String longestCommonPrefix(String[] strs) { method longestCommonPrefix2 (line 45) | public String longestCommonPrefix2(String[] strs) { method longestCommonPrefix3 (line 61) | public String longestCommonPrefix3(String[] strs) { FILE: src/LongestConsecutiveSequence128.java class LongestConsecutiveSequence128 (line 15) | public class LongestConsecutiveSequence128 { method longestConsecutive (line 16) | public int longestConsecutive(int[] nums) { class Range (line 53) | class Range { method Range (line 56) | Range (int l0,int r0) { l=l0; r=r0; } method longestConsecutive2 (line 59) | public int longestConsecutive2(int[] nums) { method longestConsecutive3 (line 79) | public int longestConsecutive3(int[] nums) { FILE: src/LongestContinuousIncreasingSubsequence674.java class LongestContinuousIncreasingSubsequence674 (line 22) | public class LongestContinuousIncreasingSubsequence674 { method findLengthOfLCIS (line 23) | public int findLengthOfLCIS(int[] nums) { method findLengthOfLCIS2 (line 41) | public int findLengthOfLCIS2(int[] nums) { FILE: src/LongestHarmoniousSubsequence594.java class LongestHarmoniousSubsequence594 (line 18) | public class LongestHarmoniousSubsequence594 { method findLHS (line 19) | public int findLHS(int[] nums) { method findLHS2 (line 42) | public int findLHS2(int[] nums) { method findLHS3 (line 59) | public int findLHS3(int[] nums) { method findLHS4 (line 83) | public int findLHS4(int[] nums) { FILE: src/LongestIncreasingSubsequence300.java class LongestIncreasingSubsequence300 (line 16) | public class LongestIncreasingSubsequence300 { method lengthOfLIS (line 17) | public int lengthOfLIS(int[] nums) { method lengthOfLIS2 (line 39) | public int lengthOfLIS2(int[] nums) { method lengthOfLIS3 (line 59) | public int lengthOfLIS3(int[] nums) { method lengthofLIS (line 67) | public int lengthofLIS(int[] nums, int previndex, int curpos, int[][] ... method lengthOfLIS4 (line 88) | public int lengthOfLIS4(int[] nums) { FILE: src/LongestMountainInArray845.java class LongestMountainInArray845 (line 32) | public class LongestMountainInArray845 { method longestMountain (line 33) | public int longestMountain(int[] A) { FILE: src/LongestPalindrome409.java class LongestPalindrome409 (line 20) | public class LongestPalindrome409 { method longestPalindrome (line 21) | public int longestPalindrome(String s) { method longestPalindrome2 (line 44) | public int longestPalindrome2(String s) { method longestPalindrome3 (line 64) | public int longestPalindrome3(String s) { FILE: src/LongestPalindromicSubsequence516.java class LongestPalindromicSubsequence516 (line 20) | public class LongestPalindromicSubsequence516 { method longestPalindromeSubseq (line 21) | public int longestPalindromeSubseq(String s) { method longestPalindromeSubseq2 (line 45) | public int longestPalindromeSubseq2(String s) { method helper (line 51) | private int helper(char[] chars, int i, int j, int[][] dp) { FILE: src/LongestPalindromicSubstring5.java class LongestPalindromicSubstring5 (line 22) | public class LongestPalindromicSubstring5 { method longestPalindrome (line 23) | public String longestPalindrome(String s) { method longestPalindrome2 (line 56) | public String longestPalindrome2(String s) { method extendPalindrome (line 66) | private void extendPalindrome(String s, int j, int k) { method longestPalindrome3 (line 81) | public String longestPalindrome3(String s) { method longestPalindrome4 (line 98) | public String longestPalindrome4(String s) { method longestPalindrome5 (line 132) | public String longestPalindrome5(String s) { method expandAroundCenter (line 147) | private int expandAroundCenter(String s, int left, int right) { FILE: src/LongestRepeatingCharacterReplacement424.java class LongestRepeatingCharacterReplacement424 (line 30) | public class LongestRepeatingCharacterReplacement424 { method characterReplacement (line 31) | public int characterReplacement(String s, int k) { class Point (line 61) | class Point { method Point (line 64) | Point(char c, int cnt) { method characterReplacement2 (line 71) | public int characterReplacement2(String s, int k) { method getMax (line 95) | private int getMax(int[] map) { method characterReplacement3 (line 115) | public int characterReplacement3(String s, int k) { FILE: src/LongestSubstringWithAtMostKDistinctCharacters340.java class LongestSubstringWithAtMostKDistinctCharacters340 (line 11) | public class LongestSubstringWithAtMostKDistinctCharacters340 { method lengthOfLongestSubstringKDistinct (line 12) | public int lengthOfLongestSubstringKDistinct(String s, int k) { method lengthOfLongestSubstringKDistinct2 (line 46) | public int lengthOfLongestSubstringKDistinct2(String str, int k) { method lengthOfLongestSubstringKDistinct3 (line 78) | public int lengthOfLongestSubstringKDistinct3(String s, int k) { FILE: src/LongestSubstringWithAtMostTwoDistinctCharacters159.java class LongestSubstringWithAtMostTwoDistinctCharacters159 (line 16) | public class LongestSubstringWithAtMostTwoDistinctCharacters159 { method lengthOfLongestSubstringTwoDistinct (line 17) | public int lengthOfLongestSubstringTwoDistinct(String s) { method lengthOfLongestSubstringKDistinct (line 22) | public int lengthOfLongestSubstringKDistinct(String s, int k) { FILE: src/LongestSubstringWithoutRepeatingCharacters3.java class LongestSubstringWithoutRepeatingCharacters3 (line 19) | public class LongestSubstringWithoutRepeatingCharacters3 { method lengthOfLongestSubstring (line 20) | public int lengthOfLongestSubstring(String s) { method remove (line 46) | private int remove(int start, int now, char re, Map merge(List intervals) { class SortByLeft (line 42) | class SortByLeft implements Comparator { method compare (line 43) | @Override method merge2 (line 50) | public List merge2(List intervals) { method merge3 (line 77) | public List merge3(List intervals) { FILE: src/MergeKSortedLists23.java class MergeKSortedLists23 (line 15) | public class MergeKSortedLists23 { method mergeKLists (line 19) | public static ListNode mergeKLists(ListNode[] lists){ method partion (line 23) | public static ListNode partion(ListNode[] lists,int s,int e){ method merge (line 35) | public static ListNode merge(ListNode l1,ListNode l2){ method mergeKLists2 (line 51) | public ListNode mergeKLists2(ListNode[] lists) { method mergeKLists3 (line 87) | public ListNode mergeKLists3(ListNode[] lists) { method mL (line 91) | private ListNode mL(ListNode[] lists, int l, int r) { method mergeKLists4 (line 114) | public ListNode mergeKLists4(ListNode[] lists) { method mergeKLists5 (line 134) | public ListNode mergeKLists5(ListNode[] lists) { method mergeTwoLists (line 148) | public ListNode mergeTwoLists(ListNode l1, ListNode l2) { method mergeKLists6 (line 168) | public ListNode mergeKLists6(ListNode[] lists) { method mergeKLists (line 174) | public ListNode mergeKLists(ListNode[] lists, int i, int j) { method mergeTwoLists (line 183) | private ListNode mergeTwoLists(ListNode l1, ListNode l2) { FILE: src/MergeSortedArray88.java class MergeSortedArray88 (line 13) | public class MergeSortedArray88 { method merge (line 14) | public void merge(int[] nums1, int m, int[] nums2, int n) { method merge2 (line 40) | public void merge2(int[] nums1, int m, int[] nums2, int n) { FILE: src/MergeTwoSortedLists21.java class MergeTwoSortedLists21 (line 21) | public class MergeTwoSortedLists21 { method mergeTwoLists (line 22) | public ListNode mergeTwoLists(ListNode l1, ListNode l2) { method mergeTwoLists2 (line 41) | public ListNode mergeTwoLists2(ListNode l1, ListNode l2) { FILE: src/MiddleOfTheLinkedList876.java class MiddleOfTheLinkedList876 (line 34) | public class MiddleOfTheLinkedList876 { method middleNode (line 35) | public ListNode middleNode(ListNode head) { FILE: src/MinCostClimbingStairs746.java class MinCostClimbingStairs746 (line 24) | public class MinCostClimbingStairs746 { method minCostClimbingStairs (line 25) | public int minCostClimbingStairs(int[] cost) { method minCostClimbingStairs2 (line 39) | public int minCostClimbingStairs2(int[] cost) { FILE: src/MinStack.java class MinStack (line 27) | class MinStack { method MinStack (line 32) | public MinStack() { } method push (line 34) | public void push(int x) { method pop (line 44) | public void pop() { method top (line 57) | public int top() { method getMin (line 61) | public int getMin() { class MinStack2 (line 70) | class MinStack2 { class Element (line 71) | static class Element method Element (line 75) | Element(final int value, final int min) method push (line 83) | public void push(int x) { method pop (line 88) | public void pop() method top (line 93) | public int top() method getMin (line 98) | public int getMin() class MinStack3 (line 108) | class MinStack3 { method MinStack (line 112) | public MinStack(){ method push (line 116) | public void push(int x) { method pop (line 126) | public void pop() { method top (line 135) | public int top() { method getMin (line 144) | public int getMin() { FILE: src/Minesweeper529.java class Minesweeper529 (line 74) | public class Minesweeper529 { method updateBoard (line 77) | public char[][] updateBoard(char[][] board, int[] click) { method helper (line 85) | public void helper(char[][] board, int i, int j, int M, int N) { method isDigit (line 104) | private boolean isDigit(char c) { method numAdjacentMines (line 108) | private int numAdjacentMines(char[][] board, int i, int j, int M, int ... FILE: src/MinimumASCIIDeleteSumForTwoStrings712.java class MinimumASCIIDeleteSumForTwoStrings712 (line 25) | public class MinimumASCIIDeleteSumForTwoStrings712 { method minimumDeleteSum (line 26) | public int minimumDeleteSum(String s1, String s2) { FILE: src/MinimumAbsoluteDifferenceInBST530.java class MinimumAbsoluteDifferenceInBST530 (line 35) | public class MinimumAbsoluteDifferenceInBST530 { method getMinimumDifference (line 36) | public int getMinimumDifference(TreeNode root) { method helper (line 42) | public int[] helper(TreeNode root, int[] res) { FILE: src/MinimumDepthOfBinaryTree111.java class MinimumDepthOfBinaryTree111 (line 32) | public class MinimumDepthOfBinaryTree111 { method minDepth (line 33) | public int minDepth(TreeNode root) { FILE: src/MinimumDistanceBetweenBSTNodes783.java class MinimumDistanceBetweenBSTNodes783 (line 39) | public class MinimumDistanceBetweenBSTNodes783 { method minDiffInBST (line 40) | public int minDiffInBST(TreeNode root) { method minDiffInBST (line 46) | public void minDiffInBST(TreeNode root, LinkedList list, int[... method minDiffInBST2 (line 56) | public int minDiffInBST2(TreeNode root) { method minDiffInBST2 (line 63) | public void minDiffInBST2(TreeNode root, LinkedList list, Int... FILE: src/MinimumGeneticMutation433.java class MinimumGeneticMutation433 (line 49) | public class MinimumGeneticMutation433 { method minMutation (line 50) | public int minMutation(String start, String end, String[] bank) { method helper (line 57) | private int helper(String start, String end, String[] bank, int len, b... method diff (line 73) | private Integer diff(String a, String b) { FILE: src/MinimumHeightTrees310.java class MinimumHeightTrees310 (line 52) | public class MinimumHeightTrees310 { method findMinHeightTrees (line 53) | public List findMinHeightTrees(int n, int[][] edges) { method search (line 84) | private int search(Integer p, Integer h, Map findMinHeightTrees2(int n, int[][] edges) { method bfs (line 143) | private void bfs(int start, int[] dist, int[] pre) { method findMinHeightTree3 (line 162) | public List findMinHeightTree3(int n, int[][] edges) { method dfs4 (line 207) | private void dfs4(int u, int parent) { method dfs4 (line 223) | private void dfs4(int u, int parent, int acc) { method findMinHeightTrees4 (line 232) | public List findMinHeightTrees4(int n, int[][] edges) { FILE: src/MinimumMovesToEqualArrayElementsII462.java class MinimumMovesToEqualArrayElementsII462 (line 22) | public class MinimumMovesToEqualArrayElementsII462 { method minMoves2 (line 23) | public int minMoves2(int[] nums) { FILE: src/MinimumPathSum64.java class MinimumPathSum64 (line 9) | public class MinimumPathSum64 { method minPathSum (line 10) | public int minPathSum(int[][] grid) { method minPathSum1 (line 38) | public int minPathSum1(int[][] grid) { method minPathSum2 (line 60) | public int minPathSum2(int[][] grid) { method minPathSumHelper (line 65) | public int minPathSumHelper(int[][] grid, int row, int col, int[][] me... method minPathSum3 (line 80) | public int minPathSum3(int[][] grid) { method minPathSum (line 85) | public int minPathSum(int[][] grid, int i, int j, int[][] dp) { method minPathSum4 (line 103) | public int minPathSum4(int[][] grid) { FILE: src/MinimumSizeSubarraySum209.java class MinimumSizeSubarraySum209 (line 16) | public class MinimumSizeSubarraySum209 { method minSubArrayLen (line 17) | public int minSubArrayLen(int s, int[] nums) { method minSubArrayLen2 (line 35) | public int minSubArrayLen2(int s, int[] nums) { method minSubArrayLen3 (line 56) | public int minSubArrayLen3(int s, int[] nums) { method isValid (line 75) | private boolean isValid(int[] nums, int len, int s) { FILE: src/MinimumWindowSubsequence727.java class MinimumWindowSubsequence727 (line 27) | public class MinimumWindowSubsequence727 { method minWindow (line 28) | public String minWindow(String S, String T) { method minWindow2s (line 76) | public String minWindow2s(String S, String T) { method minWindow3 (line 119) | public String minWindow3(String S, String T) { method minWindow4 (line 165) | public String minWindow4(String S, String T) { method minWindow5 (line 194) | public String minWindow5(String S, String T) { method minWindow6 (line 227) | public String minWindow6(String S, String T) { method minWindow7 (line 251) | public String minWindow7(String S, String T) { method minWindow8 (line 279) | public String minWindow8(String S, String T) { method minWindow9 (line 314) | public String minWindow9(String S, String T) { method backwards (line 350) | private int backwards(char[] charS, char[] charT, int begin, int end) { FILE: src/MinimumWindowSubstring76.java class MinimumWindowSubstring76 (line 19) | public class MinimumWindowSubstring76 { method minWindow (line 23) | public String minWindow(String S, String T) { method minWindow2 (line 63) | public String minWindow2(String s, String t) { method minWindow3 (line 92) | public String minWindow3(String s, String t) { FILE: src/MissingNumber268.java class MissingNumber268 (line 19) | public class MissingNumber268 { method missingNumber (line 20) | public int missingNumber(int[] nums) { method missingNumber2 (line 31) | public int missingNumber2(int[] nums) { FILE: src/MissingRanges163.java class MissingRanges163 (line 9) | public class MissingRanges163 { method findMissingRanges (line 10) | public List findMissingRanges(int[] nums, int lower, int upper) { FILE: src/MonotoneIncreasingDigits738.java class MonotoneIncreasingDigits738 (line 22) | public class MonotoneIncreasingDigits738 { method monotoneIncreasingDigits (line 23) | public int monotoneIncreasingDigits(int N) { method monotoneIncreasingDigits2 (line 45) | public int monotoneIncreasingDigits2(int N) { method monotoneIncreasingDigits3 (line 59) | public int monotoneIncreasingDigits3(int N) { FILE: src/MonotonicArray896.java class MonotonicArray896 (line 34) | public class MonotonicArray896 { method isMonotonic (line 35) | public boolean isMonotonic(int[] A) { method isMonotonic2 (line 52) | public boolean isMonotonic2(int[] A) { FILE: src/MostCommonWord819.java class MostCommonWord819 (line 39) | public class MostCommonWord819 { method mostCommonWord (line 40) | public String mostCommonWord(String paragraph, String[] banned) { method isLetter (line 72) | private boolean isLetter(char c) { method mostCommonWord2 (line 78) | public String mostCommonWord2(String paragraph, String[] banned) { FILE: src/MostFrequentSubtreeSum508.java class MostFrequentSubtreeSum508 (line 41) | public class MostFrequentSubtreeSum508 { method findFrequentTreeSum (line 42) | public int[] findFrequentTreeSum(TreeNode root) { method helper (line 61) | private Integer helper(TreeNode n, Map sums, int[] c... method findFrequentTreeSum2 (line 76) | public int[] findFrequentTreeSum2(TreeNode root) { method findFrequentTreeSum (line 100) | public int findFrequentTreeSum(TreeNode root, Map ma... FILE: src/MostProfitAssigningWork826.java class MostProfitAssigningWork826 (line 30) | public class MostProfitAssigningWork826 { method maxProfitAssignment (line 31) | public int maxProfitAssignment(int[] difficulty, int[] profit, int[] w... class Job (line 50) | class Job { method Job (line 53) | Job (int d, int p) { FILE: src/MoveZeroes283.java class MoveZeroes283 (line 14) | public class MoveZeroes283 { method moveZeroes (line 15) | public void moveZeroes(int[] nums) { method moveZeroes2 (line 31) | public void moveZeroes2(int[] nums) { method moveZeroes3 (line 49) | public void moveZeroes3(int[] nums) { method swap (line 57) | private void swap(int[] arr, int a, int b) { FILE: src/MovingAverageFromDataStream346.java class MovingAverageFromDataStream346 (line 14) | public class MovingAverageFromDataStream346 { class MovingAverage (line 15) | class MovingAverage { method MovingAverage (line 21) | public MovingAverage(int size) { method next (line 27) | public double next(int val) { class MovingAverage2 (line 38) | class MovingAverage2 { method MovingAverage2 (line 45) | public MovingAverage2(int size) { method next (line 49) | public double next(int val) { FILE: src/MultiplyStrings43.java class MultiplyStrings43 (line 21) | public class MultiplyStrings43 { method multiply (line 22) | public String multiply(String num1, String num2) { method multiplyForOne (line 40) | private StringBuilder multiplyForOne(char[] chars, char ch) { method add (line 53) | private StringBuilder add(StringBuilder sb1, StringBuilder sb2) { method multiply2 (line 81) | public String multiply2(String num1, String num2) { FILE: src/MyCalendarI729.java class MyCalendarI729 (line 38) | public class MyCalendarI729 { class MyCalendar (line 39) | class MyCalendar { method MyCalendar (line 42) | public MyCalendar() { method book (line 45) | public boolean book(int start, int end) { class Interval (line 55) | class Interval { method Interval (line 58) | Interval(int s, int e) { class MyCalendar2 (line 66) | class MyCalendar2 { method MyCalendar (line 69) | public MyCalendar() { method book (line 72) | public boolean book(int start, int end) { FILE: src/MyCalendarII731.java class MyCalendarII731 (line 45) | public class MyCalendarII731 { class MyCalendarTwo (line 49) | class MyCalendarTwo { method book (line 51) | public boolean book(int s, int e) { class MyCalendar (line 60) | private static class MyCalendar { method book (line 62) | public boolean book(int start, int end) { class MyCalendarTwo2 (line 75) | class MyCalendarTwo2 { method MyCalendarTwo (line 79) | MyCalendarTwo() { method book (line 84) | public boolean book(int start, int end) { class MyCalendarTwo3 (line 101) | class MyCalendarTwo3 { method MyCalendarTwo (line 104) | public MyCalendarTwo() { method book (line 108) | public boolean book(int start, int end) { FILE: src/NQueens51.java class NQueens51 (line 39) | public class NQueens51 { method solveNQueens (line 41) | public List> solveNQueens(int n) { method backtrack (line 80) | private List backtrack(List> trace, int inputI,... method foundOneSolution (line 121) | private List foundOneSolution(List> result, List... method attacked (line 147) | private boolean attacked(List> trace, Integer[] point) { method helper (line 165) | private void helper(int r, boolean[] cols, boolean[] d1, boolean[] d2,... method solveNQueens2 (line 183) | public List> solveNQueens2(int n) { method main (line 190) | public static void main(String[] args) { FILE: src/NQueensII52.java class NQueensII52 (line 14) | public class NQueensII52 { method helper (line 15) | private void helper(int r, boolean[] cols, boolean[] d1, boolean[] d2,... method totalNQueens (line 30) | public int totalNQueens(int n) { method main (line 38) | public static void main(String[] args) { FILE: src/NaryTreeLevelOrderTraversal429.java class NaryTreeLevelOrderTraversal429 (line 36) | public class NaryTreeLevelOrderTraversal429 { method levelOrder (line 37) | public List> levelOrder(Node root) { FILE: src/NaryTreePostorderTraversal590.java class NaryTreePostorderTraversal590 (line 27) | public class NaryTreePostorderTraversal590 { method postorder (line 28) | public List postorder(Node root) { method helper (line 34) | private void helper(Node root, List res) { method postorder2 (line 43) | public List postorder2(Node root) { FILE: src/NestedIterator.java class NestedIterator (line 38) | public class NestedIterator implements Iterator { method NestedIterator (line 41) | public NestedIterator(List nestedList) { method flattenNestedList (line 45) | private void flattenNestedList(List nestedList) { method next (line 55) | @Override method hasNext (line 60) | @Override FILE: src/NestedListWeightSum339.java class NestedListWeightSum339 (line 49) | public class NestedListWeightSum339 { method depthSum (line 50) | public int depthSum(List nestedList) { method depthSum (line 54) | private int depthSum(List nestedList, int level) { FILE: src/NextClosestTime681.java class NextClosestTime681 (line 27) | public class NextClosestTime681 { method nextClosestTime (line 28) | public String nextClosestTime(String time) { method nextClosestTime2 (line 59) | public String nextClosestTime2(String time) { FILE: src/NextGreaterElementI496.java class NextGreaterElementI496 (line 29) | public class NextGreaterElementI496 { method nextGreaterElement (line 30) | public int[] nextGreaterElement(int[] nums1, int[] nums2) { FILE: src/NextGreaterElementII503.java class NextGreaterElementII503 (line 20) | public class NextGreaterElementII503 { method nextGreaterElements (line 22) | public int[] nextGreaterElements(int[] nums) { method nextGreaterElements2 (line 50) | public int[] nextGreaterElements2(int[] nums) { method nextGreaterElements3 (line 82) | public int[] nextGreaterElements3(int[] nums) { method nextGreaterElements4 (line 99) | public int[] nextGreaterElements4(int[] nums) { method nextGreaterElements5 (line 117) | public int[] nextGreaterElements5(int[] nums) { method nextGreaterElements6 (line 150) | public int[] nextGreaterElements6(int[] nums) { FILE: src/NextGreaterElementIII556.java class NextGreaterElementIII556 (line 16) | public class NextGreaterElementIII556 { method nextGreaterElement (line 17) | public int nextGreaterElement(int n) { method swap (line 50) | private void swap(int[] digits, int i, int j) { method nextGreaterElement2 (line 56) | public int nextGreaterElement2(int n) { FILE: src/NextPermutation31.java class NextPermutation31 (line 21) | public class NextPermutation31 { method nextPermutation (line 22) | public void nextPermutation(int[] nums) { method swap (line 51) | private void swap(int[] nums, int i, int j) { FILE: src/NonDecreasingArray665.java class NonDecreasingArray665 (line 21) | public class NonDecreasingArray665 { method checkPossibility (line 22) | public boolean checkPossibility(int[] nums) { method checkPossibility2 (line 53) | public boolean checkPossibility2(int[] a) { method checkPossibility3 (line 69) | public boolean checkPossibility3(int[] a) { FILE: src/NonOverlappingIntervals435.java class NonOverlappingIntervals435 (line 29) | public class NonOverlappingIntervals435 { method compare (line 32) | @Override method eraseOverlapIntervals (line 40) | public int eraseOverlapIntervals(Interval[] intervals) { FILE: src/NumberOfConnectedComponentsInAnUndirectedGraph323.java class NumberOfConnectedComponentsInAnUndirectedGraph323 (line 26) | public class NumberOfConnectedComponentsInAnUndirectedGraph323 { method countComponents (line 27) | public int countComponents(int n, int[][] edges) { class UnionFind (line 41) | class UnionFind { method UnionFind (line 45) | UnionFind(int n) { method find (line 51) | int find(int x) { method union (line 58) | void union(int x, int y) { FILE: src/NumberOfCornerRectangles750.java class NumberOfCornerRectangles750 (line 40) | public class NumberOfCornerRectangles750 { method countCornerRectangles (line 41) | public int countCornerRectangles(int[][] grid) { method countCornerRectangles2 (line 64) | public int countCornerRectangles2(int[][] grid) { method countCornerRectangles3 (line 84) | public int countCornerRectangles3(int[][] grid) { method countCornerRectangles4 (line 102) | public int countCornerRectangles4(int[][] grid) { FILE: src/NumberOfDigitOne233.java class NumberOfDigitOne233 (line 10) | public class NumberOfDigitOne233 { method countDigitOne (line 11) | public int countDigitOne(int n) { method currentOne (line 34) | private int currentOne(int n, int k, int preK, int num, int i) { method countDigitOne2 (line 44) | public int countDigitOne2(int n) { method countDigitOne3 (line 54) | public int countDigitOne3(int n) { method countDigitOne4 (line 69) | public int countDigitOne4(int n) { FILE: src/NumberOfIslands200.java class NumberOfIslands200 (line 27) | public class NumberOfIslands200 { method numIslands (line 28) | public int numIslands(char[][] grid) { method numIslands (line 46) | private void numIslands(char[][] grid, boolean[][] visited, int i, int... method numIslands2 (line 59) | public int numIslands2(char[][] grid) { method dfs (line 79) | void dfs(char[][] grid, int r, int c) { method numIslands3 (line 96) | public int numIslands3(char[][] grid) { method bfs (line 117) | private void bfs(char[][] grid, boolean[][] visited, int i, int j, int... class UnionFind (line 148) | class UnionFind { method UnionFind (line 153) | public UnionFind(char[][] grid) { // for problem 200 method find (line 171) | public int find(int i) { // path compression method union (line 176) | public void union(int x, int y) { // union with rank method getCount (line 192) | public int getCount() { method numIslands4 (line 197) | public int numIslands4(char[][] grid) { FILE: src/NumberOfIslandsII305.java class NumberOfIslandsII305 (line 47) | public class NumberOfIslandsII305 { method numIslands2 (line 50) | public List numIslands2(int m, int n, int[][] positions) { method addNumIslands (line 64) | private int addNumIslands(int[][] grid, int i, int j, int m, int n) { method isNeighbor (line 73) | private boolean isNeighbor(int[][] grid, int i, int j, boolean[][] vis... method travese (line 79) | private void travese(int[][] grid, int i, int j, boolean[][] visited, ... method numIslands22 (line 89) | public List numIslands22(int m, int n, int[][] positions) { method posToIndex (line 119) | private int posToIndex(int i, int j, int n) { class DisjointSet (line 123) | class DisjointSet { method DisjointSet (line 125) | public DisjointSet(int n) { method find (line 130) | public int find(int x) { method union (line 135) | public void union(int x, int y) { class DisjointSetWithRank (line 142) | class DisjointSetWithRank { method DisjointSetWithRank (line 145) | public DisjointSetWithRank(int n) { method find (line 151) | public int find(int x) { method union (line 156) | public void union(int x, int y) { method numIslands23 (line 175) | public List numIslands23(int m, int n, int[][] positions) { method findIsland (line 207) | public int findIsland(int[] roots, int id) { FILE: src/NumberOfLongestIncreasingSubsequence673.java class NumberOfLongestIncreasingSubsequence673 (line 21) | public class NumberOfLongestIncreasingSubsequence673 { method findNumberOfLIS (line 22) | public int findNumberOfLIS(int[] nums) { FILE: src/NumberOfMatchingSubsequences792.java class NumberOfMatchingSubsequences792 (line 20) | public class NumberOfMatchingSubsequences792 { method numMatchingSubseq (line 22) | public int numMatchingSubseq(String S, String[] words) { method isSubsequence (line 30) | private boolean isSubsequence(String s, String t) { method numMatchingSubseq2 (line 47) | public int numMatchingSubseq2(String S, String[] words) { class Mover (line 73) | class Mover { method Mover (line 76) | Mover (String w) { method currChar (line 79) | char currChar() { method move (line 82) | void move() { method hasEnded (line 85) | boolean hasEnded() { method numMatchingSubseq3 (line 91) | public int numMatchingSubseq3(String S, String[] words) { method add (line 109) | private Trie add(Trie a, Trie b) { method constructTrie (line 114) | private Trie constructTrie(String[] words) { class Trie (line 122) | class Trie { method add (line 127) | void add(String word) { method add (line 131) | void add(char[] word, int i) { FILE: src/OddEvenLinkedList328.java class OddEvenLinkedList328 (line 30) | public class OddEvenLinkedList328 { method oddEvenList (line 31) | public ListNode oddEvenList(ListNode head) { method oddEvenList2 (line 51) | public ListNode oddEvenList2(ListNode head) { method oddEvenList3 (line 75) | public ListNode oddEvenList3(ListNode head) { FILE: src/OneEditDistance.java class OneEditDistance (line 5) | public class OneEditDistance { method oneEditDistance (line 6) | public boolean oneEditDistance(String str, String[] wordDict) { method helper (line 11) | private boolean helper(char[] str, int i, Trie trie, int edit) { method constructTrie (line 35) | private Trie constructTrie(String[] wordDict, int len) { class Trie (line 46) | class Trie { method add (line 50) | void add(String word) { method add (line 54) | void add(char[] word, int i) { method oneEditDistance2 (line 68) | public boolean oneEditDistance2(String str, String[] wordDict) { method isOneEditDistance (line 77) | private boolean isOneEditDistance(String s, String w) { method isOneEditDistance (line 81) | private boolean isOneEditDistance(char[] charsS, int i, char[] charsW,... method oneEditDistance3 (line 94) | public boolean oneEditDistance3(String str, String[] wordDict) { method main (line 119) | public static void main(String[] args) { FILE: src/OneEditDistance161.java class OneEditDistance161 (line 29) | public class OneEditDistance161 { method isOneEditDistance (line 30) | public boolean isOneEditDistance(String s, String t) { method isOneReplace (line 43) | private boolean isOneReplace(String s, String t) { method isOneDelete (line 58) | private boolean isOneDelete(String longStr, String shortStr) { method isOneEditDistance2 (line 80) | public boolean isOneEditDistance2(String s, String t) { method isSame (line 102) | private boolean isSame(char[] cs, int i, int lenS, char[] ct, int j, i... FILE: src/OnesAndZeroes474.java class OnesAndZeroes474 (line 26) | public class OnesAndZeroes474 { method findMaxForm (line 30) | public int findMaxForm(String[] strs, int m, int n) { method calculate (line 34) | public int calculate(String[] strs, int i, int zeroes, int ones, int[]... method countzeroesones (line 47) | public int[] countzeroesones(String s) { method findMaxForm2 (line 59) | public int findMaxForm2(String[] strs, int m, int n) { FILE: src/OpenTheLock752.java class OpenTheLock752 (line 52) | public class OpenTheLock752 { method openLock (line 54) | public int openLock(String[] deadends, String target) { method next (line 94) | private int next(int i) { method prev (line 98) | private int prev(int i) { FILE: src/OptimalAccountBalancing465.java class OptimalAccountBalancing465 (line 43) | public class OptimalAccountBalancing465 { method minTransfers (line 44) | public int minTransfers(int[][] transactions) { method dfs (line 54) | private int dfs(int[] posNeg, int start) { method getBalances (line 70) | private Map getBalances(int[][] transactions) { FILE: src/OutputContestMatches544.java class OutputContestMatches544 (line 51) | class OutputContestMatches544 { method findContestMatch (line 53) | public String findContestMatch(int n) { method combine (line 69) | private String combine(String l, String r) { method findContestMatch2 (line 81) | public String findContestMatch2(int n) { method write (line 89) | public void write(int n, int round) { method findContestMatch3 (line 107) | public String findContestMatch3(int n) { method helper (line 113) | void helper(StringBuilder sb, int sum, int n, int val) { FILE: src/PacificAtlanticWaterFlow417.java class PacificAtlanticWaterFlow417 (line 36) | public class PacificAtlanticWaterFlow417 { method pacificAtlantic (line 39) | public List pacificAtlantic(int[][] matrix) { FILE: src/PaintFence276.java class PaintFence276 (line 29) | public class PaintFence276 { method numWays (line 30) | public int numWays(int n, int k) { method numWays2 (line 42) | public int numWays2(int n, int k) { FILE: src/PaintHouse256.java class PaintHouse256 (line 22) | public class PaintHouse256 { method minCost (line 23) | public int minCost(int[][] costs) { method minCost2 (line 36) | public int minCost2(int[][] costs) { FILE: src/PaintHouseII265.java class PaintHouseII265 (line 25) | public class PaintHouseII265 { method minCostII (line 26) | public int minCostII(int[][] costs) { method minIndex (line 46) | private int[] minIndex(int[][] dp, int i, int K) { method minCostII2 (line 70) | public int minCostII2(int[][] costs) { method minIndex (line 90) | private void minIndex(int[] dp, int K) { method minCostII3 (line 112) | public int minCostII3(int[][] costs) { method minCostII4 (line 143) | public int minCostII4(int[][] costs) { method minCostII5 (line 169) | public int minCostII5(int[][] costs) { FILE: src/PalindromeLinkedList234.java class PalindromeLinkedList234 (line 17) | public class PalindromeLinkedList234 { method isPalindrome (line 18) | public boolean isPalindrome(ListNode head) { method isPalindrome2 (line 47) | public boolean isPalindrome2(ListNode head) { method reverse (line 69) | public ListNode reverse(ListNode head) { FILE: src/PalindromeNumber9.java class PalindromeNumber9 (line 24) | public class PalindromeNumber9 { method isPalindrome (line 25) | public boolean isPalindrome(int x) { method reverse (line 31) | private int reverse(int x) { method numberOfDigits (line 42) | public int numberOfDigits(int x) { method getDigit (line 51) | private int getDigit(int x, int pos) { method isPalindrome2 (line 55) | public boolean isPalindrome2(int x) { method isPalindrome3 (line 71) | public boolean isPalindrome3(int x) { FILE: src/PalindromePairs336.java class PalindromePairs336 (line 19) | public class PalindromePairs336 { method palindromePairs (line 20) | public List> palindromePairs(String[] words) { method isPalindrome (line 47) | private boolean isPalindrome(String s1, String s2) { method isPalindrome (line 68) | private boolean isPalindrome(String str, int i, int j) { method isPalindrome (line 83) | private boolean isPalindrome(String str) { method palindromePairs2 (line 101) | public List> palindromePairs2(String[] words) { class TrieNode (line 137) | private static class TrieNode { method TrieNode (line 142) | TrieNode() { method palindromePairs3 (line 149) | public List> palindromePairs3(String[] words) { method addWord (line 159) | private void addWord(TrieNode root, String word, int index) { method search (line 171) | private void search(String[] words, int i, TrieNode root, List> partition(String s) { method helper (line 25) | private void helper(char[] chars, int start, List path, List> partition2(String s) { method helper (line 67) | private void helper(List> res, List path, boolean... FILE: src/PalindromePermutationII267.java class PalindromePermutationII267 (line 16) | public class PalindromePermutationII267 { method generatePalindromes (line 17) | public List generatePalindromes(String s) { method helper (line 39) | private void helper(int[] map, int curr, StringBuilder sb, List partitionLabels(String S) { method partitionLabels2 (line 58) | public List partitionLabels2(String S) { FILE: src/PartitionList86.java class PartitionList86 (line 23) | public class PartitionList86 { method partition (line 24) | public ListNode partition(ListNode head, int x) { method partition (line 74) | public ListNode partition(ListNode head, int x) { FILE: src/PartitionToKEqualSumSubsets698.java class PartitionToKEqualSumSubsets698 (line 17) | public class PartitionToKEqualSumSubsets698 { method canPartitionKSubsets (line 18) | public boolean canPartitionKSubsets(int[] nums, int k) { method valid (line 30) | private boolean valid(int[] nums, boolean[] visited, int start, int cu... method canPartitionKSubsets2 (line 46) | public boolean canPartitionKSubsets2(int[] nums, int k) { method search (line 78) | public boolean search(int[] groups, int row, int[] nums, int target) { method canPartitionKSubsets3 (line 92) | public boolean canPartitionKSubsets3(int[] nums, int k) { FILE: src/PascalsTriangleII119.java class PascalsTriangleII119 (line 18) | public class PascalsTriangleII119 { method getRow (line 19) | public List getRow(int rowIndex) { method getRow2 (line 47) | public List getRow2(int rowIndex) { FILE: src/PatchingArray330.java class PatchingArray330 (line 29) | public class PatchingArray330 { method minPatches (line 30) | public int minPatches(int[] nums, int n) { FILE: src/PathSum112.java class PathSum112 (line 31) | public class PathSum112 { method hasPathSum (line 32) | public boolean hasPathSum(TreeNode root, int sum) { method sum (line 36) | private boolean sum(TreeNode root, int sum, int sumForNow) { method hasPathSum2 (line 58) | public boolean hasPathSum2(TreeNode root, int sum) { FILE: src/PathSumII113.java class PathSumII113 (line 36) | public class PathSumII113 { method pathSum (line 37) | public List> pathSum(TreeNode root, int sum) { method pathSum (line 43) | private void pathSum(TreeNode root, int sumSoFar, int target, List { method PeekingIterator (line 28) | public PeekingIterator(Iterator iterator) { method peek (line 37) | public Integer peek() { method next (line 43) | @Override method hasNext (line 54) | @Override FILE: src/PerfectSquares279.java class PerfectSquares279 (line 11) | public class PerfectSquares279 { method numSquares (line 12) | public int numSquares(int n) { method main (line 28) | public static void main(String[] args) { FILE: src/PermutationInString567.java class PermutationInString567 (line 20) | public class PermutationInString567 { method checkInclusion (line 21) | public boolean checkInclusion(String s1, String s2) { FILE: src/PermutationSequence60.java class PermutationSequence60 (line 29) | public class PermutationSequence60 { method getPermutation (line 30) | public String getPermutation(int n, int k) { method helper (line 38) | private boolean helper(StringBuilder sb, int n, int k, int[] count, bo... method getPermutation2 (line 55) | public String getPermutation2(int n, int k) { FILE: src/Permutations46.java class Permutations46 (line 22) | public class Permutations46 { method permute (line 23) | public List> permute(int[] nums) { method helper (line 33) | private void helper(List> results, List result,... method permute2 (line 54) | public List> permute2(int[] nums) { method helper (line 63) | private void helper(List> results, List result,... method permute3 (line 81) | public List> permute3(int[] num) { method permute4 (line 104) | public List> permute4(int[] nums) { method collectPermutations (line 114) | private void collectPermutations(int[] nums, int start, List ... method permute5 (line 133) | public List> permute5(int[] nums) { method perm (line 138) | public static void perm(List> result, int[] nums, int st... method permute6 (line 162) | public List> permute6(int[] nums) { method perm (line 168) | private static void perm(List> result, int[] nums, int s... method swap (line 184) | private static void swap(int[] nums, int i, int j) { FILE: src/PermutationsII47.java class PermutationsII47 (line 15) | public class PermutationsII47 { method permuteUnique (line 16) | public List> permuteUnique(int[] nums) { method perm (line 25) | private static void perm(Set> result, int[] nums, int st... method swap (line 44) | private static void swap(int[] nums, int i, int j) { method permuteUnique2 (line 54) | public List> permuteUnique2(int[] nums) { method perm (line 61) | private static void perm(List> result, int[] nums, int s... method permuteUnique3 (line 84) | public List> permuteUnique3(int[] nums) { method dfs (line 94) | public void dfs(int[] nums, boolean[] used, List list, List> permuteUnique4s(int[] num) { FILE: src/PlusOne66.java class PlusOne66 (line 12) | public class PlusOne66 { method plusOne (line 13) | public int[] plusOne(int[] digits) { method plusOne2 (line 29) | public int[] plusOne2(int[] digits) { FILE: src/PlusOneLinkedList369.java class PlusOneLinkedList369 (line 28) | public class PlusOneLinkedList369 { method plusOne (line 29) | public ListNode plusOne(ListNode head) { method helper (line 38) | public int helper(ListNode head) { method plusOne2 (line 50) | public ListNode plusOne2(ListNode head) { FILE: src/Point.java class Point (line 1) | public class Point { method Point (line 4) | Point() { x = 0; y = 0; } method Point (line 5) | Point(int a, int b) { x = a; y = b; } FILE: src/PopulatingNextRightPointersInEachNode116.java class PopulatingNextRightPointersInEachNode116 (line 47) | public class PopulatingNextRightPointersInEachNode116 { method connect (line 48) | public void connect(TreeLinkNode root) { method connect2 (line 79) | public void connect2(TreeLinkNode root) { method connect3 (line 97) | public void connect3(TreeLinkNode root) { method connect4 (line 112) | public void connect4(TreeLinkNode root) { method connect (line 119) | private void connect(LinkedList level) { FILE: src/PopulatingNextRightPointersInEachNodeII117.java class PopulatingNextRightPointersInEachNodeII117 (line 34) | public class PopulatingNextRightPointersInEachNodeII117 { method connect (line 35) | public void connect(TreeLinkNode root) { method connect (line 42) | private void connect(LinkedList level) { method connect2 (line 60) | public void connect2(TreeLinkNode root) { method connect3 (line 81) | public void connect3(TreeLinkNode root) { FILE: src/PossibleBipartition886.java class PossibleBipartition886 (line 35) | public class PossibleBipartition886 { method possibleBipartition (line 36) | public boolean possibleBipartition(int N, int[][] dislikes) { method helper (line 58) | private boolean helper(int curr, Set[] nonGraph, int N, int[]... method possibleBipartition2 (line 75) | public boolean possibleBipartition2(int N, int[][] dislikes) { FILE: src/PowXN50.java class PowXN50 (line 22) | public class PowXN50 { method myPow (line 26) | public double myPow(double x, int n) { method fastPow (line 35) | private double fastPow(double x, long n) { method myPow2 (line 51) | public double myPow2(double x, int n) { FILE: src/PowerOfTwo231.java class PowerOfTwo231 (line 19) | public class PowerOfTwo231 { method isPowerOfTwo (line 20) | public boolean isPowerOfTwo(int n) { method isPowerOfTwo2 (line 33) | public boolean isPowerOfTwo2(int n) { FILE: src/PredictTheWinner486.java class PredictTheWinner486 (line 35) | public class PredictTheWinner486 { method PredictTheWinner (line 36) | public boolean PredictTheWinner(int[] nums) { method helper (line 44) | private int helper(int[] nums, int p1, int left, int right, boolean tu... method PredictTheWinner2 (line 62) | public boolean PredictTheWinner2(int[] nums) { method helper (line 70) | private int helper(int[] nums, int left, int right, boolean turn1) { method PredictTheWinner3 (line 85) | public boolean PredictTheWinner3(int[] nums) { method helper (line 94) | private int helper(int[] nums, int left, int right, boolean turn1, int... method PredictTheWinner4 (line 116) | public boolean PredictTheWinner4(int[] nums) { method winner (line 121) | public int winner(int[] nums, int s, int e, Integer[][] memo) { method PredictTheWinner5 (line 136) | public boolean PredictTheWinner5(int[] nums) { method PredictTheWinner6 (line 152) | public boolean PredictTheWinner6(int[] nums) { FILE: src/ProductOfArrayExceptSelf238.java class ProductOfArrayExceptSelf238 (line 18) | public class ProductOfArrayExceptSelf238 { method productExceptSelf (line 19) | public int[] productExceptSelf(int[] nums) { method productExceptSelf2 (line 33) | public int[] productExceptSelf2(int[] nums) { FILE: src/ProfitableSchemes879.java class ProfitableSchemes879 (line 42) | public class ProfitableSchemes879 { method profitableSchemes (line 44) | public int profitableSchemes(int G, int P, int[] group, int[] profit) { method profitableSchemes2 (line 67) | public int profitableSchemes2(int G, int P, int[] group, int[] profit) { method profitableSchemes3 (line 101) | public int profitableSchemes3(int G, int P, int[] group, int[] profit) { method profitableSchemes4 (line 143) | public int profitableSchemes4(int G, int P, int[] group, int[] profit) { method profitableSchemes5 (line 161) | public int profitableSchemes5(int G, int P, int[] group, int[] profit) { FILE: src/ProjectionAreaOf3DShapes887.java class ProjectionAreaOf3DShapes887 (line 43) | public class ProjectionAreaOf3DShapes887 { method projectionArea (line 44) | public int projectionArea(int[][] grid) { FILE: src/QuadTreeIntersection558.java class QuadTreeIntersection558 (line 96) | public class QuadTreeIntersection558 { method intersect (line 97) | public Node intersect(Node quadTree1, Node quadTree2) { method getTopLeft (line 122) | private Node getTopLeft(Node n) { method getTopRight (line 126) | private Node getTopRight(Node n) { method getBottomLeft (line 130) | private Node getBottomLeft(Node n) { method getBottomRight (line 134) | private Node getBottomRight(Node n) { method allLeaves (line 138) | private boolean allLeaves(Node n) { method allSame (line 145) | private boolean allSame(Node n) { method intersect2 (line 152) | public Node intersect2(Node q1, Node q2) { FILE: src/QueueReconstructionByHeight406.java class QueueReconstructionByHeight406 (line 23) | public class QueueReconstructionByHeight406 { method reconstructQueue (line 24) | public int[][] reconstructQueue(int[][] people) { class SortRule (line 38) | class SortRule implements Comparator { method compare (line 39) | @Override FILE: src/RandomFlipMatrix519.java class RandomFlipMatrix519 (line 33) | public class RandomFlipMatrix519 { class Solution (line 37) | class Solution { method Solution (line 44) | public Solution(int n_rows, int n_cols) { method flip (line 50) | public int[] flip() { method reset (line 57) | public void reset() { class Solution2 (line 64) | class Solution2 { method Solution (line 70) | public Solution(int n_rows, int n_cols) { method flip (line 76) | public int[] flip() { method reset (line 85) | public void reset() { FILE: src/RandomListNode.java class RandomListNode (line 2) | public class RandomListNode { method RandomListNode (line 5) | RandomListNode(int x) { this.label = x; } FILE: src/RandomPickIndex398.java class RandomPickIndex398 (line 23) | public class RandomPickIndex398 { class Solution (line 25) | class Solution { method Solution (line 28) | public Solution(int[] nums) { method pick (line 37) | public int pick(int target) { class Solution2 (line 44) | class Solution2 { method Solution2 (line 48) | public Solution2(int[] nums) { method pick (line 53) | public int pick(int target) { FILE: src/RangeAddition370.java class RangeAddition370 (line 30) | public class RangeAddition370 { method getModifiedArray (line 32) | public int[] getModifiedArray(int length, int[][] updates) { method getModifiedArray2 (line 44) | public int[] getModifiedArray2(int length, int[][] updates) { method getModifiedArray3 (line 57) | public int[] getModifiedArray3(int length, int[][] updates) { method getModifiedArray4 (line 75) | public int[] getModifiedArray4(int length, int[][] updates) { method getModifiedArray5 (line 92) | public int[] getModifiedArray5(int length, int[][] updates) { method getModifiedArray6 (line 110) | public int[] getModifiedArray6(int length, int[][] updates) { FILE: src/RangeModule715.java class RangeModule715 (line 32) | public class RangeModule715 { class RangeModule (line 33) | class RangeModule { method RangeModule (line 36) | public RangeModule() { method addRange (line 40) | public void addRange(int left, int right) { method queryRange (line 60) | public boolean queryRange(int left, int right) { method removeRange (line 65) | public void removeRange(int left, int right) { class RangeModule2 (line 95) | class RangeModule2 { method RangeModule (line 97) | public RangeModule() { method addRange (line 100) | public void addRange(int left, int right) { method queryRange (line 119) | public boolean queryRange(int left, int right) { method removeRange (line 125) | public void removeRange(int left, int right) { class Range (line 151) | class Range { method Range (line 154) | Range (int l, int r) { FILE: src/RangeSumQuery2DImmutable304.java class RangeSumQuery2DImmutable304 (line 32) | public class RangeSumQuery2DImmutable304 { class NumMatrix (line 33) | class NumMatrix { method NumMatrix (line 35) | public NumMatrix(int[][] matrix) { method sumRegion (line 47) | public int sumRegion(int row1, int col1, int row2, int col2) { class NumMatrix2 (line 54) | class NumMatrix2 { method NumMatrix2 (line 59) | public NumMatrix2(int[][] matrix) { method sumRegion (line 72) | public int sumRegion(int row1, int col1, int row2, int col2) { FILE: src/RangeSumQuery2DMutable308.java class RangeSumQuery2DMutable308 (line 32) | public class RangeSumQuery2DMutable308 { class NumMatrix (line 33) | class NumMatrix { method NumMatrix (line 36) | public NumMatrix(int[][] matrix) { method constructTree (line 42) | private Node constructTree(int[][] matrix, int row1, int col1, int r... method update (line 64) | public void update(int row, int col, int val) { method update (line 68) | private void update(Node root, int row, int col, int val) { method sumRegion (line 94) | public int sumRegion(int row1, int col1, int row2, int col2) { method sumRegion (line 98) | private int sumRegion(Node root, int row1, int col1, int row2, int c... class Node (line 107) | class Node { method Node (line 117) | Node (int row1, int col1, int row2, int col2, int sum) { class NumMatrix2 (line 131) | class NumMatrix2 { method NumMatrix2 (line 137) | public NumMatrix2(int[][] matrix) { method update (line 150) | public void update(int row, int col, int val) { method sumRegion (line 161) | public int sumRegion(int row1, int col1, int row2, int col2) { method sum (line 166) | public int sum(int row, int col) { class NumMatrix3 (line 178) | class NumMatrix3 { method NumMatrix3 (line 182) | public NumMatrix3(int[][] matrix) { method update (line 194) | public void update(int row, int col, int val) { method sumRegion (line 203) | public int sumRegion(int row1, int col1, int row2, int col2) { FILE: src/RangeSumQueryImmutable303.java class RangeSumQueryImmutable303 (line 18) | public class RangeSumQueryImmutable303 { class NumArray (line 19) | class NumArray { method NumArray (line 22) | public NumArray(int[] nums) { method sumRange (line 29) | public int sumRange(int i, int j) { FILE: src/RangeSumQueryMutable307.java class RangeSumQueryMutable307 (line 22) | public class RangeSumQueryMutable307 { class NumArray (line 23) | class NumArray { method NumArray (line 27) | public NumArray(int[] nums) { method update (line 35) | public void update(int i, int val) { method sumRange (line 43) | public int sumRange(int i, int j) { class NumArray2 (line 49) | class NumArray2 { method NumArray (line 52) | public NumArray(int[] nums) { method constructTree (line 56) | private Node constructTree(int[] nums) { method constructTree (line 60) | private Node constructTree(int[] nums, int l, int r) { method update (line 74) | public void update(int i, int val) { method update (line 78) | public void update(Node root, int i, int val) { method sumRange (line 93) | public int sumRange(int i, int j) { method sumRange (line 97) | private int sumRange(Node root, int i, int j) { class Node (line 112) | class Node { method Node (line 118) | Node(int l, int r, int s) { class NumArray3 (line 131) | class NumArray3 { method NumArray (line 134) | public NumArray(int[] nums) { method buildTree (line 141) | private void buildTree(int[] nums) { method update (line 148) | public void update(int pos, int val) { method sumRange (line 165) | public int sumRange(int l, int r) { class NumArray4 (line 188) | class NumArray4 { method NumArray (line 193) | public NumArray(int[] nums) { method constructTree (line 199) | private void constructTree(int[] nums) { method constructTree (line 203) | private void constructTree(int[] nums, int l, int r, int i) { method update (line 216) | public void update(int i, int val) { method update (line 220) | public void update(int l, int r, int i, int val, int n) { method sumRange (line 235) | public int sumRange(int i, int j) { method sumRange (line 239) | private int sumRange(int l, int r, int i, int j, int n) { method left (line 254) | private int left(int i) { method right (line 257) | private int right(int i) { class NumArray5 (line 264) | class NumArray5 { method NumArray (line 270) | public NumArray(int[] nums) { method constructTree (line 276) | private void constructTree(int[] nums) { method updateDiff (line 283) | private void updateDiff(int i, int val) { method update (line 291) | public void update(int i, int val) { method sumRange (line 297) | public int sumRange(int i, int j) { method getSum (line 301) | public int getSum(int i) { FILE: src/RansomNote383.java class RansomNote383 (line 17) | public class RansomNote383 { method canConstruct (line 18) | public boolean canConstruct(String ransomNote, String magazine) { method canConstruct2 (line 29) | public boolean canConstruct2(String ransomNote, String magazine) { FILE: src/ReadNCharactersGivenRead4IICallMultipleTimes158.java class ReadNCharactersGivenRead4IICallMultipleTimes158 (line 18) | public class ReadNCharactersGivenRead4IICallMultipleTimes158 extends Rea... method read (line 29) | public int read(char[] buf, int n) { method read2 (line 70) | public int read2(char[] buf, int n) { method read3 (line 92) | public int read3(char[] buf, int n) { FILE: src/ReadNCharactersGivenReadFour157.java class ReadNCharactersGivenReadFour157 (line 18) | public class ReadNCharactersGivenReadFour157 extends Reader4 { method read (line 24) | public int read(char[] buf, int n) { FILE: src/RearrangeStringKDistanceApart358.java class RearrangeStringKDistanceApart358 (line 24) | public class RearrangeStringKDistanceApart358 { method rearrangeString (line 28) | public String rearrangeString(String s, int k) { method rearrangeString2 (line 62) | public String rearrangeString2(String s, int k) { method rearrangeString3 (line 98) | public String rearrangeString3(String str, int k) { method findValidMax (line 118) | private int findValidMax(int[] count, int[] nextIndex, int index){ method rearrangeString4 (line 134) | public String rearrangeString4(String str, int k) { FILE: src/ReconstructItinerary332.java class ReconstructItinerary332 (line 28) | public class ReconstructItinerary332 { method findItinerary (line 29) | public List findItinerary(String[][] tickets) { method dfs (line 47) | private boolean dfs(Map> graph, int N, String sta... FILE: src/ReconstructOriginalDigitsFromEnglish423.java class ReconstructOriginalDigitsFromEnglish423 (line 21) | public class ReconstructOriginalDigitsFromEnglish423 { method originalDigits (line 26) | public String originalDigits(String s) { FILE: src/RectangleArea223.java class RectangleArea223 (line 15) | public class RectangleArea223 { method computeArea (line 16) | public int computeArea(int A, int B, int C, int D, int E, int F, int G... method computeArea (line 20) | public long computeArea(long A, long B, long C, long D, long E, long F... FILE: src/RectangleAreaII850.java class RectangleAreaII850 (line 31) | public class RectangleAreaII850 { method rectangleArea (line 37) | public int rectangleArea(int[][] rectangles) { method mergeIntervals (line 69) | private long mergeIntervals(List active) { method rectangleArea2 (line 85) | public int rectangleArea2(int[][] rectangles) { class Node (line 123) | class Node { method Node (line 130) | public Node(int start, int end, Integer[] X) { method getRangeMid (line 140) | public int getRangeMid() { method getLeft (line 144) | public Node getLeft() { method getRight (line 149) | public Node getRight() { method update (line 154) | public long update(int i, int j, int val) { FILE: src/RectangleOverlap863.java class RectangleOverlap863 (line 24) | public class RectangleOverlap863 { method isRectangleOverlap (line 25) | public boolean isRectangleOverlap(int[] rec1, int[] rec2) { method isIntervalOverlap (line 29) | private boolean isIntervalOverlap(int a1, int a2, int b1, int b2) { method isRectangleOverlap2 (line 34) | public boolean isRectangleOverlap2(int[] rec1, int[] rec2) { FILE: src/RedundantConnection684.java class RedundantConnection684 (line 46) | public class RedundantConnection684 { method findRedundantConnection (line 47) | public int[] findRedundantConnection(int[][] edges) { method dfs (line 67) | private boolean dfs(Map> graph, int source, int ... method findRedundantConnection2 (line 86) | public int[] findRedundantConnection2(int[][] edges) { method dfs (line 104) | public boolean dfs(ArrayList[] graph, int source, int target) { method findRedundantConnection3 (line 119) | public int[] findRedundantConnection3(int[][] edges) { method findRedundantConnection4 (line 131) | public int[] findRedundantConnection4(int[][] edges) { method find (line 144) | private int find(int[] parent, int f) { class DSU (line 155) | class DSU { method DSU (line 159) | public DSU(int size) { method find (line 165) | public int find(int x) { method union (line 170) | public boolean union(int x, int y) { FILE: src/RedundantConnectionII685.java class RedundantConnectionII685 (line 45) | public class RedundantConnectionII685 { method findRedundantDirectedConnection (line 46) | public int[] findRedundantDirectedConnection(int[][] edges) { class DisjointSet (line 85) | class DisjointSet { method DisjointSet (line 88) | DisjointSet(int N) { method find (line 94) | int find(int x) { method union (line 101) | void union(int x, int y) { method findRedundantDirectedConnection2 (line 120) | public int[] findRedundantDirectedConnection2(int[][] edges) { method root (line 152) | int root(int[] parent, int i) { FILE: src/RegularExpressionMatching10.java class RegularExpressionMatching10 (line 24) | public class RegularExpressionMatching10 { method isMatch (line 29) | public boolean isMatch(String text, String pattern) { method isMatch2 (line 43) | public boolean isMatch2(String text, String pattern) { method isMatch (line 47) | public boolean isMatch(int i, int j, String text, String pattern) { method isMatch3 (line 61) | public boolean isMatch3(String text, String pattern) { type Result (line 92) | enum Result { method isMatch4 (line 97) | public boolean isMatch4(String text, String pattern) { method dp (line 102) | public boolean dp(int i, int j, String text, String pattern) { method isMatch5 (line 126) | public boolean isMatch5(String s, String p) { FILE: src/RemoveDuplicateLetters316.java class RemoveDuplicateLetters316 (line 14) | public class RemoveDuplicateLetters316 { method removeDuplicateLetters (line 19) | public String removeDuplicateLetters(String s) { method findMinLastPos (line 49) | private int findMinLastPos(Map lastPosMap) { method removeDuplicateLetters2 (line 62) | public String removeDuplicateLetters2(String s) { FILE: src/RemoveDuplicatesFromSortedArray26.java class RemoveDuplicatesFromSortedArray26 (line 17) | public class RemoveDuplicatesFromSortedArray26 { method removeDuplicates (line 18) | public int removeDuplicates(int[] nums) { method removeDuplicates2 (line 37) | public int removeDuplicates2(int[] nums) { method removeDuplicates3 (line 46) | public int removeDuplicates3(int[] nums) { FILE: src/RemoveDuplicatesFromSortedArrayII80.java class RemoveDuplicatesFromSortedArrayII80 (line 13) | public class RemoveDuplicatesFromSortedArrayII80 { method removeDuplicates (line 14) | public int removeDuplicates(int[] nums) { method removeDuplicates2 (line 34) | public int removeDuplicates2(int[] nums) { FILE: src/RemoveDuplicatesFromSortedList83.java class RemoveDuplicatesFromSortedList83 (line 23) | public class RemoveDuplicatesFromSortedList83 { method deleteDuplicates (line 24) | public ListNode deleteDuplicates(ListNode head) { method deleteDuplicates2 (line 46) | public ListNode deleteDuplicates2(ListNode head) { method deleteDuplicates3 (line 62) | public ListNode deleteDuplicates3(ListNode head) { FILE: src/RemoveDuplicatesFromSortedListII82.java class RemoveDuplicatesFromSortedListII82 (line 22) | public class RemoveDuplicatesFromSortedListII82 { method deleteDuplicates (line 23) | public ListNode deleteDuplicates(ListNode head) { method deleteDuplicates2 (line 51) | public ListNode deleteDuplicates2(ListNode head) { method deleteDuplicates3 (line 76) | public ListNode deleteDuplicates3(ListNode head) { method deleteDuplicates4 (line 94) | public ListNode deleteDuplicates4(ListNode head) { FILE: src/RemoveInvalidParentheses301.java class RemoveInvalidParentheses301 (line 26) | public class RemoveInvalidParentheses301 { method removeInvalidParentheses (line 27) | public List removeInvalidParentheses(String s) { method helper (line 40) | private int helper(String s, int level, Stack st, StringBui... method setToList (line 84) | private List setToList(Set set, int maxLength) { method removeInvalidParentheses2 (line 99) | public List removeInvalidParentheses2(String s) { method remove (line 105) | public void remove(String s, List ans, int last_i, int last_j,... method removeInvalidParentheses3 (line 126) | public List removeInvalidParentheses3(String s) { method isValid (line 171) | boolean isValid(String s) { method removeInvalidParentheses4 (line 187) | public List removeInvalidParentheses4(String s) { method dfs (line 205) | public void dfs(String s, int i, Set res, StringBuilder sb, in... method removeInvalidParentheses5 (line 238) | public List removeInvalidParentheses5(String s) { method dfs (line 264) | private void dfs(char[] s, int p, int count, int openN, int closeN, Li... FILE: src/RemoveLinkedListElements203.java class RemoveLinkedListElements203 (line 18) | public class RemoveLinkedListElements203 { method removeElements (line 19) | public ListNode removeElements(ListNode head, int val) { method removeElements2 (line 33) | public ListNode removeElements2(ListNode head, int val) { FILE: src/RemoveNthNodeFromEndOfList19.java class RemoveNthNodeFromEndOfList19 (line 25) | public class RemoveNthNodeFromEndOfList19 { method removeNthFromEnd (line 26) | public ListNode removeNthFromEnd(ListNode head, int n) { method removeNthFromEnd2 (line 53) | public ListNode removeNthFromEnd2(ListNode head, int n) { method removeNthFromEnd3 (line 77) | public ListNode removeNthFromEnd3(ListNode head, int n) { method removeNthFromEnd4 (line 103) | public ListNode removeNthFromEnd4(ListNode head, int n) { method removeNthFromEnd5 (line 145) | public ListNode removeNthFromEnd5(ListNode head, int n) { method removeNthFromEnd6 (line 165) | public ListNode removeNthFromEnd6(ListNode head, int n) { FILE: src/ReorderList143.java class ReorderList143 (line 21) | public class ReorderList143 { method reorderList (line 22) | public void reorderList(ListNode head) { method reorderList2 (line 64) | public void reorderList2(ListNode head) { method reorderList3 (line 101) | public void reorderList3(ListNode head) { method reverse (line 125) | ListNode reverse(ListNode head) { method merge (line 138) | void merge(ListNode l1, ListNode l2) { FILE: src/ReorganizeString767.java class ReorganizeString767 (line 20) | public class ReorganizeString767 { method reorganizeString (line 21) | public String reorganizeString(String S) { method reorganizeString2 (line 51) | public String reorganizeString2(String S) { class MultiChar (line 85) | class MultiChar { method MultiChar (line 88) | MultiChar(int ct, char ch) { method reorganizeString3 (line 95) | public String reorganizeString3(String S) { method rearrangeString (line 99) | public String rearrangeString(String str, int k) { method findValidMax (line 118) | private int findValidMax(int[] count, int[] nextIndex, int index){ method reorganizeString4 (line 134) | public String reorganizeString4(String S) { FILE: src/RepeatedDNASequences187.java class RepeatedDNASequences187 (line 14) | public class RepeatedDNASequences187 { method findRepeatedDnaSequences (line 15) | public List findRepeatedDnaSequences(String s) { FILE: src/RepeatedStringMatch686.java class RepeatedStringMatch686 (line 14) | public class RepeatedStringMatch686 { method repeatedStringMatch (line 15) | public int repeatedStringMatch(String A, String B) { method repeatedStringMatch2 (line 50) | public int repeatedStringMatch2(String A, String B) { FILE: src/RepeatedSubstringPattern459.java class RepeatedSubstringPattern459 (line 22) | public class RepeatedSubstringPattern459 { method repeatedSubstringPattern (line 27) | public boolean repeatedSubstringPattern(String s) { method dfs (line 38) | private boolean dfs(String s,String sub,int i){ method repeatedSubstringPattern2 (line 48) | public boolean repeatedSubstringPattern2(String str) { method repeatedSubstringPattern3 (line 58) | public boolean repeatedSubstringPattern3(String str) { method kmp (line 66) | private int[] kmp(String s){ FILE: src/ReplaceWords648.java class ReplaceWords648 (line 27) | public class ReplaceWords648 { method replaceWords (line 28) | public String replaceWords(List dict, String sentence) { method replaceWords2 (line 45) | public String replaceWords2(List roots, String sentence) { method replaceWords3 (line 63) | public String replaceWords3(List roots, String sentence) { method constructTrie (line 74) | private Trie constructTrie(List roots) { class Trie (line 82) | class Trie { method add (line 86) | public void add(String word) { method add (line 90) | private void add(char[] chars, int i) { method search (line 101) | public String search(String word) { method search (line 107) | private String search(char[] chars, int i) { FILE: src/RestoreIPAddresses93.java class RestoreIPAddresses93 (line 17) | public class RestoreIPAddresses93 { method restoreIpAddresses (line 18) | public List restoreIpAddresses(String s) { method helper (line 31) | private void helper(String s, List results, Stack st, ... method isValid (line 49) | private boolean isValid(String current) { method restoreIpAddresses2 (line 60) | public List restoreIpAddresses2(String s) { method isValid2 (line 75) | public boolean isValid2(String s){ FILE: src/ReverseLinkedList206.java class ReverseLinkedList206 (line 20) | public class ReverseLinkedList206 { method reverseList (line 21) | public ListNode reverseList(ListNode head) { method reverseList2 (line 39) | public ListNode reverseList2(ListNode head) { method helper (line 46) | private void helper(ListNode head, ListNode dummy) { method reverseList3 (line 57) | public ListNode reverseList3(ListNode head) { method helper2 (line 61) | private ListNode helper2(ListNode head, ListNode h) { method reverseList4 (line 72) | public ListNode reverseList4(ListNode head) { method reverseList5 (line 85) | public ListNode reverseList5(ListNode head) { FILE: src/ReverseLinkedListII92.java class ReverseLinkedListII92 (line 25) | public class ReverseLinkedListII92 { method reverseBetween (line 26) | public ListNode reverseBetween(ListNode head, int m, int n) { method reverseBetween2 (line 61) | public ListNode reverseBetween2(ListNode head, int m, int n) { method reverseBetween3 (line 88) | public ListNode reverseBetween3(ListNode head, int m, int n) { FILE: src/ReverseNodesInKGroup25.java class ReverseNodesInKGroup25 (line 32) | public class ReverseNodesInKGroup25 { method reverseKGroup (line 33) | public ListNode reverseKGroup(ListNode head, int k) { method reverseKGroup2 (line 89) | public ListNode reverseKGroup2(ListNode head, int k) { method reverseKGroup3 (line 115) | public ListNode reverseKGroup3(ListNode head, int k) { method reverseKGroup4 (line 138) | public ListNode reverseKGroup4(ListNode head, int k) { method reverse (line 158) | public ListNode reverse(ListNode begin, ListNode end){ FILE: src/ReverseString344.java class ReverseString344 (line 8) | public class ReverseString344 { method reverseString (line 9) | public String reverseString(String s) { method swap (line 18) | private void swap(char[] chars, int i, int j) { method reverseString2 (line 28) | public String reverseString2(String s) { method reverseString3 (line 46) | public String reverseString3(String s) { FILE: src/ReverseStringII541.java class ReverseStringII541 (line 18) | public class ReverseStringII541 { method reverseStr (line 19) | public String reverseStr(String s, int k) { method reverse (line 33) | private void reverse(char[] chars, int left, int right) { method swap (line 41) | private void swap(char[] chars, int i, int j) { FILE: src/ReverseVowelsOfAString345.java class ReverseVowelsOfAString345 (line 15) | public class ReverseVowelsOfAString345 { method reverseVowels (line 17) | public String reverseVowels(String s) { method swap (line 35) | private void swap(char[] chars, int i, int j) { FILE: src/ReverseWordsInAString151.java class ReverseWordsInAString151 (line 19) | public class ReverseWordsInAString151 { method reverseWords (line 20) | public String reverseWords(String s) { method swap (line 32) | private void swap(String[] words, int i, int j) { method reverseWords2 (line 41) | public String reverseWords2(String s) { method reverseWords3 (line 48) | public String reverseWords3(String s) { method reverseWords4 (line 69) | public String reverseWords4(String s) { method reverseWords (line 83) | void reverseWords(char[] a, int n) { method cleanSpaces (line 94) | String cleanSpaces(char[] a, int n) { method reverse (line 108) | private void reverse(char[] a, int i, int j) { method reverseWords5 (line 117) | public String reverseWords5(String s) { FILE: src/ReverseWordsInAStringII186.java class ReverseWordsInAStringII186 (line 19) | public class ReverseWordsInAStringII186 { method reverseWords (line 20) | public void reverseWords(char[] str) { method swap (line 40) | private void swap(char[] str, int i, int j) { method reverseWords2 (line 47) | public void reverseWords2(char[] str) { method reverseOneWord (line 70) | private void reverseOneWord(char[] str, int i, int j) { FILE: src/ReverseWordsInAStringIII557.java class ReverseWordsInAStringIII557 (line 13) | public class ReverseWordsInAStringIII557 { method reverseWords (line 14) | public String reverseWords(String s) { method swap (line 32) | private void swap(char[] chars, int i, int j) { FILE: src/RobotRoomCleaner.java class RobotRoomCleaner (line 77) | public class RobotRoomCleaner { method cleanRoom (line 78) | public void cleanRoom(Robot robot) { method cleanRoom (line 82) | public void cleanRoom(Robot robot, Map> map, int... method contains (line 119) | private boolean contains(Map> map, int[] pos) { method next (line 123) | private int[] next(int[] now, int dir) { method up (line 135) | private int[] up(int[] now) { method left (line 139) | private int[] left(int[] now) { method down (line 143) | private int[] down(int[] now) { method right (line 147) | private int[] right(int[] now) { method cleanRoom2 (line 152) | public void cleanRoom2(Robot robot) { method dfs (line 156) | private void dfs(Robot robot, Map> visited, int[... method nextDir (line 202) | private int nextDir(int dir, int move) { method nextPos (line 206) | private int[] nextPos(int[] pos, int dir) { FILE: src/RomanToInteger13.java class RomanToInteger13 (line 52) | public class RomanToInteger13 { method romanToInt (line 53) | public int romanToInt(String s) { method romanToInt2 (line 141) | public int romanToInt2(String s) { FILE: src/RotateArray189.java class RotateArray189 (line 18) | public class RotateArray189 { method rotate (line 19) | public void rotate(int[] nums, int k) { method rotate2 (line 43) | public void rotate2(int[] nums, int k) { method rotate3 (line 56) | public void rotate3(int[] nums, int k) { method rotate4 (line 76) | public void rotate4(int[] nums, int k) { method reverse (line 82) | public void reverse(int[] nums, int start, int end) { method rotate5 (line 93) | public void rotate5(int[] nums, int k) { method cipher (line 105) | private int cipher(int[] nums, int k, int start, int len) { FILE: src/RotateFunction396.java class RotateFunction396 (line 27) | public class RotateFunction396 { method maxRotateFunction (line 28) | public int maxRotateFunction(int[] A) { FILE: src/RotateImage48.java class RotateImage48 (line 48) | public class RotateImage48 { method rotate (line 49) | public void rotate(int[][] matrix) { method rotate2 (line 73) | public void rotate2(int[][] matrix) { FILE: src/RotateList61.java class RotateList61 (line 19) | public class RotateList61 { method rotateRight (line 20) | public ListNode rotateRight(ListNode head, int k) { method rotateRight2 (line 52) | public ListNode rotateRight2(ListNode head, int n) { method rotateRight3 (line 76) | public ListNode rotateRight3(ListNode head, int k) { FILE: src/RussianDollEnvelopes354.java class RussianDollEnvelopes354 (line 19) | public class RussianDollEnvelopes354 { method maxEnvelopes (line 20) | public int maxEnvelopes(int[][] envelopes) { method isLarger (line 47) | private boolean isLarger(int[] e1, int[] e2) { method maxEnvelopes2 (line 52) | public int maxEnvelopes2(int[][] envelopes) { FILE: src/SameTree100.java class SameTree100 (line 49) | public class SameTree100 { method isSameTree (line 50) | public boolean isSameTree(TreeNode p, TreeNode q) { method isSameTree2 (line 60) | public boolean isSameTree2(TreeNode p, TreeNode q) { FILE: src/SearchA2DMatrix74.java class SearchA2DMatrix74 (line 29) | public class SearchA2DMatrix74 { method searchMatrix (line 30) | public boolean searchMatrix(int[][] matrix, int target) { method searchMatrix2 (line 59) | public boolean searchMatrix2(int[][] matrix, int target) { method searchMatrix3 (line 88) | public boolean searchMatrix3(int[][] matrix, int target) { FILE: src/SearchA2DMatrixII240.java class SearchA2DMatrixII240 (line 25) | public class SearchA2DMatrixII240 { method searchMatrix (line 26) | public boolean searchMatrix(int[][] matrix, int target) { method searchMatrix2 (line 36) | public boolean searchMatrix2(int[][] matrix, int target) { method searchMatrix (line 45) | public boolean searchMatrix(int[][] matrix, int target, int xs, int xe... method searchMatrix3 (line 66) | public boolean searchMatrix3(int[][] matrix, int target) { method searchMatrix4 (line 85) | public boolean searchMatrix4(int[][] matrix, int target) { method searchMatrix (line 91) | public boolean searchMatrix(int loi, int loj, int hii, int hij, int[][... FILE: src/SearchForARange34.java class SearchForARange34 (line 16) | public class SearchForARange34 { method searchRange (line 17) | public int[] searchRange(int[] nums, int target) { method searchRange2 (line 41) | public int[] searchRange2(int[] nums, int target) { method searchRange3 (line 80) | public int[] searchRange3(int[] A, int target) { method firstGreaterEqual (line 91) | private static int firstGreaterEqual(int[] A, int target) { method searchRange4 (line 111) | public int[] searchRange4(int[] A, int target) { method searchRange (line 118) | public void searchRange(int[] A, int target, int left, int right, int[... method searchRange5 (line 138) | public int[] searchRange5(int[] nums, int target) { method searchRange (line 143) | public int[] searchRange(int[] nums, int target, int lo, int hi) { method extremeInsertionIndex (line 167) | private int extremeInsertionIndex(int[] nums, int target, boolean left) { method searchRange6 (line 184) | public int[] searchRange6(int[] nums, int target) { FILE: src/SearchInASortedArrayOfUnknownSize702.java class SearchInASortedArrayOfUnknownSize702 (line 26) | public class SearchInASortedArrayOfUnknownSize702 { method search (line 27) | public int search(ArrayReader reader, int target) { method search (line 31) | private int search(ArrayReader reader, int target, int i, int j) { method search2 (line 47) | public int search2(ArrayReader reader, int target) { method search3 (line 67) | public int search3(ArrayReader reader, int target) { FILE: src/SearchInRotatedSortedArray33.java class SearchInRotatedSortedArray33 (line 12) | public class SearchInRotatedSortedArray33 { method search (line 13) | public int search(int[] nums, int target) { method searchHelper (line 20) | private int searchHelper(int[] nums, int target, int s, int e) { method search2 (line 46) | public int search2(int[] A, int target) { method search3 (line 72) | public int search3(int[] nums, int target) { method searchHelper2 (line 78) | private int searchHelper2(int[] nums, int target, int s, int e) { FILE: src/SearchInRotatedSortedArrayII81.java class SearchInRotatedSortedArrayII81 (line 17) | public class SearchInRotatedSortedArrayII81 { method search (line 18) | public boolean search(int[] nums, int target) { method search2 (line 57) | public boolean search2(int[] nums, int target) { method searchHelper (line 64) | private boolean searchHelper(int[] nums, int target, int s, int e) { method search3 (line 87) | public boolean search3(int[] nums, int target) { method search4 (line 127) | public boolean search4(int[] nums, int target) { method searchHelper2 (line 133) | private boolean searchHelper2(int[] nums, int target, int s, int e) { method search5 (line 162) | public boolean search5(int A[], int key) { method search6 (line 183) | public boolean search6(int[] nums, int target) { FILE: src/SearchInsertPosition35.java class SearchInsertPosition35 (line 16) | public class SearchInsertPosition35 { method searchInsert (line 17) | public int searchInsert(int[] nums, int target) { method searchInsert2 (line 30) | public int searchInsert2(int[] A, int target) { method searchInsert3 (line 42) | public int searchInsert3(int[] nums, int target) { FILE: src/SecondMinimumNodeInABinaryTree671.java class SecondMinimumNodeInABinaryTree671 (line 44) | public class SecondMinimumNodeInABinaryTree671 { method findSecondMinimumValue (line 45) | public int findSecondMinimumValue(TreeNode root) { method dfs (line 53) | private void dfs(TreeNode root, int[] cache, int min) { FILE: src/SentenceScreenFitting418.java class SentenceScreenFitting418 (line 44) | public class SentenceScreenFitting418 { method wordsTyping (line 48) | public int wordsTyping(String[] sentence, int rows, int cols) { method wordsTyping2 (line 69) | public int wordsTyping2(String[] sentence, int rows, int cols) { method wordsTyping3 (line 99) | public int wordsTyping3(String[] sentence, int rows, int cols) { method wordsTyping4 (line 124) | public int wordsTyping4(String[] sentence, int rows, int cols) { FILE: src/SentenceSimilarity734.java class SentenceSimilarity734 (line 33) | public class SentenceSimilarity734 { method areSentencesSimilar (line 34) | public boolean areSentencesSimilar(String[] words1, String[] words2, S... FILE: src/SentenceSimilarityII737.java class SentenceSimilarityII737 (line 32) | public class SentenceSimilarityII737 { method areSentencesSimilarTwo (line 33) | public boolean areSentencesSimilarTwo(String[] words1, String[] words2... class DisjointSet (line 50) | class DisjointSet { method DisjointSet (line 54) | public DisjointSet(String[][] pairs) { method find (line 68) | public String find(String word) { method union (line 75) | public void union(String w1, String w2) { method areSentencesSimilarTwo2 (line 97) | public boolean areSentencesSimilarTwo2(String[] words1, String[] words... class DSU (line 119) | class DSU { method DSU (line 121) | public DSU(int N) { method find (line 126) | public int find(int x) { method union (line 130) | public void union(int x, int y) { FILE: src/SerializeAndDeserializeBST449.java class SerializeAndDeserializeBST449 (line 28) | public class SerializeAndDeserializeBST449 { class Codec (line 30) | class Codec { method serialize (line 32) | public String serialize(TreeNode root) { method deserialize (line 50) | public TreeNode deserialize(String data) { class Codec2 (line 73) | class Codec2 { method serialize2 (line 75) | public String serialize2(TreeNode root) { method serialize (line 82) | private void serialize(TreeNode root, StringBuilder sb) { method deserialize2 (line 90) | public TreeNode deserialize2(String data) { method deserialize (line 96) | private TreeNode deserialize(String[] strs, int lo, int hi) { method rightStart (line 107) | private int rightStart(String[] strs, int lo, int hi, int rootVal) { class Codec3 (line 117) | class Codec3 { method serialize (line 121) | public String serialize(TreeNode root) { method deserialize (line 138) | public TreeNode deserialize(String data) { method getNode (line 152) | private TreeNode getNode(Queue q) { //q: 5,3,2,6,7 class Codec4 (line 170) | class Codec4 { method serialize (line 173) | public String serialize(TreeNode root) { method serialize (line 182) | private void serialize(TreeNode root, StringBuilder sb) { method deserialize (line 192) | public TreeNode deserialize(String data) { method deserialize (line 201) | private TreeNode deserialize(String[] nodes, int[] index, int max) { class Codec5 (line 214) | class Codec5 { method serialize (line 217) | public String serialize(TreeNode root) { method serialize (line 226) | private void serialize(TreeNode root, StringBuilder sb) { method deserialize (line 236) | public TreeNode deserialize(String data) { method deserialize (line 245) | private TreeNode deserialize(String[] nodes, int[] index, int min) { FILE: src/SerializeAndDeserializeBinaryTree297.java class SerializeAndDeserializeBinaryTree297 (line 39) | public class SerializeAndDeserializeBinaryTree297 { class Codec (line 40) | class Codec { method serialize (line 42) | public String serialize(TreeNode root) { method deserialize (line 73) | public TreeNode deserialize(String data) { FILE: src/SetMatrixZeroes73.java class SetMatrixZeroes73 (line 12) | public class SetMatrixZeroes73 { method setZeroes (line 13) | public void setZeroes(int[][] matrix) { method setZeroes2 (line 37) | public void setZeroes2(int[][] matrix) { FILE: src/ShortestBridge934.java class ShortestBridge934 (line 26) | public class ShortestBridge934 { method shortestBridge (line 28) | public int shortestBridge(int[][] A) { method findOneIslandEdge (line 56) | private Queue findOneIslandEdge(int[][] A, boolean[][] visited) { method collectEdge (line 69) | private Queue collectEdge(int[][] A, int si, int sj, boolean[][... FILE: src/ShortestCompletingWord748.java class ShortestCompletingWord748 (line 38) | class ShortestCompletingWord748 { method shortestCompletingWord (line 39) | public String shortestCompletingWord(String licensePlate, String[] wor... FILE: src/ShortestDistanceFromAllBuildings317.java class ShortestDistanceFromAllBuildings317 (line 32) | public class ShortestDistanceFromAllBuildings317 { method shortestDistance (line 35) | public int shortestDistance(int[][] grid) { method dfs (line 68) | private void dfs(int[][] grid, int[][] dist, int[][] allDists, boolean... method shortestDistance2 (line 85) | public int shortestDistance2(int[][] grid) { method bfs (line 116) | private void bfs(int[][] grid, int[][] reached, int[][] allDists, int ... class Point (line 150) | class Point { method Point (line 153) | Point(int i, int j) { FILE: src/ShortestPalindrome214.java class ShortestPalindrome214 (line 16) | public class ShortestPalindrome214 { method shortestPalindrome (line 17) | public String shortestPalindrome(String s) { method shortestPalindrome (line 35) | private boolean shortestPalindrome(char[] chars, int left, int right) { method shortestPalindrome2 (line 45) | public String shortestPalindrome2(String s) { method prefix (line 54) | private int[] prefix(char[] chars) { FILE: src/ShortestPathToGetAllKeys864.java class ShortestPathToGetAllKeys864 (line 36) | public class ShortestPathToGetAllKeys864 { method shortestPathAllKeys (line 39) | public int shortestPathAllKeys(String[] grid) { method helper (line 64) | public void helper(char[][] maze, int[] start, int numKeys, Set window, int mid) { method findMedianFromOdd (line 78) | private double findMedianFromOdd(List window, int mid) { method updateWindow (line 82) | private void updateWindow(List window, int newValue, int idx,... method medianSlidingWindow2 (line 100) | public double[] medianSlidingWindow2(int[] nums, int k) { method addNew (line 128) | private void addNew(int index, int value, TreeSet left, TreeSet<... method balance (line 138) | private void balance(TreeSet left, TreeSet right) { class Pair (line 149) | class Pair { method Pair (line 152) | Pair(int i, int v) { method medianSlidingWindow3 (line 159) | public double[] medianSlidingWindow3(int[] nums, int k) { method main (line 210) | public static void main(String[] args) { FILE: src/SmallestRange632.java class SmallestRange632 (line 26) | public class SmallestRange632 { method smallestRange (line 30) | public int[] smallestRange(List> nums) { method smallestRange2 (line 62) | public int[] smallestRange2(List> nums) { class Element (line 97) | class Element { method Element (line 102) | public Element(int r, int i, int v) { method smallestRange3 (line 111) | public int[] smallestRange3(List> nums) { method smallestRange4 (line 135) | public int[] smallestRange4(List> nums) { FILE: src/SolveTheEquation640.java class SolveTheEquation640 (line 34) | public class SolveTheEquation640 { method solveEquation (line 35) | public String solveEquation(String equation) { method solveEquation2 (line 116) | public String solveEquation2(String equation) { method evaluateExpression (line 126) | public int[] evaluateExpression(String exp) { FILE: src/SortArrayByParityII922.java class SortArrayByParityII922 (line 19) | public class SortArrayByParityII922 { method sortArrayByParityII (line 20) | public int[] sortArrayByParityII(int[] A) { method isOdd (line 39) | private boolean isOdd(int num) { FILE: src/SortCharactersByFrequency451.java class SortCharactersByFrequency451 (line 44) | public class SortCharactersByFrequency451 { method frequencySort (line 45) | public String frequencySort(String s) { FILE: src/SortColors75.java class SortColors75 (line 24) | public class SortColors75 { method sortColors (line 25) | public void sortColors(int[] nums) { method helper (line 34) | private void helper(int left, int right, int[] nums) { method merge (line 45) | private void merge(int left, int mid, int right, int[] nums) { method sortColors2 (line 73) | public void sortColors2(int A[]) { method sortColors3 (line 88) | public void sortColors3(int A[]) { method sortColors4 (line 107) | public void sortColors4(int A[]) { method sortColors5 (line 119) | public void sortColors5(int A[], int n) { method sortColors6 (line 130) | public void sortColors6(int[] nums) { method sortColors7 (line 147) | public void sortColors7(int[] nums) { method swap (line 163) | private void swap(int[] nums, int i, int j) { method main (line 170) | public static void main(String[] args) { FILE: src/SortList148.java class SortList148 (line 14) | public class SortList148 { method sortList (line 15) | public ListNode sortList(ListNode head) { method merge (line 34) | private ListNode merge(ListNode left, ListNode right) { FILE: src/SortTransformedArray360.java class SortTransformedArray360 (line 20) | public class SortTransformedArray360 { method sortTransformedArray (line 21) | public int[] sortTransformedArray(int[] nums, int a, int b, int c) { method result (line 54) | private int result(int x, int a, int b, int c) { method sortTransformedArray2 (line 59) | public int[] sortTransformedArray2(int[] nums, int a, int b, int c) { method transfer (line 72) | private int transfer(int x, int a, int b, int c) { FILE: src/SparseMatrixMultiplication311.java class SparseMatrixMultiplication311 (line 27) | public class SparseMatrixMultiplication311 { method multiply (line 48) | public int[][] multiply(int[][] A, int[][] B) { FILE: src/SpiralMatrix54.java class SpiralMatrix54 (line 28) | public class SpiralMatrix54 { method spiralOrder (line 29) | public List spiralOrder(int[][] matrix) { method helper (line 37) | private void helper(int[][] matrix, int x0, int y0, int x1, int y1, Li... method spiralOrder2 (line 59) | public List < Integer > spiralOrder2(int[][] matrix) { method spiralOrder3 (line 83) | public List spiralOrder3(int[][] matrix) { method spiralOrder4 (line 109) | public List spiralOrder4(int[][] matrix) { FILE: src/SpiralMatrixII59.java class SpiralMatrixII59 (line 17) | public class SpiralMatrixII59 { method generateMatrix (line 19) | public int[][] generateMatrix(int n) { method generateMatrix2 (line 42) | public int[][] generateMatrix2(int n) { FILE: src/SplitArrayIntoConsecutiveSubsequences659.java class SplitArrayIntoConsecutiveSubsequences659 (line 33) | public class SplitArrayIntoConsecutiveSubsequences659 { method isPossible (line 84) | public boolean isPossible(int[] nums) { method isPossible2 (line 108) | public boolean isPossible2(int[] nums) { method isPossible3 (line 131) | public boolean isPossible3(int[] nums) { FILE: src/SplitArrayIntoFibonacciSequence842.java class SplitArrayIntoFibonacciSequence842 (line 43) | public class SplitArrayIntoFibonacciSequence842 { method splitIntoFibonacci (line 44) | public List splitIntoFibonacci(String S) { method helper (line 68) | public boolean helper(List res, int a, int b, int k, int N, S... FILE: src/SplitArrayLargestSum410.java class SplitArrayLargestSum410 (line 25) | public class SplitArrayLargestSum410 { method splitArray (line 27) | public int splitArray(int[] nums, int m) { method splitArray2 (line 49) | public int splitArray2(int[] nums, int m) { method splitArray3 (line 73) | public int splitArray3(int[] nums, int m) { method splitArray4 (line 96) | public int splitArray4(int[] nums, int m) { method count (line 116) | private int count(int[] nums, int m, long mid) { FILE: src/SqrtX69.java class SqrtX69 (line 9) | public class SqrtX69 { method mySqrt (line 10) | public int mySqrt(int x) { method mySqrt2 (line 17) | public int mySqrt2(int x) { method mySqrt3 (line 36) | public int mySqrt3(int x) { method mySqrt (line 47) | public int mySqrt(int x) { FILE: src/StoneGame877.java class StoneGame877 (line 35) | public class StoneGame877 { method stoneGame (line 36) | public boolean stoneGame(int[] piles) { method stoneGame (line 41) | public boolean stoneGame(int[] piles, int i, int j, boolean A, int sum... method stoneGame2 (line 52) | public boolean stoneGame2(int[] piles) { FILE: src/StringCompression443.java class StringCompression443 (line 46) | public class StringCompression443 { method compress (line 47) | public int compress(char[] chars) { method compress2 (line 85) | public int compress2(char[] chars) { FILE: src/StringToInteger8.java class StringToInteger8 (line 32) | public class StringToInteger8 { method myAtoi (line 33) | public int myAtoi(String str) { method isNumericChar (line 91) | private boolean isNumericChar(char x) { FILE: src/StrobogrammaticNumber246.java class StrobogrammaticNumber246 (line 22) | public class StrobogrammaticNumber246 { method isStrobogrammatic (line 23) | public boolean isStrobogrammatic(String num) { FILE: src/StrobogrammaticNumberII247.java class StrobogrammaticNumberII247 (line 12) | public class StrobogrammaticNumberII247 { method findStrobogrammatic (line 16) | public List findStrobogrammatic(int n) { method findStrobogrammatic (line 27) | public void findStrobogrammatic(char[] chars, int left, int right, Lis... FILE: src/SubarrayProductLessThanK713.java class SubarrayProductLessThanK713 (line 22) | public class SubarrayProductLessThanK713 { method numSubarrayProductLessThanK (line 23) | public int numSubarrayProductLessThanK(int[] nums, int k) { method numSubarrayProductLessThanK2 (line 42) | public int numSubarrayProductLessThanK2(int[] nums, int k) { FILE: src/SubarraySumEqualsK560.java class SubarraySumEqualsK560 (line 17) | public class SubarraySumEqualsK560 { method subarraySum (line 18) | public int subarraySum(int[] nums, int k) { method subarraySum2 (line 36) | public int subarraySum2(int[] nums, int k) { method subarraySum3 (line 55) | public int subarraySum3(int[] nums, int k) { method subarraySum4 (line 72) | public int subarraySum4(int[] nums, int k) { method subarraySum5 (line 86) | public int subarraySum5(int[] nums, int k) { FILE: src/Subsequence.java class Subsequence (line 7) | public class Subsequence { method subsequences (line 9) | public List subsequences(String target, String[] dict) { method isSubsequence (line 19) | public boolean isSubsequence(String s, String t) { method main (line 35) | public static void main(String[] args) { FILE: src/Subsets78.java class Subsets78 (line 29) | public class Subsets78 { method subsets (line 34) | public List> subsets(int[] nums) { method backtrack (line 40) | private void backtrack(List> list , List tempLi... method subsets2 (line 50) | public List> subsets2(int[] nums) { method main (line 68) | public static void main(String[] args) { FILE: src/SubsetsII90.java class SubsetsII90 (line 20) | public class SubsetsII90 { method subsetsWithDup (line 21) | public List> subsetsWithDup(int[] nums) { method helper (line 29) | public void helper(int pos, int[] nums, Map co, Set<... method mapToList (line 41) | public List mapToList(Map co) { method subsetsWithDup2 (line 52) | public List> subsetsWithDup2(int[] nums) { method helper2 (line 60) | public void helper2(int pos, int[] nums, List each, Set> subsetsWithDup3(int[] nums) { method helper3 (line 80) | public void helper3(int pos, int[] nums, List each, List path, int sum) { method sumNumbers (line 70) | public int sumNumbers(TreeNode root) { method sum (line 74) | public int sum(TreeNode n, int s){ FILE: src/SummaryRanges228.java class SummaryRanges228 (line 16) | public class SummaryRanges228 { method summaryRanges (line 17) | public List summaryRanges(int[] arr) { FILE: src/SuperUglyNumber313.java class SuperUglyNumber313 (line 20) | public class SuperUglyNumber313 { method nthSuperUglyNumber (line 21) | public int nthSuperUglyNumber(int n, int[] primes) { method nthSuperUglyNumber2 (line 42) | public int nthSuperUglyNumber2(int n, int[] primes) { FILE: src/SurroundedRegions130.java class SurroundedRegions130 (line 21) | public class SurroundedRegions130 { method solve (line 22) | public void solve(char[][] board) { method markBoundary (line 48) | private void markBoundary(char[][] board, int i, int j) { method markBoundary2 (line 64) | private void markBoundary2(char[][] board, int i, int j) { method solve2 (line 82) | public static void solve2(char[][] board) { FILE: src/SwapAdjacentInLRString777.java class SwapAdjacentInLRString777 (line 26) | public class SwapAdjacentInLRString777 { method canTransform (line 27) | public boolean canTransform(String start, String end) { method canTransform2 (line 64) | public boolean canTransform2(String start, String end) { FILE: src/SymmetricTree101.java class SymmetricTree101 (line 35) | public class SymmetricTree101 { method isSymmetric (line 36) | public boolean isSymmetric(TreeNode root) { method isSymmetric2 (line 83) | public boolean isSymmetric2(TreeNode root) { method isSymmetric3 (line 125) | public boolean isSymmetric3(TreeNode root) { method isSymmetricHelp (line 129) | private boolean isSymmetricHelp(TreeNode left, TreeNode right){ FILE: src/TargetSum494.java class TargetSum494 (line 28) | public class TargetSum494 { method findTargetSumWays (line 29) | public int findTargetSumWays(int[] nums, int S) { method findTargetSumWays2 (line 45) | public int findTargetSumWays2(int[] nums, int S) { method findTargetSumWays3 (line 67) | public int findTargetSumWays3(int[] nums, int S) { method findTargetSumWays4 (line 86) | public int findTargetSumWays4(int[] nums, int S) { FILE: src/TaskScheduler621.java class TaskScheduler621 (line 33) | public class TaskScheduler621 { method leastInterval (line 37) | public int leastInterval(char[] tasks, int n) { method leastInterval2 (line 54) | public int leastInterval2(char[] tasks, int n) { method leastInterval3 (line 70) | public int leastInterval3(char[] tasks, int n) { method leastInterval4 (line 92) | public int leastInterval4(char[] tasks, int n) { method leastInterval5 (line 113) | public int leastInterval5(char[] tasks, int n) { FILE: src/TextJustification68.java class TextJustification68 (line 64) | public class TextJustification68 { method fullJustify (line 65) | public List fullJustify(String[] words, int maxWidth) { method leftJustify (line 90) | private String leftJustify(List line, int maxWidth) { method middleJustify (line 102) | private String middleJustify(List line, int maxWidth, int word... FILE: src/TheMaze490.java class TheMaze490 (line 59) | public class TheMaze490 { method hasPath (line 62) | public boolean hasPath(int[][] maze, int[] start, int[] destination) { method hasPath (line 72) | public boolean hasPath(int[][] maze, int[] start, int[] destination, D... type Direction (line 111) | public enum Direction { method hasPath2 (line 116) | public boolean hasPath2(int[][] maze, int[] start, int[] destination) { method roll (line 122) | private boolean roll(int[][] maze, int i, int j, int di, int dj, int M... method hasPath3 (line 164) | public boolean hasPath3(int[][] maze, int[] start, int[] destination) { method addNextSteps (line 182) | private void addNextSteps(int[][] maze, Queue q, boolean[][] vi... method hasPath4 (line 222) | public boolean hasPath4(int[][] maze, int[] start, int[] destination) { FILE: src/TheMazeII505.java class TheMazeII505 (line 64) | public class TheMazeII505 { method shortestDistance (line 66) | public int shortestDistance(int[][] maze, int[] start, int[] destinati... method isSame (line 107) | private boolean isSame(int[] a, int[] b) { class Point (line 111) | class Point { method Point (line 114) | Point(int[] p, int d) { method shortestDistance2 (line 124) | public int shortestDistance2(int[][] maze, int[] start, int[] destinat... method shortestDistance3 (line 159) | public int shortestDistance3(int[][] maze, int[] start, int[] destinat... method roll (line 169) | private void roll(int[][] maze, int i, int j, int[][] memo, int M, int... method shortestDistance4 (line 231) | public int shortestDistance4(int[][] maze, int[] start, int[] dest) { method dfs (line 240) | public void dfs(int[][] maze, int[] start, int[][] distance) { method shortestDistance5 (line 262) | public int shortestDistance5(int[][] maze, int[] start, int[] destinat... method roll (line 274) | private void roll(int[][] maze, int[][] distances, boolean[][] visited... method minDistance (line 299) | private int[] minDistance(int[][] distances, boolean[][] visited, int ... method shortestDistance6 (line 317) | public int shortestDistance6(int[][] maze, int[] start, int[] destinat... method roll (line 328) | private void roll(int[][] maze, int[][] distances, int[] start, int M,... FILE: src/TheMazeIII499.java class TheMazeIII499 (line 64) | public class TheMazeIII499 { method findShortestWay (line 68) | public String findShortestWay(int[][] maze, int[] ball, int[] hole) { method roll (line 81) | private void roll(int[][] maze, int i, int j, int hi, int hj, int[][] ... FILE: src/TheSkylineProblem218.java class TheSkylineProblem218 (line 42) | public class TheSkylineProblem218 { method getSkyline (line 45) | public List getSkyline(int[][] buildings) { method getSkyline2 (line 102) | public List getSkyline2(int[][] buildings) { method getSkyline3 (line 152) | public List getSkyline3(int[][] buildings) { method merge (line 156) | private LinkedList merge(int[][] buildings, int lo, int hi) { FILE: src/ThirdMaximumNumber414.java class ThirdMaximumNumber414 (line 27) | public class ThirdMaximumNumber414 { method thirdMax (line 29) | public static int thirdMax(int[] arr) { method thirdMax2 (line 56) | public static int thirdMax2(int[] arr) { method thirdMax3 (line 79) | public int thirdMax3(int[] nums) { method thirdMax4 (line 103) | public int thirdMax4(int[] nums) { FILE: src/ThreeSum15.java class ThreeSum15 (line 22) | public class ThreeSum15 { method threeSum (line 27) | public List> threeSum(int[] nums) { method main (line 57) | public static void main(String[] args) { FILE: src/ThreeSumClosest16.java class ThreeSumClosest16 (line 19) | public class ThreeSumClosest16 { method threeSumClosest (line 21) | public int threeSumClosest(int[] nums, int target) { method threeSumClosest2 (line 55) | public int threeSumClosest2(int[] num, int target) { method main (line 77) | public static void main(String[] args) { FILE: src/ThreeSumSmaller259.java class ThreeSumSmaller259 (line 17) | public class ThreeSumSmaller259 { method threeSumSmaller (line 18) | public int threeSumSmaller(int[] nums, int target) { method threeSumSmaller2 (line 39) | public int threeSumSmaller2(int[] nums, int target) { method twoSumSmaller (line 48) | private int twoSumSmaller(int[] nums, int startIndex, int target) { method threeSumSmaller3 (line 67) | public int threeSumSmaller3(int[] nums, int target) { method twoSumSmaller (line 76) | private int twoSumSmaller(int[] nums, int startIndex, int target) { method binarySearch (line 85) | private int binarySearch(int[] nums, int startIndex, int target) { FILE: src/ToLowerCase709.java class ToLowerCase709 (line 18) | public class ToLowerCase709 { method toLowerCase (line 19) | public String toLowerCase(String str) { method toLowerCase2 (line 26) | public String toLowerCase2(String str) { FILE: src/TopKFrequentElements347.java class TopKFrequentElements347 (line 15) | public class TopKFrequentElements347 { method topKFrequent (line 16) | public List topKFrequent(int[] nums, int k) { method sortByValue (line 35) | private Map sortByValue(Map unsort... method topKFrequent2 (line 58) | public List topKFrequent2(int[] nums, int k) { method topKFrequent3 (line 89) | public List topKFrequent3(int[] nums, int k) { method topKFrequent4 (line 113) | public List topKFrequent4(int[] nums, int k) { FILE: src/TopKFrequentWords692.java class TopKFrequentWords692 (line 30) | public class TopKFrequentWords692 { method topKFrequent (line 31) | public List topKFrequent(String[] words, int k) { method sortByValue (line 40) | private List sortByValue(Map unsortMap, int k) { method topKFrequent2 (line 66) | public List topKFrequent2(String[] words, int k) { method sortByKey (line 98) | private List>> sortByKey(Map topKFrequent3(String[] words, int k) { method topKFrequent4 (line 149) | public List topKFrequent4(String[] words, int k) { method topKFrequent5 (line 168) | public List topKFrequent5(String[] words, int k) { method getWords (line 192) | private void getWords(TrieNode node, List list, int k) { method addWord (line 205) | private boolean addWord(TrieNode root, String word) { class TrieNode (line 217) | class TrieNode { method TrieNode (line 220) | TrieNode() { FILE: src/TotalHammingDistance477.java class TotalHammingDistance477 (line 23) | public class TotalHammingDistance477 { method totalHammingDistance2 (line 27) | public int totalHammingDistance2(int[] nums) { method totalHammingDistance2 (line 42) | public int totalHammingDistance2(int[] nums) { FILE: src/TrappingRainWater42.java class TrappingRainWater42 (line 14) | public class TrappingRainWater42 { method trap (line 20) | public int trap(int[] height) { method trap2 (line 32) | public int trap2(int[] height) { method trap3 (line 59) | public int trap3(int[] A){ method trap4 (line 85) | public int trap4(int[] height) { method trap5 (line 103) | public int trap5(int[] height) { FILE: src/TrappingRainWaterII407.java class TrappingRainWaterII407 (line 32) | public class TrappingRainWaterII407 { method trapRainWater (line 33) | public int trapRainWater(int[][] heightMap) { class Pair (line 78) | class Pair { method Pair (line 82) | Pair(int i, int j, int v) { class Cell (line 93) | private static class Cell implements Comparable { method Cell (line 97) | public Cell(int r, int c, int v) { method compareTo (line 102) | @Override method trapRainWater2 (line 109) | public int trapRainWater2(int[][] heightMap) { method visit (line 135) | private void visit(int[][] height, Cell start, PriorityQueue wal... method fill (line 141) | private void fill(int[][] height, int row, int col, PriorityQueue treeToForest(Node root) { method dfs (line 15) | private Node dfs(Node curr, boolean parentIsErasable, List res) { class Node (line 24) | class Node { FILE: src/Triangle120.java class Triangle120 (line 20) | public class Triangle120 { method minimumTotal (line 21) | public int minimumTotal(List> triangle) { method minimumTotal2 (line 42) | public int minimumTotal2(List> triangle) { FILE: src/TrimABinarySearchTree669.java class TrimABinarySearchTree669 (line 52) | public class TrimABinarySearchTree669 { method trimBST (line 53) | public TreeNode trimBST(TreeNode root, int L, int R) { FILE: src/TwoSum1.java class TwoSum1 (line 20) | public class TwoSum1 { method twoSum (line 22) | public int[] twoSum(int[] nums, int target) { method main (line 40) | public static void main(String[] args) { FILE: src/TwoSumIIInputArrayIsSorted167.java class TwoSumIIInputArrayIsSorted167 (line 19) | public class TwoSumIIInputArrayIsSorted167 { method twoSum (line 20) | public int[] twoSum(int[] numbers, int target) { method binarySearch (line 34) | private int binarySearch(int[] numbers, int target, int l, int r) { method twoSum2 (line 49) | public int[] twoSum2(int[] numbers, int target) { FILE: src/TwoSumIVInputIsABST653.java class TwoSumIVInputIsABST653 (line 38) | public class TwoSumIVInputIsABST653 { method findTarget (line 39) | public boolean findTarget(TreeNode root, int k) { method findTarget2 (line 52) | public boolean findTarget2(TreeNode root, int k) { method treeToList (line 69) | private List treeToList(TreeNode root) { method dfs (line 75) | private void dfs(TreeNode root, List res) { method findTarget3 (line 83) | public boolean findTarget3(TreeNode root, int k) { method dfs (line 87) | private boolean dfs(TreeNode root, Set set, int k) { method findTarget4 (line 98) | public boolean findTarget4(TreeNode root, int k) { FILE: src/UTF8Validation393.java class UTF8Validation393 (line 39) | public class UTF8Validation393 { method validUtf8 (line 40) | public boolean validUtf8(int[] data) { method getBit (line 66) | private int getBit(int num, int pos) { method validUtf82 (line 74) | public boolean validUtf82(int[] data) { FILE: src/UglyNumber263.java class UglyNumber263 (line 26) | public class UglyNumber263 { method isUgly (line 27) | public boolean isUgly(int num) { method isUgly2 (line 39) | public boolean isUgly2(int num) { FILE: src/UglyNumberII264.java class UglyNumberII264 (line 19) | public class UglyNumberII264 { method nthUglyNumber (line 20) | public int nthUglyNumber(int n) { method move (line 45) | private boolean move(long[] p) { method nthUglyNumber2 (line 59) | public int nthUglyNumber2(int n) { method nthUglyNumber3 (line 81) | public int nthUglyNumber3(int n) { FILE: src/UncommonWordsFromTwoSentences884.java class UncommonWordsFromTwoSentences884 (line 26) | public class UncommonWordsFromTwoSentences884 { method uncommonFromSentences (line 27) | public String[] uncommonFromSentences(String A, String B) { method uncommonFromSentences2 (line 71) | public String[] uncommonFromSentences2(String A, String B) { FILE: src/UndirectedGraphNode.java class UndirectedGraphNode (line 5) | public class UndirectedGraphNode { method UndirectedGraphNode (line 8) | UndirectedGraphNode(int x) { FILE: src/UniqueBinarySearchTrees96.java class UniqueBinarySearchTrees96 (line 16) | public class UniqueBinarySearchTrees96 { method numTrees (line 17) | public int numTrees(int n) { method helper (line 30) | private int helper(int i, int j, int[][] dp) { method numTrees2 (line 46) | public int numTrees2(int n) { method helper2 (line 51) | private int helper2(int i, int[] dp) { method numTrees3 (line 70) | public int numTrees3(int n) { FILE: src/UniqueBinarySearchTreesII95.java class UniqueBinarySearchTreesII95 (line 26) | public class UniqueBinarySearchTreesII95 { method generateTrees (line 27) | public List generateTrees(int n) { method generateTrees (line 31) | public List generateTrees(int n, int l, int r) { method generateTrees2 (line 54) | public List generateTrees2(int n) { method generateTrees (line 58) | public List generateTrees(int n, int l, int r, List[][] dp) { method generateTrees3 (line 82) | public List generateTrees3(int n) { method generateTrees4 (line 124) | public List generateTrees4(int n) { method add (line 145) | private void add(List[][] dp, int i, int j, int k, List get(List[][] dp, int i, int j) { FILE: src/UniqueMorseCodeWords804.java class UniqueMorseCodeWords804 (line 37) | public class UniqueMorseCodeWords804 { method uniqueMorseRepresentations (line 39) | public int uniqueMorseRepresentations(String[] words) { method getMorseCode (line 47) | private String getMorseCode(String word) { FILE: src/UniquePaths62.java class UniquePaths62 (line 20) | public class UniquePaths62 { method uniquePaths (line 21) | public int uniquePaths(int m, int n) { method uniquePaths (line 29) | private int uniquePaths(int m, int n, int[][] dp) { method uniquePaths2 (line 41) | public int uniquePaths2(int m, int n) { method uniquePaths3 (line 55) | public int uniquePaths3(int m, int n) { method uniquePaths4 (line 65) | public int uniquePaths4(int m, int n) { FILE: src/UniquePathsII63.java class UniquePathsII63 (line 23) | public class UniquePathsII63 { method uniquePathsWithObstacles (line 24) | public int uniquePathsWithObstacles(int[][] obstacleGrid) { method uniquePathsWithObstacles2 (line 44) | public int uniquePathsWithObstacles2(int[][] obstacleGrid) { FILE: src/UniqueWordAbbreviation288.java class UniqueWordAbbreviation288 (line 33) | public class UniqueWordAbbreviation288 { class ValidWordAbbr (line 34) | class ValidWordAbbr { method ValidWordAbbr (line 37) | public ValidWordAbbr(String[] dictionary) { method isUnique (line 47) | public boolean isUnique(String word) { method encode (line 52) | private String encode(String word) { class ValidWordAbbr2 (line 62) | public class ValidWordAbbr2 { method ValidWordAbbr2 (line 66) | public ValidWordAbbr2(String[] dictionary) { method isUnique (line 74) | public boolean isUnique(String word) { method toAbbr (line 80) | private String toAbbr(String s) { FILE: src/ValidAnagram242.java class ValidAnagram242 (line 17) | public class ValidAnagram242 { method isAnagram (line 18) | public boolean isAnagram(String s, String t) { method isAnagram2 (line 33) | public boolean isAnagram2(String s, String t) { method isAnagram3 (line 47) | public boolean isAnagram3(String s, String t) { FILE: src/ValidNumber65.java class ValidNumber65 (line 15) | public class ValidNumber65 { method isNumber (line 16) | public boolean isNumber(String s) { FILE: src/ValidPalindrome125.java class ValidPalindrome125 (line 18) | public class ValidPalindrome125 { method isPalindrome (line 19) | public boolean isPalindrome(String s) { method isLowerAlphanumeric (line 38) | private boolean isLowerAlphanumeric(char c) { method isPalindrome2 (line 43) | public boolean isPalindrome2(String s) { method isAlphanumeric (line 62) | private boolean isAlphanumeric(char c) { FILE: src/ValidPalindromeII680.java class ValidPalindromeII680 (line 21) | public class ValidPalindromeII680 { method validPalindrome (line 22) | public boolean validPalindrome(String s) { method validPalindrome (line 26) | private boolean validPalindrome(String s, int l, int r, boolean flag) { FILE: src/ValidParentheses20.java class ValidParentheses20 (line 15) | public class ValidParentheses20 { method isValid (line 16) | public boolean isValid(String s) { method isBackP (line 40) | private boolean isBackP(char c) { method pair (line 44) | private char pair(char c) { method isValid2 (line 58) | public boolean isValid2(String s) { method isValid3 (line 75) | public boolean isValid3(String s) { method main (line 119) | public static void main(String[] args) { FILE: src/ValidParenthesisString678.java class ValidParenthesisString678 (line 28) | public class ValidParenthesisString678 { method checkValidString (line 29) | public boolean checkValidString(String s) { method checkValidString (line 33) | public boolean checkValidString(char[] chars, int i, int[] count) { method checkValidString2 (line 59) | public boolean checkValidString2(String s) { method checkValidString3 (line 95) | public boolean checkValidString3(String s) { FILE: src/ValidSudoku36.java class ValidSudoku36 (line 18) | public class ValidSudoku36 { method isValidSudoku (line 19) | public boolean isValidSudoku(char[][] board) { method cubeId (line 38) | private int cubeId(int i, int j) { method isValidSudoku2 (line 45) | public boolean isValidSudoku2(char[][] board) { method isValidSudoku3s (line 62) | public boolean isValidSudoku3s(char[][] board) { FILE: src/ValidTriangleNumber611.java class ValidTriangleNumber611 (line 21) | public class ValidTriangleNumber611 { method triangleNumber (line 22) | public int triangleNumber(int[] nums) { method isValidTriangle (line 38) | public boolean isValidTriangle(int a, int b, int c) { method triangleNumber2 (line 47) | public int triangleNumber2(int[] nums) { method triangleNumber3 (line 72) | public int triangleNumber3(int[] nums) { method triangleNumber4 (line 89) | public static int triangleNumber4(int[] A) { FILE: src/ValidWordAbbreviation408.java class ValidWordAbbreviation408 (line 26) | public class ValidWordAbbreviation408 { method validWordAbbreviation (line 27) | public boolean validWordAbbreviation(String word, String abbr) { method isDigit (line 54) | private boolean isDigit(char ch) { FILE: src/ValidateBinarySearchTree98.java class ValidateBinarySearchTree98 (line 33) | public class ValidateBinarySearchTree98 { method isValidBST (line 34) | public boolean isValidBST(TreeNode root) { method helper (line 38) | private boolean helper(TreeNode root, long min, long max) { method isValidBST2 (line 45) | public boolean isValidBST2(TreeNode root) { method isValidBST (line 50) | private boolean isValidBST(TreeNode root, int[] bounds) { method isValidBST3 (line 78) | public boolean isValidBST3(TreeNode root) { FILE: src/ValidateStackSequences946.java class ValidateStackSequences946 (line 23) | public class ValidateStackSequences946 { method validateStackSequences (line 24) | public boolean validateStackSequences(int[] pushed, int[] popped) { FILE: src/VerifyPreorderSequenceInBinarySearchTree255.java class VerifyPreorderSequenceInBinarySearchTree255 (line 27) | public class VerifyPreorderSequenceInBinarySearchTree255 { method verifyPreorder (line 28) | public boolean verifyPreorder(int[] preorder) { method verifyPreorder2 (line 44) | public boolean verifyPreorder2(int[] preorder) { method helper (line 49) | private boolean helper(int[] preorder, int i, int j, int lower) { method verifyPreorder3 (line 64) | public boolean verifyPreorder3(int[] preorder) { FILE: src/WallsAndGates286.java class WallsAndGates286 (line 32) | public class WallsAndGates286 { method wallsAndGates (line 36) | public void wallsAndGates(int[][] rooms) { method dfs (line 52) | private void dfs(int[][] rooms, int distance, int i, int j) { method wallsAndGates2 (line 72) | public void wallsAndGates2(int[][] rooms) { method dfs2 (line 83) | private void dfs2(int[][] rooms, int i, int j, int dis) { method wallsAndGates4 (line 105) | public void wallsAndGates4(int[][] rooms) { FILE: src/WaterAndJugProblem365.java class WaterAndJugProblem365 (line 28) | public class WaterAndJugProblem365 { method canMeasureWater (line 30) | public boolean canMeasureWater(int x, int y, int z) { method canGetZ (line 47) | private boolean canGetZ(int x, int y, int z) { method canMeasureWaterMath (line 86) | public boolean canMeasureWaterMath(int x, int y, int z) { method GCD (line 96) | public int GCD(int a, int b){ method main (line 108) | public static void main(String[] args) { FILE: src/WiggleSort280.java class WiggleSort280 (line 11) | public class WiggleSort280 { method wiggleSort (line 12) | public void wiggleSort(int[] nums) { method wiggleSort2 (line 23) | public void wiggleSort2(int[] nums) { method swap (line 38) | private void swap(int[] nums, int i, int j) { FILE: src/WiggleSortII324.java class WiggleSortII324 (line 16) | public class WiggleSortII324 { method wiggleSort (line 20) | public void wiggleSort(int[] nums) { method wiggleSort2 (line 36) | public void wiggleSort2(int[] nums) { method findMedium (line 55) | private int findMedium(int[] nums, int L, int R, int k) { method partition (line 63) | private int partition(int[] nums, int L, int R) { method swap (line 76) | private void swap(int[] nums, int i, int j) { FILE: src/WiggleSubsequence376.java class WiggleSubsequence376 (line 35) | public class WiggleSubsequence376 { method wiggleMaxLength (line 36) | public int wiggleMaxLength(int[] nums) { method wiggleMaxLength2 (line 58) | public int wiggleMaxLength2(int[] nums) { method wiggleMaxLength3 (line 76) | public int wiggleMaxLength3(int[] nums) { method wiggleMaxLength4 (line 99) | public int wiggleMaxLength4(int[] nums) { method wiggleMaxLength5 (line 118) | public int wiggleMaxLength5(int[] nums) { FILE: src/WildcardMatching44.java class WildcardMatching44 (line 23) | public class WildcardMatching44 { method isMatch (line 25) | public boolean isMatch(String s, String p) { method isMatch (line 30) | private boolean isMatch(String s, int i, String p, int j) { method restAreStars (line 45) | private boolean restAreStars(String p, int j) { method isMatch2 (line 55) | public boolean isMatch2(String s, String p) { method isMatch3 (line 84) | public boolean isMatch3(String s, String p) { method isMatch4 (line 119) | boolean isMatch4(String str, String pattern) { method isMatch5 (line 151) | public boolean isMatch5(String s, String p) { method isMatch (line 157) | public boolean isMatch(char[] s, int i, char[] p, int j, Map wordsAbbreviation(List dict) { method encode (line 59) | private String encode(String word, int offset) { class Abbr (line 65) | class Abbr { method Abbr (line 69) | Abbr(String word, String abbr, int offset) { method wordsAbbreviation2 (line 80) | public List wordsAbbreviation2(List words) { method abbrev (line 110) | public String abbrev(String word, int i) { method longestCommonPrefix (line 116) | public int longestCommonPrefix(String word1, String word2) { class IndexedWord (line 124) | class IndexedWord { method IndexedWord (line 127) | IndexedWord(String w, int i) { method wordsAbbreviation3 (line 137) | public List wordsAbbreviation3(List words) { class TrieNode (line 177) | class TrieNode { method TrieNode (line 180) | TrieNode() { FILE: src/WordBreak139.java class WordBreak139 (line 19) | public class WordBreak139 { method wordBreak (line 20) | public boolean wordBreak(String s, List wordDict) { method wordBreak2 (line 37) | public boolean wordBreak2(String s, List wordDict) { FILE: src/WordBreakII140.java class WordBreakII140 (line 40) | public class WordBreakII140 { method wordBreak (line 65) | public List wordBreak(String s, List wordDict) { method wordBreak (line 71) | public List wordBreak(String s, Set wordDict) { method wordIsBreakable (line 90) | public boolean wordIsBreakable(String s, Set wordDictSet) { method wordBreak2 (line 106) | public List wordBreak2(String s, List wordDict) { method helper (line 125) | private void helper(int N, Set[] dp, List res, StringB... method wordBreak3 (line 141) | public List wordBreak3(String s, Set wordDict) { method DFS (line 146) | List DFS(String s, Set wordDict, HashMap dictL) { method ladderLength2 (line 81) | public int ladderLength2(String start, String end, List dictL) { method ladderLength3 (line 135) | public int ladderLength3(String beginWord, String endWord, List> findLadders(String beginWord, String endWord... method findLadders2 (line 92) | public List> findLadders2(String start, String end, List<... method helper (line 118) | private boolean helper(Set dict, Set set1, Set... method generateList (line 176) | private void generateList(String start, String end, Map> findLadders3(String beginWord, String endWor... method dfs (line 255) | private void dfs(String beginWord, List path, Map findWords(char[][] board, String[] words) { method helper (line 48) | private void helper(char[][] board, int i, int j, TrieNode node, List<... method buildTrie (line 68) | public TrieNode buildTrie(String[] words) { class TrieNode (line 84) | class TrieNode { method TrieNode (line 93) | public TrieNode() { method containsKey (line 97) | public boolean containsKey(char c) { method get (line 100) | public TrieNode get(char c) { method put (line 103) | public void put(char c, TrieNode node) { method setWord (line 106) | public void setWord(String w) { method getWord (line 109) | public String getWord() { method containsWord (line 112) | public boolean containsWord() { method findWords2 (line 119) | public List findWords2(char[][] board, String[] words) { method dfs (line 137) | private void dfs(char[][] board, boolean[][] visited, Trie trie, int i... method constructTrie (line 152) | private Trie constructTrie(String[] words) { class Trie (line 158) | class Trie { method addWord (line 162) | public void addWord(String word) { method addWord (line 166) | public void addWord(char[] chars, int i) { method get (line 177) | public Trie get(char c) { method findWords3 (line 196) | public List findWords3(char[][] board, String[] words) { method dfs (line 207) | public void dfs(char[][] board, int i, int j, TrieNode p, List... method buildTrie2 (line 224) | public TrieNode buildTrie2(String[] words) { class TrieNode (line 238) | class TrieNode { method TrieNode (line 93) | public TrieNode() { method containsKey (line 97) | public boolean containsKey(char c) { method get (line 100) | public TrieNode get(char c) { method put (line 103) | public void put(char c, TrieNode node) { method setWord (line 106) | public void setWord(String w) { method getWord (line 109) | public String getWord() { method containsWord (line 112) | public boolean containsWord() { FILE: src/WordSquares425.java class WordSquares425 (line 73) | public class WordSquares425 { method wordSquares (line 74) | public List> wordSquares(String[] words) { method helper (line 86) | private void helper(char[][] square, TrieNode root, int pos, int len, ... class TrieNode (line 109) | class TrieNode { method addWord (line 114) | public void addWord(String word) { method addWord (line 118) | public void addWord(char[] chars, int i) { method search (line 132) | public List search(char[] prefix, int length) { method search (line 138) | public void search(char[] prefix, int length, int i, List re... method wordSquares2 (line 155) | public List> wordSquares2(String[] words) { method helper (line 164) | private void helper(char[][] board, int i, String[] words, List v1, List v2) { method next (line 43) | public int next() { method hasNext (line 57) | public boolean hasNext() { class ZigzagIterator2 (line 65) | class ZigzagIterator2 { method ZigzagIterator (line 67) | public ZigzagIterator(List v1, List v2) { method next (line 73) | public int next() { method hasNext (line 80) | public boolean hasNext() { class ZigzagIterator3 (line 88) | class ZigzagIterator3 { method ZigzagIterator (line 91) | public ZigzagIterator(List v1, List v2) { method next (line 96) | public int next() { method hasNext (line 101) | public boolean hasNext() { FILE: src/data-structures/BinaryIndexedTree.java class BinaryIndexedTree (line 6) | public class BinaryIndexedTree { method BinaryIndexedTree (line 10) | public BinaryIndexedTree(int[] nums) { method BinaryIndexedTree (line 17) | public BinaryIndexedTree(int N) { method constructBIT (line 22) | private void constructBIT(int[] nums) { method update (line 29) | public void update(int i, int delta) { method query (line 37) | public int query(int i) { method lowBit (line 47) | private int lowBit(int x) { FILE: src/data-structures/BinarySearchTree.java class BinarySearchTree (line 1) | public class BinarySearchTree { method BinarySearchTree (line 4) | BinarySearchTree() { method search (line 7) | public Node search(int x) { method search (line 12) | private Node search(Node node, int x) { method searchIteratively (line 21) | private Node searchIteratively(Node node, int x) { method insert (line 34) | public void insert(int x) { method insert (line 39) | public Node insert(Node node, int x) { method insertIteratively (line 49) | public Node insertIteratively(Node node, int x) { method delete (line 85) | public void delete(int x) { method delete (line 89) | public Node delete(Node node, int x) { method getRoot (line 112) | public Node getRoot() { class Node (line 116) | class Node { method Node (line 120) | Node(int x) { FILE: src/data-structures/BinarySearchTreeWithParent.java class BinarySearchTreeWithParent (line 5) | public class BinarySearchTreeWithParent { method BinarySearchTree (line 8) | BinarySearchTree() { method search (line 11) | public Node search(int x) { method search (line 16) | private Node search(Node node, int x) { method searchIteratively (line 25) | private Node searchIteratively(Node node, int x) { method insert (line 38) | public void insert(int x) { method insert (line 43) | public Node insert(Node node, int x) { method insertIteratively (line 53) | public Node insertIteratively(Node node, int x) { method delete (line 89) | public void delete(int x) { method delete (line 93) | public Node delete(Node node, int x) { method getRoot (line 116) | public Node getRoot() { class Node (line 120) | class Node { method Node (line 126) | Node(int x) { method Node (line 130) | Node(int x, Node p) { method inorderSuccessor (line 135) | public Node inorderSuccessor() { method inorderPredecessor (line 151) | public Node inorderPredecessor() { FILE: src/data-structures/DisjointSet.java class DisjointSet (line 5) | public class DisjointSet { method DisjointSet (line 10) | public DisjointSet(int v) { method find (line 18) | public int find(int x) { method union (line 25) | public void union(int x, int y) { FILE: src/data-structures/LFUCache.java class LFUCache (line 5) | public class LFUCache { method LFUCache (line 11) | public LFUCache(int capacity) { method get (line 18) | public int get(int key) { method updateNodeFreq (line 25) | private void updateNodeFreq(ItemNode item) { method itemNodeIsEmpty (line 43) | private boolean itemNodeIsEmpty(ItemNode node) { method removeNode (line 47) | private void removeNode(FreqNode node) { method removeNode (line 52) | private void removeNode(ItemNode node) { method dislinkNode (line 57) | private void dislinkNode(FreqNode node) { method dislinkNode (line 62) | private void dislinkNode(ItemNode node) { method addAfter (line 67) | private void addAfter(FreqNode currNode, FreqNode newNode) { method addAfter (line 74) | private void addAfter(ItemNode currNode, ItemNode newNode) { method addBefore (line 81) | private void addBefore(ItemNode currNode, ItemNode newNode) { method put (line 88) | public void put(int key, int value) { method newItemHead (line 117) | private ItemNode newItemHead() { class ItemNode (line 124) | class ItemNode extends Node { method ItemNode (line 130) | ItemNode(int key, int val, int freq) { method ItemNode (line 135) | ItemNode() { class FreqNode (line 142) | class FreqNode extends Node { method FreqNode (line 147) | FreqNode(int freq) { method FreqNode (line 151) | FreqNode() { class Node (line 156) | abstract class Node { FILE: src/data-structures/LRUCache.java class LRUCache (line 43) | public class LRUCache { method LRUCache (line 49) | public LRUCache(int capacity) { method get (line 55) | public int get(int key) { method delete (line 66) | private void delete(Node node) { method moveToEnd (line 71) | private void moveToEnd(Node node) { method put (line 78) | public void put(int key, int value) { class Node (line 97) | class Node { method Node (line 102) | Node (int k, int v) { FILE: src/data-structures/MinHeap.java class MinHeap (line 3) | public class MinHeap { method MinHeap (line 9) | public MinHeap(int capacity) { method getMin (line 15) | public int getMin() { method extractMin (line 20) | public int extractMin() { method heapify (line 33) | private void heapify(int idx) { method heapify (line 37) | private void heapify(int[] A, int size, int idx) { method swap (line 49) | private void swap(int[] A, int i, int j) { method decreaseKey (line 55) | public void decreaseKey(int idx, int x) { method insert (line 62) | public void insert(int x) { method popUp (line 68) | private void popUp(int idx) { method delete (line 76) | public int delete(int idx) { method buildHeap (line 82) | public void buildHeap(int[] A) { method sort (line 89) | public void sort(int[] A) { method parent (line 98) | private int parent(int i) { method left (line 102) | private int left(int i) { method right (line 106) | private int right(int i) { FILE: src/data-structures/Trie.java class Trie (line 15) | public class Trie { method Trie (line 20) | public Trie() { method insert (line 25) | public void insert(String word) { method search (line 38) | public boolean search(String word) { method startsWith (line 51) | public boolean startsWith(String prefix) { FILE: src/data-structures/TrieNode.java class TrieNode (line 7) | public class TrieNode { method TrieNode (line 16) | public TrieNode() { method containsKey (line 20) | public boolean containsKey(char c) { method get (line 23) | public TrieNode get(char c) { method put (line 26) | public void put(char c, TrieNode node) { method setLeaf (line 29) | public void setLeaf() { method isLeaf (line 32) | public boolean isLeaf() { FILE: src/graph/Dijkstra.java class Dijkstra (line 12) | public class Dijkstra { method shortestDistancesFrom (line 17) | public int[] shortestDistancesFrom(int[][] graph, int src) { method extractMin (line 47) | private int extractMin(int[] dist, Set sptSet) { method shortestDistance (line 62) | public int shortestDistance(int[][] graph, int src, int dest) { method shortestPath (line 96) | public List shortestPath(int[][] graph, int src, int dest) { method constructShortestPath (line 129) | private List constructShortestPath(int[] parent, int src, int... FILE: src/graph/StrongConnectivity.java class StrongConnectivity (line 12) | public class StrongConnectivity { method isStronglyConnected (line 14) | public boolean isStronglyConnected(Set[] graph) { method dfs (line 35) | private void dfs(Set[] graph, int i, boolean[] visited) { method transpose (line 45) | private Set[] transpose(Set[] graph) { method stronglyConnectedComponents (line 62) | public List> stronglyConnectedComponents(Set[] g... method traverseComponent (line 92) | private void traverseComponent(Set[] graph, int i, boolean[] ... method getComponent (line 103) | private void getComponent(Set[] graph, int i, boolean[] visit... FILE: src/graph/TopologicalSort.java class TopologicalSort (line 9) | public class TopologicalSort { method sortByStack (line 10) | public List sortByStack(Set[] graph) { method sortByStack (line 24) | public void sortByStack(Set[] graph, int i, int[] visited, Li... method sortByIndegree (line 38) | public List sortByIndegree(Set[] graph) { FILE: src/knapsack/CompleteKnapsack.java class CompleteKnapsack (line 9) | public class CompleteKnapsack { method maxValue (line 14) | public int maxValue(int[] costs, int[] weights, int V) { method maxValue2 (line 35) | public int maxValue2(int[] costs, int[] weights, int V) { method main (line 49) | public static void main(String[] args) { FILE: src/knapsack/MultipleKnapsack.java class MultipleKnapsack (line 8) | public class MultipleKnapsack { method maxValue (line 13) | public int maxValue(int[] costs, int[] weights, int[] limits, int V) { FILE: src/knapsack/ZeroOneKnapsack.java class ZeroOneKnapsack (line 6) | public class ZeroOneKnapsack { method maxValue (line 17) | public int maxValue(int[] costs, int[] weights, int V) { method maxValue2 (line 37) | public int maxValue2(int[] costs, int[] weights, int V) { method main (line 51) | public static void main(String[] args) { FILE: src/search/BinarySearch.java class BinarySearch (line 17) | public class BinarySearch { method searchRecursively (line 18) | public static int searchRecursively(int arr[], int x) { method searchIteratively (line 22) | public static int searchIteratively(int arr[], int x) { method binarySearch (line 27) | public static int binarySearch(int arr[], int l, int r, int x) { method binarySearch (line 42) | public static int binarySearch(int arr[], int x) { method main (line 60) | public static void main(String[] args) { FILE: src/search/ExponentialSearch.java class ExponentialSearch (line 20) | public class ExponentialSearch { method search (line 21) | public static int search(int arr[], int x) { method main (line 31) | public static void main(String[] args) { FILE: src/search/InterpolationSearch.java class InterpolationSearch (line 24) | public class InterpolationSearch { method search (line 25) | public static int search(int[] arr, int x) { method main (line 43) | public static void main(String[] args) { FILE: src/search/JumpSearch.java class JumpSearch (line 19) | public class JumpSearch { method search (line 20) | public static int search(int[] arr, int x) { method main (line 42) | public static void main(String[] args) { FILE: src/search/LinearSearch.java class LinearSearch (line 15) | public class LinearSearch { method search (line 16) | public static int search(int arr[], int x) { method main (line 24) | public static void main(String[] args) { FILE: src/search/TernarySearch.java class TernarySearch (line 17) | public class TernarySearch { method searchRecursively (line 18) | public static int searchRecursively(int arr[], int x) { method searchIteratively (line 22) | public static int searchIteratively(int arr[], int x) { method ternarySearch (line 27) | public static int ternarySearch(int arr[], int l, int r, int x) { method ternarySearch (line 42) | public static int ternarySearch(int arr[], int x) { method main (line 66) | public static void main(String[] args) { FILE: src/sort/BubbleSort.java class BubbleSort (line 14) | public class BubbleSort { method sort (line 15) | public static void sort(int[] arr) { method sortEarlyStop (line 22) | public static void sortEarlyStop(int[] arr) { method swap (line 35) | private static void swap(int[] arr, int i, int j) { method main (line 41) | public static void main(String[] args) { FILE: src/sort/BucketSort.java class BucketSort (line 17) | public class BucketSort { method sort (line 21) | public static void sort(int[] arr) { method bucketSort (line 25) | public static void bucketSort(int arr[], int size) { method main (line 59) | public static void main(String[] args) { FILE: src/sort/CountingSort.java class CountingSort (line 20) | public class CountingSort { method sort (line 21) | public static void sort(int arr[], int range) { method main (line 42) | public static void main(String[] args) { FILE: src/sort/HeapSort.java class HeapSort (line 15) | public class HeapSort { method sort (line 16) | public static void sort(int[] arr) { method heapify (line 27) | private static void heapify(int arr[], int n, int i) { method swap (line 41) | private static void swap(int[] nums, int i, int j) { method main (line 47) | public static void main(String[] args) { FILE: src/sort/InsertionSort.java class InsertionSort (line 12) | public class InsertionSort { method sort (line 13) | public static void sort(int[] arr) { method sort (line 26) | public static void sort(Integer[] arr) { method main (line 39) | public static void main(String[] args) { FILE: src/sort/MergeSort.java class MergeSort (line 12) | public class MergeSort { method sort (line 13) | public static void sort(int[] arr) { method mergeSort (line 19) | private static void mergeSort(int[] arr, int l, int r) { method merge (line 29) | private static void merge(int[] arr, int l, int m, int r) { method mergeSort (line 69) | private static void mergeSort(int[] arr, int[] helper, int l, int r) { method merge (line 79) | private static void merge(int[] arr, int[] helper, int l, int m, int r) { method main (line 105) | public static void main(String[] args) { FILE: src/sort/QuickSort.java class QuickSort (line 21) | public class QuickSort { method sortRecursively (line 22) | public static void sortRecursively(int[] nums) { method sortIteratively (line 26) | public static void sortIteratively(int[] nums) { method quickSortRecursively (line 31) | private static void quickSortRecursively(int[] nums, int left, int rig... method quickSortIteratively (line 39) | private static void quickSortIteratively(int arr[], int l, int h) { method partition (line 64) | private static int partition(int[] nums, int left, int right) { method partition2 (line 78) | private static int partition2(int[] nums, int left, int right) { method partition3 (line 91) | private static int partition3(int[] nums, int left, int right) { method swap (line 106) | private static void swap(int[] nums, int i, int j) { method main (line 112) | public static void main(String[] args) { FILE: src/sort/RadixSort.java class RadixSort (line 13) | public class RadixSort { method sort (line 14) | public static void sort(int[] arr) { method radixSort (line 18) | private static void radixSort(int arr[], int n) { method getMax (line 25) | private static int getMax(int arr[], int n) { method countSort (line 33) | private static void countSort(int arr[], int n, int exp) { method main (line 53) | public static void main(String[] args) { FILE: src/sort/SelectionSort.java class SelectionSort (line 12) | public class SelectionSort { method sort (line 13) | public static void sort(int[] arr) { method swap (line 23) | private static void swap(int[] arr, int i, int j) { method main (line 29) | public static void main(String[] args) {