We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Yes if you are considering testcases also then compexity would be O(T*N).
and for every solution if you are testing on T testcase then every solution complexity has to multiply by T. Even constant time complexity would become O(T) due to test case.
We measure compexity based on number of input not by the number of testcases.
Angry Professor
You are viewing a single comment's thread. Return to all comments →
Yes if you are considering testcases also then compexity would be O(T*N). and for every solution if you are testing on T testcase then every solution complexity has to multiply by T. Even constant time complexity would become O(T) due to test case.
We measure compexity based on number of input not by the number of testcases.