It’s been a long time since my last blog post. Here is my recent one on Medium: ProvenLogs is a simple yet performant logging service built…
I just wrote my first Atom extension called file-header. It allows you to customize, add, update and cooperate your authoring information in header…
I came across a problem on leetcode a few days ago. It asked me to implement a simple regex (regular expression) matcher which supports both . and *…
Problem Statement Given a binary tree, return the postorder traversal of its nodes’ values. For example: Given binary tree {1,#,2,3},
|
1 2 3 4 5 |
1 \ 2 / 3 |
return [3,2,1]. Note: Recursive solution is trivial, could you do it iteratively? Original LeetCode problem page My Solution in Swift Continue reading...