DSA-and-CP-0toInfinity

This repository is a collection of DSA and CP problems from beginner to advanced, and I'm continuously adding more.

This can be helpful if you are learning Data structures and algorithms or want to get your hands dirty with Competitve Programming.

Currently all the programs are in C++, but later I will add problems in Java and Python.

Name		Name	Last commit message	Last commit date
Latest commit History 42 Commits
.gitignore		.gitignore
0-1_knapsack_problem_recursion.cpp		0-1_knapsack_problem_recursion.cpp
01_knapsack_dp.cpp		01_knapsack_dp.cpp
2D_matix_search.cpp		2D_matix_search.cpp
Dijkstras_algo_shortest_path.cpp		Dijkstras_algo_shortest_path.cpp
README.md		README.md
activity_selection_greedy_problem.cpp		activity_selection_greedy_problem.cpp
add_binary_nums.cpp		add_binary_nums.cpp
alternate_square_pattern.cpp		alternate_square_pattern.cpp
balanced_parenthesis.cpp		balanced_parenthesis.cpp
bellman_ford_algo_shortest_path.cpp		bellman_ford_algo_shortest_path.cpp
binary_exponentiation.cpp		binary_exponentiation.cpp
binary_to_decimal.cpp		binary_to_decimal.cpp
bipartite_graph.cpp		bipartite_graph.cpp
bit_man_is_power_of_2.cpp		bit_man_is_power_of_2.cpp
bit_manipulation_101.cpp		bit_manipulation_101.cpp
bitman_count_ones_in_a_binary_num.cpp		bitman_count_ones_in_a_binary_num.cpp
bitman_find_1_unique_number_in_array.cpp		bitman_find_1_unique_number_in_array.cpp
bitman_find_2_unique_num_in_array.cpp		bitman_find_2_unique_num_in_array.cpp
bitman_find_all_posible_subset.cpp		bitman_find_all_posible_subset.cpp
bitman_find_unique_from_array3.cpp		bitman_find_unique_from_array3.cpp
boardgame_countpath_recursion.cpp		boardgame_countpath_recursion.cpp
boring_factorials_spoj_numTheoryAdv.cpp		boring_factorials_spoj_numTheoryAdv.cpp
build_balanced_bst_from_sorted_array.cpp		build_balanced_bst_from_sorted_array.cpp
build_bst_from_preorder.cpp		build_bst_from_preorder.cpp
build_tree_from_postorder_and_inorder.cpp		build_tree_from_postorder_and_inorder.cpp
build_tree_from_preorder_and_inorder.cpp		build_tree_from_preorder_and_inorder.cpp
calatan_numbers_problem.cpp		calatan_numbers_problem.cpp
check_bst_or_not.cpp		check_bst_or_not.cpp
check_if_array_is_sorted_recursion.cpp		check_if_array_is_sorted_recursion.cpp
check_indentical_bsts.cpp		check_indentical_bsts.cpp
check_prime.cpp		check_prime.cpp
circular_linked_list.cpp		circular_linked_list.cpp
correct_violated_BST.cpp		correct_violated_BST.cpp
count_and_sum_of_nodes.cpp		count_and_sum_of_nodes.cpp
count_binary_strings_without_con1_dp.cpp		count_binary_strings_without_con1_dp.cpp
count_distict_strings_using_hashing.cpp		count_distict_strings_using_hashing.cpp
count_frequency_of_elements_using_map.cpp		count_frequency_of_elements_using_map.cpp
count_inversion_merge_sort.cpp		count_inversion_merge_sort.cpp
count_inversions_fenwick_tree.cpp		count_inversions_fenwick_tree.cpp
count_sort.cpp		count_sort.cpp
cycle_detection_in_directed_graph.cpp		cycle_detection_in_directed_graph.cpp
cycle_detection_in_undirected_graph.cpp		cycle_detection_in_undirected_graph.cpp
deque_stack+queue.cpp		deque_stack+queue.cpp
digital_dictionary_trie.cpp		digital_dictionary_trie.cpp
distance_between_two_nodes_in_bt.cpp		distance_between_two_nodes_in_bt.cpp
dnf_sort.cpp		dnf_sort.cpp
doubly_linked_list.cpp		doubly_linked_list.cpp
dquery_using_mo's_algo_spoj.cpp		dquery_using_mo's_algo_spoj.cpp
dsu_cycle_detection_undireted_graph.cpp		dsu_cycle_detection_undireted_graph.cpp
euclid_algo_to_find_gcd.cpp		euclid_algo_to_find_gcd.cpp
euler_totient_function.cpp		euler_totient_function.cpp
evaluate_postfix_expression.cpp		evaluate_postfix_expression.cpp
evaluate_prefix_expression.cpp		evaluate_prefix_expression.cpp
expedition_greedy_algo.cpp		expedition_greedy_algo.cpp
extended_euclid_algorithm.cpp		extended_euclid_algorithm.cpp
fibonacci_using_matrix_exponentiation.cpp		fibonacci_using_matrix_exponentiation.cpp
find_connected_components.cpp		find_connected_components.cpp
find_largest_word_in_sentence.cpp		find_largest_word_in_sentence.cpp
find_palindromic_subarray_sw.cpp		find_palindromic_subarray_sw.cpp
find_prime_func.cpp		find_prime_func.cpp
find_smallest_missing_positive_number.cpp		find_smallest_missing_positive_number.cpp
find_substring_occurences_kmp_algo.cpp		find_substring_occurences_kmp_algo.cpp
find_substring_occurences_rabin_karp_algo.cpp		find_substring_occurences_rabin_karp_algo.cpp
find_the_peak_element.cpp		find_the_peak_element.cpp
find_unrelated_friends.cpp		find_unrelated_friends.cpp
first_&_last_ocuurance_of_a_num_in_array.cpp		first_&_last_ocuurance_of_a_num_in_array.cpp
first_element_at_least_x.cpp		first_element_at_least_x.cpp
first_repeating_element.cpp		first_repeating_element.cpp
flatten_a_binary_tree.cpp		flatten_a_binary_tree.cpp
floyd_warshall_algo_shortest_path.cpp		floyd_warshall_algo_shortest_path.cpp
form_biggest_num_from_numeric_string.cpp		form_biggest_num_from_numeric_string.cpp
form_num_divisible_by_3_sw.cpp		form_num_divisible_by_3_sw.cpp
fractional_knapsack_greedy_algo.cpp		fractional_knapsack_greedy_algo.cpp
friends_pairing_problem_recursion.cpp		friends_pairing_problem_recursion.cpp
friends_paring_problem_dp.cpp		friends_paring_problem_dp.cpp
graph_bfs.cpp		graph_bfs.cpp
graph_dfs.cpp		graph_dfs.cpp
graph_representation.cpp		graph_representation.cpp
graph_topological_sort.cpp		graph_topological_sort.cpp
hashing_map_unordered_map.cpp		hashing_map_unordered_map.cpp
hashing_sliding_window_technique.cpp		hashing_sliding_window_technique.cpp
heap_stl_priority_queue.cpp		heap_stl_priority_queue.cpp
heapsort.cpp		heapsort.cpp
height_and_diameter_of_bt.cpp		height_and_diameter_of_bt.cpp
height_balanced_bt.cpp		height_balanced_bt.cpp
hello_world.cpp		hello_world.cpp
inclusion_exclusion_divisible.cpp		inclusion_exclusion_divisible.cpp
indian_coin_change_greedy_problem.cpp		indian_coin_change_greedy_problem.cpp
infix_to_postfix.cpp		infix_to_postfix.cpp
infix_to_prefix.cpp		infix_to_prefix.cpp
intersecting_segments_segment_tree.cpp		intersecting_segments_segment_tree.cpp
intro_to_binary_tree.cpp		intro_to_binary_tree.cpp
intro_to_bst.cpp		intro_to_bst.cpp
intro_to_linkedlist.cpp		intro_to_linkedlist.cpp
intro_to_queue.cpp		intro_to_queue.cpp
intro_to_stack.cpp		intro_to_stack.cpp
k-ordered_lcs_dp.cpp		k-ordered_lcs_dp.cpp
kadane_max_subarray_sum.cpp		kadane_max_subarray_sum.cpp
kadane_max_subarray_sum_dp.cpp		kadane_max_subarray_sum_dp.cpp

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

DSA-and-CP-0toInfinity

About

Releases

Packages

Languages

abhidevs/DSA-0toInfinity

Folders and files

Latest commit

History

Repository files navigation

DSA-and-CP-0toInfinity

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages