My Own Notes
Tuesday, September 30, 2014
Index of My Own Notes
›
LeetCode questions: Title Java Python Reverse Words in a St...
Sunday, September 14, 2014
Leetcode (Python): Populating Next Right Pointers in Each Node II
›
Follow up for problem " Populating Next Right Pointers in Each Node ". What if the given tree could be any binary tree? Would y...
Leetcode (Python): Valid Palindrome
›
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example, "A man, a...
1 comment:
Leetcode: Valid Palindrome
›
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example, "A man, a...
Leetcode (Python): Sum Root to Leaf Numbers
›
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf pa...
Leetcode: Sum Root to Leaf Numbers
›
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf pa...
Saturday, September 13, 2014
Leetcode (Python): Binary Tree Preorder Traversal
›
Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree 1 \ 2 / ...
›
Home
View web version