Programming interview questions, tips and knowledge, system design, big data.

##题目 ####Factorial Trailing Zeroes Given an integer n, return the number of trailing zeroes in n!. Note: Your solution should be in logarithmic time complexity. ####Credits:Special thanks to @ts for adding this problem and creating all test cases.

##题目 ####Find Minimum in Rotated Sorted Array Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Find the minimum element. You may assume no duplicate exists in the array.

##题目 ####First Missing Positive Given an unsorted integer array, find the first missing positive integer. For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2. Your algorithm should run in O(n) time and uses constant space.

##题目 ####Find Minimum in Rotated Sorted Array II Follow up for “Find Minimum in Rotated Sorted Array”:What if duplicates are allowed? Would this affect the run-time complexity? How and why?Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4

##题目 ####Flatten Binary Tree to Linked List Given a binary tree, flatten it to a linked list in-place. For example,Given 1 / \ 2 5 / \ \ 3 4 6 The flattened tree should look like: 1 \ 2 \ 3 \ 4 \ 5 \ 6 click to show hints. ###

##题目 ####Gas Station There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to its next station (i+1). You begin the journey with an empty tank at one of the gas

一、配置 Eclipse上次实验，我们学习了HBase的安装和配置。有了对HBase一定的了解后，我们趁热打铁，开始学习HBase应用程序开发。因为我们在开发过程中需要用到Eclipse, 所以需要先对Eclipse进行配置。

##题目 ####Generate Parentheses Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: "((()))", "(()())", "(())()", "()(())", "()()()"

一、安装之前 - 检查必要条件 (1) Java （需要安装1.6.x及其以上版本) 在终端输入 java -version 来查看你机子上的 Java 版本； (2) Hadoop Hadoop的具体安装可以参见Hadoop部署及管理。需要注意的是伪分布模式下，HBase 的版本需要和 Hadoop版本 匹配 ，不然很可能容易出错。你可以在HBase的lib目录下看到对应的Hadoop的Jar文件版本。 在这里，我们使用了Hadoop V2.4.1版本以及HBase V0.98.11版本。 (3) SSH SSH的安装，在Hadoop部署及管理中也涵盖了这部分内容。SSH用来管理远程Had

##题目 ####Fraction to Recurring Decimal Given two integers representing the numerator and denominator of a fraction, return the fraction in string format. If the fractional part is repeating, enclose the repeating part in parentheses. For example, Given numerator = 1, denominator = 2, return “0.5”.

##一、本节目标 我们本节课程将要讲述以下内容： HBase的概述及历史 HBase的数据模型 HBase的系统架构

##题目 ####Happy Number Write an algorithm to determine if a number is “happy”. A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will

##题目 ####House Robber You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police

##题目 ####House Robber II Note: This is an extension of House Robber. After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, all houses at this place are arranged in a circle. That means the first hou

主要对Hive 接口介绍（Web UI/JDBC）。

##题目 ####Implement Trie (Prefix Tree) Implement a trie with insert, search, and startsWith methods. ####Note:You may assume that all inputs are consist of lowercase letters a-z.

##题目 ####Implement strStr() Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. ####Update (2014-11-02): The signature of the function had been updated to return the index instead of the pointer. If you still see your func

##题目 ####Gray Code The gray code is a binary numeral system where two successive values differ in only one bit. Given a non-negative integer n representing the total number of bits in the code, print the sequence of gray code. A gray code sequence must begin with 0. For example, given n = 2, return

##题目 ####Insert Interval Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals were initially sorted according to their start times. ####Example 1:Given intervals [1,3],[6,9], insert and merge [2,5] in as [1,5],[6,

##题目 ####Insertion Sort List Sort a linked list using insertion sort.