Python solutions of problems from various competitive programming platforms.

No description provided.

Step is a C++17, header-only library of STL-like algorithms and data structures

Maximum subarray problem. Brute Force, Divide and Conquer, Kadane's Algorithm

This repository contain all the codes thoroughly implemented by me in 30-Day LeetCoding Challenge.

My solution of divide and conquer method problems in hackerrank. This includes quick short, merge short, MaximmumSubArrayBruit, and a few more.

Solutions to mostly used and asked questions in Tech Interviews. Java.

All solutions to the problems in "Dynamic Programming I", the LeetCode dynamic programming study plan - I.

This project designed to analyze historical OHLC (Open-High-Low-Close) data of financial markets and predict potential breakout patterns. It utilizes the Maximum Subarray algorithm with Depth-First Search (DFS) to identify periods of significant price movement.

Solution to CLRS problems

Find the sub-array that has the greatest value when all of its elements are summed together.

Implemented algorithms from CLRS "Introduction to algorithms" book (the development is in process, so not all the algorithms are implemented, yet)

A simple program that implements four algorithms to compute the Maximum Subarray Problem

Most common algorithms for Programmers

Maximum subarray and subsequence using dynamic programming, divide and conquer and Kadane's algorithm.

Divide and conquer solution to the "Maximum Product Subarray" problem on LeetCode.

Largest Sum Contiguous Subarray Problem