Scaler New
Practice
Referrals
Contests

Log In
Sign Up
Looking to hire? We can help

InterviewBit Academy is now Scaler Academy!

Know More ×

Programming
Time Complexity
Choose1

CHOOSE1

Which of the following is not bounded by O(n^2)?

(15^10) * n + 12099
n^1.98
n^3 / (sqrt(n))
(2^20) * n

Sign Up
to access hints and editorial solutions for CHOOSE1

Share this

Discussion

Loading...

Get Started

Sign Up using

or

Full Name *

Email *

Password *

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

Already an Interviewbit user? Log in

Log in to your account

Log In using

or

Email *

Password *

Remember Me

Forgot password?
Didn't receive confirmation instructions?
Not an Interviewbit user? Sign up

Blog
About Us
FAQ
Contact Us
Terms
Privacy Policy

Scaler Academy Review
System Design Interview Questions
Google Interview Questions
Facebook Interview Questions
Amazon Interview Questions
Microsoft Interview Questions
SQL Interview Questions
Python Interview Questions
Javascript Interview Questions
MVC Interview Questions
Angular Interview Questions
Directi Interview Questions
Yahoo Interview Questions
LinkedIn Interview Questions
VMware Interview Questions
eBay Interview Questions
Flipkart Interview Questions

Like Us
Follow Us
Email

Click here to start solving coding interview questions

Get Started

Sign Up using

or

Full Name *

Email *

Password *

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

Already an Interviewbit user? Log in

Log in to your account

Log In using

or

Email *

Password *

Remember Me

Forgot password?
Didn't receive confirmation instructions?
Not an Interviewbit user? Sign up