Data Structure and Algorithm

Here you will find some basic implementations and codes related to data structures

Name		Name	Last commit message	Last commit date
Latest commit History 124 Commits
01_knapsack_problem.cpp		01_knapsack_problem.cpp
BST_to_min_heap.cpp		BST_to_min_heap.cpp
Deepest_leaves_sum.cpp		Deepest_leaves_sum.cpp
MaxDepth_Binary_Tree.cpp		MaxDepth_Binary_Tree.cpp
Minimise_the_maximum_difference_between_heights.cpp		Minimise_the_maximum_difference_between_heights.cpp
N_Queen_problem(backtracking).cpp		N_Queen_problem(backtracking).cpp
Partition_List.cpp		Partition_List.cpp
Print_anagrams_together.cpp		Print_anagrams_together.cpp
README.md		README.md
Reverse_string.cpp		Reverse_string.cpp
SieveOfEratosthenes.txt		SieveOfEratosthenes.txt
activity_selection_N_meetings.cpp		activity_selection_N_meetings.cpp
array_subset_of_another_array.cpp		array_subset_of_another_array.cpp
bellman_ford_algorithm_graph.cpp		bellman_ford_algorithm_graph.cpp
best_time_to_buy_and_sell.cpp		best_time_to_buy_and_sell.cpp
binarytree_to_bst.cpp		binarytree_to_bst.cpp
breadth_first_search_graph.cpp		breadth_first_search_graph.cpp
check_cycle_linked_list.cpp		check_cycle_linked_list.cpp
check_height_balanced_binarytree.cpp		check_height_balanced_binarytree.cpp
check_if_string_is_valid_shuffle_of_two_strings.cpp		check_if_string_is_valid_shuffle_of_two_strings.cpp
check_if_strings_are_rotations_of_each_other.cpp		check_if_strings_are_rotations_of_each_other.cpp
common_elements_in_3_sorted_array.cpp		common_elements_in_3_sorted_array.cpp
contigous_subarray_with_max_sum.cpp		contigous_subarray_with_max_sum.cpp
count nodes in linked list.cpp		count nodes in linked list.cpp
count_and_say.cpp		count_and_say.cpp
count_intersection_between_two_arrays.cpp		count_intersection_between_two_arrays.cpp
count_inversions.cpp		count_inversions.cpp
count_pairs_with_given_sum.cpp		count_pairs_with_given_sum.cpp
count_primes_till_n.cpp		count_primes_till_n.cpp
creating a linked list.cpp		creating a linked list.cpp
creating_a_graph.cpp		creating_a_graph.cpp
delete_node_from_BST.cpp		delete_node_from_BST.cpp
delete_node_without_head_pointer.cpp		delete_node_without_head_pointer.cpp
delete_nodes_greater_than_k_in_BST.cpp		delete_nodes_greater_than_k_in_BST.cpp
delete_nthNode_from_last_linkedlist.cpp		delete_nthNode_from_last_linkedlist.cpp
depth_first_search_graph.cpp		depth_first_search_graph.cpp
diameter_of_tree.cpp		diameter_of_tree.cpp
distinct elements using inplace algo		distinct elements using inplace algo
duplicates_in_string.cpp		duplicates_in_string.cpp
euclids_algo.cpp		euclids_algo.cpp
factorial_of_large_no.cpp		factorial_of_large_no.cpp
find_duplicate_number.cpp		find_duplicate_number.cpp
first_and_last_occurence_of_x.cpp		first_and_last_occurence_of_x.cpp
flatten_binary_tree_to_linked_list.cpp		flatten_binary_tree_to_linked_list.cpp
fractional_knapsack_probkem.cpp		fractional_knapsack_probkem.cpp
generate_parentheses.cpp		generate_parentheses.cpp
hamiltonian_cycle.cpp		hamiltonian_cycle.cpp
inorder_traversal_in_tree.cpp		inorder_traversal_in_tree.cpp
inserting node in middle of linked list.cpp		inserting node in middle of linked list.cpp
insertion_sort.cpp		insertion_sort.cpp
job_sequencing_problem.cpp		job_sequencing_problem.cpp
knight_tour_problem(backtracking).cpp		knight_tour_problem(backtracking).cpp
kth_smallest_element_using_priority_queue.cpp		kth_smallest_element_using_priority_queue.cpp
largest_sub_BST.cpp		largest_sub_BST.cpp
left_view_of_tree.cpp		left_view_of_tree.cpp
level_order_traversal.cpp		level_order_traversal.cpp
longest_common_subsequence.cpp		longest_common_subsequence.cpp
longest_consecutive_subsequence.cpp		longest_consecutive_subsequence.cpp
max_array_sum_after_k_negations.cpp		max_array_sum_after_k_negations.cpp
max_min_array.cpp		max_min_array.cpp
max_product_subarray.cpp		max_product_subarray.cpp
max_profit_by_buying_selling_atmost_two_transactions.cpp		max_profit_by_buying_selling_atmost_two_transactions.cpp
maximum_product_subarray.cpp		maximum_product_subarray.cpp
median_in_row_wise_sorted_matrix.cpp		median_in_row_wise_sorted_matrix.cpp
merge_sort.cpp		merge_sort.cpp
merge_two_sorted_array.cpp		merge_two_sorted_array.cpp
merge_two_sorted_linkedlist.cpp		merge_two_sorted_linkedlist.cpp
middle_linked_list_single_pass.cpp		middle_linked_list_single_pass.cpp
min_product_subset_array.cpp		min_product_subset_array.cpp
min_value_in_BST.cpp		min_value_in_BST.cpp
minimum_jumps_to_reach_end_array.cpp		minimum_jumps_to_reach_end_array.cpp
mirror_inorder_tree.cpp		mirror_inorder_tree.cpp
mirror_tree_conversion.cpp		mirror_tree_conversion.cpp
modular_exponentiation_for_large_numbers.cpp		modular_exponentiation_for_large_numbers.cpp
n-ary_tree_preorder_traversal.cpp		n-ary_tree_preorder_traversal.cpp
next_permutation.cpp		next_permutation.cpp
nth fibonacci using dynamic programming(memoization).cpp		nth fibonacci using dynamic programming(memoization).cpp
pattern_matching_naive_approach.cpp		pattern_matching_naive_approach.cpp
postOrder_traversal(iterative).cpp		postOrder_traversal(iterative).cpp
pots_of_gold_game.cpp		pots_of_gold_game.cpp
power_set_in_lexicographic_order.cpp		power_set_in_lexicographic_order.cpp
preorder_to_postorder,cpp		preorder_to_postorder,cpp
preorder_traversal(iterative).cpp		preorder_traversal(iterative).cpp
printing elements of a linked list.cpp		printing elements of a linked list.cpp
queue_using_array.cpp		queue_using_array.cpp
quick_sort.cpp		quick_sort.cpp
rat_in_maze(backtracking).cpp		rat_in_maze(backtracking).cpp
rearrange_elements_in_alternating_positive_negative.cpp		rearrange_elements_in_alternating_positive_negative.cpp
reverse_level_order_traversal.cpp		reverse_level_order_traversal.cpp
reverse_linked_list_iterative.cpp		reverse_linked_list_iterative.cpp
right_rotate_matrix.cpp		right_rotate_matrix.cpp
right_view_of_tree.cpp		right_view_of_tree.cpp
rotate array in O(1) space complexity.cpp		rotate array in O(1) space complexity.cpp
row_with_max_1.cpp		row_with_max_1.cpp
same_tree.cpp		same_tree.cpp
search_in_2d_matrix.cpp		search_in_2d_matrix.cpp
search_in_row_column_sorted_matrix.cpp		search_in_row_column_sorted_matrix.cpp
search_node_in_bst.cpp		search_node_in_bst.cpp
segregate_0and1_array.cpp		segregate_0and1_array.cpp
selection_sort.cpp		selection_sort.cpp

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Data Structure and Algorithm

About

Releases

Packages

Contributors 2

Languages

Abhinav-3009/DSA_Codes

Folders and files

Latest commit

History

Repository files navigation

Data Structure and Algorithm

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Contributors 2

Languages

Packages