Functions — github.com/MaskRay/LeetCode

CodeHub MCPcopy Create free account

hub / github.com/MaskRay/LeetCode / functions

Functions1,379 in github.com/MaskRay/LeetCode

⨍ Functions 1,379◇ Types & classes 851

↓ 467 callersFunctionREP

create-maximum-number.cc:132

↓ 244 callersFunctionf

maximum-difference-between-node-and-ancestor.cc:4

↓ 175 callersMethodpush

↓ 126 callersMethodtop

min-stack.cc:15

↓ 107 callersFunctionFOR

number-of-ways-to-rearrange-sticks-with-k-sticks-visible.cc:68

↓ 106 callersMethodempty

Return whether the stack is empty.

implement-stack-using-queues.cc:26

↓ 106 callersMethodpop

min-stack.cc:10

↓ 68 callersMethodinsert

insert-interval.cc:4

↓ 66 callersMethoderase

finding-mk-average.cc:265

↓ 39 callersMethodrev

palindrome-linked-list.cc:3

↓ 32 callersMethodfind

number-of-islands-ii.cc:3

↓ 13 callersFunctionmconcat

finding-mk-average.cc:218

↓ 10 callersFunctionjoin

finding-mk-average.cc:121

↓ 8 callersMethodpeek

Returns the next element in the iteration without advancing the iterator.

peeking-iterator.cc:31

↓ 7 callersFunctioninsert

contest/2021-spring/守卫城堡.cc:10

↓ 7 callersMethodmconcat

finding-mk-average.cc:111

↓ 6 callersFunctionREP

number-of-ways-to-rearrange-sticks-with-k-sticks-visible.cc:56

↓ 6 callersMethodget

lru-cache.cc:13

↓ 6 callersFunctioninsert

minimum-total-distance-traveled.cc:11

↓ 5 callersFunctiongcd

rotate-array.cc:18

↓ 4 callersFunctionREP

longest-common-subpath.cc:26

↓ 4 callersFunctionbucket

create-maximum-number.cc:12

↓ 4 callersFunctionerase

finding-mk-average.cc:161

↓ 4 callersMethodreverse

reverse-integer.cc:4

↓ 4 callersFunctionsize

finding-mk-average.cc:119

↓ 4 callersFunctionsplit_by_rank

finding-mk-average.cc:132

↓ 4 callersMethodsqrt

↓ 3 callersFunctionaugment

contest/2021-spring/守卫城堡.cc:15

↓ 3 callersFunctionminus_to_plus

create-maximum-number.cc:39

↓ 3 callersFunctionplus_to_minus

create-maximum-number.cc:27

↓ 3 callersMethodsum

finding-mk-average.cc:70

↓ 2 callersMethodadd

count-of-range-sum.cc:5

↓ 2 callersMethodcmp

(&self, o: &Self)

minimum-cost-to-hire-k-workers.rs:6

↓ 2 callersMethodempty

Return whether the queue is empty.

implement-queue-using-stacks.cc:31

↓ 2 callersFunctionfft_interleave

number-of-ways-to-rearrange-sticks-with-k-sticks-visible.cc:44

↓ 2 callersMethodpow

↓ 2 callersMethodremove

Removes a value from the set. Returns true if the set contained the specified element. */

insert-delete-getrandom-o1.cc:18

↓ 2 callersFunctionsplit_by_key

finding-mk-average.cc:147

↓ 2 callersFunctionxor32

finding-mk-average.cc:100

↓ 1 callersMethodappend

sudoku-solver.cc:24

↓ 1 callersFunctionaugment

minimum-total-distance-traveled.cc:49

↓ 1 callersMethoddfs

(self: &mut Self, s: &str)

word-break-ii.rs:5

↓ 1 callersMethoddfs

(&mut self, i: usize)

palindrome-partitioning.rs:6

↓ 1 callersMethodeq

erect-the-fence.cc:9

↓ 1 callersFunctionfft_dif2

number-of-ways-to-rearrange-sticks-with-k-sticks-visible.cc:16

↓ 1 callersFunctionfft_prepare

number-of-ways-to-rearrange-sticks-with-k-sticks-visible.cc:10

↓ 1 callersFunctionheap_down

minimum-weighted-subgraph-with-the-required-paths.cc:13

↓ 1 callersFunctionheap_up

minimum-weighted-subgraph-with-the-required-paths.cc:6

↓ 1 callersFunctionifft_dit2

number-of-ways-to-rearrange-sticks-with-k-sticks-visible.cc:29

↓ 1 callersFunctionifft_interleave

number-of-ways-to-rearrange-sticks-with-k-sticks-visible.cc:53

↓ 1 callersFunctionka

create-maximum-number.cc:50

↓ 1 callersFunctionlabelCorrecting

minimum-total-distance-traveled.cc:106

↓ 1 callersFunctionmain

create-maximum-number.cc:145

↓ 1 callersFunctionminCost

minimum-total-distance-traveled.cc:129

↓ 1 callersMethodnext

happy-number.cc:17

↓ 1 callersMethodpop

Removes the element on top of the stack.

implement-stack-using-queues.cc:16

↓ 1 callersMethodpop

Removes the element from in front of queue.

implement-queue-using-stacks.cc:19

↓ 1 callersMethodpush

Push element x to the back of queue.

implement-queue-using-stacks.cc:14

↓ 1 callersFunctionrelabel

minimum-total-distance-traveled.cc:18

↓ 1 callersFunctionrising_factorial

number-of-ways-to-rearrange-sticks-with-k-sticks-visible.cc:64

↓ 1 callersFunctionsuffix_array

longest-common-subpath.cc:8

Initialize your data structure here. */

all-oone-data-structure.cc:8

MethodBSTIterator

binary-search-tree-iterator.cc:6

simple-bank-system.cc:5

design-excel-sum-formula.cc:29

number-of-subarrays-with-lcm-equal-to-k.cc:11

count-vowel-substrings-of-a-string.cc:11

k-divisible-elements-subarrays.cc:17

text-justification.cc:14

sum-of-k-mirror-numbers.cc:9

burst-balloons.cc:16

max-sum-of-sub-matrix-no-larger-than-k.cc:19

MethodFindElements

find-elements-in-a-contaminated-binary-tree.cc:12

MethodHitCounter

Initialize your data structure here. */

design-hit-counter.cc:6

Initialize your data structure here. */

logger-rate-limiter.cc:6

MethodMKAverage

finding-mk-average.cc:9

MethodMovingAverage

Initialize your data structure here. */

moving-average-from-data-stream.cc:8

MethodNestedIterator

flatten-nested-list-iterator.cc:22

range-sum-query-immutable.cc:7

range-sum-query-mutable.cc:5

MethodNumMatrix

range-sum-query-2d-immutable.cc:7

MethodNumMatrix

range-sum-query-2d-mutable.cc:21

MethodPeekingIterator

peeking-iterator.cc:23

MethodPhoneDirectory

Initialize your data structure here @param maxNumbers - The maximum numbers that can be stored in the phone directory. */

design-phone-directory.cc:9

count-good-triplets-in-an-array.cc:27

total-appeal-of-a-string.cc:9

delete-operation-for-two-strings.cc:11

groups-of-strings.cc:27

buddy-strings.cc:10

largest-color-value-in-a-directed-graph.cc:19

delete-columns-to-make-sorted-iii.cc:11

bomb-enemy.cc:10

minimum-absolute-sum-difference.cc:14

longest-substring-of-all-vowels-in-order.cc:49

number-of-subarrays-with-lcm-equal-to-k.cc:9

longest-subsequence-repeated-k-times.cc:19

image-overlap.cc:13

next →1–100 of 1,379, ranked by callers