#leetcode

[getbreaded]

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

I just want this semester to end, tech interviews to go away, and to finally rest and get back to sewing.

[moastudiess]

10.08.2025~ Busy busy day of studying for the general coding assessment on codesignal (_T_T_)

[hauxicrook]

'F' in leetcode is for Fun

[thewinastudyblog]

this weekend summarised in one picture. hope this pays off tomorrow during the technical interview. but honestly, even if i don’t pass, i’m still going to be so proud of myself because the old me could’ve never been able to do all of this in one weekend.

[anheliotrope]

borderline impossible if you haven't mastered the tao of a specific kind of problem type:

~lc medium~

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

lc hard!! >:(

[wuwubean]

homestuck is absolutely a product of it’s time but reading it for the first time the jokes that have aged the best are the sylladex data structure ones. because in 2009 the joke was ‘13 year olds using hashmaps’ but today programming interviews are basically just tests on how well you know your data structures. suddenly this nerdy piece of worldbuilding becomes satire on how data structures are seen as the most important thing ever for no reason and it’s hilarious

[choconado]

FUCK I FORGOT KAL SUBHA CONTEST HAI I SHOULDVE SLEPT FUCK FUCK FUCK

[lazar-codes]

29/05/2025

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.

I gotta be honest, I've super rusty with thinking like a programmer, but it's really rewarding having things work.