Good day gals and guys. It is a nice Monday morning in the Twin Cities of Minneapolis and St. Paul. Believe it or not but the high temperatures in the mid to upper 90s F that we have been getting for the past two weeks this Spring has changed in the forecast for the last 10 days of Spring 2021. The forecast call for highs in the upper 70’s to low 80’s F which represents on average a 20F degree reduction. One way or the other, unless it is raining, my wife and I are planning of getting up before 06:00 AM, having breakfast and then heading out for a daily walk. It seems that every day there are more people out and about early in order to avoid the heat in the afternoon.
Our weekend was uneventful. We walked, chatted with people, and prepared food in the grill. Yesterday we made fish and chips in the grill. We want to master the technique because frying potatoes and fish indoors unnecessarily heats the house and leaves food odors that tend to last for a couple hours after we are done consuming lunch. That said, at work and personal life, the only way to learn and become efficient with different tasks is to read, practice, get feedback, make modifications and repeat! In addition you must like what you do; otherwise it is very difficult to improve.
I continue to install applications on my new iPhone. Hopefully this week I will be done installing some Google apps and hopefully getting the data into the iPhone. Continue reading “How Sum – Tabulation”
Yesterday evening I was browsing different sites on my phone.
Found on Medium the article LeetCode 1448: Count Good Nodes in Binary Tree by Pierre-Marie Poitevin. If you follow my blog, you probably noticed that in the past couple weeks I have been looking at recursive problems on the LeetCode web site. So earlier today I decided to give it a try.
Originally I was going to write about load balancers today, but I am in the process of reading the paper: Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web by David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, and Rina Panigrahy. As soon as I have time to finish reading it, I will generate a post on load balancers. Continue reading “Count Good Nodes in Binary Tree”
It is a beautiful Saturday in the Twin Cities of Minneapolis and St. Paul. My wife and I will be going for a 5 mile walk later this morning.
Today I woke up around 04:00 AM. It was somewhat warm at home. Turned off heating and opened a window. Since then the inside temperature had dropped to a more comfortable 68 degrees F.
This morning I read a post titled The Middle Class is being Disrupted by the One Percent by Michael K. Spencer on Medium. The post is quite interesting to me. The reason being is that I have been thinking and discussing with friends and family similar ideas. Something needs to be done by companies and governments before Capitalism and Democracy becomes a chapter in a history book. Continue reading “Bootstrap Jumbotron”
http://(https://hackernoon.com/tensorflow-is-dead-long-live-tensorflow-49d3e975cf04This morning I read the post on Medium named “TensorFlow is dead, long live TensorFlow!” by Cassie Kozyrkov who is a Chief Decision Intelligence Engineer at Google. After lunch will spend some time watching the videos embedded in the post and over the weekend will see if I can take TensorFlow 2.o on a Linux machine for a spin. I have a version of TensorFlow 1.0 installed on a Windows machine. Followed some tutorials but as Cassie puts it so expressively, it was complicated to say the least. Continue reading “Java Lambda Expressions”
Earlier this morning I read a post “Binary Tree: The Diameter” by David Pynes. The post showed up on Medium but was initially written for Towards Data Science. After quickly reading the post I decided to spend time reading the article in my computer, thinking about it and writing a solution in Java. The original article used C++. Continue reading “BST Diameter”
I read an article or two from Medium every day. A few days ago I read “Binary Trees: The Heap” by David Pynes. The idea behind a binary tree or heap is to be able to associate values with associated priorities. For example, assume you are in line at an emergency room in a hospital. When you arrive and register the facility may use a plain queue (FIFO) to wait for a physician. What happens if a patient in worse condition that you arrives later. The logical thing would be to allow them to see a physician before patients that are less ill. Continue reading “Binary Tree – Heap”
Last week I was reading a post on Medium “First Steps in Data Science with Python NumPy” by Kshitij Bajracharya.
What called my attention is his opening statement “I’ve read that the best way to learn something is to blog about it”. I believe Kshitij hit it right on. The reason I agree is that I have been a believer in “If you can’t explain it simply, you don’t understand it well enough”. This quote is attributed to Albert Einstein. Continue reading “Simple Problems in Python”
If you follow me on Twitter (@john_canessa) you have noticed that in the past couple months or so I have been posting tweets regarding articles in Medium. The site is geared to creating posts which you could do using your own web site (e.g., www.johncanessa.com). The beauty is that many talented individuals in different fields are posting there. The site organizes them by categories and presents the articles indicating the estimated reading time. One of these days I will probably start posting there. Continue reading “Using Docker – Installation”