Foundational algorithms, with visualizations, to simplify learning
-
Updated
Nov 21, 2025 - JavaScript
Foundational algorithms, with visualizations, to simplify learning
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.
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.
Some of the famous Named Algorithms
Collection of solutions for simple interview problems in javascript
LeetCode||Random Contest Problems
Write an efficient program to find the sum of contiguous subarray within a one-dimensional array of numbers which has the largest sum
Implementations for various string and bit manipulation algorithms.
Add a description, image, and links to the kadane topic page so that developers can more easily learn about it.
To associate your repository with the kadane topic, visit your repo's landing page and select "manage topics."