The idea is to start matching from last characters of both strings. If last characters match, then our task reduces to n-1 characters. If last characters don’t match, then find the position of B’s ...

/*1. You are given a string. 2. You have to compress the given string in the following two ways - First compression -> The string should be compressed such that consecutive duplicates of characters ...