GitHub - SaxenaLakshya007/CP-Algorithms-in-C_plus-plus: Efficient and small codes are available in C++ of Algorithms frequently used in CP (Competitive Programming)

Name		Name	Last commit message	Last commit date
Latest commit History 137 Commits
1_Modular_Arithmetic_Properties.c		1_Modular_Arithmetic_Properties.c
ALL_PAIR_SHORTEST_PATH_FLOYS_WARSHALL_ALGORITHM.cpp		ALL_PAIR_SHORTEST_PATH_FLOYS_WARSHALL_ALGORITHM.cpp
ALL_SUBSETS_OF_A_GIVEN_SET.cpp		ALL_SUBSETS_OF_A_GIVEN_SET.cpp
Breadth_First_Search.cpp		Breadth_First_Search.cpp
CONNECTED_COMPONENTS_IN_GRAPH.cpp		CONNECTED_COMPONENTS_IN_GRAPH.cpp
COUNT_NO_OF_CYCLES_IN_UNDIRECTED_GRAPH_USING_UNION_FIND_ALGORITHM.cpp		COUNT_NO_OF_CYCLES_IN_UNDIRECTED_GRAPH_USING_UNION_FIND_ALGORITHM.cpp
Chinese_remainder_theorem.cpp		Chinese_remainder_theorem.cpp
ComponentsOfAGraph.cpp		ComponentsOfAGraph.cpp
DEPTH_FIRST_SEARCH_GRAPH_TRAVERSAL.cpp		DEPTH_FIRST_SEARCH_GRAPH_TRAVERSAL.cpp
Double_Tree.cpp		Double_Tree.cpp
EachSubTreeSize.cpp		EachSubTreeSize.cpp
EncryptFileinCplusplus		EncryptFileinCplusplus
Euler's_Totient_Function_Application.c		Euler's_Totient_Function_Application.c
Euler_Totient_function.cpp		Euler_Totient_function.cpp
GCD_of_N_numbers.cpp		GCD_of_N_numbers.cpp
HangmanCodeCpp		HangmanCodeCpp
INFIX_NOTATION_TO_POSTFIX_AND_PREFIX.cpp		INFIX_NOTATION_TO_POSTFIX_AND_PREFIX.cpp
KNAPSACK_FRACTION_PROBLEM_USING_GREEDY_METHOD.cpp		KNAPSACK_FRACTION_PROBLEM_USING_GREEDY_METHOD.cpp
KOSARAJU_ALGORITHM_STRONGLY_CONNECTED_COMPONENTS.cpp		KOSARAJU_ALGORITHM_STRONGLY_CONNECTED_COMPONENTS.cpp
KRUSKAL_ALGORITHM_FIND_MINIMUM_SPANNING_TREE.cpp		KRUSKAL_ALGORITHM_FIND_MINIMUM_SPANNING_TREE.cpp
L__DELETE_LAST_OCCURRENCE_OF_AN_ITEM_FROM_LINKED _LIST.cpp		L__DELETE_LAST_OCCURRENCE_OF_AN_ITEM_FROM_LINKED _LIST.cpp
L__DELETE_MIDDLE_ELEMENT_OF_SINGLY_LINKED_LIST.cpp		L__DELETE_MIDDLE_ELEMENT_OF_SINGLY_LINKED_LIST.cpp
L__DELETE_Nth_NODE_FROM_END_IN_SINGLY_LINKED_LIST.cpp		L__DELETE_Nth_NODE_FROM_END_IN_SINGLY_LINKED_LIST.cpp
L__DELETION_IN_SINGLY_LINKED_LIST.cpp		L__DELETION_IN_SINGLY_LINKED_LIST.cpp
L__DETECT_A_CYCLE_IN_SINGLY_LINKED_LIST.cpp		L__DETECT_A_CYCLE_IN_SINGLY_LINKED_LIST.cpp
L__FIND_Nth_NODE_FROM_END_IN_SINGLY_LINKED_LIST.cpp		L__FIND_Nth_NODE_FROM_END_IN_SINGLY_LINKED_LIST.cpp
L__INSERTION_IN_SINGLY_LINKED_LIST.cpp		L__INSERTION_IN_SINGLY_LINKED_LIST.cpp
L__MERGE_SORT_IN_SINGLY_LINKED_LIST_WITHOUT_ANY_EXTRA_SPACE.cpp		L__MERGE_SORT_IN_SINGLY_LINKED_LIST_WITHOUT_ANY_EXTRA_SPACE.cpp
L__MERGE_TWO_SORTED_LINKED_LIST.cpp		L__MERGE_TWO_SORTED_LINKED_LIST.cpp
L__QUEUE_USING_SINGLY_LINKED_LIST.cpp		L__QUEUE_USING_SINGLY_LINKED_LIST.cpp
L__RECURSIVELY_ADD_A_DIGIT_NUMBER_TO_LIST.cpp		L__RECURSIVELY_ADD_A_DIGIT_NUMBER_TO_LIST.cpp
L__REMOVE_CYCLE_FROM_SINGLY_LINKED_LIST.cpp		L__REMOVE_CYCLE_FROM_SINGLY_LINKED_LIST.cpp
L__REMOVE_DUPLICATE_NODES_FROM_SORTED_LINKED_LIST.cpp		L__REMOVE_DUPLICATE_NODES_FROM_SORTED_LINKED_LIST.cpp
L__REVERSE_A_SINGLY_LINKED_LIST.cpp		L__REVERSE_A_SINGLY_LINKED_LIST.cpp
L__ROTATE_A_SINGLY_LINKED_LIST.cpp		L__ROTATE_A_SINGLY_LINKED_LIST.cpp
L__STACK_USING_SINGLY_LINKED_LIST.cpp		L__STACK_USING_SINGLY_LINKED_LIST.cpp
L__TO_CHECK_IF_SINGLY_LINKED_LIST_IS_PALINDROMIC_WITH_N_SPACE_COMPLEXITY.cpp		L__TO_CHECK_IF_SINGLY_LINKED_LIST_IS_PALINDROMIC_WITH_N_SPACE_COMPLEXITY.cpp
Linear_Congruence_Equation.cpp		Linear_Congruence_Equation.cpp
Linear_diophantine_equations.cpp		Linear_diophantine_equations.cpp
MAXIMUM_AREA_IN_HISTOGRAM.cpp		MAXIMUM_AREA_IN_HISTOGRAM.cpp
MAXIMUM_SIZE_rectangle_SUB_MATRIX.cpp		MAXIMUM_SIZE_rectangle_SUB_MATRIX.cpp
Maximum_Size_square_Sub_Matrix..cpp		Maximum_Size_square_Sub_Matrix..cpp
MultiThreadingCPP		MultiThreadingCPP
N_COMBINATION_R_IN_EFFICIENT_MANNER.cpp		N_COMBINATION_R_IN_EFFICIENT_MANNER.cpp
Nth_Fibonacci_Number.cpp		Nth_Fibonacci_Number.cpp
PERMUTATIONS.cpp		PERMUTATIONS.cpp
Postfix_and_Prefix_to_Infix.cpp		Postfix_and_Prefix_to_Infix.cpp
Prime_factorization.cpp		Prime_factorization.cpp
Print_all_nodes_at_distance_k_from_a_given_node.cpp		Print_all_nodes_at_distance_k_from_a_given_node.cpp
RANGE_QUERIES_PROBLEM_IN_MATRIX.cpp		RANGE_QUERIES_PROBLEM_IN_MATRIX.cpp
SEGMENT_TREE_MINIMUM_QUERY.cpp		SEGMENT_TREE_MINIMUM_QUERY.cpp
SEGMENT_TREE_SUM_QUERIES.cpp		SEGMENT_TREE_SUM_QUERIES.cpp
SINGLE_SOURCE_SHORTEST_PATH_DIJKSTRA_ALGO_WITH_ADJACENCY_LIST.cpp		SINGLE_SOURCE_SHORTEST_PATH_DIJKSTRA_ALGO_WITH_ADJACENCY_LIST.cpp
Sorting_Vector_Elements_as_per_your_choice.cpp		Sorting_Vector_Elements_as_per_your_choice.cpp
TO_INPUT_LIKE_PYTHON_SPACE_SEPARATED_NUMBERS.cpp		TO_INPUT_LIKE_PYTHON_SPACE_SEPARATED_NUMBERS.cpp
TREE_Details_height_count_of_internal-external_nodes.cpp		TREE_Details_height_count_of_internal-external_nodes.cpp
TREE_TRAVERSAL.cpp		TREE_TRAVERSAL.cpp
Y__BUILD_BALANCED_HEIGHT_BST_FROM_ARRAY_OF_ELEMENTS.cpp		Y__BUILD_BALANCED_HEIGHT_BST_FROM_ARRAY_OF_ELEMENTS.cpp
Y__BUILD_BST_FROM_PRE-ORDER_AND_IN-ORDER.cpp		Y__BUILD_BST_FROM_PRE-ORDER_AND_IN-ORDER.cpp
Y__CHECK_IF_GIVEN_BT_IS_BST.CPP		Y__CHECK_IF_GIVEN_BT_IS_BST.CPP
Y__CHECK_IF_GIVEN_BT_IS_BST_USING_INORDER_TRAVERSAL.cpp		Y__CHECK_IF_GIVEN_BT_IS_BST_USING_INORDER_TRAVERSAL.cpp
Y__CHECK_IF_TREE_IS_HEIGHT_BALANCED.cpp		Y__CHECK_IF_TREE_IS_HEIGHT_BALANCED.cpp
Y__CHECK_IF_TWO_BINARY_TREES_ARE_EQUAL.cpp		Y__CHECK_IF_TWO_BINARY_TREES_ARE_EQUAL.cpp
Y__CHECK_IF_TWO_TREES_ARE_MIRROR_IMAGE_OF_EACH_OTHER.cpp		Y__CHECK_IF_TWO_TREES_ARE_MIRROR_IMAGE_OF_EACH_OTHER.cpp
Y__COUNT_NUMBER_OF_NODES_AT_EACH_LEVEL_AND_PRINT_THEM_IN_TREE_2.cpp		Y__COUNT_NUMBER_OF_NODES_AT_EACH_LEVEL_AND_PRINT_THEM_IN_TREE_2.cpp
Y__DIAMETER_OF_TREE1.cpp		Y__DIAMETER_OF_TREE1.cpp
Y__FIND_MIRROR_OF_BINARY_TREE.cpp		Y__FIND_MIRROR_OF_BINARY_TREE.cpp
Y__FIND_PATH_CONNECTING_THE_TWO_NODES_IN_BINARY_TREE.cpp		Y__FIND_PATH_CONNECTING_THE_TWO_NODES_IN_BINARY_TREE.cpp
Y__INORDER_PREDECESSOR_AND_SUCCESSOR_IN_BST.cpp		Y__INORDER_PREDECESSOR_AND_SUCCESSOR_IN_BST.cpp
Y__INSERTION_AND_DELETION_FROM_BINARY_SEARCH_TREE.cpp		Y__INSERTION_AND_DELETION_FROM_BINARY_SEARCH_TREE.cpp
Y__Kth_LARGEST_AND_SMALLEST_IN_BST.cpp		Y__Kth_LARGEST_AND_SMALLEST_IN_BST.cpp
Y__LARGEST_BST_IN_BT.cpp		Y__LARGEST_BST_IN_BT.cpp
Y__LCA_IN_BINARY_TREE_BRUTE_FORCE_SOLUTION.cpp		Y__LCA_IN_BINARY_TREE_BRUTE_FORCE_SOLUTION.cpp
Y__LEFT_VIEW_AND_RIGHT_VIEW_OF_TREE.cpp		Y__LEFT_VIEW_AND_RIGHT_VIEW_OF_TREE.cpp
Y__MAXIMUM_PATH_SUM_BINARY_TREE.cpp		Y__MAXIMUM_PATH_SUM_BINARY_TREE.cpp
Y__PRINT_ALL_PAIRS_OF_NODES_IN_BST_WITH_GIVEN_SUM.cpp		Y__PRINT_ALL_PAIRS_OF_NODES_IN_BST_WITH_GIVEN_SUM.cpp
Y__PRINT_ALL_PATH_FROM_ROOT_TO_LEAF_IN_BINARY_TREE.cpp		Y__PRINT_ALL_PATH_FROM_ROOT_TO_LEAF_IN_BINARY_TREE.cpp
Y__PRINT_LEAF_AND_INTERNAL_NODES_OF_BINARY_TREE.cpp		Y__PRINT_LEAF_AND_INTERNAL_NODES_OF_BINARY_TREE.cpp
Y__SEARCH_AN_ELEMENT_IN_BST.cpp		Y__SEARCH_AN_ELEMENT_IN_BST.cpp
Y__TOP_VIEW_AND_BOTTOM_VIEW_OF_BINARY_TREE.cpp		Y__TOP_VIEW_AND_BOTTOM_VIEW_OF_BINARY_TREE.cpp
Y__TRAVERSE_TREE_NODE_AND_MENTION_THE_LEVEL.cpp		Y__TRAVERSE_TREE_NODE_AND_MENTION_THE_LEVEL.cpp
Y__TREE_TRAVERSAL_ITERATIVE_METHOD.cpp		Y__TREE_TRAVERSAL_ITERATIVE_METHOD.cpp
Y__TREE_TRAVERSAL_SPIRAL_FORMAT_3.cpp		Y__TREE_TRAVERSAL_SPIRAL_FORMAT_3.cpp
Z__Challenging_Problem_1.cpp		Z__Challenging_Problem_1.cpp
Z__Maximum_Path_In_A_Tree.cpp		Z__Maximum_Path_In_A_Tree.cpp
chess_game_console.cpp		chess_game_console.cpp
codeyourway.py		codeyourway.py
extended_euclid_algo_to_find_inverse_modulo.cpp		extended_euclid_algo_to_find_inverse_modulo.cpp
fast_expo.cpp		fast_expo.cpp
fast_modulo_expo.cpp		fast_modulo_expo.cpp
fermats_little_theorem.cpp		fermats_little_theorem.cpp
graph_representations_using_set_and_hash.cpp		graph_representations_using_set_and_hash.cpp
ludo_console_app.cpp		ludo_console_app.cpp
password.cpp		password.cpp
path_in_a_rectangle_with_circles.cpp		path_in_a_rectangle_with_circles.cpp
sieve_algo_to_generate_prime.cpp		sieve_algo_to_generate_prime.cpp
suffiz_array.cpp		suffiz_array.cpp
to_check_if_number_is_prime.cpp		to_check_if_number_is_prime.cpp

Folders and files

Latest commit

History

About

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages