graph.get(info[1]).add(info[0]); }for(inti=1;i<n+1;i++) dfs(i);int[] res =newint[n];for(inti=0;i < n;i++) res[i] = colored[i+1];returnres; }publicvoiddfs(intn){if(colored[n] !=0)return;int[] record =newint[5];for(intnode:graph.get(n)) record[colored[node]]=1;for(inti=0;i<record.length;i++)if(record[i]==0...
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 & Algorithms and improve your coding ...
Note: Although Number of Islands is not a tree problem, it can be represented as a graph and therefore we categorize it as a graph problem. Backtracking Here are some of the best backtracking interview questions. Letter Combinations of a Phone Number and Generate Parentheses are both great ...
Grokking the Coding Interview: Patterns for Coding Questionswww.educative.iowww.educative.io/courses/grokking-the-coding-interview?aff=xy7W 这门课程是一个算法总结提高的课程,它把算法面试中可能遇到的题分成了各种模式,每类题各个击破。 如果想买订阅(Subscriptions)的小伙伴,则可以用ZHIHUEDU-10(...
所以大家不要走我这个弯路,建议有了Easy的基础之后,就分Tag刷Medium。把dfs,bfs,tree, linkedlist, sliding window, binary search, stack, dynamic programming... 各刷个十几道,就差不多会了。另外Top 100 liked questions 这个里面的题都很有意思,像 @胡津铭 建议的一样,这里面的题我也刷了三四遍。刚开始...
27 Remove Element Easy JavaScript 28 Find the Index of the First Occurrence in a String Easy JavaScript TypeScript 29 Divide Two Integers Medium JavaScript 31 Next Permutation Medium Rust 32 Longest Valid Parentheses Hard Go 34 Find First and Last Position of Element in Sorted Array Medium JavaScr...
0323 Number of Connected Components in an Undirected Graph 62.0% Medium 0324 Wiggle Sort II Go 32.9% Medium 0325 Maximum Size Subarray Sum Equals k 49.3% Medium 0326 Power of Three Go 45.2% Easy 0327 Count of Range Sum Go 36.0% Hard 0328 Odd Even Linked List Go 60.2% Medium 03...
Clone Graph Medium 85 134. Gas Station Medium 86 135. Candy Hard 87 136. Single Number Easy 88 137. Single Number II Medium 88 138. Copy List with Random Pointer Medium 89 139. Word Break Medium 90 140. Word Break II Hard 90 141. Linked List Cycle Easy 92 142. Linked List Cycle...
下面我们就来看看Grokking the Coding Interview: Patterns for Coding Questions的分类及每个类型的经典题目: 1. Pattern: Sliding window,滑动窗口类型 经典题目: Maximum Sum Subarray of Size K (easy) Smallest Subarray with a given sum (easy) ...
Personally, I don’t find as much joy doing LeetCode questions. Rather, I work on LeetCode problems as if I am lifting weights at the gym. While I don’t enjoy lifting weights, I do like reaping the benefits of it. That’s all for today. Let me know what are you building with ...