Tutorials
Courses
Go Premium

Similar Topics

Web Technologies32.1K+ articles

DSA20.0K+ articles

Misc7.8K+ articles

Mathematical5.1K+ articles

Arrays4.2K+ articles

Dynamic Programming1.1K+ articles

Searching1.0K+ articles

Microsoft811+ articles

Binary Search530+ articles

subsequence434+ articles

LIS

61 posts

DP Standard Problem Variations

Last Updated: 23 July 2025

When we solve Dynamic Programming problems, we try to find a pattern by matching pattern with a standard DP problem. This is generally recommended to solve new DP problems...read more

Dynamic Programming

binomial coefficient

Minimum number of strictly decreasing subsequences

Last Updated: 23 July 2025

Given an array arr[] of size N. The task is to split the array into minimum number of strictly decreasing subsequences. Calculate the minimum number of subsequences we can...read more

Dynamic Programming

Minimizing and Maximizing longest Increasing Subsequence (LIS)

Last Updated: 23 July 2025

Given a string S of length n-1, consisting of characters '' and '' only. The ith character is the comparison result between the ith element and the (i+1)th element of the ...read more

Geeks Premier League 2023

Minimum number of operations required to make all the elements positive

Last Updated: 04 April 2024

Given an array A[] of length N. You can apply the below operation:Choose an index i such that (i+1) element exists. After that choose any number X (positive or negative). ...read more

CPP-Competitive-Programming

Geeks Premier League 2023

Automating File Movement on your system test

Last Updated: 23 July 2025

111 Imagine a situation like this: You have a folder containing files of multiple types liketxt,mp3,etc. You decide to clean up this mess and organize them in a way that ...read more

article_image

Interview Experiences

time complexity

TCS-coding-questions

Find heaviest increasing Subsequence with maximum sum in a String

Last Updated: 23 July 2025

Given a string s and an array arr[] representing the weights of each character in the string, the task is to find the heaviest increasing subsequence with the maximum sum ...read more

Generate a N length Permutation having equal sized LIS from both ends

Last Updated: 23 July 2025

Given an integer N, the task is to generate a permutation of elements in the range [1, N] in such order that the length of LIS from starting is equal to LIS from the end o...read more

Longest Increasing Subsequence in given Linked List

Last Updated: 23 July 2025

Given a sequence of numbers in the form of a linked list lis. Find the length of the Longest Increasing Subsequence(LIS) of the given Linked List.Examples:Input: list = 3-...read more

Dynamic Programming

C Program to Find the Longest Bitonic Subsequence

Last Updated: 23 July 2025

Given an array arr[0 ... n-1] containing n positive integers, a subsequence of arr[] is called Bitonic if it is first increasing, then decreasing. Write a function that ta...read more

Java Program to Find the Longest Bitonic Subsequence

Last Updated: 23 July 2025

Given an array arr[0 ... n-1] containing n positive integers, a subsequence of arr[] is called Bitonic if it is first increasing, then decreasing. Write a function that ta...read more

Python Program to Find the Longest Bitonic Subsequence

Last Updated: 23 July 2025

Given an array arr[0 ... n-1] containing n positive integers, a subsequence of arr[] is called Bitonic if it is first increasing, then decreasing. Write a function that ta...read more

PHP Program to Find the Longest Bitonic Subsequence

Last Updated: 23 July 2025

Given an array arr[0 ... n-1] containing n positive integers, a subsequence of arr[] is called Bitonic if it is first increasing, then decreasing. Write a function that ta...read more

Javascript Program to Find the Longest Bitonic Subsequence | DP-15

Last Updated: 23 July 2025

Given an array arr[0 ... n-1] containing n positive integers, a subsequence of arr[] is called Bitonic if it is first increasing, then decreasing. Write a function that ta...read more

Length of Longest Increasing Subsequences (LIS) using Segment Tree

Last Updated: 23 July 2025

Given an array arr[] of size N, the task is to count the number of longest increasing subsequences present in the given array.Example:Input: arr[] = {2, 2, 2, 2, 2}Output:...read more

Dynamic Programming

Advanced Data Structure

Longest non-decreasing subsequence having difference between adjacent elements less than D

Last Updated: 23 July 2025

Given an array arr[] of N integers and an integer D, the task is to find the length of the longest non-decreasing subsequence such that the difference between every adjace...read more

Dynamic Programming