1Longest Increasing SubsequenceMediumArrayBinary SearchDynamic Programming
Solve → 2Number of Longest Increasing SubsequenceMediumArrayDynamic ProgrammingBinary Indexed Tree
Solve → 3Rotating the BoxMediumArrayTwo PointersMatrix
Solve → 4Find Peak ElementMediumArrayBinary Search
Solve → 5Longest Increasing SubsequenceMediumArrayBinary SearchDynamic Programming
Solve → 6Number of Longest Increasing SubsequenceMediumArrayDynamic ProgrammingBinary Indexed Tree
Solve → 7Rotating the BoxMediumArrayTwo PointersMatrix
Solve → 8Find Peak ElementMediumArrayBinary Search
Solve →