LeetCode 763. Partition Labels (Solution Explained)

The Best Place To Learn Anything Coding Related - bit.ly/3MFZLIZ
Join my free exclusive community built to empower programmers! - www.skool.com/software-develo...
Preparing For Your Coding Interviews? Use These Resources
--------------------
(My Course) Data Structures & Algorithms for Coding Interviews - thedailybyte.dev/courses/nick
AlgoCademy - algocademy.com/?referral=nick...
Daily Coding Interview Questions - bit.ly/3xw1Sqz
10% Off Of The Best Web Hosting! - hostinger.com/nickwhite
Follow My Twitter - / nicholaswwhite
Follow My Instagram - / nickwwhite
Other Social Media
----------------------------------------------
Discord - / discord
Twitch - / nickwhitettv
TikTok - / nickwhitetiktok
LinkedIn - / nicholas-w-white
Show Support
------------------------------------------------------------------------------
Patreon - / nick_white
PayPal - paypal.me/nickwwhite?locale.x...
Become A Member - / @nickwhite
#coding #programming #softwareengineering

[@meowmr9]

Has someone ever told you how easy you make it to understand complicated problems and solutions? It's all because of you that I have started solving leetcode problems on my own and going to interview with TikTok very soon for a SDE role. Thanks for putting up all these videos online :)

[@yashchamoli8695]

hey gentleman how your interview gone?

[@Krishna42570]

Plsss doooo hackerrank,codechef and alsoo continue doingg this leetcode...anyway ur explanation is awesome

[@canobiggs]

Excellent explanation! Thank you.

[@free-palestine000]

nick coming thru with the solutions 💯

[@rollinggoronable]

old I know, but you explained perfectly, the "in at most part" made no sense reading it, you saying it was a head slap moment

[@lifeofme3172]

Loved the explanation. This is coding question from Amazon :)

[@irynasherepot9882]

Thank you very much for your excellent explanation!

[@quirkyquester]

great explanation! Thank you Nick!

[@flamencoag]

Thanks! It is more clear than explanation on Leetcode's Solution section

[@maryannegichohi7063]

Your Explanations are awesome such a life saver

[@karthikbhat181]

Thank you so much for the wonderful explanation :)

[@MrThepratik]

shout out for explaining it so well.

[@TharaMesseroux1]

Great Explanation! Thank you!

[@raam2508]

very good explanation...a question Nick ! I have a Google screening round, a telephonic one. LeetCode questions are enough for practice ? Can you please tell me what should be the good material to clear that round? Thanks in advance.

[@geetusharma3923]

Great video. Thanks a lot 😊👍

[@Abood99222]

thanks this really helped!

[@NeverGiveUp186]

Excellent approach..I wish you could be a professor at my college 🙌🙌🙌🙌

[@kamalkumar945]

Thank You Nick

[@udaychatterjee4424]

Wow! Great solution

[@anupamanair1299]

excellent solution

[@abhimanyusaini5]

Thanks, Nice explanation :)

[@u2blr]

Really nice video.
This question statement is very confusing.
Your explanation make it easy to understand

[@Noname-wp6zt]

Cool explaination

[@kirank3368]

You are awesome 👏🏽

[@sahithimangalapalli3068]

absolutely helpful :)

[@reallifegambits]

S will have length in range [1, 500] then why base condition?

[@babumon5351]

You are awesome..

[@chenpeter4817]

clear explanation

[@sunnyday12131]

good explanation ! Happy2021

[@chilld3666]

nice job!!!!

[@shubhamchourasia2265]

You are fabulous. Just want to know how do u approach such non trivial problem/solution ?

[@Cccc-es3tu]

good explanation, but i think in line 14, i should equal to start , right?

[@uzumakinaruto6945]

The answer in my case is wrong by changing the like 17 BY
arr.push_back(end+1-start);
gives a fine answer

[@GiggsMain]

How is it constance space? Isn't last_indices an array which is O(n) space?

[@90krishika]

We can do it without the extra space of int[]

[@vikramchaudhary440]

I always like your video first before watching it

[@divyabharti9879]

For loop should be int i = start instead of 0 .

[@revanthsaireddyreddammagar268]

class Solution(object):
def compressAndGetRanges(self, rangeDict):
# Compress overlapping ranges in the given rangeDict and return the compressed ranges
cRanges = [] # Stack to store compressed ranges
for key, value in rangeDict.items():
print(key, value)
# Check if the stack is not empty and if the current range intersects with the last range in the stack
if len(cRanges) != 0 and self.isIntersection(value, cRanges[-1]):
# Merge the intersecting ranges and push the merged range onto the stack
cRanges.append(self.mergeRange(cRanges.pop(), value))
else:
# Push the current range onto the stack
cRanges.append(value)
return cRanges
def isIntersection(self, range1, range2):
# Check if two ranges intersect
return (range2[0] >= range1[0] and range2[0] = range2[0] and range1[0]

[@mrfred456123]

"Wouldn't be one of my videos if I don't mess up!!"

[@irynasherepot9882]

Because he is a human

[@subramanyammalepati8655]

awesome

[@deeproy2719]

got it after seeing it in 2nd time

[@lettttt5557]

❤️❤️

[@hannahr5037]

reprisigning

[@karankanojiya7672]

Respect++

[@mohammedharoon1167]

wow 🤩🤩🤩🤩🤩🤩🤩

[@lugiadark21]

Can people actually come with these solutions in a real interview without seeing this problem before lol?

[@ps8883]

Why your channel don't show how many subscribers you have?

[@The_Promised_Neverland...]

MY CODE, ON MY OWN. kinda shitty
class Solution {
public:
vector partitionLabels(string s) {
vector res;
int n=s.size();
unordered_map mpp;
for(int i=0;i