Microsoft OA - SDE 2

Round 1

Questions:

1. Given an integer array, find the maximum integer K which appears exactly K times in the array.
2. Given a string which only consists of 'A', 'B', 'C' and 'D' characters, return the modified string after removing all occurrences of adjacent 'A', 'B' and adjacent 'B', 'D'. (So basically remove all AB, BA, CD, DC from the string).