Commit 757d7bb

authored

Update README.md

1 parent ab870b3 commit 757d7bbCopy full SHA for 757d7bb

File tree

1 file changed

+20

-20

lines changed

README.md

1 file changed

+20

-20

lines changed

`‎README.md‎`

Lines changed: 20 additions & 20 deletions

Original file line number	Diff line number	Diff line change
`@@ -30,17 +30,17 @@ Collection of algorithms and data structures in C++ used widely in Competitive p`
`30`	`30`	`* [Digit DP / Bitwise DP](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/dynamic_programming_templates.cpp)`
`31`	`31`	`* Standard DP Problems :`
`32`	`32`	`* [Longest Increasing Subsequence](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/longest_increasing_subsequence_lis_binary_search.cpp)`
`33`		`- * [Longest Palindromic Subsequence](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/palindrome_longest_subsequence.cpp)`
	`33`	`+ * [Longest Palindromic Subsequence](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/palindrome_longest_subsequence.cpp)`
`34`	`34`	`* [Levenstein Distance / Edit Distance](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/edit_distance_levenstein_dynamic_programming.cpp)`
`35`	`35`	`* Graphs :`
`36`	`36`	`* Single Source Shortest Path Algorithms :`
`37`	`37`	`* [Dijkstra in dense graphs](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/dijsktra_dense_graphs.cpp)`
`38`	`38`	`* [Dijkstra using priority queue](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/dijkstra_using_priority_queue.cpp)`
`39`	`39`	`* [Kth Shortest Path between Nodes using Dijkstra](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/kth_shortest_path_between_nodes_graph.cpp)`
`40`		`- * [Bellman Ford Negative cycle detection](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/bellman_ford.cpp)`
	`40`	`+ * [Bellman Ford Negative cycle detection](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/bellman_ford.cpp)`
`41`	`41`	`* All Pair shortest path :`
`42`		`- * [Using Binary exponentiation](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/all_pair_shortest_path_binary_exponentation.cpp)`
`43`		`- * [Floyd Warshall](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/all_pair_shortest_path_floyd_warshall.cpp)`
	`42`	`+ * [Using Binary exponentiation](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/all_pair_shortest_path_binary_exponentation.cpp)`
	`43`	`+ * [Floyd Warshall](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/all_pair_shortest_path_floyd_warshall.cpp)`
`44`	`44`	`* Cycle Detection :`
`45`	`45`	`* [Cycle detection in Undirected/Directed Graphs](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/cycle_detection_in_graph.cpp)`
`46`	`46`	`* Minimum Spanning tree :`
`@@ -49,12 +49,12 @@ Collection of algorithms and data structures in C++ used widely in Competitive p`
`49`	`49`	`* [Topological Sort](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/topological_sort_kosaraju.cpp)`
`50`	`50`	`* [Strongly Connected Component](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/strongly_connected_components_kosaraju.cpp)`
`51`	`51`	`* Maxflow/Matching :`
`52`		`- * [Hopkroft Karp Max Matching](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/max_bipartite_matching_hopcroft_karp.cpp)`
`53`		`- * [Dinic Max Flow](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/max_flow_network_dinic_algorithm.cpp)`
	`52`	`+ * [Hopkroft Karp Max Matching](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/max_bipartite_matching_hopcroft_karp.cpp)`
	`53`	`+ * [Dinic Max Flow](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/max_flow_network_dinic_algorithm.cpp)`
`54`	`54`	`* Misc :`
`55`	`55`	`* [Bridges in Graph](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/bridges_in_graph.cpp)`
`56`	`56`	`* [Connectivity](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/isConnected_using_bfs.cpp)`
`57`		`- * [Bipartite Check](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/non_bipartite_check.cpp)`
	`57`	`+ * [Bipartite Check](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/non_bipartite_check.cpp)`
`58`	`58`	`* Trees :`
`59`	`59`	`* Ancestor queries :`
`60`	`60`	`* [Lowest Common Ancestor](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/lowest_common_ancestor_lca.cpp)`
`@@ -73,10 +73,10 @@ Collection of algorithms and data structures in C++ used widely in Competitive p`
`73`	`73`	`* String Algorithms :`
`74`	`74`	`* [Z Algorithm](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/Z_algorithm_max_prefix_match.cpp)`
`75`	`75`	`* [Rolling String Hashing](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/string_hashing.cpp)`
`76`		`- * [Rolling String Hashing for Dynamic Strings](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/string_hashing_dynamic_segment_trees.cpp)`
	`76`	`+ * [Rolling String Hashing for Dynamic Strings](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/string_hashing_dynamic_segment_trees.cpp)`
`77`	`77`	`* Sorting :`
`78`	`78`	`* [Merge Sort](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/merge_sort_count_inversion.cpp)`
`79`		`- * [Quick Select](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/quick_select_order_stat_linear.cpp)`
	`79`	`+ * [Quick Select](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/quick_select_order_stat_linear.cpp)`
`80`	`80`	`* Fast Input/Output, String/Integer Conversion :`
`81`	`81`	`* [Fast Input/Output](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/fast_readInt_writeInt_function.cpp)`
`82`	`82`	`* [String/Integer Conversion](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/int2string_string2int.cpp)`
`@@ -85,10 +85,10 @@ Collection of algorithms and data structures in C++ used widely in Competitive p`
`85`	`85`	`* [Disjoint Set (Supports Undo Operation)](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/disjoint_set_with_undo_operation.cpp)`
`86`	`86`	`* [Max/Min Priority Queue with update](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/heap_using_multiset_max_min_insert_erase_update.cpp)`
`87`	`87`	`* [Binary Trie for xor maximization/minimization](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/binary_trie_max_xor.cpp)`
`88`		`- * [Bigint](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/bigint_library.cpp)`
`89`		`- * [Augmented Binary Tree for order statistics and rank query](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/orderstat_rank_query_augmented_bst.cpp)`
`90`		`- * [Monotone Priority Queue](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/monotone_priority_queue.cpp)`
`91`		`- * [Trie](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/trie_insertion_deleteion.cpp)`
	`88`	`+ * [Bigint](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/bigint_library.cpp)`
	`89`	`+ * [Augmented Binary Tree for order statistics and rank query](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/orderstat_rank_query_augmented_bst.cpp)`
	`90`	`+ * [Monotone Priority Queue](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/monotone_priority_queue.cpp)`
	`91`	`+ * [Trie](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/trie_insertion_deleteion.cpp)`
`92`	`92`	`* Persistent Data Structures :`
`93`	`93`	`* Persistent Segment Trees (SegTree) :`
`94`	`94`	`* [Persistent Segment Tree](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/segment_tree_persistent.cpp)`
`@@ -104,17 +104,17 @@ Collection of algorithms and data structures in C++ used widely in Competitive p`
`104`	`104`	`* [Fast Fourier Tranform](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/fast_fourier_transform_fft.cpp)`
`105`	`105`	`* [Karatsuba](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/karatsuba_polynomial_multiplication.cpp)`
`106`	`106`	`* Misc :`
`107`		`- * [Combinatorial and Catalan - Factorial preprocessing](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/factorial_preprocessing.cpp)`
	`107`	`+ * [Combinatorial and Catalan - Factorial preprocessing](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/factorial_preprocessing.cpp)`
`108`	`108`	`* [Mobeius Function](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/mobeius_function.cpp)`
`109`	`109`	`* [Euler Totient Function](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/euler_phi_euler_totient_function.cpp)`
`110`	`110`	`* [Lucas Theorm - Combinatorics](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/lucas_combinatorics.cpp)`
`111`	`111`	`* Misc :`
`112`		`- * [Sum of floor(x) with x=1:n](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/aggreate_sqrt_distinct_values.cpp)`
`113`		`- * [Sum of cyclic functions](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/aggregate_cyclic_function.cpp)`
`114`		`- * [Closest larger element before/after every element](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/closest_max_element_before_after_index_using_stack.cpp)`
`115`		`- * [Multiply Long Long Integers](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/multiply_longlong_integers.cpp)`
`116`		`- * [Multiply Long Long Integers - Overflow detection](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/multiply_detect_overflow.cpp)`
`117`		`- * [Scanline - Merge intersecting intervals](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/dragonslayerx-readme-update/scanline_merge_overlapping_intervals.cpp)`
	`112`	`+ * [Sum of floor(x) with x=1:n](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/aggreate_sqrt_distinct_values.cpp)`
	`113`	`+ * [Sum of cyclic functions](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/aggregate_cyclic_function.cpp)`
	`114`	`+ * [Closest larger element before/after every element](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/closest_max_element_before_after_index_using_stack.cpp)`
	`115`	`+ * [Multiply Long Long Integers](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/multiply_longlong_integers.cpp)`
	`116`	`+ * [Multiply Long Long Integers - Overflow detection](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/multiply_detect_overflow.cpp)`
	`117`	`+ * [Scanline - Merge intersecting intervals](https://github.com/dragonslayerx/Competitive-Programming-Repository/blob/master/scanline_merge_overlapping_intervals.cpp)`
`118`	`118`
`119`	`119`
`120`	`120`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 757d7bb

File tree

1 file changed

1 file changed

`‎README.md‎`

0 commit comments