Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[面经]-[猿辅导]-[教研产品]-[2020.04.01] #21

Open
zhaofeihao opened this issue Apr 1, 2020 · 0 comments
Open

[面经]-[猿辅导]-[教研产品]-[2020.04.01] #21

zhaofeihao opened this issue Apr 1, 2020 · 0 comments
Labels

Comments

@zhaofeihao
Copy link
Owner

一面

1. css优先级计算

2. 伪类和伪元素的区别

3. let const var 的区别

4. 两种方式实现下面的函数,并说出不同点

const p1 = new Person('zhang');
{name: 'zhang'}
p1.hello(); => zhang

5. 节流防抖概念的理解,写一个防抖

6. call、apply、bind 区别

7. 实现 Promise.all

8. 说说你的前端性能优化实践

讲讲 window.performance api

9. 写代码,求多叉树指定层级的节点数

    1
    / | \
  2   3   4
 / \  |   /|\
5  6  7  8  9 10 
       \
       11

二面

1. 基于 Promise.all 实现并发限制

2. cookie

3. 写代码,实现 plusOne 函数

一个数字123,是用链表表示的,1->2->3,现在想要对这个数字进行加1操作,实现这个函数,考虑连续进位
class ListNode {
    next,
    value
}

function plusOne(head) {
//output head
}

三面

1. 为啥离职

2. 学习过什么计算机相关的基础知识

3. 讲一下http2.0 跟 http1.1 的区别

4. 多路复用的原理

5. 滑动窗口的原理

6. 写代码

给出一个单调不降的数组 arr,和一个目标值 target
找出数组中最接近target的值所在的位置,要求 时间复杂度最优

// e.g.
arr: 1 2 2 3 4 5 6
target: 2.5
2 2 3
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

1 participant