Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
Enterprise platform
AI-powered developer platform
AVAILABLE ADD-ONS
GitHub Advanced Security
Enterprise-grade security features
Copilot for Business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
PSakila
Competitive-Programming-Repository
Repository navigation
Code
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
Competitive-Programming-Repository
/
src
/
Copy path
Directory actions
More options
More options
Directory actions
More options
More options
Latest commit
History
History
History
master
Breadcrumbs
Competitive-Programming-Repository
/
src
/
Copy path
Top
Folders and files
Name
Name
Last commit message
Last commit date
parent directory
..
misc
misc
obselete
obselete
untested-codes
untested-codes
KMP.cpp
KMP.cpp
Z_algorithm_max_prefix_match.cpp
Z_algorithm_max_prefix_match.cpp
aggreate_sqrt_distinct_values.cpp
aggreate_sqrt_distinct_values.cpp
aggregate_cyclic_function.cpp
aggregate_cyclic_function.cpp
all_pair_shortest_path_binary_exponentation.cpp
all_pair_shortest_path_binary_exponentation.cpp
all_pair_shortest_path_floyd_warshall.cpp
all_pair_shortest_path_floyd_warshall.cpp
bellman_ford.cpp
bellman_ford.cpp
bigint_library.cpp
bigint_library.cpp
binary_indexed_tree.cpp
binary_indexed_tree.cpp
binary_indexed_tree_2D.cpp
binary_indexed_tree_2D.cpp
binary_indexed_tree_order_stat.cpp
binary_indexed_tree_order_stat.cpp
binary_indexed_tree_range_query_range_update.cpp
binary_indexed_tree_range_query_range_update.cpp
binary_trie_max_xor.cpp
binary_trie_max_xor.cpp
bitmask.cpp
bitmask.cpp
breadthFirstSearch_17251A05H5.cpp
breadthFirstSearch_17251A05H5.cpp
bridges_in_graph.cpp
bridges_in_graph.cpp
clean.bat
clean.bat
closest_max_element_before_after_index_using_stack.cpp
closest_max_element_before_after_index_using_stack.cpp
connected_component_in_graph.cpp
connected_component_in_graph.cpp
convexhull.cpp
convexhull.cpp
cycle_detection_in_graph.cpp
cycle_detection_in_graph.cpp
dijkstra_using_priority_queue.cpp
dijkstra_using_priority_queue.cpp
dijsktra_dense_graphs.cpp
dijsktra_dense_graphs.cpp
disjoint_set.cpp
disjoint_set.cpp
disjoint_set_with_undo_operation.cpp
disjoint_set_with_undo_operation.cpp
dynamic_programming_templates.cpp
dynamic_programming_templates.cpp
dynamic_string_using_treap.cpp
dynamic_string_using_treap.cpp
edit_distance_levenstein_dynamic_programming.cpp
edit_distance_levenstein_dynamic_programming.cpp
euler_phi_euler_totient_function.cpp
euler_phi_euler_totient_function.cpp
factorial_preprocessing.cpp
factorial_preprocessing.cpp
fast_fourier_transform_fft.cpp
fast_fourier_transform_fft.cpp
fast_readInt_writeInt_function.cpp
fast_readInt_writeInt_function.cpp
generate_all_palindromes.cpp
generate_all_palindromes.cpp
heap_using_multiset_max_min_insert_erase_update.cpp
heap_using_multiset_max_min_insert_erase_update.cpp
heavy_light_decomposition_weighted_edges (hld).cpp
heavy_light_decomposition_weighted_edges (hld).cpp
heavy_light_decomposition_wieghted_vertices(hld).cpp
heavy_light_decomposition_wieghted_vertices(hld).cpp
int2string_string2int.cpp
int2string_string2int.cpp
isConnected_using_bfs.cpp
isConnected_using_bfs.cpp
karatsuba_polynomial_multiplication.cpp
karatsuba_polynomial_multiplication.cpp
kruskal_min_spanning_tree.cpp
kruskal_min_spanning_tree.cpp
kth_ancestor_tree.cpp
kth_ancestor_tree.cpp
kth_shortest_path_between_nodes_graph.cpp
kth_shortest_path_between_nodes_graph.cpp
linear_recurrence_matrix_exponentiation.cpp
linear_recurrence_matrix_exponentiation.cpp
linearize_tree_subtree_aggregate_query.cpp
linearize_tree_subtree_aggregate_query.cpp
longest_increasing_subsequence_lis_binary_search.cpp
longest_increasing_subsequence_lis_binary_search.cpp
lowest_common_ancestor_lca.cpp
lowest_common_ancestor_lca.cpp
lucas_combinatorics.cpp
lucas_combinatorics.cpp
max_bipartite_matching_hopcroft_karp.cpp
max_bipartite_matching_hopcroft_karp.cpp
max_flow_network_dinic_algorithm.cpp
max_flow_network_dinic_algorithm.cpp
merge_sort_count_inversion.cpp
merge_sort_count_inversion.cpp
merge_sort_trees.cpp
merge_sort_trees.cpp
merge_sort_trees_order_stat_query.cpp
merge_sort_trees_order_stat_query.cpp
mo_algorithm_offline_range_query.cpp
mo_algorithm_offline_range_query.cpp
mobeius_function.cpp
mobeius_function.cpp
monotone_priority_queue.cpp
monotone_priority_queue.cpp
multiply_detect_overflow.cpp
multiply_detect_overflow.cpp
multiply_longlong_integers.cpp
multiply_longlong_integers.cpp
non_bipartite_check.cpp
non_bipartite_check.cpp
number_paths_length_k.cpp
number_paths_length_k.cpp
orderstat_rank_query_augmented_bst.cpp
orderstat_rank_query_augmented_bst.cpp
palindrome_longest_subsequence.cpp
palindrome_longest_subsequence.cpp
path_nearly_complete_binary_tree.cpp
path_nearly_complete_binary_tree.cpp
power_binary_exponentiation.cpp
power_binary_exponentiation.cpp
primality_check_fermat.cpp
primality_check_fermat.cpp
prime_factor_count.cpp
prime_factor_count.cpp
prime_sieve.cpp
prime_sieve.cpp
quick_select_order_stat_linear.cpp
quick_select_order_stat_linear.cpp
rabin_karp.cpp
rabin_karp.cpp
range_minimum_query_sparse_table.cpp
range_minimum_query_sparse_table.cpp
scanline_merge_overlapping_intervals.cpp
scanline_merge_overlapping_intervals.cpp
segement_trees_max_index_element_in_l_r_greater_than_k.cpp
segement_trees_max_index_element_in_l_r_greater_than_k.cpp
segment_tree_2D.cpp
segment_tree_2D.cpp
segment_tree_custom_merge_function.cpp
segment_tree_custom_merge_function.cpp
segment_tree_dynamic_reverse_subarray_using_treap.cpp
segment_tree_dynamic_reverse_subarray_using_treap.cpp
segment_tree_dynamic_using_treaps.cpp
segment_tree_dynamic_using_treaps.cpp
segment_tree_persistent.cpp
segment_tree_persistent.cpp
segment_tree_persistent_order_stat.cpp
segment_tree_persistent_order_stat.cpp
segment_tree_range_query_point_update.cpp
segment_tree_range_query_point_update.cpp
segment_tree_range_query_range_update_lazy_propogation.cpp
segment_tree_range_query_range_update_lazy_propogation.cpp
segment_trees_interative_fast.cpp
segment_trees_interative_fast.cpp
segmented_sieve_large_primes.cpp
segmented_sieve_large_primes.cpp
string_hashing.cpp
string_hashing.cpp
string_hashing_dynamic_segment_trees.cpp
string_hashing_dynamic_segment_trees.cpp
strongly_connected_components_kosaraju.cpp
strongly_connected_components_kosaraju.cpp
subtree size and level.cpp
subtree size and level.cpp
ternary_search.cpp
ternary_search.cpp
topological_sort_kosaraju.cpp
topological_sort_kosaraju.cpp
tree_dfs_preorder_postorder_isInSubtree.cpp
tree_dfs_preorder_postorder_isInSubtree.cpp
tree_diameter.cpp
tree_diameter.cpp
trees_path_query_sparse_tables.cpp
trees_path_query_sparse_tables.cpp
trie_insertion_deleteion.cpp
trie_insertion_deleteion.cpp
View all files
You can’t perform that action at this time.