Пікірлер
@aman_axioms
@aman_axioms 29 күн бұрын
Bro what a beautiful explanation.... keep it up.
@dhaneshwaridobriyal2943
@dhaneshwaridobriyal2943 Ай бұрын
Great job
@Nisha-yu3sj
@Nisha-yu3sj Ай бұрын
Good ❤❤❤❤
@dhaneshwaridobriyal2943
@dhaneshwaridobriyal2943 Ай бұрын
Excellent way of teaching ❤❤
@Nisha-yu3sj
@Nisha-yu3sj Ай бұрын
Keep it up my boy ❤❤
@Gigglesoul
@Gigglesoul Ай бұрын
Nice explaination seriously thank you for making this video
@dhaneshwaridobriyal2943
@dhaneshwaridobriyal2943 Ай бұрын
Excellent 😍😍😍😍
@studyplanet4656
@studyplanet4656 2 ай бұрын
Your content is top notch 👍👍
@saumyaagarwal7
@saumyaagarwal7 2 ай бұрын
Fire bro
@shivrajahirwar4334
@shivrajahirwar4334 3 ай бұрын
Awesome explanation
@suchi3106
@suchi3106 3 ай бұрын
Awesome explanation 👏
@harshalujjaliya2743
@harshalujjaliya2743 3 ай бұрын
Nice explanation buddy🤩
@amrutaparab4939
@amrutaparab4939 4 ай бұрын
Bohot Badhiya bhaiya
@amit_dhyani
@amit_dhyani 3 ай бұрын
Dhanyawaad bro
@sandeepyadav-es9yz
@sandeepyadav-es9yz 4 ай бұрын
nice explanation man, keep it up.
@shristisrivastava7054
@shristisrivastava7054 4 ай бұрын
Very clear explanation.Thanks for sharing.
@amit_dhyani
@amit_dhyani 4 ай бұрын
Thank you
@studyplanet4656
@studyplanet4656 4 ай бұрын
You explanation is way to good , you earned the respect bro 👏👏
@amit_dhyani
@amit_dhyani 4 ай бұрын
Dhanyawaad bhai
@aagamshah3773
@aagamshah3773 4 ай бұрын
Awesome explanation😍
@amit_dhyani
@amit_dhyani 4 ай бұрын
Dhanyawaad
@PriyanshuDubey-q3n
@PriyanshuDubey-q3n 4 ай бұрын
Bhai great explanation 😍
@pokeindia5361
@pokeindia5361 4 ай бұрын
Bhaiya leetcode 3266 ka solution baniye please
@nikhilprakash729
@nikhilprakash729 4 ай бұрын
Awesome Solution Bhaiya...❤❤
@amit_dhyani
@amit_dhyani 4 ай бұрын
Dhanyawaad bhai❤️❤️
@ManasRanjanSahoocsm
@ManasRanjanSahoocsm 4 ай бұрын
Awesome explanation
@Authenticbharatiya
@Authenticbharatiya 4 ай бұрын
really good explanation
@Nisha-yu3sj
@Nisha-yu3sj 4 ай бұрын
Good ❤
@pradeepdobriyal4738
@pradeepdobriyal4738 4 ай бұрын
Superb❤
@dhaneshwaridobriyal2943
@dhaneshwaridobriyal2943 4 ай бұрын
Great explanation
@womenincodeplusplus4388
@womenincodeplusplus4388 4 ай бұрын
This is super. You are so much better than others . You should have more subscribers I believe.
@amit_dhyani
@amit_dhyani 4 ай бұрын
Dhanyawaad😄😄
@pradeepdobriyal4738
@pradeepdobriyal4738 4 ай бұрын
Great job❤❤
@dhaneshwaridobriyal2943
@dhaneshwaridobriyal2943 4 ай бұрын
Excellent way of explaining ❤❤
@amit_dhyani
@amit_dhyani 4 ай бұрын
Thanks a lot 😊
@Fam-m4i
@Fam-m4i 5 ай бұрын
It’s possible to build tree in 2*N space bro.
@amit_dhyani
@amit_dhyani 5 ай бұрын
@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
@Ralish_Unfiltered 5 ай бұрын
trying to find the solution jo easily samajh aa jaye!!!!!!Aaj jake mila thankyu so much bhai.
@amit_dhyani
@amit_dhyani 5 ай бұрын
Dhanyaawaad🙏🙏
@gigachad2419
@gigachad2419 5 ай бұрын
Perfect Explanation!!!!
@RiteshSingh-yp1sm
@RiteshSingh-yp1sm 5 ай бұрын
godlike explaination<3
@SatyamGupta-nx4zj
@SatyamGupta-nx4zj 5 ай бұрын
Bhaiya, How to identify edge cases for any problem like for problem C?
@sonu.00581
@sonu.00581 5 ай бұрын
great sir 👏
@tahmiszubair1644
@tahmiszubair1644 5 ай бұрын
nice bhaii
@maneeshaambati1402
@maneeshaambati1402 6 ай бұрын
Super solution
@dhaneshwaridobriyal2943
@dhaneshwaridobriyal2943 6 ай бұрын
Amazing !
@pradeepdobriyal4738
@pradeepdobriyal4738 6 ай бұрын
Good explanation❤
@dhaneshwaridobriyal2943
@dhaneshwaridobriyal2943 6 ай бұрын
Superb !😍❤️
@funfacts9544
@funfacts9544 6 ай бұрын
15:35 pe six conflicts hai
@amit_dhyani
@amit_dhyani 6 ай бұрын
Yup 😅
@pp15155
@pp15155 6 ай бұрын
very nice solution and yu explained very nicely thanku so much
@amit_dhyani
@amit_dhyani 6 ай бұрын
Dhanyawaad bhai
@kunjshah2991
@kunjshah2991 6 ай бұрын
please give us the solution of the code after D problem sir!!!!
@amit_dhyani
@amit_dhyani 5 ай бұрын
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
@yashwairagade3677 6 ай бұрын
your codechef rating?
@abhisheksahu1841
@abhisheksahu1841 6 ай бұрын
Nice explanation 👍👍
@AmanSinghRawat-ug6fr
@AmanSinghRawat-ug6fr 6 ай бұрын
PROBLEM D EXPLANATION WAS AWESOME🔥🔥
@ManishKumar-bn2ro
@ManishKumar-bn2ro 6 ай бұрын
Nice explanation sir..
@Shivam-wl7fg
@Shivam-wl7fg 6 ай бұрын
Bhaiya third wale problem ka explanation ma maja aa gya....thank you!
@a7lavinraj863
@a7lavinraj863 6 ай бұрын
nice hard work in explaination
@bharattaneja001
@bharattaneja001 6 ай бұрын
Best Explanation!!
@amit_dhyani
@amit_dhyani 6 ай бұрын
Dhanyawaad bhai