摘要：
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. 阅读全文
摘要：
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) 阅读全文
摘要：
Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified. 阅读全文
摘要：
Implement int sqrt(int x). 阅读全文
摘要：
You are climbing a stair case. It takes n steps to reach to the top. 阅读全文
摘要：
Given an absolute path for a file (Unix-style), simplify it. 阅读全文
摘要：
Given two binary strings, return their sum (also a binary string). 阅读全文
摘要：
Validate if a given string is numeric. 阅读全文
摘要：
Given a non-negative number represented as an array of digits, plus one to the number. 阅读全文
摘要：
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 阅读全文
摘要：
Follow up for "Unique Paths":
Now consider if some obstacles are added to the grids. How many unique paths would there be? 阅读全文