Here are leetcode-lintcode problem solutions. Here is a repo for you can play it and share your solution. Hope you enjoy it and contribute it.
Look here is a ladder for you. You can play it in leetcode.
Please read and follow the steps in CONTRIBUTING.md.
| # Title |
|---|
| 139. Word Break |
| 140. Word Break II |
| 329. Longest Increasing Path in a Matrix |
| 241. Different Ways to Add Parentheses |
| 1611. Minimum One Bit Operations to M |
| Time Complexity | Algorithms |
|---|---|
| O(log(n)) | Binary Search |
| O(sqrt n) | Prime Factorization |
| O(n) | High Frequency |
| O(nlog(n) | Sorting |
| O(n^2) | Matrix, Enumeration, Dynamic Programming |
| O(n^3) | Matrix, Enumeration, Dynamic Programming |
| O(2^n) | Combination |
| O(n!) | Permutation |
Please see LICENSE.