Test your understanding of time and space complexity with this quick quiz. Strengthen your algorithm analysis skills and prepare for coding interviews effectively.

Time and Space Complexity Quiz

What is the time complexity of multiplying two square matrices of size n × n using the naive method?


What is the time complexity of the following code? 

What is the time complexity of the following function?

 What is the time complexity of the binary search algorithm on a sorted array of n elements?

What is the average time complexity of insert, delete, and search in a hash table?

The time it takes when the algorithm performs the most work.

The time it takes when the input size is smallest.

The time it takes when the algorithm performs minimal work.

The average time taken across all inputs.

 Which of the following correctly describes best-case time complexity?


Merge Sort has a recurrence relation of T(n) = 2T(n/2) + O(n). What is the time complexity?


What is the time complexity of the following loop?

 What is the time complexity of the following code?


What is the space complexity of the following function?

Given the recurrence: T(n) = 2T(n/2) + n / log n, what is the time complexity?


What is the time complexity of Dijkstra’s algorithm using a binary heap and adjacency list?


What is the time and space complexity of this recursive function?

If a dynamic array doubles its size when full, what is the amortized time for n insertions?

In memoized Fibonacci, what are the time and space complexities?


In 0/1 Knapsack with n items and capacity W, what is the optimized space complexity to compute only the maximum value?


What is the worst-case time complexity of solving the N-Queens problem using backtracking?


Big-Omega gives the upper bound on runtime.

Big-Theta provides both upper and lower bounds.

Which of the following statements is true?


What is the time complexity of accessing the k-th element in a singly linked list?


What is the space complexity of a 2D matrix of size n × m?
