Longest Absolute File Path – C# and Java – Revisited

Hope you had a nice Thanksgiving day with family and friends. My wife and I typically roast a turkey. This year, for the first time, we went with a fresh turkey breast. It was a fraction of the weight of a full turkey and when all was said and done, my wife did not have to deal with cleaning the bones. Today, and probably for the next few days, we will be having different types of turkey sandwiches (Bread, butter on the outside, panini press @ 350F, turkey meat. When brown and crunchy, open sandwich, apply mayonnaise and a touch of mustard. Close and enjoy).

In this post I will revisit solving LeetCode 388. Longest Absolute File Path. The motivation was a message I received a few days back on a solution in O(n). I looked up my solution in Java from February 27, 2017 and it was hard to follow. At the time I used a different plugin and the output was not that great. With time it stopped working so I switched to a different one. Much better but sometimes it mangles the output. Continue reading “Longest Absolute File Path – C# and Java – Revisited”

Software Engineering at Google Lessons Learned from Programming Over Time

Good day, it has been a while since my last post. Have been quite busy at work and home. The holidays are approaching so things might improve somewhat.

In this post I am not going to write code. I am going to let you know about things that called my attention in the past few weeks.

I am currently reading “Software Engineering at Google Lessons Learned from Programming Over Time”, curated by Titus Winters, Tom Monshreck & Hyrum Wright, published by O’Reilly. And yes, it is the book with the pink flamingo on the cover. Continue reading “Software Engineering at Google Lessons Learned from Programming Over Time”

The Alignment Problem – Book

In this post I will make a short review of the book “The Alignment Problem” by Brian Christian.

Overall I liked the contents of the book and its organization. I pay a lot of attention as to how material is presented. One technique is to repeat the important messages to allow the reader to have a second opportunity to think about them. In this book the author included a multipage conclusion that touches on the subjects of each of the nine chapters. Continue reading “The Alignment Problem – Book”

Interval HashMap

A couple weeks ago, during a meeting, someone mentioned an interval hashmap. I decided to check if Java had a class implementing a version of an interval hashmap. As you can imagine, it does and is called NavigableMap.

In this post I explored some of the features available in the NavigableMap interface.

If interested, I would suggest to first take a look at the Interface NavigableMap<K, V> in the Oracle Java documentation which can be found here.

After reading the Oracle documentation and some articles in GeeksforGeeks and StackOverflow I decided to start experimenting. Continue reading “Interval HashMap”

Superintelligence Paths, Dangers and Strategies – Book

During the past few months it has been somewhat hectic for me. I used to write and post on my blog more often. Lately I have set aside only weekend mornings to learn new things and refresh (courses), experiment, and write posts.

A few weeks ago I finished reading Superintelligence Paths, Dangers and Strategies by Nick Bostrom. If I am not mistaken the book made it to the NYT bestseller list during 2014. A teammate at work mentioned the book so I decided to get a copy and read it. Continue reading “Superintelligence Paths, Dangers and Strategies – Book”

Element Replication


When one decides to take a paid on-line course there may be one or more reasons behind it. I can think of a few. You need or want to learn the skills offered by the course. You might just want to refresh and/or learn new things. Or you might just want to have the completion certificate that you finished and met the requirements for the course to get a diploma. I personally like to refresh, learn, and have proof that I actually completed the course. Continue reading “Element Replication”

Algorithms and Data Structures for Massive Datasets

Algorithms and Data Structures for Massive Data Sets

I just finished reading and to some extent experimenting with most of the concepts presented in the book by Dzejla Medjedovic, Emin Tahirovic with illustrations by Ines Dedovic © 2022 Manning Publications ISBN: 9781617298035.

I signed up on Amazon to get the book as soon as it was released. As with most work, the first edition has a few typos. In addition, the book could have had more examples. It seems that as the book progresses the number of examples diminishes. Overall a nice book! Continue reading “Algorithms and Data Structures for Massive Datasets”

Rabin-Karp Algorithm – Revisited

In this post we will revisit the implementation of a string-search algorithm developed by Richard Karp and Michael Rabin.

We visited this algorithm in this blog a few years ago. My motivation is a book that I am currently reading. As soon as I am done reading and experimenting with some more advanced algorithms, I will generate several posts associated with the book.

In the meantime, let’s refresh what the Rabin-Karp algorithm is used for and go over an implementation using the Java programming language. Continue reading “Rabin-Karp Algorithm – Revisited”

What Have I Been Up To In The Past Few Months

Good day! It is a sunny Saturday summer morning in the Twin Cities of Minneapolis and St. Paul. THIS POST DOES NOT COVER TECHNICAL SUBJECT(S).

I like to listen to constructive comments. I can then do some research, think about the pros and cons, and finally make an educated decision. Since no one is perfect, your decisions are not always the best, but by following a set of steps like the ones I outlined in this paragraph, in retrospect most of the decisions made seem to be the right ones.

If a post is based on a specific technical subject, I will indicate so to avoid readers wasting their time with a post that might not be useful for their immediate needs. Continue reading “What Have I Been Up To In The Past Few Months”

Insertion Sort – Revisited

Insertion Sort implements an algorithm similar to ordering a hand of cards in ascending order. The algorithm is O(n^2) execution and typically is useful when sorting a rather small number of elements.

Several years ago (November 03, 2016) I generated the post Insertion Sort in this blog. The code snippets do not look nice. It seems that the tool I was using to format source code is no longer working as expected. Continue reading “Insertion Sort – Revisited”