Minimum Array Sum | Detailed for Beginners | Contest Problem | Leetcode 3366 | codestorywithMIK

[@cricketsureshlucky]

thank you so much sir it means a lot to me

[@deepanshuverma6237]

tq

[@divyanshu3404]

It would be very helpful if you also post contest problems. love your approach to solve problems

[@thekindspill]

Thanks a lot for contest video ❤

[@guddukumar-v8z5l]

Thank you posting contest problems solution bhaiyya.

[@hare_krishna8411]

belive yourself ❤ aur agar greedy method se operation 1 bhi possible nahi, kyunki even after /ing by 2 maximum element can remain be maximum.

[@rahilkhera8215]

3364. Minimum Positive Sum Subarray : I tried this with sliding window but failed finally submitted with brut force. 3361. Shift Distance Between Two Strings : I tried this with prefix sum of both previous and next cost but couldn't . Finally solved with Flyod Warshall algo. Thanks for covering this question, I tried doing it greedily using Heap, but as you figured out, greedy fails.

[@Strawcontamination]

Thank you for making contest questions video

[@gui-codes]

Thank you so much for contest problems 😭😭😭 Please also post Qn-2, I could not solve it.

[@sunshineandrainbow5453]

Thank you sir, Please post question 4 as well.

[@codeandtalk6]

I overthinked in this problem

[@rrrhitk]

Please solve Qn4 too

[@Aditya-qx7nf]

1st problem : done using sliding window 2nd problem : done using hashmaps 3rd problem : got TLE when did with recursion and wasn't able to apply DP correctly

[@KrishnaTripathi1709]

Can u solve 3rd question of biweekly 144? It will be of great help

[@peterfromengland8663]

Yes🥲🥲

[@dayashankarlakhotia4943]

Please solve qn.no.4

[@gui-codes]

Qn-2 also please @codestorywithMIK

[@dayashankarlakhotia4943]

Qn no.2 public boolean isPossibleToRearrange(String s,String t,int k){ int n=s.length(); int div=n/k; Mapmpp=new HashMap(); for(int i=0;i

[@vaibhav454]

I thought of using max heap for the greedy approach

[@rajatrajgautam3224]

i used and got wrong answer

[@aws_handles]

I tried greedy after sorting. It failed and i got blank. Thank you so much for clarifying

[@dayashankarlakhotia4943]

First 🎉❤

[@jeehub041]

And isme ek chiz ha greedy fail hone ka sabse bada reason ha ki jo nums[I] greater than k hone pi hi subtract kar sakte ha , agar aise nahi dia hota tab greedy chal jaata👍

[@mohammedtawfeeq9100]

Hi

[@Tech_Explorer-d6g]

I'm a bit confused , int result = int.MaxValue; // Minimum sum , is it get initialized everytime we call the solve method and won't it affect the previous result value.

[@anushkathakur6531]

Bhaiya, same if condition ke andar jo aapne option 3 aur option 4 ka logic kyon likha.... option 3 ka logic turant lagne ke baad bhi toh ek baar op1>0 and op2>0 check karna padega na option 4 ka logic lagane se pehle....I got confused on that part that why is that working correctly within same if condition without checking for this condition ( op1>0 and op2>0)again????CAN YOU PLEASE EXPLAIN

[@ArnabBhadra02]

why op1op2 and op2op1 are in same block

[@KrishnaTripathi1709]

Missed the fourth case of both happening together

[@Resham298]

why do we explore the condition of not applying any operation pls give me example for such case it will help me to understand better.

[@AnshumanSrivastava-f9w]

Say, you have just 1 op1 and array of size 5 - that means apply on 1 and not apply on rest 4

[@the_shubham738]

don't you think that you are performing op1 and op2 on an index more than once. Please check it and make me clear.

[@codestorywithMIK]

When you apply any operation on an index i, we move to i+1 in the next recursive call. So we are never performing op1 or op2 more than once in an index i