วีดีโอ

very helpful and easily understood

can anyone tell me which note taking app is he using ?

B was so confusing 😢

Ok

Learn from the best! TLE 11.0 offers live classes with top mentors. Join TLE 11.0 today at www.tle-eliminators.com 🚀🚀🚀

Please fill the Feedback form for PCD: forms.gle/55hH4bxtYXFmbwWu6

Worst explaination

-test- *comment*

can anybody give me the explanation of c using stack...

D was cool. thank harsh

Am I the only person who find it difficult to directly come up with state and transition like priyansh does?

What website are you using as online board, pretty dope.

nice explanation buddy

Learn from the best! TLE 11.0 offers live classes with top mentors. Join TLE 11.0 today at www.tle-eliminators.com 🚀🚀🚀

Please fill the Feedback form for PCD: forms.gle/Puc5UJri7p7gn7Nm6

bhaiya kya hum usaco k doubts bhi puch skte h. me ioi aspirant hu

OG video!

Understood!

Excited

I am from Bangladesh, how can I enroll in this course? I have no card so how can I pay?

Gaurish OP 🔥

what an explanation💥👏

I am always able to solve A and solve level B like 50% of the time. Im not active on cf but have done 150+ leetcode problems and im good with all data structures except graphs and dp. Level 2 or level 3?

Even I solve my questions on phone 😊 from cxx droid app

Question C :- Failed on 2nd testcase Can anyone explain why this code is not working #include <bits/stdc++.h> using namespace std; #define int long long bool check(vector<int>& b) { for(int i : b) if(i != 0) return false; return true; } void sub(vector<int>& b, int diff) { for(int i=0;i<b.size();i++) b[i] = abs(b[i] - diff); } void solve(int n, vector<int>& b) { int cnt = 0; if(check(b)) { cout << 0 << endl; cout << endl; return; } vector<int> subs; for(int i=0;i<n-1;i++) { if(b[i] == b[i+1]) continue; if((b[i] + b[n-i-1]) % 2 == 0) { int avg = (b[i] + b[i+1]) / 2; subs.push_back(avg); sub(b, avg); cnt++; if(cnt > 40) break; } else break; } subs.push_back(b[0]); sub(b, b[0]); cnt++; if(check(b) && cnt <= 40) { cout << cnt << endl; for(int i : subs) cout << i << " "; } else { cout << -1 << endl; return; } cout << endl; } signed main() { #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif int t; cin >> t; while(t--) { int n; cin >> n; vector<int> b(n); for(int i=0;i<n;i++) cin >> b[i]; solve(n, b); } return 0; }

He will easily get hired into DE Shaw

Form link to apply for the free slot: forms.gle/feKSPxSkDmwdSpZn7

Great Explanation but i need to grind more in order to tackle this type of questions.

nice explanation

very good explaination.... keep working

Bhaiya i m new to Codeforces, but i have solved 300+ questions on leetcode and have a contest rating of 1750 on LC. Which course should I take ?

should i take level 1 and level 2 both, is it manageable because i already know most of the concepts of both the levels just need to practice a bit more, and i think 3 months just for level 1 is too much. So should i buy the both?

how i can get free access to the courses ?

Learn from the best! TLE 11.0 offers live classes with top mentors. Join TLE 11.0 today at www.tle-eliminators.com 🚀🚀🚀

Please fill the Feedback form for PCD: forms.gle/BYwJLjRKemvRXBPj6

can you help in finding best dsa pattern questions so that oa clear ho jaye......because oa m alag level k hi question aate h..samjh nahi aata kaha se kru wese questions ki practice....if you have can you share it?..

bhaia i have solved 180 question , able to solve div 2 a b , but my greedy and constructive , adhoc is not strong , but i have completed theory of these but lack in practise , should i join level 4 or level 3 ?

Thank you so much for this in-depth content on OA tests, I just wanted to know do you prefer CSES/CP-31 for these tests as both contain non-standard problems ?

thanks for the solutions

bro press f7 to disable that cursor on clicking on webpage like at 23:59

how are the cases handled when the entire rectangle itself is inside the circle.

Bhai love from Bangladesh. Bhai I also want to freely access your course .

love from Bangladesh

Forreal, everyone talking about interview prep when online coding assessments are harder and what you must pass first to get the technical interview

The solution of problem D feels really weird as there is no systematic approach to come to the solution. What I say is, when the problem asks many different values of a quantity to choose which satisfy some particular conditions, while the constraints are just high that only greedy can be applied, in this case, can we think something like first calculate the the biggest chunk of the quantity at a particular higher value and then just distribute the remaining chunk in the lowest values possible?? Can we follow this greedy strategy in these type of situations?? You guys would have seen tons of these kind of problems so I just wanted your thoughts in this. As the greedy is mostly difficult to prove, so I'm asking if it works. Thanks.

9:00 second question

I used prefix sum array in q3 but it gave me tle in 10th last test case