It is a very snowy day in the Twin Cities of Minneapolis and St. Paul. Schools are closed due to the amount of snow and low visibility. It started snowing earlier this morning and according to forecast, it should end around 09:00 PM this evening. We have already surpassed the snow amount for February according to records that go back over a century. We will be receiving more snow in the upcoming days. Will see if we set other new records.
In this post I will cover a logistic regression implementation used to determine if pictures contain a cat or not. The code is based on an edited assignment for Coursera Neural Networks and Deep Learning. Continue reading “Logistic Regression with a Neural Network mindset”
It is almost time to complete the first 2-hour block of the day. I work using a technique called Deep Work. Today I got up at 05:00 AM and have been at it for about two hours. I believe I have enough time to complete this post.
I received an email message from HackerRank with the Game of Thrones – 1 challenge. The challenge is simple. We have to determine if a string of characters may be converted to a palindrome or not. Keep in mind that palindromes longer than one character are made up of pairs of characters. Continue reading “Game of Thrones – I”
Woke up around 04:10 AM and decided to go back to sleep. Later I got up at 05:00 AM. Seems like another cold morning in the Twin Cities of Minneapolis and St. Paul. The skies were clear and it seems we have a full moon.
Yesterday I worked on the Highest Value Palindrome challenge at HackerRank. I was able to complete it but did not have time to generate a post. Hopefully it will be done in an hour or so. Continue reading “Highest Value Palindrome”
I received a practice message from Hacker Rank. I like the idea to be reminded to spend some time practicing to solve a problem that is completely apart from the things I do at work or are in my learning schedule. The topic of the challenge is anagrams. You can find the description here.
After reading the description a couple times, it seems that the task is to remove characters from the two strings until we end up with two anagrams. In the example we end up with “a” as a string. Not much of an anagram. The goal is to return the number of characters removed from both strings. Continue reading “Making Anagrams”
It is Sunday in the Twin Cities of Minneapolis and St. Paul and it is starting to snow. The forecast calls for snow turning into rain. Later this morning my wife and I are going to the Mall of America (MOA) for a walk. It beats getting on exercise equipment at home and watching TV.
I selected the Funny String practice from HackerRank. Given a string one has to reverse the characters and place them in a second string. Then traverse both comparing the absolute differences among consecutive characters. If the differences match then the function should return the string “Funny”; otherwise it should return “Not Funny”. Continue reading “Funny String”
My wife is out with a friend shopping. She is expected back around 11:00 AM. At that time will start preparing lunch.
I took a look at the next Hacker Rank challenge for strings in Java. If interested you may find the description here.
Continue reading “Gemstones”
Good morning. It is a cold morning in the Twin Cities of Minneapolis and St. Paul. When I got up around 04:00 AM the temperature was around -1F. I believe it will rise during the day.
My wife left with our neighbor shopping. They should be back around noon. We are planning on making some ravioli from scratch. On workdays my wife cooks, but on weekends we both do. Have some red wine from last week which we did not finish. It should be a nice and cozy lunch. Continue reading “HackerRank in a String”
Earlier this morning I took a look at the Strong Password challenge in HackerRank. I just want to exercise my skills processing text / strings with Java.
The idea is to check if a password entered by a user follows the requirements stipulated in the challenged for a strong password. If it does not, one needs to return the number (not types) of characters missing to make current password specified by the user strong. Continue reading “Strong Password”
In a previous post I commented on waking up exactly at 05:00 AM. This morning I woke up around 04:10 AM. I guess there is some variation every day on how much sleep you get based on several factors (i.e., physical exhaustion, mental exhaustion, noise, temperature, food intake, among others). Continue reading “Python Basics with Numpy”