Skip to content

Commit ab5b145

Browse files
committed
Merge pull request freeCodeCamp#7571 from alistermada/fix/links-in-video-descriptions
Fix links in video challenge descriptions
2 parents 22744fc + c13e234 commit ab5b145

File tree

6 files changed

+36
-37
lines changed

6 files changed

+36
-37
lines changed

common/app/routes/Hikes/components/Lecture.jsx

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -57,9 +57,8 @@ export class Lecture extends React.Component {
5757
return transcript.map((line, index) => (
5858
<p
5959
className='lead text-left'
60-
key={ dashedName + index }>
61-
{ line }
62-
</p>
60+
key={ dashedName + index }
61+
dangerouslySetInnerHTML={{__html: line}} />
6362
));
6463
}
6564

seed/challenges/04-video-challenges/bigonotation.json

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -63,9 +63,9 @@
6363
"If your algorithm slows down exponentially with the input, you're going to want to look for a more efficient way to solve that problem.",
6464
"Whenever you’re coding loops within loops, you want to be especially mindful of time complexity.",
6565
"Big O Cheat Sheet is the place to look once you can classify your algorithm, like as a 'merge-sort' or a 'quick-sort'.",
66-
"bigocheatsheet.com/",
66+
"<a href='http://bigocheatsheet.com/' target='_blank'>bigocheatsheet.com/</a>",
6767
"Princeton Coursera course is NOT for the faint of heart. With examples and practice in Java, this course will cover iterating over data specifically with Java, sorting, and searching algorithms.",
68-
"coursera.org/course/algs4partI"
68+
"<a href='http://coursera.org/course/algs4partI' target='_blank'>coursera.org/course/algs4partI</a>"
6969
],
7070
"challengeSeed": [
7171
"139877627"
@@ -100,9 +100,9 @@
100100
"Si tu algoritmo se hace más lento de manera exponencial a medida que aumenta la entrada, querrás buscar una forma más eficiente de resolver el problema.",
101101
"Siempre que programes ciclos dentro de ciclos, querrás ser especialmente cuidadoso de la complejidad temporal.",
102102
"La hoja de copialina de la notación O mayúscula es el lugar donde mirar para clasificar tu algoritmo, como el de un 'ordenamiento por mezcla' o un 'ordenamiento rápido'.",
103-
"bigocheatsheet.com/",
103+
"<a href='http://bigocheatsheet.com/' target='_blank'>bigocheatsheet.com/</a>",
104104
"El curso de Coursera de Princeton no es para débiles de corazón. Con ejemplos y prácticas en Java, este curso cubre iteración sobre los datos especifcamente algoritmos de ordenamiento y búsqueda.",
105-
"coursera.org/course/algs4partI"
105+
"<a href='http://coursera.org/course/algs4partI' target='_blank'>coursera.org/course/algs4partI</a>"
106106
],
107107
"titleEs": "Notación O mayúscula: Unos pocos ejemplos"
108108
}

0 commit comments

Comments
 (0)