Question

Problem Statement
1
2.
Tokyo finds that her boyfriend Rhio is cheating on him and she is
in a fit of rage. She wants to destroy Rhio before exiting his life.
Rhio has some crucial information stored with him in the form of
strings. Tokyo knows that if Rhio loses the data, it would be a
substantial loss for him so she decides to delete the data.
Now, it takes m operations to delete an m digit number. She
does not have this much of time so, she asks her guardian angel,
the Professor to think of a way out.
He devises a method which says that she can delete parts of the
number that have same digits consecutively i.e in one go. She
could even concatenate the adjacent strings and delete them as
a complete number if the above condition is satisfied.
Now, she wants to know the minimum number of operations
needed to delete all the data using the method. You need to help
her to do so.
Given n positive integers, find the minimum number of
operations required to delete all of them
• 1 STS 100
. 1sns 30
• 15 Si < 1010​

Answer 1

Answer:

hmmmmmmmmm mmmmmmm.mmmmm