Freaks City

Problem A Compute the sum \(\sum_{i=1}^{n} i = \binom{n+1}{2}\). Problem B Statement: Given a string, process it from left to right. Whenever a character B is encountered, it removes itself and the character immediately to its right (if any). Output the final remaining string. Solution: Use a stack-like approach: iterate over the input and push ...