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.

This C++ code implements a solution to the "Maximum Subarray Problem" using Kadane's Algorithm, which efficiently finds the maximum sum of a contiguous subarray within a one-dimensional array of numbers.

Find the maximum contiguous subarray sum

This repository is managed by LeetPush extension: https://github.com/husamahmud/LeetPush