Questions for practice picked from Leetcode & Geeks for Geeks.
- Follow the Rule: 108 Operations
| Length of Input (N) | Worst Accepted Algorithm |
|---|---|
| ≤ [10..11] | O(N!), O(N6) |
| ≤ [15..18] | O(2N * N2) |
| ≤ [18..22] | O(2N * N) |
| ≤ 100 | O(N4) |
| ≤ 400 | O(N3) |
| ≤ 2000 | O(N2 * logN) |
| ≤ 104 | O(N2) |
| ≤ 105 | O(N * logN) |
| ≤ 106 | O(N), O(logN), O(1) |
Readme Credits: Satyam Tripathi