Vidyalelo
Data Structure · Q285

Dynamic Programming in Data Structures

Programming · Data Structure · question 285

Q285

In which of the following cases the minimum no of insertions to form palindrome is maximum?

A.
String of length one
B.
String with all same characters
C.
Palindromic string
D.
Non palindromic string
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board