Tutorialspoint.dev
Welcome To Tutorialspoint.dev
Officially launched 18th May 2019
Dynamic Programming LIS Dynamic Programming

Longest Increasing Subsequence DP-3

We have discussed Overlapping Subproblems and Optimal Substructure properties. Let us discuss Longest Increasing Subsequence (LIS) problem as an example problem tha...
Dynamic Programming Strings LCS

Longest Common Subsequence DP-4

We have discussed Overlapping Subproblems and Optimal Substructure properties in Set 1 and Set 2 respectively. We also discussed one example problem in Set 3. Let us...
Strings subsequence Strings

Given a number as a string, find the number of contiguous subsequences which recursively add up to 9

Given a number as a string, write a function to find the number of substrings (or contiguous subsequences) of the given string which recursively add up to 9. For exa...
Arrays LIS Arrays

Longest Monotonically Increasing Subsequence Size (N log N): Simple implementation

Given an array of random numbers, find longest monotonically increasing subsequence (LIS) in the array. If you want to understand the O(NlogN) approach, it’s e...
Strings Accolite subsequence

Given two strings, find if first string is a subsequence of second

Given two strings str1 and str2, find if str1 is a subsequence of str2. A subsequence is a sequence that can be derived from another sequence by deleting some element...
Dynamic Programming Strings LCS

Longest Common Subsequence DP-4

We have discussed Overlapping Subproblems and Optimal Substructure properties in Set 1 and Set 2 respectively. We also discussed one example problem in Set 3. Let us...
Dynamic Programming LCS Dynamic Programming

Longest Repeated Subsequence

Given a string, print the longest repeating subsequence such that the two subsequence don’t have same string character at same position, i.e., any i’th ...
Arrays Dynamic Programming Amazon

Maximum Sum Increasing Subsequence DP-14

Given an array of n positive integers. Write a program to find the sum of maximum sum subsequence of the given array such that the integers in the subsequence are sor...
Arrays Dynamic Programming subsequence

Count all subsequences having product less than K

Given a non negative array, find the number of subsequences having product smaller than K. Examples: Input : [1, 2, 3, 4] k = 10 Output :11 The subsequences...
Dynamic Programming LIS Dynamic Programming

Longest Increasing Subsequence DP-3

We have discussed Overlapping Subproblems and Optimal Substructure properties. Let us discuss Longest Increasing Subsequence (LIS) problem as an example problem tha...

Subscribe to Our Newsletter