vector - requirement of optimized solution

Question

Recently I gave an exam, In that, I was asked to solve a question about vectors. I don't remember the exact words of the question but I can explain the question using an example.

Question:

1. given vector of integers: [1,2,3,4,5,6]
2. we have to continuously add adjacent elements till the vector contains less than or equal to two elements. i.e. [1,2,3,4,5,6] -----> [3,7,11] ------> [10,11]. Here we stop as the contains only two elements.
3. and then we have to return the sum of squares of the vector elements. i.e. return 10^2 + 11^2 = 221

My solution: I solved this problem using a queue data structure. At first, I inserted the elements [3,7,11] (which is formed by adjacent elements of [1,2,3,4,5,6]) and I continued till the queue contains two elements. But I got TLE.

So I want to know how optimally this problem can be solved. So anyone please help me in finding its optimized solution. Thanks in advance.

question from:https://stackoverflow.com/questions/65915445/requirement-of-optimized-solution

Answer 1

Waitting for answers