Skip to content

Udayskn/DP

Repository files navigation

Dynamic Programming

Kadane: Max possible sum of any number consecutive element in an array;

circular kadane: does the same for a circular array i.e last and 1st elements of a normal array are consecutive in circular case.

kadane3_01 : Max possible sum of any number consecutive element in an array by deleting atmost one element.

LIC : find the max len of subseuence that is increasing from the given array.. longest dividing subseq is also same process.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors 2

  •  
  •  

Languages