Recently I gave OA of Microsoft and here are the questions, \n\n1) Given an array, you need to find a subsequence such that AND of that subsequence is not 0. My Approach: \nI iterate over bits and check and with the array. O(32 * N) Time, O(1) space\n\nSimilar Question: (diffrence is we need to give max length not product)\nhttps://stackoverflow.com/questions/65677628/size-of-subset-of-an-array-with-largest-bitwise-and-product\n\n2) You are given a string and a cost array, you need to delete some character from string such that no two same characters will appear next to each other. We need to minimize the cost. I did this question greedily.\n\naaaabbbaccc, [1,2,3,2,4,1,9, 5. 9, 7, 8]\n\nans = 20\n\nWaiting for results :)

Recently I gave OA of Microsoft and here are the questions, \n\n1) Given an array, you need to find a subsequence such that AND of that subsequence is not 0. My