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 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once. For example, Given board =
|
1 2 3 4 5 |
[ ["ABCE"], ["SFCS"], ["ADEE"] ] |
word Continue reading...
Problem Statement Given a binary tree, return the preorder traversal of its nodes’ values. For example: Given binary tree {1,#,2,3},
|
1 2 3 4 5 |
1 \ 2 / 3 |
return [1,2,3]. Note: Recursive solution is trivial, could you do it iteratively? Original LeetCode problem page My Solution in Swift Continue reading...
Problem Statement Given a binary tree, return the inorder traversal of its nodes’ values. For example: Given binary tree {1,#,2,3},
|
1 2 3 4 5 |
1 \ 2 / 3 |
return [1,3,2]. Note: Recursive solution is trivial, could you do it iteratively? Original LeetCode problem page My Solution in Swift Continue reading...
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...