IMC OA + 录视频

OA:
第一题简单的回溯
两个顶点最短路径，唯一需要注意的点就是检查当前位置是否是 perfect square

第二题十字路口堵车，求每辆车的通过时间
题目有三个具体要求，按题意疯狂if else就行

我用的是queue来分别存两个路车到达的时间，然后逐个pop
一个var 来存整体的timer
一个var 来记录前一辆通过的车来自那个路
！！！！注意在路口没有车的时候update 当前的timer，否则会超时
！！！！注意更新前一辆车通过的路

Video Interview:
BQ:
1.how would your friends describe you(45 s)


My friend would describe me as the one who seems to know everyone in the world. I don’t feel shy or embarrassed talking to strangers instead I can start the conversation pretty quickly. One time when me and my friends were at a party and we need some garlic and onions to cook which we forgot to buy, there isn’t enough time to buy and they are afraid talk to their neighbor, I took charge and friendly asked the neighbor if we can borrow something. It turns out our neighbor is very kind and I even invited him to our party. This is how I met one of my b

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

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

es not require multi thread, the cost of creating a new thread and switching between each thread is higher than just processing the program in a single thread, and also when there exist a dead lock in multithread, single thread will be faster.

3:An O(1) algorithm can not be faster (45s)
It is possible if we can decrease the constant significantly, or when input is very small and O(log(n)) could outperform O(1)
But if we assume the input is large and keep increasing, O(1) is the fastest.


整理不易，求各位老爷赏点米如果对你有帮助的话，谢谢老板们！

请问有后续了吗

请问有后续了吗

请问后序有了吗

前天收到了拒信：（

我想问一下，就是比如一辆车在第一秒到达，前面没有车，那么他的通过时间是算2，还是算1？

anoymous_user 发表于 2022-9-1 20:08
我想问一下，就是比如一辆车在第一秒到达，前面没有车，那么他的通过时间是算2，还是算1？

具体题目要求我记不清了，应该是算1

sorting是不能在o(n)完成的话说... 估计是这个答错的原因?