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
↓ 9 callersFunctioninsert
10 BST/inorder_succcessor.cpp:18
↓ 9 callersMethodinsert
13 Tries/max_xor_trie.cpp:19
↓ 8 callersMethodaddEdge
14 Graphs/03_bfs_shortest_path.cpp:18
↓ 8 callersMethodaddEdge
14 Graphs/03_bfs_.cpp:18
↓ 8 callersMethodaddEdge
14 Graphs/04_dfs.cpp:18
↓ 8 callersFunctioninsertAtHead
----------Linked List-----------//
07 Linked Lists/linked_list.cpp:15
↓ 7 callersMethodaddEdge
14 Graphs/01_adj_list.cpp:17
↓ 6 callersMethodaddEdge
14 Graphs/weighted_graph.cpp:17
↓ 6 callersMethodaddEdge
14 Graphs/dijkstra.cpp:19
↓ 5 callersFunctiondfs
14 Graphs/board-game.cpp:50
↓ 5 callersMethodgetValue
17 LRU/LRU.cpp:51
↓ 5 callersMethodinsertKeyValue
17 LRU/LRU.cpp:29
↓ 4 callersMethodaddEdge
14 Graphs/cycle_detection_directed.cpp:16
↓ 4 callersMethodaddEdge
14 Graphs/02_adj_list.cpp:28
↓ 4 callersMethodaddEdge
14 Graphs/02_adj_list_node.cpp:29
↓ 4 callersMethoddist
11 Heaps/heaps_01_cabs.cpp:17
↓ 3 callersMethodaddEdge
undirected graph
14 Graphs/cycle_detection_undirected.cpp:17
↓ 3 callersFunctionlower_bound
05 Binary Search/01 Frequency Count.cpp:6
↓ 3 callersFunctionprintAtLevelK
=============================== ToDo: Complete this Function | ===============================
09 Binary Tree/node_at_kth_distance.cpp:70
↓ 3 callersFunctionreverse
07 Linked Lists/linked_list.cpp:56
↓ 2 callersMethodcontains_cycle
14 Graphs/cycle_detection_undirected.cpp:42
↓ 2 callersMethodcontains_cycle
14 Graphs/cycle_detection_directed.cpp:44
↓ 2 callersFunctionconvertToInt
02 Strings/06 sort_strings.cpp:36
↓ 2 callersFunctionheight
Helper Function : Height of the Tree
09 Binary Tree/diameter.cpp:76
↓ 2 callersFunctioninorderSucc
10 BST/inorder_succcessor.cpp:49
↓ 2 callersFunctioninsert
10 BST/bst.cpp:17
↓ 2 callersFunctionlevelOrderPrint
09 Binary Tree/level_order_build.cpp:44
↓ 2 callersMethodmostRecentKey
17 LRU/LRU.cpp:66
↓ 2 callersFunctionmystrtok
02 Strings/04 mystrtok.cpp:4
↓ 2 callersFunctionprintLL
07 Linked Lists/linked_list.cpp:169
↓ 2 callersFunctionupper_bound
05 Binary Search/01 Frequency Count.cpp:30
↓ 1 callersMethodaddWord
14 Graphs/board-game.cpp:32
↓ 1 callersFunctionanagrams_substrings
12 Hashing/anagrams_substrings.cpp:28
↓ 1 callersMethodbfs
14 Graphs/03_bfs_shortest_path.cpp:24
↓ 1 callersMethodbfs
14 Graphs/03_bfs_.cpp:24
↓ 1 callersFunctionbuildTree
Input : 1 2 4 -1 -1 5 7 -1 -1 -1 3 -1 6 -1 -1
09 Binary Tree/level_order_traversal.cpp:20
↓ 1 callersFunctionbuildTree
Input : 1 2 4 -1 -1 5 7 -1 -1 -1 3 -1 6 -1 -1
09 Binary Tree/max_subset.cpp:20
↓ 1 callersFunctionbuildTree
Input : 1 2 4 -1 -1 5 7 -1 -1 -1 3 -1 6 -1 -1
09 Binary Tree/diameter.cpp:20
↓ 1 callersFunctioncanPlaceBirds
05 Binary Search/04 angry_birds.cpp:7
↓ 1 callersFunctioncheckRedundant
08 Stacks & Queue/redundant_paranthesis.cpp:6
↓ 1 callersFunctioncountMinSwaps
01 Arrays & Vectors/09 min_swaps.cpp:6
↓ 1 callersFunctioncountSubsets
06 Recursion Problems/Subset Sum to X.cpp:8
↓ 1 callersFunctioncountWays
06 Recursion Problems/ladder.cpp:5
↓ 1 callersFunctioncount_rectangles
Count Rectangles Function
12 Hashing/Counting Rectangles/rectangle.cpp:37
↓ 1 callersFunctioncount_triangles
12 Hashing/Counting Triangles/triangles.cpp:6
↓ 1 callersFunctioncount_triplets
12 Hashing/triplets_in_gp.cpp:6
↓ 1 callersFunctiondfs
14 Graphs/largest_island copy.cpp:5
↓ 1 callersFunctiondfs
14 Graphs/largest_island.cpp:5
↓ 1 callersMethoddfs
14 Graphs/04_dfs.cpp:38
↓ 1 callersFunctiondiameter
Diameter Time Complexity?
09 Binary Tree/diameter.cpp:87
↓ 1 callersMethoddijkstra
14 Graphs/dijkstra.cpp:27
↓ 1 callersFunctiondivideAmongK
05 Binary Search/kpartition.cpp:4
↓ 1 callersFunctiondocumentSearch
13 Tries/little_cute_cat_trie.cpp:65
↓ 1 callersFunctionextractStringAtKey
02 Strings/06 sort_strings.cpp:23
↓ 1 callersFunctionfindClosestInBST
10 BST/closest_in_bst.cpp:33
↓ 1 callersFunctionfind_window
03 Sliding Window/03 string_window.cpp:6
↓ 1 callersFunctionfizzbuzz
Complete this method, don't write main
01 Arrays & Vectors/fizzbuzz.cpp:7
↓ 1 callersFunctiongenerateBrackets
06 Recursion Problems/generate_brackets.cpp:5
↓ 1 callersFunctiongetHashValue
1. Generate all substrings 2. Generate their hash 3. Hash the 'hash' values to club all anagrams in single bucket, to get their frequency count 4. Fro
12 Hashing/anagrams_substrings.cpp:12
↓ 1 callersFunctionhighest_mountain
01 Arrays & Vectors/05 mountain.cpp:6
↓ 1 callersFunctionhousing
03 Sliding Window/01 housing.cpp:5
↓ 1 callersFunctioninsert
10 BST/closest_in_bst.cpp:17
↓ 1 callersFunctioninsert
10 BST/bst_2_linked_list.cpp:18
↓ 1 callersMethodinsert
13 Tries/suffix_trie.cpp:63
↓ 1 callersMethodinsert
13 Tries/little_cute_cat_trie.cpp:28
↓ 1 callersFunctioninversion_count
sorting method
04 Sorting & Searching/02 inversion_count.cpp:46
↓ 1 callersFunctionisBalanced
08 Stacks & Queue/balanced_paranthesis.cpp:7
↓ 1 callersFunctionisHeightBalanced
O(N) time
09 Binary Tree/height_balanced.cpp:73
↓ 1 callersFunctionisSafe
06 Recursion Problems/Sudoku.cpp:5
↓ 1 callersFunctionisSubset
02 Strings/07 check_subset.cpp:5
↓ 1 callersFunctionjoin_ropes
11 Heaps/heaps_02_ropes.cpp:5
↓ 1 callersFunctionk_partition
05 Binary Search/kpartition.cpp:23
↓ 1 callersFunctionlargestBand
01 Arrays & Vectors/06 longest_band.cpp:6
↓ 1 callersFunctionlargest_island
14 Graphs/largest_island copy.cpp:27
↓ 1 callersFunctionlargest_island
14 Graphs/largest_island.cpp:27
↓ 1 callersFunctionlcs
15 DP1/lcs.cpp:6
↓ 1 callersFunctionlcs
15 DP1/lcs_bottom_up.cpp:7
↓ 1 callersFunctionlevelOrderBuild
09 Binary Tree/level_order_build.cpp:80
↓ 1 callersFunctionlevelOrderPrint
09 Binary Tree/level_order_traversal.cpp:44
↓ 1 callersFunctionlevelOrderPrint
09 Binary Tree/max_subset.cpp:36
↓ 1 callersFunctionlevelOrderPrint
09 Binary Tree/diameter.cpp:44
↓ 1 callersFunctionmaxSubArrayK
05 Binary Search/max_subarray_sliding_window_deque.cpp:6
↓ 1 callersFunctionmaxSubArrayK
08 Stacks & Queue/max_in_window_k.cpp:6
↓ 1 callersFunctionmaxSubsetSum
O(N)
09 Binary Tree/max_subset.cpp:76
↓ 1 callersFunctionmax_profit_dp
bottom up solution
15 DP1/rod_cutting.cpp:28
↓ 1 callersMethodmax_xor
13 Tries/max_xor_trie.cpp:74
↓ 1 callersFunctionmerge
07 Linked Lists/linked_list.cpp:107
↓ 1 callersFunctionmerge
helper method
04 Sorting & Searching/01 mergesort_vector.cpp:6
↓ 1 callersFunctionmerge
helper method
04 Sorting & Searching/02 inversion_count.cpp:6
↓ 1 callersFunctionmergeKArrays
11 Heaps/03_merge_k_sorted.cpp:6
↓ 1 callersFunctionmergeSort
ToDo : MergeSort
07 Linked Lists/linked_list.cpp:145
↓ 1 callersFunctionmergesort
sorting method
04 Sorting & Searching/01 mergesort_vector.cpp:44
↓ 1 callersFunctionmidPoint
07 Linked Lists/linked_list.cpp:131
↓ 1 callersFunctionmin_bars
12 Hashing/quick-brown-fox.cpp:53
↓ 1 callersFunctionmin_bars_helper
string s ="thequickbrownfox"; string words[] = {"the", "quickbrown", "fox","quick","brown"}; */ Main Logic
12 Hashing/quick-brown-fox.cpp:21
↓ 1 callersFunctionmin_pair
05 Binary Search/05 min_pairs.cpp:7
↓ 1 callersFunctionoptDiameter
09 Binary Tree/diameter.cpp:108
↓ 1 callersFunctionoutOfOrder
01 Arrays & Vectors/08 subarray_sort.cpp:6
↓ 1 callersFunctionpairSum
01 Arrays & Vectors/pairs 03.cpp:6
↓ 1 callersFunctionpartition
04 Sorting & Searching/04 quickselect.cpp:6
next →1–100 of 298, ranked by callers