We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 18287fe commit eb94064Copy full SHA for eb94064
README.md
@@ -183,6 +183,19 @@ Please read and follow the steps in [CONTRIBUTING.md](/CONTRIBUTING.md).
183
| [241. Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses) |
184
| [1611. Minimum One Bit Operations to M](https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero) |
185
186
+## Time Complexity in Coding Interview
187
+
188
+| Time Complexity | Algorithms |
189
+| --------------- | ---------------------------------------- |
190
+| O(log(n)) | Binary Search |
191
+| O(sqrt n) | Prime Factorization |
192
+| O(n) | High Frequency |
193
+| O(nlog(n) | Sorting |
194
+| O(n^2) | Matrix, Enumeration, Dynamic Programming |
195
+| O(n^3) | Matrix, Enumeration, Dynamic Programming |
196
+| O(2^n) | Combination |
197
+| O(n!) | Permutation |
198
199
## License
200
201
Please see [LICENSE](/LICENSE).
AltStyle によって変換されたページ (->オリジナル) / アドレス: モード: デフォルト 音声ブラウザ ルビ付き 配色反転 文字拡大 モバイル
0 commit comments