Redian新闻
>
M家intern interview都会面什么?
avatar
s*n
2
phone interview.
投的Software Development Intern
coordinator说要prepare to respond to behavioral questions.
会有什么behavioral问题呢?
avatar
M*s
3
老婆饼

【在 w*********s 的大作中提到】
: 比起广式,我还是偏爱苏式月饼
avatar
p*i
4
上次来我学校听同学说好像就两道coding 题:
1. find the depth of a tree
2. check whether a linked list is circular or not.
avatar
n*4
5
just a little practice
1) find the depth of a tree
struct node {
int val;
node * firstChild;
node * nextSibling;
}
int depth(node * tree) {
int maxDepth=0;
node * p;
if (tree==NULL) return 0;
p = tree->firstChild;
while (p) {
maxDepth = max(depth(p),maxDepth);
p=p->nextSibling;
}
return maxDepth;
}
// time complexity: O(N) N the node number of the tree
// space complexity: O(1)
2) check whether a linked list is circular or not.
struct node {
int val;
node * next;
}
bool detectCircular(node * list) {
node * p1=list, * p2=list;
if (!list || !list->next) return false;
while (p2->next) {
p1=p1->next;
p2=p2->next->next;
if (p1==p2) return true;
}
return false;
}
avatar
m*y
6
why ms
which product of ms do you like? why?
what's your biggest challenge
how to test a keyboard

【在 s***n 的大作中提到】
: phone interview.
: 投的Software Development Intern
: coordinator说要prepare to respond to behavioral questions.
: 会有什么behavioral问题呢?
:

相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。