This algorithm solves the Maximum-Sum-Subarray problem via Divide and Conquer in O(m*log(m))
-
Updated
Jun 19, 2019 - Python
This algorithm solves the Maximum-Sum-Subarray problem via Divide and Conquer in O(m*log(m))
Solutions to my advent of code questions 2023
Programs !!
A program that applies some functions on sparse matrices. First addition between two sparse matrices and secondly finding any 2x2 sub-matrix in which the sum of all 4 elements are greater than a variable c.
Coding Interview Practice Problems
A function that takes two arrays main Array and sub Array (along with their sizes from user) and finds how many times sub Array occurs in main Array. C++ code.
While learning C++ one must come accross these important programs , thus it is a short gist which will help you in the journey of learning C++
This repository contains Java Codes, pushed almost everyday!
An integer array is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.
Welcome to the Data Structures and Algorithms (DSA) practice repository! This repository serves as a hub for practicing and honing your skills in data structures and algorithms. It provides a collection of commonly asked DSA questions along with their solutions in various programming languages.
Largest Sum Contiguous Subarray
Finding n disjoint subarrays from an array. Project @ Design and Analysis of Algorithms
Add a description, image, and links to the subarray topic page so that developers can more easily learn about it.
To associate your repository with the subarray topic, visit your repo's landing page and select "manage topics."