An array of common face questions

References:

1. The beauty of programming

2. "Sword Point offer"

3. "The kingly procedure Ape Job Search"

Common topics such as the following:

1. Find a number in a two-D array. The array satisfies: left-to-right: increment, up-and-down: increments. -------> The idea of using two-point search

2. Find the smallest number in the rotated array.

3. Use the loop to optimize the Fibonacci sequence.

4. Adjust the array order so that the odd digits precede the even number.

5. Find an array in which more than half occurrences occur.

6. Enter an n integer. Find out the smallest number of K.

7. The sum of the maximal contiguous subarray is required to have a time complexity of O (n).

8. Find the number of occurrences of the 1~n integer, 1.

9. Arrange the array to the smallest number.

10. Find the number of K-ugly.

11. Find the number of occurrences in the sorted array of numbers.

12. Find only one occurrence of the number in the array.

13. Find the two numbers in the array and for S.

14. Find the second largest number in the array.

15. Ask for two ordered non-repeating arrays. Array of one more, one less.

An array of common face questions