LeetCode Weekly contest 291 | Total Appeal of A String (Hard)

Best book for DSA revision before interviews:
amzn.to/3sLMBzU
________________________________________________________________________________________
How can you prepare for amazon:
• How can you prepare fo...
__________________________________________________________________________________________
solution to problem:
ideone.com/WsDA7h
problem link:
leetcode.com/c...
___________________________________________________________________________
All my playlists:
DSA sheet:
• 450 questions DSA sheet
Interview experiences:
• Internship tests/Inter...
Leetcode problems:
• leetcode problems
projects for resume:
• Projects for Resume
___________________________________________________________________________
Connect with me on LinkedIn:
/ aditya-rajiv-0606491a5
Connect with me on Instagram:
/ adi_rajiv
#dsa #leetcode #contest #cp #coding #stl #gfg #arrays #algorithms #datastructure

[@ujjvalcodes3629]

One of best explaination on the internet! Keep up the good work. :)

[@DanielPinchuk]

Your explanation is better than several others I tried to understand. Thank you!

[@cunghocthuattoan7869]

You're the best out there. Thank you!

[@ashwinjain5566]

great explanation for this problem. this is a great combinatorics problem.

[@riteeshbommaraju]

Beautifully explained Aditya !! Thank You !!

[@kushrajendragandhi3559]

Amazing explanation. Thank you so much

[@gowthamreddyuppunuri4549]

Nice explaination!!!

[@ayushanandtripathi352]

you hadn't explain how u count the number of subtring with atleast one alphabet

[@adityarajiv6346]

Please watch the video again👍

[@pradhumnsharma4517]

@@adityarajiv6346 sorry bro. But you only focus on the fact that each character only contribute 1 time if it present in substring. You won't explain how to get those substring in which our concern character is not present.

[@sachinchatterjee2976]

Good explanation. Keep it up😊

[@Atharv1998]

Wonderful solution

[@swapnilkumar4411]

Very good explanation

[@hymnish_you]

Legend , Thanks

[@adityarajiv6346]

You're welcome!