Functions — github.com/das-jishu/data-structures-basics-leetcode

hub / github.com/das-jishu/data-structures-basics-leetcode / functions

Functions583 in github.com/das-jishu/data-structures-basics-leetcode

⨍ Functions 583◇ Types & classes 246

↓ 1 callersMethoddeleteMin

(self)

Trees/implementing-binary-heap.py:14

↓ 1 callersMethoddequeue

(self)

Stacks and Queues/queue-using-2-stacks.py:10

↓ 1 callersMethoddfs

(self, graph, current, parent, count, distance)

Leetcode/hard/sum-of-distances-in-tree.py:40

↓ 1 callersMethoddfs

(self, graph, node, currentPath, paths)

Leetcode/medium/all-paths-from-source-to-target.py:50

↓ 1 callersMethoddfs

(self, rooms, current, visited)

Leetcode/medium/keys-and-rooms.py:43

↓ 1 callersMethoddfs

(self, current, neighbors, itinerary, n, remainingPlaces)

Leetcode/medium/reconstruct-itinerary.py:52

↓ 1 callersMethoddfs

(self, num, den, value, visited, graph)

Leetcode/medium/evaluate-division.py:65

↓ 1 callersMethoddisjkstra

(self, src, dest)

Graph/dijkstra.py:55

↓ 1 callersMethoddisplay

(self)

Stacks and Queues/deque.py:21

↓ 1 callersMethodenqueue

(self, item)

Stacks and Queues/queue-using-2-stacks.py:7

↓ 1 callersFunctionfib

(n)

Recursion/fibonacci.py:5

↓ 1 callersMethodfillUpRest

(self, graph, current, parent, count, distance)

Leetcode/hard/sum-of-distances-in-tree.py:49

↓ 1 callersMethodfind

(self, s, store)

Leetcode/medium/palindrome-partitioning.py:26

↓ 1 callersMethodfind

(self, k, n, arr)

Leetcode/medium/combination-sum-III.py:59

↓ 1 callersMethodfind

(self, root, count)

Leetcode/easy/maximum-depth-of-binary-tree.py:49

↓ 1 callersMethodfindCombinations

(self, s, index)

Leetcode/medium/decode-ways.py:57

↓ 1 callersMethodfindMinChild

(self, i)

Searching-and-sorting/heap-sort.py:37

↓ 1 callersMethodfindMinChild

(self, i)

Trees/implementing-binary-heap.py:37

↓ 1 callersMethodfindPeak

(self, left, right, nums)

Leetcode/medium/find-peak-element.py:32

↓ 1 callersMethodfindSuccessor

(self, node)

Trees/implementing-bst.py:86

↓ 1 callersMethodgetLeftChild

(self)

Trees/level-order-traversal.py:10

↓ 1 callersMethodgetLeftChild

(self)

Trees/implementing-bst.py:9

↓ 1 callersMethodgetNeighbors

(self, board, i, j)

Leetcode/medium/game-of-life.py:67

↓ 1 callersMethodgetRightChild

(self)

Trees/level-order-traversal.py:13

↓ 1 callersMethodgetRightChild

(self)

Trees/implementing-bst.py:12

↓ 1 callersMethodgetString

(self, i1, i2, i3)

Leetcode/medium/interleaving-string.py:64

↓ 1 callersMethodgetSum

(self, trieNode)

Leetcode/medium/map-sum-pairs.py:61

↓ 1 callersMethodhasBothChildren

(self)

Trees/implementing-bst.py:27

↓ 1 callersMethodhasOneChild

(self)

Trees/implementing-bst.py:30

↓ 1 callersFunctionheapSort

(arr)

Searching-and-sorting/heap-sort.py:53

↓ 1 callersMethodinorder

(self, root)

Leetcode/medium/binary-search-tree-iterator.py:52

↓ 1 callersMethodinorder

(self, root)

Leetcode/medium/lowest-common-ancestor-of-a-binary-tree.py:68

↓ 1 callersMethodinorder

(self, root)

Leetcode/medium/inorder-traversal.py:52

↓ 1 callersMethodinorder

(self, root)

Trees/level-order-traversal.py:60

↓ 1 callersMethodinsert

(self, n)

Searching-and-sorting/heap-sort.py:9

↓ 1 callersMethodinsert

(self, word)

Leetcode/medium/top-k-frequent-words.py:49

↓ 1 callersFunctioninsertion_sort_gap

(arr, start, gap)

Searching-and-sorting/shell-sort.py:9

↓ 1 callersMethodip

(self, s, n)

Leetcode/medium/restore-ip-address.py:43

↓ 1 callersFunctionlarge

(arr)

Arrays/largest-continuous-sum.py:2

↓ 1 callersMethodlength

(self)

Trees/implementing-bst.py:59

↓ 1 callersMethodlevel_traversal

(self, root)

Trees/level-order-traversal.py:66

↓ 1 callersFunctionmerge_sort

(arr)

Searching-and-sorting/merge-sort.py:2

↓ 1 callersFunctionminSum

(posx, posy, m, n, known, grid)

Leetcode/medium/minimum-path-sum.py:34

↓ 1 callersFunctionmissing

(arr1, arr2)

Arrays/find-missing-num.py:2

↓ 1 callersMethodmodify

(self, board, i, j, visited)

Leetcode/medium/game-of-life.py:50

↓ 1 callersMethodnext

:rtype: int

Leetcode/medium/peeking-iterator.py:59

↓ 1 callersMethodpeek

(self)

Stacks and Queues/balanced-parenthesis.py:18

↓ 1 callersMethodpercolateUp

(self, i)

Searching-and-sorting/heap-sort.py:20

↓ 1 callersMethodpercolateUp

(self, i)

Trees/implementing-binary-heap.py:20

↓ 1 callersFunctionpermutations

(s)

Recursion/permutations-string.py:2

↓ 1 callersMethodpermute

(self, nums)

Leetcode/medium/permutations-two.py:34

↓ 1 callersMethodpopulateTrie

(self, word, index)

Leetcode/hard/prefix-and-suffix-search.py:48

↓ 1 callersMethodpopulateTrie

(self, words)

Leetcode/medium/replace-words.py:89

↓ 1 callersFunctionprintntolast

(val, head)

Linked List/print-nth-to-last-node.py:19

↓ 1 callersFunctionq_s

(arr)

Searching-and-sorting/quick-sort.py:2

↓ 1 callersFunctionquick_sort

(arr, first, last)

Searching-and-sorting/quick-sort.py:5

↓ 1 callersFunctionrec

(target, coins, known)

Recursion/coin-change.py:2

↓ 1 callersFunctionrecursiveBFS

(q, visited)

Graph/bfs.py:69

↓ 1 callersFunctionrecursiveDFS

(q, visited)

Graph/dfs.py:69

↓ 1 callersMethodremove

(self)

Stacks and Queues/balanced-parenthesis.py:12

↓ 1 callersMethodremoveRear

(self)

Stacks and Queues/deque.py:15

↓ 1 callersMethodrev

(self, parent, cur)

Leetcode/easy/reverse-linked-list.py:26

↓ 1 callersFunctionreverse

(head)

Linked List/print-nth-to-last-node.py:7

↓ 1 callersFunctionreverse

(head)

Linked List/linked-list-reversal.py:7

↓ 1 callersMethodrobber

(self, pos, num, known)

Leetcode/easy/house-robber.py:33

↓ 1 callersMethodrunDfs

(self, current, graph, visited)

Leetcode/medium/number-of-provinces.py:50

↓ 1 callersFunctionsearch

(arr, value)

Leetcode/medium/3sum.py:44

↓ 1 callersMethodsearchHelper

(self, word, index, trieNode, count)

Leetcode/medium/implement-magic-dictionary.py:63

↓ 1 callersMethodsearchPrefixIndexes

(self, prefix)

Leetcode/hard/prefix-and-suffix-search.py:97

↓ 1 callersMethodsearchSuffixIndexes

(self, suffix)

Leetcode/hard/prefix-and-suffix-search.py:106

↓ 1 callersMethodselect

(self, target, n, nums)

Leetcode/medium/partition-equal-subset-sum.py:39

↓ 1 callersFunctionsplit

(arr, first, last)

Searching-and-sorting/quick-sort.py:11

↓ 1 callersMethodstep

(self, current, n, known)

Leetcode/easy/climbing-stairs.py:35

↓ 1 callersFunctionsubset

(nums)

Leetcode/medium/subsets.py:27

↓ 1 callersFunctionsubsets

(nums)

Leetcode/medium/subsets-II.py:25

↓ 1 callersMethodsums

(self, root, num)

Leetcode/medium/sum-root-to-leaf-numbers.py:55

↓ 1 callersFunctionthreeSum

(num, tar)

Leetcode/medium/4sum.py:41

↓ 1 callersMethodtraverse

(self, grid, i, j)

Leetcode/medium/number-of-islands.py:47

↓ 1 callersMethodtraverse

(self, grid, posx, posy)

Leetcode/medium/max-area-of-island.py:37

↓ 1 callersMethodtraverse

(self, string, n)

Leetcode/medium/generate-parenthesis.py:33

↓ 1 callersMethodtree

(self, pre, inorder)

Leetcode/medium/binary-tree-from-preorder-and-inorder.py:35

↓ 1 callersMethodtree

(self, post, inorder)

Leetcode/medium/binary-tree-from-postorder-and-inorder.py:35

↓ 1 callersMethodtrees

(self, start, end, dic)

Leetcode/medium/unique-binary-search-trees.py:30

↓ 1 callersMethodtrees

(self, start, end)

Leetcode/medium/unique-binary-search-trees-II.py:43

↓ 1 callersMethodtrimBST

(self, tree, minVal, maxVal)

Trees/trim-bst.py:69

↓ 1 callersFunctiontwoSum

(arr, value)

Leetcode/medium/4sum.py:56

↓ 1 callersFunctionunique

(posx, posy, m, n, known, obstacles)

Leetcode/medium/unique-paths-II.py:43

↓ 1 callersFunctionunique

(posx, posy, m, n, known)

Leetcode/medium/unique-paths.py:46

↓ 1 callersFunctionvalidateBST

(node, min, max)

Trees/validate-bst.py:8

FunctionBinaryTree

(r)

Trees/implement-with-list-of-lists.py:2

Graph/implement-graph.py:50

Method__init__

(self)

Searching-and-sorting/heap-sort.py:5

Method__init__

(self)

Searching-and-sorting/hashing.py:3

← previous next →101–200 of 583, ranked by callers