Functions — github.com/djeada/Algorithms-And-Data-Structures

CodeHub MCPcopy Create free account

hub / github.com/djeada/Algorithms-And-Data-Structures / functions

Functions1,481 in github.com/djeada/Algorithms-And-Data-Structures

⨍ Functions 1,481◇ Types & classes 357

↓ 9 callersMethodheight

src/collections_and_containers/cpp/avl_tree/src/avl_tree.cpp:58

↓ 9 callersMethodsize

Return the number of elements in the heap.

src/collections_and_containers/python/heap/src/heap.py:42

↓ 9 callersMethodsize

src/collections_and_containers/cpp/avl_tree/src/avl_tree.cpp:60

↓ 8 callersFunctionassertVectorsEqual

src/graphs/cpp/graph/test/test_graph.cpp:7

↓ 8 callersFunctiondfs

( string: str, i: int, pattern: str, j: int, mapping: Dict[str, str] )

src/backtracking/python/string_pattern/src/string_pattern.py:20

↓ 8 callersMethodempty

Check if the heap is empty.

src/collections_and_containers/python/heap/src/heap.py:46

↓ 8 callersMethodheight

Return the height of the tree.

src/collections_and_containers/python/binary_search_tree/src/binary_search_tree.py:96

↓ 8 callersFunctionis_float

src/brain_teasers/python/add_string_numbers/src/add_string_numbers.py:22

↓ 8 callersFunctionrecurse

src/dynamic_programming/python/best_sum/src/best_sum.py:20

↓ 8 callersMethodsize

Return the number of elements in the tree.

src/collections_and_containers/python/binary_search_tree/src/binary_search_tree.py:107

↓ 8 callersFunctionsubarraySum

src/brain_teasers/cpp/subarray_sum/src/subarray_sum.cpp:3

↓ 7 callersFunctionaddIntegerStrings

src/brain_teasers/cpp/add_string_numbers/src/add_string_numbers.cpp:4

↓ 7 callersMethodadd_vertex

Add a vertex to the graph.

src/graphs/python/graph/src/graph.py:76

↓ 7 callersMethodback

Return the last element without removing it.

src/collections_and_containers/python/linked_list/src/linked_list.py:76

↓ 7 callersMethodback

Go back in history by the given number of steps. Args: steps: Number of steps to go back. Returns:

src/brain_teasers/python/design_browser_history/src/design_browser_history.py:30

↓ 7 callersMethoddequeue

Remove and return the front element.

src/collections_and_containers/python/simple_queue/src/simple_queue.py:25

↓ 7 callersMethodempty

src/collections_and_containers/cpp/avl_tree/src/avl_tree.cpp:62

↓ 7 callersMethodempty

src/collections_and_containers/cpp/red_black_tree/src/red_black_tree.cpp:76

↓ 7 callersMethodfront

Return the first element without removing it.

src/collections_and_containers/python/linked_list/src/linked_list.py:70

↓ 7 callersMethodheight

src/collections_and_containers/cpp/binary_search_tree/src/binary_search_tree.cpp:69

↓ 7 callersFunctionis_palindrome_after_char_deletion

Check if a string is a palindrome or can become one by deleting one character. Uses two pointers to find mismatches and checks if removing e

src/brain_teasers/python/is_palindrome_after_char_deletion/src/is_palindrome_after_char_deletion.py:6

↓ 7 callersFunctionkClosestPoints

src/brain_teasers/cpp/k_closest_points/src/k_closest_points.cpp:10

↓ 7 callersMethodpop_back

src/collections_and_containers/cpp/vector/src/vector.cpp:89

↓ 7 callersFunctionproductExceptSelf

src/brain_teasers/cpp/array_product/src/array_product.cpp:3

↓ 7 callersMethodput

Put a key-value pair into the cache. Args: key: The key to store. value: The value to store.

src/brain_teasers/python/lru_cache/src/lru_cache.py:110

↓ 7 callersFunctionrangeSumBST

src/brain_teasers/cpp/range_sum_of_bst/src/range_sum_bst.cpp:3

↓ 7 callersMethodsize

src/collections_and_containers/cpp/binary_search_tree/src/binary_search_tree.cpp:73

↓ 6 callersMethodaddEdge

src/graphs/cpp/a_star/src/graph.cpp:76

↓ 6 callersMethodadd_edge

Add an edge to the graph.

src/graphs/python/a_star/src/graph.py:66

↓ 6 callersFunctionadd_string_numbers

Add two numbers represented as strings. Supports both integers and decimal numbers. Handles arbitrarily large numbers that would overflo

src/brain_teasers/python/add_string_numbers/src/add_string_numbers.py:6

↓ 6 callersFunctioncompare_2d_lists

src/dynamic_programming/python/all_construct/tests/test_all_construct.py:10

↓ 6 callersMethodcontains

src/collections_and_containers/cpp/binary_search_tree/src/binary_search_tree.cpp:38

↓ 6 callersFunctionequal

src/dynamic_programming/cpp/how_sum/test/test_how_sum.cpp:6

↓ 6 callersFunctionequal

src/dynamic_programming/cpp/best_sum/test/test_best_sum.cpp:6

↓ 6 callersFunctionequal

src/dynamic_programming/cpp/all_construct/test/test_all_construct.cpp:5

↓ 6 callersMethodflip_colors

Flip the colors of a node and its children.

src/collections_and_containers/python/red_black_tree/src/red_black_tree.py:185

↓ 6 callersFunctionhow_sum_memo

Find any combination of numbers that add up to target. Uses memoization for efficient computation. Args: target: The target sum

src/dynamic_programming/python/how_sum/src/how_sum.py:32

↓ 6 callersMethodisEmpty

src/collections_and_containers/cpp/stack/src/stack.cpp:62

↓ 6 callersFunctionlowestCommonAncestor

src/brain_teasers/cpp/lowest_common_ancestor/src/lca.cpp:10

↓ 6 callersFunctionmatrixScore

src/brain_teasers/cpp/score_after_flipping_matrix/src/matrix_score.cpp:3

↓ 6 callersFunctionpair_to_key

Convert a coordinate pair to a string key.

src/backtracking/python/generating_words/src/generate_words.py:36

↓ 6 callersMethodpop

Remove and return the top element.

src/collections_and_containers/python/stack/src/stack.py:24

↓ 6 callersMethodpop_back

Remove and return the last element.

src/collections_and_containers/python/vector/src/vector.py:58

↓ 6 callersMethodrangeSum

src/brain_teasers/cpp/subarray_sum/src/subarray_sum.cpp:22

↓ 6 callersFunctionshuffleArray

src/brain_teasers/cpp/randomize_array/src/randomize_array.h:13

↓ 6 callersMethodsize

src/collections_and_containers/cpp/heap/src/heap.cpp:76

↓ 5 callersMethod_height

(self, p: Optional[Node])

src/collections_and_containers/python/avl_tree/src/avl_tree.py:95

↓ 5 callersFunctioncountWaysToClimbBasic

src/dynamic_programming/cpp/climb_stairs/src/climb.cpp:5

↓ 5 callersFunctioncountWaysToClimbMemo

src/dynamic_programming/cpp/climb_stairs/src/climb.cpp:17

↓ 5 callersFunctioncountWaysToClimbTable

src/dynamic_programming/cpp/climb_stairs/src/climb.cpp:37

↓ 5 callersFunctioncount_ways_to_climb_basic

Count the number of ways to climb stairs taking 1, 2, or 3 steps at a time. Uses basic recursion without memoization. Args: num

src/dynamic_programming/python/climbing_stairs/src/climb.py:4

↓ 5 callersFunctioncount_ways_to_climb_memo

Count the number of ways to climb stairs taking 1, 2, or 3 steps at a time. Uses memoization for efficient computation. Args: n

src/dynamic_programming/python/climbing_stairs/src/climb.py:29

↓ 5 callersFunctioncount_ways_to_climb_table

Count the number of ways to climb stairs taking 1, 2, or 3 steps at a time. Uses tabulation (bottom-up DP) for efficient computation. A

src/dynamic_programming/python/climbing_stairs/src/climb.py:64

↓ 5 callersMethodedgesFromVertex

src/graphs/cpp/graph/src/graph.cpp:88

↓ 5 callersMethodempty

Check if the queue is empty.

src/collections_and_containers/python/simple_queue/src/simple_queue.py:50

↓ 5 callersMethodempty

Check if the tree is empty.

src/collections_and_containers/python/avl_tree/src/avl_tree.py:104

↓ 5 callersMethodempty

Check if the list is empty.

src/collections_and_containers/python/linked_list/src/linked_list.py:86

↓ 5 callersMethodempty

Check if the tree is empty.

src/collections_and_containers/python/red_black_tree/src/red_black_tree.py:124

↓ 5 callersFunctionfib_basic

Compute the nth Fibonacci number using basic recursion. Args: n: The index of the Fibonacci number to compute (0-indexed). Retu

src/dynamic_programming/python/fibonacci/src/fib.py:4

↓ 5 callersFunctionfib_memo

Compute the nth Fibonacci number using memoization. Args: n: The index of the Fibonacci number to compute (0-indexed). memo:

src/dynamic_programming/python/fibonacci/src/fib.py:22

↓ 5 callersFunctionfib_tab

Compute the nth Fibonacci number using tabulation (bottom-up DP). Args: n: The index of the Fibonacci number to compute (0-indexed).

src/dynamic_programming/python/fibonacci/src/fib.py:48

↓ 5 callersFunctionfind_shortest_combination_sum_basic

Find the shortest combination of numbers that add up to target. Uses basic recursion without memoization. Args: target: The tar

src/dynamic_programming/python/best_sum/src/best_sum.py:4

↓ 5 callersFunctionfind_shortest_combination_sum_memo

Find the shortest combination of numbers that add up to target. Uses memoization for efficient computation. Args: target: The t

src/dynamic_programming/python/best_sum/src/best_sum.py:50

↓ 5 callersFunctionfind_shortest_combination_sum_table

Find the shortest combination of numbers that add up to target. Uses tabulation (bottom-up DP) for efficient computation. Args:

src/dynamic_programming/python/best_sum/src/best_sum.py:101

↓ 5 callersMethodheight

Return the height of the tree.

src/collections_and_containers/python/avl_tree/src/avl_tree.py:91

↓ 5 callersMethodheight

Return the height of the tree.

src/collections_and_containers/python/red_black_tree/src/red_black_tree.py:111

↓ 5 callersMethodin_order_traversal

src/collections_and_containers/cpp/avl_tree/src/avl_tree.cpp:64

↓ 5 callersMethodin_order_traversal

src/collections_and_containers/cpp/red_black_tree/src/red_black_tree.cpp:78

↓ 5 callersFunctionknight_tour

Find all knight's tour solutions for an n x n board. A knight's tour is a sequence of moves where the knight visits every square exactly

src/backtracking/python/knight_tour/src/knight_tour.py:73

↓ 5 callersFunctionknight_tour

src/backtracking/cpp/knight_tour/src/knight_tour.cpp:71

↓ 5 callersFunctionlcs_basic

Find the length of the longest common subsequence using basic recursion. Args: a: First string. b: Second string. Retur

src/dynamic_programming/python/longest_common_subsequence/src/lcs.py:1

↓ 5 callersFunctionlcs_memo

Find the length of the longest common subsequence using memoization. Args: a: First string. b: Second string. Returns:

src/dynamic_programming/python/longest_common_subsequence/src/lcs.py:25

↓ 5 callersFunctionlcs_tab

Find the length of the longest common subsequence using tabulation. Args: a: First string. b: Second string. Returns:

src/dynamic_programming/python/longest_common_subsequence/src/lcs.py:58

↓ 5 callersFunctionminimum_insertions_for_palindrome_basic

Find minimum insertions needed to make a string a palindrome. Uses basic recursion without memoization. Args: s: The input stri

src/dynamic_programming/python/minimum_insertions_for_palindrome/src/minimum_insertions_for_palindrome.py:4

↓ 5 callersFunctionminimum_insertions_for_palindrome_basic

src/dynamic_programming/cpp/minimum_insertions_for_palindrome/src/minimum_insertions_for_palindrome.cpp:5

↓ 5 callersFunctionminimum_insertions_for_palindrome_memo

Find minimum insertions needed to make a string a palindrome. Uses memoization for efficient computation. Args: s: The input st

src/dynamic_programming/python/minimum_insertions_for_palindrome/src/minimum_insertions_for_palindrome.py:40

↓ 5 callersFunctionminimum_insertions_for_palindrome_memo

src/dynamic_programming/cpp/minimum_insertions_for_palindrome/src/minimum_insertions_for_palindrome.cpp:37

↓ 5 callersFunctionminimum_insertions_for_palindrome_tab

Find minimum insertions needed to make a string a palindrome. Uses tabulation (bottom-up DP) for efficient computation. Args: s

src/dynamic_programming/python/minimum_insertions_for_palindrome/src/minimum_insertions_for_palindrome.py:82

↓ 5 callersFunctionminimum_insertions_for_palindrome_tab

src/dynamic_programming/cpp/minimum_insertions_for_palindrome/src/minimum_insertions_for_palindrome.cpp:76

↓ 5 callersFunctionparent

src/sorting/python/heap_sort/src/heap_sort.py:25

↓ 5 callersMethodremove

src/collections_and_containers/cpp/avl_tree/src/avl_tree.cpp:28

↓ 5 callersMethodremove

src/collections_and_containers/cpp/red_black_tree/src/red_black_tree.cpp:34

↓ 5 callersMethodremove

src/collections_and_containers/cpp/hash_table/src/hash_table.cpp:60

↓ 5 callersFunctionrightSideView

src/brain_teasers/cpp/binary_tree_right_side_view/src/right_side_view.cpp:4

↓ 5 callersFunctionright_side_view

Return the values of nodes visible from the right side of a binary tree. Uses level-order traversal (BFS) and returns the rightmost node at

src/brain_teasers/python/binary_tree_right_side_view/src/binary_tree_right_side_view.py:23

↓ 5 callersMethodsize

Return the number of elements in the tree.

src/collections_and_containers/python/avl_tree/src/avl_tree.py:100

↓ 5 callersMethodsize

Return the number of elements in the list.

src/collections_and_containers/python/linked_list/src/linked_list.py:95

↓ 5 callersMethodsize

Return the number of elements in the tree.

src/collections_and_containers/python/red_black_tree/src/red_black_tree.py:120

↓ 5 callersMethodsize

Return the number of elements in the hash table.

src/collections_and_containers/python/hash_table/src/hash_table.py:56

↓ 5 callersMethodsize

src/collections_and_containers/cpp/vector/src/vector.cpp:110

↓ 5 callersMethodsize

src/graphs/cpp/bellman_ford/src/graph.cpp:123

↓ 5 callersMethodsize

src/graphs/cpp/prim/src/graph.cpp:124

↓ 5 callersMethodsize

src/graphs/cpp/kruskal/src/graph.cpp:126

↓ 5 callersFunctionstring_pattern

Check if a string matches a pattern using backtracking. Each character in the pattern represents a variable that can match one or more c

src/backtracking/python/string_pattern/src/string_pattern.py:4

↓ 5 callersFunctionstring_pattern

src/backtracking/cpp/string_pattern/src/string_pattern.cpp:6

↓ 4 callersFunctionaStar

src/graphs/cpp/a_star/src/a_star.cpp:9

↓ 4 callersFunctiona_star

Find the shortest path between source and destination using A* algorithm. Args: graph: The graph to search. source: The

src/graphs/python/a_star/src/a_star.py:12

↓ 4 callersMethodaddVertex

src/graphs/cpp/graph/src/graph.cpp:73

↓ 4 callersFunctionallConstructBasic

src/dynamic_programming/cpp/all_construct/src/all_construct.cpp:5

↓ 4 callersFunctionallConstructMemo

src/dynamic_programming/cpp/all_construct/src/all_construct.cpp:33

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