C. Not Adjacent Matrix | D. Same Differences | Codeforces Round

[@VishalYadav-gk1kg]

Very nice explanation!, Thank you!

[@codeExplainer]

Glad it was helpful!

[@Marcelo-yp9uz]

thank you so much!

[@codeExplainer]

Glad it helped!

[@x_x3557]

for(int i=0; i= 1) count += mp[ arr[i] - i ]; mp[ arr[i] - i ] ++; } I am getting the right answer even with this

[@lakshyachhangani1056]

In c question simple sol . I just printed the first n odd numbers in a row and then printed all even numbers in a row for eg 1 3 5 7 9 11 13 15 2 4 6 8 10 12 14 16

[@codeExplainer]

nice observation.

[@Advebtures-hx4hv]

My solution likes you bro 🥰

[@akshay7047]

My Solution : Just add N to every next index in circular loop start with 1 . for next iteration take (2nd value of previous line + 1) and again increment by N eg for 3 : 1 4 7 5 8 2 9 3 6 here for 2nd line I have increamented it from 2nd valu of first line i.e. 4 so next line will start with 4+1 = 5

[@akshay7047]

code (c++ ): #include using namespace std; int main() { int len; cin >> len; int count; while (len--) { cin >> count; int ans[count][count] = {}; if (count == 2) { cout

[@codeExplainer]

nice logic..

[@its_neel_ok]

i solved like this -- void solv(){ int n;cin>>n; if(n==2){ cout

[@ajaib1313]

E was also easy , we can take * as 1 and . as 0 , so we obtain a binary string , the problem reduces to finding min no of adjacent swaps to group all ones together , it's available in stack overflow 🎉

[@codeExplainer]

oohh nice..

[@ishankbansal9239]

I have done C in very lengthy way I have filled the consecutive values daigonally

[@codeExplainer]

yes , nice observation.

[@SoumyajitMondal]

Can't we do D without Map consept ??

[@satishprajapati1684]

your CF handle ?

[@codeExplainer]

codeExplainer

[@pushpaksambhe7405]

Bhaiyya code for problem D I saw u was messing around it!! Anyways contest was good.. void solve(){ int n;cin>>n;int a[n+1]; unordered_mapm; for(int i=1;i>a[i]; m[i-a[i]]++; } int ans=0; for(auto i:m) ans+=i.second*(i.second-1)/2; cout

[@sanskarkumar7984]

C explanation was really good. I thought of a very lengthy code 😅😅😅. Solved 4 in the first hour.

[@codeExplainer]

Great job!

[@aaravbhardwaj8065]

bhaiya ess question pe video bando pls LEETCODE: 1851. Minimum Interval to Include Each Query

[@sumitmukharjee5816]

bhaiyya how u come up with such logics I was only able to solve 1st two question in 1 hour

[@codeExplainer]

practice

[@19csead17]

Bro talk in hindi, my ears were bleeding after hearing this!

[@codeExplainer]

sometimes it happens , i am not to good in fluent English , but i am trying.

[@mohitmalik4610]

bhai english bolke angreez nhi bn jayga , hindi me ache se smjha payga plz use hindi

[@codeExplainer]

bhai bhut channel hindi mei banate hai vaha se dekhle..

[@pushpaksambhe7405]

@@codeExplainer patt se head shot😂 When they will face interview then they will try to watch every explaination in english