Quiz on Sliding window Technique for DSA: Question 2
Last Updated :
Discuss
Comments
Which of the following is the time complexity of using the sliding window technique to find the maximum sum of any subarray of size k in an array of size n?
O(n^2)
O(n)
O(k * n)
O(k)
This question is part of this quiz :
Quiz on Sliding window Technique for DSATags:
Share your thoughts in the comments
GeeksforGeeks
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