Machine Learning Interview Questions
2022-12-07 13:26:57
549KB
1
The system design interview is considered to be the most complex and most difficult technical job interview by many. Those questions are intimidating, but don’t worry. It's just that nobody has taken the time to prepare you systematically.
2022-11-15 00:33:41
9.97MB
1
leetcode题库
算法
操作系统
计算机网络
面向对象
嵌入式
数据库
工具
编码实践
:pencil:
数据结构与算法
:laptop:
操作系统
:cloud:
计算机网络
:artist_palette:
面向对象
:bullseye:
嵌入式
:floppy_disk:
数据库
:wrench:
工具
:watermelon:
编码实践
排版工具
文档站点生成器：
LaTeX公式支持：
2022-11-11 18:21:12
4.34MB
1
CISA Interview Questions and Answers学习文档手册.pdf
2022-10-18 14:05:48
696KB
从数据结构到算法，国外码农面试必备手册，真正的英文原版第六版！
Cracking the Coding Interview, 6th Edition is here to help you through this process, teaching you what you need to know and enabling you to perform at your very best. I've coached and interviewed hundreds of software engineers. The result is this book., Learn how to uncover the hints and hidden details in a question, discover how to break down a problem into manageable chunks, develop techniques to unstick yourself when stuck, learn (or re-learn) core com
Cracking the Coding Interview, 6th Edition is here to help you through this process, teaching you what you need to know and enabling you to perform at your very best. I've coached and interviewed hundreds of software engineers. The result is this book., Learn how to uncover the hints and hidden details in a question, discover how to break down a problem into manageable chunks, develop techniques to unstick yourself when stuck, learn (or re-learn) core com
2022-10-11 15:34:58
51.89MB
1
蚂蚁采访
试题一
< ! -- 给定 CSV 文件，转换成树结构 -- >
interface Person {
name : string ;
age: number ;
parent: Person [ ] ;
children: Person [ ] ;
}
const csv = `
name,age,parent
Bob,30,David
David,60,
Anna,10,Bob
` ;
试题二
实现一个前端缓存模块，模块支持设置最大容量，超过容量时采用LRU机制，主要用于缓存xhr返回的结果，避免多余的网络请求浪费，要求：
生命周期为一次页面打开
如果有相同的请求同时并行发起，要求其中一个能挂起并且等待另外一个请求返回并读取该缓存
LRU机制当缓存容量达到上限时，它应该在写入新数据之前删除最久未使用的数据值，从而为新的数据值留出空间。
试题三
在一个HTM
2022-08-07 00:52:26
66KB
1
此时让 P1 和 P2 同时移动，可以知道当 P1 移动到链表结尾时，P2 移动到第 N - K 个节点处，该位置就是倒数第 K 个节点。public List
2022-07-25 17:00:24
12KB
1
hackerrank-interview-prep：Hackerrank面试准备工具包的解决方案
2022-07-09 20:05:53
11KB
1
Grokking-the-Coding-Interview-Patterns-for-Coding-Questions
2022-07-03 14:51:58
135KB
1