Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/TheGeekiestOne/Coursera-Data-Structures-and-Algorithms-Specialization
/ functions
Functions
655 in github.com/TheGeekiestOne/Coursera-Data-Structures-and-Algorithms-Specialization
⨍
Functions
655
◇
Types & classes
110
↓ 1 callers
Function
rightchild
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/2_job_queue/job_queue.cpp:40
↓ 1 callers
Method
run
()
Course 4 - Algorithms on Strings/assignment 3/kmp/KnuthMorrisPratt.java:46
↓ 1 callers
Method
run
()
Course 4 - Algorithms on Strings/assignment 3/suffix_tree_from_array/SuffixTreeFromArray.java:75
↓ 1 callers
Method
run
()
Course 4 - Algorithms on Strings/assignment 3/suffix_array_matching/SuffixArrayMatching.java:58
↓ 1 callers
Method
run
()
Course 4 - Algorithms on Strings/assignment 3/suffix_array_long/SuffixArrayLong.java:66
↓ 1 callers
Function
safe_max
(max_, x)
Course 1 - Algorithmic Toolbox/week3_greedy_algorithms/7_maximum_salary/largest_number.py:39
↓ 1 callers
Function
search
(x)
Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.py:138
↓ 1 callers
Function
select_max_index
(values, weights)
Course 1 - Algorithmic Toolbox/week3_greedy_algorithms/2_maximum_value_of_the_loot/fractional_knapsack.py:21
↓ 1 callers
Function
shortet_paths
(adj, cost, s, distance, reachable, shortest)
Course 3 - Algorithms on Graphs/week4_paths2/3_shortest_paths/shortest_paths.py:7
↓ 1 callers
Function
small_size_min_distance
(points)
Course 1 - Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/closest.py:42
↓ 1 callers
Function
solve
(p, q)
Course 4 - Algorithms on Strings/assignment 1/non_shared_substring/non_shared_substring.py:4
↓ 1 callers
Function
solve
(text, n, patterns)
Course 4 - Algorithms on Strings/assignment 1/trie_matching/trie_matching.py:10
↓ 1 callers
Function
solve
(text, n, patterns)
Course 4 - Algorithms on Strings/assignment 1/trie_matching_extended/trie_matching_extended.py:11
↓ 1 callers
Function
solve
Course 4 - Algorithms on Strings/assignment 1/trie_matching_extended/trie_matching_extended.cpp:37
↓ 1 callers
Function
sortDoubled
Course 4 - Algorithms on Strings/assignment 3/suffix_array_matching/suffix_array_matching.cpp:43
↓ 1 callers
Function
sortDoubled
Course 4 - Algorithms on Strings/assignment 3/suffix_array_long/suffix_array_long.cpp:36
↓ 1 callers
Function
start
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/2_job_queue/job_queue.cpp:90
↓ 1 callers
Function
stripClosest
A utility function to find the distance beween the closest points of strip of given size. All points in strip[] are sorted accordint to y coordinate.
Course 1 - Algorithmic Toolbox/week4_divide_and_conquer/6_closest_points/closest.cpp:103
↓ 1 callers
Function
subsetSum
Course 1 - Algorithmic Toolbox/week6_dynamic_programming2/2_partitioning_souvenirs/partition3.cpp:20
↓ 1 callers
Function
suffixArrayPatternMatching
Course 4 - Algorithms on Strings/assignment 3/suffix_array_matching/suffix_array_matching.cpp:129
↓ 1 callers
Function
suffix_array_to_suffix_tree
Build suffix tree of the string text given its suffix array suffix_array and LCP array lcp_array. Return the tree as a mapping from a node ID
Course 4 - Algorithms on Strings/assignment 3/suffix_tree_from_array/suffix_tree_from_array.py:5
↓ 1 callers
Function
suffix_tree_from_array
Course 4 - Algorithms on Strings/assignment 3/suffix_tree_from_array/suffix_tree_from_array.cpp:159
↓ 1 callers
Function
sum
(fr, to)
Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.py:144
↓ 1 callers
Function
sum
Course 2 - Data Structures/week4_binary_search_trees/4_set_range_sum/set_range_sum.cpp:194
↓ 1 callers
Function
sum_of_two_digits
(first_digit, second_digit)
Course 1 - Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.py:10
↓ 1 callers
Function
sum_of_two_digits
Course 1 - Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.cpp:13
↓ 1 callers
Method
take_union
Course 3 - Algorithms on Graphs/week5_mst/2_clustering/clustering.cpp:61
↓ 1 callers
Method
topo_sort
Course 3 - Algorithms on Graphs/week2_decomposition2/2_toposort/toposort.cpp:57
↓ 1 callers
Function
toposort
(adj)
Course 3 - Algorithms on Graphs/week2_decomposition2/2_toposort/toposort.py:10
↓ 1 callers
Function
trie_matching
Course 4 - Algorithms on Strings/assignment 1/trie_matching/trie_matching.cpp:49
↓ 1 callers
Function
updateClasses
Course 4 - Algorithms on Strings/assignment 3/suffix_array_matching/suffix_array_matching.cpp:95
↓ 1 callers
Function
updateClasses
Course 4 - Algorithms on Strings/assignment 3/suffix_array_long/suffix_array_long.cpp:95
↓ 1 callers
Method
write_chain
(self, chain)
Course 2 - Data Structures/week3_hash_tables/2_hash_chains/hash_chains.py:31
↓ 1 callers
Function
write_responses
Course 2 - Data Structures/week3_hash_tables/1_phone_book/phone_book.cpp:39
↓ 1 callers
Function
write_responses
(result)
Course 2 - Data Structures/week3_hash_tables/1_phone_book/phone_book.py:14
↓ 1 callers
Method
write_search_result
(self, was_found)
Course 2 - Data Structures/week3_hash_tables/2_hash_chains/hash_chains.py:28
Method
AStar
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_with_coords/dist_with_coords.cpp:30
Method
BWMatching
Course 4 - Algorithms on Strings/assignment 2/bwmatching/bwmatching.cpp:87
Method
Bidijkstra
Course 3 - Algorithms on Graphs/Advanced Shortest Path/friend_suggestion/friend_suggestion.cpp:44
Method
Bracket
Course 2 - Data Structures/week1_basic_data_structures/1_brackets_in_code/check_brackets.cpp:9
Method
BuildTrie
(List<string> patterns)
Course 4 - Algorithms on Strings/assignment 1/trie/starters_by_learners/trie.cs:30
Method
ContractionHierarchies
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small-and-large.cpp:194
Method
DiGraph
Course 3 - Algorithms on Graphs/week2_decomposition2/1_acyclicity/acyclicity.cpp:39
Method
DiGraph
Course 3 - Algorithms on Graphs/week2_decomposition2/2_toposort/toposort.cpp:34
Method
DiGraph
Course 3 - Algorithms on Graphs/week2_decomposition2/3_strongly_connected/strongly_connected.cpp:46
Method
DisjointSets
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/3_merging_tables/merging_tables.cpp:29
Method
DisjointSets
Course 3 - Algorithms on Graphs/week5_mst/2_clustering/clustering.cpp:46
Method
DisjointSetsElement
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/3_merging_tables/merging_tables.cpp:16
Method
Edge
(int node, int start, int end)
Course 4 - Algorithms on Strings/assignment 3/suffix_tree_from_array/SuffixTreeFromArray.java:37
Method
Entry
(Long cost, int node)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/DistPreprocessLarge.java:118
Method
Entry
(Long cost, int node)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_with_coords/DistWithCoords.java:70
Method
Entry
(Long cost, int node)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/friend_suggestion/FriendSuggestion.java:70
Method
Entry
(Long cost, int node)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/DistPreprocessSmall.java:118
Method
Entry
(Long cost, int node)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/TravellingSalesmanProblem.java:118
Method
FastScanner
()
Course 4 - Algorithms on Strings/assignment 3/kmp/KnuthMorrisPratt.java:11
Method
FastScanner
()
Course 4 - Algorithms on Strings/assignment 3/suffix_tree_from_array/SuffixTreeFromArray.java:11
Method
FastScanner
()
Course 4 - Algorithms on Strings/assignment 3/suffix_array_long/SuffixArrayLong.java:10
Method
FastScanner
()
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/TravellingSalesmanProblem.java:155
Method
GenerateSwaps
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/1_make_heap/build_heap.cpp:69
Method
GenerateSwaps
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/1_make_heap/build_heap - Copy.cpp:32
Method
Graph
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small-and-large.cpp:50
Method
Graph
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:73
Method
Graph
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_with_coords/dist_with_coords-aStar.cpp:40
Method
Graph
Course 3 - Algorithms on Graphs/Advanced Shortest Path/friend_suggestion/friend_suggestions.cpp:46
Method
Graph
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/dist_preprocess_small.cpp:73
Method
Graph
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/travelling_salesman_problem.cpp:73
Method
Graph
Course 3 - Algorithms on Graphs/week3_paths1/2_bipartite/bipartite.cpp:18
Method
Graph
Course 3 - Algorithms on Graphs/week3_paths1/1_bfs/bfs.cpp:17
Method
Impl
(int n)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/DistPreprocessLarge.java:23
Method
Impl
(int n)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_with_coords/DistWithCoords.java:23
Method
Impl
(int n)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/friend_suggestion/FriendSuggestion.java:25
Method
Impl
(int n)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/DistPreprocessSmall.java:23
Method
Impl
(int n)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/TravellingSalesmanProblem.java:23
Method
Main
(string[] args)
Course 4 - Algorithms on Strings/assignment 1/trie_matching/starters_by_learners/trie_matching.cs:9
Method
Main
(string[] args)
Course 4 - Algorithms on Strings/assignment 1/trie/starters_by_learners/trie.cs:9
Method
Main
(string[] args)
Course 1 - Algorithmic Toolbox/week1_programming_challenges/1_sum_of_two_digits/APlusB.cs:7
Function
MaxPairwiseProduct
Course 1 - Algorithmic Toolbox/week1_programming_challenges/2_maximum_pairwise_product/max_pairwise_product.cpp:26
Method
Node
Course 4 - Algorithms on Strings/assignment 1/non_shared_substring/non_shared_substring.cpp:36
Method
Node
Course 4 - Algorithms on Strings/assignment 1/suffix_tree/suffix_tree.cpp:32
Method
Node
Course 4 - Algorithms on Strings/assignment 1/trie_matching_extended/trie_matching_extended.cpp:18
Method
Node
Course 2 - Data Structures/week4_binary_search_trees/2_is_bst/is_bst.cpp:33
Method
Node
Course 2 - Data Structures/week4_binary_search_trees/3_is_bst_advanced/is_bst_hard.cpp:26
Method
Node
Course 3 - Algorithms on Graphs/week5_mst/1_connecting_points/connecting_points.cpp:32
Method
Node
Course 3 - Algorithms on Graphs/week4_paths2/1_dijkstra/dijkstra.cpp:23
Method
Number
undefined works as infinity
Course 3 - Algorithms on Graphs/week4_paths2/3_shortest_paths/shortest_paths.cpp:22
Method
Point2D
Course 3 - Algorithms on Graphs/week5_mst/1_connecting_points/connecting_points.cpp:23
Method
Point2D
Course 3 - Algorithms on Graphs/week5_mst/2_clustering/clustering.cpp:24
Method
QueryProcessor
Course 2 - Data Structures/week3_hash_tables/2_hash_chains/hash_chains.cpp:37
Method
ReadData
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/1_make_heap/build_heap.cpp:34
Method
ReadData
Course 2 - Data Structures/week2_priority_queues_and_disjoint_sets/1_make_heap/build_heap - Copy.cpp:24
Method
Result
Course 3 - Algorithms on Graphs/week4_paths2/3_shortest_paths/shortest_paths.cpp:65
Method
Rope
Course 2 - Data Structures/week4_binary_search_trees/5_rope/rope.cpp:228
Method
Set
Course 3 - Algorithms on Graphs/week5_mst/2_clustering/clustering.cpp:39
Method
Shortcut
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small-and-large.cpp:180
Method
Shortcut
(int u, int v, Long c)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/DistPreprocessLarge.java:139
Method
Shortcut
(int u, int v, Long c)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_small/DistPreprocessSmall.java:139
Method
Shortcut
(int u, int v, Long c)
Course 3 - Algorithms on Graphs/Advanced Shortest Path/travelling_salesman_problem/TravellingSalesmanProblem.java:139
Method
Solve
(string text, List<string> patterns)
Course 4 - Algorithms on Strings/assignment 1/trie_matching/starters_by_learners/trie_matching.cs:25
Method
Solver
Course 2 - Data Structures/week3_hash_tables/4_substring_equality/substring_equality.cpp:8
Method
StlHeap
Course 3 - Algorithms on Graphs/Advanced Shortest Path/dist_preprocess_large/dist_preprocess_large.cpp:44
← previous
next →
301–400 of 655, ranked by callers