Leetcode #84 Largest Rectangle in Histogram Writer: Steven, LeeDate: 1/2, WednesdayPurpose: Solving #84 Largest Rectangle in HistogramLevel: HardPercentage: 29.6% have solved this problemTime: it took me 2 hours 30 minutes :)Time Complexity: O(n^2) worst case 한국어 버전은 밑에 있습니다. * Caution * Before you read the solution that I used, you need to solve this problem by yourself * Description * Given n non-negative integers representing the histo.. #1 Stack (스택) Writer: Steven, LeeDate: 12/31, MondayPurpose: Learning #1 StackLevel: Easy to understand * 한국어는 아랫쪽에 있습니다. * * Caution * Every time you have to know what kind of data structure technique or algorithm you gonna use for some problem. Especially, It's more important than knowledge. * What is Stack? *Meaning of stack is "heap" or "pile" like a pile of books. Here is a good example to understand. th.. Introduction (소개문) * Introduction * First of all, I would like to ask you guys one question. Is it okay to make a code without any concepts for programming?? I think there is a lot of people who don't know why concepts of Data structure & Algorithm are important for programming like when I was a freshman. But it's quite difficult to code without concepts :( For example, regular expression matching I already posted.. Leetcode #45 Jump Game II Writer: Steven, LeeDate: 12/28, FridayPurpose: Solving #45 Jump Game IILevel: HardPercentage: 26.7% have solved this problemTime: it took me 1 hour :)Time Complexity: O(n) worst case 한국어 버전은 밑에 있습니다. * Caution * Before you read the solution that I used, you need to solve this problem by yourself * Description * Given an array of non-negative integers, you are initially positioned at the first in.. Leetcode #51 N-Queens Writer: Steven, LeeDate: 12/27, FridayPurpose: Solving #51 N-QueensLevel: HardPercentage: 36.6% have solved this problemTime: it took me 1 hours 30 minutes :) Dfs BackTracking programming * reference * => https://www.hackerearth.com/practice/basic-programming/recursion/recursion-and-backtracking/tutorial/ 한국어 버전은 밑에 있습니다. * Caution * Before you read the solution that I used, you need to solve th.. Leetcode #17 Letter Combinations of a Phone Number Writer: Steven, LeeDate: 12/21, FridayPurpose: Solving #17 Letter Combinations of a Phone NumberLevel: MediumPercentage: 39.3% have solved this problemTime: it took me 30 minutes :) Dfs BackTracking programming * reference * => https://www.hackerearth.com/practice/basic-programming/recursion/recursion-and-backtracking/tutorial/ 한국어 버전은 밑에 있습니다. * Caution * Before you read the solution that I use.. Leetcode #10 Regular Expression Matching Writer: Steven, LeeDate: 12/19, WednesdayPurpose: Solving #10 Regular Expression MatchingLevel: HardPercentage: 24.6% have solved this problemTime: it took me 7 hours :) 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 * Given an input st.. Interview#1 Encode&Decode (Facebook) Writer: Steven, LeeDate: 12/17, MondayPurpose: Solving #1 Encode&DecodeLevel: EasyFrom: Facebook 한국어 버전은 밑에 있습니다. Caution1: Before you read the solution that I used, you need to solve this problem by yourself Description: Given the mapping a = 1, b = 2, ... z = 26, and an encoded message. Count the number of ways it can be decoded. For example, the message '111' would give 3, since it could be d.. 이전 1 2 3 다음
