Mathworks EDG OA

热腾腾mathworks EDG OA 非challenge B
如同地里文章所述，网上海投后系统秒发OA，7天内做完
A.HireVue录像面试BQ
B.Hackerrank考技术层面
C.upload成绩单
//////////////////////////////////////////////
HireVue部分
1. understanding for this position and what interests you
2. programming languages and engineering domain make you fit in this position
3. Tell us about recent work experience, internship, or project that you are most proud of. Please include what your responsibilities were.
4. Are you authorized to work in the US without restriction?
Do you need sponsorship now or in the future?
Are you current on a student visa and when will your OPT start?

您好！
本帖隐藏的内容需要积分高于 50 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 50 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

==============================================

Hackerrank
Please complete: section 1 and only ONE of sections 2 or 3.

List of Sections:

Analytical Thinking and Math Puzzles
Coding (Choose from C++/Java/JavaScript/Python)
MATLAB

数学部分有遇到一个新题如下
其他都算是地里看过的
https://imgur.com/MhZowiJ

coding部分
1.
https://imgur.com/uyUXKHA
可以用bit来看
+1是一个operation; <<1也是一个operation
所以，若该数最高次为2^x，bitwise总共有y个1。总operation就是x+y

int solution(int n) {
    int count = 0, power = -1;
    while (n) {
        count += n & 1;
        n >>= 1;
        power++;
    }
    return count+power;
}



2.
https://imgur.com/EqPKWwi
Prime factorization简化版

int getIdealNums(int low, int high) {
    int res = 0;
    for(int i = low; i<=high; i++){
        int k =i;
        if(i%2 ==0) continue;
        while(k%3 ==0){
            k /=3;
        }
        while(k%5 == 0){
            k /=5;
        }
        if(k ==1){
            res++;
        }
    }
    return res;   
}


////////////////////////////////////////////
几乎不设限了，跪求加米!
几乎不设限了，跪求加米!
几乎不设限了，跪求加米!

楼主，新的math题看不清啊。。。