(Problem-C) Good String | Codeforces Educational Round 92

[@VishalYadav-gk1kg]

Very nice explanation sir, Thank you!

[@freeprojecttrainingrealtim9465]

first time I solved first four second was good problem

[@pranjalbansal8459]

bhai iski complexity smjh nhi aa rhi bs, mtlb 100 cases pr string check ho rhi h and string ki length 2*10^5 h to TLE aa jana chahiye naa.

[@nutanhotwani8967]

Hello! I have been following your videos for a long time and I wanted the solution for one question. If you could please help me with it? The question is: find total number of ways of selecting K non-adjacent cells in a matrix. I would be waiting for your video:) Or any link to the solution would also help

[@HiteshTripathi]

Question link please.

[@nutanhotwani8967]

@@HiteshTripathi This question was asked in CodeArena.. I do not have the link

[@priyanshurajtrading]

Bhai code ki link bhi daal diya karo description me samjhne me help hoti hai

[@darshanjha4086]

was waiting for this....please upload B

[@naafizrahman6538]

I have taken all the pair of numbers from 0-9 possible and tried to find the pair with maximum frequency, still I get WA.

[@HiteshTripathi]

Sequence also matters. abababababa......in this way.... But in your case sequence check nahi hoga

[@ashutoshdixit2806]

#include #include #include #include #include #include using namespace std; int min(int a, int b) { if (a < b) return a; else { return b; } } int main() { int t; cin >> t; while (t--) { string str; cin >> str; int h[10]; memset(h, 0, sizeof(h)); for (int i = 0; i < str.length(); i++) { h[str[i] - '0']++; } // cout

[@RakeshGupta-ft6cc]

Nope, I think Hitesh is wrong. It is possible. I used the same method. I stored all the indices of 0-9 in separate arrays. Then for each pair, I took the corresponding two arrays and started checking the sequence frequency using the indices stored in them

[@HiteshTripathi]

@@RakeshGupta-ft6cc bro he is saying different thing and you are saying different thing.

[@RakeshGupta-ft6cc]

@@HiteshTripathi oh ok.

[@girishgarg2816]

Bro ur image is blocking the view. Webcam view nhi bhi rakhoge toh chalega

[@HiteshTripathi]

Ok bhai.

[@fearlesscoder2054]

Bhaiya kal mai maths waale question mai hi phas gya but jab maine uska solution dekha to pta chala kitna easy tha wo,Bhaiya maths questions ke liye kya karu?,mai seive method se prime nikalne laga tha but solution mai kuch laga hi nhi aisa

[@lmlstudio2008]

thanks, helped me a lot

[@mdshahariarsadiq9995]

thanks

[@palashkamble2325]

Superb explanation bro.

[@aayush8841]

Great Explanation Bro !!!

[@SumitSingh-zw5on]

Please post the solution for problem b array walk also.

[@ramyadav-jk1mm]

i first left rotated and right rotated the string and compared them.. if they are equal i print 0 else i take the frequency of each number in the input string and store them in a map.Then i take the highest frequency and return size of string - highest frequency.If the frequency of all the numbers in the input string is 1 i return size of string - 2 Please tell me where am I going wrong.

[@rishabladha6831]

why you are considering the case that frequency of all the numbers in string is 1 , it may or may not !! but this case not going to help us much!!!!

[@girishgarg2816]

if (i == j) continue; Why didn't you add this line inside our loop while counting pairs ?

[@HiteshTripathi]

Sorry bro.

[@girishgarg2816]

But I saw your code that u submitted. You didn't write it there too but it was Accepted

[@HiteshTripathi]

@@girishgarg2816 isko naa likhne se koi galti thodi na hai....bas extra values check kar raha hai.

[@bhoumikparmar8348]

Bro Maine same logic lagaya python me par Mera tle de raha

[@ankushchhabra6092]

nice explanation

[@nikhilkumar-ot9rn]

bhai question ka link v de diya krr na ..or apne solution ka bhi...

[@jethalalnhk2409]

Good video hitesh sir

[@prakhartiwari3831]

Bro please upload solution of problem B..

[@namangirdhar8736]

I could solve only A for past two contests😬.

[@HiteshTripathi]

Same bhai....😂😂 Approach aajati hai but choti mistake se rehra😅😅

[@pranjalbansal8459]

Bhai mere smjh me aa jata h ese ese hoga bt krna nhi aa pata😂😂

[@HiteshTripathi]

Hoga bhai hoga 😂😂

[@ninadchaudhari433]

Bhai aapko first wale ka logic samjha kya iam new to coding emre slution ko toh TLE aari thhi

[@rishabladha6831]

logic : just check if l*2

[@ninadchaudhari433]

@@rishabladha6831 THANKSS!!!

[@hacksark9748]

Bhai kal bala contest fir vi acha tha

[@akhilkhubchandani2632]

Iski koi dp approach bhi hai?

[@HiteshTripathi]

Iska to koi ni hai bhai shyd ....meri samjh me😅😅

[@akhilkhubchandani2632]

Acha thanks

[@akhilkhubchandani2632]

Aapka codeforces handle kya hai?

[@HiteshTripathi]

Channel Bio

[@mukulverma8404]

Bro can u share the code?

[@HiteshTripathi]

ideone.com/HTfESf

[@mukulverma8404]

@@HiteshTripathi thanks 👍

[@jeesujain1476]

Broo can u give solution of B

[@HiteshTripathi]

Hua ni bro.....I'll try to upload.

[@RakeshGupta-ft6cc]

@@HiteshTripathi Initially, find the total sum of k elements (0 to k). that will be the initial value. Then for each i=1 to z, the max right you can go will be decreased i.e it will be 0 to k-(2*i). In this range, you need to find two adjacent elements with max possible sum. There you will use all the z operations continuously. Since z operations are designed in a particular way, this will not create any problem. codeforces.com/contest/1389/submission/88324964