It’s warm outside, and although it’s expected to be windy later, the weather is quite pleasant right now. I don’t have much to share, but there’s a strange urge to write. It’s a curious feeling—wanting to express myself when nothing specific comes to mind.
Easter is approaching this Sunday, and it has become a bittersweet holiday for me. I have always loved Easter; it symbolizes the arrival of spring, with flowers blooming and vibrant colors everywhere. However, there’s another side to it. Easter marks the day Kevin passed away. It was a beautiful day spent in the park with family. Alexis was so joyful and didn’t fuss at all, and Karissa was having a wonderful time with her cousins. White butterflies danced around us throughout the day. I didn’t learn about Kevin’s passing until later when my parents arrived. They had been in Las Vegas for the week, and I was unaware they’d returned early. Somehow, my dad managed to find me; he had spent the entire day calling to locate me and the girls after learning the news that morning.
Despite the pain associated with that day, I still cherish the holiday. Kevin wouldn’t want me to let that event overshadow my joy. I’m looking forward to Easter this year. We’re heading to a friend’s house to plan our trip and play games. It should be a lovely day.
Mother’s Day is approaching, and it will be a challenging day for Kel. I’ve always found Mother’s Day to be somewhat complicated. On the one hand, it’s a lovely occasion to celebrate with my girls. On the other hand, my relationship with my mom is strained, which makes it difficult to navigate the holiday. It’s a complicated mix of emotions.
In coding, I’m reading about singly linked lists. A singly linked list is a type of data structure made up of nodes, where each node contains:
- Data – the value stored in the node (like a number or string).
- Next – a reference (or pointer) to the next node in the list.
Think of it like a chain where each link (node) knows where the next link is, but not the one before it.
Example:
[A] -> [B] -> [C] -> null
- [A] is the head (first node).
- [C] has a next of null because it’s the tail (end of the list).
- You can only move forward through the list, not backward.
- prev (starts as null)
- current (starts as head)
- next (temporarily stores current ‘next’ before you change it)
I need to write a function that reverses a singly linked list. I need to walk through the list and reverse the ‘next’ pointer of each node so it points to the previous node instead of the next.
From my reading, I need to keep track of:
So far I have:
function reverseLinkedList(head) {
let prev = null;
let current = head;
}
The wind is so strong that our internet went out. I reset the modem a few times before it finally came back on. It’s after 5, and I haven’t had my hot tea yet. I plan to do that now and perhaps read or watch YouTube for a little while. We’re making dinner at 6, just something simple. Kel is preparing some chicken, and Karissa will be making rice shortly. Tommy has band practice, so I’m not sure what he’ll have for dinner. Sandy keeps trying to curl up in front of my keyboard while I’m typing, which I’m taking as a sign to go make myself some tea.
