Tree #2 Binary Tree to DLL Writer: Steven, LeeDate: 4/12, FridayPurpose: Binary Tree to DLLTopic: Linked List, Tree Level: HardPercentage: 41.34% have solved this problemTime: it took me 20 minutes :)Time Complexity: O(n) worst caseRuntime: 28 ms 한국어 버전은 밑에 있습니다. * Caution * Before you read the solution that I used, you need to solve this problem by yourself * Description * Given a Binary Tree (BT), convert it to a Doubly.. Tree #1 Count Number of SubTrees having given Sum Writer: Steven, LeeDate: 4/10, WednesdayPurpose: Count Number of SubTrees having given SumTopic: Tree, Recursion Level: MediumPercentage: 57.88% have solved this problemTime: it took me 30 minutes :)Time Complexity: O(n) worst caseRuntime: 13 ms 한국어 버전은 밑에 있습니다. * Caution * Before you read the solution that I used, you need to solve this problem by yourself * Description * Given a binary tree co.. Google #5 Replace O's with X's Writer: Steven, LeeDate: 4/8, MondayPurpose: Solving Replace O's with X'sTopic: Graph, Matrix, Recursion Level: MediumPercentage: 20.83% have solved this problemTime: it took me 30 minutes :)Time Complexity: O(n^2) worst caseRuntime: 11 ms 한국어 버전은 밑에 있습니다. * Caution * Before you read the solution that I used, you need to solve this problem by yourself * Description * Given a matrix of size N x M.. Google #4 Edit Distance Writer: Steven, Lee Date: 4/3, Wednesday Purpose: Solving #72 Edit Distance (Dynamic Programming) Level: Hard Percentage: 36.9% have solved this problem Time: it took me an 1 hour :) Time Complexity: O(n^2) worst case Runtime: 4 ms, faster than 96.00% of Java submissions 한국어 버전은 밑에 있습니다. * Caution * Before you read the solution that I used, you need to solve this problem by yourself * Descriptio.. Google #3 Ugly Numbers Writer: Steven, Lee Date: 4/2, Tuesday Purpose: Solving #264 Ugly Number II (Dynamic Programming) Level: Medium Percentage: 35.8% have solved this problem Time: it took me an 1 hour :) Time Complexity: O(n) worst case Runtime: 2 ms, faster than 99.71% of Java submissions 한국어 버전은 밑에 있습니다. * Caution * Before you read the solution that I used, you need to solve this problem by yourself * Descriptio.. Google #2 Number of Islands Writer: Steven, LeeDate: 1/27, SundayPurpose: Solving #200 Number of Islands Level: MediumPercentage: 39.7% have solved this problemTime: it took me 30 minutes :)Time Complexity: O(n^2) worst caseRuntime: 4 ms, faster than 70.04% of Java submissions *The frequency of the problem that appears in the real interviews is more than 10% in 6 months * 한국어 버전은 밑에 있습니다. * Caution * Before you read the so.. Google #1 Longest Substring with At Most Two Distinct Characters Writer: Steven, LeeDate: 1/23, WednesdayPurpose: Solving #174 Longest Substring with At Most Two Distinct Characters Level: HardPercentage: 45.6% have solved this problemTime: it took me 30 minutes :)Time Complexity: O(n) worst caseRuntime: 2 ms, faster than 91.63% of Java online submissions *The frequency of the problem that appears in the real interviews is more than 50% in 6 months * 한국어 버전은 .. Leetcode #174 Dungeon Game Writer: Steven, LeeDate: 1/18, FridayPurpose: Solving #174 Dungeon GameLevel: HardPercentage: 26.1% have solved this problemTime: it took me 7 hours :)Time Complexity: O(n^2) worst case Dynamic programming * reference * => https://www.youtube.com/watch?v=vYquumk4nWw 한국어 버전은 밑에 있습니다. * Caution * Before you read the solution that I used, you need to solve this problem by yourself * Description * T.. 이전 1 2 3 다음
