## Longest Increasing Subsequence | (DP-41)

In the coming articles, we will discuss problems related to ‘Longest Increasing Subsequence’. Before proceeding further, let us understand the

## Minimum in Rotated Sorted Array

Problem Statement: Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For

## Container with most water

Problem Statement:  Given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i,

## Contains Duplicate : Check if a value appears atleast twice

Problem Statement: Given an integer array nums, return true if any value appears at least twice in the array, and return

## Word Search – Leetcode

Given an m x n grid of characters board and a string word, return true if the word exists in

## Merge k Sorted Arrays

Problem Statement: You are given an array of k linked-lists lists, each linked list is sorted in ascending order. You need

## Reorder List

Problem Statement: You are given the head of a singly linked list. The list can be represented as : L0

## Implement K stacks in a single Array

Problem Statement:  Design a data structure to implement ‘N’ stacks using a single array of size ‘S’. It should support