The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+4 votes

You are given a list of positive integers along with a sequence of operations from the set $\left \{ *,+\right \}$ .You construct expressions from these two lists so that:

- The numbers in the expression are drawn from the first list, without repetition and without altering their order.
- All the operators in the second list are used in the expression, in the same order.

For example, if the two lists are $[1,3,2,1,4]$ and $[′∗′,′+′]$ the set of possible expressions you can form are

$1∗3+2,1∗3+1,1∗3+4,1∗2+1,1∗2+4,\ldots,2∗1+4,1∗3+2,1∗3+1,1∗3+4,1∗2+1,1∗2+4,\ldots,2∗1+4$

For each expression, the value is computed by bracketing operators from the right. That is, the expressions above are evaluated as

$1∗(3+2), 1∗(3+1), 1∗(3+4), 1∗(2+1), 1∗(2+4),…,2∗(1+4), 1∗(3+2), 1∗(3+1), 1∗(3+4), 1∗(2+1), 1∗(2+4),…,2∗(1+4)$

The aim is to determine maximum value among these expressions. In this example, the maximum value is $18$, from the expression $3*2+4,$ which is evaluated as $3∗(2+4) = 3*6 =18$.

You may assume that the length of the first list is more than the length of the second list.

Describe an algorithm to solve this problem.

+6 votes

+2

You are not taking into account that the numbers from the list should be in the same order, in that case max heap won't work out as it changes the order.

Your algorithm is wrong ,

Let's take an example : Numbers list 2,3,1,4 and operator sequence *,+. In this case the maximum value possible is 3*(1+4)=15 and this does not use the 3 largest number so clearly your solution is wrong.

@Arjun Suresh please the change the accepted answer to not accepted.

Your algorithm is wrong ,

Let's take an example : Numbers list 2,3,1,4 and operator sequence *,+. In this case the maximum value possible is 3*(1+4)=15 and this does not use the 3 largest number so clearly your solution is wrong.

@Arjun Suresh please the change the accepted answer to not accepted.

0

Vinay thanks a lot for pointing out my mistake. Without it I would be happy with my wrong explanation. I have edited my answer can u please check it once more and tell me whether I am wrong or not.

0

Nice explaination @Kushagra

According to me, here computing the list A_{1} should take O(n^{2}) time (since we're comparing the sum of every element of list A every element having index greater than it). Similarly for A_{2}, A_{3}, A_{4} also (since the question says we can assume that the length of the first list is more than the length of the second list).

Correct me if i am wrong.

0

The above answer is correct except the time complexity should be O(n^2 k). As pointed by @Nirmal in the previous comment

- All categories
- General Aptitude 1.5k
- Engineering Mathematics 7.3k
- Digital Logic 2.7k
- Programming & DS 4.9k
- Algorithms 4.2k
- Theory of Computation 5.4k
- Compiler Design 2.1k
- Databases 4k
- CO & Architecture 3.5k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.5k
- Admissions 568
- Exam Queries 566
- Tier 1 Placement Questions 23
- Job Queries 70
- Projects 18

48,515 questions

52,763 answers

183,377 comments

68,234 users