The idea of solving multiple problems

According to their own brush algorithm problem, generally through the following ideas to solve:

1, the most common is the string processing;

2, the common sorting algorithm;

3, two-point search;

4, double pointer;

5, bit processing;

6, backtracking algorithm;

7, dynamic planning;

8, not only to consider the functionality of the code (the correct input can have a true output), but also to consider the robustness of the code (able to handle the wrong input, without causing the program to crash)

Robustness: such as for linked list, input empty list, input list only one node and so on;

9, can use the recursive basic can use the iteration;

The idea of solving multiple problems