Facebook / Eng tech lead Dec 30, 2018  68 Comments   New Year Gift to every fellow time-constrained engineer out there looking for a job, here's a list of the best LeetCode questions that teach you core concepts and techniques for each category/type…

LeetCode面试常见100题( TOP 100 Liked Questions) 置顶 2018年07月16日 11:25:22 lanyu_01 阅读数 9704更多 分类专栏: 面试编程题真题合集 常见算法问题 LeetCode试题 LeetCode常见试题   版权声明:本文为博主原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接和本声明. 本文链接:https://blog.csdn.net/lanyu_01/article/details/81062232 这篇…

[LeetCode] Top 100 Liked Questions # Title Acceptance Difficulty 1 Two Sum 38.80% Easy 2 Add Two Numbers 29.10% Medium 3 Longest Substring Without Repeating Characters 25.00% Medium 4 Median of Two Sorted Arrays 23.70% Hard 5 Longest Palindromic Subs…

All LeetCode Questions List(Part of Answers, still updating) 题目汇总及部分答案(持续更新中) Leetcode problems classified by company 题目按公司分类(Last updated: October 2, 2017) .   Top Interview Questions # Title Difficulty Acceptance 1 Two Sum Medium 17.70% 2 Add Two N…

leetcode go语言版本,主要为了熟悉下语言 1. Two Sum 双指针版本, O(NlogN) func twoSum(nums []int, target int) []int { valResult := []int{} indexResult := []int{} i := 0 j := len(nums) - 1 temp := make([]int, len(nums)) copy(temp, nums) sort.Ints(temp) for i < j { if temp…

因为在开始写这个博客之前,已经刷了100题了,所以现在还是有很多题目没有加进来,为了方便查找哪些没加进来,先列一个表可以比较清楚的查看,也方便给大家查找.如果有哪些题目的链接有错误,请大家留言和谅解,链多了会眼花.  # Title Category Difficulty  697  Degree of an Array  Algorithms  Easy  695  Max Area of Island  Algorithms  Easy  674  Longest Continuous In…

Binary Search T(n) = T(n/2) + O(1)   =>    T(n) = O(lg n) proof: 如果能用iterable , 就用while loop, 可以防止用recursion的时候stack overflow( process in Linux is 8Mb), stack room is static for each process. (堆空间, heap room 是内存, 是动态的.)层数越多,存储更多中间/临时变量,最终超过系统配的stack空…

Pre: node 先,                      Inorder:   node in,           Postorder:   node 最后 PreOrder Inorder PostOrder node-> left -> right left -> node ->right left -> right ->node Recursive method 实际上代码是一样, 就是把ans.append(root.val) 放在如上表先, 中,…

Questions: [LeetCode] 198. House Robber _Easy tag: Dynamic Programming [LeetCode] 221. Maximal Square _ Medium Tag: Dynamic Programming [LeetCode] 62. Unique Paths_ Medium tag: Dynamic Programming [LeetCode] 64. Minimum Path Sum_Medium tag: Dynamic P…

Path in Tree: [LeetCode] 112. Path Sum_Easy tag: DFS       input: root, target,   return True if exists sum(root-> leaf) == target else False       1 [LeetCode] 257. Binary Tree Paths_ Easy tag: DFS        input: root,   return all paths from root to…