From 47783cf0eb1c6fddb0b8607ae0a037a03adb8ab4 Mon Sep 17 00:00:00 2001 From: Berkeley Martinez Date: Tue, 27 Jun 2017 19:54:23 -0700 Subject: [PATCH] refactor: Replace .com with .org (#15554) --- README.md | 8 +- client/commonFramework/bindings.js | 2 +- common/app/components/Footer/links.json | 2 +- common/app/components/Nav/links.json | 2 +- common/models/user.js | 8 +- .../advanced-bonfires.json | 48 +++---- .../advanced-ziplines.json | 18 +-- .../basic-bonfires.json | 64 ++++----- .../basic-javascript.json | 8 +- .../basic-ziplines.json | 12 +- .../gear-up-for-success.json | 10 +- .../html5-and-css.json | 22 +-- .../intermediate-bonfires.json | 126 +++++++++--------- .../intermediate-ziplines.json | 26 ++-- .../data-visualization-projects.json | 22 +-- .../react-projects.json | 30 ++--- .../api-projects.json | 22 +-- .../dynamic-web-applications.json | 20 +-- server/boot/a-extendUser.js | 6 +- server/boot/sitemap.js | 2 +- server/boot/t-wiki.js | 2 +- server/boot/user.js | 2 +- server/middlewares/flash-cheaters.js | 2 +- server/views/account/settings.jade | 10 +- server/views/account/show.jade | 6 +- server/views/certificate/back-end.jade | 2 +- server/views/certificate/data-vis.jade | 2 +- server/views/certificate/front-end.jade | 2 +- server/views/certificate/full-stack.jade | 2 +- server/views/challenges/showBonfire.jade | 2 +- server/views/challenges/showHTML.jade | 2 +- server/views/challenges/showJS.jade | 2 +- server/views/emails/a-new-user.ejs | 2 +- server/views/partials/meta.jade | 6 +- server/views/partials/navbar.jade | 2 +- server/views/resources/about.jade | 4 +- server/views/resources/academic-honesty.jade | 2 +- server/views/resources/code-of-conduct.jade | 2 +- .../how-nonprofit-projects-work.jade | 2 +- server/views/resources/privacy.jade | 12 +- server/views/resources/sitemap.jade | 18 +-- server/views/resources/terms-of-service.jade | 22 +-- 42 files changed, 283 insertions(+), 283 deletions(-) diff --git a/README.md b/README.md index 0d5f66a895..df35f6ab86 100644 --- a/README.md +++ b/README.md @@ -41,17 +41,17 @@ For this certification, you'll work on **two projects from scratch** and then ** --- -This code is running live at [FreeCodeCamp.com](http://www.FreeCodeCamp.com). We also have [Gitter chat room](https://gitter.im/FreeCodeCamp/FreeCodeCamp), a [Medium publication](http://medium.freecodecamp.com), and even a [YouTube channel](http://youtube.com/freecodecamp). +This code is running live at [freecodecamp.org](http://www.freecodecamp.org). We also have [Gitter chat room](https://gitter.im/FreeCodeCamp/FreeCodeCamp), a [Medium publication](http://medium.freecodecamp.org), and even a [YouTube channel](http://youtube.com/freecodecamp). -### [Join our community here](http://www.freecodecamp.com/signin). +### [Join our community here](http://www.freecodecamp.org/signin). Found a bug? ------------ Do not file an issue until you have followed these steps: -1. Read the [Help I've Found a Bug](http://forum.freecodecamp.com/t/how-to-report-a-bug/19543) article and follow its instructions. -2. Ask for confirmation in the appropriate [Help Room](http://forum.freecodecamp.com/t/free-code-camp-official-chat-rooms/19390/2). +1. Read the [Help I've Found a Bug](http://forum.freecodecamp.org/t/how-to-report-a-bug/19543) article and follow its instructions. +2. Ask for confirmation in the appropriate [Help Room](http://forum.freecodecamp.org/t/free-code-camp-official-chat-rooms/19390/2). 3. Please *do not* open an issue without a 3rd party confirmation of your problem. Contributing diff --git a/client/commonFramework/bindings.js b/client/commonFramework/bindings.js index b6d0296b60..4b47e8400e 100644 --- a/client/commonFramework/bindings.js +++ b/client/commonFramework/bindings.js @@ -191,7 +191,7 @@ window.common = (function(global) { $('#help-ive-found-a-bug-wiki-article').on('click', function() { window.open( - 'https://forum.freecodecamp.com/t/how-to-report-a-bug/19543', + 'https://forum.freecodecamp.org/t/how-to-report-a-bug/19543', '_blank' ); }); diff --git a/common/app/components/Footer/links.json b/common/app/components/Footer/links.json index acb50bde56..f57d4a9eec 100644 --- a/common/app/components/Footer/links.json +++ b/common/app/components/Footer/links.json @@ -2,7 +2,7 @@ { "className": "ion-speakerphone", "content": " Blog ", - "href": "http://medium.freecodecamp.com", + "href": "http://medium.freecodecamp.org", "target": "_blank" }, { diff --git a/common/app/components/Nav/links.json b/common/app/components/Nav/links.json index 8f066eb38c..a091082502 100644 --- a/common/app/components/Nav/links.json +++ b/common/app/components/Nav/links.json @@ -3,7 +3,7 @@ "link": "/map" },{ "content": "Forum", - "link": "http://forum.freecodecamp.com/", + "link": "http://forum.freecodecamp.org/", "target": "_blank" },{ "content": "About", diff --git a/common/models/user.js b/common/models/user.js index b25579056d..25828a5572 100644 --- a/common/models/user.js +++ b/common/models/user.js @@ -197,7 +197,7 @@ module.exports = function(User) { url = `http://${host}:${port}/reset-password?access_token=${token}`; } else { url = - `http://freecodecamp.com/reset-password?access_token=${token}`; + `https://www.freecodecamp.org/reset-password?access_token=${token}`; } // the email of the requested user @@ -207,7 +207,7 @@ module.exports = function(User) { // requires AccessToken.belongsTo(User) var mailOptions = { to: info.email, - from: 'Team@freecodecamp.com', + from: 'team@freecodecamp.org', subject: 'Password Reset Request', text: ` Hello,\n\n @@ -439,10 +439,10 @@ module.exports = function(User) { var mailOptions = { type: 'email', to: email, - from: 'team@freecodecamp.com', + from: 'team@freecodecamp.org', subject: 'Welcome to freeCodeCamp!', protocol: isDev ? null : 'https', - host: isDev ? 'localhost' : 'freecodecamp.com', + host: isDev ? 'localhost' : 'freecodecamp.org', port: isDev ? null : 443, template: path.join( __dirname, diff --git a/seed/challenges/01-front-end-development-certification/advanced-bonfires.json b/seed/challenges/01-front-end-development-certification/advanced-bonfires.json index 98a7bdc887..bd3937c720 100644 --- a/seed/challenges/01-front-end-development-certification/advanced-bonfires.json +++ b/seed/challenges/01-front-end-development-certification/advanced-bonfires.json @@ -12,7 +12,7 @@ "The user may fill out the form field any way they choose as long as it is a valid US number. The following are examples of valid formats for US numbers (refer to the tests below for other variants):", "
555-555-5555\n(555)555-5555\n(555) 555-5555\n555 555 5555\n5555555555\n1 555 555 5555
", "For this challenge you will be presented with a string such as 800-692-7753 or 8oo-six427676;laskdjf. Your job is to validate or reject the US phone number based on any combination of the formats provided above. The area code is required. If the country code is provided, you must confirm that the country code is 1. Return true if the string is a valid US phone number; otherwise return false.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function telephoneCheck(str) {", @@ -67,7 +67,7 @@ "El usuario debe llenar el campo del formulario de la forma que desee siempre y cuando sea un número válido en los EEUU. Los números mostrados a continuación tienen formatos válidos en los EEUU:", "
555-555-5555\n(555)555-5555\n(555) 555-5555\n555 555 5555\n5555555555\n1 555 555 5555
", "Para esta prueba se te presentará una cadena de texto como por ejemplo: 800-692-7753 o 8oo-six427676;laskdjf. Tu trabajo consiste en validar o rechazar el número telefónico tomando como base cualquier combinación de los formatos anteriormente presentados. El código de área es requrido. Si el código de país es provisto, debes confirmar que este es 1. La función debe devolver true si la cadena de texto es un número telefónico válido en los EEUU; de lo contrario, debe devolver false.", - "Recuerda utilizar Read-Search-Ask si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Read-Search-Ask si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleIt": "Verifica i numeri telefonici degli Stati Uniti", "descriptionIt": [ @@ -75,7 +75,7 @@ "L'utente può digitare qualunque stringa nel campo di inserimento, purchè sia un numero di telefono valido negli Stati Uniti. Qui sotto alcuni esempi di numeri di telefono validi negli Stati Uniti (fai riferimento ai test per le altre varianti):", "
555-555-5555\n(555)555-5555\n(555) 555-5555\n555 555 5555\n5555555555\n1 555 555 5555
", "In questo problema ti saranno presentate delle stringe come 800-692-7753 o 8oo-six427676;laskdjf. Il tuo obiettivo è di validare o rigettare il numero di telefono basato su una qualunque combinazione dei formati specificati sopra. Il prefisso di zona è obbligatorio. Se il prefisso nazionale è presente, devi confermare che corrisponda a 1. Ritorna true se la stringa è un numero di telefono valido negli Stati Uniti; altrimenti ritorna false.", - "Ricorda di usare Leggi-Cerca-Chiedi se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te." + "Ricorda di usare Leggi-Cerca-Chiedi se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te." ] }, { @@ -170,7 +170,7 @@ "description": [ "Create a function that takes two or more arrays and returns an array of the symmetric difference (△ or ⊕) of the provided arrays.", "Given two sets (for example set A = {1, 2, 3} and set B = {2, 3, 4}), the mathematical term \"symmetric difference\" of two sets is the set of elements which are in either of the two sets, but not in both (A △ B = C = {1, 4}). For every additional symmetric difference you take (say on a set D = {2, 3}), you should get the set with elements which are in either of the two the sets but not both (C △ D = {1, 4} △ {2, 3} = {1, 2, 3, 4}).", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function sym(args) {", @@ -204,13 +204,13 @@ "descriptionEs": [ "Crea una función que acepte dos o más arreglos y que devuelva un arreglo conteniendo la diferenia simétrica entre ambos", "En Matemáticas, el término 'diferencia simétrica' se refiere a los elementos en dos conjuntos que están en el primer conjunto o en el segundo, pero no en ambos.", - "Recuerda utilizar Read-Search-Ask si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Read-Search-Ask si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleIt": "Differenza simmetrica", "descriptionIt": [ "Crea una funzione che accetti due o più array e che ritorni un array contenente la differenza simmetrica (△ o ⊕) degli stessi.", "Dati due insiemi (per esempio l'insieme A = {1, 2, 3} e l'insieme B = {2, 3, 4}, il termine matematico \"differenza simmetrica\" di due insiemi è l'insieme degli elementi che sono in almeno uno dei due insiemi, ma non in entrambi (A △ B = C = {1, 4}). Per ogni differenza simmetrica aggiuntiva che fai (per esempio su un insieme D = {2, 3}), devi prendere l'insieme degli elementi che sono in almeno uno dei due insiemi ma non in entrambi (C △ D = {1, 4} △ {2, 3} = {1, 2, 3, 4}).", - "Ricorda di usare Leggi-Cerca-Chiedi se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te." + "Ricorda di usare Leggi-Cerca-Chiedi se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te." ] }, { @@ -221,7 +221,7 @@ "cid is a 2D array listing available currency.", "Return the string \"Insufficient Funds\" if cash-in-drawer is less than the change due. Return the string \"Closed\" if cash-in-drawer is equal to the change due.", "Otherwise, return change in coin and bills, sorted in highest to lowest order.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function checkCashRegister(price, cash, cid) {", @@ -267,7 +267,7 @@ "cid es un arreglo bidimensional que lista la cantidad de dinero disponible", "La función debe devolver la cadena de texto \"Insufficient Funds\" si el cid es menor al cambio requerido. También debe devolver \"Closed\" si el cid es igual al cambio", "De no ser el caso, devuelve el cambio en monedas y billetes, ordenados de mayor a menor denominación.", - "Recuerda utilizar Read-Search-Ask si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Read-Search-Ask si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleIt": "Cambio esatto", "descriptionIt": [ @@ -275,7 +275,7 @@ "cid è un array a due dimensioni che contiene la quantità di monete e banconote disponibili.", "Ritorna la stringa \"Insufficient Funds\" se la quantità di denaro disponibile nel registratore di cassa non è abbastanza per restituire il resto. Ritorna la stringa \"Closed\" se il denaro disponibile è esattamente uguale al resto.", "Altrimenti, ritorna il resto in monete e banconote, ordinate da quelle con valore maggiore a quelle con valore minore.", - "Ricorda di usare Leggi-Cerca-Chiedi se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te." + "Ricorda di usare Leggi-Cerca-Chiedi se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te." ] }, { @@ -283,7 +283,7 @@ "title": "Inventory Update", "description": [ "Compare and update the inventory stored in a 2D array against a second 2D array of a fresh delivery. Update the current existing inventory item quantities (in arr1). If an item cannot be found, add the new item and quantity into the inventory array. The returned inventory array should be in alphabetical order by item.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function updateInventory(arr1, arr2) {", @@ -327,12 +327,12 @@ "titleEs": "Actualizando el inventario", "descriptionEs": [ "Compara y actualiza el inventario actual, almacenado en un arreglo bidimensional, contra otro arreglo bidimensional de inventario nuevo. Actualiza las cantidades en el inventario actual y, en caso de recibir una nueva mercancía, añade su nombre y la cantidad recibida al arreglo del inventario en orden alfabético.", - "Recuerda utilizar Read-Search-Ask si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Read-Search-Ask si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleIt": "Aggiornamento dell'inventario", "descriptionIt": [ "Confronta e aggiorna l'inventario, contenuto in un array bidimensionale, con un secondo array bidimensionale relativo ad una nuova consegna. Aggiorna le quantità disponibili in inventario (dentro arr1). Se uno degli articoli non è presente nell'inventario, aggiungi allo stesso il nuovo articolo e la sua quantità. Ritorna un array con l'inventario aggiornato, che deve essere ordinato alfabeticamente per articolo.", - "Ricorda di usare Leggi-Cerca-Chiedi se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te." + "Ricorda di usare Leggi-Cerca-Chiedi se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te." ] }, { @@ -341,7 +341,7 @@ "description": [ "Return the number of total permutations of the provided string that don't have repeated consecutive letters. Assume that all characters in the provided string are each unique.", "For example, aab should return 2 because it has 6 total permutations (aab, aab, aba, aba, baa, baa), but only 2 of them (aba and aba) don't have the same letter (in this case a) repeating.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function permAlone(str) {", @@ -375,13 +375,13 @@ "descriptionEs": [ "Crea una función que devuelva el número total de permutaciones de las letras en la cadena de texto provista, en las cuales no haya letras consecutivas repetidas", "Por ejemplo, 'aab' debe retornar 2 porque, del total de 6 permutaciones posibles, solo 2 de ellas no tienen repetida la misma letra (en este caso 'a').", - "Recuerda utilizar Read-Search-Ask si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Read-Search-Ask si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleIt": "Niente ripetizioni, per favore", "descriptionIt": [ "Ritorna il numero totale di permutazioni della stringa passata che non hanno lettere consecutive riptetute. Assumi che tutti i caratteri nella stringa passata siano unici.", "Per esempio, aab deve ritornare 2, perchè la stringa ha 6 permutazioni possibili in totale (aab, aab, aba, aba, baa, baa), ma solo 2 di loro (aba e aba) non contengono la stessa lettera (in questo caso a ripetuta).", - "Ricorda di usare Leggi-Cerca-Chiedi se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te." + "Ricorda di usare Leggi-Cerca-Chiedi se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te." ] }, { @@ -393,7 +393,7 @@ "Run the tests to see the expected output for each method.", "The methods that take an argument must accept only one argument and it has to be a string.", "These methods must be the only available means of interacting with the object.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "var Person = function(firstAndLast) {", @@ -437,7 +437,7 @@ "Ejecuta las pruebas para ver el resultado esperado de cada método.", "Las funciones que aceptan argumentos deben aceptar sólo uno, y este tiene que ser una cadena.", "Estos métodos deben ser el único medio para interactuar con el objeto.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleIt": "Crea una Persona", "descriptionIt": [ @@ -446,7 +446,7 @@ "Esegui i test per vedere il risultato atteso per ogni metodo.", "I metodi che richiedono un argomento devono accettarne solo uno e questo deve essere una stringa.", "Questi metodi devono essere l'unica maniera possibile di interagire con l'oggetto.", - "Ricorda di usare Leggi-Cerca-Chiedi se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te." + "Ricorda di usare Leggi-Cerca-Chiedi se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te." ] }, { @@ -458,7 +458,7 @@ "You can read about orbital periods on wikipedia.", "The values should be rounded to the nearest whole number. The body being orbited is Earth.", "The radius of the earth is 6367.4447 kilometers, and the GM value of earth is 398600.4418 km3s-2.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function orbitalPeriod(arr) {", @@ -488,7 +488,7 @@ "Puedes leer acerca de períodos orbitales en wikipedia.", "Los valores deben estar redondeados al número entero más próximo. El cuerpo orbitado es la Tierra", "El radio de la Tierra es 6367.4447 kilómetros, y el valor GM del planeta es de 398600.4418 km3s-2.", - "Recuerda utilizar Read-Search-Ask si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Read-Search-Ask si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleIt": "Mappa i detriti", "descriptionIt": [ @@ -497,7 +497,7 @@ "Puoi leggere riguardo i periodi orbitali su wikipedia.", "I valori devono essere arrotondati al numero intero più vicino. Il corpo attorno a cui orbitano gli elementi è la Terra.", "Il raggio della Terra è di 6367.4447 kilometri, e il valore GM della Terra è di 398600.4418 km3s-2.", - "Ricorda di usare Leggi-Cerca-Chiedi se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te." + "Ricorda di usare Leggi-Cerca-Chiedi se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te." ] }, { @@ -510,7 +510,7 @@ "
Index01234
Value79111315
", "Below we'll take their corresponding indices and add them.", "7 + 13 = 20 → Indices 0 + 3 = 3
9 + 11 = 20 → Indices 1 + 2 = 3
3 + 3 = 6 → Return 6", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function pairwise(arr, arg) {", @@ -539,7 +539,7 @@ "Crea una función que devuelva la suma de todos los índices de los elementos de 'arr' que pueden ser emparejados con otro elemento de tal forma que la suma de ambos equivalga al valor del segundo argumento, 'arg'. Si varias combinaciones son posibles, devuelve la menor suma de índices. Una vez un elemento ha sido usado, no puede ser usado de nuevo para emparejarlo con otro elemento.", "Por ejemplo, pairwise([1, 4, 2, 3, 0, 5], 7) debe devolver 11 porque 4, 2, 3 y 5 pueden ser emparejados para obtener una suma de 7", "pairwise([1, 3, 2, 4], 4) devolvería el valor de 1, porque solo los primeros dos elementos pueden ser emparejados para sumar 4. ¡Recuerda que el primer elemento tiene un índice de 0!", - "Recuerda utilizar Read-Search-Ask si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Read-Search-Ask si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleIt": "A coppie", "descriptionIt": [ @@ -549,7 +549,7 @@ "
Indice01234
Valore79111315
", "Qui sotto prendiamo gli indici corrispondenti e li sommiamo.", "7 + 13 = 20 → Indici 0 + 3 = 3
9 + 11 = 20 → Indici 1 + 2 = 3
3 + 3 = 6 → Ritorna 6", - "Ricorda di usare Leggi-Cerca-Chiedi se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te." + "Ricorda di usare Leggi-Cerca-Chiedi se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te." ] } ] diff --git a/seed/challenges/01-front-end-development-certification/advanced-ziplines.json b/seed/challenges/01-front-end-development-certification/advanced-ziplines.json index 910714f874..1b202bd73e 100644 --- a/seed/challenges/01-front-end-development-certification/advanced-ziplines.json +++ b/seed/challenges/01-front-end-development-certification/advanced-ziplines.json @@ -13,7 +13,7 @@ "User Story: I can add, subtract, multiply and divide two numbers.", "User Story: I can clear the input field with a clear button.", "User Story: I can keep chaining mathematical operations together until I hit the equal button, and the calculator will tell me the correct output.", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen. ", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -30,7 +30,7 @@ "Historia de usuario: Puedo sumar, restar, multiplicar y dividir dos números.", "Historia de usuario opcional: Puedo limpiar la pantalla con un botón de borrar.", "Historia de usuario opcional: Puedo concatenar continuamente varias operaciones hasta que pulse el botón de igual, y la calculadora me mostrará la respuesta correcta.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", "Cuando hayas terminado, pulsa el botón de \"I've completed this challenge\" e incluye un enlace a tu CodePen. ", "Puedes obtener retroalimentación sobre tu proyecto por parte de otros campistas, compartiéndolo en nuestra Sala de chat para revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ], @@ -46,7 +46,7 @@ "User Story: I can start a 25 minute pomodoro, and the timer will go off once 25 minutes has elapsed.", "User Story: I can reset the clock for my next pomodoro.", "User Story: I can customize the length of each pomodoro.", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen. ", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -67,7 +67,7 @@ "Пользовательская история: В качестве пользователя, я могу запустить 25 минутную 'помидорку', по истечении которой таймер выключится.", "Бонусная пользовательская история: В качестве пользователя, я могу сбросить таймер для установки следующей 'помидорки'.", "Бонусная пользовательская история: В качестве пользователя, я могу выбирать длительность 'помидорки'.", - "Если что-то не получается, воспользуйтесь Read-Search-Ask.", + "Если что-то не получается, воспользуйтесь Read-Search-Ask.", "Когда выполните задание кликните кнопку \"I've completed this challenge\" и добавьте ссылку на ваш CodePen. Если вы программировали с кем-то в паре, также добавьте имя вашего напарника.", "Если вы хотите получить немедленную оценку вашего проекта, нажмите эту кнопку и добавьте ссылку на ваш CodePen. В противном случае мы проверим его перед тем как вы приступите к проектам для некоммерческих организаций.

Click here then add your link to your tweet's text" ], @@ -79,7 +79,7 @@ "Historia de usuario: Puedo iniciar un pomodoro de 25 minutos, y el cronómetro terminará cuando pasen 25 minutos.", "Historia de usuario: Como usuario, puedo reiniciar el reloj para comenzar mi siguiente pomodoro.", "Historia de usuario: Como usuario, puedo personalizar la longitud de cada pomodoro.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", "Cuando hayas terminado, pulsa el botón de \"I've completed this challenge\" e incluye un enlace a tu CodePen.", "Puedes obtener retroalimentación sobre tu proyecto por parte de otros campistas, compartiéndolo en nuestra Sala de chat para revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ] @@ -93,7 +93,7 @@ "User Story: I can play a game of Tic Tac Toe with the computer.", "User Story: My game will reset as soon as it's over so I can play again.", "User Story: I can choose whether I want to play as X or O.", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen.", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -110,7 +110,7 @@ "Historia de usuario: Puedo jugar un juego de Tic Tac Toe contra el computador.", "Historia de usuario: Mi juego se reiniciará tan pronto como termine para poder jugar de nuevo.", "Historia de usuario: Puedo elegir si quiero jugar como X o como O.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", "Cuando hayas terminado, pulsa el botón de \"I've completed this challenge\" e incluye un enlace a tu CodePen.", "Puedes obtener retroalimentación sobre tu proyecto por parte de otros campistas, compartiéndolo en nuestra Sala de chat para revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ], @@ -132,7 +132,7 @@ "User Story: I can play in strict mode where if I get a button press wrong, it notifies me that I have done so, and the game restarts at a new random series of button presses.", "User Story: I can win the game by getting a series of 20 steps correct. I am notified of my victory, then the game starts over.", "Hint: Here are mp3s you can use for each button: https://s3.amazonaws.com/freecodecamp/simonSound1.mp3, https://s3.amazonaws.com/freecodecamp/simonSound2.mp3, https://s3.amazonaws.com/freecodecamp/simonSound3.mp3, https://s3.amazonaws.com/freecodecamp/simonSound4.mp3.", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen.", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -155,7 +155,7 @@ "Historia de usuario: Puedo jugar en modo estricto donde si presiono el botón equivocado, se me notifica de mi error, y el juego vuelve a comenzar con una nueva serie aleatoria de colores.", "Historia de usuario: Puedo ganar el juego si completo 20 pasos correctos. Se me notifica sobre mi victoria, tras lo cual el juego se reinicia.", "Pista: Aquí hay algunos mp3s que puedes utilizar para tus botones: https://s3.amazonaws.com/freecodecamp/simonSound1.mp3, https://s3.amazonaws.com/freecodecamp/simonSound2.mp3, https://s3.amazonaws.com/freecodecamp/simonSound3.mp3, https://s3.amazonaws.com/freecodecamp/simonSound4.mp3.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", "Cuando hayas terminado, pulsa el botón de \"I've completed this challenge\" e incluye un enlace a tu CodePen.", "Puedes obtener retroalimentación sobre tu proyecto por parte de otros campistas, compartiéndolo en nuestra Sala de chat para revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ], diff --git a/seed/challenges/01-front-end-development-certification/basic-bonfires.json b/seed/challenges/01-front-end-development-certification/basic-bonfires.json index 8359b7681c..d795ddea47 100644 --- a/seed/challenges/01-front-end-development-certification/basic-bonfires.json +++ b/seed/challenges/01-front-end-development-certification/basic-bonfires.json @@ -73,7 +73,7 @@ "Reverse the provided string.", "You may need to turn the string into an array before you can reverse it.", "Your result must be a string.", - "Remember to use Read-Search-Ask if you get stuck. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Write your own code." ], "challengeSeed": [ "function reverseString(str) {", @@ -105,7 +105,7 @@ "Invierte la cadena de texto que se te provee", "Puede que necesites convertir la cadena de texto en un arreglo antes de que puedas invertirla", "El resultado debe ser una cadena de texto", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ] }, { @@ -116,7 +116,7 @@ "If the integer is represented with the letter n, a factorial is the product of all positive integers less than or equal to n.", "Factorials are often represented with the shorthand notation n!", "For example: 5! = 1 * 2 * 3 * 4 * 5 = 120", - "Remember to use Read-Search-Ask if you get stuck. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Write your own code." ], "challengeSeed": [ "function factorialize(num) {", @@ -147,7 +147,7 @@ "El factorial de un número entero positivo n es la multiplicación de todos los enteros positivos menores o iguales a n", "Los factoriales son comúnmente representados con la notación n!", "Por ejemplo: 5! = 1 * 2 * 3 * 4 * 5 = 120", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ] }, { @@ -159,7 +159,7 @@ "Note
You'll need to remove all non-alphanumeric characters (punctuation, spaces and symbols) and turn everything lower case in order to check for palindromes.", "We'll pass strings with varying formats, such as \"racecar\", \"RaceCar\", and \"race CAR\" among others.", "We'll also pass strings with special symbols, such as \"2A3*3a2\", \"2A3 3a2\", and \"2_A3*3#A2\".", - "Remember to use Read-Search-Ask if you get stuck. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Write your own code." ], "challengeSeed": [ "function palindrome(str) {", @@ -203,7 +203,7 @@ "Tendrás que quitar los caracteres no alfanuméricos (signos de puntuación, espacioes y símbolos) y transformar las letras a minúsculas para poder verificar si el texto es palíndromo.", "Te proveeremos textos en varios formatos, como \"racecar\", \"RaceCar\", and \"race CAR\" entre otros.", "También vamos a pasar cadenas con símbolos especiales, tales como \"2A3*3a2\", \"2A3 3a2\", y \"2_A3*3#A2\".", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ] }, { @@ -212,7 +212,7 @@ "description": [ "Return the length of the longest word in the provided sentence.", "Your response should be a number.", - "Remember to use Read-Search-Ask if you get stuck. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Write your own code." ], "challengeSeed": [ "function findLongestWord(str) {", @@ -243,7 +243,7 @@ "descriptionEs": [ "Crea una función que devuelva la longitud de la palabra más larga en una frase dada", "El resultado debe ser un número", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ] }, { @@ -252,7 +252,7 @@ "description": [ "Return the provided string with the first letter of each word capitalized. Make sure the rest of the word is in lower case.", "For the purpose of this exercise, you should also capitalize connecting words like \"the\" and \"of\".", - "Remember to use Read-Search-Ask if you get stuck. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Write your own code." ], "challengeSeed": [ "function titleCase(str) {", @@ -280,7 +280,7 @@ "descriptionEs": [ "Crea una función que devuelva la cadena de texto que recibe con la primera letra de cada palabra en mayúscula. Asegúrate de que el resto de las letras sean minúsculas", "Para este ejercicio, también debes poner en mayúscula conectores como \"the\" y \"of\".", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ] }, { @@ -289,7 +289,7 @@ "description": [ "Return an array consisting of the largest number from each provided sub-array. For simplicity, the provided array will contain exactly 4 sub-arrays.", "Remember, you can iterate through an array with a simple for loop, and access each member with array syntax arr[i].", - "Remember to use Read-Search-Ask if you get stuck. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Write your own code." ], "challengeSeed": [ "function largestOfFour(arr) {", @@ -318,7 +318,7 @@ "Crea una función que devuelva un arreglo que contenga el mayor de los números de cada sub-arreglo que recibe. Para simplificar las cosas, el arreglo que recibirá tendrá exactamente 4 sub-arreglos", "Recuerda que puedes iterar a través de un arreglo con un búcle simple, y acceder a cada miembro utilizando la sintaxis arr[i].", "Si escribes tu propio test con Chai.js, asegúrate de utilizar un operador de igualdad estricto en lugar de un operador de igualdad cuando compares arreglos. ", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ] }, { @@ -327,7 +327,7 @@ "description": [ "Check if a string (first argument, str) ends with the given target string (second argument, target).", "This challenge can be solved with the .endsWith() method, which was introduced in ES2015. But for the purpose of this challenge, we would like you to use one of the JavaScript substring methods instead.", - "Remember to use Read-Search-Ask if you get stuck. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Write your own code." ], "challengeSeed": [ "function confirmEnding(str, target) {", @@ -361,7 +361,7 @@ "titleEs": "Confirma la terminación", "descriptionEs": [ "Verifica si una cadena de texto (primer argumento) termina con otra cadena de texto (segundo argumento).", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ] }, { @@ -369,7 +369,7 @@ "title": "Repeat a string repeat a string", "description": [ "Repeat a given string (first argument) num times (second argument). Return an empty string if num is not a positive number.", - "Remember to use Read-Search-Ask if you get stuck. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Write your own code." ], "challengeSeed": [ "function repeatStringNumTimes(str, num) {", @@ -399,7 +399,7 @@ "titleEs": "Repite el texto Repite el texto", "descriptionEs": [ "Repite una cadena de texto dada (primer argumento) num veces (segundo argumento). Retorna una cadena de texto vacía si num es un número negativo.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ] }, { @@ -409,7 +409,7 @@ "Truncate a string (first argument) if it is longer than the given maximum string length (second argument). Return the truncated string with a ... ending.", "Note that inserting the three dots to the end will add to the string length.", "However, if the given maximum string length num is less than or equal to 3, then the addition of the three dots does not add to the string length in determining the truncated string.", - "Remember to use Read-Search-Ask if you get stuck. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Write your own code." ], "challengeSeed": [ "function truncateString(str, num) {", @@ -441,7 +441,7 @@ "Trunca una cadena de texto (primer argumento) si su longitud es mayor que un máximo de caracteres dado (segundo argumento). Devuelve la cadena de texto truncada con una terminación \"...\".", "Ten en cuenta que los tres puntos al final también se cuentan dentro de la longitud de la cadena de texto.", "Si el numLeer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ] }, { @@ -449,7 +449,7 @@ "title": "Chunky Monkey", "description": [ "Write a function that splits an array (first argument) into groups the length of size (second argument) and returns them as a two-dimensional array.", - "Remember to use Read-Search-Ask if you get stuck. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Write your own code." ], "challengeSeed": [ "function chunkArrayInGroups(arr, size) {", @@ -481,7 +481,7 @@ "titleEs": "En mil pedazos", "descriptionEs": [ "Escribe una función que parta un arreglo (primer argumento) en fragmentos de una longitud dada (segundo argumento) y los devuelva en forma de un arreglo bidimensional.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ] }, { @@ -490,7 +490,7 @@ "description": [ "Return the remaining elements of an array after chopping off n elements from the head.", "The head means the beginning of the array, or the zeroth index.", - "Remember to use Read-Search-Ask if you get stuck. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Write your own code." ], "challengeSeed": [ "function slasher(arr, howMany) {", @@ -522,7 +522,7 @@ "descriptionEs": [ "Crea una función que devuelva los elementos restantes de un arreglo después de eliminar n elementos de la cabeza.", "Por cabeza nos referimos al inicio de un arreglo, comenzando por el índice 0.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ] }, { @@ -533,7 +533,7 @@ "For example, [\"hello\", \"Hello\"], should return true because all of the letters in the second string are present in the first, ignoring case.", "The arguments [\"hello\", \"hey\"] should return false because the string \"hello\" does not contain a \"y\".", "Lastly, [\"Alien\", \"line\"], should return true because all of the letters in \"line\" are present in \"Alien\".", - "Remember to use Read-Search-Ask if you get stuck. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Write your own code." ], "challengeSeed": [ "function mutation(arr) {", @@ -568,7 +568,7 @@ "Por ejemplo, [\"hello\", \"Hello\"], debe devolver true porque todas las letras en la segunda cadena de texto están presentes en la primera, sin distinguir entre mayúsculas y minúsculas.", "En el caso de [\"hello\", \"hey\"] la función debe devolver false porque la cadena de texto \"hello\" no contiene una \"y\".", "Finalmente, [\"Alien\", \"line\"], la función debe devolver true porque todas las letras en \"line\" están presentes en \"Alien\".", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ] }, { @@ -577,7 +577,7 @@ "description": [ "Remove all falsy values from an array.", "Falsy values in JavaScript are false, null, 0, \"\", undefined, and NaN.", - "Remember to use Read-Search-Ask if you get stuck. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Write your own code." ], "challengeSeed": [ "function bouncer(arr) {", @@ -607,7 +607,7 @@ "descriptionEs": [ "Remueve todos los valores falsy de un arreglo dado", "En javascript, los valores falsy son los siguientes: false, null, 0, \"\", undefined, y NaN.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ] }, { @@ -615,7 +615,7 @@ "title": "Seek and Destroy", "description": [ "You will be provided with an initial array (the first argument in the destroyer function), followed by one or more arguments. Remove all elements from the initial array that are of the same value as these arguments.", - "Remember to use Read-Search-Ask if you get stuck. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Write your own code." ], "challengeSeed": [ "function destroyer(arr) {", @@ -645,7 +645,7 @@ "titleEs": "Buscar y destruir", "descriptionEs": [ "Se te proveerá un arreglo inicial (el primer argumento en la función destroyer), seguido por uno o más argumentos. Elimina todos los elementos del arreglo inicial que tengan el mismo valor que el resto de argumentos.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ] }, { @@ -655,7 +655,7 @@ "Return the lowest index at which a value (second argument) should be inserted into an array (first argument) once it has been sorted. The returned value should be a number.", "For example, getIndexToIns([1,2,3,4], 1.5) should return 1 because it is greater than 1 (index 0), but less than 2 (index 1).", "Likewise, getIndexToIns([20,3,5], 19) should return 2 because once the array has been sorted it will look like [3,5,20] and 19 is less than 20 (index 2) and greater than 5 (index 1).", - "Remember to use Read-Search-Ask if you get stuck. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Write your own code." ], "challengeSeed": [ "function getIndexToIns(arr, num) {", @@ -688,7 +688,7 @@ "Devuelve el menor índice en el que un valor (segundo argumento) debe ser insertado en un arreglo (primer argumento) una vez ha sido ordenado.", "Por ejemplo, where([1,2,3,4], 1.5) debe devolver 1 porque el segundo argumento de la función (1.5) es mayor que 1 (con índice 0 en el arreglo), pero menor que 2 (con índice 1).", "Mientras que where([20,3,5], 19) debe devolver 2 porque una vez ordenado el arreglo se verá com [3,5,20] y 19 es menor que 20 (índice 2) y mayor que 5 (índice 1).", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ] }, { @@ -699,7 +699,7 @@ "A common modern use is the ROT13 cipher, where the values of the letters are shifted by 13 places. Thus 'A' ↔ 'N', 'B' ↔ 'O' and so on.", "Write a function which takes a ROT13 encoded string as input and returns a decoded string.", "All letters will be uppercase. Do not transform any non-alphabetic character (i.e. spaces, punctuation), but do pass them on.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function rot13(str) { // LBH QVQ VG!", @@ -734,7 +734,7 @@ "Un uso moderno común es el cifrado ROT13 , donde los valores de las letras se desplazan 13 espacios. De esta forma 'A' ↔ 'N', 'B' ↔ 'O' y así.", "Crea una función que tome una cadena de texto cifrada en ROT13 como argumento y que devuelva la cadena de texto decodificada.", "Todas las letras que se te pasen van a estar en mayúsculas. No transformes ningún caracter no-alfabético (por ejemplo: espacios, puntuación). Simplemente pásalos intactos.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "isRequired": true, "releasedOn": "January 1, 2016" diff --git a/seed/challenges/01-front-end-development-certification/basic-javascript.json b/seed/challenges/01-front-end-development-certification/basic-javascript.json index c612e47f4f..cf0077ed4c 100644 --- a/seed/challenges/01-front-end-development-certification/basic-javascript.json +++ b/seed/challenges/01-front-end-development-certification/basic-javascript.json @@ -3747,7 +3747,7 @@ "The above outputs \"Hello\" to the console, returns \"World\", but \"byebye\" is never output, because the function exits at the return statement.", "

Instructions

", "Modify the function abTest so that if a or b are less than 0 the function will immediately exit with a value of undefined.", - "Hint
Remember that undefined is a keyword, not a string." + "Hint
Remember that undefined is a keyword, not a string." ], "releasedOn": "January 1, 2016", "challengeSeed": [ @@ -3789,7 +3789,7 @@ "Esta presenta en consola \"Hola\", retorna \"Mundo\", pero \"chaochao\" nunca se presenta, porque la función sale con la sentencia return.", "

Instrucciones

", "Modifica la función abTest de manera que si a o b son menores que 0 la función saldrá inmediatamente con un valor undefined.", - "Pista
Recuerda que undefined es una palabra clave, no una cadena." + "Pista
Recuerda que undefined es una palabra clave, no una cadena." ] }, { @@ -5299,7 +5299,7 @@ "We are now going to try and combine some of the stuff we've just learned and create the logic for a slot machine game.", "For this we will need to generate three random numbers between 1 and 3 to represent the possible values of each individual slot.", "Store the three random numbers in slotOne, slotTwo and slotThree.", - "Generate the random numbers by using the system we used earlier (an explanation of the formula can be found here):", + "Generate the random numbers by using the system we used earlier (an explanation of the formula can be found here):", "Math.floor(Math.random() * (3 - 1 + 1)) + 1;" ], "challengeSeed": [ @@ -5454,7 +5454,7 @@ "Ahora vamos a tratar de combinar algunas de las cosas que hemos aprendido para crear la lógica de una máquina tragamonedas.", "Para esto tendremos que generar tres números aleatorios entre 1 y 3 que representen los valores posibles de cada casilla.", "Guarda los tres números aleatorios en slotOne, slotTwo y slotThree.", - "Genera los números aleatorios utilizando el sistema que usamos anteriormente (puedes encontrar una explicación de la fórmula aquí):", + "Genera los números aleatorios utilizando el sistema que usamos anteriormente (puedes encontrar una explicación de la fórmula aquí):", "Math.floor(Math.random() * (3 - 1 + 1)) + 1;" ] }, diff --git a/seed/challenges/01-front-end-development-certification/basic-ziplines.json b/seed/challenges/01-front-end-development-certification/basic-ziplines.json index 012c6c71b7..5db845b958 100644 --- a/seed/challenges/01-front-end-development-certification/basic-ziplines.json +++ b/seed/challenges/01-front-end-development-certification/basic-ziplines.json @@ -143,7 +143,7 @@ "Fulfill the below user stories. Use whichever libraries you need. Give it your own personal style.", "User Story: I can view a tribute page with an image and text.", "User Story: I can click on a link that will take me to an external website with further information on the topic.", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen.", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -162,7 +162,7 @@ "Правило #2: Реализуйте следующие пользовательские истории. Используйте любые библиотеки, которые потребуются. Оформите приложение в вашем собственном стиле.", "Пользовательская история: Я могу видеть на странице изображение и текст.", "Пользовательская история: Я могу нажать на ссылку, которая ведет на внешнюю страницу с дополнительной информацией по теме.", - "Если что-то не получается, воспользуйтесь Read-Search-Ask.", + "Если что-то не получается, воспользуйтесь Read-Search-Ask.", "Когда выполните задание кликните кнопку \"I've completed this challenge\" и добавьте ссылку на ваш CodePen.", "Вы можете получить отзыв о вашем проекте от коллег, поделившись ссылкой на него в нашем чате для рассмотрения кода. Также вы можете поделиться ею через Twitter и на странице Free Code Camp вашего города на Facebook." ], @@ -173,7 +173,7 @@ "Regla #2: Satisface las siguientes historias de usuario. Usa cualquier librería que necesites. Dale tu estilo personal.", "Historia de usuario: Puedo ver una página tributo con una imagen y texto.", "Historia de usuario: Puedo pulsar en un enlace que me llevará a un sitio web externo con mayor información sobre el tema.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", "Cuando hayas terminado, pulsa el botón \"I've completed this challenge\" e incluye un link a tu CodePen. ", "Puedes obtener retroalimentación sobre tu proyecto por parte de otros campistas, compartiéndolo en nuestra Sala de chat para revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ] @@ -191,7 +191,7 @@ "Don't worry if you don't have anything to showcase on your portfolio yet - you will build several apps on the next few CodePen challenges, and can come back and update your portfolio later.", "There are many great portfolio templates out there already. However, you should consider building your portfolio page as much as you can from the ground up. Using Bootstrap can help make this process much easier for you.", "Note that CodePen.io overrides the Window.open() function, so if you want to open windows using jQuery, you will need to target invisible anchor elements like this one: <a target='_blank'>.", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen. ", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -214,7 +214,7 @@ "Не переживайте если вам пока нечего показать в портфолио - вы создадите несколько веб приложений в следующих заданиях, а затем вернетесь и обновите портфолио.", "В сети существует много шаблонов для портфолио, но в этом задании вам необходимо создать собственную уникальную страницу. Используя Bootstrap, сделать это будет намного проще.", "Обратите внимание, что CodePen.io переопределяет функцию Window.open(), поэтому, если вы хотите открывать окна используя jQuery, необходимо будет адресовать невидимые якорные элементы, такие как этот: <a target='_blank'&rt;.", - "Если что-то не получается, воспользуйтесь Read-Search-Ask.", + "Если что-то не получается, воспользуйтесь Read-Search-Ask.", "Когда выполните задание кликните кнопку \"I've completed this challenge\" и добавьте ссылку на ваш CodePen.", "Вы можете получить отзыв о вашем проекте от коллег, поделившись ссылкой на него в нашем чате для рассмотрения кода. Также вы можете поделиться ею через Twitter и на странице Free Code Camp вашего города на Facebook." ], @@ -230,7 +230,7 @@ "No te preocupes si no tienes nada que mostrar en tu portafolio todavía - en los siguientes desafíos crearás varias aplicaciones en CodePen, así que puedes regresar luego para actualizar tu portafolio.", "Hay varias plantillas buenas, pero para este desafío, tendrás que construir la página web de tu portafolio completamente por tu cuenta. Usar Bootstrap hará el trabajo mucho más fácil para ti.", "Ten en mente que CodePen.io ignora la función Window.open(), así que si quieres abrir alguna ventana usando jQuery, necesitarás utilizar como objetivo un elemento de ancla invisible como el siguiente: <a target='_blank'>.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", "Cuando hayas terminado, pulsa el botón \"I've completed this challenge\" e incluye un link a tu CodePen. ", "Puedes obtener retroalimentación sobre tu proyecto por parte de otros campistas, compartiéndolo en nuestra Sala de chat para revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ] diff --git a/seed/challenges/01-front-end-development-certification/gear-up-for-success.json b/seed/challenges/01-front-end-development-certification/gear-up-for-success.json index 8a1a6b7020..93706ac016 100644 --- a/seed/challenges/01-front-end-development-certification/gear-up-for-success.json +++ b/seed/challenges/01-front-end-development-certification/gear-up-for-success.json @@ -17,7 +17,7 @@ "//i.imgur.com/IqBnnuFr.jpg", "A picture of our study group directory.", "Click the button below to open our study group directory.

Find your local study group and click it. This will take you to their Facebook group.

Click the Join group button. Once someone from the group approves your join request, and you'll get a notification within Facebook, and can go back and introduce yourself.", - "https://www.freecodecamp.com/study-group-directory/" + "https://www.freecodecamp.org/study-group-directory/" ] ], "challengeSeed": [], @@ -36,7 +36,7 @@ "//i.imgur.com/fTFMjwf.gif", "Un gif mostrándote como puedes pulsar en el enlace inferior, encontrar tu ciudad en la lista de Campamentos, entonces haz clic en el enlace de Facebook para tu ciudad y unirte al grupo de Facebook de tu ciudad.", "Encuentra tu ciudad en esta lista y haz clic en esta. Esto te llevara al grupo de Facebook del Campamento de tu ciudad. Da clic en el botón de \"Unirse al grupo\" para unirte a el grupo. Alguien del mismo campamento debería aprobarte en breve.", - "http://forum.freecodecamp.com/t/free-code-camp-city-based-local-groups/19574" + "http://forum.freecodecamp.org/t/free-code-camp-city-based-local-groups/19574" ] ], "titleDe": "Tritt einem Campsite in deiner Stadt bei", @@ -51,7 +51,7 @@ "//i.imgur.com/fTFMjwf.gif", "Ein GIF das zeigt wie du auf den untenstehenden Link klickst, deine Stadt aus der Liste aller Campsites suchst, auf den Facebook Link klickst und der Facebook Gruppe beitrittst.", "Finde deine Stadt auf dieser Liste und klick sie an. Du wirst auf die Facebook Gruppe des Campsites deiner Stadt geleitet. Klick den \"Gruppe beitreten\" Button um eine Beitrittsanfrage zu stellen. Jemand aus der Gruppe sollte dich in kürzester Zeit annehmen.", - "http://forum.freecodecamp.com/t/free-code-camp-city-based-local-groups/19574" + "http://forum.freecodecamp.org/t/free-code-camp-city-based-local-groups/19574" ] ], "TitleIt": "Unisciti ad un gruppo Free Code Camp nella tua città", @@ -66,7 +66,7 @@ "//i.imgur.com/fTFMjwf.gif", "Una gif che mostra come è possibile fare clic sul link qui sotto, e trovare la tua città nella lista dei gruppi locali.", "Trova la tua città in questa lista e cliccala. Verrai indirizzato alla sua pagina Facebook. Fai clic sul pulsante \" Entra nel gruppo \". Qualcuno del gruppo dovrebbe approvare a breve la tua richiesta. Se la tua città non è in questo elenco, scorri alla parte superiore di questo articolo wiki per le istruzioni su come iniziare un gruppo nella tua città. ", - "http://forum.freecodecamp.com/t/free-code-camp-city-based-local-groups/19574" + "http://forum.freecodecamp.org/t/free-code-camp-city-based-local-groups/19574" ] ] }, @@ -131,4 +131,4 @@ "challengeType": 7 } ] -} \ No newline at end of file +} diff --git a/seed/challenges/01-front-end-development-certification/html5-and-css.json b/seed/challenges/01-front-end-development-certification/html5-and-css.json index 7db3dadb65..5ce1f4dd0f 100644 --- a/seed/challenges/01-front-end-development-certification/html5-and-css.json +++ b/seed/challenges/01-front-end-development-certification/html5-and-css.json @@ -1537,7 +1537,7 @@ "Aqui está um diagrama de um elemento a. Neste caso, o elemento a é utilizado no meio de um elemento de parágrafo, o que significa que o link externo aparecerá no meio de uma frase.", " \"diagrama", "Veja um exemplo:", - "<p>Aqui está um <a href=\"https://freecodecamp.com\"> link ligado ao Free Code Camp</a> para que você o siga.</p>", + "<p>Aqui está um <a href=\"https://freecodecamp.org\"> link ligado ao Free Code Camp</a> para que você o siga.</p>", "Crie um elemento a que esteja ligado ao site http://freecatphotoapp.com e tenha como texto de âncora \"fotos de gatos\"." ], "namePtBR": "Ligue Páginas Externas com o Elemento Âncora", @@ -1546,7 +1546,7 @@ "So sieht ein a Element aus. In diesem Fall wird es innerhalb eines Paragraphen Elements verwendet. Das bedeutet dein Link wird innerhalb des Satzes erscheinen.", "\"Eine", "Hier ist ein Beispiel:", - "<p>Hier ist ein <a href=\"http://freecodecamp.com\"> Link zu Free Code Camp</a> dem du folgen kannst.</p>", + "<p>Hier ist ein <a href=\"http://freecodecamp.org\"> Link zu Free Code Camp</a> dem du folgen kannst.</p>", "Erstelle ein a Element, das auf http://freecatphotoapp.com verlinkt und den \"cat photos\" als anchor text (Link-Text) beinhaltet." ], "titleRU": "Присоедините внешние страницы с помощью якорных элементов", @@ -1555,7 +1555,7 @@ "Вот диаграмма элемента a. В этом случае, элемент a использован в середине элемента параграфа, что значит, что ссылка появится в середине предложения.", "\"a", "Вот пример:", - "<p>Вот <a href=\"http://freecodecamp.com\"> ссылка на Free Code Camp</a> для перехода на ресурс.</p>", + "<p>Вот <a href=\"http://freecodecamp.org\"> ссылка на Free Code Camp</a> для перехода на ресурс.</p>", "Создайте элемент a, который присоединяет http://freecatphotoapp.com и имеет значение \"cat photos\" в качестве текста якоря." ], "title": "Link to External Pages with Anchor Elements", @@ -1564,7 +1564,7 @@ "Here's a diagram of an a element. In this case, the a element is used in the middle of a paragraph element, which means the link will appear in the middle of a sentence.", "\"a", "Here's an example:", - "<p>Here's a <a href=\"http://freecodecamp.com\"> link to Free Code Camp</a> for you to follow.</p>", + "<p>Here's a <a href=\"http://freecodecamp.org\"> link to Free Code Camp</a> for you to follow.</p>", "Create an a element that links to http://freecatphotoapp.com and has \"cat photos\" as its anchor text." ], "challengeSeed": [ @@ -1614,7 +1614,7 @@ "Aquí está un diagrama de un elemento a. En este caso, el elemento a se utiliza en el medio de un elemento de párrafo, lo que significa que el enlace aparecerá en el medio de una frase. ", " \"un ", "He aquí un ejemplo:", - "<p>Aquí está un <a href=\"https://freecodecamp.com\"> enlace a Free Code Camp</a> para que lo sigas.</p>", + "<p>Aquí está un <a href=\"https://freecodecamp.org\"> enlace a Free Code Camp</a> para que lo sigas.</p>", "Crea un elemento a que se vincule a http://freecatphotoapp.com y tenga como texto de ancla \"fotos de gatos\"." ], "titleDe": "Verlinke externe Seiten mit Anker Elementen", @@ -1626,7 +1626,7 @@ "Outra vez, aqui está um diagrama de um elemento a para você usar como referência.", "\"diagrama", "Veja um exemplo:", - "<p>Este é um <a href=\"https://freecodecamp.com\"> link ligado ao Free Code Camp</a> para que você o siga.</p>", + "<p>Este é um <a href=\"https://freecodecamp.org\"> link ligado ao Free Code Camp</a> para que você o siga.</p>", "Aninhamento significa ter um elemento no interior de outro elemento.", "Agora, aninhe o elemento a existente dentro de um novo elemento p de forma que o parágrafo diga \"View more cat photos\", mas onde apenas \"cat photos\" seja um link, e o resto seja texto comum." ], @@ -1635,7 +1635,7 @@ "Hier ist nochmal ein Beispiel für ein a Element:", "\"Eine", "Hier ist ein Beispiel:", - "<p>Hier ist ein <a href=\"https://freecodecamp.com\"> Link zu Free Code Camp</a> dem du folgen kannst.</p>", + "<p>Hier ist ein <a href=\"https://freecodecamp.org\"> Link zu Free Code Camp</a> dem du folgen kannst.</p>", "Nesting bedeuted ein Element innerhalb eines anderen Elements zu schreiben", "Jetzt umschließe dein a Element mit einem neuen p Element (direkt nach dem bereits existierenden h2 Element) indem steht \"View more cat photos\", wo allerdings nur \"cat photos\" ein Link ist und der Rest normaler Text." ], @@ -1644,7 +1644,7 @@ "Вот диаграмма элемента a:", "\"a", "Вот пример:", - "<p>Вот <a href=\"https://freecodecamp.com\"> ссылка на Free Code Camp</a> для перехода на ресурс.</p>", + "<p>Вот <a href=\"https://freecodecamp.org\"> ссылка на Free Code Camp</a> для перехода на ресурс.</p>", "Вложенность значит установку одного элемента внутрь друго элемента.", "Теперь вложите ваш существующий элемент a внутрь нового элемента p (сразу после существующего элемента h2) таким образом, что добавляемый параграф сообщает: \"View more cat photos\", но где только \"cat photos\" является ссылкой, а остальной текст обычный." ], @@ -1653,7 +1653,7 @@ "Again, here's a diagram of an a element for your reference:", "\"a", "Here's an example:", - "<p>Here's a <a href=\"https://freecodecamp.com\"> link to Free Code Camp</a> for you to follow.</p>", + "<p>Here's a <a href=\"https://freecodecamp.org\"> link to Free Code Camp</a> for you to follow.</p>", "Nesting just means putting one element inside of another element.", "Now nest your existing a element within a new p element (just after the existing h2 element) so that the surrounding paragraph says \"View more cat photos\", but where only \"cat photos\" is a link, and the rest of the text is plain text." ], @@ -1710,7 +1710,7 @@ "Una vez más, aquí está un diagrama de un elemento a para tu referencia:", "\"un", "He aquí un ejemplo:", - "<p>Aquí hay un <a href=\"https://freecodecamp.com\"> enlace a Free Code Camp</a> para que lo sigas.</p>", + "<p>Aquí hay un <a href=\"https://freecodecamp.org\"> enlace a Free Code Camp</a> para que lo sigas.</p>", "Anidamiento simplemente significa poner un elemento dentro de otro elemento.", "Ahora anida el elemento a existente dentro de un nuevo elemento p (justo después del elemento h2 que ya tienes) de tal forma que el párrafo que lo rodee diga \"View more cat photos\", pero que sólo \"cat photos\" sea un enlace, y el resto sea texto plano ." ], @@ -4742,4 +4742,4 @@ ] } ] -} \ No newline at end of file +} diff --git a/seed/challenges/01-front-end-development-certification/intermediate-bonfires.json b/seed/challenges/01-front-end-development-certification/intermediate-bonfires.json index b5ae8decf5..a552949758 100644 --- a/seed/challenges/01-front-end-development-certification/intermediate-bonfires.json +++ b/seed/challenges/01-front-end-development-certification/intermediate-bonfires.json @@ -10,7 +10,7 @@ "description": [ "We'll pass you an array of two numbers. Return the sum of those two numbers and all numbers between them.", "The lowest number will not always come first.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function sumAll(arr) {", @@ -41,13 +41,13 @@ "descriptionEs": [ "Te pasaremos un vector que contiene dos números. Crea una función que devuelva la suma de esos dos números y todos los números entre ellos.", "El número menor no siempre será el primer elemento en el vector.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Additionner tous les nombres d'une série", "descriptionFr": [ "Nous te passons un tableau de deux nombres. Crée une fonction qui renvoie la somme de ces 2 nombres ainsi que tous les nombres entre ceux-ci.", "Le plus petit nombre ne viendra pas forcément en premier.", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -55,7 +55,7 @@ "title": "Diff Two Arrays", "description": [ "Compare two arrays and return a new array with any items only found in one of the two given arrays, but not both. In other words, return the symmetric difference of the two arrays.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function diffArray(arr1, arr2) {", @@ -92,12 +92,12 @@ "titleEs": "Obtén la diferencia entre dos vectores", "descriptionEs": [ "Crea una función que compare dos vectores y que devuelva un nuevo vector que contenga los elementos que sólo se encuentre en uno de los vectores dados, pero no en ambos En otras palabras, devuelve la diferencia simétrica entre los dos vectores.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Comparer 2 arrays", "descriptionFr": [ "Compare les 2 tableaux donnés et renvoie un nouvel tableau avec les éléments trouvé dans un seul des deux tableaux, pas dans les deux. En d'autres termes, renvoie la différence symétrique des deux tableaux.", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -106,7 +106,7 @@ "description": [ "Convert the given number into a roman numeral.", "All roman numerals answers should be provided in upper-case.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function convertToRoman(num) {", @@ -158,13 +158,13 @@ "descriptionEs": [ "Convierte el número dado en numeral romano.", "Todos los numerales romanos en las respuestas deben estar en mayúsculas.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Convertir en chiffres romains", "descriptionFr": [ "Convertis le nombre donné en chiffres romains.", "Tous les chiffres romains doivent être en lettres capitales.", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -173,7 +173,7 @@ "description": [ "Make a function that looks through an array of objects (first argument) and returns an array of all objects that have matching property and value pairs (second argument). Each property and value pair of the source object has to be present in the object from the collection if it is to be included in the returned array.", "For example, if the first argument is [{ first: \"Romeo\", last: \"Montague\" }, { first: \"Mercutio\", last: null }, { first: \"Tybalt\", last: \"Capulet\" }], and the second argument is { last: \"Capulet\" }, then you must return the third object from the array (the first argument), because it contains the property and its value, that was passed on as the second argument.", - "Remember to use Read-Search-Ask if you get stuck. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Write your own code." ], "challengeSeed": [ "function whatIsInAName(collection, source) {", @@ -209,13 +209,13 @@ "descriptionEs": [ "Crea una función que busque en un vector de objetos (primer argumento) y devuelva un vector con todos los objetos que compartan el valor indicado para una propiedad dada (segundo argumento). Cada pareja de propiedad y valor debe estar presente en el objeto de la colección para ser incluido en el vector devuelto por la función", "Por ejemplo, si el primer argumento es [{ first: \"Romeo\", last: \"Montague\" }, { first: \"Mercutio\", last: null }, { first: \"Tybalt\", last: \"Capulet\" }], y el segundo argumento es { last: \"Capulet\" }, entonces tu función debe devolver el tercer objeto del vector en el primer argumento, ya que contiene la propiedad y el valor indicados en el segundo argumento.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "O Roméo! Roméo!", "descriptionFr": [ "Écris une fonction qui parcourt un array d'objets (premier argument) et renvoie un array de tous les objects ayant les paires de nom/valeur correspondantes à l'objet donné (second argument). Chaque paire de nom et de valeur de l'objet source doit être présente dans les objects renvoyés.", "Par exemple, si le premier argument est [{ first: \"Romeo\", last: \"Montague\" }, { first: \"Mercutio\", last: null }, { first: \"Tybalt\", last: \"Capulet\" }], et le second argument est { last: \"Capulet\" }, tu dois renvoyer le troisième objet de l'array (premier argument), parce qu'il contient le nom et sa valeur, donnés en deuxième argument.", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -227,7 +227,7 @@ "Second argument is the word that you will be replacing (before).", "Third argument is what you will be replacing the second argument with (after).", "NOTE: Preserve the case of the original word when you are replacing it. For example if you mean to replace the word \"Book\" with the word \"dog\", it should be replaced as \"Dog\"", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function myReplace(str, before, after) {", @@ -261,7 +261,7 @@ "El segundo argumento es la palabra que se va a reemplazar", "El tercer argumento es lo que reemplazará a la palabra indicada en el segundo argumento", "NOTA: Debes respetar mayúsculas y minúsculas de la palabra original cuando ejecutes el reemplazo. Por ejemplo, si quisieras reemplazar la palabra \"Libro\" con la palabra \"perro\", deberías insertar en vez la palabra \"Perro\"", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Cherche et remplace", "descriptionFr": [ @@ -270,7 +270,7 @@ "Le deuxième argument est le mot à remplacer (avant).", "Le troisième argument est le mot qui doit remplacer le deuxième argument (après).", "NB: Tu dois respecter les majuscules ou miniscules du mot originel que tu remplaces. Par exemple, si tu veux remplacer le mot \"Livre\" par \"chien\", tu devras le remplacer par \"Chien\"", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -281,7 +281,7 @@ "Pig Latin takes the first consonant (or consonant cluster) of an English word, moves it to the end of the word and suffixes an \"ay\".", "If a word begins with a vowel you just add \"way\" to the end.", "Input strings are guaranteed to be English words in all lowercase.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function translatePigLatin(str) {", @@ -315,7 +315,7 @@ "Traduce la cadena de texto que se te provee al Latín de los cerdos (Pig Latin)", "Pig Latin toma la primera consonante (o grupo de consonantes) de una palabra en inglés, la mueve al final de la palabra y agrega un \"ay\".", "Si la palabra comienza con una vocal, simplemente añade \"way\" al final.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Pig latin", "descriptionFr": [ @@ -323,7 +323,7 @@ "Le Pig Latin prend la ou les première(s) consonne(s) d'un mot en anglais et les mets à la fin du mot accompagné par le suffixe \"ay\".", "Si un mot commence par une voyelle ajoute \"way\" à la fin du mot.", "Les chaînes de caractères entrées sont garanties d'être des mots anglais, en lettres minuscules.", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -335,7 +335,7 @@ "Return the provided character as the first element in each array.", "For example, for the input GCG, return [[\"G\", \"C\"], [\"C\",\"G\"],[\"G\", \"C\"]]", "The character and its pair are paired up in an array, and all the arrays are grouped into one encapsulating array.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function pairElement(str) {", @@ -366,7 +366,7 @@ "Devuelve la letra que se te provee como el primer elemento en cada vector", "Por ejemplo, si te pasáramos la cadena GCG, tu función debería devolver el vector: [[\"G\", \"C\"], [\"C\",\"G\"],[\"G\", \"C\"]]", "Cada letra que se te provee y su pareja deben estar contenidos en un vector, y cada uno de estos vectores debe estar contenidos en un vector.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Coupler les bases d'ADN", "descriptionFr": [ @@ -375,7 +375,7 @@ "Renvoie le caractère donné comme premier élément de chaque tableau.", "Par exemple, pour GCG, il faut renvoyer [[\"G\", \"C\"], [\"C\",\"G\"],[\"G\", \"C\"]]", "Chaque caractère et sa paire sont couplées dans un tableau, et tous les tableaux sont groupés dans un tableau.", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -384,7 +384,7 @@ "description": [ "Find the missing letter in the passed letter range and return it.", "If all letters are present in the range, return undefined.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function fearNotLetter(str) {", @@ -413,13 +413,13 @@ "descriptionEs": [ "Crea una función que devuelva la letra que falta en el rango de letras que se le pasa", "Si todas las letras en el rango están presentes, la función debe devolver undefined.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Lettres perdues", "descriptionFr": [ "Crée une fonction qui renvoie la lettre manquante dans la série.", "Si aucune lettre n'est manquante, renvoie undefined.", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -428,7 +428,7 @@ "description": [ "Check if a value is classified as a boolean primitive. Return true or false.", "Boolean primitives are true and false.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function booWho(bool) {", @@ -463,13 +463,13 @@ "descriptionEs": [ "Crea una función que verifique si el valor que se le pasa es de tipo booleano. Haz que la función devuelva true o false según corresponda.", "Los primitivos booleanos primitivos son: true y false", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Boo !", "descriptionFr": [ "Crée une fonction qui vérifie qu'une valeur est de type booléen. Renvoie true ou false.", "Les primitives booléennes sont true ou false.", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -480,7 +480,7 @@ "In other words, all values present from all arrays should be included in their original order, but with no duplicates in the final array.", "The unique numbers should be sorted by their original order, but the final array should not be sorted in numerical order.", "Check the assertion tests for examples.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function uniteUnique(arr) {", @@ -511,7 +511,7 @@ "En otra palabras, todos los valores presentes en todos los vectores deben aparecer en el vector final en su orden original, pero sin duplicados.", "Los valores únicos deben aparecer en el orden original, pero el vector final no necesariamente debe mostrar los elementos en orden numérico.", "Puedes usar de referencia las pruebas de verificación si necesitas ejemplos.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Union arrangée", "descriptionFr": [ @@ -519,7 +519,7 @@ "En d'autres termes, toutes les valeurs des tableaux doivent être incluses dans l'ordre originel, sans doublon dans le tableau final.", "Les valeurs uniques doivent être classées dans l'ordre originel, mais le tableau final ne doit pas être classé par ordre croissant.", "Réfère toi aux test pour plus d'examples.", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -527,7 +527,7 @@ "title": "Convert HTML Entities", "description": [ "Convert the characters &, <, >, \" (double quote), and ' (apostrophe), in a string to their corresponding HTML entities.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function convertHTML(str) {", @@ -560,12 +560,12 @@ "titleEs": "Convierte entidades HTML", "descriptionEs": [ "Convierte los caracteres &, <, >, \"' (comilla), y ' (apóstrofe), contenidos en la cadena de texto que se te pasa, en sus entidades HTML correspondientes", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Convertir les entités HTML", "descriptionFr": [ "Convertis les caractères &, <, >, \"' (guillemet), y ' (apostrophe), contenus dans la chaîne de caractères en entités HTML.", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -573,7 +573,7 @@ "title": "Spinal Tap Case", "description": [ "Convert a string to spinal case. Spinal case is all-lowercase-words-joined-by-dashes.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function spinalCase(str) {", @@ -604,12 +604,12 @@ "titleEs": "separado-por-guiones", "descriptionEs": [ "Convierte la cadena de texto que se te pasa al formato spinal case. Spinal case es cuando escribes todas las palabras en-minúsculas-unidas-por-guiones.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Trait d'union", "descriptionFr": [ "Convertis la chaîne de caractères en spinal case. Spinal case correspond au bas-de-casse-séparé-par-des-tirets.", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -619,7 +619,7 @@ "Given a positive integer num, return the sum of all odd Fibonacci numbers that are less than or equal to num.", "The first two numbers in the Fibonacci sequence are 1 and 1. Every additional number in the sequence is the sum of the two previous numbers. The first six numbers of the Fibonacci sequence are 1, 1, 2, 3, 5 and 8.", "For example, sumFibs(10) should return 10 because all odd Fibonacci numbers less than 10 are 1, 1, 3, and 5.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function sumFibs(num) {", @@ -650,14 +650,14 @@ "Crea una función que devuelva la suma de todos los números impares en la secuencia de Fibonacci hasta el número que se le pasa como argumento, incluyéndolo en caso de ser un número de la secuencia.", "Los primeros números de la secuencia son 1, 1, 2, 3, 5 y 8, y cada número siguiente es la suma de los dos números anteriores.", "Por ejemplo, si se te pasa el número 4, la función deberá devolver 5, ya que los números impares menores que 4 son 1, 1 y 3.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Additionner tous les nombre de Fibonacci impairs", "descriptionFr": [ "Crée une fonction qui additionne tous les nombre de Fibonacci jusqu'au nombre donné (inclus si c'est un nombre de Fibonacci).", "Les premiers chiffres de la séquence sont 1, 1, 2, 3, 5 y 8, et chaque nombre correspond à la somme des deux nombres précédents.", "Par example, pour le chiffre 4, la fonction doit retourner 5, puisque les chiffres précédent 4 sont 1, 1 et 3.", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -667,7 +667,7 @@ "Sum all the prime numbers up to and including the provided number.", "A prime number is defined as a number greater than one and having only two divisors, one and itself. For example, 2 is a prime number because it's only divisible by one and two.", "The provided number may not be a prime.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function sumPrimes(num) {", @@ -696,14 +696,14 @@ "Suma todos los números primos hasta, e incluyendo, el número que se te pasa", "Números primos son todos aquellos que sólo son divisibles entre 1 y entre sí mismos. Por ejemplo, el número 2 es primo porque solo es divisible por 1 y por 2. Por el contrario, el número 1 no es primo, ya que sólo puede dividirse por sí mismo", "El número que se le provee a la función no puede ser primo", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Additionner tous les nombres primaires", "descriptionFr": [ "Additionne tous les nombres primaires jusqu'au nombre donné (inclus).", "Un nombre primaire est un nombre divisible que par 1 ou par lui-même (plus grand que 1). Par exemple, 2 est un nombre primaire puisqu'il n'est divisible que par 1 et 2. 1 n'est pas primaire puiqu'il n'est divisible que par lui-même.", "Le nombre donné en argument n'est pas forcément un nombre primaire.", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -713,7 +713,7 @@ "Find the smallest common multiple of the provided parameters that can be evenly divided by both, as well as by all sequential numbers in the range between these parameters.", "The range will be an array of two numbers that will not necessarily be in numerical order.", "e.g. for 1 and 3 - find the smallest common multiple of both 1 and 3 that is evenly divisible by all numbers between 1 and 3.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function smallestCommons(arr) {", @@ -744,14 +744,14 @@ "En el ejercicio se te provee un vector con dos números. Crea una función que encuentre el número más pequeño que sea divisible entre ambos números, así como entre todos los números enteros entre ellos.", "Tu función debe aceptar como argumento un vector con dos números, los cuales no necesariamente estarán en orden.", "Por ejemplo, si se te pasan los números 1 y 3, deberás encontrar el mínimo común múltiplo de 1 y 3 que es divisible por todos los números entre 1 y 3.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Plus petit commun multiple", "descriptionFr": [ "Cherche le plus petit commun multiple qui soit divisible par les deux nombres donnés et par les nombres de la série entre ces deux nombres.", "La série est un tableau de deux nombres qui ne seront pas nécessairement dans l'ordre croissant.", "Par exemple, pour 1 et 3, il faut trouver le plus petit commun multiple de 1 et 3 mais aussi des nombres entre 1 et 3/", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -759,7 +759,7 @@ "title": "Finders Keepers", "description": [ "Create a function that looks through an array (first argument) and returns the first element in the array that passes a truth test (second argument).", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function findElement(arr, func) {", @@ -785,12 +785,12 @@ "titleEs": "Buscando la verdad", "descriptionEs": [ "Crea una función que busque dentro de un vector (primer argumento) y que devuelva el primer elemento que pase una prueba de verdad (segundo argumento).", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Détecteur de mensonges", "descriptionFr": [ "Crée une fonction qui parcourt un tableau (premier argument) et renvoie le premier élément du tableau qui passe le test (second argument).", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -800,7 +800,7 @@ "Drop the elements of an array (first argument), starting from the front, until the predicate (second argument) returns true.", "The second argument, func, is a function you'll use to test the first elements of the array to decide if you should drop it or not.", "Return the rest of the array, otherwise return an empty array.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function dropElements(arr, func) {", @@ -833,13 +833,13 @@ "descriptionEs": [ "Toma los elementos contenidos en el vector que se te provee en el primer argumento de la función y elimínalos uno por uno, hasta que la función provista en el segundo argumento devuelva true.", "Retorna el resto del vector, de lo contrario retorna un vector vacío.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Laisse tomber", "descriptionFr": [ "Écarte les éléments du tableau (premier argument), en commençant par la gauche, jusqu'à ce la fonction (second argument) renvoie true.", "Renvoie le reste du tableau, ou dans le cas contraire un tableau vide", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -847,7 +847,7 @@ "title": "Steamroller", "description": [ "Flatten a nested array. You must account for varying levels of nesting.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function steamrollArray(arr) {", @@ -875,12 +875,12 @@ "titleEs": "Aplanadora", "descriptionEs": [ "Aplana el vector anidado que se te provee. Tu función debe poder aplanar vectores de cualquier forma.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Rouleau compresseur", "descriptionFr": [ "Aplatis le tableau donné. Ta fonction doit pour gérer différentes formes de tableaux.", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -889,7 +889,7 @@ "description": [ "Return an English translated sentence of the passed binary string.", "The binary string will be space separated.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function binaryAgent(str) {", @@ -916,13 +916,13 @@ "descriptionEs": [ "Haz que la función devuelva el mensaje en inglés escondido en el código binario de la cadena de texto que se le pasa.", "La cadena de texto binaria estará separada por espacios.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Agent binaire", "descriptionFr": [ "Traduis la chaîne binaire donnée en anglais.", "La chaîne binaire comporte des espaces.", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -931,7 +931,7 @@ "description": [ "Check if the predicate (second argument) is truthy on all elements of a collection (first argument).", "Remember, you can access object properties through either dot notation or [] notation.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function truthCheck(collection, pre) {", @@ -962,13 +962,13 @@ "descriptionEs": [ "Verifica si la función en el segundo argumento devuelve true para todos los elementos de la colección en el primer argumento.", "Recuerda que puedes accesar a las propiedades de un objeto, ya sea a través de la notación por punto o de la notación por corchete usando [].", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Tout doit être vrai", "descriptionFr": [ "Vérifie que la fonction donnée (second argument) est vraie sur tous les éléments de la collection (premier argument).", "Tu peux utiliser un point ou des [] pour accéder aux propritétés de l'objet.", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] }, { @@ -981,7 +981,7 @@ "var sumTwoAnd = addTogether(2);", "sumTwoAnd(3) returns 5.", "If either argument isn't a valid number, return undefined.", - "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." + "Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code." ], "challengeSeed": [ "function addTogether() {", @@ -1015,7 +1015,7 @@ "var sumTwoAnd = add(2);", "sumTwoAnd(3) devuelve 5.", "Si alguno de los argumentos no es un número válido, haz que devuelva undefined.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado. Intenta programar en pareja. Escribe tu propio código." ], "titleFr": "Arguments optionnels", "descriptionFr": [ @@ -1025,7 +1025,7 @@ "var sumTwoAnd = add(2);", "sumTwoAnd(3) renvoie 5.", "Si aucun argument n'est un nombre, renvoie undefined.", - "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." + "N'oublie pas d'utiliser Lire-Chercher-Demander si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code." ] } ] diff --git a/seed/challenges/01-front-end-development-certification/intermediate-ziplines.json b/seed/challenges/01-front-end-development-certification/intermediate-ziplines.json index 2c05ab2f9e..ab07e5ac7a 100644 --- a/seed/challenges/01-front-end-development-certification/intermediate-ziplines.json +++ b/seed/challenges/01-front-end-development-certification/intermediate-ziplines.json @@ -12,7 +12,7 @@ "Fulfill the below user stories. Use whichever libraries or APIs you need. Give it your own personal style.", "User Story: I can click a button to show me a new random quote.", "User Story: I can press a button to tweet out a quote.", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen. ", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -32,7 +32,7 @@ "Regla #2: Satisface las siguientes historias de usuario. Usa cualquier librería o APIs que necesites.", "Historia de usuario: Puedo pulsar un botón que me mostrará una nueva frase aleatoria.", "Bonus User Story: Puedo presionar un botón para twitear una frase.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", "Cuando hayas terminado, pulsa el botón de \"I've completed this challenge\" e incluye un enlace a tu CodePen.", "Puedes obtener retroalimentación sobre tu proyecto por parte de otros campistas, compartiendolo en nuestra Sala de chat para revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ] @@ -48,7 +48,7 @@ "Пользовательская история: В качестве пользователя, я могу нажать на кнопку и получить случайную цитату.", "Бонусная пользовательская история: В качестве пользователя, я могу нажать на кнопку и опубликовать цитату в Twitter'e.", "Цитаты можно добавить в массив и случайным образом выводить одну из них, либо можно воспользоваться соответствующим API, например http://forismatic.com/en/api/.", - "Если что-то не получается, воспользуйтесь Read-Search-Ask.", + "Если что-то не получается, воспользуйтесь Read-Search-Ask.", "Когда выполните задание кликните кнопку \"I've completed this challenge\" и добавьте ссылку на ваш CodePen. Если вы программировали с кем-то в паре, также добавьте имя вашего напарника.", "Если вы хотите получить немедленную оценку вашего проекта, нажмите эту кнопку и добавьте ссылку на ваш CodePen. В противном случае мы проверим его перед тем как вы приступите к проектам для некоммерческих организаций.

Click here then add your link to your tweet's text" ] @@ -67,7 +67,7 @@ "User Story: I can push a button to toggle between Fahrenheit and Celsius.", "Note: Many internet browsers now require an HTTP Secure (https://) connection to obtain a user's locale via HTML5 Geolocation. For this reason, you will need to choose one of two paths to complete this project:

Use HTML5 Geolocation to get user location and then use the Dark Sky API which uses an HTTP Secure connection for the weather. Also, be sure to connect to CodePen.io via https://.

Or:

Use an Internet Protocol API to get user location (ex. IP-API) and then use the OpenWeatherMap API for the weather. Be sure to connect to CodePen.io via http://.", "Either weather API service will require creating a free API key. Normally you want to avoid exposing API keys on CodePen, but we haven't been able to find a keyless API for weather.", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen.", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -89,7 +89,7 @@ "Historia de usuario: Puedo ver un icono diferente o una imagen de fondo diferente (e.g. montaña con nieve, desierto caliente) dependiendo del clima.", "Historia de usuario: Puedo pulsar un botón para cambiar la unidad de temperatura de grados Fahrenheit a Celsius y viceversa.", "Recomendamos utilizar Open Weather API. Al utilizarlo tendrás que crear una llave API gratuita. Normalmente debes evitar exponer llaves de API en CodePen, pero por el momento no hemos encontrado un API de clima que no requiera llave.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", "Cuando hayas terminado, pulsa el botón de \"I've completed this challenge\" e incluye un enlace a tu CodePen.", "Puedes obtener retroalimentación sobre tu proyecto por parte de otros campistas, compartiendolo en nuestra Sala de chat para revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ] @@ -106,7 +106,7 @@ "Бонусная пользовательская история: В качестве пользователя, я могу в зависимости от погоды видеть различные температурные значки.", "Бонусная пользовательская история: В качестве пользователя, я могу в зависимости от погоды видеть различные фоновые изображения (снежные горы, знойная пустыня).", "Бонусная пользовательская история: В качестве пользователя, я могу нажать на кнопку чтобы переключится между градусами по Цельсию или по Фаренгейту.", - "Если что-то не получается, воспользуйтесь Read-Search-Ask.", + "Если что-то не получается, воспользуйтесь Read-Search-Ask.", "Когда выполните задание кликните кнопку \"I've completed this challenge\" и добавьте ссылку на ваш CodePen. Если вы программировали с кем-то в паре, также добавьте имя вашего напарника.", "Если вы хотите получить немедленную оценку вашего проекта, нажмите эту кнопку и добавьте ссылку на ваш CodePen. В противном случае мы проверим его перед тем как вы приступите к проектам для некоммерческих организаций.

Click here then add your link to your tweet's text" ] @@ -124,7 +124,7 @@ "Hint #1: Here's a URL you can use to get a random Wikipedia article: https://en.wikipedia.org/wiki/Special:Random.", "Hint #2: Here's an entry on using Wikipedia's API: https://www.mediawiki.org/wiki/API:Main_page.", "Hint #3: Use this link to experiment with Wikipedia's API.", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen.", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -150,7 +150,7 @@ "Pista 1: Aquí está una URL donde puedes ver una entrada aleatoria de Wikipedia: https://es.wikipedia.org/wiki/Special:Random<.", "Pista 2: Este es un artículo muy útil relativo al uso del API de Wikipedia: https://www.mediawiki.org/wiki/API:Main_page.", "Pista 3: Usa este enlace para experimentar con el API de Wikipedia.", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", "Cuando hayas terminado, pulsa el botón de \"I've completed this challenge\" e incluye un enlace a tu CodePen.", "Puedes obtener retroalimentación sobre tu proyecto por parte de otros campistas, compartiendolo en nuestra Sala de chat para revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ] @@ -167,11 +167,11 @@ "User Story: I can click the status output and be sent directly to the Free Code Camp's Twitch.tv channel.", "User Story: if a Twitch user is currently streaming, I can see additional details about what they are streaming.", "User Story: I will see a placeholder notification if a streamer has closed their Twitch account (or the account never existed). You can verify this works by adding brunofin and comster404 to your array of Twitch streamers.", - "Hint: See an example call to Twitch.tv's JSONP API at http://forum.freecodecamp.com/t/use-the-twitchtv-json-api/19541.", + "Hint: See an example call to Twitch.tv's JSONP API at http://forum.freecodecamp.org/t/use-the-twitchtv-json-api/19541.", "Hint: The relevant documentation about this API call is here: https://dev.twitch.tv/docs/v5/reference/streams/#get-stream-by-user.", "Hint: Here's an array of the Twitch.tv usernames of people who regularly stream: [\"ESL_SC2\", \"OgamingSC2\", \"cretetion\", \"freecodecamp\", \"storbeck\", \"habathcx\", \"RobotCaleb\", \"noobs2ninjas\"]", "UPDATE: Due to a change in conditions on API usage explained here Twitch.tv now requires an API key, but we've built a workaround. Use https://wind-bow.gomix.me/twitch-api instead of twitch's API base URL (i.e. https://api.twitch.tv/kraken ) and you'll still be able to get account information, without needing to sign up for an API key.", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen.", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -193,10 +193,10 @@ "Historia de usuario: Puedo pulsar el estatus y ser enviado directamente al canal de Free Code Camp en Twitch.tv.", "Historia de usuario: Si un usuario Twitch está transmitiendo actualmente, puedo ver detalles adicionales acerca del contenido que están transmitiendo.", "Historia de usuario: Puedo ver una notificación si el usuario ha cerrado su cuenta de Twitch (o si la cuenta nunca ha existido). Puedes verificar si esto funciona agregando brunofin y comster404 a tu vector de usuarios de Twitch.", - "Pista: Obseva una llamada de ejemplo al API JSONP de Twitch.tv en http://forum.freecodecamp.com/t/use-the-twitchtv-json-api/19541.", + "Pista: Obseva una llamada de ejemplo al API JSONP de Twitch.tv en http://forum.freecodecamp.org/t/use-the-twitchtv-json-api/19541.", "Pista: La documentación relevante sobre esta llamada al API está aquí: https://dev.twitch.tv/docs/v5/reference/streams/#get-stream-by-user.", "Pista: Aquí está un vector de usuarios en Twitch.tv que regularmente transmiten sobre programación: [\"ESL_SC2\", \"OgamingSC2\", \"cretetion\", \"freecodecamp\", \"storbeck\", \"habathcx\", \"RobotCaleb\", \"noobs2ninjas\"]", - "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", + "Recuerda utilizar Leer-Buscar-Preguntar si te sientes atascado.", "Cuando hayas terminado, pulsa el botón de \"I've completed this challenge\" e incluye un enlace a tu CodePen.", "Puedes obtener retroalimentación sobre tu proyecto por parte de otros campistas, compartiendolo en nuestra Sala de chat para revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ] @@ -217,7 +217,7 @@ "Подсказка: Пример запроса к Twitch.tv JSON API: https://api.twitch.tv/kraken/streams/freecodecamp.", "Подсказка: Документацию об этом запросе можно найти по ссылке: https://dev.twitch.tv/docs/v5/reference/streams/#get-stream-by-user.", "Подсказка: В этом массиве приведены имена пользователей, которые регулярно пишут код онлайн: [\"ESL_SC2\", \"OgamingSC2\", \"cretetion\", \"freecodecamp\", \"storbeck\", \"habathcx\", \"RobotCaleb\", \"noobs2ninjas\"]", - "Если что-то не получается, воспользуйтесь Read-Search-Ask.", + "Если что-то не получается, воспользуйтесь Read-Search-Ask.", "Когда выполните задание кликните кнопку \"I've completed this challenge\" и добавьте ссылку на ваш CodePen. Если вы программировали с кем-то в паре, также добавьте имя вашего напарника.", "Если вы хотите получить немедленную оценку вашего проекта, нажмите эту кнопку и добавьте ссылку на ваш CodePen. В противном случае мы проверим его перед тем как вы приступите к проектам для некоммерческих организаций.

Click here then add your link to your tweet's text" ] diff --git a/seed/challenges/02-data-visualization-certification/data-visualization-projects.json b/seed/challenges/02-data-visualization-certification/data-visualization-projects.json index 7e3fe974a6..e5b5d80cca 100644 --- a/seed/challenges/02-data-visualization-certification/data-visualization-projects.json +++ b/seed/challenges/02-data-visualization-certification/data-visualization-projects.json @@ -13,7 +13,7 @@ "User Story: I can see US Gross Domestic Product by quarter, over time.", "User Story: I can mouse over a bar and see a tooltip with the GDP amount and exact year and month that bar represents.", "Hint: Here's a dataset you can use to build this: https://raw.githubusercontent.com/FreeCodeCamp/ProjectReferenceData/master/GDP-data.json", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen. ", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -34,7 +34,7 @@ "Historia de usuario: Puedo ver el Producto Interno Bruto (PIB) de los EEUU por trimestre, a través del tiempo.", "Historia de usuario: Puedo ver una descripción emergente con el monto de PIB y el mes y año que representa cada barra al mover el ratón sobre ellas.", "Pista: Puedes utilizar el siguiente conjunto de datos para construir tu proyecto: https://raw.githubusercontent.com/FreeCodeCamp/ProjectReferenceData/master/GDP-data.json", - "Recuerda utilizar Read-Search-Ask si te sientes atascado.", + "Recuerda utilizar Read-Search-Ask si te sientes atascado.", "Cuando termines, haz clic en el botón de \"I've completed this challenge\" e incluye el vínculo de tu proyecto en CodePen. ", "Puedes obtener retroalimentación acerca de tu proyecto de parte de tus compañeros campistas compartiéndolo en nuestro Cuarto de revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ] @@ -48,7 +48,7 @@ "User Story: I can see performance time visualized in a scatterplot graph.", "User Story: I can mouse over a plot to see a tooltip with additional details.", "Hint: Here's a dataset you can use to build this: https://raw.githubusercontent.com/FreeCodeCamp/ProjectReferenceData/master/cyclist-data.json", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen. ", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -69,7 +69,7 @@ "Historia de usuario: Puedo ver el tiempo de recorrido en el diagrama de dispersión.", "Historia de usuario: Puedo ver una descripción emergente con información adicional al mover el ratón sobre el gráfico.", "Pista: Puedes utilizar el siguiente conjunto de datos para construir tu proyecto: https://raw.githubusercontent.com/FreeCodeCamp/ProjectReferenceData/master/cyclist-data.json", - "Recuerda utilizar Read-Search-Ask si te sientes atascado.", + "Recuerda utilizar Read-Search-Ask si te sientes atascado.", "Cuando termines, haz clic en el botón de \"I've completed this challenge\" e incluye el vínculo de tu proyecto en CodePen. ", "Puedes obtener retroalimentación acerca de tu proyecto de parte de tus compañeros campistas compartiéndolo en nuestro Cuarto de revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ] @@ -84,7 +84,7 @@ "User Story: Each cell is colored based its relationship to other data.", "User Story: I can mouse over a cell in the heat map to get more exact information.", "Hint: Here's a dataset you can use to build this: https://raw.githubusercontent.com/FreeCodeCamp/ProjectReferenceData/master/global-temperature.json", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen. ", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -106,7 +106,7 @@ "Historia de usuario: El color de cada celda debe estar basado en su relación con otros datos.", "Historia de usuario: Puedo mover el ratón sobre una celda en el mapa de calor para obtener información más detallada.", "Pista: Puedes utilizar el siguiente conjunto de datos para construir tu proyecto: https://raw.githubusercontent.com/FreeCodeCamp/ProjectReferenceData/master/global-temperature.json", - "Recuerda utilizar Read-Search-Ask si te sientes atascado.", + "Recuerda utilizar Read-Search-Ask si te sientes atascado.", "Cuando termines, haz clic en el botón de \"I've completed this challenge\" e incluye el vínculo de tu proyecto en CodePen. ", "Puedes obtener retroalimentación acerca de tu proyecto de parte de tus compañeros campistas compartiéndolo en nuestro Cuarto de revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ] @@ -121,7 +121,7 @@ "User Story: I can see each country's flag on its node.", "Hint: Here's a dataset you can use to build this: https://raw.githubusercontent.com/DealPete/forceDirected/master/countries.json", "Hint: You can create a spritesheet of national flags at https://www.flag-sprites.com.", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen. ", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -144,8 +144,8 @@ "Historia de usuario: Puedo ver la relación entre los campistas y los dominios que publican.", "Historia de usuario: Puedo conocer aproximadamente cuántas veces los campistas han enlazado un dominio en particular a partir del tamaño del nodo respectivo.", "Historia de usuario: Puedo conocer aproximadamente cuántas veces un campista específico ha publicado un enlace a partir del tamaño de su nodo.", - "Pista: La siguiente es la ruta del API de noticias de Camper News: http://www.freecodecamp.com/news/hot.", - "Recuerda utilizar Read-Search-Ask si te sientes atascado.", + "Pista: La siguiente es la ruta del API de noticias de Camper News: http://www.freecodecamp.org/news/hot.", + "Recuerda utilizar Read-Search-Ask si te sientes atascado.", "Cuando termines, haz clic en el botón de \"I've completed this challenge\" e incluye el vínculo de tu proyecto en CodePen. ", "Puedes obtener retroalimentación acerca de tu proyecto de parte de tus compañeros campistas compartiéndolo en nuestro Cuarto de revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ] @@ -160,7 +160,7 @@ "User Story: I can tell the relative size of the meteorite, just by looking at the way it's represented on the map.", "User Story: I can mouse over the meteorite's data point for additional data.", "Hint: Here's a dataset you can use to build this: https://raw.githubusercontent.com/FreeCodeCamp/ProjectReferenceData/master/meteorite-strike-data.json", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen. ", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -182,7 +182,7 @@ "Historia de usuario: Puedo distinguir el tamaño relativo de cada meteorito simplemente viendo la forma en que está representado en el mapa.", "Historia de usuario: Puedo mover el ratón sobre el dato de cada meteorito para obtener información adicional.", "Pista: Puedes utilizar el siguiente conjunto de datos para construir tu proyecto: https://raw.githubusercontent.com/FreeCodeCamp/ProjectReferenceData/master/meteorite-strike-data.json", - "Recuerda utilizar Read-Search-Ask si te sientes atascado.", + "Recuerda utilizar Read-Search-Ask si te sientes atascado.", "Cuando termines, haz clic en el botón de \"I've completed this challenge\" e incluye el vínculo de tu proyecto en CodePen. ", "Puedes obtener retroalimentación acerca de tu proyecto de parte de tus compañeros campistas compartiéndolo en nuestro Cuarto de revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ] diff --git a/seed/challenges/02-data-visualization-certification/react-projects.json b/seed/challenges/02-data-visualization-certification/react-projects.json index cddef0b574..ac8581d472 100644 --- a/seed/challenges/02-data-visualization-certification/react-projects.json +++ b/seed/challenges/02-data-visualization-certification/react-projects.json @@ -14,7 +14,7 @@ "User Story: I can see a preview of the output of my markdown that is updated as I type.", "Hint: You don't need to interpret Markdown yourself - you can import the Marked library for this: https://cdnjs.com/libraries/marked", "Note: If you want to use the React JSX syntax, you need to enable 'Babel' as a preprocessor", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen. ", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -36,7 +36,7 @@ "Пользовательская история: Я могу видеть предварительный просмотр вывода моей разметки по мере ввода текста.", "Подсказка: Вам не нужно интерпретировать разметку самостоятельно - вы можете импортировать библиотеку Marked для этого: https://cdnjs.com/libraries/marked", "Заметка: Если вы хотите использовать синтаксис React JSX, вам понадобится задействовать 'Babel' в качестве препроцессора.", - "Если что-то не получается, не забывайте пользоваться методом Читай-Ищи-Спрашивай.", + "Если что-то не получается, не забывайте пользоваться методом Читай-Ищи-Спрашивай.", "Когда закончите, нажмите кнопку \"I've completed this challenge\" и укажите ссылку на вашу работу на CodePen.", "Вы можете получить отзыв о вашем проекте от коллег, поделившись ссылкой на него в нашем чате для рассмотрения кода. Также вы можете поделиться ею через Twitter и на странице Free Code Camp вашего города на Facebook." ], @@ -50,7 +50,7 @@ "Historia de usuario: Puedo tener una vista preliminar del resultado de mi marcado que se actualiza mientras escribo.", "Pista: No necesitas interpretar el lenguaje de marcado por tu cuenta - puedes importar la librería de marcado en el enlace siguiente: https://cdnjs.com/libraries/marked", "Nota: Si quieres utilizar la sintaxis de React JSX, necesitarás habilitar 'Babel' como un preprocesador", - "Recuerda utilizar Read-Search-Ask si te sientes atascado.", + "Recuerda utilizar Read-Search-Ask si te sientes atascado.", "Cuando termines, haz clic en el botón de \"I've completed this challenge\" e incluye el vínculo de tu proyecto en CodePen. ", "Puedes obtener retroalimentación acerca de tu proyecto de parte de tus compañeros campistas compartiéndolo en nuestro Cuarto de revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ] @@ -66,7 +66,7 @@ "User Story: I can toggle between sorting the list by how many brownie points they've earned in the past 30 days and by how many brownie points they've earned total.", "Hint: To get the top 100 campers for the last 30 days: https://fcctop100.herokuapp.com/api/fccusers/top/recent.", "Hint: To get the top 100 campers of all time: https://fcctop100.herokuapp.com/api/fccusers/top/alltime.", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen. ", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -89,7 +89,7 @@ "Пользовательская история: Я могу отсортировать список по количеству очков, которые они получили за последние 30 дней, и по общему количеству полученных очков.", "Подсказка: Ссылка на топ 100 кемперов за последние 30 дней в формате JSON: https://fcctop100.herokuapp.com/api/fccusers/top/recent.", "Подсказка: Ссылка на топ 100 кемперов за все время в формате JSON: http://fcctop100.herokuapp.com/api/fccusers/top/alltime.", - "Если что-то не получается, не забывайте пользоваться методом Читай-Ищи-Спрашивай.", + "Если что-то не получается, не забывайте пользоваться методом Читай-Ищи-Спрашивай.", "Когда закончите, нажмите кнопку \"I've completed this challenge\" и укажите ссылку на вашу работу на CodePen.", "Вы можете получить отзыв о вашем проекте от коллег, поделившись ссылкой на него в нашем чате для рассмотрения кода. Также вы можете поделиться ею через Twitter и на странице Free Code Camp вашего города на Facebook." ], @@ -104,7 +104,7 @@ "Historia de usuario: Puedo elegir entre dos formas de organizar la lista: 1) En base a cuántos puntos de brownie se han ganado en los últimos 30 días. 2) En base al número de puntos de brownie que han ganado en total.", "Pista: Para obtener los 100 mejores campistas para los últimos 30 días: https://fcctop100.herokuapp.com/api/fccusers/top/recent.", "Pista: Para obtener los 100 mejores campistas de toda la historia: http://fcctop100.herokuapp.com/api/fccusers/top/alltime.", - "Recuerda utilizar Read-Search-Ask si te sientes atascado.", + "Recuerda utilizar Read-Search-Ask si te sientes atascado.", "Cuando termines, haz clic en el botón de \"I've completed this challenge\" e incluye el vínculo de tu proyecto en CodePen. ", "Puedes obtener retroalimentación acerca de tu proyecto de parte de tus compañeros campistas compartiéndolo en nuestro Cuarto de revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ] @@ -122,7 +122,7 @@ "User Story: I can delete these recipes.", "User Story: All new recipes I add are saved in my browser's local storage. If I refresh the page, these recipes will still be there.", "Hint: You should prefix your local storage keys on CodePen, i.e. _username_recipes", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen.", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -146,7 +146,7 @@ "Пользовательская история: Я могу отредактировать эти рецепты.", "Пользовательская история: Я могу удалить эти рецепты.", "Пользовательская история: Все новые рецепты, которые я добавил, сохранены в локальном хранилище моего браузера. Если я обновлю страницу, эти рецепты будут всё ещё там.", - "Если что-то не получается, не забывайте пользоваться методом Читай-Ищи-Спрашивай.", + "Если что-то не получается, не забывайте пользоваться методом Читай-Ищи-Спрашивай.", "Когда закончите, нажмите кнопку \"I've completed this challenge\" и укажите ссылку на вашу работу на CodePen.", "Вы можете получить отзыв о вашем проекте от коллег, поделившись ссылкой на него в нашем чате для рассмотрения кода. Также вы можете поделиться ею через Twitter и на странице Free Code Camp вашего города на Facebook." ], @@ -162,7 +162,7 @@ "Historia de usuario: Puedo editar las recetas.", "Historia de usuario: Puedo eliminar las recetas.", "Historia de usuario: Las recetas que voy agregando deben guardarse en el almacenamiento local de mi navegador. Las recetas deben seguir allí si refresco la página.", - "Recuerda utilizar Read-Search-Ask si te sientes atascado.", + "Recuerda utilizar Read-Search-Ask si te sientes atascado.", "Cuando termines, haz clic en el botón de \"I've completed this challenge\" e incluye el vínculo de tu proyecto en CodePen. ", "Puedes obtener retroalimentación acerca de tu proyecto de parte de tus compañeros campistas compartiéndolo en nuestro Cuarto de revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ] @@ -181,7 +181,7 @@ "User Story: Each time the board changes, I can see how many generations have gone by.", "Hint: Here's an explanation of Conway's Game of Life from John Conway himself: https://www.youtube.com/watch?v=E8kUJL04ELA", "Hint: Here's an overview of Conway's Game of Life with rules for your reference: https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen. ", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -207,7 +207,7 @@ "Пользовательская история: Каждый раз, когда доска меняется, я могу видеть сколько поколений прошло.", "Подсказка: Вот объяснение игры \"Жизнь\" от её создателя Джона Конвея: https://www.youtube.com/watch?v=E8kUJL04ELA", "Подсказка: Вот обзор правил игры \"Жизнь\" для вашего сведения: https://ru.wikipedia.org/wiki/Жизнь_(игра)", - "Если что-то не получается, не забывайте пользоваться методом Читай-Ищи-Спрашивай.", + "Если что-то не получается, не забывайте пользоваться методом Читай-Ищи-Спрашивай.", "Когда закончите, нажмите кнопку \"I've completed this challenge\" и укажите ссылку на вашу работу на CodePen.", "Вы можете получить отзыв о вашем проекте от коллег, поделившись ссылкой на него в нашем чате для рассмотрения кода. Также вы можете поделиться ею через Twitter и на странице Free Code Camp вашего города на Facebook." ], @@ -225,7 +225,7 @@ "Historia de usuario: Puedo ver cuántas generaciones han pasado cada vez que el tablero cambia.", "Pista: Puedes encontrar una explicación del Juego de la vida de Conway de parte del mismísimo John Conway aquí: https://www.youtube.com/watch?v=E8kUJL04ELA", "Pista: Puedes referirte al siguiente enlace para obtener información general acerca del Juego de la vida de Conway incluyendo las reglas del juego: https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life", - "Recuerda utilizar Read-Search-Ask si te sientes atascado.", + "Recuerda utilizar Read-Search-Ask si te sientes atascado.", "Cuando termines, haz clic en el botón de \"I've completed this challenge\" e incluye el vínculo de tu proyecto en CodePen. ", "Puedes obtener retroalimentación acerca de tu proyecto de parte de tus compañeros campistas compartiéndolo en nuestro Cuarto de revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ] @@ -245,7 +245,7 @@ "User Story: When I fight an enemy, we take turns damaging each other until one of us loses. I do damage based off of my level and my weapon. The enemy does damage based off of its level. Damage is somewhat random within a range.", "User Story: When I find and beat the boss, I win.", "User Story: The game should be challenging, but theoretically winnable.", - "Remember to use Read-Search-Ask if you get stuck.", + "Remember to use Read-Search-Ask if you get stuck.", "When you are finished, click the \"I've completed this challenge\" button and include a link to your CodePen. ", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -272,7 +272,7 @@ "Пользовательская история: Когда я веду бой с врагом, мы поочередно наносим друг-другу повреждения, до тех пор пока кто-нибудь не победит. Я наношу повреждения, которые зависят от моего уровня и моего оружия. Враг наносит повреждения, которые зависят от его уровня. Значение повреждений распределено случайным образом в некотором диапазоне.", "Пользовательская история: Когад я нахожу и побеждаю босса, я выигрываю игру.", "Пользовательская история: Игра должна быть интересной и достаточно сложной, но теоретически проходимой.", - "Если что-то не получается, не забывайте пользоваться методом Читай-Ищи-Спрашивай.", + "Если что-то не получается, не забывайте пользоваться методом Читай-Ищи-Спрашивай.", "Когда закончите, нажмите кнопку \"I've completed this challenge\" и укажите ссылку на вашу работу на CodePen.", "Вы можете получить отзыв о вашем проекте от коллег, поделившись ссылкой на него в нашем чате для рассмотрения кода. Также вы можете поделиться ею через Twitter и на странице Free Code Camp вашего города на Facebook." ], @@ -291,7 +291,7 @@ "Historia de usuario: Cuando peleo con un enemigo, tomamos turnos haciéndonos daño hasta que uno de los dos pierde. El daño que hago está basado en mi nivel de experiencia y en el arma que estoy utilizando. El enemigo hace daño basado en su nivel. El daño es aleatorio dentro de cierto márgen.", "Historia de usuario: Gano el juego cuando encuentre y venza al jefe.", "Historia de usuario: El juego debe representar un reto, pero ganar debe ser teóricamente posible.", - "Recuerda utilizar Read-Search-Ask si te sientes atascado.", + "Recuerda utilizar Read-Search-Ask si te sientes atascado.", "Cuando termines, haz clic en el botón de \"I've completed this challenge\" e incluye el vínculo de tu proyecto en CodePen. ", "Puedes obtener retroalimentación acerca de tu proyecto de parte de tus compañeros campistas compartiéndolo en nuestro Cuarto de revisión de código. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)." ] diff --git a/seed/challenges/03-back-end-development-certification/api-projects.json b/seed/challenges/03-back-end-development-certification/api-projects.json index de4ce5ecdc..8ea4bc89af 100644 --- a/seed/challenges/03-back-end-development-certification/api-projects.json +++ b/seed/challenges/03-back-end-development-certification/api-projects.json @@ -50,7 +50,7 @@ "title": "Timestamp Microservice", "description": [ "Objective: Build a full stack JavaScript app that is functionally similar to this: https://timestamp-ms.herokuapp.com/ and deploy it to Glitch.", - "Note that for each project, you should create a new GitHub repository and a new Glitch project. If you can't remember how to do this, revisit https://freecodecamp.com/challenges/get-set-for-our-api-development-projects.", + "Note that for each project, you should create a new GitHub repository and a new Glitch project. If you can't remember how to do this, revisit https://freecodecamp.org/challenges/get-set-for-our-api-development-projects.", "Here are the specific user stories you should implement for this project:", "User Story: I can pass a string as a parameter, and it will check to see whether that string contains either a unix timestamp or a natural language date (example: January 1, 2016).", "User Story: If it does, it returns both the Unix timestamp and the natural language form of that date.", @@ -69,7 +69,7 @@ "titleEs": "Microservicio de Marca Temporal", "descriptionEs": [ "Objetivo: Desarolla una aplicación de Pila Completa en JavaScript que sea funcionalmente similar a esta: https://timestamp-ms.herokuapp.com/ y despliegala en Glitch.", - "Ten en cuenta que para cada proyecto, deberías crear un nuevo repositorio en GitHub y un nuevo proyecto en Glitch. Si no recuerdas como hacer esto, vuelve a visitar https://freecodecamp.com//challenges/get-set-for-our-api-development-projects.", + "Ten en cuenta que para cada proyecto, deberías crear un nuevo repositorio en GitHub y un nuevo proyecto en Glitch. Si no recuerdas como hacer esto, vuelve a visitar https://freecodecamp.org//challenges/get-set-for-our-api-development-projects.", "Aquí están las historias de usuario específicas que debes implementar para este proyecto:", "Historia de Usuario: Puedo pasar una cadena como parámetro y comprobará si contiene o no una marca de tiempo para Unix o una fecha en lenguaje natural en inglés (Ejemplo: January 1, 2016).", "Historia de Usuario: Si tiene una marca de tiempo para Unix, devuelve tanto la marca de tiempo de Unix como la fecha en lenguaje natural.", @@ -83,7 +83,7 @@ "title": "Request Header Parser Microservice", "description": [ "Objective: Build a full stack JavaScript app that is functionally similar to this: https://cryptic-ridge-9197.herokuapp.com/api/whoami/ and deploy it to Glitch.", - "Note that for each project, you should create a new GitHub repository and a new Glitch project. If you can't remember how to do this, revisit https://freecodecamp.com/challenges/get-set-for-our-api-development-projects.", + "Note that for each project, you should create a new GitHub repository and a new Glitch project. If you can't remember how to do this, revisit https://freecodecamp.org/challenges/get-set-for-our-api-development-projects.", "Here's the specific user story you should implement for this project:", "User Story: I can get the IP address, language and operating system for my browser.", "Once you've finished implementing these user stories, click the \"I've completed this challenge\" button and enter the URLs for both your GitHub repository and your live app running on Glitch.", @@ -100,7 +100,7 @@ "titleEs": "Microservicio para analizar el encabezado de una petición", "descriptionEs": [ "Objetivo: Desarrolla una aplicación de Pila Completa en JavaScript que sea funcionalmente similar a esta: https://cryptic-ridge-9197.herokuapp.com/api/whoami/ y despliegala en Glitch.", - "Ten en cuenta que para cada proyecto, deberías crear un nuevo repositorio en GitHub y un nuevo proyecto en Glitch. Si no recuerdas como hacer esto, vuelve a visitar https://freecodecamp.com//challenges/get-set-for-our-api-development-projects.", + "Ten en cuenta que para cada proyecto, deberías crear un nuevo repositorio en GitHub y un nuevo proyecto en Glitch. Si no recuerdas como hacer esto, vuelve a visitar https://freecodecamp.org//challenges/get-set-for-our-api-development-projects.", "Aquí están las historias de usuario específicas que debes implementar para este proyecto:", "Historia de Usuario: Puedo obtener la dirección IP, idioma y sistema operativo de mi navegador.", "Una vez que hayas terminado de implementar estas historias de usuarios, pulsa el botón \"I've completed this challenge\" e introduce los URLs de tu repositorio en GitHub y de tu aplicación en vivo en Glitch.", @@ -112,12 +112,12 @@ "title": "URL Shortener Microservice", "description": [ "Objective: Build a full stack JavaScript app that is functionally similar to this: https://little-url.herokuapp.com/ and deploy it to Glitch.", - "Note that for each project, you should create a new GitHub repository and a new Glitch project. If you can't remember how to do this, revisit https://freecodecamp.com/challenges/get-set-for-our-api-development-projects.", + "Note that for each project, you should create a new GitHub repository and a new Glitch project. If you can't remember how to do this, revisit https://freecodecamp.org/challenges/get-set-for-our-api-development-projects.", "Here are the specific user stories you should implement for this project:", "User Story: I can pass a URL as a parameter and I will receive a shortened URL in the JSON response.", "User Story: If I pass an invalid URL that doesn't follow the valid http://www.example.com format, the JSON response will contain an error instead.", "User Story: When I visit that shortened URL, it will redirect me to my original link.", - "Pro Tip: Checkout this wiki article for tips on integrating MongoDB on Glitch.", + "Pro Tip: Checkout this wiki article for tips on integrating MongoDB on Glitch.", "Once you've finished implementing these user stories, click the \"I've completed this challenge\" button and enter the URLs for both your GitHub repository and your live app running on Glitch.", "You can get feedback on your project by sharing it with your friends on Facebook." ], @@ -132,7 +132,7 @@ "titleEs": "Microservicio para acortar URLs", "descriptionEs": [ "Objetivo: Desarrolla una aplicación de Pila Completa en JavaScript que sea funcionalmente similar a esta: https://little-url.herokuapp.com/ y despliegala en Glitch.", - "Ten en cuenta que para cada proyecto, deberías crear un nuevo repositorio en GitHub y un nuevo proyecto en Glitch. Si no recuerdas como hacer esto, vuelve a visitar https://freecodecamp.com//challenges/get-set-for-our-api-development-projects.", + "Ten en cuenta que para cada proyecto, deberías crear un nuevo repositorio en GitHub y un nuevo proyecto en Glitch. Si no recuerdas como hacer esto, vuelve a visitar https://freecodecamp.org//challenges/get-set-for-our-api-development-projects.", "Aquí están las historias de usuario específicas que debes implementar para este proyecto:", "Historia de Usuario: Puedo pasar una URL como parámetro y recibiré una URL acortada en la respuesta JSON.", "Historia de Usuario: Si paso una URL inválido que no siga el formato válido http://www.exmaple.com, en cambio la respuesta JSON contendrá un mensaje de error.", @@ -146,7 +146,7 @@ "title": "Image Search Abstraction Layer", "description": [ "Objective: Build a full stack JavaScript app that allows you to search for images like this: https://cryptic-ridge-9197.herokuapp.com/api/imagesearch/lolcats%20funny?offset=10 and browse recent search queries like this: https://cryptic-ridge-9197.herokuapp.com/api/latest/imagesearch/. Then deploy it to Glitch.", - "Note that for each project, you should create a new GitHub repository and a new Glitch project. If you can't remember how to do this, revisit https://freecodecamp.com/challenges/get-set-for-our-api-development-projects.", + "Note that for each project, you should create a new GitHub repository and a new Glitch project. If you can't remember how to do this, revisit https://freecodecamp.org/challenges/get-set-for-our-api-development-projects.", "Here are the specific user stories you should implement for this project:", "User Story: I can get the image URLs, alt text and page urls for a set of images relating to a given search string.", "User Story: I can paginate through the responses by adding a ?offset=2 parameter to the URL.", @@ -165,7 +165,7 @@ "titleEs": "Capa de abstracción para buscar imágenes", "descriptionEs": [ "Objetivo: Desarolla una aplicación de Pila Completa en JavaScript que te permite buscar imágenes como esta: https://cryptic-ridge-9197.herokuapp.com/api/imagesearch/lolcats%20funny?offset=10 y examinar las búsquedas recientes como esta: https://cryptic-ridge-9197.herokuapp.com/api/latest/imagesearch/. Después, despliegala en Glitch.", - "Ten en cuenta que para cada proyecto, deberías crear un nuevo repositorio en GitHub y un nuevo proyecto en Glitch. Si no recuerdas como hacer esto, vuelve a visitar https://freecodecamp.com//challenges/get-set-for-our-api-development-projects.", + "Ten en cuenta que para cada proyecto, deberías crear un nuevo repositorio en GitHub y un nuevo proyecto en Glitch. Si no recuerdas como hacer esto, vuelve a visitar https://freecodecamp.org//challenges/get-set-for-our-api-development-projects.", "Aquí están las historias de usuario específicas que debes implementar para este proyecto:", "Historia de Usuario: Puedo obtener la URL de una imagen, texto alternativo y URLs de las páginas de un conjunto de imágenes que se relacionen con una cadena de texto dada.", "Historia de Usuario: Puedo examinar página a página las respuestas añadiendo un parámetro del estilo ?offset=2 al URL.", @@ -179,7 +179,7 @@ "title": "File Metadata Microservice", "description": [ "Objective: Build a full stack JavaScript app that is functionally similar to this: https://aryanj-file-size.herokuapp.com/ and deploy it to Glitch.", - "Note that for each project, you should create a new GitHub repository and a new Glitch project. If you can't remember how to do this, revisit https://freecodecamp.com/challenges/get-set-for-our-api-development-projects.", + "Note that for each project, you should create a new GitHub repository and a new Glitch project. If you can't remember how to do this, revisit https://freecodecamp.org/challenges/get-set-for-our-api-development-projects.", "Here are the specific user stories you should implement for this project:", "User Story: I can submit a FormData object that includes a file upload.", "User Story: When I submit something, I will receive the file size in bytes within the JSON response", @@ -198,7 +198,7 @@ "titleEs": "Microservicio de metadatos de archivos", "descriptionEs": [ "Objetivo: Desarrolla una aplicación de Pila Completa en JavaScript que sea funcionalmente similar a esta: https://cryptic-ridge-9197.herokuapp.com/ y despliegala en Glitch.", - "Ten en cuenta que para cada proyecto, deberías crear un nuevo repositorio en GitHub y un nuevo proyecto en Glitch. Si no recuerdas como hacer esto, vuelve a visitar https://freecodecamp.com//challenges/get-set-for-our-api-development-projects.", + "Ten en cuenta que para cada proyecto, deberías crear un nuevo repositorio en GitHub y un nuevo proyecto en Glitch. Si no recuerdas como hacer esto, vuelve a visitar https://freecodecamp.org//challenges/get-set-for-our-api-development-projects.", "Aquí están las historias de usuario específicas que debes implementar para este proyecto:", "Historia de Usuario: Puedo enviar un objeto FormData que incluya una subida de un archivo.", "Historia de Usuario: Cuando envío algo, recibiré el tamao del archivo en bytes en la respuesta JSON.", diff --git a/seed/challenges/03-back-end-development-certification/dynamic-web-applications.json b/seed/challenges/03-back-end-development-certification/dynamic-web-applications.json index ba98bf90c1..adfc34a7f8 100644 --- a/seed/challenges/03-back-end-development-certification/dynamic-web-applications.json +++ b/seed/challenges/03-back-end-development-certification/dynamic-web-applications.json @@ -191,7 +191,7 @@ "title": "Build a Voting App", "description": [ "Objective: Build a full stack JavaScript app that is functionally similar to this: https://fcc-voting-arthow4n.herokuapp.com/ and deploy it to Heroku.", - "Note that for each project, you should create a new GitHub repository and a new Heroku project. If you can't remember how to do this, revisit https://freecodecamp.com/challenges/get-set-for-our-dynamic-web-application-projects.", + "Note that for each project, you should create a new GitHub repository and a new Heroku project. If you can't remember how to do this, revisit https://freecodecamp.org/challenges/get-set-for-our-dynamic-web-application-projects.", "Here are the specific user stories you should implement for this project:", "User Story: As an authenticated user, I can keep my polls and come back later to access them.", "User Story: As an authenticated user, I can share my polls with my friends.", @@ -212,7 +212,7 @@ "challengeType": 4, "descriptionEs": [ "Objetivo: Construye una aplicación de pila completa (full stack) en JavaScript que funcione de forma similar al siguiente proyecto: https://fcc-voting-arthow4n.herokuapp.com/ y despliégala en Heroku.", - "Ten en cuenta que para cada proyecto, debes crear un nuevo repositorio en GitHub y un nuevo proyecto en Heroku. Si no recuerdas cómo hacerlo, visita de nuevo https://freecodecamp.com/challenges/get-set-for-our-dynamic-web-application-projects.", + "Ten en cuenta que para cada proyecto, debes crear un nuevo repositorio en GitHub y un nuevo proyecto en Heroku. Si no recuerdas cómo hacerlo, visita de nuevo https://freecodecamp.org/challenges/get-set-for-our-dynamic-web-application-projects.", "Estas son las Historias de usuario que debes satisfacer para este proyecto:", "Historia de usuario: Como un usuario autenticado, puedo guardar mis votaciones y acceder a ellas posteriormente.", "Historia de usuario: Como un usuario autenticado, puedo compartir mis votaciones con mis amigos.", @@ -233,7 +233,7 @@ "title": "Build a Nightlife Coordination App", "description": [ "Objective: Build a full stack JavaScript app that is functionally similar to this: http://whatsgoinontonight.herokuapp.com/ and deploy it to Heroku.", - "Note that for each project, you should create a new GitHub repository and a new Heroku project. If you can't remember how to do this, revisit https://freecodecamp.com/challenges/get-set-for-our-dynamic-web-application-projects.", + "Note that for each project, you should create a new GitHub repository and a new Heroku project. If you can't remember how to do this, revisit https://freecodecamp.org/challenges/get-set-for-our-dynamic-web-application-projects.", "Here are the specific user stories you should implement for this project:", "User Story: As an unauthenticated user, I can view all bars in my area.", "User Story: As an authenticated user, I can add myself to a bar to indicate I am going there tonight.", @@ -251,7 +251,7 @@ "challengeType": 4, "descriptionEs": [ "Objetivo: Construye una aplicación de pila completa (full stack) en JavaScript que funcione de forma similar al siguiente proyecto: http://whatsgoinontonight.herokuapp.com/ y despliégala en Heroku.", - "Ten en cuenta que para cada proyecto, debes crear un nuevo repositorio en GitHub y un nuevo proyecto en Heroku. Si no recuerdas cómo hacerlo, visita de nuevo https://freecodecamp.com/challenges/get-set-for-our-dynamic-web-application-projects.", + "Ten en cuenta que para cada proyecto, debes crear un nuevo repositorio en GitHub y un nuevo proyecto en Heroku. Si no recuerdas cómo hacerlo, visita de nuevo https://freecodecamp.org/challenges/get-set-for-our-dynamic-web-application-projects.", "Estas son las Historias de usuario que debes satisfacer para este Basejump:", "Historia de usuario: Como un usuario no autenticado, puedo ver todos los bares en mi área.", "Historia de usuario: Como un usuario autenticado, puedo agregarme a mí mismo a un bar para indicar que voy a estar allí esta noche.", @@ -269,7 +269,7 @@ "title": "Chart the Stock Market", "description": [ "Objective: Build a full stack JavaScript app that is functionally similar to this: http://watchstocks.herokuapp.com/ and deploy it to Heroku.", - "Note that for each project, you should create a new GitHub repository and a new Heroku project. If you can't remember how to do this, revisit https://freecodecamp.com/challenges/get-set-for-our-dynamic-web-application-projects.", + "Note that for each project, you should create a new GitHub repository and a new Heroku project. If you can't remember how to do this, revisit https://freecodecamp.org/challenges/get-set-for-our-dynamic-web-application-projects.", "Here are the specific user stories you should implement for this project:", "User Story: I can view a graph displaying the recent trend lines for each added stock.", "User Story: I can add new stocks by their symbol name.", @@ -286,7 +286,7 @@ "challengeType": 4, "descriptionEs": [ "Objetivo: Construye una aplicación de pila completa (full stack) en JavaScript que funcione de forma similar al siguiente proyecto: http://watchstocks.herokuapp.com/ y despliégalo en Heroku.", - "Ten en cuenta que para cada proyecto, debes crear un nuevo repositorio en GitHub y un nuevo proyecto en Heroku. Si no recuerdas cómo hacerlo, visita de nuevo https://freecodecamp.com/challenges/get-set-for-our-dynamic-web-application-projects.", + "Ten en cuenta que para cada proyecto, debes crear un nuevo repositorio en GitHub y un nuevo proyecto en Heroku. Si no recuerdas cómo hacerlo, visita de nuevo https://freecodecamp.org/challenges/get-set-for-our-dynamic-web-application-projects.", "Estas son las Historias de usuario que debes satisfacer para este Basejump:", "Historia de usuario: Como usuario, puedo ver un gráfico que me muestre las líneas de tendencia recientes para cada acción agregada.", "Historia de usuario: Como usuario, puedo agregar nuevas acciones por su símbolo.", @@ -303,7 +303,7 @@ "title": "Manage a Book Trading Club", "description": [ "Objective: Build a full stack JavaScript app that is functionally similar to this: http://bookjump.herokuapp.com/ and deploy it to Heroku.", - "Note that for each project, you should create a new GitHub repository and a new Heroku project. If you can't remember how to do this, revisit https://freecodecamp.com/challenges/get-set-for-our-dynamic-web-application-projects.", + "Note that for each project, you should create a new GitHub repository and a new Heroku project. If you can't remember how to do this, revisit https://freecodecamp.org/challenges/get-set-for-our-dynamic-web-application-projects.", "Here are the specific user stories you should implement for this project:", "User Story: I can view all books posted by every user.", "User Story: I can add a new book.", @@ -320,7 +320,7 @@ "challengeType": 4, "descriptionEs": [ "Objetivo: Construye una aplicación de pila completa (full stack) en JavaScript que funcione de forma similar al siguiente proyecto: http://bookjump.herokuapp.com/ y despliégalo en Heroku.", - "Ten en cuenta que para cada proyecto, debes crear un nuevo repositorio en GitHub y un nuevo proyecto en Heroku. Si no recuerdas cómo hacerlo, visita de nuevo https://freecodecamp.com/challenges/get-set-for-our-dynamic-web-application-projects.", + "Ten en cuenta que para cada proyecto, debes crear un nuevo repositorio en GitHub y un nuevo proyecto en Heroku. Si no recuerdas cómo hacerlo, visita de nuevo https://freecodecamp.org/challenges/get-set-for-our-dynamic-web-application-projects.", "Estas son las Historias de usuario que debes satisfacer para este Basejump:", "Historia de usuario: Puedo ver todos los libros agregados por cada usuario.", "Historia de usuario: Puedo agregar un nuevo libro.", @@ -337,7 +337,7 @@ "title": "Build a Pinterest Clone", "description": [ "Objective: Build a full stack JavaScript app that is functionally similar to this: https://midnight-dust.hyperdev.space and deploy it to Heroku.", - "Note that for each project, you should create a new GitHub repository and a new Heroku project. If you can't remember how to do this, revisit https://freecodecamp.com/challenges/get-set-for-our-dynamic-web-application-projects.", + "Note that for each project, you should create a new GitHub repository and a new Heroku project. If you can't remember how to do this, revisit https://freecodecamp.org/challenges/get-set-for-our-dynamic-web-application-projects.", "Here are the specific user stories you should implement for this project:", "User Story: As an unauthenticated user, I can login with Twitter.", "User Story: As an authenticated user, I can link to images.", @@ -357,7 +357,7 @@ "challengeType": 4, "descriptionEs": [ "Objetivo: Construye una aplicación de pila completa (full stack) en JavaScript que funcione de forma similar al siguiente proyecto: https://midnight-dust.hyperdev.space/ y despliégalo en Heroku.", - "Ten en cuenta que para cada proyecto, debes crear un nuevo repositorio en GitHub y un nuevo proyecto en Heroku. Si no recuerdas cómo hacerlo, visita de nuevo https://freecodecamp.com/challenges/get-set-for-our-dynamic-web-application-projects.", + "Ten en cuenta que para cada proyecto, debes crear un nuevo repositorio en GitHub y un nuevo proyecto en Heroku. Si no recuerdas cómo hacerlo, visita de nuevo https://freecodecamp.org/challenges/get-set-for-our-dynamic-web-application-projects.", "Estas son las Historias de usuario que debes satisfacer para este Basejump:", "Historia de usuario: Como usuario autenticado, puedo acceder a mi cuenta con Twitter.", "Historia de usuario: Como usuario autenticado, puedo agregar enlaces a imágenes.", diff --git a/server/boot/a-extendUser.js b/server/boot/a-extendUser.js index 9576e7b712..d00f47c3a3 100644 --- a/server/boot/a-extendUser.js +++ b/server/boot/a-extendUser.js @@ -70,10 +70,10 @@ module.exports = function(app) { var mailOptions = { type: 'email', to: user.email, - from: 'Team@freecodecamp.com', - subject: 'Welcome to Free Code Camp!', + from: 'team@freecodecamp.org', + subject: 'Welcome to freeCodeCamp!', protocol: isDev ? null : 'https', - host: isDev ? 'localhost' : 'freecodecamp.com', + host: isDev ? 'localhost' : 'freecodecamp.org', port: isDev ? null : 443, template: path.join( __dirname, diff --git a/server/boot/sitemap.js b/server/boot/sitemap.js index fc001a8b2d..0428e74d9e 100644 --- a/server/boot/sitemap.js +++ b/server/boot/sitemap.js @@ -4,7 +4,7 @@ import { timeCache, observeQuery } from '../utils/rx'; import { dasherize } from '../utils'; const cacheTimeout = [ 24, 'hours' ]; -const appUrl = 'https://www.freecodecamp.com'; +const appUrl = 'https://www.freecodecamp.org'; // getCachedObservable( // app: ExpressApp, diff --git a/server/boot/t-wiki.js b/server/boot/t-wiki.js index af8f3020c3..23e972abc0 100644 --- a/server/boot/t-wiki.js +++ b/server/boot/t-wiki.js @@ -6,7 +6,7 @@ module.exports = function(app) { function showForum(req, res) { res.redirect( - 'http://forum.freecodecamp.com/' + 'http://forum.freecodecamp.org/' ); } }; diff --git a/server/boot/user.js b/server/boot/user.js index 913c42949d..0f2bb8f7c8 100644 --- a/server/boot/user.js +++ b/server/boot/user.js @@ -344,7 +344,7 @@ module.exports = function(app) { msg: dedent` Upon review, this account has been flagged for academic dishonesty. If you’re the owner of this account contact - team@freecodecamp.com for details. + team@freecodecamp.org for details. ` }); } diff --git a/server/middlewares/flash-cheaters.js b/server/middlewares/flash-cheaters.js index 7e882f1e6b..46c9fa3364 100644 --- a/server/middlewares/flash-cheaters.js +++ b/server/middlewares/flash-cheaters.js @@ -20,7 +20,7 @@ export default function flashCheaters() { msg: dedent` Upon review, this account has been flagged for academic dishonesty. If you’re the owner of this account contact - team@freecodecamp.com for details. + team@freecodecamp.org for details. ` }); } diff --git a/server/views/account/settings.jade b/server/views/account/settings.jade index 293281fb25..e08479b76b 100644 --- a/server/views/account/settings.jade +++ b/server/views/account/settings.jade @@ -6,7 +6,7 @@ block content .row .col-xs-12 if (!user.isGithubCool) - a.btn.btn-lg.btn-block.btn-github.btn-link-social(href='https://forum.freecodecamp.com/t/how-to-create-a-github-account-and-link-it-with-your-freecodecamp-account/132154' target='_blank') + a.btn.btn-lg.btn-block.btn-github.btn-link-social(href='https://forum.freecodecamp.org/t/how-to-create-a-github-account-and-link-it-with-your-freecodecamp-account/132154' target='_blank') i.fa.fa-github | Link my GitHub to enable my public profile else @@ -21,11 +21,11 @@ block content a.btn.btn-lg.btn-block.btn-linkedin.btn-link-social(href='/link/linkedin') i.fa.fa-linkedin | Add my LinkedIn to my profile - a.btn.btn-lg.btn-block.btn-primary.btn-link-social(href='https://forum.freecodecamp.com/t/how-to-add-freecodecamp-to-your-linkedin-profile/132159' target='_blank') + a.btn.btn-lg.btn-block.btn-primary.btn-link-social(href='https://forum.freecodecamp.org/t/how-to-add-freecodecamp-to-your-linkedin-profile/132159' target='_blank') | Read thousands of coding articles - a.btn.btn-lg.btn-block.btn-primary.btn-link-social(href='https://forum.freecodecamp.com/t/how-to-add-freecodecamp-to-your-linkedin-profile/132159' target='_blank') + a.btn.btn-lg.btn-block.btn-primary.btn-link-social(href='https://forum.freecodecamp.org/t/how-to-add-freecodecamp-to-your-linkedin-profile/132159' target='_blank') | Add freeCodeCamp to my LinkedIn - a.btn.btn-lg.btn-block.btn-primary.btn-link-social(href='https://forum.freecodecamp.com/t/how-to-join-freecodecamps-chat-rooms-on-gitter/132177' target='_blank') + a.btn.btn-lg.btn-block.btn-primary.btn-link-social(href='https://forum.freecodecamp.org/t/how-to-join-freecodecamps-chat-rooms-on-gitter/132177' target='_blank') | Chat with other campers in real time .spacer @@ -131,7 +131,7 @@ block content p This will really delete all your data, including all your progress and brownie points. p We won't be able to recover any of it for you later, even if you change your mind. p If there's something we could do better, send us an email instead and we'll do our best:   - a(href="mailto:team@freecodecamp.com") team@freecodecamp.com + a(href="mailto:team@freecodecamp.org") team@freecodecamp.org | . .modal-footer a.btn.btn-success.btn-block(href='#', data-dismiss='modal', aria-hidden='true') diff --git a/server/views/account/show.jade b/server/views/account/show.jade index 9b8232d0d8..216daf90a8 100644 --- a/server/views/account/show.jade +++ b/server/views/account/show.jade @@ -17,8 +17,8 @@ block content a.btn.btn-lg.btn-block.btn-primary.btn-link-social(href='/signout') | Sign me out of freeCodeCamp .col-xs-12 - a.btn.btn-lg.btn-block.btn-primary.btn-link-social(href='mailto:team@freecodecamp.com') - | Email us at team@freecodecamp.com + a.btn.btn-lg.btn-block.btn-primary.btn-link-social(href='mailto:team@freecodecamp.org') + | Email us at team@freecodecamp.org .spacer h1.text-center #{username} hr @@ -43,7 +43,7 @@ block content .spacer h4 | This camper has committed to giving $#{pledge.amount} to - a(href='#{pledge.donateUrl}?ref=freecodecamp.com' target='_blank') #{pledge.displayName} + a(href='#{pledge.donateUrl}?ref=freecodecamp.org' target='_blank') #{pledge.displayName} | each month until they have completed their #{pledge.goal}. .spacer .row diff --git a/server/views/certificate/back-end.jade b/server/views/certificate/back-end.jade index 2b45d7a9d0..678b0fa72f 100644 --- a/server/views/certificate/back-end.jade +++ b/server/views/certificate/back-end.jade @@ -2,5 +2,5 @@ include font #name.cert-name= name img#cert.img-abs(src='//i.imgur.com/yBKoMVP.jpg') .cert-date= date -.cert-link verify this certification at: http://freecodecamp.com/#{username}/back-end-certification +.cert-link verify this certification at: https://www.freecodecamp.org/#{username}/back-end-certification include script diff --git a/server/views/certificate/data-vis.jade b/server/views/certificate/data-vis.jade index 68ab41883e..22824f8a31 100644 --- a/server/views/certificate/data-vis.jade +++ b/server/views/certificate/data-vis.jade @@ -2,5 +2,5 @@ include font #name.cert-name= name img#cert.img-abs(src='//i.imgur.com/l7tIptn.jpg') .cert-date= date -.cert-link verify this certification at: http://freecodecamp.com/#{username}/data-visualization-certification +.cert-link verify this certification at: https://www.freecodecamp.org/#{username}/data-visualization-certification include script diff --git a/server/views/certificate/front-end.jade b/server/views/certificate/front-end.jade index 436d88b126..0ce044fab1 100644 --- a/server/views/certificate/front-end.jade +++ b/server/views/certificate/front-end.jade @@ -2,5 +2,5 @@ include font #name.cert-name= name img#cert.img-abs(src='//i.imgur.com/ToFZKBd.jpg') .cert-date= date -.cert-link verify this certification at: http://freecodecamp.com/#{username}/front-end-certification +.cert-link verify this certification at: https://www.freecodecamp.org/#{username}/front-end-certification include script diff --git a/server/views/certificate/full-stack.jade b/server/views/certificate/full-stack.jade index 33fed4a85d..cd9064a2b6 100644 --- a/server/views/certificate/full-stack.jade +++ b/server/views/certificate/full-stack.jade @@ -2,5 +2,5 @@ include font #name.cert-name= name img#cert.img-abs(src='//i.imgur.com/Z4PgjBQ.jpg') .cert-date= date -.cert-link verify this certification at: http://freecodecamp.com/#{username}/full-stack-certification +.cert-link verify this certification at: https://www.freecodecamp.org/#{username}/full-stack-certification include script diff --git a/server/views/challenges/showBonfire.jade b/server/views/challenges/showBonfire.jade index 2e3579f953..65d6bf6f9c 100644 --- a/server/views/challenges/showBonfire.jade +++ b/server/views/challenges/showBonfire.jade @@ -35,7 +35,7 @@ block content .button-spacer button.btn-big.btn.btn-primary.btn-block#trigger-reset-modal Reset your code .button-spacer - a.btn-big.btn.btn-primary.btn-block(href="https://forum.freecodecamp.com/t/freecodecamp-algorithm-challenge-guide-" + dashedName target="_blank") Get a hint + a.btn-big.btn.btn-primary.btn-block(href="https://forum.freecodecamp.org/t/freecodecamp-algorithm-challenge-guide-" + dashedName target="_blank") Get a hint if (!user) .button-spacer a.btn.signup-btn.btn-block.btn-block(href='/login') Sign in so you can save your progress diff --git a/server/views/challenges/showHTML.jade b/server/views/challenges/showHTML.jade index fdd600915b..f283f25f8d 100644 --- a/server/views/challenges/showHTML.jade +++ b/server/views/challenges/showHTML.jade @@ -29,7 +29,7 @@ block content .button-spacer button.btn-big.btn.btn-primary.btn-block#trigger-reset-modal Reset your code .button-spacer - a.btn-big.btn.btn-primary.btn-block(href="https://forum.freecodecamp.com/t/freecodecamp-challenge-guide-" + dashedName target="_blank") Get a hint + a.btn-big.btn.btn-primary.btn-block(href="https://forum.freecodecamp.org/t/freecodecamp-challenge-guide-" + dashedName target="_blank") Get a hint script. var userLoggedIn = true; if (!user) diff --git a/server/views/challenges/showJS.jade b/server/views/challenges/showJS.jade index 57ef048d64..df121dad19 100644 --- a/server/views/challenges/showJS.jade +++ b/server/views/challenges/showJS.jade @@ -40,7 +40,7 @@ block content .button-spacer button.btn-big.btn.btn-primary.btn-block#trigger-reset-modal Reset your code .button-spacer - a.btn-big.btn.btn-primary.btn-block(href="https://forum.freecodecamp.com/t/freecodecamp-challenge-guide-" + dashedName target="_blank") Get a hint + a.btn-big.btn.btn-primary.btn-block(href="https://forum.freecodecamp.org/t/freecodecamp-challenge-guide-" + dashedName target="_blank") Get a hint if (!user) .button-spacer a.btn.signup-btn.btn-block.btn-block(href='/signin') Sign in so you can save your progress diff --git a/server/views/emails/a-new-user.ejs b/server/views/emails/a-new-user.ejs index b4be2e4c27..98abab37d8 100644 --- a/server/views/emails/a-new-user.ejs +++ b/server/views/emails/a-new-user.ejs @@ -4,4 +4,4 @@ Completed front end cert on <%= frontEndDate %>. Completed data vis cert on <%= dataVisDate %>. Completed back end cert on <%= backEndDate %>. -https://www.freecodecamp.com/<%= username %> +https://www.freecodecamp.org/<%= username %> diff --git a/server/views/partials/meta.jade b/server/views/partials/meta.jade index 121f6333c7..c0ae0c04b2 100644 --- a/server/views/partials/meta.jade +++ b/server/views/partials/meta.jade @@ -3,7 +3,7 @@ meta(http-equiv='X-UA-Compatible', content='IE=edge') meta(name='viewport', content='width=device-width, initial-scale=1.0') meta(name='csrf-token', content=_csrf) title #{title} | freeCodeCamp -link(rel='canonical', href='http://freecodecamp.com') +link(rel='canonical', href='http://freecodecamp.org') meta(charset='utf-8') meta(http-equiv='X-UA-Compatible', content='IE=edge') meta(name='viewport', content='width=device-width, initial-scale=1.0') @@ -13,7 +13,7 @@ meta(property="og:title", content="Learn to code and help nonprofits") meta(property="og:site_name", content="freeCodeCamp") meta(name='twitter:widgets:csp', content='on') meta(name='p:domain_verify', content='d0bc047a482c03c24f1168004c2a216a') -meta(property="og:url", content="http://www.freecodecamp.com") +meta(property="og:url", content="http://www.freecodecamp.org") meta(property="og:description", content="Learn to code and build projects for nonprofits. Build your full stack web development portfolio today.") meta(property="og:image", content="https://s3.amazonaws.com/freecodecamp/curriculum-diagram-full.jpg") meta(property="og:type", content="article") @@ -23,7 +23,7 @@ link(rel="publisher", href="https://plus.google.com/+Freecodecamp") link(rel="author", href="https://plus.google.com/+Freecodecamp") meta(name="description", content="Learn to code and build projects for nonprofits. Build your full stack web development portfolio today.") meta(name="twitter:creator", content="@freecodecamp") -meta(name="twitter:url", content="http://www.freecodecamp.com") +meta(name="twitter:url", content="http://www.freecodecamp.org") meta(name="twitter:site", content="@freecodecamp") meta(name="twitter:card", content="summary_large_image") meta(name="twitter:image:src", content="https://s3.amazonaws.com/freecodecamp/curriculum-diagram-full.jpg") diff --git a/server/views/partials/navbar.jade b/server/views/partials/navbar.jade index 78f4834bef..3b2f057df8 100644 --- a/server/views/partials/navbar.jade +++ b/server/views/partials/navbar.jade @@ -12,7 +12,7 @@ nav.navbar.navbar-default.navbar-fixed-top.nav-height li.visible-xs a(href='/map') Map li - a(href='https://forum.freecodecamp.com', target='_blank') Forum + a(href='https://forum.freecodecamp.org', target='_blank') Forum li a(href='/about', target='_blank') About li diff --git a/server/views/resources/about.jade b/server/views/resources/about.jade index bb9835933d..c334010250 100644 --- a/server/views/resources/about.jade +++ b/server/views/resources/about.jade @@ -52,7 +52,7 @@ block content td.text-center i.fa.fa-medium td - a(href='//medium.freecodecamp.com', target='_blank') Our Medium publication + a(href='//medium.freecodecamp.org', target='_blank') Our Medium publication tr td.text-center i.fa.fa-youtube @@ -173,7 +173,7 @@ block content tr td Support td - a(href='mailto:team@freecodecamp.com') team@freecodecamp.com + a(href='mailto:team@freecodecamp.org') team@freecodecamp.org tr td Facebook page td diff --git a/server/views/resources/academic-honesty.jade b/server/views/resources/academic-honesty.jade index e903b42a6c..388afbf5e5 100644 --- a/server/views/resources/academic-honesty.jade +++ b/server/views/resources/academic-honesty.jade @@ -10,4 +10,4 @@ block content

"Aside from using open source libraries such as jQuery and Bootstrap, and short snippets of code which are clearly attributed to their original author, 100% of the code in my projects was written by me, or along with another camper with whom I was pair programming in real time.

"I pledge that I did not plagiarize any of my Free Code Camp work. I understand that Free Code Camp’s team will audit my projects to confirm this."

In the situations where we discover instances of unambiguous plagiarism, we will replace the camper in question’s certification with a message that "Upon review, this account has been flagged for academic dishonesty."

-

As an academic institution that grants achievement-based certifications, we take academic honesty very seriously. If you have any questions about this policy, or suspect that someone has violated it, you can email team@freecodecamp.com and we will investigate.

\ No newline at end of file +

As an academic institution that grants achievement-based certifications, we take academic honesty very seriously. If you have any questions about this policy, or suspect that someone has violated it, you can email team@freecodecamp.org and we will investigate.

diff --git a/server/views/resources/code-of-conduct.jade b/server/views/resources/code-of-conduct.jade index 88f51fee9e..efc54e4e5f 100644 --- a/server/views/resources/code-of-conduct.jade +++ b/server/views/resources/code-of-conduct.jade @@ -16,5 +16,5 @@ block content p Also, no bots are allowed in our chat rooms or on our forum without prior written permission from   a(href='https://gitter.im/FreeCodeCamp/CoreTeam' target="_blank") Free Code Camp's Core Team. p If you have questions about this code of conduct, email us at  - a(href='mailto:team@freecodecamp.com') team@freecodecamp.com + a(href='mailto:team@freecodecamp.org') team@freecodecamp.org | . diff --git a/server/views/resources/how-nonprofit-projects-work.jade b/server/views/resources/how-nonprofit-projects-work.jade index f2cabcb19a..145ea425b1 100644 --- a/server/views/resources/how-nonprofit-projects-work.jade +++ b/server/views/resources/how-nonprofit-projects-work.jade @@ -16,7 +16,7 @@ block content li Prior coding experience (we’d like both campers to be able to contribute equally) p We don't take age or gender into account. This will provide you with valuable experience in meshing with diverse teams, which is a reality of the contemporary workplace. p Then, you’ll email  - a(href="mailto:team@freecodecamp.com") team@freecodecamp.com + a(href="mailto:team@freecodecamp.org") team@freecodecamp.org |  with: ol li Names diff --git a/server/views/resources/privacy.jade b/server/views/resources/privacy.jade index 93a732c6c4..1bafdf2685 100644 --- a/server/views/resources/privacy.jade +++ b/server/views/resources/privacy.jade @@ -12,13 +12,13 @@ block content
  • We don’t store personal information on our servers unless required for the on-going operation of one of our services.
  • We aim to make it as simple as possible for you to control what’s visible to the public, seen by search engines, kept private, and permanently deleted. Below is our privacy policy which incorporates these goals
    • -

    If you have questions about deleting or correcting your personal data please email us at team@freecodecamp.com

    -

    Free Code Camp Inc. (“Free Code Camp”) operates several websites including FreeCodeCamp.com. It is Free Code Camp’s policy to respect your privacy regarding any information we may collect while operating our websites.

    +

    If you have questions about deleting or correcting your personal data please email us at team@freecodecamp.org

    +

    Free Code Camp Inc. (“Free Code Camp”) operates several websites including freecodecamp.org. It is Free Code Camp’s policy to respect your privacy regarding any information we may collect while operating our websites.

    Website Visitors

    Like most website operators, Free Code Camp collects non-personally-identifying information of the sort that web browsers and servers typically make available, such as the browser type, language preference, referring site, and the date and time of each visitor request. Free Code Camp’s purpose in collecting non-personally identifying information is to better understand how Free Code Camp’s visitors use its website. From time to time, Free Code Camp may release non-personally-identifying information in the aggregate, e.g., by publishing a report on trends in the usage of its website.

    -

    Free Code Camp also collects potentially personally-identifying information like Internet Protocol (IP) addresses for logged in users and for users leaving comments on FreeCodeCamp.com blogs. Free Code Camp only discloses logged in user and commenter IP addresses under the same circumstances that it uses and discloses personally-identifying information as described below, except that blog commenter IP addresses and email addresses are visible and disclosed to the administrators of the blog where the comment was left.

    +

    Free Code Camp also collects potentially personally-identifying information like Internet Protocol (IP) addresses for logged in users and for users leaving comments on freecodecamp.org blogs. Free Code Camp only discloses logged in user and commenter IP addresses under the same circumstances that it uses and discloses personally-identifying information as described below, except that blog commenter IP addresses and email addresses are visible and disclosed to the administrators of the blog where the comment was left.

    Gathering of Personally-Identifying Information

    -

    Many visitors to Free Code Camp’s websites choose to interact with Free Code Camp in ways that require Free Code Camp to gather personally-identifying information. The amount and type of information that Free Code Camp gathers depends on the nature of the interaction. For example, we ask visitors who create an account for tracking their progress at FreeCodeCamp.com to provide either an email address or sign in with a social media oauth service like GitHub. Those who engage in transactions with Free Code Camp – by placing job ads, for example – are asked to provide additional information, including as necessary the personal and financial information required to process those transactions. In each case, Free Code Camp collects such information only insofar as is necessary or appropriate to fulfill the purpose of the visitor’s interaction with Free Code Camp. Free Code Camp does not disclose personally-identifying information other than as described below. And visitors can always refuse to supply personally-identifying information, with the caveat that it may prevent them from engaging in certain website-related activities.

    +

    Many visitors to Free Code Camp’s websites choose to interact with Free Code Camp in ways that require Free Code Camp to gather personally-identifying information. The amount and type of information that Free Code Camp gathers depends on the nature of the interaction. For example, we ask visitors who create an account for tracking their progress at freecodecamp.org to provide either an email address or sign in with a social media oauth service like GitHub. Those who engage in transactions with Free Code Camp – by placing job ads, for example – are asked to provide additional information, including as necessary the personal and financial information required to process those transactions. In each case, Free Code Camp collects such information only insofar as is necessary or appropriate to fulfill the purpose of the visitor’s interaction with Free Code Camp. Free Code Camp does not disclose personally-identifying information other than as described below. And visitors can always refuse to supply personally-identifying information, with the caveat that it may prevent them from engaging in certain website-related activities.

    Aggregated Statistics

    Free Code Camp may collect statistics about the behavior of visitors to its websites. For instance, Free Code Camp may monitor the accounts to try and identify spammers. Free Code Camp may display this information publicly or provide it to others. However, Free Code Camp does not disclose personally-identifying information other than as described below.

    Protection of Certain Personally-Identifying Information

    @@ -30,5 +30,5 @@ block content

    Ads

    If in the future we show ads, ads appearing on any of our websites may be delivered to users by advertising partners, who may set cookies. These cookies allow the ad server to recognize your computer each time they send you an online advertisement to compile information about you or others who use your computer. This information allows ad networks to, among other things, deliver targeted advertisements that they believe will be of most interest to you. This Privacy Policy covers the use of cookies by Free Code Camp and does not cover the use of cookies by any advertisers.

    Privacy Policy Changes

    -

    Although most changes are likely to be minor, Free Code Camp may change its Privacy Policy from time to time, and in Free Code Camp’s sole discretion. Free Code Camp encourages visitors to frequently check this page for any changes to its Privacy Policy. If you have a FreeCodeCamp.com account, you should also check your blog’s dashboard for alerts to these changes. Your continued use of this site after any change in this Privacy Policy will constitute your acceptance of such change.

    -

    This privacy policy is adopted from the Automattic (Free Code Camp) open source terms and are subject to the Creative Commons Attribution-ShareAlike 4.0 International license. We thank them for making this available.

    +

    Although most changes are likely to be minor, Free Code Camp may change its Privacy Policy from time to time, and in Free Code Camp’s sole discretion. Free Code Camp encourages visitors to frequently check this page for any changes to its Privacy Policy. If you have a freecodecamp.org account, you should also check your blog’s dashboard for alerts to these changes. Your continued use of this site after any change in this Privacy Policy will constitute your acceptance of such change.

    +

    This privacy policy is adopted from the Automattic (Free Code Camp) open source terms and are subject to the Creative Commons Attribution-ShareAlike 4.0 International license. We thank them for making this available.

    diff --git a/server/views/resources/sitemap.jade b/server/views/resources/sitemap.jade index d00bdf5d9b..bb180ca30b 100644 --- a/server/views/resources/sitemap.jade +++ b/server/views/resources/sitemap.jade @@ -2,55 +2,55 @@ doctype xml urlset(xmlns="http://www.sitemaps.org/schemas/sitemap/0.9") url - loc http://www.freecodecamp.com/ + loc http://www.freecodecamp.org/ changefreq weekly lastmod= now priority= 0.9 url - loc http://www.freecodecamp.com/nonprofits + loc http://www.freecodecamp.org/nonprofits changefreq weekly lastmod= now priority= 0.9 url - loc http://www.freecodecamp.com/donate + loc http://www.freecodecamp.org/donate changefreq monthly lastmod= now priority= 0.9 url - loc http://www.freecodecamp.com/shop + loc http://www.freecodecamp.org/shop changefreq monthly lastmod= now priority= 0.9 url - loc http://www.freecodecamp.com/pmi-acp-agile-project-managers + loc http://www.freecodecamp.org/pmi-acp-agile-project-managers changefreq weekly lastmod= now priority= 0.9 url - loc http://www.freecodecamp.com/map + loc http://www.freecodecamp.org/map changefreq weekly lastmod= now priority= 0.9 url - loc http://www.freecodecamp.com/coding-bootcamp-cost-calculator + loc http://www.freecodecamp.org/coding-bootcamp-cost-calculator changefreq monthly lastmod= now priority= 0.9 url - loc http://www.freecodecamp.com/hour-of-code + loc http://www.freecodecamp.org/hour-of-code changefreq monthly lastmod= now priority= 0.9 url - loc http://www.freecodecamp.com/code-of-conduct + loc http://www.freecodecamp.org/code-of-conduct changefreq monthly lastmod= now priority= 0.9 diff --git a/server/views/resources/terms-of-service.jade b/server/views/resources/terms-of-service.jade index cf639bf511..d16329d720 100644 --- a/server/views/resources/terms-of-service.jade +++ b/server/views/resources/terms-of-service.jade @@ -5,27 +5,27 @@ block content

    Terms of Service

    The gist:

    -

    We (the folks that run Free Code Camp's open source community) would love for you to use it. Our community is free, and our service is designed to give you as much control and ownership over the code you write as possible, and encourage you to express yourself freely. However, be responsible in what you publish. In particular, make sure that none of the prohibited items (like spam, viruses, or serious threats of violence) appear on your website. If you find anything on Free Code Camp that you believe violates these Terms of Service, please email us at team@freecodecamp.com

    +

    We (the folks that run Free Code Camp's open source community) would love for you to use it. Our community is free, and our service is designed to give you as much control and ownership over the code you write as possible, and encourage you to express yourself freely. However, be responsible in what you publish. In particular, make sure that none of the prohibited items (like spam, viruses, or serious threats of violence) appear on your website. If you find anything on Free Code Camp that you believe violates these Terms of Service, please email us at team@freecodecamp.org

    Terms of Service:

    -

    The following terms and conditions govern all use of the FreeCodeCamp.com website and all content, services, and products available at or through the website - taken together, our Services. Our Services are offered subject to your acceptance without modification of all of the terms and conditions contained herein and all other operating rules, policies (including, without limitation, Free Code Camp's Privacy Policy) and procedures that may be published from time to time by Free Code Camp (collectively, the “Agreement”). You agree that we may automatically upgrade our Services, and these terms will apply to any upgrades. Your agreement is with Free Code Camp Inc. Please read this Agreement carefully before accessing or using our Services. By accessing or using any part of our services, you agree to become bound by the terms and conditions of this agreement. If you do not agree to all the terms and conditions of this agreement, then you may not access or use any of our services. If these terms and conditions are considered an offer by Free Code Camp, acceptance is expressly limited to these terms. Our Services are not directed to children younger than 13, and access and use of our Services is only offered to users 13 years of age or older. If you are under 13 years old, please do not register to use our Services. Any person who registers as a user or provides their personal information to our Services represents that they are 13 years of age or older. Use of some aspects of our Services may require a FreeCodeCamp.com account. You agree to provide us with complete and accurate information when you register for an account. You will be solely responsible and liable for any activity that occurs under your username. You are responsible for keeping your password secure.

    -

    1. FreeCodeCamp.com.

    +

    The following terms and conditions govern all use of the freecodecamp.org website and all content, services, and products available at or through the website - taken together, our Services. Our Services are offered subject to your acceptance without modification of all of the terms and conditions contained herein and all other operating rules, policies (including, without limitation, Free Code Camp's Privacy Policy) and procedures that may be published from time to time by Free Code Camp (collectively, the “Agreement”). You agree that we may automatically upgrade our Services, and these terms will apply to any upgrades. Your agreement is with Free Code Camp Inc. Please read this Agreement carefully before accessing or using our Services. By accessing or using any part of our services, you agree to become bound by the terms and conditions of this agreement. If you do not agree to all the terms and conditions of this agreement, then you may not access or use any of our services. If these terms and conditions are considered an offer by Free Code Camp, acceptance is expressly limited to these terms. Our Services are not directed to children younger than 13, and access and use of our Services is only offered to users 13 years of age or older. If you are under 13 years old, please do not register to use our Services. Any person who registers as a user or provides their personal information to our Services represents that they are 13 years of age or older. Use of some aspects of our Services may require a freecodecamp.org account. You agree to provide us with complete and accurate information when you register for an account. You will be solely responsible and liable for any activity that occurs under your username. You are responsible for keeping your password secure.

    +

    1. freecodecamp.org.

      -
    • Your FreeCodeCamp.com Account and Website. If you create a website on FreeCodeCamp.com, you are responsible for maintaining the security of your account and website, and you are fully responsible for all activities that occur under the account and any other actions taken in connection with the website. You must immediately notify Free Code Camp of any unauthorized uses of your website, your account, or any other breaches of security. Free Code Camp will not be liable for any acts or omissions by you, including any damages of any kind incurred as a result of such acts or omissions.
      • -
    • Responsibility of Contributors. If you operate a website, comment on a website, post material to FreeCodeCamp.com, post links on FreeCodeCamp.com, or otherwise make (or allow any third party to make) material available (any such material, “Content”), you are entirely responsible for the content of, and any harm resulting from, that Content or your conduct. That is the case regardless of what form the Content takes, which includes, but is not limited to text, photo, video, audio, or code. By using FreeCodeCamp.com, you represent and warrant that your Content and conduct do not violate these terms or the Code of Conduct. By submitting Content to Free Code Camp for inclusion on your website, you grant Free Code Camp a world-wide, royalty-free, and non-exclusive license to reproduce, modify, adapt and publish the Content solely for the purpose of displaying, distributing, and promoting your website. This license allows Free Code Camp to make publicly-posted content available to third parties selected by Free Code Camp (through the Free Code Camp Firehose, for example) so that these third parties can analyze and distribute (but not publicly display) your content through their services. You also give other FreeCodeCamp.com users permission to share your Content on other FreeCodeCamp.com websites and add their own Content to it (aka to reblog your Content), so long as they use only a portion of your post and they give you credit as the original author by linking back to your website. If you delete Content, Free Code Camp will use reasonable efforts to remove it from FreeCodeCamp.com, but you acknowledge that caching or references to the Content may not be made immediately unavailable. Without limiting any of those representations or warranties, Free Code Camp has the right (though not the obligation) to, in Free Code Camp’s sole discretion, (i) refuse or remove any content that, in Free Code Camp’s reasonable opinion, violates any Free Code Camp policy or is in any way harmful or objectionable, or (ii) terminate or deny access to and use of FreeCodeCamp.com to any individual or entity for any reason. Free Code Camp will have no obligation to provide a refund of any amounts previously paid.
      • -
    • Attribution. Free Code Camp reserves the right to display attribution links such as ‘Website at FreeCodeCamp.com,’ theme author, and font attribution in your website footer or toolbar.
      • +
    • Your freecodecamp.org Account and Website. If you create a website on freecodecamp.org, you are responsible for maintaining the security of your account and website, and you are fully responsible for all activities that occur under the account and any other actions taken in connection with the website. You must immediately notify Free Code Camp of any unauthorized uses of your website, your account, or any other breaches of security. Free Code Camp will not be liable for any acts or omissions by you, including any damages of any kind incurred as a result of such acts or omissions.
      • +
    • Responsibility of Contributors. If you operate a website, comment on a website, post material to freecodecamp.org, post links on freecodecamp.org, or otherwise make (or allow any third party to make) material available (any such material, “Content”), you are entirely responsible for the content of, and any harm resulting from, that Content or your conduct. That is the case regardless of what form the Content takes, which includes, but is not limited to text, photo, video, audio, or code. By using freecodecamp.org, you represent and warrant that your Content and conduct do not violate these terms or the Code of Conduct. By submitting Content to Free Code Camp for inclusion on your website, you grant Free Code Camp a world-wide, royalty-free, and non-exclusive license to reproduce, modify, adapt and publish the Content solely for the purpose of displaying, distributing, and promoting your website. This license allows Free Code Camp to make publicly-posted content available to third parties selected by Free Code Camp (through the Free Code Camp Firehose, for example) so that these third parties can analyze and distribute (but not publicly display) your content through their services. You also give other freecodecamp.org users permission to share your Content on other freecodecamp.org websites and add their own Content to it (aka to reblog your Content), so long as they use only a portion of your post and they give you credit as the original author by linking back to your website. If you delete Content, Free Code Camp will use reasonable efforts to remove it from freecodecamp.org, but you acknowledge that caching or references to the Content may not be made immediately unavailable. Without limiting any of those representations or warranties, Free Code Camp has the right (though not the obligation) to, in Free Code Camp’s sole discretion, (i) refuse or remove any content that, in Free Code Camp’s reasonable opinion, violates any Free Code Camp policy or is in any way harmful or objectionable, or (ii) terminate or deny access to and use of freecodecamp.org to any individual or entity for any reason. Free Code Camp will have no obligation to provide a refund of any amounts previously paid.
      • +
    • Attribution. Free Code Camp reserves the right to display attribution links such as ‘Website at freecodecamp.org,’ theme author, and font attribution in your website footer or toolbar.

    4. Responsibility of Visitors.

    Free Code Camp has not reviewed, and cannot review, all of the material, including computer software, posted to our Services, and cannot therefore be responsible for that material’s content, use or effects. By operating our Services, Free Code Camp does not represent or imply that it endorses the material there posted, or that it believes such material to be accurate, useful, or non-harmful. You are responsible for taking precautions as necessary to protect yourself and your computer systems from viruses, worms, Trojan horses, and other harmful or destructive content. Our Services may contain content that is offensive, indecent, or otherwise objectionable, as well as content containing technical inaccuracies, typographical mistakes, and other errors. Our Services may also contain material that violates the privacy or publicity rights, or infringes the intellectual property and other proprietary rights, of third parties, or the downloading, copying or use of which is subject to additional terms and conditions, stated or unstated. Free Code Camp disclaims any responsibility for any harm resulting from the use by visitors of our Services, or from any downloading by those visitors of content there posted.

    5. Content Posted on Other Websites.

    -

    We have not reviewed, and cannot review, all of the material, including computer software, made available through the websites and webpages to which FreeCodeCamp.com links, and that link to FreeCodeCamp.com. Free Code Camp does not have any control over those non-FreeCodeCamp.com websites, and is not responsible for their contents or their use. By linking to a non-FreeCodeCamp.com website, Free Code Camp does not represent or imply that it endorses such website. You are responsible for taking precautions as necessary to protect yourself and your computer systems from viruses, worms, Trojan horses, and other harmful or destructive content. Free Code Camp disclaims any responsibility for any harm resulting from your use of non-FreeCodeCamp.com websites and webpages.

    +

    We have not reviewed, and cannot review, all of the material, including computer software, made available through the websites and webpages to which freecodecamp.org links, and that link to freecodecamp.org. Free Code Camp does not have any control over those non-freecodecamp.org websites, and is not responsible for their contents or their use. By linking to a non-freecodecamp.org website, Free Code Camp does not represent or imply that it endorses such website. You are responsible for taking precautions as necessary to protect yourself and your computer systems from viruses, worms, Trojan horses, and other harmful or destructive content. Free Code Camp disclaims any responsibility for any harm resulting from your use of non-freecodecamp.org websites and webpages.

    6. Copyright Infringement and DMCA Policy.

    -

    As Free Code Camp asks others to respect its intellectual property rights, it respects the intellectual property rights of others. If you believe that material located on or linked to by FreeCodeCamp.com violates your copyright, you are encouraged to notify Free Code Camp in accordance with Free Code Camp’s Digital Millennium Copyright Act (“DMCA”) Policy. Free Code Camp will respond to all such notices, including as required or appropriate by removing the infringing material or disabling all links to the infringing material. Free Code Camp will terminate a visitor’s access to and use of the Website if, under appropriate circumstances, the visitor is determined to be a repeat infringer of the copyrights or other intellectual property rights of Free Code Camp or others.

    +

    As Free Code Camp asks others to respect its intellectual property rights, it respects the intellectual property rights of others. If you believe that material located on or linked to by freecodecamp.org violates your copyright, you are encouraged to notify Free Code Camp in accordance with Free Code Camp’s Digital Millennium Copyright Act (“DMCA”) Policy. Free Code Camp will respond to all such notices, including as required or appropriate by removing the infringing material or disabling all links to the infringing material. Free Code Camp will terminate a visitor’s access to and use of the Website if, under appropriate circumstances, the visitor is determined to be a repeat infringer of the copyrights or other intellectual property rights of Free Code Camp or others.

    7. Intellectual Property.

    -

    This Agreement does not transfer from Free Code Camp to you any Free Code Camp or third party intellectual property, and all right, title, and interest in and to such property will remain (as between the parties) solely with Free Code Camp. Free Code Camp, FreeCodeCamp.com, the FreeCodeCamp.com logo, and all other trademarks, service marks, graphics and logos used in connection with FreeCodeCamp.com or our Services, are trademarks or registered trademarks of Free Code Camp or Free Code Camp’s licensors. Other trademarks, service marks, graphics and logos used in connection with our Services may be the trademarks of other third parties. Your use of our Services grants you no right or license to reproduce or otherwise use any Free Code Camp or third-party trademarks.

    +

    This Agreement does not transfer from Free Code Camp to you any Free Code Camp or third party intellectual property, and all right, title, and interest in and to such property will remain (as between the parties) solely with Free Code Camp. Free Code Camp, freecodecamp.org, the freecodecamp.org logo, and all other trademarks, service marks, graphics and logos used in connection with freecodecamp.org or our Services, are trademarks or registered trademarks of Free Code Camp or Free Code Camp’s licensors. Other trademarks, service marks, graphics and logos used in connection with our Services may be the trademarks of other third parties. Your use of our Services grants you no right or license to reproduce or otherwise use any Free Code Camp or third-party trademarks.

    10. Changes.

    We are constantly updating our Services, and that means sometimes we have to change the legal terms under which our Services are offered. If we make changes that are material, we will let you know by posting on one of our websites, or by sending you an email or other communication before the changes take effect. The notice will designate a reasonable period of time after which the new terms will take effect. If you disagree with our changes, then you should stop using our Services within the designated notice period. Your continued use of our Services will be subject to the new terms. However, any dispute that arose before the changes shall be governed by the Terms (including the binding individual arbitration clause) that were in place when the dispute arose.

    11. Termination.

    -

    Free Code Camp may terminate your access to all or any part of our Services at any time, with or without cause, with or without notice, effective immediately. If you wish to terminate this Agreement or your FreeCodeCamp.com account (if you have one), you may simply discontinue using our Services. All provisions of this Agreement which by their nature should survive termination shall survive termination, including, without limitation, ownership provisions, warranty disclaimers, indemnity and limitations of liability.

    +

    Free Code Camp may terminate your access to all or any part of our Services at any time, with or without cause, with or without notice, effective immediately. If you wish to terminate this Agreement or your freecodecamp.org account (if you have one), you may simply discontinue using our Services. All provisions of this Agreement which by their nature should survive termination shall survive termination, including, without limitation, ownership provisions, warranty disclaimers, indemnity and limitations of liability.

    12. Disclaimer of Warranties.

    Our Services are provided “as is.” Free Code Camp and its suppliers and licensors hereby disclaim all warranties of any kind, express or implied, including, without limitation, the warranties of merchantability, fitness for a particular purpose and non-infringement. Neither Free Code Camp nor its suppliers and licensors, makes any warranty that our Services will be error free or that access thereto will be continuous or uninterrupted. If you’re actually reading this, we praise your diligence and concern. We'd be better off as a civilization if more people cared like you do. You understand that you download from, or otherwise obtain content or services through, our Services at your own discretion and risk.

    13. Limitation of Liability.

    @@ -40,4 +40,4 @@ block content

    These Terms of Service were originally written in English (US). We may translate these terms into other languages. In the event of a conflict between a translated version of these Terms of Service and the English version, the English version will control.

    18. Miscellaneous.

    This Agreement constitutes the entire agreement between Free Code Camp and you concerning the subject matter hereof, and they may only be modified by a written amendment signed by an authorized executive of Free Code Camp, or by the posting by Free Code Camp of a revised version. Except to the extent applicable law, if any, provides otherwise, this Agreement, any access to or use of our Services will be governed by the laws of the state of California, U.S.A., excluding its conflict of law provisions, and the proper venue for any disputes arising out of or relating to any of the same will be the state and federal courts located in San Francisco County, California. Except for claims for injunctive or equitable relief or claims regarding intellectual property rights (which may be brought in any competent court without the posting of a bond), any dispute arising under this Agreement shall be finally settled in accordance with the Comprehensive Arbitration Rules of the Judicial Arbitration and Mediation Service, Inc. (“JAMS”) by three arbitrators appointed in accordance with such Rules. The arbitration shall take place in San Francisco, California, in the English language and the arbitral decision may be enforced in any court. The prevailing party in any action or proceeding to enforce this Agreement shall be entitled to costs and attorneys’ fees. If any part of this Agreement is held invalid or unenforceable, that part will be construed to reflect the parties’ original intent, and the remaining portions will remain in full force and effect. A waiver by either party of any term or condition of this Agreement or any breach thereof, in any one instance, will not waive such term or condition or any subsequent breach thereof. You may assign your rights under this Agreement to any party that consents to, and agrees to be bound by, its terms and conditions; Free Code Camp may assign its rights under this Agreement without condition. This Agreement will be binding upon and will inure to the benefit of the parties, their successors and permitted assigns.

    -

    These terms are adopted from the Automattic (WordPress) open source terms and are subject to the Creative Commons Attribution-ShareAlike 4.0 International license. We thank them for making this available.

    +

    These terms are adopted from the Automattic (WordPress) open source terms and are subject to the Creative Commons Attribution-ShareAlike 4.0 International license. We thank them for making this available.