B. Equalize | Codeforces Round 924 (Div. 2) Solution | Abhinav Awasthi

[@AbhinavAwasthi]

Join Telegram: telegram.me/cpabhinav
Do comment "Helpful", if it is.

[@itsmepratham2712]

indeed a good explanation

[@AbhinavAwasthi]

Thanks

[@akashbarik4761]

Great Explanation :D

[@AbhinavAwasthi]

Thanks

[@prodrago1224]

Thank you so much

[@AbhinavAwasthi]

Welcome

[@VISHALKUMAR-lj7fs]

amazing tutorial sir

[@AbhinavAwasthi]

Thanks

[@AyushMishra-b8w]

Helpful sir

[@AbhinavAwasthi]

Thanks

[@aliyazdan6282]

Great explanation :)

[@AbhinavAwasthi]

Thanks

[@kshitijraj1320]

great solution 🙌🙌

[@AbhinavAwasthi]

Thanks

[@mihiraswal3165]

Great video

[@AbhinavAwasthi]

Thanks

[@phuan462]

in your example, 1 - 8 can always be the same after adding, is it your mean? please reply :

[@AbhinavAwasthi]

Didn't understand your question

[@phuan462]

@@AbhinavAwasthi i mean after erasing and sorting, in your example, from 1 - 8 (from left to right, 5 indexs), can always be the same when add?

[@ShivamSinghRaghuwanshi]

Helpful

[@AbhinavAwasthi]

Thanks

[@unkownname377]

Why do u add n every time to x , not n-1 or etc

[@AbhinavAwasthi]

Can you pin timestamp where you have doubt

[@its-me-neha]

Greate

[@AbhinavAwasthi]

Thanks

[@Krishbhatt-yb3tz]

sir why we did x+n where x=v[i]

[@AbhinavAwasthi]

so that we can know how many numbers are between x and x+n, bec all these numbers can become equal to x+n

[@vignesh1693]

We are adding n because we want maximum range

[@mmbmmbmmb]

couldn’t do it in the contest😔

[@AbhinavAwasthi]

Keep trying

[@preetu391]

Helpful!

[@AbhinavAwasthi]

Thanks!

[@gurnishsingh257]

nhi chl rha

[@AbhinavAwasthi]

Kya

[@arpitgupta2358]

getting wrong answer for test cases 5
1 10 100 1000 1
2
3 1

[@AbhinavAwasthi]

Ohh, may be test cases updated