About

This repo contains solutions for problems on Data Structure and Algorithms, from InterviewBit, LeetCode and HackerRank. Some problems are categorized topicwise as dp, graph, greedy, array, etc and others are in a random order. The complete list of problems and their source can be find in all_program_list file.

Name		Name	Last commit message	Last commit date
array		array
backtrack		backtrack
binary_search		binary_search
bit-manipulation		bit-manipulation
code-forces		code-forces
contest_test		contest_test
design		design
dp		dp
graph		graph
greedy		greedy
interviews-question-prev-years-iits		interviews-question-prev-years-iits
linked_list		linked_list
math		math
microsoft_questions_geeks.cpp		microsoft_questions_geeks.cpp
queue_stacks		queue_stacks
sql		sql
string		string
trees		trees
2d_vector_testing.cpp		2d_vector_testing.cpp
3_sums_zeros.cpp		3_sums_zeros.cpp
BST_iterator.cpp		BST_iterator.cpp
Binary_representation.cpp		Binary_representation.cpp
Insufficient_node_in_binary_tree.cpp		Insufficient_node_in_binary_tree.cpp
README.md		README.md
a.exe		a.exe
add_bold_tag_in_string.cpp		add_bold_tag_in_string.cpp
add_two_fractional_number.cpp		add_two_fractional_number.cpp
all_programs_list.md		all_programs_list.md
anagram_pairs_of_string_array.cpp		anagram_pairs_of_string_array.cpp
april_cook_off_hungarian_algo.cpp		april_cook_off_hungarian_algo.cpp
april_cook_off_making_a_meal.cpp		april_cook_off_making_a_meal.cpp
april_lunchtime_attendance.cpp		april_lunchtime_attendance.cpp
april_lunchtime_fast_food.cpp		april_lunchtime_fast_food.cpp
array_intersection3.cpp		array_intersection3.cpp
assign_cookies.cpp		assign_cookies.cpp
beautiful_pairs.cpp		beautiful_pairs.cpp
best_time_to_buy_ans_sell_stock.cpp		best_time_to_buy_ans_sell_stock.cpp
bfs_and_dfs_in_graphs.cpp		bfs_and_dfs_in_graphs.cpp
binary_tree_from_inorder_and_postorder.cpp		binary_tree_from_inorder_and_postorder.cpp
bit_difference.cpp		bit_difference.cpp
boundary_order_transversal.cpp		boundary_order_transversal.cpp
c++_tutorial.md		c++_tutorial.md
camel_case_matching.cpp		camel_case_matching.cpp
car_pooling.cpp		car_pooling.cpp
cartesian_tree.cpp		cartesian_tree.cpp
check_if_binary_tree_is_bst.cpp		check_if_binary_tree_is_bst.cpp
chinese_theorm.cpp		chinese_theorm.cpp
chocolate_distribution.cpp		chocolate_distribution.cpp
climbing_the_leaderboard.cpp		climbing_the_leaderboard.cpp
coin_change2.cpp		coin_change2.cpp
coins_in_a_line.cpp		coins_in_a_line.cpp
col_name_from_col_number_in_ms_excel.cpp		col_name_from_col_number_in_ms_excel.cpp
collect_gold_halfway.cpp		collect_gold_halfway.cpp
colorful_numbers.cpp		colorful_numbers.cpp
combinations_of_k_digit.cpp		combinations_of_k_digit.cpp
competitive_programming_code.cpp		competitive_programming_code.cpp
consecutive_1s_in_binary_represntation.cpp		consecutive_1s_in_binary_represntation.cpp
contacts.cpp		contacts.cpp
continuous_array.cpp		continuous_array.cpp
convert_array_in_zigzag_fashion.cpp		convert_array_in_zigzag_fashion.cpp
count_and_say.cpp		count_and_say.cpp
count_distinct_element_in_window.cpp		count_distinct_element_in_window.cpp
count_element_occurance_in_logn.cpp		count_element_occurance_in_logn.cpp
count_no_of_cont_subsequence_with_sum_in_range.cpp		count_no_of_cont_subsequence_with_sum_in_range.cpp
count_no_unique_binary_tree.cpp		count_no_unique_binary_tree.cpp
count_non_negative_values_in_row_and_col_sorted_natrix.cpp		count_non_negative_values_in_row_and_col_sorted_natrix.cpp
count_stepping_number.cpp		count_stepping_number.cpp
count_sub_array_with_sum_0.cpp		count_sub_array_with_sum_0.cpp
count_the_reversals.cpp		count_the_reversals.cpp
count_trailing_zeros_in_factorial.cpp		count_trailing_zeros_in_factorial.cpp
count_unique_path_in_grid.cpp		count_unique_path_in_grid.cpp
count_ways_to_form_max_heap.cpp		count_ways_to_form_max_heap.cpp
custom_sort_string.cpp		custom_sort_string.cpp
cutting_rod_to_minimize_cost.cpp		cutting_rod_to_minimize_cost.cpp
decimal_to_binary_representation.cpp		decimal_to_binary_representation.cpp
design_circular_queue_2.cpp		design_circular_queue_2.cpp
design_stack_using_queues.cpp		design_stack_using_queues.cpp
detect_loop_in_linked_list.cpp		detect_loop_in_linked_list.cpp
disjoint_set_data_structure.cpp		disjoint_set_data_structure.cpp
down_to_zero_11.cpp		down_to_zero_11.cpp
dungen_princess.cpp		dungen_princess.cpp
equal_stack.cpp		equal_stack.cpp
evaluate_prefix_and_postfix_operations.cpp		evaluate_prefix_and_postfix_operations.cpp
external_merge_sort.cpp		external_merge_sort.cpp
filling_book_shelves.cpp		filling_book_shelves.cpp
find_element_bitonic_array.cpp		find_element_bitonic_array.cpp
find_insert_position_in_sorted_array.cpp		find_insert_position_in_sorted_array.cpp
find_k_pairs_with_smallest_sum.cpp		find_k_pairs_with_smallest_sum.cpp
find_kth_max_sum_subarray.cpp		find_kth_max_sum_subarray.cpp
find_largest_possible_number.cpp		find_largest_possible_number.cpp
find_max_possible_digit_arrangement_possible_for_sum_k.cpp		find_max_possible_digit_arrangement_possible_for_sum_k.cpp
find_median_from_data_stream.cpp		find_median_from_data_stream.cpp
find_pair_of_nodes_with_given_sum_in_bst.cpp		find_pair_of_nodes_with_given_sum_in_bst.cpp
find_pairs_of_primes_number_with_given_sum.cpp		find_pairs_of_primes_number_with_given_sum.cpp
find_sequence_of_4_with_given_sum.cpp		find_sequence_of_4_with_given_sum.cpp
find_smallest_subtree_with_deep_level.cpp		find_smallest_subtree_with_deep_level.cpp
find_squares_and_rectangles_on_chessboard.cpp		find_squares_and_rectangles_on_chessboard.cpp
find_unique_element_in_linear_time_in_sorted_array.cpp		find_unique_element_in_linear_time_in_sorted_array.cpp
fitting_shelves_problem.cpp		fitting_shelves_problem.cpp
game_of_digits.cpp		game_of_digits.cpp

Latest commit

History

Folders and files

Repository files navigation

Algorithm-DS-Problems

About

Resources

Stars

Watchers

Forks

Releases

Packages

Used by

Contributors

Languages