// Init an array with set 1, 2, and 3.int[] nums = {1,2,3};Solution solution = new Solution(nums);

The code base version is an integer start from 1 to n. One day, someone committed a bad version in the code case, so it caused this version and the following versions are all failed in the unit tests. Find the first bad version.

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

Write a SQL query for a report that provides the following information for each person in the Person table, regardless if there is an address for each of those people:

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.

Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.

For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].

n <= 100000The prime number is defined as a natural number greater than 1, and there are no other factors except 1 and it itself.

add(number). Add a new number in the data structure.topk(). Return the top k largest numbers in this data structure. k is given when we create the data structure.

Given a string str1 = This is an exampleGiven another string str2 = is example

Give a string, you can choose to split the string after one character or two adjacent characters, and make the string to be composed of only one character or two characters. Output all possible results.

Two strings are isomorphic if the characters in s can be replaced to get t.

Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.

Problem Using map reduce to count word frequency. [链接] Example chunk1: "Google Bye GoodBye Hadoop code"chunk2: "lintcode code Bye" Get MapReduce result: {代码...} Solution {代码...}

Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

Given a column title as appear in an Excel sheet, return its corresponding column number.

An amicable pair (m,n) consists of two integers m,n for which the sum of proper divisors (the divisors excluding the number itself) of one number equals the other.

Given a string, find length of the longest repeating subsequence such that the two subsequence don’t have same string character at same position, i.e., any ith character in the two subsequences shouldn’t have the same index in the original string.

Given some points and a point origin in two dimensional space, find k points out of the some points which are nearest to origin.Return these points sorted by distance, if they are same with distance, sorted by x-axis, otherwise sorted by y-axis.

Write a program to swap odd and even bits in an integer with as few instructions as possible (e.g., bit 0 and bit 1 are swapped, bit 2 and bit 3 are swapped, and so on).

A child is running up a staircase with n steps, and can hop either 1 step, 2 steps, or 3 steps at a time. Implement a method to count how many possible ways the child can run up the stairs.

Your answer should be sorted by frequency from highest to lowest. If two words have the same frequency, then the word with the lower alphabetical order comes first.

Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.

Given a node from a cyclic linked list which has been sorted, write a function to insert a value into the list such that it remains a cyclic sorted list. The given node can be any single node in the list. Return the inserted new node.

Problem Given an integer array, find the top k largest numbers in it. Example Given [3,10,1000,-99,4,100] and k = 3.Return [1000, 100, 10]. Tags Heap Priority Queue Solution {代码...}

Problem Insert a node in a sorted linked list. Example Given list = 1->4->6->8 and val = 5. Return 1->4->5->6->8. Solution {代码...}

Implement a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2b1c5a3.

Implement a stack. You can use any data structure inside a stack except stack itself to implement it.