Hi all, I recently gave Microsoft OA for SDE - 2 position. Following were the questions asked.\n\n1. Given an integer array, find the maximum integer K which appears exactly K times in the array.\n2. Given a string which only consists of \'A\', \'B\', \'C\' and \'D\' characters, return the modified string after removing all occurances of adjacent \'A\', \'B\' and adjacent \'B\', \'D\'. (So basically remove all AB, BA, CD, DC from the string).\nhttps://leetcode.com/discuss/interview-question/1463805/Microsoft-Codility-OA-or-September-2021\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/description/

Hi all, I recently gave Microsoft OA for SDE - 2 position. Following were the questions asked.\n\n1. Given an integer array, find the maximum integer K which ap