2019 年 9月随笔档案 - neverlandly

摘要：DP: Extend palindrome: (better) 阅读全文

posted @ 2019-09-30 13:59 neverlandly 阅读(176) 评论(0) 推荐(0)

Summary: curated List of Top 75 LeetCode Questions to Save Your Time

摘要：Facebook / Eng tech lead Dec 30, 2018 68 Comments Facebook / Eng tech lead Facebook / Eng tech lead Dec 30, 2018 68 Comments New Year Gift to every fe 阅读全文

posted @ 2019-09-22 07:50 neverlandly 阅读(465) 评论(0) 推荐(0)

Leetcode: Subtree of Another Tree

摘要：Recursion: 阅读全文

posted @ 2019-09-20 15:17 neverlandly 阅读(158) 评论(0) 推荐(0)

Leetcode: Longest Common Subsequence

摘要：DP with a 2D array Time & space: O(m * n) (Skim through) memory optimization, referencing: https://leetcode.com/problems/longest-common-subsequence/di 阅读全文

posted @ 2019-09-17 13:56 neverlandly 阅读(217) 评论(0) 推荐(0)