查看: 874| 回复: 1
跳转到指定楼层
上一主题 下一主题
收起左侧

[其他] What are the foundations needed to learn leetcode?

全局:

2022(4-6月)-CS硕士+1-3年 | 校园招聘会| 码农类General实习@

注册一亩三分地论坛,查看更多干货!

您需要 登录 才可以下载或查看附件。没有帐号?注册账号

x
What are the foundations needed to learn leetcode?
To begin with:

With the existing resources on the market, there is no single book that can summarize the topic of LC.

Because the need for the foundation of LC is too broad, science class must learn the two courses: "data structures" and "algorithm analysis," It can cover about 70%, but not much more than that.

Simply give you the basics of what we need to know:
. .и

1. data structures

Data structures (low-level): arrays, chains, stacks, queues, trees, graphs, heaps, HashTables, etc.. ----

Data structures (high-level, the basic undergraduate can not learn): line tree, tree array, and union-find sets, dictionary tree, etc.


2. Algorithms


Algorithms (low-level): sorting algorithms (eight kinds), DFS, BFS, binary search, backtrack, Divide and Conquer, recursion, dynamic planning, topological sorting, greedy, etc. ..
..
Algorithms ( that cannot be learned in school ): Sliding window, scan line algorithm ( graphics ), Reservoir Sampling, flood fill ( graphics ), etc.

-baidu 1point3acresThe more difficult ones actually involve a lot: KMP, horse-drawn carriage, etc.. Χ


3. other knowledge. check 1point3acres for more.


This is just the algorithms and data structures, then there are other knowledge.

Bit operation (Bit), basic data structure implementation (LinkedList Deque and other implementations), some design ideas (Design), mathematical knowledge (Math), wildcard character, escape characters, The Triangle, etc.. ..

If you are using Java, actually other languages as well, Java also has some common data structures:

TreeMap, TreeSet, PriorityQueue, Deque, etc.


All the things I mentioned above are all appeared in the Leetcode questions.. Χ

To say one more point then, if it is for the interview, there are many are North American, such companies as Google Facebook, will be more:

the Dijkstra, bipartite graph, red-black tree knowledge, etc.

上一篇:请问亚麻2023 暑期招国际实习生吗?
下一篇:Akuna QR-Shanghai Math OA
全局:
《算法竞赛(清华科技大讲堂)》挑着章节看就行

补充内容 (2022-12-03 21:09 +08:00):
《算法竞赛》是新书,章节更全一点,质量相当不错。不过我个人最喜欢lyd的《算法竞赛进阶指南》
回复

使用道具 举报

您需要登录后才可以回帖 登录 | 注册账号
隐私提醒:
  • ☑ 禁止发布广告,拉群,贴个人联系方式:找人请去🔗同学同事飞友,拉群请去🔗拉群结伴,广告请去🔗跳蚤市场,和 🔗租房广告|找室友
  • ☑ 论坛内容在发帖 30 分钟内可以编辑,过后则不能删帖。为防止被骚扰甚至人肉,不要公开留微信等联系方式,如有需求请以论坛私信方式发送。
  • ☑ 干货版块可免费使用 🔗超级匿名:面经(美国面经、中国面经、数科面经、PM面经),抖包袱(美国、中国)和录取汇报、定位选校版
  • ☑ 查阅全站 🔗各种匿名方法

本版积分规则

>
快速回复 返回顶部 返回列表