algorithms-and-data-structures

including, but not limited to the source code for some of the most important algorithms & data structures, for future reference

Name		Name	Last commit message	Last commit date
Latest commit History 71 Commits
visitor_pattern_c++		visitor_pattern_c++
visitor_pattern_java		visitor_pattern_java
.gitignore		.gitignore
3sum.c		3sum.c
4sum.cc		4sum.cc
Anagram.java		Anagram.java
AngryChildren.c		AngryChildren.c
AngryChildren_input_00		AngryChildren_input_00
AngryChildren_input_01		AngryChildren_input_01
BIT_point_update_range_query.c		BIT_point_update_range_query.c
BIT_range_update_point_query.c		BIT_range_update_point_query.c
BIT_range_update_range_query.c		BIT_range_update_range_query.c
CutTheTree.c		CutTheTree.c
DijkstraSSSP.java		DijkstraSSSP.java
ExpiringMap.java		ExpiringMap.java
KSMALL_TLE.c		KSMALL_TLE.c
KingdomConnectivity.c		KingdomConnectivity.c
MatrixRotation.c		MatrixRotation.c
MaximizingXORNaiveSolution.c		MaximizingXORNaiveSolution.c
MaximizingXORRadixTreeSolution.c		MaximizingXORRadixTreeSolution.c
ORDERSET.c		ORDERSET.c
ProducerConsumer.java		ProducerConsumer.java
QTREE2.c		QTREE2.c
README.md		README.md
SEERC_2000_H.c		SEERC_2000_H.c
SherlockAndMiniMax.c		SherlockAndMiniMax.c
SimilarPair.c		SimilarPair.c
StringFunctionCalculation.c		StringFunctionCalculation.c
TheCrazyHelix.c		TheCrazyHelix.c
VerticalSticks.c		VerticalSticks.c
VolatileTest.java		VolatileTest.java
abs_without_branching.c		abs_without_branching.c
aho-corasick_automaton_example.c		aho-corasick_automaton_example.c
alternating_order_bfs_with_two_stacks.cc		alternating_order_bfs_with_two_stacks.cc
avl_tree.c		avl_tree.c
balanced_partition.cc		balanced_partition.cc
bellman_ford.cc		bellman_ford.cc
binary_heap.c		binary_heap.c
binary_indexed_tree.cc		binary_indexed_tree.cc
bitwise_lex_permutation.c		bitwise_lex_permutation.c
brackets_sequence.c		brackets_sequence.c
cartesian_tree.c		cartesian_tree.c
cartesian_tree_alt_impl.c		cartesian_tree_alt_impl.c
cartesian_tree_input		cartesian_tree_input
cartesian_tree_output		cartesian_tree_output
cartesian_tree_poj_2201.c		cartesian_tree_poj_2201.c
ceil_log2.c		ceil_log2.c
count_connected_component.cc		count_connected_component.cc
count_num_digit.c		count_num_digit.c
count_num_inv.c		count_num_inv.c
count_num_partitions.c		count_num_partitions.c
count_one_bit.cc		count_one_bit.cc
count_one_bit_template_version.cc		count_one_bit_template_version.cc
count_significant_inversion.cc		count_significant_inversion.cc
cow_ski_area.c		cow_ski_area.c
crossed_ladder.c		crossed_ladder.c
cyk_algorithm.c		cyk_algorithm.c
day_of_week.cc		day_of_week.cc
difference_constraint_problem--is_the_information_reliable.cc		difference_constraint_problem--is_the_information_reliable.cc
dijkstra_single_source_shortest_and_second_shortest_path_sparse_graph.c		dijkstra_single_source_shortest_and_second_shortest_path_sparse_graph.c
dijkstra_sssp.c		dijkstra_sssp.c
dijkstra_sssp_binary_heap_impl.c		dijkstra_sssp_binary_heap_impl.c
dijkstra_sssp_sparse_graph_impl.c		dijkstra_sssp_sparse_graph_impl.c
edge_pairing.c		edge_pairing.c
eight_queen.cc		eight_queen.cc
endian_check.c		endian_check.c
exponentiation.c		exponentiation.c
find_cycle_in_directed_graph.cc		find_cycle_in_directed_graph.cc
find_k_distant_from_leaf.c		find_k_distant_from_leaf.c
floyd_warshall.c		floyd_warshall.c
frequent_values.c		frequent_values.c
gethostbyname.c		gethostbyname.c
hangover.c		hangover.c
heap_sort.cc		heap_sort.cc
interval_set_operations.c		interval_set_operations.c
interval_union.cc		interval_union.cc
is_tree.c		is_tree.c
josephus.c		josephus.c
juggle_fest.cc		juggle_fest.cc
jury_compromise.c		jury_compromise.c
k_th_number.c		k_th_number.c
k_way_merge_sort.cc		k_way_merge_sort.cc
kmp_string_match.c		kmp_string_match.c
knapsack_using_bellman_ford.cc		knapsack_using_bellman_ford.cc
knight_moves_a_star_search_inelegant_sol.cc		knight_moves_a_star_search_inelegant_sol.cc
kth_parent_via_sparse_table.c		kth_parent_via_sparse_table.c
kth_parent_via_sparse_table_testcase_1		kth_parent_via_sparse_table_testcase_1
kth_parent_via_sparse_table_testcase_2		kth_parent_via_sparse_table_testcase_2
kth_parent_via_sparse_table_testcase_3		kth_parent_via_sparse_table_testcase_3
kth_parent_via_sparse_table_testcase_4		kth_parent_via_sparse_table_testcase_4
kth_parent_via_sparse_table_testcase_5		kth_parent_via_sparse_table_testcase_5
lca.c		lca.c
lca_via_rmq.c		lca_via_rmq.c
lcp_array_dc3_impl.c		lcp_array_dc3_impl.c
levenshtein_sim.cc		levenshtein_sim.cc
linked_list_has_loop.cc		linked_list_has_loop.cc
linked_list_to_binary_search_tree.c		linked_list_to_binary_search_tree.c
longest_common_substring.cc		longest_common_substring.cc
longest_common_substring_kmp_impl.c		longest_common_substring_kmp_impl.c
longest_non_decreasing_subsequence.cc		longest_non_decreasing_subsequence.cc

prashant-r/algorithms-and-data-structures

Folders and files

Latest commit

History