Codeforces Round 993 (Div 4) | Video Solutions - A to G2 | by Pradyumn Kejriwal | TLE Eliminators

[@TLE_Eliminators]

TLE 12.0 - Our Competitive Programming course TLE 12.0 is live! Enrol now at www.tle-eliminators.com/ Please fill in the feedback form for PCD: forms.gle/83NCS1yH5hcVdWqr7

[@Abhishek-e6d2c]

Awesome explanation for g2!!

[@SplitzAcc]

Man Absolutely Loved it !!!

[@animeshkumarmaitreya5942]

Great explanation and intuition! loved it!

[@Navdeep-b8m7m]

good explanation !

[@rickparamanik580]

WellExplained!!

[@AMANKUMARMAURYA-x6m]

it was well explanation!!! loved it

[@yashkalia2311]

Helped !!!

[@arsolevelsciencenotes230]

day 1: <a href="#" class="seekto" data-time="2924">48:44</a>

[@ghostmonk]

Why my rating is not increased after this contest

[@hitarthvachhani2483]

khbr nai bhai

[@pradyumnkejriwal3007]

@@ghostmonk rating changes have not come yet. It takes 1-2 days in div3 and Div4 type contests

[@ghostmonk]

@@pradyumnkejriwal3007 oh! ok thanks

[@rishia8262]

Why are we going with lower bound? Can't we just do simple binary search whether P ,Q present in A and B whereas in lowerbound we can get true for the values which are greater than p and q

[@pradyumnkejriwal3007]

you would have to implement binary search yourself in that case. There is no function in C++ STL which returns whether an element is present in a sorted array using binary search. lower_bound does simple binary search by itself

[@rishia8262]

What if the values are greater than p or q

[@pradyumnkejriwal3007]

@@rishia8262 then lower_bound will return a value greater than p, so *lower_bound(p) == p won't be true

[@rishia8262]

Thank youuu got it. Btw you're explaination is very good.

[@pradyumnkejriwal3007]

@@rishia8262 thanks! It means a lot

[@AppMaruf]

Ur cf handle please

[@pradyumnkejriwal3007]

@@AppMaruf Prady

[@coder-ky4yx]

but

[@july36site]

bro would you mind improving your handwriting a bit more better?

[@pradyumnkejriwal3007]

@@july36site sure I'll take care about that. Thanks for the feedback!

[@shivanshagrawal8810]

worst explaination ever

[@AkshatGupta-ug6ex]

sahi se padha le bhai

[@shreshth1961]

Inko samjhana nhi aata yr

[@pradyumnkejriwal3007]

Sorry agar samajh nahi aaya toh.. I'll definitely look at your feedback and try to improve my explanation. Meanwhile if you have a small doubt in any specific part then I'll be happy to explain it here

[@SritamNanda-x5h]

@@pradyumnkejriwal3007 please give the binary search solution for question E

[@Paradox82827]

@@pradyumnkejriwal3007 sir smaj me aaya u give ur 100% to explain . one request that please take sample testcases wich are given in question as well

[@pradyumnkejriwal3007]

@Paradox82827 noted