Day 11 in Bangalore

I'm on a mission to master programming and tackle any coding challenge that comes my way. In this series, you'll find my daily journal entries, presented as simple bullet points. Nothing fancyβjust my honest thoughts and experiences from each day. So, please, no judgment! π
Join me as I document my tech journey in Bangalore. Let's dive in!
Day 11 (10/07/24)
Today's LeetCode question was an easy one 1598. Crawler Log Folder

This one wasn't even a challenge. At first I thought I should use a stack to keep track of the operations but immediately realized that there's no need to keep track of the folder names. All we need is the depth of the folder structure at the end of all operations. If the log would be anything other than
'../'or'./'we would just add one to the depth. And if the log is'../'we would subtract one from the depth (if depth is greater than 0 obviously). At the end we just return the final depth.class Solution: def minOperations(self, logs: List[str]) -> int: n = 0 for log in logs: if log == "../": n -= 1 if n > 0 else 0 elif log != "./": n += 1 return nSince I completed Mob Psycho, I started watching Bleach. So far it's been kinda boring hoping that the 2nd arc picks up the pace.
Watched a couple episodes of Dr. House, really enjoying the show. Every episode has the exact same storyline and there's a lack of character development but it's enjoyable nonetheless.
Was looking around for the exact implementation of python lists and came across numpy arrays vs python lists. So I decided it's finally time to actually learn numpy π (And yeah I wasn't able to find the exact implementation of lists, probably should have looked in the docs now that I think about it π€)
Anyway I started watching a video series on numpy! That's about it for today, See ya!




