Doubt doubt doubt

#1

Bhaiya…problem statement for " Dividing Array: Greedy Algo " is not clear to me…can you explain the question with inputs…???

#2

Bhaiya…problem statement for " Dividing Array: Greedy Algo " is not clear to me…can you explain the question with inputs…???

#3

@parth_tyagi
the problem ask for divide the arrys in 2 parts and then apply operation given in the question and find min and max result for various partitions
for example
12 -3 10 0
a valid partion is [12 ,-3] and [10,0]
then the value of the operation is abs(12-10)+abs(-3-0)
similarly
another partition is [0,-3] and [10 12]
which gives abs(0-10) +abs(-3-12) ==25
another is [3,10] and [0,12]
that gives abs(3-0) +abs(10-12) ==5
and many more in which 5 is the mininum and 25 is the maximum you have to find them
if your issue still exists feel free to ask and if clear rate my experience

#4

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.