Practice
Resources
Contests
Online IDE
New
Free Mock
Scaler
Practice
Improve your coding skills with our resources
Contests
Compete in popular contests with top coders
Scaler
Explore Offerings by SCALER

Welcome to Interviewbit, help us create the best experience for you!

Currently, You are a:

Few details about your education

College/University *
Enter the name of your college
Branch *
Year of completion *

Few details about your education

College/University *
Enter the name of your college
Branch *
Year of completion *

Few details about your career...

Current Company *
Enter company name *
Experience *

You're all set!

Begin your success journey!

Sign Up using
Full name *
Email *
Password *

By creating an account, I acknowledge that I have read and agree to InterviewBit’s Terms and Privacy Policy .

Welcome back!

Log In using
Email *
Password *

Time Complexity

Go to Problems

Level 1

Jump to Level 2

Level 2

Jump to Level 3

Level 3

Jump to Level 4

Level 4

Jump to Level 5

Level 5

Jump to Level 6

Level 6

Jump to Level 7

Level 7

Jump to Level 8

Level 8

Be a Code Ninja!

Time Complexity Of A Computer Program

What is Time complexity and What is its need?

Let us take one example, suppose your friend picked a number between 1 to 1000 and he told you to guess the number. If your guess is correct he will tell you that it is correct, otherwise, if your guess is bigger than his number he would tell you that it's 'too big and if it is smaller than his number then he would tell you that it is ‘too small. Here are some ways by which we could find the number.

  • We can guess each number from 1 to 1000, and see if it is correct.
  • We can pick the middle number, if he says ‘too big’ then we know for sure that the number is on the left side so we can discard the right side, similarly if he says ‘too small’ we can discard the left side. We can repeat the same process until he says it's correct.

Which way do you think is better?

As you might have guessed correctly, the 2nd way is actually way better than the first way. In the worst case, the 1st way would take 1000 guesses before we get the correct number ( if the number is 1000 ), while the 2nd way would only take 10 guesses in the worst case ( this is because at every guess we discard one of the halves).

Later you would see that the time complexity of the first way is O(n) and that of the second way is O(logn).

As we saw from the above example there can be multiple approaches to solving the same problem. The same applies to computer programming. For every approach (algorithm) the time taken, amount of space used, and computational power might be different. Therefore there has to be a way by which we can distinguish these different approaches (algorithms) and choose the one which is the most efficient.

In this article, we are going to speak about how we can choose the best algorithm based on the time taken by an algorithm to execute. But how do we compare the algorithms which are written in two different languages, running on two different machines? This is exactly why the concept of time complexity was introduced. But what is time complexity?

By definition, Time complexity is the time taken by an algorithm/program to run as a function of the length of the input.

Why is it so important?

  • It can clearly distinguish between two different algorithms based on their efficiency.
  • It’s independent of the machine on which the algorithm is run.
  • We can get a direct correlation with the length of the input.

It’s important to note here that time complexity doesn’t really measure the actual time taken by an algorithm to run ( Since that kind of depends on the programming language, processing power etc.). It calculates the execution time of an algorithm in terms of the algorithms and the inputs.

Serious about Learning Programming ?

Learn this and a lot more with Scaler Academy's industry vetted curriculum which covers Data Structures & Algorithms in depth.

This topic has only Multiple Choice Questions

Jump to subsequent topics to solve code problems.

Time Complexity Problems

Basic primer
Problem Score Companies Time Status
LOOP_CMPL 20
2:43
NESTED_CMPL 20
1:10
NESTED_CMPL2 30
1:25
CHOOSE4 50
0:57
Math
Problem Score Companies Time Status
WHILE_CMPL 50
1:31
NESTED_CMPL3 80 3:56
LOOP_CMPL2 80
2:43
GCD_CMPL 150
4:13
Compare functions
Problem Score Companies Time Status
CHOOSE3 50
1:39
CHOOSE1 50
1:43
CHOOSE2 80
2:23
Function calling itself
Problem Score Companies Time Status
REC_CMPL1 80
6:58
REC_CMPL2 80
6:25
REC_CMPL3 150
4:39
Amortized complexity
Problem Score Companies Time Status
AMORTIZED1 100
3:03

Additional Practice

Problem Score Companies Time Status
Collatz Conjecture 200 22:48
Palindromic Time 200 40:05
Pangram Check 100 26:54
Climbing Stairs 150 29:23
Integers in Strings 100 20:21
Word Count 150 22:50
Extracting Numbers 100
LTI
24:06
Free Mock Assessment
Fill up the details for personalised experience.
All fields are mandatory
Current Employer *
Enter company name *
Graduation Year *
Select an option *
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
Phone Number *
OTP will be sent to this number for verification
+91 *
+91
Change Number
Phone Number *
OTP will be sent to this number for verification
+91 *
+91
Change Number
Graduation Year *
Graduation Year *
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
*Enter the expected year of graduation if you're student
Current Employer *
Company Name *
Please verify your phone number
Edit
Resend OTP
By clicking on Start Test, I agree to be contacted by Scaler in the future.
Already have an account? Log in
Free Mock Assessment
Instructions from Interviewbit
Start Test