Practice
Resources
Interview Guides All Problems Fast Track Courses Community Blog
Contests
Online IDE
New
Online C++ Compiler Online C Compiler Online Python Compiler Online Java Compiler Online JavaScript Compiler
Free Mock
Powered By
Free Mock Assessment
Take popular mock tests for free with real life interview questions from top tech companies
Explore Mock Tests
Powered By
Mock Interview
Pair up with a peer like you and practise with hand-picked questions
Explore Mock Interviews
Scaler
magnifying glass
Profile Settings Help Requests Invite Friends
Profile Settings Help Requests Invite Friends
Login to experience InterviewBit Sign in
Profile Settings Help Requests Invite Friends
Profile Settings Help Requests Invite Friends
Login to experience InterviewBit Sign in
Practice
Improve your coding skills with our resources
Interview Guides All Problems Fast Track Courses Community Blog
Contests
Compete in popular contests with top coders
Online C++ Compiler Online C Compiler Online Python Compiler Online Java Compiler Online JavaScript Compiler
Free Mock Assessment Mock Interview
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 *
Back

Few details about your education

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

Few details about your career...

Current Company *
Enter company name
Experience *
Back

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 *

Forgot Password
Didn’t receive confirmation instructions?
  1. Courses
  2. Programming
  3. Time Complexity

Time Complexity

Go to Problems

Level 1

Time complexity of a computer program

How to calculate running time?

Asymptotic notations

Some general rules

Space Complexity

Relevance of time complexity

Go to problems
Jump to Level 2

Level 2

Introduction to pointers in C/C++

Arrays in programming - fundamentals

Pointers and arrays

Pointers and 2-D arrays

Array Implementation Details

Sorting Algorithms

Insertion sort algorithm

Merge sort algorithm

QuickSort Algorithm

Sort Implementation Details

Selection Sort

Bubble Sort

Go to problems

Math Introduction

Factorization

Base number system

Unary number system

Binary number system

Base conversions for base N

Go to problems
Jump to Level 3

Level 3

Binary Search Implementations and common errors

Binary Search Algorithm

Applications of Binary Search

Beyond Sorted Array Binary Search

Advantages and Disadvantages of Binary Search

Go to problems

For C / C++ users,

For C / C++ users ( contd ),

String Implementation Details

Go to problems

What is binary number system

Understanding data types - int

Bitwise operators

Bitwise operators ( contd.. )

Tricks with bits

Bitwise and Logical Operators :

Go to problems

TWO POINTERS

Go to problems
Jump to Level 4

Level 4

Introduction to linked list

Arrays vs Linked Lists

Linked List Implementation

Doubly linked list

Doubly Linked List Implementation

Go to problems

Introduction to Stack

Array implementation of Stack

Linked List implementation of stack

Stack Implementation Details

Introduction to Queues

Array implementation of Queues

Linked List implementation of Queue

Queue Implementation Details

Go to problems
Jump to Level 5

Level 5

Recursion basics - using factorial

Complexity analysis of recursive programs

Why recursion is not always good

Time Complexity analysis of recursion

Space complexity analysis of recursion

Maze Traversal Algorithm Using Backtracking

Graph Coloring Algorithm using Backtracking

Go to problems

Introduction to hashing

Key terms in Hashing

Hashing Techniques

Hashing Implementation Details

Hashing Summary

Go to problems
Jump to Level 6

Level 6

Why treemaps / heaps

Heap and Map Implementation Details

Heap Sort Algorithm

Go to problems

Introduction to Tree Data Structure

Binary Tree

Binary Search Tree

Implementation of BSTs

Go to problems
Jump to Level 7

Level 7

Dynamic Programming Concept

Dynamic Programming Examples

Characteristics of Dynamic Programming

Dynamic Programming Methods

Applications

FAQs

Dynamic Programming Interview Questions

Go to problems

Greedy Algorithm Examples

Greedy algorithms - When to use

Activity Selection problem

What is Greedy Algorithm?

How to Create Greedy Algorithms?

Go to problems
Jump to Level 8

Level 8

Introduction to graphs

Properties of graph

Graph Traversals ( DFS and BFS )

Example implementation of BFS and DFS

Breadth First Search

Depth-first Search

Dijkstra algorithm

Go to problems
Be a Code Ninja!

Asymptotic notations

Serious about Learning Programming ?

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

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
Amazon
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
Accenture
21:48
Palindromic Time 200
Wipro
39:32
Pangram Check 100
CognizantIBM
25:58
Climbing Stairs 150
Siemens
28:53
Integers in Strings 100
Siemens
19:23
Word Count 150
Mindtree
21:13
Extracting Numbers 100
LTI
21:58
Free Mock Assessment
Help us know you better for the best experience
Current Employer *
Enter company name
College you graduated from *
Enter university name
Phone Number *
OTP will be sent to this number for verification
+91
+91
Change Number
Edit
Resend OTP
By clicking on "Continue" I agree to be contacted by Scaler in the future.
Already have an account? Log in