| Level 0 |
Unable to find the average of numbers in an array (It's hard to believe but I've interviewed such candidates) |
| Level 1 |
Basic sorting, searching and data structure traversal and retrieval algorithms |
| Level 2 |
Tree, Graph, simple greedy and divide and conquer algorithms, is able to understand the relevance of the levels of this matrix. |
| Level 3 |
Able to recognize and code dynamic programming solutions, good knowledge of graph algorithms, good knowledge of numerical computation algorithms, able to identify NP problems etc. |