- Artykuły z tagiem algorithms

How to check if a number is a power of two

Dziel się z innymi:
How to check if a number is a power of two

Inne 452 dni, 47 minut temu asciiBlade 193 rozwiń

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.

[EN] Cassandra logs/time series storage design - optimal compaction strategy

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?

[EN]: Dynamic Programming and the hardest problem on HackerRank

Sztuka programowania 813 dni, 11 godzin, 20 minut temu http://dynamicallyinvokable... 108 rozwiń

This time solving a HackerRank problem, rated as a medium in difficulty. As before, in 5 easy steps.

[EN]: Dynamic Programming in 5 easy steps - Examples - Two Robots

Sztuka programowania 844 dni, 1 godzinę, 16 minut temu http://dynamicallyinvokable... 66 rozwiń

Dynamic Programming series continuation. Something harder this time: Given a set of positive integers, divide it into two sets such that the absolute difference between their sums is minimum. Solution in 5 easy steps!

[EN]: Dynamic Programming in 5 easy steps - Examples - Set partitioning

Sztuka programowania 871 dni, 17 godzin, 42 minuty temu http://dynamicallyinvokable... 68 rozwiń

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.

[EN]: Dynamic Programming in 5 easy steps - Examples - Text Justification

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.

Tagi: algorithms
Dziel się z innymi:
[EN]: Algorithms and data structures - non-academic trees

Sztuka programowania 939 dni, 1 godzinę, 39 minut temu http://dynamicallyinvokable... 116 rozwiń

How many timers are in the .NET Framework? What assumptions do they have? Which timer would you use for implementing Speculative query execution?

[EN]: Little-known, useful, charming and beautiful algorithms - part 2

Sztuka programowania 1096 dni, 12 godzin, 25 minut temu http://dynamicallyinvokable... 72 rozwiń