Miscellaneous on Data Structure and Algorithms related Questions and Answers

Question :   What will be the worst case time complexity of code to find sum in given query range (l,r) in an array of size n with q number of such queries? 1. O(n) 2. O(q) 3. O(n*q) 4. O(n+q) Answer :   3 - O(n*q)