Ruby implementation of Algorithms,Data-structures and programming challenges

Data Structures and Algorithms implementation in Python

Angular application with an interactive interface to visualise Kadane's Algorithm using Javascript Generators. Supports step by step execution. Deployed on AWS Amplify.

This github repo serves to educate any wonderer who comes upon this page of essential leetcode questions any programmer ought to know.

Basic data-structure implementations in Swift.

Solutions of various classical & standard interview and competitive programming questions, and CSES problem set.

A collection of popular algorithms implemented in Go.

This document presents the Striver SDE Sheet, designed to facilitate DSA (Data Structures and Algorithms) practice and learning. It provides comprehensive solutions for each question, allowing for subsequent review and efficient revision in preparation for interviews or technical assessments.

Kadane's algorithm

An enhanced version of the Kadane Algorithm. Now, it also returns the range of maximum summing array apart from that sum.

Dynamic Programming is a paradigm of algorithm design in which an optimization problem is solved by a combination of achieving sub-problem solutions and appearing to the "principle of optimality".

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

This folder contains Problems on Kadane's Algorithm from various platforms written in cpp

A dynamic programming algorithm used to find the maximum subarray sum in an array of integers.

Largest Sum Contiguous Subarray.

Arrays Practice Problems

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

Working at home

Solutions for problem solving questions from Leetcode/Hackerrank/Codechef