God bless you! (Noushin)

@@noushinb4671 I hope it was helpful Noushin!

Hello! Thank you for your videos. It’s been super helpful. Would you be able to do “Perfect Squares” question on Leetcode? I forgot the number but it’s tagged under BFS and Dynamic Programming and is one of the most commonly asked interview questions. Thank you!

@@amylee8688 Anytime Amy and thanks for the suggestion I'll throw it on my list :)

ai can help in here :)

haha thanks Pat and anytime always happy to help :')

Yooooo Daniel you just made my day dude :') I really appreciate you and everyone else who takes the time and leave a comment letting me know you appreciate the content I provide. I'm super happy to hear that you landed a job you love last year and I'm sure you're about to land another great gig I have venmo/paypal if you feel more comfortable sending money there! You can also sign up for Patreon and then cancel immediately and this way you get charged once and only once. This is my Patreon if you're interested in signing up and canceling www.patreon.com/KevinNaughtonJr, but if you want my venmo/paypal just lmk. Either way whatever you decide I appreciate you even considering donating and helping me out it means a lot to me!

@@KevinNaughtonJr Venmo is my go-to if you feel comfortable posting that!

Daniel Tovar thanks so much dude my Venmo handle is @Kevin-Naughton-1

Anytime Mayank :)

kzfaq.info/love/rvpRH4lSRjp2T6btl0lf4w try this too.. leetcode solutions...java interview questions

Not a Java person but I think concatenate operation crates a new string

Yep which in the worst case all strings are the same length :)

Yeah StringBuilder would def help it be that much more efficient :)

"+" operator, when used with String, in Java automatically gets converted into a StringBuilder by Compiler. I think they introduced this feature in Java 8 or so. Plus it makes the code look more neat and clean. So no need.

@@piyush12121 that's pretty cool. i wonder if C# does this now.

@@piyush12121 Read this www.pellegrino.link/2015/08/22/string-concatenation-with-java-8.html. Especially the conclusion.

@@JackMarchetti29 Don't think so, C# doesn't have this feature. You still need to use a StringBuilder.

Just gotta keep practicing that's all it is. Start with easy questions and honestly attempt them. Take 30 minutes and try to solve the question on your own without looking at other resources for help. Eventually, easy problem won't be that hard anymore and you can move onto harder problems and do the same thing. Also when you do have to look at a solution, make sure you understand it before moving on the next question, ideally, every question you attempt or review you'll learn something from to apply to other problems. Hope these tips are helpful!

Great advice, thank you. How many leetcode questions would you say is a good amount to practice a day?

@@iloveallparties hey brother how's life going? -junior(first year student)

I did that

Yes, it can be solved using trie. construct a trie from all the words and then find the longest common prefix. You can see the details in leetcode as well for this approach. It's given there

Yes sure

coder2701 rocks thank you!!! If you like my explanations be sure to sign up for the interviewing service I created thedailybyte.dev/?ref=kevin I’d recommend joining the annual tier if you can!

@@KevinNaughtonJr sure will join whenever my pocket permits. I am pretty sure this one shall be a good investment on self and will prove beneficial

@@coderrocks It definitely will be and amazing can't wait to see you join :)

@@KevinNaughtonJr Sure thing !

The longest common prefix has to be present in all the strings of the strs array. How is race the longest prefix when it is not present in dog ? Hence, the longest common prefix is an empty string here.

@@khyatiseth6199 what about [flow, flower, dog]? It should be an empty string too, but seems like it will return flow. Please correct me if I am wrong

no problem

also, here is another suggestion, this one is from demonware (might be too long; only a suggestion): You have a long piece of text, and you want to send it to your friend as a series of SMS messages. Your text consists of English letters (uppercase and lowercase) and spaces. The text doesn't contain any leading spaces at the beginning or trailing spaces at the end. There are no two consecutive spaces in the text. One proper SMS can contain at most K characters. If the text is longer, it needs to be split into parts. Each part should be sent in a separate message that fulfills the maximum length requirement. Text may not be split within words. The order of the words and the messages can't change, so that we can later concatenate the resulting messages to retrieve the original text. Spaces at the start and end of all messages are removed, and thus are not accounted for in the overall message length. The goal is to count the number of SMS messages needed to accommodate the whole text, keeping the length of each message less than or equal to K. The total number of SMS messages must be kept to a minimum, however; it would not be acceptable, for example, to take the wasteful approach of programmatically sending one SMS for each word in the original text! Write a function: int solution(char *S, int K); that, given a string S representing the text that needs to be split and an integer K that is equal to the maximum possible message length, returns the number of SMS messages needed. For instance, given string S="SMS messages are really short" and K = 12, your function should return 3. You could split this text into proper messages as follows: "SMS" "messages are" "really short" If it's impossible to split text into proper SMS messages, your function should return −1. Assume that: K is an integer within the range [1..500]; S is a non-empty string containing at most 500 characters: only letters and spaces, there are no spaces at the beginning and at the end of S; also there can't be two or more consecutive spaces in S. In your solution, focus on correctness. The performance of your solution will not be the focus of the assessment.

Thanks and I'll see what I can do :)

I have the same question. Would be super grateful if someone could explain!

yeah me too i wrote the exact same code and i am also getting the 9 ms and 40 MB metic

While the algo itself is quite easy, there are a couple of gotchas and/or edge cases that need to be considered for most of these questions. In this case, you want to pick the shortest string in the array as your base comparer and account for empty arrays, etc. Again, nothing hard, but can make a diff. during the actual interview under pressure

Sample: string longestCommonPrefix(vector& words) { string longestCommonPrefix = ""; if(words.size() == 0) { return longestCommonPrefix; } for(int i = 0; i < words[0].size(); i++) { for(int j = 1; j < words.size(); j++) { if(i >= words[j].size() || words[0][i] != words[j][i]) { return longestCommonPrefix; } } longestCommonPrefix += words[0][i]; } return longestCommonPrefix; }

i am not getting runtime as 1 ms plzz help

ynas is a suffix not preffix

Look up what a prefix is.

did your teacher told you about prefix , suffix ?or did they directly started putting leetcode questions up your ass?