status
type
date
slug
summary
tags
category
icon
password
题目分类 和答案来自
Solutions(现在是1-1000)
每一个topic 划分出独立界面 每一个专题轮流做
Bit manipulationArrayStringLinked ListStackQueueBinary HeapTreeHash TableMathSortTwo Pointers
# | Title | Solution | Time | Space | Difficulty | Tag | Note |
0015 | O(n^2) | O(1) | Medium | ㅤ | Two Pointers | ||
0016 | O(n^2) | O(1) | Medium | ㅤ | Two Pointers | ||
0018 | O(n^3) | O(1) | Medium | ㅤ | Two Pointers | ||
0019 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0086 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0141 | O(n) | O(1) | Easy | ㅤ | ㅤ | ||
0142 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0143 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0167 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0209 | O(n) | O(1) | Medium | ㅤ | Binary Search, Sliding Window | ||
0259 | O(n^2) | O(1) | Medium | 🔒, LintCode | ㅤ | ||
0283 | O(n) | O(1) | Easy | ㅤ | ㅤ | ||
0287 | O(n) | O(1) | Hard | ㅤ | Binary Search, Two Pointers | ||
0344 | O(n) | O(1) | Easy | ㅤ | ㅤ | ||
0345 | O(n) | O(1) | Easy | ㅤ | ㅤ | ||
0349 | O(m + n) | O(min(m, n)) | Easy | EPI | Hash, Binary Search | ||
0350 | O(m + n) | O(1) | Easy | EPI | Hash, Binary Search | ||
0360 | O(n) | O(1) | Medium | 🔒 | ㅤ | ||
0424 | O(n) | O(1) | Medium | ㅤ | Sliding Window | ||
0457 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0567 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0611 | O(n^2) | O(1) | Medium | ㅤ | ㅤ | ||
0777 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0826 | O(mlogm + nlogn) | O(n) | Medium | ㅤ | ㅤ | ||
0828 | O(n) | O(1) | Hard | ㅤ | ㅤ | ||
0844 | O(m + n) | O(1) | Easy | ㅤ | ㅤ | ||
0862 | O(n) | O(n) | Hard | ㅤ | Mono Deque, Sliding Window | ||
0876 | O(n) | O(1) | Easy | ㅤ | ㅤ | ||
0904 | O(n) | O(1) | Medium | ㅤ | Sliding Window | ||
0930 | O(n) | O(1) | Medium | ㅤ | Sliding Window | ||
0977 | O(n) | O(1) | Easy | ㅤ | ㅤ | ||
0992 | O(n) | O(k) | Hard | ㅤ | Two Pointers, Sliding Window |
<b><a href="#algorithms">⬆️ Back to Top</a></b>Recursion
# | Title | Solution | Time | Space | Difficulty | Tag | Note |
0095 | O(4^n / n^(3/2) | O(4^n / n^(3/2) | Medium | ㅤ | ㅤ | ||
0098 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0100 | O(n) | O(h) | Easy | ㅤ | ㅤ | ||
0104 | O(n) | O(h) | Easy | ㅤ | ㅤ | ||
0105 | O(n) | O(n) | Medium | ㅤ | ㅤ | ||
0106 | O(n) | O(n) | Medium | ㅤ | ㅤ | ||
0108 | O(n) | O(logn) | Medium | ㅤ | ㅤ | ||
0109 | O(n) | O(logn) | Medium | ㅤ | ㅤ | ||
0110 | O(n) | O(h) | Easy | ㅤ | ㅤ | ||
0111 | O(n) | O(h) | Easy | ㅤ | ㅤ | ||
0114 | O(n) | O(h) | Medium | ㅤ | ㅤ | ||
0116 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0124 | O(n) | O(h) | Hard | ㅤ | ㅤ | ||
0129 | O(n) | O(h) | Medium | ㅤ | ㅤ | ||
0156 | O(n) | O(1) | Medium | 🔒 | ㅤ | ||
0241 | O(n * 4^n / n^(3/2)) | O(n * 4^n / n^(3/2)) | Medium | ㅤ | ㅤ | ||
0298 | O(n) | O(h) | Medium | 🔒 | ㅤ | ||
0327 | O(nlogn) | O(n) | Hard | ㅤ | ㅤ | ||
0333 | O(n) | O(h) | Medium | 🔒 | ㅤ | ||
0337 | O(n) | O(h) | Medium | ㅤ | ㅤ | ||
0395 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0404 | O(n) | O(h) | Easy | ㅤ | ㅤ | ||
0437 | O(n) | O(h) | Easy | ㅤ | ㅤ | ||
0544 | O(n) | O(n) | Medium | ㅤ | ㅤ | ||
0549 | O(n) | O(h) | Medium | 🔒 | ㅤ | ||
0669 | O(n) | O(h) | Easy | ㅤ | ㅤ | ||
0671 | O(n) | O(h) | Easy | ㅤ | ㅤ | ||
0761 | O(n^2) | O(n) | Hard | ㅤ | ㅤ |
<b><a href="#algorithms">⬆️ Back to Top</a></b>Binary Search
# | Title | Solution | Time | Space | Difficulty | Tag | Note |
0004 | O(log(min(m, n))) | O(1) | Hard | ㅤ | ㅤ | ||
0033 | O(logn) | O(1) | Medium | CTCI | ㅤ | ||
0034 | O(logn) | O(1) | Medium | ㅤ | ㅤ | ||
0035 | O(logn) | O(1) | Medium | ㅤ | ㅤ | ||
0069 | O(logn) | O(1) | Medium | ㅤ | ㅤ | ||
0074 | O(logm + logn) | O(1) | Medium | ㅤ | ㅤ | ||
0081 | O(logn) ~ O(n) | O(1) | Medium | CTCI | ㅤ | ||
0153 | O(logn) | O(1) | Medium | ㅤ | ㅤ | ||
0154 | O(logn) ~ O(n) | O(1) | Hard | ㅤ | ㅤ | ||
0162 | O(logn) | O(1) | Medium | ㅤ | ㅤ | ||
0222 | O((logn)^2) | O(1) | Medium | ㅤ | ㅤ | ||
0275 | O(logn) | O(1) | Medium | ㅤ | Binary Search | ||
0278 | O(logn) | O(1) | Easy | LintCode | ㅤ | ||
0300 | O(nlogn) | O(n) | Medium | CTCI, LintCode | Binary Search, BIT, Fenwick Tree, Segment Tree, DP | ||
0302 | O(nlogn) | O(1) | Hard | 🔒 | ㅤ | ||
0354 | O(nlogn) | O(1) | Hard | ㅤ | ㅤ | ||
0363 | O(min(m, n)^2 * max(m, n) * logn(max(m, n))) | O(max(m, n)) | Hard | ㅤ | ㅤ | ||
0367 | O(logn) | O(1) | Medium | ㅤ | ㅤ | ||
0374 | O(logn) | O(1) | Easy | ㅤ | ㅤ | ||
0410 | O(nlogs) | O(1) | Hard | ㅤ | ㅤ | ||
0436 | O(nlogn) | O(n) | Medium | ㅤ | ㅤ | ||
0475 | O((m + n) * logn) | O(1) | Easy | ㅤ | ㅤ | ||
0540 | O(logn) | O(1) | Medium | ㅤ | ㅤ | ||
0658 | O(logn + k) | O(1) | Medium | ㅤ | ㅤ | ||
0668 | O(m * log(m * n)) | O(1) | Hard | ㅤ | ㅤ | ||
0702 | O(logn) | O(1) | Medium | 🔒 | Binary Search | ||
0704 | O(logn) | O(1) | Easy | ㅤ | Binary Search | ||
0710 | ctor: O(b) pick: O(1) | O(b) | Hard | ㅤ | ㅤ | ||
0719 | O(nlogn + nlogw) | O(1) | Hard | ㅤ | ㅤ | ||
0744 | O(logn) | O(1) | Easy | ㅤ | ㅤ | ||
0774 | O(nlogr) | O(1) | Hard | ㅤ | ㅤ | ||
0786 | O(nlogr) | O(1) | Hard | ㅤ | ㅤ | ||
0793 | O((logn)^2) | O(1) | Hard | ㅤ | ㅤ | ||
0852 | O(logn) | O(1) | Easy | ㅤ | ㅤ | ||
0875 | O(nlogr) | O(1) | Medium | ㅤ | ㅤ | ||
0878 | O(logn) | O(1) | Hard | ㅤ | ㅤ | ||
0894 | O(n * 4^n / n^(3/2)) | O(n * 4^n / n^(3/2)) | Medium | ㅤ | ㅤ | ||
0911 | ctor: O(n) query : O(logn) | O(n) | Medium | ㅤ | ㅤ | ||
0981 | set: O(1) get : O(logn) | O(n) | Medium | ㅤ | ㅤ |
<b><a href="#algorithms">⬆️ Back to Top</a></b>Binary Search Tree
# | Title | Solution | Time | Space | Difficulty | Tag | Note |
0220 | O(nlogk) | O(k) | Medium | ㅤ | ㅤ | ||
0230 | O(max(h, k)) | O(min(h, k)) | Medium | ㅤ | ㅤ | ||
0235 | O(h) | O(1) | Easy | EPI | ㅤ | ||
0270 | O(h) | O(1) | Easy | 🔒 | ㅤ | ||
0285 | O(h) | O(1) | Medium | 🔒 | ㅤ | ||
0352 | O(logn) | O(n) | Hard | ㅤ | ㅤ | ||
0449 | O(n) | O(h) | Medium | ㅤ | ㅤ | ||
0450 | O(h) | O(h) | Medium | ㅤ | ㅤ | ||
0530 | O(n) | O(h) | Easy | ㅤ | ㅤ | ||
0776 | O(n) | O(h) | Medium | 🔒 | ㅤ | ||
0783 | O(n) | O(h) | Easy | ㅤ | ㅤ | ||
0510 | O(h) | O(1) | Medium | 🔒 | ㅤ |
<b><a href="#algorithms">⬆️ Back to Top</a></b>Breadth-First Search
# | Title | Solution | Time | Space | Difficulty | Tag | Note |
0102 | O(n) | O(n) | Easy | ㅤ | ㅤ | ||
0107 | O(n) | O(n) | Easy | ㅤ | ㅤ | ||
0103 | O(n) | O(n) | Medium | ㅤ | ㅤ | ||
0117 | O(n) | O(1) | Hard | ㅤ | ㅤ | ||
0127 | O(b^(d/2)) | O(w * l) | Medium | CTCI | Bi-BFS | ||
0130 | O(m * n) | O(m + n) | Medium | ㅤ | ㅤ | ||
0133 | O(n) | O(n) | Medium | ㅤ | ㅤ | ||
0207 | O(|V| + |E|) | O(|E|) | Medium | ㅤ | Topological Sort, Kahn’s Algorithm | ||
0210 | O(|V| + |E|) | O(|E|) | Medium | ㅤ | Topological Sort, Kahn’s Algorithm | ||
0261 | O(|V| + |E|) | O(|V| + |E|) | Medium | 🔒 | ㅤ | ||
0269 | O(n) | O(1) | Hard | 🔒 | Topological Sort, BFS, DFS | ||
0286 | O(m * n) | O(g) | Medium | 🔒 | ㅤ | ||
0310 | O(n) | O(n) | Medium | ㅤ | ㅤ | ||
0317 | O(k * m * n) | O(m * n) | Hard | 🔒 | ㅤ | ||
0433 | O(n * b) | O(b) | Medium | ㅤ | ㅤ | ||
0444 | O(n * s) | O(n) | Medium | 🔒 | Topological Sort | ||
0490 | O(max(r, c) * w) | O(w) | Medium | ㅤ | ㅤ | ||
0499 | O(max(r, c) * wlogw) | O(w^2) | Hard | ㅤ | ㅤ | ||
0505 | O(max(r, c) * wlogw) | O(w) | Medium | ㅤ | ㅤ | ||
0542 | O(m * n) | O(1) | Medium | ㅤ | DP | ||
0666 | O(n) | O(w) | Medium | 🔒 | Topological Sort | ||
0675 | O(t * m * n) | O(m * n) | Hard | ㅤ | A* Search Algorithm | ||
0742 | O(n) | O(n) | Medium | ㅤ | ㅤ | ||
0743 | O(|E| * log|V|) | O(|E|) | Medium | ㅤ | Dijkstra's Algorithm | ||
0752 | O(k * n^k + d) | O(k * n^k + d) | Medium | ㅤ | ㅤ | ||
0773 | O((m * n) * (m * n)!) | O((m * n) * (m * n)!) | Hard | ㅤ | A* Search Algorithm | ||
0787 | O(|E| * log|V|) | O(|E|) | Medium | ㅤ | Dijkstra's Algorithm | ||
0815 | O(|E| + |V|) | O(|E| + |V|) | Hard | ㅤ | ㅤ | ||
0854 | O(n * n!/(c_a!…c_z!)) | O(n * n!/(c_a!…c_z!)) | Hard | ㅤ | ㅤ | ||
0864 | _O(k * r * c + k^3*2^k)_ | _O(k*2^k)_ | Hard | ㅤ | Dijkstra's Algorithm | ||
0882 | O(|E| * log|V|) | O(|E|) | Hard | ㅤ | Dijkstra's Algorithm | ||
0886 | O(|V| + |E|) | O(|V| + |E|) | Medium | ㅤ | ㅤ | ||
0913 | O(n^3) | O(n^2) | Hard | ㅤ | MiniMax, Topological Sort | ||
0934 | O(n^2) | O(n^2) | Medium | ㅤ | BFS, DFS | ||
0967 | O(2^n) | O(2^n) | Medium | ㅤ | ㅤ | ||
0994 | O(m * n) | O(m * n) | Easy | ㅤ | ㅤ |
<b><a href="#algorithms">⬆️ Back to Top</a></b>Depth-First Search
# | Title | Solution | Time | Space | Difficulty | Tag | Note |
0112 | O(n) | O(h) | Easy | ㅤ | ㅤ | ||
0113 | O(n) | O(h) | Medium | ㅤ | ㅤ | ||
0199 | O(n) | O(h) | Medium | ㅤ | ㅤ | ||
0200 | O(m * n) | O(m * n) | Medium | ㅤ | BFS, DFS, Union Find | ||
0236 | O(n) | O(h) | Medium | EPI | ㅤ | ||
0247 | O(n * 5^(n/2)) | O(n) | Medium | 🔒 | ㅤ | ||
0250 | O(n) | O(h) | Medium | 🔒 | ㅤ | ||
0257 | O(n * h) | O(h) | Easy | ㅤ | ㅤ | ||
0282 | O(4^n) | O(n) | Hard | ㅤ | ㅤ | ||
0301 | O(C(n, c)) | O(c) | Hard | ㅤ | ㅤ | ||
0329 | O(m * n) | O(m * n) | Hard | ㅤ | DFS, Topological Sort | ||
0339 | O(n) | O(h) | Easy | 🔒 | ㅤ | ||
0364 | O(n) | O(h) | Medium | 🔒 | ㅤ | ||
0366 | O(n) | O(h) | Medium | 🔒 | ㅤ | ||
0417 | O(m * n) | O(m * n) | Medium | ㅤ | ㅤ | ||
0440 | O(logn) | O(logn) | Hard | ㅤ | ㅤ | ||
0464 | O(n!) | O(n) | Medium | ㅤ | ㅤ | ||
0515 | O(n) | O(h) | Medium | ㅤ | ㅤ | ||
0547 | O(n^2) | O(n) | Medium | ㅤ | Union Find | ||
0582 | O(n) | O(n) | Medium | 🔒 | DFS, BFS | ||
0638 | O(n * 2^n) | O(n) | Medium | ㅤ | ㅤ | ||
0690 | O(n) | O(h) | Easy | ㅤ | DFS, BFS | ||
0694 | O(m * n) | O(m * n) | Medium | 🔒 | ㅤ | ||
0695 | O(m * n) | O(m * n) | Easy | ㅤ | ㅤ | ||
0711 | O((m * n) * log(m * n)) | O(m * n) | Hard | 🔒 | Hash | ||
0733 | O(m * n) | O(m * n) | Easy | ㅤ | ㅤ | ||
0749 | O((m * n)^(4/3)) | O(m * n) | Hard | ㅤ | Simulation | ||
0753 | O(k^n) | O(k^n) | Hard | ㅤ | de Bruijn sequences, Lyndon word, Rolling Hash, Backtracking, Greedy | ||
0756 | O(a^b) | O(a^b) | Medium | ㅤ | ㅤ | ||
0785 | O(|V| + |E|) | O(|V|) | Medium | ㅤ | ㅤ | ||
0797 | O(p + r * n) | O(n) | Medium | ㅤ | ㅤ | ||
0802 | O(|V| + |E|) | O(|V|) | Medium | ㅤ | ㅤ | ||
0827 | O(n^2) | O(n^2) | Hard | ㅤ | ㅤ | ||
0834 | O(n) | O(n) | Hard | ㅤ | ㅤ | ||
0841 | O(n!) | O(n) | Medium | ㅤ | ㅤ | ||
0851 | O(q + r) | O(q + r) | Medium | ㅤ | ㅤ |
<b><a href="#algorithms">⬆️ Back to Top</a></b><b><a href="#algorithms">⬆️ Back to Top</a></b>Dynamic Programming
# | Title | Solution | Time | Space | Difficulty | Tag | Note |
0010 | O(m * n) | O(n) | Hard | ㅤ | ㅤ | ||
0044 | O(m * n) | O(1) | Hard | ㅤ | Greedy | ||
0053 | O(n) | O(1) | Easy | ㅤ | ㅤ | ||
0062 | O(m + n) | O(1) | Medium | ㅤ | Combinatorics | ||
0063 | O(m * n) | O(m + n) | Medium | ㅤ | ㅤ | ||
0064 | O(m * n) | O(m + n) | Medium | ㅤ | ㅤ | ||
0070 | O(logn) | O(1) | Easy | ㅤ | Matrix Exponentiation | ||
0072 | O(m * n) | O(m + n) | Hard | ㅤ | ㅤ | ||
0087 | O(n^4) | O(n^3) | Hard | ㅤ | ㅤ | ||
0091 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0096 | O(n) | O(1) | Medium | ㅤ | Math | ||
0097 | O(m * n) | O(m + n) | Hard | ㅤ | ㅤ | ||
0115 | O(n^2) | O(n) | Hard | ㅤ | ㅤ | ||
0120 | O(m * n) | O(n) | Medium | ㅤ | ㅤ | ||
0123 | O(n) | O(1) | Hard | ㅤ | ㅤ | ||
0132 | O(n^2) | O(n^2) | Hard | ㅤ | ㅤ | ||
0139 | O(n * l^2) | O(n) | Medium | ㅤ | ㅤ | ||
0152 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0174 | O(m * n) | O(m + n) | Hard | ㅤ | ㅤ | ||
0188 | O(n) | O(n) | Hard | ㅤ | Quick Select, Mono Stack | ||
0198 | O(n) | O(1) | Easy | ㅤ | ㅤ | ||
0213 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0221 | O(n^2) | O(n) | Medium | EPI | ㅤ | ||
0256 | O(n) | O(1) | Medium | 🔒 | ㅤ | ||
0265 | O(n * k) | O(k) | Hard | 🔒 | ㅤ | ||
0276 | O(n) | O(1) | Easy | 🔒 | ㅤ | ||
0279 | O(n * sqrt(n)) | O(n) | Medium | ㅤ | Hash | ||
0303 | ctor: O(n), lookup: O(1) | O(n) | Easy | ㅤ | ㅤ | ||
0304 | ctor: O(m * n), lookup: O(1) | O(m * n) | Medium | ㅤ | ㅤ | ||
0309 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0312 | O(n^3) | O(n^2) | Hard | ㅤ | ㅤ | ||
0322 | O(n * k) | O(k) | Medium | ㅤ | ㅤ | ||
0351 | O(9^2 * 2^9) | O(9 * 2^9) | Medium | 🔒 | Backtracking | ||
0357 | O(n) | O(1) | Medium | ㅤ | Backtracking, Math | ||
0361 | O(m * n) | O(m * n) | Medium | 🔒 | ㅤ | ||
0368 | O(n^2) | O(n) | Medium | ㅤ | ㅤ | ||
0375 | O(n^3) | O(n^2) | Medium | ㅤ | ㅤ | ||
0377 | O(nlogn + n * t) | O(t) | Medium | ㅤ | ㅤ | ||
0403 | O(n^2) | O(n^2) | Hard | ㅤ | ㅤ | ||
0416 | O(n * s) | O(s) | Medium | ㅤ | ㅤ | ||
0418 | O(r + n * c) | O(n) | Medium | 🔒 | ㅤ | ||
0446 | O(n^2) | O(n * d) | Hard | ㅤ | ㅤ | ||
0465 | O(n * 2^n) | O(2^n) | Hard | 🔒 | ㅤ | ||
0466 | O(s1 * min(s2, n1)) | O(s2) | Hard | ㅤ | ㅤ | ||
0467 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0471 | O(n^3) on average | O(n^2) | Medium | 🔒 | ㅤ | ||
0472 | O(n * l^2) | O(n * l) | Medium | ㅤ | ㅤ | ||
0474 | O(s * m * n) | O(m * n) | Medium | ㅤ | ㅤ | ||
0486 | O(n^2) | O(n) | Medium | ㅤ | ㅤ | ||
0494 | O(n * S) | O(S) | Medium | ㅤ | DP | ||
0509 | O(logn) | O(1) | Easy | variant of Climbing Stairs | Matrix Exponentiation | ||
0514 | O(k) ~ O(k * r^2) | O(r) | Hard | ㅤ | ㅤ | ||
0516 | O(n^2) | O(n) | Medium | ㅤ | ㅤ | ||
0518 | O(n * m) | O(m) | Medium | ㅤ | DP | ||
0546 | O(n^3) ~ O(n^4) | O(n^3) | Hard | ㅤ | ㅤ | ||
0552 | O(n) | O(1) | Hard | ㅤ | ㅤ | ||
0562 | O(m * n) | O(n) | Medium | 🔒 | ㅤ | ||
0568 | O(n^2 * k) | O(k) | Hard | 🔒 | ㅤ | ||
0576 | O(N * m * n) | O(m * n) | Medium | ㅤ | ㅤ | ||
0583 | O(m * n) | O(n) | Medium | ㅤ | ㅤ | ||
0600 | O(1) | O(1) | Hard | ㅤ | ㅤ | ||
0629 | O(n * k) | O(k) | Hard | ㅤ | ㅤ | ||
0639 | O(n) | O(1) | Hard | ㅤ | ㅤ | ||
0650 | O(sqrt(n)) | O(1) | Medium | ㅤ | ㅤ | ||
0656 | O(n * B) | O(n) | Hard | 🔒 | ㅤ | ||
0664 | O(n^3) | O(n^2) | Hard | ㅤ | ㅤ | ||
0673 | O(n^2) | O(n) | Medium | ㅤ | ㅤ | ||
0688 | O(k * n^2) | O(n^2) | Medium | ㅤ | ㅤ | ||
0689 | O(n) | O(n) | Hard | ㅤ | ㅤ | ||
0691 | O(T * S^T) | O(T * S^T) | Hard | ㅤ | Backtracking, Memoization | ||
0712 | O(m * n) | O(n) | Medium | ㅤ | ㅤ | ||
0714 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0727 | O(s * t) | O(s) | Hard | 🔒 | ㅤ | ||
0730 | O(n^2) | O(n) | Hard | ㅤ | ㅤ | ||
0740 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0741 | O(n^3) | O(n^2) | Hard | ㅤ | ㅤ | ||
0746 | O(n) | O(1) | Easy | ㅤ | ㅤ | ||
0750 | O(n * m^2) | O(n * m) | Medium | ㅤ | ㅤ | ||
0764 | O(n^2) | O(n^2) | Medium | ㅤ | ㅤ | ||
0788 | O(logn) | O(logn) | Easy | ㅤ | Memoization | ||
0790 | O(logn) | O(1) | Medium | ㅤ | Matrix Exponentiation | ||
0799 | O(n^2) | O(n) | Medium | ㅤ | ㅤ | ||
0801 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0805 | O(n^4) | O(n^3) | Hard | ㅤ | ㅤ | ||
0808 | O(1) | O(1) | Medium | ㅤ | Memoization | ||
0813 | O(k * n^2) | O(n) | Medium | ㅤ | ㅤ | ||
0818 | O(nlogn) | O(n) | Hard | ㅤ | ㅤ | ||
0823 | O(n^2) | O(n) | Medium | ㅤ | ㅤ | ||
0837 | O(n) | O(n) | Medium | ㅤ | ㅤ | ||
0838 | O(n) | O(n) | Medium | ㅤ | ㅤ | ||
0847 | _O(n *2^n)_ | O(n * 2^n) | Hard | ㅤ | BFS | ||
0877 | O(n^2) | O(n) | Medium | variant of Predict the Winner | ㅤ | ||
0879 | O(n * p * g) | O(p * g) | Hard | ㅤ | ㅤ | ||
0903 | O(n^2) | O(n) | Hard | ㅤ | ㅤ | ||
0920 | O(n * l) | O(l) | Hard | ㅤ | ㅤ | ||
0926 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0931 | O(n^2) | O(1) | Medium | ㅤ | ㅤ | ||
0935 | O(logn) | O(1) | Medium | ㅤ | Matrix Exponentiation | ||
0940 | O(n) | O(1) | Hard | ㅤ | ㅤ | ||
0943 | O(n^2 * (l^2 + 2^n)) | O(n^2) | Hard | ㅤ | ㅤ | ||
0956 | O(n * 3^(n/2)) | O(3^(n/2)) | Hard | ㅤ | ㅤ | ||
0960 | O(n * l^2) | O(l) | Hard | ㅤ | ㅤ | ||
0964 | O(logn / logx) | O(logn) | Hard | ㅤ | Math | ||
0975 | O(nlogn) | O(n) | Hard | ㅤ | Mono Stack, BST | ||
0980 | O((m * n) * 2^(m * n)) | O((m * n) * 2^(m * n)) | Hard | ㅤ | ㅤ | ||
0983 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
1000 | O(n^3 / k) | O(n^2) | Hard | ㅤ | ㅤ |
<b><a href="#algorithms">⬆️ Back to Top</a></b>Greedy
# | Title | Solution | Time | Space | Difficulty | Tag | Note |
0011 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0042 | O(n) | O(1) | Hard | ㅤ | Tricky | ||
0045 | O(n) | O(1) | Hard | ㅤ | ㅤ | ||
0055 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0122 | O(n) | O(1) | Easy | ㅤ | ㅤ | ||
0134 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0135 | O(n) | O(n) | Hard | ㅤ | ㅤ | ||
0316 | O(n) | O(1) | Hard | ㅤ | Mono Stack | ||
0321 | O(k * (m + n + k)) ~ O(k * (m + n + k^2)) | O(m + n + k^2) | Hard | variant of Delete Digits | Greedy, DP | ||
0330 | O(s + logn) | O(1) | Hard | ㅤ | ㅤ | ||
0376 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0392 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0397 | O(n) | O(1) | Medium | ㅤ | Math | ||
0402 | O(n) | O(n) | Medium | LintCode | ㅤ | ||
0435 | O(nlogn) | O(1) | Medium | ㅤ | Line Sweep | ||
0452 | O(nlogn) | O(1) | Medium | ㅤ | ㅤ | ||
0455 | O(nlogn) | O(1) | Easy | ㅤ | ㅤ | ||
0484 | O(n) | O(1) | Medium | 🔒 | ㅤ | ||
0621 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0630 | O(nlogn) | O(k) | Hard | ㅤ | ㅤ | ||
0646 | O(nlogn) | O(1) | Medium | variant of Non-overlapping Intervals | Line Sweep | ||
0649 | O(n) | O(n) | Medium | ㅤ | ㅤ | ||
0659 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0738 | O(1) | O(1) | Medium | ㅤ | ㅤ | ||
0757 | O(nlogn) | O(n) | Hard | ㅤ | ㅤ | ||
0759 | O(m * logn) | O(n) | Hard | 🔒 | ㅤ | ||
0763 | O(n) | O(n) | Medium | ㅤ | ㅤ | ||
0767 | O(n) | O(1) | Medium | ㅤ | ㅤ | ||
0798 | O(n) | O(1) | Hard | ㅤ | ㅤ | ||
0843 | O(n) | O(n) | Hard | ㅤ | MinMax, Math | ||
0861 | O(r * c) | O(1) | Medium | ㅤ | ㅤ | ||
0870 | O(nlogn) | O(n) | Medium | ㅤ | ㅤ | ||
0881 | O(nlogn) | O(n) | Medium | ㅤ | ㅤ | ||
0936 | O((n - m) * m) | O((n - m) * m) | Hard | ㅤ | ㅤ | ||
0948 | O(nlogn) | O(1) | Medium | ㅤ | Two Pointers | ||
0962 | O(n) | O(n) | Medium | ㅤ | Mono Stack | ||
0968 | O(n) | O(h) | Hard | ㅤ | DFS | ||
0984 | O(a + b) | O(1) | Easy | ㅤ | ㅤ | ||
0991 | O(logn) | O(1) | Medium | ㅤ | ㅤ | ||
0995 | O(n) | O(1) | Hard | ㅤ | ㅤ |
<b><a href="#algorithms">⬆️ Back to Top</a></b>Graph
# | Title | Solution | Time | Space | Difficulty | Tag | Note |
0332 | O(|V| + |E|log|V|) | O(|V| + |E|) | Medium | ㅤ | Hierholzer's Algorithm, Eulerian Path | ||
0399 | O(e + q) | O(n) | Medium | ㅤ | Floyd-Warshall Algorithm, BFS, Union Find | ||
0765 | O(n) | O(n) | Hard | ㅤ | ㅤ | ||
0924 | O(n^2) | O(n) | Hard | ㅤ | Union Find | ||
0928 | O(n^2) | O(n) | Hard | ㅤ | Union Find | ||
0959 | O(n^2) | O(n^2) | Medium | ㅤ | Union Find | ||
0990 | O(n) | O(1) | Medium | ㅤ | Union Find |
- Author:ran2323
- URL:https://www.blueif.me//article/0b47867c-0e2e-4864-a932-4ae8882de495
- Copyright:All articles in this blog, except for special statements, adopt BY-NC-SA agreement. Please indicate the source!
