因为在开始写这个博客之前,已经刷了100题了,所以现在还是有很多题目没有加进来,为了方便查找哪些没加进来,先列一个表可以比较清楚的查看,也方便给大家查找。如果有哪些题目的链接有错误,请大家留言和谅解,链多了会眼花。 # Title Category Difficulty 1528 Shuffle S
Reverse a LinkedList (easy) Reverse a Sub-list (medium) Reverse every K-element Sub-list (medium) 7. Pattern: Tree Breadth First Search,树上的BFS 这种模式基于宽搜(Breadth First Search (BFS)),适用于需要遍历一颗树。借助于队列数据结构,从而能保证树的节点按照他们的层数打印出来。打印完当前层所有...
168 Excel Sheet Column Title Easy 18.10% 169 Majority Element Easy 35.00% 170 Two Sum III - Data structure design $ Easy 24.70% 171 Excel Sheet Column Number Easy 36.50% 172 Factorial Trailing Zeroes Easy 28.40% 173 Binary Search Tree Iterator Medium 29.30% 174 Dungeon Game Hard 17.70% 175 ...
LeetCode Top 100 Liked Questions 160. Intersection of Two Linked Lists (Java版; Easy) 题目描述 Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: 1. 2. 3. begin to intersect at node c1. Example 1...
Leetcode 上有个List选项,里边有两个专题,分别是Top 100 Liked Questions和Top Interview Questions。这两个List中有很多重复的题,加起来一共150道左右。都是经典的题目,将这150道刷完基本上所有的题型都见过了,而且多数经典题目都会涉及,是提升最快的一个方法。 注意记录、总结与复习。自己写过的代码一定要保存...
Top Interview Questions Overview This is LeetCode's official curated list of Top classic interview questions to help you land your dream job. Our top interview questions are divided into the following series: Easy Collection Medium Collection Hard Collection to help you master Data Structure & Algor...
LeetCode Top Interview Questions 66. Plus One (Java版; Easy) 题目描述 Given a non-empty array of digits representing a non-negative integer, plus one to the integer. The digits are stored such that the most significant digit is at the head of the list, and each element in the array co...
2、算法上基本已经入门,Easy 可以做出来,Medium 纠结半天也能有头绪,但基础不牢,比如字符转字符串还得 Google 一下。 3、刷了几百道题后,总结了自己的解题模板,参加周赛有时候甚至可以全部完成。 4、开始以 beat 100% 作为 AC 的目标了。 就目前的算法面试大环境来说,能达到第二阶段,中小公司可以应付过去了...
Grokking the Coding Interview: Patterns for Coding Questions - Learn Interactively www.educative.io 图标 这个课程将算法题目(类似LeetCode上面的算法和数据结构题目)进行了模式分类,每个类型模式,提供了经典的题目。 (如果你需要上面这些算法课程,那么你可以使用 awesome-developer 的折扣码获得网站所有课程的额...
1332 Remove Palindromic Subsequences 76.20% Easy 1331 Rank Transform of an Array 59.80% Easy 1330 Reverse Subarray To Maximize Array Value 41.30% Hard 1329 Sort the Matrix Diagonally 83.00% Medium 1328 Break a Palindrome 52.10% Medium 1327 List the Products Ordered in a Period * 71.90% Easy 132...