The C solutions for LeetCode problems.
| # | Title | Solutions | Time | Space | Comments |
|---|---|---|---|---|---|
| 1 | Two Sum | C(4ms) | O(N) | O(N) | |
| 2 | Add Two Numbers | C(20ms) | O(Max(N, M)) | O(1) | |
| 3 | Longest Substring Without Repeating Characters | C(8ms) | O(N) | O(1) | C# use array will slower |
| 5 | Longest Palindromic Substring | C(0ms) | O(N) | O(N) | Use Manacher's Algorithm |