Пікірлер
@saumyaagarwal7 2 күн бұрын
Fire bro
@shivrajahirwar4334 19 күн бұрын
Awesome explanation
@suchi3106 29 күн бұрын
Awesome explanation 👏
@harshalujjaliya2743 Ай бұрын
Nice explanation buddy🤩
@amrutaparab4939 Ай бұрын
Bohot Badhiya bhaiya
@amit_dhyani Ай бұрын
Dhanyawaad bro
@sandeepyadav-es9yz Ай бұрын
nice explanation man, keep it up.
@nikhilprakash729 2 ай бұрын
🙂🙂🙂 Nice..
@shristisrivastava7054 2 ай бұрын
Very clear explanation.Thanks for sharing.
@amit_dhyani 2 ай бұрын
Thank you
@studyplanet4656 2 ай бұрын
You explanation is way to good , you earned the respect bro 👏👏
@amit_dhyani 2 ай бұрын
Dhanyawaad bhai
@aagamshah3773 2 ай бұрын
Awesome explanation😍
@amit_dhyani 2 ай бұрын
Dhanyawaad
@PriyanshuDubey-q3n 2 ай бұрын
Bhai great explanation 😍
@pokeindia5361 2 ай бұрын
Bhaiya leetcode 3266 ka solution baniye please
@nikhilprakash729 2 ай бұрын
Awesome Solution Bhaiya...❤❤
@amit_dhyani 2 ай бұрын
Dhanyawaad bhai❤️❤️
@ManasRanjanSahoocsm 2 ай бұрын
Awesome explanation
@Authenticbharatiya 2 ай бұрын
really good explanation
@Nisha-yu3sj 2 ай бұрын
Good ❤
@pradeepdobriyal4738 2 ай бұрын
Superb❤
@dhaneshwaridobriyal2943 2 ай бұрын
Great explanation
@womenincodeplusplus4388 2 ай бұрын
This is super. You are so much better than others . You should have more subscribers I believe.
@amit_dhyani 2 ай бұрын
Dhanyawaad😄😄
@pradeepdobriyal4738 2 ай бұрын
Great job❤❤
@dhaneshwaridobriyal2943 2 ай бұрын
Excellent way of explaining ❤❤
@amit_dhyani 2 ай бұрын
Thanks a lot 😊
@Fam-m4i 2 ай бұрын
It’s possible to build tree in 2*N space bro.
@amit_dhyani 2 ай бұрын
@user-tt7po9td3x yes bro there are techniques in which we can store segment tree in less than 4n. But the technique that i have discussed will take atmost 4n. For your reference you can refer it. stackoverflow.com/questions/39542049/segment-tree-space-requirement Another reference www.quora.com/Why-does-a-segment-tree-need-a-4n-size-array-Why-not-2n-1 You can refer some other resource as well
@Ralish_Unfiltered 2 ай бұрын
trying to find the solution jo easily samajh aa jaye!!!!!!Aaj jake mila thankyu so much bhai.
@amit_dhyani 2 ай бұрын
Dhanyaawaad🙏🙏
@gigachad2419 2 ай бұрын
Perfect Explanation!!!!
@RiteshSingh-yp1sm 3 ай бұрын
godlike explaination<3
@SatyamGupta-nx4zj 3 ай бұрын
Bhaiya, How to identify edge cases for any problem like for problem C?
@sonu.00581 3 ай бұрын
great sir 👏
@tahmiszubair1644 3 ай бұрын
nice bhaii
@maneeshaambati1402 3 ай бұрын
Super solution
@dhaneshwaridobriyal2943 3 ай бұрын
Amazing !
@pradeepdobriyal4738 3 ай бұрын
Good explanation❤
@dhaneshwaridobriyal2943 3 ай бұрын
Superb !😍❤️
@funfacts9544 3 ай бұрын
15:35 pe six conflicts hai
@amit_dhyani 3 ай бұрын
Yup 😅
@pp15155 3 ай бұрын
very nice solution and yu explained very nicely thanku so much
@amit_dhyani 3 ай бұрын
Dhanyawaad bhai
@kunjshah2991 3 ай бұрын
please give us the solution of the code after D problem sir!!!!
@amit_dhyani 3 ай бұрын
Hey Bro, Sorry i was busy with some other stuff. Here is the code #include <iostream> #include <cmath> using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; int C = floor(log2(n)) + 1; cout << C << endl; for (int i = 1; i <= n; ++i) { int color = floor(log2(i)) + 1; cout << color << " "; } cout << endl; } return 0; }
@yashwairagade3677 3 ай бұрын
your codechef rating?
@abhisheksahu1841 3 ай бұрын
Nice explanation 👍👍
@AmanSinghRawat-ug6fr 3 ай бұрын
PROBLEM D EXPLANATION WAS AWESOME🔥🔥
@ManishKumar-bn2ro 3 ай бұрын
Nice explanation sir..
@Shivam-wl7fg 3 ай бұрын
Bhaiya third wale problem ka explanation ma maja aa gya....thank you!
@a7lavinraj863 3 ай бұрын
nice hard work in explaination
@bharattaneja001 3 ай бұрын
Best Explanation!!
@amit_dhyani 3 ай бұрын
Dhanyawaad bhai
@akshaanshsrivastava9817 3 ай бұрын
Great Explanation SIr.
@roshangeorge97 3 ай бұрын
loved the third problem explanation!
@pgigamingtelugu3505 3 ай бұрын
But, for the final example you took the answer should be 7 right? Q-> [5,3,2,6,7] solution: [2,3,5] [3,5] [2,3,5,6] [3,5,6] [2,3,5,6,7] [3,5,6,7] [5,7] which is 7. Explain?
@manpatel9157 3 ай бұрын
Bhaiya, In Problem-C (Binary Conversion), Constraints is given that 1 <= K <= N. So I didn't check for N==2 case and not able to solve it just bcoz of their wrong Constraints.😏😒😔
@39_jatinjain4 3 ай бұрын
Can u tell why it is giving WA- const int MAXN = 200001; bool prime[MAXN]; void sieve() { fill(begin(prime), end(prime), true); prime[0] = prime[1] = false; for (int p = 2; p * p <= MAXN; p++) { if (prime[p]) { for (int i = p * p; i < MAXN; i += p) { prime[i] = false; } } } } void solve() { ll n; cin >> n; vector<ll>b(n+1); for (int i = 2; i <= n; i++) { if (prime[i]) b[i]=1; else{ if(i%2==0){ ll val=b[i/2]; b[i]=val+1; } else b[i]=b[i-1]; } } b[1]=*max_element(all(b))+1; cout<<b[1]<<endl; for(int i=1;i<=n;i++) cout<<b[i]<<" "; cout<<endl; } int main() { sieve(); int t; cin >> t; while (t--) { solve(); } return 0; }
@pritamchakraborty8541 3 ай бұрын
very good content sir
@gauravpunia4527 3 ай бұрын
bhaiya itna kse soche mtlb intna depth m jake mne ye question dp se try kra but it gives me tle
@pradeepdobriyal4738 3 ай бұрын
Amazing explanation❤❤❤❤🎉