摘要：
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. Bonus point if you are ab 阅读全文
摘要：
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. 阅读全文
摘要：
Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and empty space 阅读全文
摘要：
A robot is located at the top-left corner of a m x n grid. The robot can only move either down or right at any point in time. The robot is trying to r 阅读全文
摘要：
Determine the number of bits required to flip if you want to convert integer n to integer m. Both n and m are 32-bit integers. Determine the number of 阅读全文
摘要：
Using O(1) time to check whether an integer n is a power of 2. Using O(1) time to check whether an integer n is a power of 2. Using O(1) time to check 阅读全文
摘要：
Count how many 1 in binary representation of a 32-bit integer. Count how many 1 in binary representation of a 32-bit integer. Count how many 1 in bina 阅读全文
摘要：
Bit Rotation -—— A rotation (or circular shift) is an operation similar to shift except that the bits that fall off at one end are put back to the oth 阅读全文
摘要：
Given n nodes in a graph labeled from 1 to n. There is no edges in the graph at beginning. You need to support the following method:1. connect(a, b), 阅读全文
摘要：
Given n nodes in a graph labeled from 1 to n. There is no edges in the graph at beginning. You need to support the following method:1. connect(a, b), 阅读全文