Quiz on Prefix Sum for DSA: Question 4

Last Updated :
Discuss
Comments

What is the time complexity of constructing a prefix sum array for an array of size n?


O(n)

O(log n)

O(1)

O(n^2)

This question is part of this quiz :

Quiz on Prefix Sum for DSA
Tags:
DSA
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy