Minimum Deletions To Make Palindromic Sequence

easy
Question Solve Solutions 
1. You are given a string of characters(a-z,A-Z).
2. Find the minimum number of deletions/removals needed such that remaining characters are palindromic.

Input Format

A string

Output Format

Find the minimum number of deletions/removals. Check the sample output and question video.

Constraints

1 <= length(str) <= 10000

Example

Input
adceadfahg
Output
5
Previous
Minimum Deletions To Make Sorted Array
Next
Minimum Delta In Partitions

Related Questions

easy Is Prime easy Prime Till N easy Reverse Integer easy GCD easy Fibonacci easy Fib Till N easy Exit Point of a matrix easy Placing N Queen in a matrix easy Arranging Vowels And Consonants easy Addition Of Two Linked List easy Circular Linked List easy Sort The Absolute List easy Decimal Number From Binary Linked List easy Find the largest rectangle in a matrix easy Count Pairs Having Sum X easy Delete alternate nodes of linked list