Let’s assume you are considering using Cassandra for logs storage or in general, for time series storage. You are well prepared - asked google extensively. Yet, there is a trap waiting to kill your cluster in few weeks after lunch.
The hardest problem on HackerRank, sorted by Max Score and level “Expert” is Separate The Chocolate. It’s worth 250 points and the level “Expert” is the highest one. How to solve it?
This time we will solve a HackerRank problem, rated as a medium in difficulty. It’s advised for you to go through a similar, but in my opinion easier problem described by me previously.
Last time we have covered Text Justification problem, this time we will do something harder. Solution in 5 easy steps!
Dynamic Programming is considered as one of the hardest methods to master, with few examples on the internet. Let’s contribute a little with this post series. Today I will cover the first problem - text justification. Credits: MIT lectures.
Do you know the trees used in Cassandra, Git, Bitcoin or Lucene? Check this post to find interesting trees, usually not covered on Computer Science lectures.
What’s faster in C#: setting an array by index or a generic list by index? Are you sure you know the correct answer?
