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

↓ 36 callersMethodpop

(self)

Leetcode/easy/min-stack.py:50

↓ 31 callersMethodadd

(self, item)

Stacks and Queues/balanced-parenthesis.py:9

↓ 18 callersMethodinsert

(self, val)

Trees/trim-bst.py:42

↓ 14 callersMethodaddEdge

(self, fro, to, cost=0)

Graph/dijkstra.py:39

↓ 12 callersMethodinsert

(self, val)

Trees/level-order-traversal.py:39

↓ 12 callersMethodinsert

(self, val)

Trees/implementing-bst.py:38

↓ 8 callersMethodaddEdge

(self, fro, to, cost=0)

Graph/dfs.py:39

↓ 8 callersMethodaddEdge

(self, fro, to, cost=0)

Graph/bfs.py:39

↓ 8 callersMethodremove

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

Leetcode/medium/insert-delete-getrandom-O(1).py:59

↓ 7 callersMethodinsert

(self, n)

Trees/implementing-binary-heap.py:9

↓ 6 callersMethodget

(self, key)

Searching-and-sorting/hashing.py:40

↓ 6 callersMethodhasLeftChild

(self)

Trees/implementing-bst.py:21

↓ 6 callersMethodinsert

Inserts a word into the trie.

Leetcode/medium/implement-trie.py:37

↓ 5 callersFunctionanagram

(s1, s2)

Arrays/anagram-checking.py:2

↓ 5 callersMethodfind

(self, n, nums, started, known)

Leetcode/medium/house-robber-II.py:43

↓ 5 callersMethodput

(self, key)

Searching-and-sorting/hashing.py:7

↓ 4 callersMethodaddRear

(self, item)

Stacks and Queues/deque.py:9

↓ 4 callersFunctioncalc

(number, s1, s2, s3)

Leetcode/medium/integer-to-roman.py:83

↓ 4 callersMethodgetLeftChild

(self)

Trees/trim-bst.py:13

↓ 4 callersMethodgetRightChild

(self)

Trees/trim-bst.py:16

↓ 4 callersMethodhasLeftChild

(self)

Trees/level-order-traversal.py:22

↓ 4 callersMethodhasRightChild

(self)

Trees/level-order-traversal.py:25

↓ 4 callersMethodhasRightChild

(self)

Trees/implementing-bst.py:24

↓ 4 callersMethodmark

(self, b, x, y)

Leetcode/medium/surrounded-regions.py:58

↓ 4 callersFunctionuniq

(s)

Arrays/unique-char.py:2

↓ 3 callersMethodaddFront

(self, item)

Stacks and Queues/deque.py:6

↓ 3 callersMethodaddVertex

(self, key)

Graph/dfs.py:29

↓ 3 callersMethodaddVertex

(self, key)

Graph/dijkstra.py:29

↓ 3 callersMethodaddVertex

(self, key)

Graph/bfs.py:29

↓ 3 callersMethodaddVertex

(self, key)

Graph/implement-graph.py:27

↓ 3 callersFunctioncheck

(s)

Stacks and Queues/balanced-parenthesis.py:23

↓ 3 callersFunctiondfs

(graph, start)

Graph/dfs.py:55

↓ 3 callersMethodhasLeftChild

(self)

Trees/trim-bst.py:25

↓ 3 callersMethodhasRightChild

(self)

Trees/trim-bst.py:28

↓ 3 callersMethodrehash

(self, oldhash, size)

Searching-and-sorting/hashing.py:37

↓ 3 callersFunctionreverse

(s)

Recursion/reverse-string-recursion.py:2

↓ 2 callersFunctionbinary_search_iter

(arr, target)

Searching-and-sorting/binary-search.py:2

↓ 2 callersFunctionbinary_search_rec

(arr, target)

Searching-and-sorting/binary-search.py:16

↓ 2 callersFunctionbubble_sort

(arr)

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

↓ 2 callersFunctioncheck

(phrase, li, output=None)

Recursion/phrase-list-of-words.py:2

↓ 2 callersFunctioncompress

(st)

Arrays/string-compression.py:2

↓ 2 callersMethodconvert

(self, a, b)

Leetcode/medium/reconstruct-itinerary.py:72

↓ 2 callersMethodcosts

(self, pos, cost, known)

Leetcode/easy/min-cost-climbing-stairs.py:28

↓ 2 callersMethodget

(self, val)

Trees/implementing-bst.py:68

↓ 2 callersMethodgetVertex

(self, key)

Graph/dfs.py:34

↓ 2 callersMethodgetVertex

(self, key)

Graph/dijkstra.py:34

↓ 2 callersMethodgetVertex

(self, key)

Graph/bfs.py:34

↓ 2 callersMethodhashfunction

(self, key, size)

Searching-and-sorting/hashing.py:26

↓ 2 callersMethodinorder

(self, root)

Trees/implementing-bst.py:62

↓ 2 callersMethodinorder

(self, root)

Trees/trim-bst.py:63

↓ 2 callersMethodinsert

(self, word)

Leetcode/easy/longest-word-in-dictionary.py:49

↓ 2 callersFunctioninsertion_sort

(arr)

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

↓ 2 callersMethodmaxdepth

(self,root)

Leetcode/easy/balanced-binary-tree.py:56

↓ 2 callersFunctionpair_sum

APPROACH USING DICTIONARY count = {} k = 0 for x in li: count[k] = x k += 1 print(type(count.values

Arrays/array-pair-sum.py:2

↓ 2 callersMethodpercolateDown

(self, i)

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

↓ 2 callersMethodpercolateDown

(self, i)

Trees/implementing-binary-heap.py:28

↓ 2 callersMethodpop

Removes the element on top of the stack and returns that element.

Leetcode/easy/implement-stacks-using-queues.py:64

↓ 2 callersMethodpop

Removes the element from in front of queue and returns that element.

Leetcode/easy/implement-queues-using-stacks.py:62

↓ 2 callersMethodremoveFront

(self)

Stacks and Queues/deque.py:12

↓ 2 callersFunctionrev

(str)

Arrays/sentence-reversal.py:2

↓ 2 callersFunctionselection_sort

(arr)

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

↓ 2 callersFunctionshell_sort

(arr)

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

↓ 2 callersMethodsize

(self)

Stacks and Queues/deque.py:18

↓ 2 callersMethodsize

(self)

Stacks and Queues/balanced-parenthesis.py:6

↓ 2 callersMethodvalid

(self, s)

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

↓ 2 callersFunctionverify

(node)

Trees/validate-bst.py:15

↓ 1 callersMethodaddEdge

(self, fro, to, cost=0)

Graph/implement-graph.py:37

↓ 1 callersMethodaddNeighbor

(self, nbr, w)

Graph/dfs.py:9

↓ 1 callersMethodaddNeighbor

(self, nbr, w)

Graph/dijkstra.py:9

↓ 1 callersMethodaddNeighbor

(self, nbr, w)

Graph/bfs.py:9

↓ 1 callersMethodaddNeighbor

(self, nbr, w)

Graph/implement-graph.py:7

↓ 1 callersMethodassignFlower

(self, graph, current, flowers)

Leetcode/medium/flower-planting-with-no-adjacent.py:71

↓ 1 callersFunctionbfs

(graph, start)

Graph/bfs.py:55

↓ 1 callersMethodbfs

(self, graph, current, flowers, visited)

Leetcode/medium/flower-planting-with-no-adjacent.py:58

↓ 1 callersMethodbinary

(self, nums, l, r, target)

Leetcode/medium/find-first-and-last-position-of element.py:40

↓ 1 callersMethodbreakDown

(self, n, known)

Leetcode/medium/integer-break.py:35

↓ 1 callersMethodbuildHeap

(self, l)

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

↓ 1 callersMethodbuildHeap

(self, l)

Trees/implementing-binary-heap.py:44

↓ 1 callersMethodcalculate

(self, s)

Leetcode/medium/different-ways-to-add-parenthesis.py:33

↓ 1 callersMethodcheck

(self, root, s)

Leetcode/medium/path-sum-II.py:39

↓ 1 callersMethodcheck

(self, n, perm, temp, d)

Leetcode/medium/course-schedule-II.py:63

↓ 1 callersMethodcheck

(self, s, words, known)

Leetcode/medium/word-break.py:35

↓ 1 callersMethodcheck

(self, posx, posy, st, board, m, n)

Leetcode/medium/word-search.py:41

↓ 1 callersMethodcheck

(self, n, perm, temp, d)

Leetcode/medium/course-schedule.py:54

↓ 1 callersMethodcheck

(self, l, r)

Leetcode/easy/symmetric-tree.py:38

↓ 1 callersMethodcheck

(self, root, value)

Leetcode/easy/minimum-depth-of-binary-tree.py:43

↓ 1 callersMethodcheckForSafety

(self, graph, current, safe)

Leetcode/medium/find-eventual-safe-states.py:45

↓ 1 callersMethodcheckInterleaving

(self, s1, s2, s3, index1, index2, index3, cache)

Leetcode/medium/interleaving-string.py:41

↓ 1 callersMethodcheckPalin

(self, s)

Leetcode/medium/palindrome-partitioning.py:40

↓ 1 callersMethodcoin

(self, coins, amount, known)

Leetcode/medium/coin-change.py:50

↓ 1 callersFunctioncombination

(s)

Recursion/combination.py:2

↓ 1 callersFunctioncombo

(start, k, n)

Leetcode/medium/combinations.py:35

↓ 1 callersFunctioncombo

(arr)

Leetcode/medium/letter-combo-of-phone.py:37

↓ 1 callersFunctioncombo

(candidates, target)

Leetcode/medium/combination-sum.py:51

↓ 1 callersFunctioncombo

(candidates, target)

Leetcode/medium/combination-sum-2.py:41

↓ 1 callersMethodcontainsNearbyDuplicate

(self, nums, k)

Leetcode/medium/contains-duplicate-III.py:43

↓ 1 callersMethodcreate

(self, head)

Leetcode/medium/sorted-list-to-binary-search-tree.py:52

↓ 1 callersFunctioncyclecheck

(head)

Linked List/linked-list-cycle-check.py:7

↓ 1 callersMethoddelete

(self, val)

Trees/implementing-bst.py:92

↓ 1 callersMethoddeleteMin

(self)

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

next →1–100 of 583, ranked by callers