Functions — github.com/coding-minutes/data-structures-algorithms-level-up-bootcamp

CodeHub MCPcopy Create free account

hub / github.com/coding-minutes/data-structures-algorithms-level-up-bootcamp / functions

Functions298 in github.com/coding-minutes/data-structures-algorithms-level-up-bootcamp

⨍ Functions 298◇ Types & classes 47

↓ 1 callersFunctionpartition

04 Sorting & Searching/03 quicksort.cpp:6

↓ 1 callersFunctionpermute

06 Recursion Problems/TODO permutations.cpp:5

↓ 1 callersMethodprintAdjList

14 Graphs/02_adj_list.cpp:36

↓ 1 callersMethodprintAdjList

14 Graphs/02_adj_list_node.cpp:36

↓ 1 callersMethodprintAdjList

14 Graphs/01_adj_list.cpp:24

↓ 1 callersFunctionprintInOrder

10 BST/bst.cpp:40

↓ 1 callersFunctionprintKeypadOutput

06 Recursion Problems/keypad_input.cpp:8

↓ 1 callersFunctionprintNearestCars

11 Heaps/heaps_01_cabs.cpp:31

↓ 1 callersFunctionprintNodesAtDistanceK

09 Binary Tree/node_at_kth_distance.cpp:84

↓ 1 callersFunctionprintRoot2LeafPaths

=============================== ToDo: Complete this Function | ===============================

09 Binary Tree/root_2_leaft_paths.cpp:71

↓ 1 callersFunctionquickselect

04 Sorting & Searching/04 quickselect.cpp:23

↓ 1 callersFunctionquicksort

04 Sorting & Searching/03 quicksort.cpp:23

↓ 1 callersFunctionreplaceWithSum

Todo: Replace with Descendant Sum leaving leaf nodes intact

09 Binary Tree/level_order_build.cpp:111

↓ 1 callersFunctionreplace_space

02 Strings/02 space20.cpp:5

↓ 1 callersFunctionrotated_search

05 Binary Search/02 rotated_search.cpp:5

↓ 1 callersMethodsearch

13 Tries/suffix_trie.cpp:47

↓ 1 callersFunctionsearchHelper

13 Tries/little_cute_cat_trie.cpp:45

↓ 1 callersFunctionsimplifyPath

08 Stacks & Queue/simplify_path.cpp:7

↓ 1 callersFunctionsolveSudoku

06 Recursion Problems/Sudoku.cpp:32

↓ 1 callersFunctionsparse_search

04 Sorting & Searching/06 sparse_search.cpp:5

↓ 1 callersFunctionsquare_root

05 Binary Search/03 square_root.cpp:4

↓ 1 callersFunctionstringSearch

02 Strings/01 string_find_all.cpp:6

↓ 1 callersFunctionsubarraySort

01 Arrays & Vectors/08 subarray_sort.cpp:18

↓ 1 callersFunctionsubsequence

sorted subsequences

02 Strings/08 sort subsequence.cpp:7

↓ 1 callersFunctiontrappedWater

01 Arrays & Vectors/07 rainwater-trap.cpp:6

↓ 1 callersFunctiontraverseTree

09 Binary Tree/vertical_print.cpp:74

↓ 1 callersFunctiontree2LL

10 BST/bst_2_linked_list.cpp:54

↓ 1 callersFunctiontriplets

01 Arrays & Vectors/04 triplets.cpp:6

↓ 1 callersFunctionunique_substring

03 Sliding Window/02 unique_substring.cpp:6

↓ 1 callersFunctionverticalOrderPrint

09 Binary Tree/vertical_print.cpp:84

11 Heaps/heaps_01_cabs.cpp:12

14 Graphs/03_bfs_shortest_path.cpp:13

14 Graphs/cycle_detection_undirected.cpp:11

14 Graphs/03_bfs_.cpp:13

14 Graphs/cycle_detection_directed.cpp:11

14 Graphs/weighted_graph.cpp:12

14 Graphs/02_adj_list.cpp:22

14 Graphs/02_adj_list_node.cpp:23

14 Graphs/04_dfs.cpp:13

14 Graphs/dijkstra.cpp:14

14 Graphs/01_adj_list.cpp:12

17 LRU/LRU.cpp:25

17 LRU/LRU.cpp:11

13 Tries/suffix_trie.cpp:14

13 Tries/trie_introduction.cpp:13

13 Tries/little_cute_cat_trie.cpp:14

10 BST/inorder_succcessor.cpp:12

10 BST/closest_in_bst.cpp:11

10 BST/bst.cpp:11

10 BST/bst_2_linked_list.cpp:12

14 Graphs/board-game.cpp:17

14 Graphs/02_adj_list.cpp:13

14 Graphs/02_adj_list_node.cpp:14

14 Graphs/shortest_grid_path.cpp:12

12 Hashing/Counting Rectangles/rectangle.cpp:12

MethodSuffixTrie

13 Tries/suffix_trie.cpp:25

13 Tries/trie_introduction.cpp:24

13 Tries/little_cute_cat_trie.cpp:24

14 Graphs/board-game.cpp:28

FunctionbuildTree

Input : 1 2 4 -1 -1 5 7 -1 -1 -1 3 -1 6 -1 -1

09 Binary Tree/node_at_kth_distance.cpp:20

FunctionbuildTree

Input : 1 2 4 -1 -1 5 7 -1 -1 -1 3 -1 6 -1 -1

09 Binary Tree/vertical_print.cpp:22

FunctionbuildTree

Input : 1 2 4 -1 -1 5 7 -1 -1 -1 3 -1 6 -1 -1

09 Binary Tree/root_2_leaft_paths.cpp:21

FunctionbuildTree

Input : 1 2 4 -1 -1 5 7 -1 -1 -1 3 -1 6 -1 -1

09 Binary Tree/height_balanced.cpp:21

FunctionbuildTree

Input : 1 2 4 -1 -1 5 7 -1 -1 -1 3 -1 6 -1 -1

09 Binary Tree/level_order_build.cpp:20

Functioncompare

04 Sorting & Searching/05 smallest_string.cpp:6

Functioncompare

02 Strings/08 sort subsequence.cpp:24

Functioncontains_cycle

14 Graphs/cycle_detection_undirected.cpp:50

Functioncontains_cycle

Udemy Code Judge - Stub

14 Graphs/cycle_detection_directed.cpp:62

14 Graphs/cycle_detection_undirected.cpp:21

14 Graphs/cycle_detection_directed.cpp:20

MethoddfsHelper

14 Graphs/04_dfs.cpp:24

13 Tries/trie_introduction.cpp:29

FunctioninsertInMiddle

07 Linked Lists/linked_list.cpp:26

Methodinsert_helper

13 Tries/suffix_trie.cpp:30

FunctionkReverse

07 Linked Lists/linked_list.cpp:77

FunctionlevelOrderPrint

09 Binary Tree/node_at_kth_distance.cpp:36

FunctionlevelOrderPrint

09 Binary Tree/vertical_print.cpp:38

FunctionlevelOrderPrint

09 Binary Tree/root_2_leaft_paths.cpp:37

FunctionlevelOrderPrint

09 Binary Tree/height_balanced.cpp:37

FunctionlexicoCompare

02 Strings/06 sort_strings.cpp:48

09 Binary Tree/level_order_traversal.cpp:79

09 Binary Tree/node_at_kth_distance.cpp:128

09 Binary Tree/max_subset.cpp:93

09 Binary Tree/vertical_print.cpp:105

09 Binary Tree/root_2_leaft_paths.cpp:92

09 Binary Tree/diameter.cpp:132

09 Binary Tree/height_balanced.cpp:97

09 Binary Tree/level_order_build.cpp:128

01 Arrays & Vectors/pairs 03.cpp:25

01 Arrays & Vectors/09 min_swaps.cpp:51

01 Arrays & Vectors/02 2dvector.cpp:6

01 Arrays & Vectors/04 triplets.cpp:42

01 Arrays & Vectors/07 rainwater-trap.cpp:33

01 Arrays & Vectors/06 longest_band.cpp:43

01 Arrays & Vectors/08 subarray_sort.cpp:50

01 Arrays & Vectors/01 vector.cpp:5

01 Arrays & Vectors/05 mountain.cpp:39

01 Arrays & Vectors/fizzbuzz.cpp:31

17 LRU/LRU.cpp:73

12 Hashing/anagrams_substrings.cpp:58

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