#leetcode

Maybe a white (blue) board will help me figure these LC problems out.

~lc medium~

combine 4 easy as fuck things into a program that no longer fits on the back of a napkin:

Today was my personal day off from school, which was very much needed. This past week has shown me how hard it will be to do school and programming. I've been trying to do at least a LeetCode question a day, but that has definitely not been happening. Except for today! I was stuck on a LeetCode problem (Longest Palindromic Substring) for a few days, and one night I was falling asleep and my brain figured out the logic, and today I finally implemented it and got it! I don't think it's the most efficient way of solving it, but whatever, I did it.

I essentially had 2 for loops, where the outer loop starts at the start of the string and the inner loop stars at the end of the string. If the letters in both positions are the same, then create two pointers, one at each position of the string. Then, while the right pointer is greater than the left and the letters at both pointers are the same, narrow that window. If, at the end of the while loop, the right pointer is less than the left, that means that there was a palindrome, and you can create that palindrome by creating a substring using the indexes of the i and j variables. Comparison of the current palindrome's length with the old palindrome's length is needed too, of course.