MCPcopy Create free account

hub / github.com/ctfu/Leetcode / functions

Functions771 in github.com/ctfu/Leetcode

↓ 270 callersMethodget
(int key)
algorithm/LRU.java:16
↓ 265 callersMethodadd
Add the number to an internal data structure..
algorithm/twoSum-Design.java:9
↓ 109 callersMethodput
(int key, int value)
algorithm/LRU.java:20
↓ 57 callersMethodpeek
()
algorithm/peekingIterator.java:16
↓ 55 callersMethodpop
()
algorithm/minStack.java:17
↓ 52 callersMethodpush
(int x)
algorithm/minStack.java:9
↓ 45 callersMethodempty
Returns whether the queue is empty.
algorithm/implementQueueUsingStack.java:37
↓ 32 callersMethodremove
(Node node)
algorithm/LFU.java:89
↓ 21 callersMethodreverse
(ListNode head)
algorithm/reorderList.java:24
↓ 8 callersMethodgetKey
(String word)
algorithm/uniqueWordAbbreviation.java:28
↓ 7 callersMethodcompareTo
(Point p)
algorithm/mazeIII.java:56
↓ 6 callersMethodgetDistance
(int[] p1, int[] p2)
algorithm/validSquare.java:30
↓ 6 callersMethodinsert
(String board, int[] count)
algorithm/zumaGame.java:14
↓ 6 callersMethodmapIndex
(int index, int n)
algorithm/wiggleSortII.java:18
↓ 4 callersMethoddfs
(int[][]matrix, boolean[][]visited, int height, int x, int y)
algorithm/pacificAtlanticWaterFlow.java:29
↓ 4 callersMethodexpandPalindrom
(String s, int i, int j)
algorithm/longestPalindromSubstring.java:12
↓ 4 callersMethodreverse
(char[] str, int i, int j)
algorithm/reverseStringII.java:24
↓ 4 callersMethodrobHouse
(TreeNode root, boolean includedParent)
algorithm/houseRobberIII.java:12
↓ 4 callersMethodsearch
(char[][] board, int x, int y)
algorithm/surroundedRegions.java:22
↓ 4 callersMethodswap
(int[] nums, int begin, int end)
algorithm/sortColor.java:25
↓ 4 callersMethodswap
(int[] nums, int i, int j)
algorithm/wiggleSortII.java:43
↓ 3 callersMethodaddSpace
(StringBuilder sb, int count)
algorithm/testJustification.java:30
↓ 3 callersMethodfindPath
(List<String> list, TreeNode root, String path)
algorithm/binaryTreePaths.java:40
↓ 3 callersMethodgetHeight
(TreeNode root)
algorithm/balancedBinaryTree.java:45
↓ 3 callersMethodinorder
(TreeNode root)
algorithm/findModeInBST.java:20
↓ 3 callersMethodlongestSubstring
(String s, int k)
algorithm/longestSubstringWithAtLeaseKRepeating.java:5
↓ 3 callersMethodremove
(Node node)
algorithm/LRU.java:82
↓ 3 callersMethodreverse
(int[] nums, int start, int end)
algorithm/rotateArray.java:58
↓ 3 callersMethodreverse
(ListNode head)
algorithm/plusOneLinkedList.java:20
↓ 3 callersMethodreverse
(char[] s, int begin, int end)
algorithm/reverseWordsInStringII.java:18
↓ 2 callersMethodadd
(Course c)
algorithm/courseScheduleII.java:88
↓ 2 callersMethodaddFront
(Node node)
algorithm/LRU.java:76
↓ 2 callersMethodbreakWord
(String s, List<String> dict, Map<String, List<String>> hm)
algorithm/wordBreakII.java:9
↓ 2 callersMethodcharToInt
(char c)
algorithm/romanToInteger.java:16
↓ 2 callersMethodcheckPalindrom
(String s, int left, int right)
algorithm/palindromSubstring.java:15
↓ 2 callersMethodcombination
(List<String> res, StringBuilder sb, List<String> digStr, int index)
algorithm/letterCombinationPhoneNumber.java:14
↓ 2 callersMethodevaluateExpression
(String exp)
algorithm/sloveTheEquation.java:13
↓ 2 callersMethodfind
(int[] roots, int id)
algorithm/numberOfConnectedComponent.java:20
↓ 2 callersMethodfind
(int[] friends, int p)
algorithm/friendsCircle.java:23
↓ 2 callersMethodfind
(int[] id, int p)
algorithm/graphValidTree.java:25
↓ 2 callersMethodfindTargetSum
(int[] nums, int S, int sum, int index)
algorithm/targetSum.java:7
↓ 2 callersMethodgenKey
()
algorithm/encodeAndDecodeTinyURL.java:25
↓ 2 callersMethodgenParenthesis
(List<String> res, int left, int right, String prefix)
algorithm/generateParenthesis.java:7
↓ 2 callersMethodgenerateDigit
(int[] num, int count)
algorithm/binaryWatch.java:23
↓ 2 callersMethodgetHeight
(TreeNode root)
algorithm/countCompleteTreeNodes.java:25
↓ 2 callersMethodgetLength
(ListNode l)
algorithm/addTwoNumbersII.java:63
↓ 2 callersMethodgetMin
(List<Integer> list)
algorithm/bestMeetingPoint.java:25
↓ 2 callersMethodhasNext
()
algorithm/peekingIterator.java:29
↓ 2 callersMethodhelper
(ListNode l1, ListNode l2, int offset)
algorithm/addTwoNumbersII.java:72
↓ 2 callersMethodinorder
(TreeNode root)
algorithm/kthSmallestElementBST.java:10
↓ 2 callersMethodinorder
(TreeNode root, List<Integer> list)
algorithm/minimumAbsoluteDifferenceInBST.java:15
↓ 2 callersMethodisPalindrom
(String word)
algorithm/palindromPair.java:41
↓ 2 callersMethodmerge2Lists
(ListNode first, ListNode second)
algorithm/mergeKLists.java:16
↓ 2 callersMethodorientation
(Point p, Point q, Point r)
algorithm/erectTheFence.java:20
↓ 2 callersMethodpathSum
(TreeNode root, int sum)
algorithm/pathSumII.java:25
↓ 2 callersMethodpush
Push element x to the back of queue.
algorithm/implementQueueUsingStack.java:11
↓ 2 callersMethodput
(int key, int value)
algorithm/LFU.java:21
↓ 2 callersMethodreverse
(int[] nums, int begin, int end)
algorithm/nextPermutation.java:32
↓ 2 callersMethodstartsWith
Returns if there is any word in the trie that starts with the given prefix.
algorithm/implementTrie(prefix)Tree.java:38
↓ 2 callersMethodsum
(TreeNode root)
algorithm/binaryTreeTilt.java:43
↓ 2 callersMethodswap
(int[] nums, int first, int second)
algorithm/wiggleSort.java:10
↓ 2 callersMethodupdate
(Node node)
algorithm/LRU.java:71
↓ 2 callersMethodupdate
(int key)
algorithm/LFU.java:36
↓ 1 callersMethodaddFront
(int key)
algorithm/LFU.java:74
↓ 1 callersMethodaddOperator
(List<String> res, String num, int target, String path, long eval, long forMul, int index)
algorithm/expressionAddOperator.java:10
↓ 1 callersMethodbuildForest
(TreeNode root, Set<Integer> set, List<TreeNode> list, boolean shouldAdd)
algorithm/deleteNodeAndReturnForest.java:26
↓ 1 callersMethodbuildTree
(ListNode head, ListNode tail)
algorithm/convertSortedListToBST.java:6
↓ 1 callersMethodbuildTree
(int[] nums)
algorithm/rangeSumQuery-mutable.java:48
↓ 1 callersMethodbuildTrie
(String[]words)
algorithm/wordSearchII.java:34
↓ 1 callersMethodbuildTrie
(List<String> dict)
algorithm/replacesWords.java:51
↓ 1 callersMethodbuildWord
(Set<String> dict, String word)
algorithm/longestWordInDictionary.java:22
↓ 1 callersMethodcalculate
(TreeNode root)
algorithm/longestUnivaluePath.java:18
↓ 1 callersMethodcanBreak
(String s, Set<String> dict)
algorithm/concatenatedWords.java:23
↓ 1 callersMethodcanWin
(int[] state, int total, Map<String, Boolean> hmap)
algorithm/canIWin.java:21
↓ 1 callersMethodcheckIPv4
(String[] ip4)
algorithm/validIPAddress.java:33
↓ 1 callersMethodcheckIPv6
(String[] ip6)
algorithm/validIPAddress.java:42
↓ 1 callersMethodcheckPair
(char a, char b)
algorithm/strobogrammaticNumber.java:45
↓ 1 callersMethodcheckSubtree
(TreeNode s, TreeNode t)
algorithm/subtreeOfAnotherTree.java:49
↓ 1 callersMethodcollect
(TreeNode root, List<Integer> tempList)
algorithm/findLeavesOfBinaryTree.java:20
↓ 1 callersMethodcollectByHeight
(List<List<Integer>> res, TreeNode root)
algorithm/findLeavesOfBinaryTree.java:56
↓ 1 callersMethodcollectDuplicate
(List<TreeNode> res, TreeNode root, Map<String, Integer> hm)
algorithm/findDuplicateSubtrees.java:9
↓ 1 callersMethodcombination
(List<List<Integer>> res, int[] candidates, int target, List<Integer> tempList
algorithm/combinationSumII.java:8
↓ 1 callersMethodcombination
(List<List<Integer>> res, int[] candidates, int target, List<Integer> tempList, int index)
algorithm/combinationSum.java:10
↓ 1 callersMethodcombo
(List<List<Integer>> res, int n, int k, int start, List<Integer> tempL
algorithm/combinationSumIII.java:8
↓ 1 callersMethodconstructTree
(int[] nums, int begin, int end)
algorithm/convertSortedArrayToBST.java:8
↓ 1 callersMethodconvertTree
(TreeNode root)
algorithm/convertBSTToGreaterTree.java:9
↓ 1 callersMethodcountAndSayHelper
(int n, String init)
algorithm/countAndSay.java:6
↓ 1 callersMethodcreatePalindrom
(int n)
algorithm/largestPalindromProduct.java:35
↓ 1 callersMethoddeserializer
(Queue<String> queue)
algorithm/serializeAndDeserializeBinaryTree.java:28
↓ 1 callersMethoddfs
(TreeNode root, int val)
algorithm/sumOfRootToLeafBinaryNumber.java:20
↓ 1 callersMethoddfs
(UndirectedGraphNode node, Map<Integer, UndirectedGraphNode> hm)
algorithm/cloneGraph.java:15
↓ 1 callersMethoddfs
(int[][] matrix, int i, int j, int m, int n, int[][] cache)
algorithm/longestIncreasingPathInMatrix.java:18
↓ 1 callersMethoddivideEqualSet
(int[] nums, int[] equalSet, int target, int index)
algorithm/matchsticksToSquare.java:21
↓ 1 callersMethodevitOld
()
algorithm/LFU.java:61
↓ 1 callersMethodfind
(int[] id, int p)
algorithm/numberOfIslandsII.java:38
↓ 1 callersMethodfind
(int[] root, int p)
algorithm/redundantCollectionII.java:39
↓ 1 callersMethodfind
(TreeNode root, int k, Map<Integer, Integer> map)
algorithm/2SumIV.java:43
↓ 1 callersMethodfindCircle
(int[][] friends, boolean[] visited, int i)
algorithm/friendsCircle.java:46
↓ 1 callersMethodfindDiameter
(TreeNode root)
algorithm/diameterOfBinaryTree.java:9
↓ 1 callersMethodfindKth
(int[] nums, int k, int start, int end)
algorithm/wiggleSortII.java:24
next →1–100 of 771, ranked by callers