Count Unique Characters of All Substrings of a Given String

No video

Count Unique Characters of All Substrings of a Given String | Leetcode 828

Рет қаралды 14,027

2 жыл бұрын

This video explains a very important interview problem which is to Count Unique Characters of All Substrings of a Given String. This problem is a common Amazon, Microsoft interview problem. It is based on counting unique characters in all substrings of a string.
CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)
======================================PLEASE DONATE=============================
🧡 SUPPORT OUR WORK: / techdose
💚 UPI-ID: surya.kahar@ybl
💞JOIN Membership: / @techdose4u
==============================================================================
INSTAGRAM : / surya.pratap.k
LinkedIn: / surya-pratap-kahar-47b...
WEBSITE: techdose.co.in/
TELEGRAM Channel LINK: t.me/codewithTECHDOSE
TELEGRAM Group LINK: t.me/joinchat/SRVOIxWR4sRIVv5...
=======================================================================
USEFUL LINKS:
🟠Must do TIPS to ACE Virtual Interview: • 🔴Must do Tips to ACE y...
🟢Best strategy to excel your coding interview: • 🔴Best strategy to exce...
🟡Get your dream job in 1 month: • 🔴Get your dream job in...
🔵How to crack dream job in just 2 months: • How to crack dream job...
🟣7 Days DSA plan: techdose.co.in/7-days-dsa-che...
RELATED LINKS:
CODE LINK: gist.github.com/SuryaPratapK/...

Пікірлер: 25

@anuragkhugshal7792 Жыл бұрын

After struggling for hours with text solutions, finally understood it from this beautiful explanation.

@techdose4u Жыл бұрын

Great :)

@gauravsingla6444 2 ай бұрын

Same

@akhilkumarp Жыл бұрын

Very good and planned explanation., Understood in a shot

@techdose4u Жыл бұрын

Great ❤️

@cunghocthuattoan7869 Жыл бұрын

Thank you so much! Very well explained!

@mdaasil2329 6 ай бұрын

Very well explained! Thanks TechDose.

@lapujain 5 ай бұрын

Your teaching style is awesome. Keep up the good work.

@tien556 5 ай бұрын

This is a master piece thank you so much!

@shashirajraja Жыл бұрын

Nice Explanation!!

@mrinalkumar9453 10 ай бұрын

Wonderful explanation❤

@RajiurRahman1 3 ай бұрын

Thank you, your explanation was very easy to understand. You made a difficult problem somewhat easy, at least "medium".

@himaniupadhyay8201 6 ай бұрын

Best Explanation with intution

@zz-oq2dt 10 ай бұрын

very smart!!!😀

@wilfredomartel7781 2 жыл бұрын

👏👏

@priyadarshinir9730 Жыл бұрын

Very Good Explanation! how's the time complexity O(N)? we have a list of list and for each list we count. isn't it a time complexity near to O(N^2)?

@ash7130 Жыл бұрын

He is using the list of lists where the first list size is fixed to 26 alphabets, thus a constant. The only time required is to traverse the inner list whose worst case is 'len_of_string', i.e. O(n).