text: Check if the first and last characters are same . On the basis of the comparison result , decide which subrpoblem ( s ) to call
code: return ( str [ l ] == str [ h ] ) ? findMinInsertions ( str , l + 1 , h - 1 ) : ( min ( findMinInsertions ( str , l , h - 1 ) , findMinInsertions ( str , l + 1 , h ) ) + 1 ) ; }