Repository navigation

max-sub

Public

About

Maximum subarray and subsequence using dynamic programming, divide and conquer and Kadane's algorithm.

cpp dynamic-programming hackerrank hackerrank-solutions kadanes-algorithm max-subsequence maximum-subarray maximum-subsequence

0 stars

1 watching

Report repository

Name		Name	Last commit message	Last commit date
.gitignore		.gitignore
README.md		README.md
main.cpp		main.cpp
max_subarr.cpp		max_subarr.cpp
max_subarr.hpp		max_subarr.hpp
max_subarr_dp.cpp		max_subarr_dp.cpp
max_subarr_dp.hpp		max_subarr_dp.hpp
max_subarr_kad.cpp		max_subarr_kad.cpp
max_subarr_kad.hpp		max_subarr_kad.hpp
max_subarr_ref.cpp		max_subarr_ref.cpp
max_subarr_ref.hpp		max_subarr_ref.hpp
max_subs.cpp		max_subs.cpp
max_subs.hpp		max_subs.hpp
memory.cpp		memory.cpp
memory.hpp		memory.hpp
support.cpp		support.cpp
support.hpp		support.hpp
user_types.hpp		user_types.hpp

Repository files navigation

max-sub

Maximum subarray and subsequence using dynamic programming, divide and conquer and Kadane's algorithm. The implementation is a solution to a problem found on HackerRank: https://www.hackerrank.com/challenges/maxsubarray/problem.

About

Maximum subarray and subsequence using dynamic programming, divide and conquer and Kadane's algorithm.

cpp dynamic-programming hackerrank hackerrank-solutions kadanes-algorithm max-subsequence maximum-subarray maximum-subsequence

0 stars

1 watching

Report repository

Releases

Packages

Contributors

Languages