This document is my notes of algorithms exercises on LintCode. In the first place all solutions are coded in python.
Problem id | Problem | Level | Labels |
---|---|---|---|
1 | A+B Problem | Easy | Complement, binary operation |
2 | Factorial trailing zero | Easy | trick |
3 | Digit Count | Easy | string operaion |
41 | Maximum Subarray | Easy | Greedy, Dynamic programming |
46 | Majority number | Easy | Greedy |
42 | Maximum Subarray II | Medium | Dynamic programming, bisection |
55 | Compare Strings | Easy | String |
197 | Permutation_Index | Easy | Permutation, factorial |
198 | Permutation Index II | Medium | hash table |
671 | Rotate words | Easy | tle |