Time Complexity Analysis (Reference)
Maximum Complexity which can be handled by compiler will be O(10^6)
1. So in case of O(n) solution -> constraints will be n <= 10^6
2. In case of O(n^2) solution -> constraints will be n <= 10^3 as (10^3 * 10^3 == 10^6)
Similiarly with others-> all you have to do is just substitute the value of n in the worst case complexity!!
forked from Leet-Us-Code/DSA-A-Z-Practice
-
Notifications
You must be signed in to change notification settings - Fork 0
Practice questions from Leetcode, GFG, Codechef and Codeforces.
License
Tiger-Team-01/DSA-A-Z-Practice
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Practice questions from Leetcode, GFG, Codechef and Codeforces.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published
Languages
- C++ 97.0%
- Java 3.0%