Longest Repeating Subsequence

medium

Dynamic Programming

Question Solve Solutions

1. You are given a string str.
2. You have to find the length of longest subsequence which is appearing twice in the string.
3. Every ith character in both the subsequences must have different indices in the original string.

Input Format

A string str

Output Format

A number representing the length of longest repeating subsequence.

Constraints

1 < length of strings str <= 2000

Example

Input

abcdgh

Output

Wildcard Pattern Matching

Kadane's Algorithm

Related Questions

easy Super Ugly Number easy Burst Balloons easy Cherry Pickup easy Regular Expression Matching easy Rod Cutting easy Russian Doll Envelopes easy Scramble String easy Temple Offerings easy Word Break easy Optimal Strategy For A Game easy Longest Bitonic Subsequence easy Count Palindromic Subsequences easy Longest Common Subsequence easy Longest Common Substring easy Longest Increasing Subsequence easy Distinct Transformations