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.

opencv image-processing astronomical-images subarray kadane kadane-algorithm maximum-contigeous-sum

• Updated Dec 23, 2020
• Jupyter Notebook

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.

hashing linked-list stack array recursion prefix-sum sorting-algorithms greedy-algorithms binary-search two-pointers sliding-window kadanes-algorithm prefix-sum-algorithm slowfast kadane-algorithm mergeintervals

• Updated Nov 2, 2026
• C++

Find the maximum contiguous subarray sum

leetcode problem-solving kadane-algorithm

• Updated Apr 15, 2022
• Java

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

linked-list stack math graph string matrix array trie recursion backtracking hashmap binary-search-tree bfs binary-search dp divide-and-conquer two-pointers sliding-window kadane-algorithm

• Updated Aug 5, 2025
• C++

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.

benchmarking algorithms cpp reproducible-research time-complexity dynamic-programming algorithm-analysis complexity-analysis divide-and-conquer maximum-subarray empirical-analysis kadane-algorithm

• Updated Nov 4, 2026
• TeX