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.

In HTML section there is a question:

Consider HTML5 as an open web platform. What are the building blocks of HTML5?

And the answer is from MDN's HTML5 docs:
https://developer.mozilla.org/en-US/docs/Web/Guide/HTML/HTML5

Probably something different is meant in the original question. I understand it as a question about tec

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

Hello @denisschmidt and @uliaaan!
I'm from Italy and I'd like to translate this documentation for you. I'll follow instructions written here and for the translation I'll follow your topics lineup.
Thanks.

Given a sorted linked list, delete all duplicates such that each element appear only  once.

Example 1:

Input: 1->1->2
Output: 1->2

Example 2:

Input: 1->1->2->3->3
Output: 1->2->3

这道题让我们移除给定有序链表的重复项，那么可以遍历这个链表，每个结点和其后面的结点比较，如果结点值相同了，只要将前面结点的 next 指针跳过紧挨着的相同值的结点，指向后面一个结点。这样遍历下来，所有重复的结点都会被跳过，留下的链表就是没有重复项的了，代码如下：

解法一：

class Solut