1 . Use integer array of length 256 to represent character counts(1:17) Ex: If two strings are palindromes 2. Using two pointers in a string(2:52) Ex: Reverse a string 3. Do string math, how to convert string between characters, integers(3:55) 4. Using two pointers when comparing two strings. (5:25) Ex: Longest subsequence in two strings, Edit Distance 5. String algorithms in general. Understand the strategies used in general string algorithms.(6:30)
I'd also add, knowing algorithms for solving problems like: longest common substring edit distance isAnagram isPalindrome were all mentioned. Additionally, Knuth-Morris-Pratt Boyer-Moore string-search Rabin-Karp
The content is great! One tip for making the representation better: Auto-show the examples on the screen while you continue to talk. This is help the student visualize the example and absorb/understand it quicker.
Hey man, thanks for the work ! I've noticed u moved from code/screen videos to just talking. I imagine u have ur reasons, but just so u'll know - I got MUCH more value than now. Not because of the length difference, but cause its very useful to actually see and not only hear, when talking about complicated stuff.
Nice Video. In case of Java we prefer string for the key in HashMap as its hash is only calculated once and then cached in String pool. Strings are immutable in java.
For the "integer array of character counts", you mentioned Unicode, and it's probably worth asking the interviewer if they want to handle that. There's over 1 million Unicode code points, so that having an array of 1 million integers could be more overhead than using a hashmap, especially in a language with boxed ints, or if the input string only uses a small range of characters. I just checked in Python and on my machine an array with (17*65536) zeroes takes about 9 MB. If it's a whiteboard problem then they probably don't care, though.
Hello Sam, I am the new subscriber here. Just loved how you focused on these patterns. Could please do the same for outlining the tree? I will really appreciate that. Thanks for this great video.
Reason why I won't follow you is because you don't go over the actual info in the video and keep referencing going to tht blog. This video is anti content because you don't show examples or references- you are just going on and on talking without content.
1 . Use integer array of length 256 to represent character counts(1:17) Ex: If two strings are palindromes
2. Using two pointers in a string(2:52) Ex: Reverse a string
3. Do string math, how to convert string between characters, integers(3:55)
4. Using two pointers when comparing two strings. (5:25) Ex: Longest subsequence in two strings, Edit Distance
5. String algorithms in general. Understand the strategies used in general string algorithms.(6:30)
No 4 :longest subsequence using 2 pointers really?🤕 I think sub strings
I'd also add, knowing algorithms for solving problems like:
longest common substring
edit distance
isAnagram
isPalindrome
were all mentioned.
Additionally,
Knuth-Morris-Pratt
Boyer-Moore string-search
Rabin-Karp
thanku
The content is great! One tip for making the representation better: Auto-show the examples on the screen while you continue to talk. This is help the student visualize the example and absorb/understand it quicker.
Hey man, thanks for the work ! I've noticed u moved from code/screen videos to just talking. I imagine u have ur reasons, but just so u'll know - I got MUCH more value than now. Not because of the length difference, but cause its very useful to actually see and not only hear, when talking about complicated stuff.
I love these videos. I feel much less anxious learning the "tricks" and patterns rather than trying to memorize everything ever.
Did you get into a FAANG company?
This video is criminally underrated.
Underrated channel. Found gem.
Nice Video. In case of Java we prefer string for the key in HashMap as its hash is only calculated once and then cached in String pool. Strings are immutable in java.
this is immensely helpful as i am preparing for my interview. Thank you buddy
Having gone through these, what Sam shared are valuable tips.
Glad to hear it!
Thanks for giving me this method to practice analyse large number of problems into types...
You're welcome!
Thanks for the tips Sam... They are as always to the Point 🙏
This is really great suggestions. This is greatly appreciated. I downloaded my guide. Thank you so much.
Isnt using hashtable or array will lead to same time complexity? Infact if we have strings"aaaaa" "aaaaaaaaaaaa" Then hashtable will hold less space
Never thought string lookups in hashtable wouldn't be constant, thanks alot!
they are constant, but each look up in the hash tables has a greater overhead than look up in an array
Very helpful. Thank you !
Awesome. Hopefully there are other 'pattern' videos in the works.
There definitely are! Glad you enjoyed it.
Thanks for the awesome video mate. This is really helpful
you're welcome!
Very very informative. Thank you :)
You're welcome!
For the "integer array of character counts", you mentioned Unicode, and it's probably worth asking the interviewer if they want to handle that. There's over 1 million Unicode code points, so that having an array of 1 million integers could be more overhead than using a hashmap, especially in a language with boxed ints, or if the input string only uses a small range of characters. I just checked in Python and on my machine an array with (17*65536) zeroes takes about 9 MB.
If it's a whiteboard problem then they probably don't care, though.
Loved this
Hello Sam, I am the new subscriber here. Just loved how you focused on these patterns. Could please do the same for outlining the tree? I will really appreciate that. Thanks for this great video.
Just came across your channel. Love your explanations and all your vids. Subscribed!
Very good video. Thank you for your content. Everytime you say "we" in your intro portion it makes me think you have multiple personalities lol.
ADT patterns you need to know series? would be very beneficial and uniqiue !
From end work backwards tecnique is often used. How to identify such problem when used in array and string?
Great content ! very helpful !
1:17 to get to the point !!
was 1 minute and 17 seconds worth you being so rude? Man, people just take and take and take..
thanks
at 2:53 you mention that an array is better that a hastable..but dont both have constant look up time ?
sam + tushar the goats
haha
YES! both of them are such great teachers, subbed to both :)
i need how to do all this with examples.
For anagram can't you just sort them and compare?
I think this would require more time complexity
I think the first one is technically also a hashmap.
sorry, I need a visual rather than just talking. This info would be so great if you provided a visual while you are talking.
You have a board on your left.. why don't you use it to explain things?
Isn't ASCII 128 characters?
wow
Who can understand without practical
Reason why I won't follow you is because you don't go over the actual info in the video and keep referencing going to tht blog. This video is anti content because you don't show examples or references- you are just going on and on talking without content.
Life saver.