因为在开始写这个博客之前,已经刷了100题了,所以现在还是有很多题目没有加进来,为了方便查找哪些没加进来,先列一个表可以比较清楚的查看,也方便给大家查找。如果有哪些题目的链接有错误,请大家留言和谅解,链多了会眼花。 # Title Category Difficulty 1528 Shuffle S
Grokking the Coding Interview: Patterns for Coding Questionswww.educative.iowww.educative.io/courses/grokking-the-coding-interview?aff=xy7W 这门课程是一个算法总结提高的课程,它把算法面试中可能遇到的题分成了各种模式,每类题各个击破。 如果想买订阅(Subscriptions)的小伙伴,则可以用ZHIHUEDU-10(...
LeetCode Top 100 Liked Questions 141. Linked List Cycle (Java版; Easy) 题目描述 Given a linked list, determine if it has a cycle in it. To represent a cycle in the given linked list, we use an integer pos which represents the position (0-indexed) in the linked list where tail conne...
第一次做; 这个计算[2,n)上素数的个数的算法叫作埃拉托色尼筛选法(Sieve of Eratosthenes); 算法思想如图 埃拉托色尼筛选法(the Sieve of Eratosthenes)简称埃氏筛法,是古希腊数学家埃拉托色尼(Eratosthenes 274B.C.～194B.C.)提出的一种筛选法。 是针对自然数列中的自然数而实施的,用于求一定...
扫码登录更便捷 +86 获取验证码 登录/ 注册 帐号密码登录 已有美国站帐号 注册或登录即代表您同意《用户协议》和《隐私协议》
所以大家不要走我这个弯路,建议有了Easy的基础之后,就分Tag刷Medium。把dfs,bfs,tree, linkedlist, sliding window, binary search, stack, dynamic programming... 各刷个十几道,就差不多会了。另外Top 100 liked questions 这个里面的题都很有意思,像 @胡津铭 建议的一样,这里面的题我也刷了三四遍。刚开始...
Input:head = [1,2,6,3,4,5,6], val = 6Output:[1,2,3,4,5] Example 2: Input:head = [], val = 1Output:[] Example 3: Input:head = [7,7,7,7], val = 7Output:[] Constraints: The number of nodes in the list is in the range4]. ...
LeetCode Top Interview Questions LeetCode Top Interview Questions https://leetcode.com/problemset/top-interview-questions/
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...
0061 Rotate List Go 27.30% Medium 0062 Unique Paths Go 48.00% Medium 0063 Unique Paths II Go 33.50% Medium 0064 Minimum Path Sum Go 47.30% Medium 0065 Valid Number 14.10% Hard 0066 Plus One Go 41.40% Easy 0067 Add Binary 39.50% Easy 0068 Text Justification 23.50% Hard 0069 ...