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

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.

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

Reverse a linked list from position  m  to  n. Do it in one-pass.

Note: 1 ≤  m  ≤  n  ≤ length of list.

Example:

Input: 1->2->3->4->5->NULL, _m_ = 2, _n_ = 4
Output: 1- >4->3->2->5->NULL

很奇怪为何没有倒置链表之一，就来了这个倒置链表之二，不过猜也能猜得到之一就是单纯的倒置整个链表，而这道作为延伸的地方就是倒置其中的某一小段。对于链表的问题，根据以往的经验一般都是要建一个dummy node，连上原链表的头结点，这样的话就算头结点变动了，我们还可以通过dummy->next来获得新链表的头结点。这道题的要求是只通过一次遍历完成，就拿题目