Question

Microsoft | OA Coding Questions and Solutions | Set - 80 | 2022

Answer 1

1. https://leetcode.com/problems/sign-of-the-product-of-an-array/
2. https://leetcode.com/discuss/interview-question/1915190/Microsoft-or-OA-or-Redmond-WA-or-Get-Maximum-Distance-of-Same-Elements-in-an-Array
3. similar to https://leetcode.com/problems/remove-digit-from-number-to-maximize-result/

 

Answer 2

public int biggerRemove(int num, int digit) {
 boolean isNeg = false;
 if(num<0) {
  isNeg = true;
  num*=-1;
 }
 String numString = String.valueOf(num);
 char digitChar = (char)(digit + '0');
 int n = numString.length();
 int lastPos = -1;
 for(int i=0; i<n; i++) {
  char c1 = numString.charAt(i);
  if(c1!=digitChar) continue;
  lastPos = i;
  if(i+1>=n) break;
  char c2 = numString.charAt(i+1);
  if(!isNeg && c1<c2) {
   return Integer.valueOf(numString.substring(0,i)+numString.substring(i+1,n));
  }
  if(isNeg && c1>c2) {
   return -1*Integer.valueOf(numString.substring(0,i)+numString.substring(i+1,n));
  }
 }
 int ans = lastPos==n-1? Integer.valueOf(numString.substring(0,lastPos)) : Integer.valueOf(numString.substring(0,lastPos)+numString.substring(lastPos+1,n));
 return isNeg? -1*ans : ans;
}

Answer 3

class Solution
{

public:
    int removeOneFive(int N)
    {
        string str = to_string(N);
        int mx = -999999;
        for (int i = 0; i < str.length(); ++i)
        {
            if (str[i] == '5')
            {
                auto n = str.substr(0, i) + str.substr(i + 1);
                mx = max(mx, stoi(n));
            }
        }
        return mx;
    }
};

Answer 4

Solution for the remove one five problem

 

def removeOneFive(num):
    num = str(num)
    numLen = len(num)
    
    for i in range(numLen):
        if num[i] == "-": continue
    
        n = int(num[i])
        if num[0] != "-" and n == 5 and i < numLen - 1 and int(num[i + 1]) >= 5:
            return int(num[:i] + num[i + 1:])
        elif num[0] == "-" and n == 5 and i < numLen - 1 and int(num[i + 1]) <= 5:
            return int(num[:i] + num[i + 1:])
    
    indexOfRemovedFive = num.find("5") if num[0] == '-' else num.rindex("5")
    return int(num[: indexOfRemovedFive] + num[indexOfRemovedFive + 1:])

Answer 5

Solution for above remove one five problem

 

def removeOneFive(number):
    max_num = float("-inf")
    number = str(number)
    for i, c in enumerate(number):
        if c == '-': continue
        if c == '5':
            newnum = int(number[:i] + number[i+1:])
            max_num = max(newnum, max_num)
    return str(max_num)