Solve Adjacent-Deletion and Sorted-Square Problems

Solve each of the following tasks. For each task, describe your intended approach and analyze the time and space complexity before writing the implementation. Task 1: Delete Adjacent Equal Pairs Given a string s, repeatedly remove any pair of adjacent equal characters until no such pair remains. Return the final stable string. Removing a pair may cause two previously separated characters to become adjacent, so the process must continue until the string contains no removable…