DP on a Sequence

One dimension: stairs, house robber, longest increasing subsequence, and the family they belong to.

0 of 39 answered

Start here

Counting the Increasing Runs

Foundation

Not triedCounting the Increasing RunsFoundation
Not triedHow many base casesFoundation
Not triedTake it or leave itFoundation
Not triedThe shape of a sequence problemFoundation
Not triedWhen one index is the whole stateFoundation
Not triedBlocks Scored by Their LargestCore
Not triedCheapest Deletions, No Equal NeighboursCore
Not triedCheapest Hops ForwardCore
Not triedFewest Clips to CoverCore
Not triedLongest Increasing SubsequenceCore
Not triedNo Two AdjacentCore
Not triedPicking k From Either EndCore
Not triedPicks That Stay k ApartCore
Not triedThe Best Alternating SumCore
Not triedThe Best Alternating Sum of a RunCore
Not triedThe Heaviest Increasing SubsequenceCore
Not triedThe Longest Chain of PairsCore
Not triedThe Longest Mountain In PlaceCore
Not triedThe Longest Zigzag RunCore
Not triedThe Widest RampCore
Not triedTwo Runs of Given LengthsCore
Not triedUp Then DownCore
Not triedWhat the increasing subsequence table holdsCore
Not triedWhere the answer sitsCore
Not triedFewest Changes to Make It IncreasingChallenge
Not triedFewest Taps for the GardenChallenge
Not triedFilling the ShelvesChallenge
Not triedHow Many Are LongestChallenge
Not triedMost Runs With a Given SumChallenge
Not triedNesting Boxes By Both SidesChallenge
Not triedRuns With a Bounded MaximumChallenge
Not triedSwaps to Sort Both RowsChallenge
Not triedThe Best Run Around a CircleChallenge
Not triedThe Best Run With One RemovalChallenge
Not triedThe Most Profitable Set of JobsChallenge
Not triedTrading With a Cap of kChallenge
Not triedWhat the running value actually meansChallenge
Not triedWhen one dimension stops being enoughChallenge
Not triedWhy the faster version is fasterChallenge