Highest Value Palindrome

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”

Mars Exploration

Last Friday I received a message on my Google Gmail account. I just read the first line without opening the message. The message required me to select a date and time for this week. I decided that due to the amount of messages that I receive everyday and that it was Friday afternoon, I would answer it first thing Monday (today).

This morning I looked for the message and I could not find it. I looked in the trash and deleted folders with the same result. I did a Google search to see if there is a feature in Gmail to send a message and if the receiver does not reply within a specified time period, you would be able to automatically delete it. I was not able to find such feature. Hopefully the person that sent it will be kind enough to resend when they do not receive a reply from me.

OK, let’s look at this HackerRank challenge. Moving forward will try to pick up problems with higher difficulty level. Continue reading “Mars Exploration”

Making Anagrams

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”

Funny String

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”

HackerRank in a String

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”

Equal Stacks

While I was waiting for some tests to complete I checked my Gmail and found a message from HackerRank suggesting a challenge. The Equal Stacks challenge may be found under Practice > Data Structures > Stacks > Equal Stacks. I read the description for the problem and decided to tackle it using stacks; how creative of me. Continue reading “Equal Stacks”

Transform Strings

It is Sunday morning in the Twin Cities of Minneapolis and St. Paul. Woke up around 04:30 AM and spent the next couple hours working on Machine Learning with Big Data. It is a Coursera course. Have one more week to complete this course; so far so good. After preparing and having breakfast with my best half, return to my computer. Continue reading “Transform Strings”

Parse Text

UPDATE – April 09, 2018When I started this post, I was thinking in several follow ups in order to try different approaches and be able to continue to improve on previous passes by adding code or starting from scratch when a new idea came up. I was interested in showing a normal progression that the reader would encounter when developing software. In the days that passed, I decided to limit the subject to a single post. Please let me know if you encounter an issue or would like for me to expand on this entry.

Sometime last week I attempted to solve a simple online challenge. The challenge dealt with parsing a string of text and then obtaining information from the string. There are probably thousands of variants to the challenge. I am not going to cover the exact challenge in this post. I will make my own. Will start simple and will get more complex each time we add a new obstacle. Continue reading “Parse Text”

New, Duplicate or in Segment

This is my first attempt to create a set of two challenges for HackerRank. If you are interested in generating a new challenge you should try the Challenge Guidelines link and read all about how to proceed.

After reading the guidelines I created the following information for the “New, Duplicate or In Segment” challenge: Continue reading “New, Duplicate or in Segment”