Functions — github.com/corpsepiges/leetcode

hub / github.com/corpsepiges/leetcode / functions

Functions1,433 in github.com/corpsepiges/leetcode

⨍ Functions 1,433◇ Types & classes 940

MethodcanJump

:type nums: List[int] :rtype: bool

python/055. Jump Game.py:4

MethodcanJump

:type nums: List[int] :rtype: bool

Algorithms/055. Jump Game/Solution.py:4

MethodcanJump

(int[] nums)

Algorithms/055. Jump Game/Solution.java:2

MethodcanJump

(int[] nums)

java/055. Jump Game.java:2

MethodcanMeasureWater

(int x, int y, int z)

Algorithms/365. Water and Jug Problem/Solution.java:2

MethodcanMeasureWater

(int x, int y, int z)

java/365. Water and Jug Problem.java:2

MethodcanPartition

(int[] nums)

Algorithms/416. Partition Equal Subset Sum/Solution.java:5

MethodcanPartition

(int[] nums)

java/416. Partition Equal Subset Sum.java:5

MethodcanWinNim

:type n: int :rtype: bool

python/292. Nim Game.py:4

MethodcanWinNim

:type n: int :rtype: bool

Algorithms/292. Nim Game/Solution.py:4

MethodcanWinNim

(int n)

Algorithms/292. Nim Game/Solution.java:2

MethodcanWinNim

(int n)

java/292. Nim Game.java:2

Methodcandy

(int[] ratings)

Algorithms/135. Candy/Solution.java:2

Methodcandy

(int[] ratings)

java/135. Candy.java:2

MethodclimbStairs

:type n: int :rtype: int

python/070. Climbing Stairs.py:4

MethodclimbStairs

:type n: int :rtype: int

Algorithms/070. Climbing Stairs/Solution.py:4

MethodclimbStairs

(int n)

Algorithms/070. Climbing Stairs/Solution.java:2

MethodclimbStairs

(int n)

java/070. Climbing Stairs.java:2

MethodcloneGraph

:type node: UndirectedGraphNode :rtype: UndirectedGraphNode

python/143. Reorder List.py:12

MethodcloneGraph

:type node: UndirectedGraphNode :rtype: UndirectedGraphNode

python/133. Clone Graph.py:11

MethodcloneGraph

:type node: UndirectedGraphNode :rtype: UndirectedGraphNode

Algorithms/143. Reorder List/Solution.py:12

MethodcloneGraph

:type node: UndirectedGraphNode :rtype: UndirectedGraphNode

Algorithms/133. Clone Graph/Solution.py:11

MethodcloneGraph

(UndirectedGraphNode node)

Algorithms/133. Clone Graph/Solution.java:10

MethodcloneGraph

(UndirectedGraphNode node)

java/133. Clone Graph.java:10

MethodcoinChange

(int[] coins, int amount)

Algorithms/322. Coin Change/Solution.java:5

MethodcoinChange

(int[] coins, int amount)

java/322. Coin Change.java:5

MethodcombinationSum

:type candidates: List[int] :type target: int :rtype: List[List[int]]

python/039. Combination Sum.py:4

MethodcombinationSum

:type candidates: List[int] :type target: int :rtype: List[List[int]]

Algorithms/039. Combination Sum/Solution.py:4

MethodcombinationSum

(int[] candidates, int target)

Algorithms/039. Combination Sum/Solution.java:2

MethodcombinationSum

(int[] candidates, int target)

java/039. Combination Sum.java:2

MethodcombinationSum2

(int[] candidates, int target)

Algorithms/040. Combination Sum II/Solution.java:2

MethodcombinationSum2

(int[] candidates, int target)

java/040. Combination Sum II.java:2

MethodcombinationSum3

:type k: int :type n: int :rtype: List[List[int]]

python/216. Combination Sum III.py:4

MethodcombinationSum3

:type k: int :type n: int :rtype: List[List[int]]

Algorithms/216. Combination Sum III/Solution.py:4

MethodcombinationSum3

(int k, int n)

Algorithms/216. Combination Sum III/Solution.java:2

MethodcombinationSum3

(int k, int n)

java/216. Combination Sum III.java:2

MethodcombinationSum4

(int[] nums, int target)

Algorithms/377. Combination Sum IV/Solution.java:2

MethodcombinationSum4

(int[] nums, int target)

java/377. Combination Sum IV.java:2

Methodcombine

:type n: int :type k: int :rtype: List[List[int]]

python/077. Combinations.py:4

Methodcombine

:type n: int :type k: int :rtype: List[List[int]]

Algorithms/077. Combinations/Solution.py:4

Methodcombine

(int n, int k)

Algorithms/077. Combinations/Solution.java:2

Methodcombine

(int n, int k)

java/077. Combinations.java:2

Functioncompare

(a,b)

Algorithms/015. 3Sum/Solution.js:35

(int[] arg0,int[] arg1)

Algorithms/373. Find K Pairs with Smallest Sums/Solution.java:9

Methodcompare

(int[] e1, int[] e2)

Algorithms/354. Russian Doll Envelopes/Solution.java:5

Methodcompare

(int[] arr1, int[] arr2)

Algorithms/354. Russian Doll Envelopes/GodSolution.java:11

Methodcompare

(Integer a0, Integer a1)

Algorithms/378. Kth Smallest Element in a Sorted Matrix/Solution.java:4

Methodcompare

(int[] arr1, int[] arr2)

Algorithms/406. Queue Reconstruction by Height/Solution.java:5

Methodcompare

(Integer a0, Integer a1)

java/378. Kth Smallest Element in a Sorted Matrix.java:4

Methodcompare

(int[] e1, int[] e2)

java/354. Russian Doll Envelopes.java:5

Methodcompare

(int[] arg0,int[] arg1)

java/373. Find K Pairs with Smallest Sums.java:9

Methodcompare

(int[] arr1, int[] arr2)

java/406. Queue Reconstruction by Height.java:5

MethodcompareVersion

:type version1: str :type version2: str :rtype: int

python/165. Compare Version Numbers.py:4

MethodcompareVersion

:type version1: str :type version2: str :rtype: int

Algorithms/165. Compare Version Numbers/Solution.py:4

MethodcompareVersion

(String version1, String version2)

Algorithms/165. Compare Version Numbers/Solution.java:2

MethodcompareVersion

(String version1, String version2)

java/165. Compare Version Numbers.java:2

MethodcomputeArea

:type A: int :type B: int :type C: int :type D: int :type E: int :type F: int :type G: int

python/223. Rectangle Area.py:4

MethodcomputeArea

:type A: int :type B: int :type C: int :type D: int :type E: int :type F: int :type G: int

Algorithms/223. Rectangle Area/Solution.py:4

MethodcomputeArea

(int A, int B, int C, int D, int E, int F, int G, int H)

Algorithms/223. Rectangle Area/Solution.java:2

MethodcomputeArea

(int A, int B, int C, int D, int E, int F, int G, int H)

java/223. Rectangle Area.java:2

Methodconnect

:type root: TreeLinkNode :rtype: nothing

python/117. Populating Next Right Pointers in Each Node II.py:12

Methodconnect

:type root: TreeLinkNode :rtype: nothing

python/116. Populating Next Right Pointers in Each Node.py:12

Methodconnect

:type root: TreeLinkNode :rtype: nothing

Algorithms/116. Populating Next Right Pointers in Each Node/Solution.py:12

Methodconnect

(TreeLinkNode root)

Algorithms/116. Populating Next Right Pointers in Each Node/Solution.java:10

Methodconnect

:type root: TreeLinkNode :rtype: nothing

Algorithms/117. Populating Next Right Pointers in Each Node II/Solution.py:12

Methodconnect

(TreeLinkNode root)

Algorithms/117. Populating Next Right Pointers in Each Node II/Solution.java:10

Methodconnect

(TreeLinkNode root)

java/116. Populating Next Right Pointers in Each Node.java:10

Methodconnect

(TreeLinkNode root)

java/117. Populating Next Right Pointers in Each Node II.java:10

MethodcontainsDuplicate

:type nums: List[int] :rtype: bool

python/217. Contains Duplicate.py:4

MethodcontainsDuplicate

:type nums: List[int] :rtype: bool

Algorithms/217. Contains Duplicate/Solution.py:4

MethodcontainsDuplicate

(int[] nums)

Algorithms/217. Contains Duplicate/Solution.java:2

MethodcontainsDuplicate

(int[] nums)

java/217. Contains Duplicate.java:2

MethodcontainsNearbyDuplicate

:type nums: List[int] :type k: int :rtype: bool

python/219. Contains Duplicate II.py:4

MethodcontainsNearbyDuplicate

:type nums: List[int] :type k: int :rtype: bool

Algorithms/219. Contains Duplicate II/Solution.py:4

MethodcontainsNearbyDuplicate

(int[] nums, int k)

Algorithms/219. Contains Duplicate II/Solution.java:2

MethodcontainsNearbyDuplicate

(int[] nums, int k)

java/219. Contains Duplicate II.java:2

Methodconvert

(String s, int numRows)

Algorithms/006. ZigZag Conversion/Solution.java:2

Methodconvert

(String s, int numRows)

java/006. ZigZag Conversion.java:2

MethodconvertToTitle

:type n: int :rtype: str

python/168. Excel Sheet Column Title.py:4

MethodconvertToTitle

:type n: int :rtype: str

Algorithms/168. Excel Sheet Column Title/Solution.py:4

MethodconvertToTitle

(int n)

Algorithms/168. Excel Sheet Column Title/Solution.java:2

MethodconvertToTitle

(int n)

java/168. Excel Sheet Column Title.java:2

MethodcopyRandomList

:type head: RandomListNode :rtype: RandomListNode

python/138. Copy List with Random Pointer.py:11

MethodcopyRandomList

:type head: RandomListNode :rtype: RandomListNode

Algorithms/138. Copy List with Random Pointer/Solution.py:11

MethodcopyRandomList

(RandomListNode head)

Algorithms/138. Copy List with Random Pointer/Solution.java:10

MethodcopyRandomList

(RandomListNode head)

java/138. Copy List with Random Pointer.java:10

MethodcountAndSay

(int n)

Algorithms/038. Count and Say/Solution.java:2

MethodcountAndSay

(int n)

java/038. Count and Say.java:2

MethodcountBits

:type num: int :rtype: List[int]

python/338. Counting Bits.py:6

MethodcountBits

:type num: int :rtype: List[int]

Algorithms/338. Counting Bits/Solution.py:6

MethodcountBits

(int num)

Algorithms/338. Counting Bits/Solution.java:7

MethodcountBits

(int num)

java/338. Counting Bits.java:7

MethodcountNodes

:type root: TreeNode :rtype: int

python/222. Count Complete Tree Nodes.py:11

MethodcountNodes

:type root: TreeNode :rtype: int

Algorithms/222. Count Complete Tree Nodes/Solution.py:11

MethodcountNodes

(TreeNode root)

Algorithms/222. Count Complete Tree Nodes/Solution.java:11

MethodcountNodes

(TreeNode root)

java/222. Count Complete Tree Nodes.java:11

MethodcountNumbersWithUniqueDigits

(int n)

Algorithms/357. Count Numbers with Unique Digits/Solution.java:4

MethodcountNumbersWithUniqueDigits

(int n)

java/357. Count Numbers with Unique Digits.java:4

MethodcountPrimes

(int n)

Algorithms/204. Count Primes/Solution.java:2

← previous next →501–600 of 1,433, ranked by callers