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.

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

Basic data-structure implementations in Swift.

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

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

DSA Interview Prep: A comprehensive collection of Data Structures and Algorithms (DSA) interview problems and their solutions, designed to help candidates prepare effectively for technical interviews. This repository includes a variety of problems and solutions in multiple programming languages, making it a valuable resource for software engineers.

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

This repo contains a collections of Algorithms and Data Structures questions which are usually asked for coding interviews. The implementation is done using Java.

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".

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

Arrays Practice Problems

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

Solutions for problem solving questions from Leetcode/Hackerrank/Codechef

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

Largest Sum Contiguous Subarray