Facebook Coding Interview Question | Leetcode 301 | Remove Invalid Parentheses

preview_player
Показать описание
In this video, we introduce how to solve the "Remove Invalid Parentheses" question which is used by big tech companies like Google, Facebook, Amazon in coding interviews. We also cover how to behave during a coding interview, e.g. communication, testing, coding style, etc.

Please subscribe to this channel if you like this video. I will keep updating this channel with videos covering different topics in interviews from big tech companies.

Рекомендации по теме
Комментарии
Автор

I will be honest, this is the best video I have seen which explains how solution should be approached and coded in an interview. Glad that I came across this channel! Hope to see more of your videos for Leetcode problems

ronakshukla
Автор

Good solution. I'm wondering if this is a real phone screen question on a Facebook interview due to the complexity. Having 45 minutes and expecting to solve 2 questions wouldn't be enough for the first round. I guess it might be asked as just one question or for the onsite interviews.

pubamx
Автор

great explanation, subbed. Hopefully, you get more subs soon for the quality and quantity of videos you produce!!! I've made some leetcode videos myself on my channel, and I know how difficult it can be. Keep going!

AbrarSher
Автор

doing god's work sir, thank you!

kangpeng
Автор

the "uhhhh" is giving me interview ptsd

kickradar
Автор

Dude came up with compilable bug-free code while explaining it within 30 min and here I was hoping I wasn't expected to completely solve it during a 45 mins interview. :(

pizzatime
Автор

I wasted half day searching for a good solution for this hard question until I hit this video.

swagatzeher
Автор

Awesome explanation! Thanks! To those who still struggling with this one I would recommend to solve "22. Generate Parentheses" first in order to get better understanding of how to generate valid string.

Freez
Автор

Man that was hard, good explanation and handling those small edge cases at the end

edwardteach
Автор

Great explanation. You made the hard problem easy to follow. Thanks a ton

prashanthgooty
Автор

Thanks, very well explained, subscribed!

io
Автор

Great explanation. However, I am still confused why open == 0 can guarantee that the string is valid. I called the countInvalid function again but that is much slower. Could anyone explain more about the open == 0? Thanks!

yuexian
Автор

Wow best approch i am using n^n.. Can you also start sharing intution also in upcoming videos for eg in this ques how this thing clicked you that you need open bracket count ..
Btw your videos are amazing this channel is boon for coders.. And your speed of uploading videos is lit 🔥🔥.. Thankyou for opening this channel

himanshuchhikara
join shbcf.ru