MCPcopy Create free account

hub / github.com/corpsepiges/leetcode / functions

Functions1,433 in github.com/corpsepiges/leetcode

⨍ Functions 1,433◇ Types & classes 940
↓ 1 callersMethodbulidTree
(int start,int end,int[] nums)
Algorithms/307. Range Sum Query - Mutable/Solution.java:15
↓ 1 callersMethodbulidTree
(int start,int end,int[] nums)
java/307. Range Sum Query - Mutable.java:15
↓ 1 callersFunctioncalTreeNum
@param {TreeNode} root @return {Integer}
Algorithms/230. Kth Smallest Element in a BST/Solution.rb:23
↓ 1 callersFunctioncalTreeNum
@param {TreeNode} root @return {Integer}
ruby/230. Kth Smallest Element in a BST.rb:23
↓ 1 callersMethodcanHalf
(int index,int test)
Algorithms/416. Partition Equal Subset Sum/Solution.java:19
↓ 1 callersMethodcanHalf
(int index,int test)
java/416. Partition Equal Subset Sum.java:19
↓ 1 callersMethodcompaer
(self,n1,n2)
python/179. Largest Number.py:15
↓ 1 callersMethodcompaer
(self,n1,n2)
Algorithms/179. Largest Number/Solution.py:15
↓ 1 callersMethodcompare
(int a, int b)
Algorithms/179. Largest Number/Solution.java:26
↓ 1 callersMethodcompare
(ListNode headA,int a, ListNode headB,int b)
Algorithms/160. Intersection of Two Linked Lists/Solution.java:18
↓ 1 callersMethodcompare
(int a, int b)
java/179. Largest Number.java:26
↓ 1 callersMethodcompare
(ListNode headA,int a, ListNode headB,int b)
java/160. Intersection of Two Linked Lists.java:18
↓ 1 callersMethodconvert
:type s: str :type numRows: int :rtype: str
python/006. ZigZag Conversion.py:4
↓ 1 callersMethodconvert
:type s: str :type numRows: int :rtype: str
Algorithms/006. ZigZag Conversion/Solution.py:4
↓ 1 callersMethodcreate
(self,nums,possibility)
python/046. Permutations.py:10
↓ 1 callersMethodcreate
(self,nums,possibility)
Algorithms/046. Permutations/Solution.py:10
↓ 1 callersMethodcreateAnswer
(self,candidates, target,state)
python/039. Combination Sum.py:11
↓ 1 callersMethodcreateAnswer
(self,n,string,left,right)
python/022. Generate Parentheses.py:11
↓ 1 callersMethodcreateAnswer
(self,candidates, target,state)
Algorithms/039. Combination Sum/Solution.py:11
↓ 1 callersMethodcreateAnswer
(self,n,string,left,right)
Algorithms/022. Generate Parentheses/Solution.py:11
↓ 1 callersMethodexist
(char[][] board, String word)
Algorithms/212. Word Search II/Solution.java:63
↓ 1 callersMethodexist
(char[][] board, String word)
java/212. Word Search II.java:63
↓ 1 callersMethodexplore
(self,x,y)
python/200. Number of Islands.py:28
↓ 1 callersMethodexplore
(self,x,y)
Algorithms/200. Number of Islands/Solution.py:28
↓ 1 callersMethodf
(self,nums)
python/198. House Robber.py:14
↓ 1 callersMethodf
(self,s,state,num)
python/093. Restore IP Addresses.py:10
↓ 1 callersMethodf
(self,m,n)
python/289. Game of Life.py:29
↓ 1 callersMethodf
(self,root,state)
python/257. Binary Tree Paths.py:17
↓ 1 callersMethodf
:type nums: List[int] :type state: List[int] :rtype: List[int]
python/090. Subsets II.py:20
↓ 1 callersMethodf
(self,num=8,state=(),)
python/052. N-Queens II.py:10
↓ 1 callersMethodf
(self,num,state)
python/051. N-Queens.py:16
↓ 1 callersMethodf
(self,n,k,state)
python/216. Combination Sum III.py:11
↓ 1 callersMethodf
(self, inorder, postorder, ib,ie,pb,pe)
python/106. Construct Binary Tree from Inorder and Postorder Traversal.py:18
↓ 1 callersMethodf
(self,node)
python/143. Reorder List.py:24
↓ 1 callersMethodf
(self,root,state,sum)
python/113. Path Sum II.py:19
↓ 1 callersMethodf
(self,n)
python/343. Integer Break.py:11
↓ 1 callersMethodf
(self,x,y)
python/329. Longest Increasing Path in a Matrix.py:28
↓ 1 callersMethodf
(self,left,right)
python/101. Symmetric Tree.py:17
↓ 1 callersMethodf
(self,nums,state)
python/047. Permutations II.py:10
↓ 1 callersMethodf
(self,x,y)
python/120. Triangle.py:15
↓ 1 callersMethodf
(self, inorder, preorder, ib,ie,pb,pe)
python/105. Construct Binary Tree from Preorder and Inorder Traversal.py:18
↓ 1 callersMethodf
(self,root,s)
python/129. Sum Root to Leaf Numbers.py:23
↓ 1 callersMethodf
(self,nums,k,state)
python/077. Combinations.py:13
↓ 1 callersMethodf
:type root: TreeNode :rtype: List[int]
python/230. Kth Smallest Element in a BST.py:18
↓ 1 callersMethodf
(self,string,state)
python/017. Letter Combinations of a Phone Number.py:19
↓ 1 callersMethodf
:type nums: List[int] :type state: List[int] :rtype: List[int]
python/078. Subsets.py:11
↓ 1 callersMethodf
(self,before,now)
python/206. Reverse Linked List.py:17
↓ 1 callersMethodf
(self,node)
python/133. Clone Graph.py:26
↓ 1 callersMethodf
(self,s,state,num)
Algorithms/093. Restore IP Addresses/Solution.py:10
↓ 1 callersMethodf
:type nums: List[int] :type state: List[int] :rtype: List[int]
Algorithms/090. Subsets II/Solution.py:20
↓ 1 callersMethodf
(int amount)
Algorithms/322. Coin Change/Solution.java:11
↓ 1 callersMethodf
(self,root,s)
Algorithms/129. Sum Root to Leaf Numbers/Solution.py:23
↓ 1 callersMethodf
(int i,int j)
Algorithms/318. Maximum Product of Word Lengths/Solution.java:52
↓ 1 callersMethodf
(int[] nums, int target,int s,int m,int n,int e)
Algorithms/018. 4Sum/Solution.java:18
↓ 1 callersMethodf
(self,n)
Algorithms/343. Integer Break/Solution.py:11
↓ 1 callersMethodf
(int n)
Algorithms/343. Integer Break/Solution.java:16
↓ 1 callersMethodf
(int[] nums,int target,int s,int e)
Algorithms/015. 3Sum/Solution.java:16
↓ 1 callersMethodf
(int n)
Algorithms/397. Integer Replacement/Solution.java:8
↓ 1 callersMethodf
(self, inorder, preorder, ib,ie,pb,pe)
Algorithms/105. Construct Binary Tree from Preorder and Inorder Traversal/Solution.py:18
↓ 1 callersMethodf
(String s, Set<String> wordDict,Map<String, Boolean> map)
Algorithms/139. Word Break/Solution.java:5
↓ 1 callersMethodf
(ListNode head,ListNode end)
Algorithms/109. Convert Sorted List to Binary Search Tree/Solution.java:22
↓ 1 callersMethodf
(int[] candidates, int target,HashMap<Integer, List<List<Integer>>> map)
Algorithms/039. Combination Sum/Solution.java:6
↓ 1 callersMethodf
(int n,boolean flag)
Algorithms/390. Elimination Game/Solution.java:6
↓ 1 callersMethodf
(self,string,state)
Algorithms/017. Letter Combinations of a Phone Number/Solution.py:19
↓ 1 callersMethodf
()
Algorithms/316. Remove Duplicate Letters/Solution.java:29
↓ 1 callersMethodf
(int n)
Algorithms/300. Longest Increasing Subsequence/Solution.java:11
↓ 1 callersMethodf
(self,before,now)
Algorithms/206. Reverse Linked List/Solution.py:17
↓ 1 callersMethodf
(TreeNode root)
Algorithms/114. Flatten Binary Tree to Linked List/Solution.java:22
↓ 1 callersMethodf
(String s1, String s2, String s3,Map<String,Boolean> map)
Algorithms/097. Interleaving String/Solution.java:5
↓ 1 callersMethodf
(int s,int e,Map<String,List<TreeNode>> map)
Algorithms/095. Unique Binary Search Trees II/Solution.java:14
↓ 1 callersMethodf
(int startIndex,int step)
Algorithms/403. Frog Jump/Solution.java:14
↓ 1 callersMethodf
(self,node)
Algorithms/143. Reorder List/Solution.py:24
↓ 1 callersMethodf
(self,num=8,state=(),)
Algorithms/052. N-Queens II/Solution.py:10
↓ 1 callersMethodf
(int[] nums,int x,int val)
Algorithms/052. N-Queens II/Solution.java:61
↓ 1 callersMethodf
(int[][] obstacleGrid,int x,int y,int xl,int yl,Map<String,Integer> map)
Algorithms/063. Unique Paths II/Solution.java:9
↓ 1 callersMethodf
(ListNode node)
Algorithms/234. Palindrome Linked List/Solution.java:32
↓ 1 callersMethodf
(self,nums,k,state)
Algorithms/077. Combinations/Solution.py:13
↓ 1 callersMethodf
(self,root,state,sum)
Algorithms/113. Path Sum II/Solution.py:19
↓ 1 callersMethodf
(char[][] board,char[] ch,int level,int x,int y,int length,int m,int n,boolean[][] flag)
Algorithms/079. Word Search/Solution.java:20
↓ 1 callersMethodf
(self,x,y)
Algorithms/120. Triangle/Solution.py:15
↓ 1 callersMethodf
(ListNode head,List<ListNode> list)
Algorithms/092. Reverse Linked List II/Solution.java:23
↓ 1 callersMethodf
(self,left,right)
Algorithms/101. Symmetric Tree/Solution.py:17
↓ 1 callersMethodf
(self, inorder, postorder, ib,ie,pb,pe)
Algorithms/106. Construct Binary Tree from Inorder and Postorder Traversal/Solution.py:18
↓ 1 callersMethodf
:type nums: List[int] :type state: List[int] :rtype: List[int]
Algorithms/078. Subsets/Solution.py:11
↓ 1 callersMethodf
(int[] nums,int s,int m,int e,int target)
Algorithms/016. 3Sum Closest/Solution.java:16
↓ 1 callersMethodf
(String str,Map<String, String> map)
Algorithms/273. Integer to English Words/Solution.java:85
↓ 1 callersMethodf
(self,root,state)
Algorithms/257. Binary Tree Paths/Solution.py:17
↓ 1 callersMethodf
(self,m,n)
Algorithms/289. Game of Life/Solution.py:29
↓ 1 callersMethodf
(int[][] board,int x,int y)
Algorithms/289. Game of Life/Solution.java:21
↓ 1 callersMethodf
(self,nums,state)
Algorithms/047. Permutations II/Solution.py:10
↓ 1 callersMethodf
(List<Integer> list)
Algorithms/047. Permutations II/Solution.java:11
↓ 1 callersMethodf
(int[] nums,int s,int e)
Algorithms/287. Find the Duplicate Number/Solution.java:5
↓ 1 callersMethodf
(self,x,y)
Algorithms/329. Longest Increasing Path in a Matrix/Solution.py:28
↓ 1 callersMethodf
(int x,int y,int d)
Algorithms/329. Longest Increasing Path in a Matrix/Solution.java:29
↓ 1 callersMethodf
(int[][] grid,int x,int y,int xl,int yl,Map<String, Integer> map)
Algorithms/064. Minimum Path Sum/Solution.java:8
↓ 1 callersMethodf
(String first,String second,String third)
Algorithms/306. Additive Number/Solution.java:22
↓ 1 callersMethodf
(int[] candidates, int target,int l)
Algorithms/040. Combination Sum II/Solution.java:6
↓ 1 callersMethodf
(self,n,k,state)
Algorithms/216. Combination Sum III/Solution.py:11
↓ 1 callersMethodf
(String s,Map<String,Integer> map)
Algorithms/091. Decode Ways/Solution.java:9
↓ 1 callersMethodf
(self,nums)
Algorithms/198. House Robber/Solution.py:14
← previousnext →101–200 of 1,433, ranked by callers