#100 days of code

[bruisedconscience-reblogs]

4/100 Days of Code

I am almost finished with 173 minutes out of the 363 minutes of GDScript introductory material in my lessons… (48% complete)

And the professor massively updated and shortened the lectures today, rendering much of my progress inert. <3

FML but also Tally Ho I Guess?

[bruisedconscience-reblogs]

3/100 Days of Code

Icarus flew too close to the sun!

I got a few lessons into the prototype project and had to backtrack to the GDScript section. What do you mean shortcuts get one nowhere?!?

Still chomping away at this introductory section: it’s a doozy.

[bruisedconscience-reblogs]

2/100 Days of Code

Did the Pre-flight & Foundations sections of my Godot 4.0+ course! It took many hours (I think 6 according to the readouts?).

I’m being a poor student and skipping through some of the GDScript/Programming Fundamentals, now, to get to the good stuff— the first small game prototype, which appears to take around 2.5 hours to complete. I hope to have it completed when we meet next. Wish me luck!

[bruisedconscience-reblogs]

1/100 Days of Code 2026

It’s that time again! This year I’m tackling…

2D GDScript game development!

JavaScript sincerely kicked me in the teeth during my last 100 Days of Code. I got up to a pretty decent point of foundational knowledge and then the fundamentals (of inheritance and exporting and npm and webkit for no reason) got the better of me. My course actually changed and updated a lot for the better since I tackled it the first time, but I’m shifting gears this year.

Come with me on this journey to learn how tf nodes and signals work in Godot and maybe (if we have time) learn to develop small projects using C/C#.

[lazar-codes]

20/10/2025

I did about 3 or 4 easy HackerRank questions which weren't worth writing about here, since they were very easy and I completed them in less than 5 mins.

Frontend Mentor - News Homepage Log #2

I didn't write anything for the first log because it was just me working on the header. Today was more of the same, but I fixed a bug where the dropdown menu would re-appear if you switched from mobile to desktop, then mobile again. So...yay! Next up, the content...which will basically just be normal HTML.

[lazar-codes]

14/10/2025

HackerRank - Find the Smallest Missing Positive Integer (time: 26mins)

Listen, I got 12/15 test cases to pass, and I can't think of any other test cases I'm missing. 12/15 is 80%, so I'm calling it done. With this question, I sorted the list into ascending order and iterated through the list until I hit the first positive number, and stored that number's index. I checked to see if that number is 1, and if it isn't, then I return 1. Otherwise, I iterate through the list looking 1 position ahead to see if the next number is the current number + 1. If not, then I return what the current number + 1 would be, since that's the smallest missing positive integer.

LeetCode - Best Time to Buy and Sell Stock (time: 9mins)

Idk what to say about this one, as it wasn't that difficult. All I did was iterate over the list, and if the next value was greater than the current value, go forward to calculate the max possible profit. If it's bigger than the current max profit, replace the current with the new max profit. And that's it. I did, however, get to use a ternary operator, and I'm happy I got to to use it.

LeetCode - Best Time to Buy and Sell Stock II (time: 7mins)

I glanced at the discussions for this question and someone explained it well, where you only need to look at the adjacent value. So that's what I did; I iterated over my array of values and if the next value was greater than the current, I added their difference to my overall profit variable. At the end, I returned my profit variable. The other solutions offered by people actually explain the logic, and I mostly understand it, but I'm too lazy to re-iterate it.

[lazar-codes]

13/10/2025

LeetCode - Majority Element (time: 15mins)

I got to use my favourite data structure; my beautiful Map/HashMap. Luckily, I've gained the reflex of seeing problems involving counting the frequency of elements and immediately thinking of using the Map data structure. So, with that in mind, this question wasn't hard. I iterated over the input array and added the current element in the array as a key in the map and add a value of 1 to it. If that key already exists, then take the value of the key and add 1. Then, iterate over the the Map and find the key with the highest value, and voila, you've got the majority element (well, the key whose value is greater than the length of the array divided by 2, according to the problem description).

LeetCode - Rotate Array (time: 50mins)

Ok, so technically I completed this in 30 mins in the sense that I passed all but 1 testcase (thanks Time Limit Exceeded error), but then I continued to work on this problem afterwards and I actually solved it with my own thought process?! I cannot describe the joy I felt hitting submit and seeing the end screen saying that I passed all test cases.

I first calculated the remainder of the number of rotations divided by the length of the list, so that way I don't have to rotate the array more times than needed. Then, I created a subarray containing the numbers at the edge of the array that will wraparound and find themselves at the start of the array after the rotation. Then, I simply iterate over the main array starting at the back, and replace the current value with the value found k rotations behind it. After all the numbers have shifted, we've got to deal with the start of the array, which will be our wraparound numbers. So, I iterated over the temp array and filled out the original array with those numbers, and I got it! I'm happy.

[lazar-codes]

10/10/2025

I think I'm gonna go back to "easy" problems to boost my confidence, because despite doing this for 3 weeks now I feel like I've gotten worse at problem-solving.

HackerRank - Plus Minus (time: 9mins)

This one was too easy, but I still learned a new Java feature. If I want to get a number to a certain decimal point, I can use the DecimalFormat class to specify what my output will look like. So, after wrapping my ratio of positives, negatives, and zeros from an array into the DecimatFormat method numberFormat.format(number), I got to have my output be to 6 decimal points. Neat.

HackerRank - Mini-Max Sum (time: 4mins)

Anytime I have a problem involving an array of numbers, I first check to see if the order of numbers is important according to the question. If not, I immediately sort the array. In the case of this question, it helped to work with a sorted array because once I had the sum of all the numbers in the array, I can just subtract the first and last element of the sum to get the max and min totals, respectively.

HackerRank - Time Conversion (time: 5mins)

I did this question a few weeks ago, but the study set that I'm looking at and doing had this question, so I thought I'd give it a go again. This time, it took me less time and I used less lines of code, mostly because of the handing substring method Java has. The main part of this question is to determine whether the current time is in "AM" or "PM", and make changes accordingly. For "AM", if the hour is 12, then change it to "00". If it's "PM" and the time is 12, then don't do anything. Otherwise, add 12 to the hour. Then, combine it all together to get the time in military time (without the "AM/PM").