Advent of Code 2025 - December 8th
In this series, I'll share my progress with the 2025 version of Advent of Code. Check the first post for a short intro to this series. You can also follow my pr...
In this series, I'll share my progress with the 2025 version of Advent of Code. Check the first post for a short intro to this series. You can also follow my pr...
Hey everyone! 👋 I know I've been a bit quiet lately. I actually came down with a pretty bad flu last week, which completely knocked me out. 🤒 That's why I mis...
Article URL: https://12days.cmdchallenge.com Comments URL: https://news.ycombinator.com/item?id=46190577 Points: 31 Comments: 8...
Part 1 Another math gauntlet I get to program a bunch of math operations. Some will be part of several conditionals. I've done it before. I'm confident I can d...
Problem Description Given two non‑negative integers low and high, return the count of odd numbers between low and high inclusive. Example 1 Input: low = 3, hig...
Check out my full solution for day 6 on GitHub. Part one The first part gives us a few rows of numbers and a last line with operations that are either addition...
Overview Welcome to Day 56 of the 80DaysOfChallenges journey! This intermediate challenge presents the most efficient way to compute the n‑th Fibonacci number...
!Cover image for Advent of Code 2025 - December 4thhttps://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fde...
Communities DEV Community !DEV Community Logohttps://media2.dev.to/dynamic/image/width=65,height=,fit=scale-down,gravity=auto,format=auto/https%3A%2F%2Fdev-to-...
DEV Community !DEV Community Logohttps://media2.dev.to/dynamic/image/width=65,height=,fit=scale-down,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.a...
Problem Description Create a function that returns the n-th term of the “look‑and‑say” sequence as a string. The sequence starts with '1' for n = 1. Each sub...
Problem Statement Implement a function isPrimenum that returns true if the given number is a prime number and false otherwise. Approach 1. Handle edge cases...