Question

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

Answer 1

Was given 2 questions and 60 mins to submit:

 

1.  

   

    

2.  

   https://leetcode.com/problems/count-good-nodes-in-binary-tree

Answer 2

First question was asked in a contest recently.
It can be done easily
problem link: https://leetcode.com/problems/remove-digit-from-number-to-maximize-result/

Answer 3

C++ Solution

 

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;
    }
};