Skip to content
Permalink
Browse files

fix: replace imgur URLs with s3 URLs for files with potential conflict (

#36049)

* fix: replace imgur with s3 for files with potential conflict

(cherry picked from commit 4ec62c0e29a64b0288eade45fb510f25c622945a)

* fix/remote extra link

Co-Authored-By: Randell Dawson <5313213+RandellDawson@users.noreply.github.com>

* fix: revert change
  • Loading branch information...
ahmadabdolsaheb committed Jun 12, 2019
1 parent fb0c681 commit d24778ceb894f3d8ed6f792c04b6238d981e932d
Showing with 98 additions and 97 deletions.
  1. +2 −2 .../applied-visual-design/create-texture-by-adding-a-subtle-pattern-as-a-background-image.russian.md
  2. +1 −1 ...lum/challenges/russian/08-coding-interview-prep/project-euler/problem-15-lattice-paths.russian.md
  3. +1 −1 guide/arabic/html/layouts/index.md
  4. +6 −6 guide/chinese/algorithms/search-algorithms/binary-search/index.md
  5. +5 −5 guide/chinese/algorithms/search-algorithms/linear-search/index.md
  6. +6 −6 guide/english/algorithms/search-algorithms/binary-search/index.md
  7. +5 −5 guide/english/algorithms/search-algorithms/linear-search/index.md
  8. +1 −1 guide/english/cplusplus/compilers/index.md
  9. +1 −1 guide/english/cplusplus/lists/index.md
  10. +1 −1 guide/english/cplusplus/stl-algorithms/index.md
  11. +2 −2 guide/english/developer-tools/source-code-editors/index.md
  12. +1 −1 guide/english/java/javafx/index.md
  13. +2 −2 guide/english/machine-learning/support-vector-machine/index.md
  14. +7 −7 guide/english/tools/source-code-editors/index.md
  15. +2 −2 guide/portuguese/algorithms/greedy-algorithms/index.md
  16. +6 −6 guide/portuguese/algorithms/search-algorithms/binary-search/index.md
  17. +5 −5 guide/portuguese/algorithms/search-algorithms/linear-search/index.md
  18. +6 −6 guide/russian/algorithms/search-algorithms/binary-search/index.md
  19. +5 −5 guide/russian/algorithms/search-algorithms/linear-search/index.md
  20. +7 −6 guide/russian/cplusplus/index.md
  21. +1 −1 guide/russian/mathematics/2-by-2-determinants/index.md
  22. +4 −4 guide/russian/virtualbox/install-virtualbox-on-macos/index.md
  23. +6 −6 guide/spanish/algorithms/search-algorithms/binary-search/index.md
  24. +5 −5 guide/spanish/algorithms/search-algorithms/linear-search/index.md
  25. +1 −1 guide/spanish/cplusplus/lists/index.md
  26. +1 −1 guide/spanish/java/access-modifiers/index.md
  27. +1 −1 guide/spanish/java/javafx/index.md
  28. +3 −3 guide/spanish/typescript/index.md
  29. +4 −4 guide/spanish/virtualbox/install-virtualbox-on-macos/index.md
@@ -10,15 +10,15 @@ localeTitle: Создание текстуры путем добавления
<section id="description"> Один из способов добавить текстуру и интерес к фону и подчеркнуть ее - добавить тонкий узор. Ключом является баланс, так как вы не хотите, чтобы фон выделялся слишком много, и убирайте с переднего плана. Свойство <code>background</code> поддерживает функцию <code>url()</code> , чтобы ссылаться на изображение выбранной текстуры или рисунка. Адрес ссылки заключен в кавычки внутри круглых скобок. </section>

## Instructions
<section id="instructions"> Использование URL в <code>https://i.imgur.com/MJAkxbh.png</code> , установить <code>background</code> всей страницы с <code>body</code> селектором. </section>
<section id="instructions"> Использование URL в <code>https://cdn-media-1.freecodecamp.org/imgr/MJAkxbh.png</code> , установить <code>background</code> всей страницы с <code>body</code> селектором. </section>

## Tests
<section id='tests'>

```yml
tests:
- text: Элемент вашего <code>body</code> должен иметь свойство <code>background</code> установленное в <code>url()</code> с указанной ссылкой.
testString: 'assert(code.match(/background:\s*?url\(\s*("|"|)https:\/\/i\.imgur\.com\/MJAkxbh\.png\1\s*\)/gi), "Your <code>body</code> element should have a <code>background</code> property set to a <code>url()</code> with the given link.");'
testString: 'assert(code.match(/background:\s*?url\(\s*("|"|)https:\/\/cdn-media-1\.freecodecamp\.org\/imgr\/MJAkxbh\.png\1\s*\)/gi), "Your <code>body</code> element should have a <code>background</code> property set to a <code>url()</code> with the given link.");'
```

@@ -7,7 +7,7 @@ localeTitle: 'Задача 15: Решетчатые пути'
---

## Description
<section id="description"> Начиная в левом верхнем углу сетки 2 × 2 и только имея возможность двигаться вправо и вниз, ровно 6 маршрутов в нижний правый угол. <img class="img-responsive center-block" alt="диаграмма 6 2 на 2 сетки, показывающая все маршруты в нижний правый угол" src="https://i.imgur.com/1Atixoj.gif"><p> Сколько таких маршрутов существует через заданный <code>gridSize</code> ? </p></section>
<section id="description"> Начиная в левом верхнем углу сетки 2 × 2 и только имея возможность двигаться вправо и вниз, ровно 6 маршрутов в нижний правый угол. <img class="img-responsive center-block" alt="диаграмма 6 2 на 2 сетки, показывающая все маршруты в нижний правый угол" src="https://cdn-media-1.freecodecamp.org/imgr/1Atixoj.gif"><p> Сколько таких маршрутов существует через заданный <code>gridSize</code> ? </p></section>

## Instructions
<section id="instructions">
@@ -8,7 +8,7 @@ localeTitle: تخطيطات

يمكن تقسيم كل صفحة الويب التي نراها تقريبًا إلى مربعات ، يمكن ترتيبها بترتيب معين لإنشاء صفحة الويب هذه. الصورة أدناه مثال واحد.

![عينة من تصميم الموقع - www.codementor.io](http://i.imgur.com/Z1DSMYC.png)
![عينة من تصميم الموقع - www.codementor.io](https://cdn-media-1.freecodecamp.org/imgr/Z1DSMYC.png)

> غالبًا ما تعرض مواقع الويب محتوى في عدة أعمدة (مثل مجلة أو صحيفة).
@@ -50,27 +50,27 @@ _O_ ( _log 2 N_ )是这样的,因为在每个步骤中数据集中的一

使用二进制搜索在给定的数字数组中找到5。

![二进制搜索1](https://i.imgur.com/QAuugOL.jpg)
![二进制搜索1](https://cdn-media-1.freecodecamp.org/imgr/QAuugOL.jpg)

标记阵列中的低位,高位和中位。

![二进制搜索2](https://i.imgur.com/1710fEx.jpg)
![二进制搜索2](https://cdn-media-1.freecodecamp.org/imgr/1710fEx.jpg)

将您要查找的项目与中间元素进行比较。

![二进制搜索3](https://i.imgur.com/jr4icze.jpg)
![二进制搜索3](https://cdn-media-1.freecodecamp.org/imgr/jr4icze.jpg)

丢掉左半边,看看右半边。

![二进制搜索4](https://i.imgur.com/W57lGsk.jpg)
![二进制搜索4](https://cdn-media-1.freecodecamp.org/imgr/W57lGsk.jpg)

再次与中间元素进行比较。

![二进制搜索5](https://i.imgur.com/5Twm8NE.jpg)
![二进制搜索5](https://cdn-media-1.freecodecamp.org/imgr/5Twm8NE.jpg)

现在,移动到左半边。

![二进制搜索6](https://i.imgur.com/01xetay.jpg)
![二进制搜索6](https://cdn-media-1.freecodecamp.org/imgr/01xetay.jpg)

中间元素是我们正在寻找的项目!

@@ -8,27 +8,27 @@ localeTitle: 线性搜索

找到给定列表中的数字13。

![线性搜索1](https://i.imgur.com/ThkzYEV.jpg)
![线性搜索1](https://cdn-media-1.freecodecamp.org/imgr/ThkzYEV.jpg)

你只要查看清单就可以了!

![线性搜索2](https://i.imgur.com/K7HfCly.jpg)
![线性搜索2](https://cdn-media-1.freecodecamp.org/imgr/K7HfCly.jpg)

现在,您如何告诉计算机找到它。

计算机在给定的时刻不能看到超过该值的值。因此它从数组中获取一个项目并检查它是否与您要查找的内容相同。

![线性搜索3](https://i.imgur.com/ZOSxeZD.jpg)
![线性搜索3](https://cdn-media-1.freecodecamp.org/imgr/ZOSxeZD.jpg)

第一项不匹配。所以转到下一个。

![线性搜索4](https://i.imgur.com/SwKsPxD.jpg)
![线性搜索4](https://cdn-media-1.freecodecamp.org/imgr/SwKsPxD.jpg)

等等…

这样做直到找到匹配或直到检查完所有项目。

![线性搜索5](https://i.imgur.com/3AaViff.jpg)
![线性搜索5](https://cdn-media-1.freecodecamp.org/imgr/3AaViff.jpg)

在此算法中,您可以在找到项目时停止,然后无需进一步查看。

@@ -56,27 +56,27 @@ This is the binary search algorithm. It is elegant and efficient but for it to w

Find 5 in the given array of numbers using binary search.

![Binary Search 1](https://i.imgur.com/QAuugOL.jpg)
![Binary Search 1](https://cdn-media-1.freecodecamp.org/imgr/QAuugOL.jpg)

Mark low, high and mid positions in the array.

![Binary Search 2](https://i.imgur.com/1710fEx.jpg)
![Binary Search 2](https://cdn-media-1.freecodecamp.org/imgr/1710fEx.jpg)

Compare the item you are looking for with the middle element.

![Binary Search 3](https://i.imgur.com/jr4icze.jpg)
![Binary Search 3](https://cdn-media-1.freecodecamp.org/imgr/jr4icze.jpg)

Throw away the left half and look in the right half.

![Binary Search 4](https://i.imgur.com/W57lGsk.jpg)
![Binary Search 4](https://cdn-media-1.freecodecamp.org/imgr/W57lGsk.jpg)

Again compare with the middle element.

![Binary Search 5](https://i.imgur.com/5Twm8NE.jpg)
![Binary Search 5](https://cdn-media-1.freecodecamp.org/imgr/5Twm8NE.jpg)

Now, move to the left half.

![Binary Search 6](https://i.imgur.com/01xetay.jpg)
![Binary Search 6](https://cdn-media-1.freecodecamp.org/imgr/01xetay.jpg)

The middle element is the item we were looking for!

@@ -7,27 +7,27 @@ Suppose you are given a list or an array of items. You are searching for a parti

Find the number 13 in the given list.

![Linear Search 1](https://i.imgur.com/ThkzYEV.jpg)
![Linear Search 1](https://cdn-media-1.freecodecamp.org/imgr/ThkzYEV.jpg)

You just look at the list and there it is!

![Linear Search 2](https://i.imgur.com/K7HfCly.jpg)
![Linear Search 2](https://cdn-media-1.freecodecamp.org/imgr/K7HfCly.jpg)

Now, how do you tell a computer to find it.

A computer cannot look at more than the value at a given instant of time. So it takes one item from the array and checks if it is the same as what you are looking for.

![Linear Search 3](https://i.imgur.com/ZOSxeZD.jpg)
![Linear Search 3](https://cdn-media-1.freecodecamp.org/imgr/ZOSxeZD.jpg)

The first item did not match. So move onto the next one.

![Linear Search 4](https://i.imgur.com/SwKsPxD.jpg)
![Linear Search 4](https://cdn-media-1.freecodecamp.org/imgr/SwKsPxD.jpg)

And so on...

This is done till a match is found or until all the items have been checked.

![Linear Search 5](https://i.imgur.com/3AaViff.jpg)
![Linear Search 5](https://cdn-media-1.freecodecamp.org/imgr/3AaViff.jpg)

In this algorithm, you can stop when the item is found and then there is no need to look further.

@@ -42,7 +42,7 @@ Let's say you have a C++ file called `helloWorld.cpp` ...
#### Using and IDE like CodeBlocks

It is as simple as clicking the build and run buttons, they will create a file in the project folder.
![img](https://i.imgur.com/FwZuFGy.png)
![img](https://cdn-media-1.freecodecamp.org/imgr/FwZuFGy.png)

#### Using Command Prompt
1. Open a Developer Command Prompt - For this step, you will need to have Microsoft Visual Studio or some other IDE that
@@ -10,7 +10,7 @@ List elements point to its next element so all elements are ordered in sequence
How? You may ask. They do this not by indexing but using a special tool called iterators. Iterators are like special pointers
whose job is to maintain the order of the list elements kind of like the link between two train cars. Here is a nice visual
of how Lists are organized compared to Vectors and Arrays.
![img](https://imgur.com/SiU8uTe.png)
![img](https://cdn-media-1.freecodecamp.org/imgr/SiU8uTe.png)

Traversal in a list is slow as compared to Vectors and Arrays, but once a position has been found, insertion and deletion are quick.

@@ -6,7 +6,7 @@ title: STL Algorithms

STL stands for Standard Template Library. It consists various containers like Vectors, Stacks, Queues etc. It also consists of some commonly used algorithms like sorting, counting etc. The image below shows the quick outline of STL. We will discuss the algorithms part.

![STL Outlook](https://i.imgur.com/daIlXQI.png "STL-Outlook")
![STL Outlook](https://cdn-media-1.freecodecamp.org/imgr/daIlXQI.png "STL-Outlook")

### References:
1. [GeeksForGeeks - STL Tutorial](https://www.geeksforgeeks.org/cpp-stl-tutorial/)
@@ -43,7 +43,7 @@ Brackets is a relatively new open-source editor by Adobe. It is very user friend
### Atom
![Atom Icon](https://i.imgur.com/ToWQjHO.png)
![Atom Icon](https://cdn-media-1.freecodecamp.org/imgr/ToWQjHO.png)
Atom is an <a href='https://github.com/atom/atom' target='_blank' rel='nofollow'>open source</a> editor, developed by <a href='https://github.com/' target='_blank' rel='nofollow'>GitHub</a>. Like Sublime Text, Atom is quite popular. It is very configurable ("hackable", as they say) but advanced features may be overwhelming to new users. There is also plenty of <a href='http://readwrite.com/2014/05/20/github-atom-5-tips-getting-started-tutorial-corey-johnson/' target='_blank' rel='nofollow'>helpful</a> <a href='http://flight-manual.atom.io/' target='_blank' rel='nofollow'>documentation</a> <a href='http://stackoverflow.com/search?q=atom' target='_blank' rel='nofollow'>available</a> online.
@@ -54,7 +54,7 @@ Atom is an <a href='https://github.com/atom/atom' target='_blank' rel='nofollow'
### Visual Studio Code
![Visual Studio Code Icon](https://i.imgur.com/eULdyep.png)
![Visual Studio Code Icon](https://cdn-media-1.freecodecamp.org/imgr/eULdyep.png)
Visual Studio Code (a.k.a vsc or vscode) is a very popular, open source editor, developed by <a href="https://www.microsoft.com" target="_blank" rel="nofollow">Microsoft</a> and fast becoming widely used by developers of all languages. Like Atom and Sublime, Visual Studio Code has a wide range of <a href="https://marketplace.visualstudio.com/VSCode" target="_blank" rel="nofollow">extensions</a> and <a href="https://marketplace.visualstudio.com/search?target=VSCode&category=Themes&sortBy=Downloads" target="_blank" rel="nofollow">themes</a> available to help customise and perfect your experience using it, however VSC is highly configurable "out-the-box". There is also a very active development team behind VSCode, with new features and bug fixes being added by the Visual Studio Code team <a href="https://code.visualstudio.com/updates" target="_blank" rel="nofollow">every month</a>.
@@ -10,7 +10,7 @@ JavaFX is a graphics framework created by Sun Microsystems used for developing r
Gulon Scene Builder is an application used for user interface (UI) design in JavaFX. The application uses drag-and-drop for rapid UI design that allows you to visualize the interface you are creating while designing it.

#### Screeenshots:
![Scene Builder UI](https://i.imgur.com/3d9SqBR.png)
![Scene Builder UI](https://cdn-media-1.freecodecamp.org/imgr/3d9SqBR.png)

### FXML
FXML is an XML-based markup language used for defining structures in JavaFX. The FXML document lays out the various objects in the class in a tree similar to tag nesting in XML documents.
@@ -5,13 +5,13 @@ title: Support Vector Machine

A Support Vector Machine (SVM) is a discriminative classifier formally defined by a separating hyperplane. In other words, given labeled training data (supervised learning), the algorithm outputs an optimal hyperplane which categorizes new examples. It does this by minimizing the margin between the data points near the hyperplane.

![SVM vs logistic regression](https://i.imgur.com/KUeOSK3.png)
![SVM vs logistic regression](https://cdn-media-1.freecodecamp.org/imgr/KUeOSK3.png)

A SVM cost function seeks to approximate the logistic function with a piecewise linear. This ML algorithm is used for classification problems and is part of the subset of supervised learning algorithms.

### The Cost Function

![SVM Cost Function](https://i.imgur.com/SOhv2jZ.png)
![SVM Cost Function](https://cdn-media-1.freecodecamp.org/imgr/SOhv2jZ.png)

The Cost Function is used to train the SVM. By minimizing the value of J(theta), we can ensure that the SVM is as accurate as possible. In the equation, the functions cost1 and cost0 refer to the cost for an example where y=1 and the cost for an example where y=0. Cost, for SVMs, is determined by kernel (similarity) functions.

@@ -8,21 +8,21 @@ Source code editors are the programs that allow for code creation and editing. A

There are many, many editors available to download or use online, both paid and free. They offer many of the same core features, but each have their own subtleties. Further research may help find the one that's right for you. The following editors are all cross-platform and free to use or evaluate.

## [Sublime Text](https://www.sublimetext.com/)<img src="https://i.imgur.com/3ALtws1.png" width="50px">
![Sublime Text Screenshot](https://i.imgur.com/Jk2aJod.png)
## [Sublime Text](https://www.sublimetext.com/)<img src="https://cdn-media-1.freecodecamp.org/imgr/3ALtws1.png" width="50px">
![Sublime Text Screenshot](https://cdn-media-1.freecodecamp.org/imgr/Jk2aJod.png)

Sublime Text is a very popular editor that has been around [since 2008](https://www.sublimetext.com/blog/articles/one-point-oh). There are many options and [extensions](https://packagecontrol.io/search/sublime?sort=popularity) available, and a lot of [help available online](http://stackoverflow.com/search?q=sublime+text) to help set it up. Sublime Text is free to download and evaluate, but the license for continued use costs $70.

## [Brackets](http://brackets.io/)<img src="https://i.imgur.com/fassWYs.png" width="50px">
![Brackets Screenshot](https://i.imgur.com/H9mO8qS.jpg)
## [Brackets](http://brackets.io/)<img src="https://cdn-media-1.freecodecamp.org/imgr/fassWYs.png" width="50px">
![Brackets Screenshot](https://cdn-media-1.freecodecamp.org/imgr/H9mO8qS.jpg)

Brackets is a relatively new open-source editor by Adobe. It is very user
friendly, especially for people who aren't used to command-line interfaces
or JSON-style settings/preferences. Extensions and themes are quick and easy
to find and install through the Extension Manager.

## [Atom](https://atom.io/)<img src="https://i.imgur.com/woj5vPm.png" width="50px">
![Atom Screenshot](https://i.imgur.com/halOgkj.png)
## [Atom](https://atom.io/)<img src="https://cdn-media-1.freecodecamp.org/imgr/woj5vPm.png" width="50px">
![Atom Screenshot](https://cdn-media-1.freecodecamp.org/imgr/halOgkj.png)

Atom is an [open source](https://github.com/atom/atom) editor, developed by [GitHub](https://github.com/). Atom is very popular and configurable("hackable", as they say), but the advanced features may be overwhelming to new users. There is also plenty of helpful documentation available online.

@@ -31,7 +31,7 @@ Atom is an [open source](https://github.com/atom/atom) editor, developed by [Git
- [Atom flight manual](http://flight-manual.atom.io)
- [Atom on stackoverflow](http://stackoverflow.com/search?q=atom)

## [Visual Studio Code](https://code.visualstudio.com/)<img src="https://i.imgur.com/b4vFsKa.png" width="50px">
## [Visual Studio Code](https://code.visualstudio.com/)<img src="https://cdn-media-1.freecodecamp.org/imgr/b4vFsKa.png" width="50px">
![Visual Studio Code Screenshot](https://code.visualstudio.com/home/home-screenshot-mac-lg.png)

Visual Studio Code is a source code editor developed by Microsoft since 2015, and is now one of the most known code editors.
@@ -49,12 +49,12 @@ Vamos examinar as várias abordagens para resolver esse problema.

1. **Primeira Hora de Início Primeiro,** ou seja, selecione o intervalo que tem a hora de início mais antiga. Dê uma olhada no exemplo a seguir que quebra essa solução. Essa solução falhou porque pode haver um intervalo que começa muito cedo, mas isso é muito longo. Isso significa que a próxima estratégia que poderíamos tentar seria onde nós olhamos em intervalos menores primeiro. ![Primeiras Horas Iniciais Primeiro](https://algorithmsandme.files.wordpress.com/2015/03/f268b-jobs.png?w=840)

2. **Intervalo Menor Primeiro,** ou seja, você acaba selecionando as palestras na ordem de seu intervalo geral, que não é nada além do `finish time - start time` . Mais uma vez, esta solução não está correta. Olhe o seguinte caso. ![Intervalo mais curto primeiro](https://i.stack.imgur.com/4bz2N.png)
2. **Intervalo Menor Primeiro,** ou seja, você acaba selecionando as palestras na ordem de seu intervalo geral, que não é nada além do `finish time - start time` . Mais uma vez, esta solução não está correta. Olhe o seguinte caso. ![Intervalo mais curto primeiro](https://cdn-media-1.freecodecamp.org/imgr/4bz2N.png)


Você pode ver claramente que a palestra de intervalo mais curta é a do meio, mas essa não é a solução ideal aqui. Vamos ver outra solução para esse problema, derivando insights dessa solução.

3. **Intervalo de Conflito Menor Primeiro,** ou seja, você deve procurar intervalos que causem o menor número de conflitos. Mais uma vez, temos um exemplo em que essa abordagem não consegue encontrar uma solução ideal. ![Intervalo menos conflitante primeiro](https://i.stack.imgur.com/5LZ9V.png)
3. **Intervalo de Conflito Menor Primeiro,** ou seja, você deve procurar intervalos que causem o menor número de conflitos. Mais uma vez, temos um exemplo em que essa abordagem não consegue encontrar uma solução ideal. ![Intervalo menos conflitante primeiro](https://cdn-media-1.freecodecamp.org/imgr/5LZ9V.png)

O diagrama nos mostra que o intervalo menos conflitante é aquele no meio com apenas 2 conflitos. Depois disso, só podemos escolher os dois intervalos nas extremidades com conflitos 3 cada. Mas a melhor solução é escolher os 4 intervalos no nível mais alto.

0 comments on commit d24778c

Please sign in to comment.
You can’t perform that action at this time.