Again. Lets move on. Did not do great....
- Not a great leetcode day. I finished up interval problems which was a subsection of array problems. I found really confusing approaches and was so close to the correct answer each time
- I think I lacked two things, which was drawing and my logic during the drawing phase. Also, I forgot to add in the time complexities and space!!!!!!
- I was lousy today basically. I did learn some new things however. When comparing intervals and checking if they overlap we can use a = interval1 b = interval2. This logic to check. if a[0] < b[1] and b[0] < a[1]. This logic works fine, but it tripped me up during problems, so maybe stick to the logic inside your head.
- Its a neet trick tho lol.
- also I figured out that you can append two lists by using simple concatination, and that lists have sublists capabilities like intervals[1:]
- My code was pretty long for three of the problems. I finsihed the first two with submissions, but the last one I relied on neetcode heavily. That guy is really good at explaining things
through. He can do leetcode in 12 minutes. Crazy
No comments:
Post a Comment