Fruit into Baskets
ฝัง
- เผยแพร่เมื่อ 23 ส.ค. 2024
- For business inquiries email partnerships@k2.codes Fruit Into Baskets LeetCode coding solution. This is Google's most commonly asked interview question according to LeetCode!
Coding Interviews Fruit Into Baskets (LeetCode) question and explanation.
This question is a commonly asked by the following companies: Google.
Link to problem: leetcode.com/p...
Intuition behind solution: Try to always recognize when problems are disguised as other problems! This problem in particular was really the longest substring with at most 2 characters. We continue picking fruit while we have less than 3 types. Once we have 3 types of fruit, we update our max number of fruits if necessary, discard the first type of fruit we encountered by updating our pointers, and continue picking fruit. At the end of our loop, we return our max.
My Desk Setup
Desk - bit.ly/3jfY195
Chair - amzn.to/2O9TM3r
Monitor - amzn.to/3rcSHGa
Webcam - amzn.to/2NUmwgi
Desktop - amzn.to/3tiySPL
Laptops - amzn.to/3aRoN3Z
iPad - amzn.to/2LlJzzJ
Keyboard - amzn.to/3jfbxdd
Mouse - amzn.to/36ElWtT
Wrist Rest - amzn.to/3trrHF4 (pls don't buy this)
Mouse Pad - amzn.to/2Myz2lt
Microphone - amzn.to/3atNyTA
Lamp - amzn.to/3jjfZYp
Headphones - amzn.to/3tvr0KU (new model)
Headphone Hook - amzn.to/3tr8uTC
Blue Light Glasses - amzn.to/3cDVUdK
Wireless Charger - amzn.to/39LY1uu
Keyboard cable - amzn.to/2O5p2R5
Mic arm - amzn.to/3cECZj8
Audio interface - amzn.to/36HdWIi
Cloudlifter - amzn.to/36VO6kf
Laptop dock - amzn.to/2O2DsBw
Motherboard - amzn.to/3rkiWuA
Solid state - amzn.to/3rk5vuo
CPU cooler - amzn.to/3tnwwPA
CableMod - amzn.to/3tqbtM8
CPU - amzn.to/3auG1ns
Power supply - amzn.to/3trsAxo
RAM - amzn.to/39JZcuf
Designing Data-Intensive Applications - amzn.to/2YK4ek1
Clean Code - amzn.to/3txqfB5
Meditations - amzn.to/3cDa4fi
SOCIAL
----------------------------------------------------------------------------------------------------------------
Support me on Patreon: / kevinnaughtonjr
Follow me on Twitter: / kevinnaughtonjr
Follow me on Instagram: / programeme
Follow me on GitHub: github.com/kdn251
MUSIC
----------------------------------------------------------------------------------------------------------------
Nymano - The Man Alone by FlipSpartan117 - / nymano-the-man-alone Discord: bit.ly/K2-discord
![fellow fellow - PROUD feat. INK WARUNTORN [STRING QUARTET]](http://i.ytimg.com/vi/BQrVkMPTdHE/mqdefault.jpg)
![ทางเดินชีวิต - ธีเดช ทองอภิชาติ x อ.ไข่ มาลีฮวนน่า [Official MV]](http://i.ytimg.com/vi/1f3wcG16dd4/mqdefault.jpg)
Talked to Praneeth earlier today, if you guys wanna chat let me know!
Hey Kevin! can you please come up with more videos of Facebook interview questions. I have my next round coming up next week for software engineer intern?
Kevin, do you provide 1-to-1 coaching? If so can you please provide your email or other way to contact? Would be really helpful for interview preparation.
@@dotnetking12 Hey sorry not sure how I didn't see this comment and yes I do! You can sign up for the "Onsite" tier on my Patreon if you're interested in 1-on-1 coaching! www.patreon.com/KevinNaughtonJr
@@pallavipandey796 I'm sorry I didn't see this comment somehow :( how did the interview go?
@@KevinNaughtonJr it didn't go that well..the question was to print the boundary of a tree..
But I must say your videos are really really nice
I was legit confused by the problem description so much so now whenever i refer to my life confusion i compare it to leetcode medium problems. LOL But that makes what you do even more valuable. I really enjoyed your video. interview prep cramming now, thank you so much dude
hahah that's hilarious. Thanks so much, I really appreciate it I'm happy you're finding the videos helpful. lmk if I can do anything to help you!
You knw what Kevin ! Even if i am able to solve the problem myself , I still come to watch your video and everytime our approach matches .Even you say all those things which i look for in the tutorial. Thanks for existing dude
Ngl your algorithm makes way more sense than the one in the Discussion. Like this is exactly how I was thinking about it.
I need your spotify playlist!
Interesting solution.
But you don't need a HashMap nor any other extra data structure to solve the problem.
It took me more than one hour. But I figured out an algo that uses the two pointers.
You have to swap the first and second iterator when you find the third type (you go back in the array if the last fruit is repeated).
I got faster than 93% and using less memory than 78%.
Thank you Kevin for your help. Your explanations are really clear to code it in another language.
Can you do a video on the following leet code problems:
1) 683 K empty slots
2) 1007 minimum Domino
Hi Kevin , I has scheduled for Codding and Design Interview second time after feed back from HC. I have scheduled for next to next week. Was looking if you can help to go over Codding and Design mock Interview . Let me know how and your availability to schedule any time soon.
Can we call it a sliding window problem with 2 keys at max, return max window size matching the requirement.
One interesting case if all array represent one fruit type, not sure if it’s a valid test case.
I think you missed the part of updating the max when there are more than 2 fruits in the basket. Your code did not pass all the tests in leetcode.
I kept imagining animal crossing while you were explaining about the fruit trees
Hello Kevin it is a pleasure to watch your videos, they help me a lot.
I been so confused with this problem for a while, I thought I would lose my mind. I have a phone interview with Google on Tuesday and hope I get through it. Your video helped me understand the problem a lot better (it was probably because the way the question was written). Thanks :-)
Thank you! I'm happy to hear my video was helpful. Good luck on your phone screen and lmk if there's anything I can do to help you prepare!
so how did it go?
Awesome! Very interesting solution. You are just brilliant!!
Hi, Kevin. Thanks for your answer. I think line 12, map.size()
Sorry for the late response, Off the top of my head...I think it's possible that that causes a problem because then we will always place the current element in the map with j++ but you're welcome to test it out and let me know! Thanks for the support :)
Next video: I solved all leetcode questions and here's what happened!
That would be some solid click bait
Hi, Kevin. Thanks for the explanation. Can you also discuss the time complexity for the same?
Can you please solve this using sliding window? I seem to have the logic right, but it fails for some test cases.
Hi @kevin I need your suggestion about preparation roadmap.. i know topics theorietically and doing work in ML since 2 years. Things which i do regular i remember them only but things which i dont do often i forgot everytime. So what would be your suggestion on how i do start preparation.
kevin Nick indirectly said for the same question that "Thats not how you do it , and did it using sliding window approach" , Do you agree that he is right ?
Nope. This is more extensible. Nick's solution is based on a hard assumption that there will be only two fruits. What if there were 5?
Can we use 2 hashsets for baskets
And discard if any fruit in both basket.
At last calculate weight of baskets ....
Just an idea....
Hello I need help with fruit basket code. Need to move basket left to right etc. how can I get some help ?
Hello , i have a Google phone screen interview in 2 weeks . can you help me any most important questions to practice or tips .it would be a great help .
thank you so much.very interestingggggg... i can find out the idea but i do not know how to use the hash map, i will try it soon
Coding questions asked in Google are with story outline and big paragraph to interpret and then apply coding skills on it . questions are not direct there . Could you please give tips on that ?
Is it important to learn competitive programming to crack big companies?
Hi Kevin, thanks for your videos. They helped me prepare really well for my Google on-site interviews. There was one question in my interview though that I'd to see if I got correct. Where can I ping you to discuss that question? Thanks.
That's awesome I'm so happy to hear the videos have been helpful!!! If you're interested in becoming a member of the Discord channel you can ping me there here's a link to sign up: www.patreon.com/KevinNaughtonJr
Hi Kevin, I have a coding interview on Friday with one of the media company in LA as a software engineer and I am not sure how can I prepare for this. As there are not much interview questions of this company on Glassdoor or leetcode. I am preparing leetcode medium question. If can guide me that will be much help. Thanks.
Hi next month I have a interview with Google phone interview which Datastructures and algorithms should I practice more in this crunch time? Do you have any suggestions for me?
Can I use a hashset or a dictionary/ a sorted dictionary in c#, where the key is the type of tree and value is the times it appeared in the array.
I didn't understand the last part: why max of j -1 ?
Hi Kevin,
I have upcoming interviews at Facebook and Google. How can I contact you for the same?
HIMANSHU SINGH thanks for reaching out! Check out my Patreon page if you're looking for help with preparing for your interviews! www.patreon.com/KevinNaughtonJr
so lucky. Did you get the job?
check your space and time complexity, there are way better solutions available, one such is below:
int maxSoFar = 0, currMax = 0, f2Count = 0, f1 = 0, f2 = 0;
for (int t : tree) {
if (t == f1 || t == f2) {
// just increment currMax when current fruit (t) is already our f1 or f2
currMax = currMax + 1;
} else {
// set currMax with f2Count which means currMax is over for previous one, now new fruit is picked
currMax = f2Count + 1;
}
if (t == f2) {
// update f2Count for fruit f2 count as it is need to update back with currMax when new fruit is picked
f2Count = f2Count + 1;
} else {
// reset f2Count and swap values for new fruit.
f2Count = 1;
f1 = f2;
// now consider the new fruit as f2
f2 = t;
}
maxSoFar = Math.max(maxSoFar, currMax);
}
This problem is similar to find the length of the longest subarray with 2 distinct numbers.
The explanation can be more clear. I lost you on verbosity without writing a code. Forced myself to try to understand the code explanation but the intuition was missing
Cool approach
Hi Kevin,
I have been following you for a long time. I recently had an interview with Amazon. After 6 rounds of interview I got rejected saying I need to focus on technical points. Can you please help and guide me where I went wrong? and also where else I can improve myself?
I would highly appreciate it.
Whoaaa 6 rounds???
how’d you get so good at coding? i’ve been working hard to get there, any tips?
Hey! it's been 1 year since you posted this comment, Im in the same state as you were while writing that comment, i guess, can you tell me how much improvement did u see in yourself over the course of 1 year ?
Wow, so confusing !!! this is a simple window problem. why it needs so complicated solution !!!
class Solution
{
public int totalFruit(int[] a)
{
if(a.length==1)
{
return 1;
}
HashMap m=new HashMap();
int i=0;
int j=0;
int ans=Integer.MIN_VALUE;
while(j
I have three onsites coming up next week. Have been doing a lot of leet code problems but I feel like I could use some help with these trickier problems before the onsites. Can you help?
Congrats on getting those onsites Vrezh, that's amazing! I offer services on my Patreon page to help with onsite interviews if you're interested. Hope to see you there!
Hey Kevin Can you solve 676. Implement Magic Dictionary (leetcode). Seems like this is being asked a lot on google interviews. Thanks
Anytime and I'll check it out and see what I can do thanks for the suggestion!
i thought the title said fruits basket at first lol
Can you do word ladder problem?
Hi there, how do you find the most frequently asked questions?
Thanks.
Hey! If you have a premium subscription you can sort by them. If you don't have a premium subscription I'd be happy to try and help :)
Nice video, but i can't figure out why the result isn't j-i+1 though
Hey I was also confused by this.. then I realised that he increments j when he inserts/updates an element in the hashmap. You can instead not increment j while inserting, do (j-i+1) and increment j at the end of the while loop. Refer my soln,
def totalFruit(self, fruits: List[int]) -> int:
hm = {}
i, j = 0, 0
res = 1
while j < len(fruits):
if len(hm) 2:
min_ind = len(fruits)
for val in hm.values():
min_ind = min(min_ind, val)
i = min_ind + 1
del hm[fruits[min_ind]]
res = max(res, j-i+1)
j+=1
return res
Really had to go through all the examples to understanf wtf they are asking
i dont unterstand why max=max(max,j-i)
just find max fruit you can pick in consecutive Trees since you only pick one fruit each tree, so j-i will be end - start and knowing how many fruit it pick and compare to the max, trturn the max
שבעה ימים. לא שבע. כמה קשה להקפיד קצת על עברית תקנית בפרסומת?
Awesome
Hey Kevin, thanks for the video!
is it possible to choose other programming language at Google coding interviews, such as Python? Is Java the most desired choice of the recruiters?
Moreover, is Python fine for this kind of problems, looking strictly from the programming point of view?
Hey Pawel, I've never heard of anyone having problems opting to use Python for interviews. I think Google and other companies generally have the view that if you know one language you can pick up another one pretty easily, so they don't tend to worry if you don't know a particular one. I would actually recommend it just because it's so concise, which helps when you do your whiteboarding interviews!
@@KevinNaughtonJr
Great! Thanks for the answer, Kevin.
At the moment, I am practising both languages through platforms like HackeRank, LeetCode and CodeSignal.
As I am focusing on the industry of Data Science, Python is more convenient for me to use, but Java is always at the back of my head, as the language which is nicely optimised for all the rest of the problems.
Anytime Pawel that's awesome, data science is hard!!!
got an amazon interview this season, was told to debug either java, c or c++, but all other major tech companies doesn't have a problem with choosing whatever i liked!
@@supremepancakes4388 It is good to know. Thanks for reply!
Hi Kevin, I was wondering if you offer resume advice. I've been applying to a lot of places but I feel like my resume is going in a black hole.. would love to see if you can take a look at it. Let me know if it's possible. I'll be joining your discord too. Love your vids!
Hey Jay, thanks so much I'm happy to hear you're enjoying the videos! Yes, absolutely I'd be happy to help you with your resume! If you don't mind, join the Discord server and we can discuss there :) I'm looking forward to it!
great work, kevin!
Thanks Bo!
You are doing great but please add more high level explanation to your approaches.You explain the codes line by line but a bit of graphics or pre prepared explanations are the best way to go.
line 13 - set to the counter j++ in order to preserve order of the baskets (this is later used to 'evict' the min basket when size() > 2. I agree this should be explained...
Why did you break the while loop into two if statements, instead of an if-else statement?
I see why - just reviewed the code again and it clicked. After the put in the first if statement, your map.size() could now be greater than 2, so you need to do another if statement to check its size
Because you need to check the second condition even if the first if condition trips. If that doesn't make sense lmk and I'd be happy to explain further :)
Makes sense, thanks!
@@nicholaslarovere6037 Anytime!
Won't a sliding window approach work here as well?
Yes I imagine you could also use some sort of sliding window approach :)
@@KevinNaughtonJr This is sliding window kevin
Hi @Kevin, I really like your videos. Thanks for uploading those. could you please solve this leetcode problem leetcode.com/problems/friend-circles/? Looking forward to it. Thanks!!
hey. i need help for google telephonic interview
Nupur Munda hey Nupur check out my Patreon page I offer services to help people prepare for their interviews!
can you help please?
#review
why not go through another example? first two were too simple. very weird, the cost of doing it is like 15seconds whereas the it makes things way more clear.
I have google phone interview next month. Please help me regarding preparation and gaining confidence. Thanks in advance.
Hey Rony thanks for reaching out! Consider joining the Discord channel: www.patreon.com/KevinNaughtonJr we can discuss there and I'd be happy help you however I can!
Thank you @@KevinNaughtonJr for your response. Yeah sure.
Anytime and thank you! I'm looking forward to talking in the Discord channel :)
Hi kiven i like your videos
Pls tell me more about this programming language to get job at Google
Hey! Thanks so much for the support :). I'd be happy to discuss more with you in the Discord channel if you're interested in joining? Here's the link to join: www.patreon.com/KevinNaughtonJr
@@KevinNaughtonJr That's not a link to Discord, silly. That's your Patreon page! :P
@@GRIM2594 Hahah I like to think it's worth it, but if not I still do my best to help people in the comments :)
I like the video and dislike the question.... Whoever created this question should be not promoted to interview people.
Things you should fix:
Your variable naming shouldn't be the DS name and characters.
Your explanations are fumbled, maybe a script?
If you're not going to fix your explanations, add some visuals, saying left and right with your camera showing your hands the opposite way is not ideal.
Hey Flo thanks for the advice. From my experience interviewing, naming data structures their name is actually pretty common and I've never had an interviewer complain about that. Typically I use their names because otherwise, it can become pretty confusing throughout the rest of the code (it's nice to know that your stack will always be stack, map will always be map, etc. etc.). I'm still working on my explanations, but honestly, I don't want things to be scripted. I want people to see what it's like truly explaining things on the fly (sometimes even messing up) because that's what it'll be like during real interviews! I'm still working on my production quality and editing so I'll be sure to keep that stuff in mind for future videos, thanks again!
Hopefully that makes sense....
Me: Doesn't make sense
hahaha anything I can do to help explain?