In D problem why can't we say that just use k operations to make all the minimum element to 1e9 and after that the answer can be max( min(2*mn ,a[i],a[i+1]) where 1
@@Harisamsharma I want to say.. Since the upper bound of the diameter will always be 2*mn or edges between the neighbours ,then is it not correct to say that just increase the bound of the diameter which is 2*mn so as to have larger values in possibility? And to do that we have to convert all the k smallest elements to 1e9.
are u able to view the editorials using the new dark theme ? it comes as page unresponsive but contest page is working fine! how does it come fr u harisam bro ?
during the contest only some some test case are checked and if those test case passes then it shows pretest passed but , after the contest is over more test case are checked if those are also passed then it shows accepted
Thank you for the amazing explanation. Did you upsolve the last 2 problems. And how should we approach those problems and someone who has never solved more than 3 problems.
Was able to do E1 myself. kind of regretting not trying it hard during the contest. will have a look at the editorial for E2 and I think i will leave F for now. and for the advice, I would say try to upsolve till at least D in every contest, that will help you a lot.
I think D is more intuitive with binary search on answer
Your explanation is always the best.
keep making these solution. you are a real inspiration
In D problem why can't we say that just use k operations to make all the minimum element to 1e9 and after that
the answer can be max( min(2*mn ,a[i],a[i+1]) where 1
due to duplicates, we don't really know which ''smallest k elements' we need to take
@@Harisamsharma I want to say..
Since the upper bound of the diameter will always be 2*mn or edges between the neighbours ,then is it not correct to say that just increase the bound of the diameter which is 2*mn so as to have larger values in possibility?
And to do that we have to convert all the k smallest elements to 1e9.
Nicely done D by making observations
Hats off man 🙌🙌
Thanks for explanation , it was awesome.
How can we manage time between college studies and coding ?
I personally have a unique approach to tackle this problem, I don't do college studies..
@@Harisamsharma then cgpa ?
Keep doing this thanks
sir according to you what is expected rating of problem C ? Thanku for the amazing explanation
I would say 1200
are u able to view the editorials using the new dark theme ? it comes as page unresponsive but contest page is working fine! how does it come fr u harisam bro ?
thanks for the explaination!! loved it
Today c was in easy side , i generally get stuck in ideal div2c , so what ratings of problems do I need to solve?
1500 ig
@@shishankrawat2105 nah man more like 1200 / 1300
please upload contest 815😑
I wrote the same code for Question A and got pretests passed and now it is showing accepted.What is pretests passed anyways?
during the contest only some some test case are checked and if those test case passes then it shows pretest passed but , after the contest is over more test case are checked if those are also passed then it shows accepted
Thank you for the amazing explanation. Did you upsolve the last 2 problems. And how should we approach those problems and someone who has never solved more than 3 problems.
Was able to do E1 myself. kind of regretting not trying it hard during the contest. will have a look at the editorial for E2 and I think i will leave F for now.
and for the advice, I would say try to upsolve till at least D in every contest, that will help you a lot.
@@Harisamsharma my current rating 1022 should i also upsolve D , i was able to solve till C in contest .
Thanks for sharing bro, It helps a lot.
iven paid on meme bro but abhi tak no response
more than a week is over
@@dubey6670 will contact you shortly!
bro will questions similar to D difficulty rating be asked in placements?
whats your thoughts?
I think D is a very Adhoc’ish problem, such problems are almost never asked in company tests.
nice explanation
can the D question be solved using dp ? if yes then do you know any intuition of it?
Well I don't think so..
@@Harisamsharma see tourist , ssrs code they have used it.
@@rohitrout6450 Tourist used Binary search on answer. I don't see any kind of dp in his code, or maybe i am missing something
@@Harisamsharma see ssrs code if you know it.
He used 3D dp there, even the tags include dp so..
Btw nice explanation 😀
nice explanation