Skip to content
/ Competitve-Programming-and-algorithms- Public

This repository contains different competitive programming problems solutions using recursive , iterative and dynamic programming techniques .Also contains the implementation of some graph traversal , divide and conquer and greedy algorithms

1 star 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

m-and-ms/Competitve-Programming-and-algorithms-

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
LCS_G_memoized.py
LCS_G_memoized.py
 
 
LCS_OUR_MEMOIZED.py
LCS_OUR_MEMOIZED.py
 
 
README.md
README.md
 
 
a.out
a.out
 
 
add.cpp
add.cpp
 
 
bfs.py
bfs.py
 
 
bfs_diamater_tree.py
bfs_diamater_tree.py
 
 
binary_search.py
binary_search.py
 
 
break_redundant_connection.py
break_redundant_connection.py
 
 
colored_rgb_street.py
colored_rgb_street.py
 
 
comine_coins.py
comine_coins.py
 
 
count_coins_rec_2.py
count_coins_rec_2.py
 
 
count_subsets_dp.py
count_subsets_dp.py
 
 
count_unival_subtrees.py
count_unival_subtrees.py
 
 
cout_coins.cpp
cout_coins.cpp
 
 
decomp_string.py
decomp_string.py
 
 
dikstra_pq.py
dikstra_pq.py
 
 
domino.py
domino.py
 
 
fib.cpp
fib.cpp
 
 
fib_huge.cpp
fib_huge.cpp
 
 
fib_last.cpp
fib_last.cpp
 
 
fib_last_ps.cpp
fib_last_ps.cpp
 
 
fib_last_sum.cpp
fib_last_sum.cpp
 
 
fib_last_sum_a.cpp
fib_last_sum_a.cpp
 
 
fib_lcpp.cpp
fib_lcpp.cpp
 
 
fib_sum_last.py
fib_sum_last.py
 
 
flood_fill.py
flood_fill.py
 
 
forming_teams_dfs.py
forming_teams_dfs.py
 
 
fractional_knapsack.cpp
fractional_knapsack.cpp
 
 
gcd_fast.cpp
gcd_fast.cpp
 
 
gcd_n.cpp
gcd_n.cpp
 
 
generate_nCr_rec.py
generate_nCr_rec.py
 
 
genrate_binary_rec.py
genrate_binary_rec.py
 
 
invalid_parentheses_dfs.py
invalid_parentheses_dfs.py
 
 
iter-dfs.py
iter-dfs.py
 
 
jump_search.py
jump_search.py
 
 
k_divisble_subset_dp.py
k_divisble_subset_dp.py
 
 
knights_tour.py
knights_tour.py
 
 
lcm.cpp
lcm.cpp
 
 
lincsence_key_format.py
lincsence_key_format.py
 
 
longest_substring_max2_unique.py
longest_substring_max2_unique.py
 
 
m_choose_n2.py
m_choose_n2.py
 
 
max2.cpp
max2.cpp
 
 
max_depth_tree.py
max_depth_tree.py
 
 
max_dt_p.cpp
max_dt_p.cpp
 
 
max_pair.cpp
max_pair.cpp
 
 
max_path_ grid _up_down.py
max_path_ grid _up_down.py
 
 
max_path_ grid _up_down_dp.py
max_path_ grid _up_down_dp.py
 
 
max_path_rec.py
max_path_rec.py
 
 
max_prizes_ours.cpp
max_prizes_ours.cpp
 
 
max_salary_ours.cpp
max_salary_ours.cpp
 
 
max_salary_th.cpp
max_salary_th.cpp
 
 
max_sub_string_k_charchters.py
max_sub_string_k_charchters.py
 
 
maze.py
maze.py
 
 
memoized_fibonacci.py
memoized_fibonacci.py
 
 
merge_sort.py
merge_sort.py
 
 
min_cuts_from_palindrom2_palindrom.py
min_cuts_from_palindrom2_palindrom.py
 
 
min_depth_bst.py
min_depth_bst.py
 
 
min_dist_from_all_buildings_leetcode.py
min_dist_from_all_buildings_leetcode.py
 
 
moeny_change.cpp
moeny_change.cpp
 
 
my_fknapsack.cpp
my_fknapsack.cpp
 
 
points_cover_segs.cpp
points_cover_segs.cpp
 
 
print_num_permute.py
print_num_permute.py
 
 
print_palindrom_partitions.py
print_palindrom_partitions.py
 
 
print_recurse.py
print_recurse.py
 
 
quick_sort.py
quick_sort.py
 
 
rec_dfs.py
rec_dfs.py
 
 
rec_max_path.py
rec_max_path.py
 
 
rec_path_max_down_up.py
rec_path_max_down_up.py
 
 
recover_bst.py
recover_bst.py
 
 
recursive_trie.py
recursive_trie.py
 
 
remove_invalid_parenthsis.py
remove_invalid_parenthsis.py
 
 
replace_words_using_trie_leetcode.py
replace_words_using_trie_leetcode.py
 
 
robot_maze.py
robot_maze.py
 
 
shortest_path_srource_target_bfs.py
shortest_path_srource_target_bfs.py
 
 
shortest_superstring.py
shortest_superstring.py
 
 
snake_ladder_bfs.py
snake_ladder_bfs.py
 
 
string_decomp.py
string_decomp.py
 
 
string_decomp2.py
string_decomp2.py
 
 
symetric_tree_dfs.py
symetric_tree_dfs.py
 
 
symetric_tree_itre.py
symetric_tree_itre.py
 
 
trie_implementation.py
trie_implementation.py
 
 

Repository files navigation

Competitve-Programming-and-algorithms-

This repository contains different competitive programming problems solutions using recursive , iterative and dynamic programming techniques .Also contains the implementation of some graph traversal , divide and conquer and greedy algorithms

About

This repository contains different competitive programming problems solutions using recursive , iterative and dynamic programming techniques .Also contains the implementation of some graph traversal , divide and conquer and greedy algorithms

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages