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. "

• We have BFS and DFS images in both Breadth First Traversal and Depth First Traversal. We should have illustrations in the respective sections.

Hey Yangshun,
Thanks for the great list of guides!

I found the explanation for Snake game bit difficult to follow and I came across this interesting and better explanantion here https://www.youtube.com/watch?v=AaGK-fj-BAM

Contributing.md doesn't doesn't appear to contain any actual guidlines, and the link only leads back to the same document: Java/CONTRIBUTING.md.

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.

Definitely not a Python-related wtf, but nice to know anyways

>>> round(1.25, 1)
1.2
>>> round(1.35, 1)
1.4

Explanation idea:

>>> round(1.45) + round(1.55) == 3
True

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

This is a(n):

• New algorithm
• Update to an existing algorithm
• Error
• Proposal to the Repository

Details:

We can make a file may be READ.

Hi all,

I found that there is a better visualized article on activity launch modes with a more descriptive explanation.

https://inthecheesefactory.com/blog/understand-android-activity-launchmode/en

Is it possible to link to this article on the Activity -> What are "launch modes" ?

This is a reminder for me or a task if anyone wants :P

Basically, The last two questions aren't really regex's questions.

To do:

• Move said questions to correct place.
• Add new regex questions (Python related!)?
• Maybe add a new ## Regex section, as it is a valuable skill

I create leetcode directory. You can contribute solution for Leetcode algorithm by C language.
Good practice coding :)
Please put some comment for explanation. It helps other people understand your algorithm better

Given a blacklist B containing unique integers from [0, N), write a function to return a uniform random integer from [0, N) which is NOT in B.

Optimize it such that it minimizes the call to system’s Math.random().

Note:

1. 1 <= N <= 1000000000
2. 0 <= B.length < min(100000, N)
3. [0, N) does NOT include N. See [interval notation](https://en.wikipedia.org/wiki/Interval_\