Using Kadane's Algorithm to find the brightest area in Astronomical images. Using concept of maximum contiguous subarray to find the area with highest sum and thus using opencv and finding the brightest area, applying on image and video.
Daily DSA practice repository containing structured solutions to LeetCode and core problem-solving topics like Arrays, Linked Lists, Two Pointers, Sliding Window, DP, Trees, and more.
Find the maximum contiguous subarray sum
This repository is managed by LeetPush extension: https://github.com/husamahmud/LeetPush
Controlled empirical study of the maximum subarray problem, from O(n³) to O(n), in 1D and 2D. Five 1D and five 2D algorithms in C++, 740,091 correctness checks, bootstrap-timed benchmarks. Preprint code and data.
To associate your repository with the kadane-algorithm topic, visit your repo's landing page and select "manage topics."