A description is incomplete. It should mention:

These patterns are not competing, but complementing each other. To achieve availability, one needs both fail-over and replication.

right after

"There are two main patterns to support high availability: fail-over and replication. "

So at the time of this writing, this project counts 31.661 stars which indicate how popular it is -- hanking in 60th in number of stars, just 2 positions behind Angular.

However, the web evolves fast and while most questions here remain relevant, I guess we're in a good time for an update -- there are lots of improvement

It is known that Alibaba is a great international company.Maybe @kdn251 can open a catalog：interviews/company/Alibaba.
For example,a 2019 Alibaba interview question.
//Question: you need to caculate sqrt(2) to 10 decimal places accurately without math library.
`double sqrt2( )
{
double low = 1.4, high = 1.5;
double mid = (low + high) / 2;
while (high – low > 0.0000000001)
{

In the Best Practice Questions section under Week 5 – Dynamic Programming, Combination Sum linked to LeetCode Combination Sum IV. Is this intended? All other questions have the correct numbering (e.g. Word Search II).

When a property is accessed on an object and if the property is not found on that object, the JavaScript engine should looks at the object's __proto__(different browser has their own implement) .Or, looks at the prototype of its constructor.

https://mybinder.org/ Should I make a binder ? :) Or if there is a binder link, it's well hidden.

there is data_structures/src/list/singly_linked_list, but there is also a code for same problem in data_structures/linked_list/
One of them ought to be removed.

If we traverse through the tree from down, the child of root node will contain 12 and 4, so the summation of both is 16 but you got 20

During the NBA playoffs, we always arrange the rather strong team to play with the rather weak team, like make the rank 1 team play with the rank nth team, which is a good strategy to make the contest more interesting. Now, you're given n teams, you need to output their final contest matches in the form of a string.

The n teams are given in the form of positive integers from 1 to n, which repr

Chrome(73.x):

Firefox(66.x):