My Codes and Solutions to coding interview problems on LeetCode, AlgoExpert, Educative and other interview preparation websites

React-based customizable style table or list components that support event and callback functions.

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.

30 Days of Code Challenge

Practice Questions

It finds the maximum sum of a continuous subarray in a given array of integers.

Back end array, declared as ordinary byte array (8-bits). But internal datastructure managed as a 'collection' of bit-subarrays:

Finding n disjoint subarrays from an array. Project @ Design and Analysis of Algorithms

Easily generate subsequences from a provided map, array, or string input.

Create an iterator which iterates over each subarray in a stack of subarrays.

Create an iterator which iterates over each subarray in a stack of subarrays according to a list of specified stack dimensions.

Maximum Subarray Problem - Algorithm

This algorithm solves the Maximum-Sum-Subarray problem via Divide and Conquer in O(m*log(m))