# Minimum Deletions To Make Palindromic Sequence

easy

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.

## Constraints

1 <= length(str) <= 10000

## Format

### Input

A string

### Output

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

## Example

Sample Input

adceadfahg

### Sample Output

5