MCPcopy Create free account

hub / github.com/ctfu/Leetcode / functions

Functions771 in github.com/ctfu/Leetcode

↓ 1 callersMethodfindKthLargestNumber
(int[] nums, int k)
algorithm/wiggleSortII.java:21
↓ 1 callersMethodfindLargest
(TreeNode root)
algorithm/largestBSTSubtree.java:8
↓ 1 callersMethodfindLargest
(List<Integer> res, TreeNode root, int curLevel)
algorithm/findLargestValueEachTreeRow.java:30
↓ 1 callersMethodfindLeaf
(List<Integer> res, TreeNode root)
algorithm/boundaryOfBinaryTree.java:84
↓ 1 callersMethodfindMaxPath
(TreeNode node)
algorithm/binaryTreeMaxmimumPathSum.java:39
↓ 1 callersMethodfindMiddle
(ListNode head)
algorithm/reorderList.java:34
↓ 1 callersMethodfindMin
(TreeNode root)
algorithm/deleteNodeInBST.java:24
↓ 1 callersMethodfindNumber
(int n, int m)
algorithm/strobogrammaticNumberII.java:8
↓ 1 callersMethodfindRoute
(List<String> res, String[][] tickets, String source, Set<String[]> visited)
algorithm/reconstructItinerary.java:22
↓ 1 callersMethodfindSmallLeaf
(TreeNode root, String s)
algorithm/smallestStringStartingFromLeaf.java:18
↓ 1 callersMethodfindStroboNumber
(int m, int n)
algorithm/strobogrammaticNumberIII.java:19
↓ 1 callersMethodfindSub
(Set<List<Integer>> res, int[] nums, List<Integer> tempList, int index)
algorithm/increasingSubsequence.java:10
↓ 1 callersMethodfindSubstring
(String s, int k, int begin, int end)
algorithm/longestSubstringWithAtLeaseKRepeating.java:9
↓ 1 callersMethodflattenHelper
(TreeNode root, TreeNode pre)
algorithm/flattenBinaryTreeToLinkedList.java:34
↓ 1 callersMethodfollow
(int id)
algorithm/designTwitter.java:72
↓ 1 callersMethodgcd
(int x, int y)
algorithm/waterAndJugProblem.java:12
↓ 1 callersMethodgenNext
(String init)
algorithm/countAndSay.java:13
↓ 1 callersMethodgenPermutation
(List<String> res, List<Character> list, String mid, StringBuilder sb, boolean[] visited)
algorithm/palindromPermutation.java:36
↓ 1 callersMethodgenRandom
(int max)
algorithm/linkedListRandomNode.java:38
↓ 1 callersMethodgenTrees
(int begin, int end)
algorithm/uniqueBinarySearchTreeII.java:7
↓ 1 callersMethodgenerateDigitHelper
(int[] num, int count, int position, int calculated, List<Integer> res)
algorithm/binaryWatch.java:29
↓ 1 callersMethodget
(int key)
algorithm/LFU.java:13
↓ 1 callersMethodgetDepth
(List<NestedInteger> list, int level)
algorithm/nestedListWeightSumII.java:8
↓ 1 callersMethodgetDistance
(int[] a, int[] b)
algorithm/numberOfBoomerangs.java:22
↓ 1 callersMethodgetEnemy
(char[][] grid, int x, int y)
algorithm/bombEnemy.java:38
↓ 1 callersMethodgetGCD
(int x, int y)
algorithm/maxPointsOnALine.java:42
↓ 1 callersMethodgetLps
(String s)
algorithm/shortestPalindrom.java:11
↓ 1 callersMethodgetOneCharacterMutation
(Set<String> bank, String gen)
algorithm/minimumGeneticMutation.java:38
↓ 1 callersMethodgetOneDistanceWords
(Set<String> wordList, String word)
algorithm/wordLadder.java:36
↓ 1 callersMethodgetOneDistanceWords
(Set<String> dict, String word)
algorithm/wordLadderII.java:40
↓ 1 callersMethodgetPath
(List<List<String>> res, Map<String, List<String>> hm, List<String> tempList, String endWord)
algorithm/wordLadderII.java:63
↓ 1 callersMethodgetShortest1
(Map<String, List<Integer>> hm, String word)
algorithm/shortestWordDistanceIII.java:18
↓ 1 callersMethodgetShortest2
(Map<String, List<Integer>> hm, String word1, String word2)
algorithm/shortestWordDistanceIII.java:27
↓ 1 callersMethodgetStr
(char c)
algorithm/letterCombinationPhoneNumber.java:27
↓ 1 callersMethodgetSum
(List<NestedInteger> list, int level)
algorithm/nestedListWeightSumII.java:17
↓ 1 callersMethodgetSum
(List<NestedInteger> list, int depth)
algorithm/nestedListWeightSum.java:22
↓ 1 callersMethodhandleValue
(int val)
algorithm/findModeInBST.java:55
↓ 1 callersMethodhasCycle
(List<List<Integer>> adjList, boolean[] visited, int u, int parent)
algorithm/graphValidTree.java:59
↓ 1 callersMethodhasNext
()
algorithm/zigZagIterator.java:20
↓ 1 callersMethodhelper
(TreeNode node, int[] count)
algorithm/countUnivalueSubtrees.java:9
↓ 1 callersMethodhelper
(List<String> res, TreeNode root, StringBuilder sb)
algorithm/binaryTreePaths.java:64
↓ 1 callersMethodhelper
(List<List<Integer>> result, List<Integer> item, int n, int start)
algorithm/factorCombination.java:9
↓ 1 callersMethodhelper
(int num)
algorithm/integerToEnglishWords.java:24
↓ 1 callersMethodinorder
(TreeNode root, double target, Stack<Integer> stack, Queue<Integer> queue)
algorithm/closestBinarySearchTreeValueII.java:26
↓ 1 callersMethodinorder
(TreeNode root, double target)
algorithm/closestBSTValue.java:13
↓ 1 callersMethodinorder
(TreeNode root)
algorithm/recoverBinarySearchTree.java:17
↓ 1 callersMethodinsert
(TreeNode root, int v, int d, int depth)
algorithm/addOneRowToTree.java:52
↓ 1 callersMethodisCyclic
(Course cur, int[] result)
algorithm/courseScheduleII.java:66
↓ 1 callersMethodisLegal
(int[] board, int row, int col)
algorithm/N-Queens.java:23
↓ 1 callersMethodisPalindrom
(String s, int begin, int end)
algorithm/palindromPartition.java:21
↓ 1 callersMethodisValid
(int x, int y, int rows, int cols)
algorithm/imageSmoother.java:23
↓ 1 callersMethodisValid
(char[][] board, int x, int y, char c)
algorithm/sudokuSolver.java:27
↓ 1 callersMethodisValid
(String s)
algorithm/removeInvalidParenthesis.java:33
↓ 1 callersMethodisValid
(Long first, Long second, int start, String num)
algorithm/additiveNumber.java:51
↓ 1 callersMethodkilledEnemiesCol
(char[][] grid, int i, int j)
algorithm/bombEnemy.java:117
↓ 1 callersMethodkilledEnemiesRow
(char[][] grid, int i, int j)
algorithm/bombEnemy.java:108
↓ 1 callersMethodknapsack
(int[] candidates, int target)
algorithm/Knapsack.java:8
↓ 1 callersMethodleftPath
(List<Integer> res, TreeNode root)
algorithm/boundaryOfBinaryTree.java:53
↓ 1 callersMethodlongest
(TreeNode root, int cur, int count)
algorithm/binaryTreeLongestConsecutiveSequence.java:47
↓ 1 callersMethodlongestPath
(TreeNode root)
algorithm/binaryTreeLongestConsecutiveSequenceII.java:41
↓ 1 callersMethodmarkIsland
(char[][] grid, int i, int j)
algorithm/numberOfIsland.java:21
↓ 1 callersMethodmerge
(ListNode l1, ListNode l2)
algorithm/sortList.java:20
↓ 1 callersMethodmergetInterval
(List<Interval> res, List<Interval> intervals, Interval pre, int position)
algorithm/insertInterval.java:41
↓ 1 callersMethodneighborLives
(int[][] board, int rows, int cols, int i, int j)
algorithm/gameOfLife.java:33
↓ 1 callersMethodnext
()
algorithm/peekingIterator.java:22
↓ 1 callersMethodnotUse
(Map<Character, Character> map, char target)
algorithm/isomorphicString.java:17
↓ 1 callersMethodparser
(String s)
algorithm/tenaryExpression.java:10
↓ 1 callersMethodpartition
(int[] subsets, int[] nums, int index, int subSum)
algorithm/partitionToKEqualSumSubsets.java:21
↓ 1 callersMethodplay
(char[][] board, int x, int y)
algorithm/mineSweeper.java:8
↓ 1 callersMethodpop
Removes the element from in front of queue and returns that element.
algorithm/implementQueueUsingStack.java:16
↓ 1 callersMethodpost
(int id)
algorithm/designTwitter.java:78
↓ 1 callersMethodpurchaseRemain
(List<Integer> needs, List<Integer> price)
algorithm/shoppingOffers.java:30
↓ 1 callersMethodputQueens
(List<List<String>> res, int[] board, int row)
algorithm/N-Queens.java:11
↓ 1 callersMethodremove
(int[] boxes, int i, int j, int k, int[][][] dp)
algorithm/removeBoxes.java:10
↓ 1 callersMethodremoveConsecutive
(String board)
algorithm/zumaGame.java:35
↓ 1 callersMethodrestoreIp
(List<String> res, String s, StringBuilder sb, int index)
algorithm/restoreIPAddress.java:13
↓ 1 callersMethodreverse
(int[] nums)
algorithm/relativeRanks.java:25
↓ 1 callersMethodreverse
(char[] s, int begin, int end)
algorithm/nextGreaterElementIII.java:42
↓ 1 callersMethodreverse
(ListNode head)
algorithm/palindromLinkedList.java:29
↓ 1 callersMethodreverse
(int[] nums)
algorithm/matchsticksToSquare.java:39
↓ 1 callersMethodrightPath
(List<Integer> res, TreeNode root)
algorithm/boundaryOfBinaryTree.java:69
↓ 1 callersMethodrightView
(List<Integer> res, TreeNode root, int curLevel)
algorithm/binaryTreeRightSideView.java:26
↓ 1 callersMethodsaveResults
(List<List<String>> res, int[] board)
algorithm/N-Queens.java:33
↓ 1 callersMethodscanRow
(char[][] picture, int row, int target, int[] colCount)
algorithm/lonelyPixelII.java:32
↓ 1 callersMethodsearch
(int[] list,int position, int target)
algorithm/2Sum.java:30
↓ 1 callersMethodsearch
(TrieNode root, String word)
algorithm/replacesWords.java:34
↓ 1 callersMethodsearchHelper
(String word, TrieNode root, int index)
algorithm/addAndSearchWord.java:75
↓ 1 callersMethodsearchPath
(TreeNode root, List<Integer> pathSum, int sum)
algorithm/pathSum.java:42
↓ 1 callersMethodserializer
(TreeNode root, StringBuilder sb)
algorithm/serializeAndDeserializeBinaryTree.java:12
↓ 1 callersMethodshopping
(List<Integer> price, List<List<Integer>> special, List<Integer> needs, int index)
algorithm/shoppingOffers.java:9
↓ 1 callersMethodsolve
(char[][] board)
algorithm/sudokuSolver.java:7
↓ 1 callersMethodsolveMaze
(int[][] maze, int startX, int startY, int destX, int destY)
algorithm/theMazeII.java:5
↓ 1 callersMethodsolveMaze
(int[][] maze, int startX, int startY, int destX, int destY, boolean[][] visited)
algorithm/theMaze.java:10
↓ 1 callersMethodstorePath
(Map<String, List<String>> hm, String pre, String cur)
algorithm/wordLadderII.java:57
↓ 1 callersMethodsuccessor
(TreeNode root, TreeNode p)
algorithm/binarySearchTreeIterator.java:35
↓ 1 callersMethodsum
(int[] nums)
algorithm/partitionToKEqualSumSubsets.java:38
↓ 1 callersMethodsum
(List<List<Integer>> res, TreeNode root, int sum, List<Integer> tempList)
algorithm/pathSumII.java:30
↓ 1 callersMethodsumPath
(TreeNode root, int val)
algorithm/sumRootToLeafNumbers.java:28
↓ 1 callersMethodswap
(int[] nums, int a, int b)
algorithm/firstMissingPositive.java:21
↓ 1 callersMethodtilt
(TreeNode root)
algorithm/binaryTreeTilt.java:34
← previousnext →101–200 of 771, ranked by callers